LSSTApplications  1.1.2+25,10.0+13,10.0+132,10.0+133,10.0+224,10.0+41,10.0+8,10.0-1-g0f53050+14,10.0-1-g4b7b172+19,10.0-1-g61a5bae+98,10.0-1-g7408a83+3,10.0-1-gc1e0f5a+19,10.0-1-gdb4482e+14,10.0-11-g3947115+2,10.0-12-g8719d8b+2,10.0-15-ga3f480f+1,10.0-2-g4f67435,10.0-2-gcb4bc6c+26,10.0-28-gf7f57a9+1,10.0-3-g1bbe32c+14,10.0-3-g5b46d21,10.0-4-g027f45f+5,10.0-4-g86f66b5+2,10.0-4-gc4fccf3+24,10.0-40-g4349866+2,10.0-5-g766159b,10.0-5-gca2295e+25,10.0-6-g462a451+1
LSSTDataManagementBasePackage
PotentialStar.h
Go to the documentation of this file.
1 #ifndef MeasAlgoShapeletPotentialStar_H
2 #define MeasAlgoShapeletPotentialStar_H
3 
5 #include <string>
6 
7 namespace lsst {
8 namespace meas {
9 namespace algorithms {
10 namespace shapelet {
11 
12  class PotentialStar {
13 
14  public:
15  PotentialStar(Position pos, double mag, double size, long index,
16  const std::string& line) :
17  _pos(pos), _mag(mag), _size(size), _index(index), _line(line)
18  {}
19 
21 
22  const Position& getPos() const { return _pos; }
23 
24  double getMag() const { return _mag; }
25 
26  double getSize() const { return _size; }
27 
28  long getIndex() const { return _index; }
29 
30  const std::string& getLine() const { return _line; }
31 
32  void setSize(double newsize) { _size = newsize; }
33 
34  bool isBrighterThan(const PotentialStar* rhs) const
35  { return _mag < rhs->_mag; }
36 
37  bool isSmallerThan(const PotentialStar* rhs) const
38  { return _size < rhs->_size; }
39 
40  private:
41 
43  double _mag;
44  double _size;
45  long _index;
46  std::string _line;
47 
48  };
49 
50 }}}}
51 
52 #endif
53 
bool isBrighterThan(const PotentialStar *rhs) const
Definition: PotentialStar.h:34
bool isSmallerThan(const PotentialStar *rhs) const
Definition: PotentialStar.h:37
PotentialStar(Position pos, double mag, double size, long index, const std::string &line)
Definition: PotentialStar.h:15