LSSTApplications  11.0-13-gbb96280,12.1.rc1,12.1.rc1+1,12.1.rc1+2,12.1.rc1+5,12.1.rc1+8,12.1.rc1-1-g06d7636+1,12.1.rc1-1-g253890b+5,12.1.rc1-1-g3d31b68+7,12.1.rc1-1-g3db6b75+1,12.1.rc1-1-g5c1385a+3,12.1.rc1-1-g83b2247,12.1.rc1-1-g90cb4cf+6,12.1.rc1-1-g91da24b+3,12.1.rc1-2-g3521f8a,12.1.rc1-2-g39433dd+4,12.1.rc1-2-g486411b+2,12.1.rc1-2-g4c2be76,12.1.rc1-2-gc9c0491,12.1.rc1-2-gda2cd4f+6,12.1.rc1-3-g3391c73+2,12.1.rc1-3-g8c1bd6c+1,12.1.rc1-3-gcf4b6cb+2,12.1.rc1-4-g057223e+1,12.1.rc1-4-g19ed13b+2,12.1.rc1-4-g30492a7
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