LSST Applications
21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
LSST Data Management Base Package
|
Class to ensure constraints for spatial modeling. More...
#include <SpatialCell.h>
Public Types | |
using | CandidateList = std::vector< std::shared_ptr< SpatialCellCandidate > > |
using | iterator = SpatialCellCandidateIterator |
Public Member Functions | |
SpatialCell (std::string const &label, lsst::geom::Box2I const &bbox=lsst::geom::Box2I(), CandidateList const &candidateList=CandidateList()) | |
Constructor. More... | |
SpatialCell (SpatialCell const &)=default | |
SpatialCell (SpatialCell &&)=default | |
SpatialCell & | operator= (SpatialCell const &)=default |
SpatialCell & | operator= (SpatialCell &&)=default |
virtual | ~SpatialCell ()=default |
Destructor. More... | |
bool | empty () const |
Determine if cell has no usable candidates. More... | |
size_t | size () const |
Return number of usable candidates in Cell. More... | |
void | sortCandidates () |
Rearrange the candidates to reflect their current ratings. More... | |
SpatialCellCandidateIterator | begin () |
Return an iterator to the beginning of the Candidates. More... | |
SpatialCellCandidateIterator | begin (bool ignoreBad) |
SpatialCellCandidateIterator | end () |
Return an iterator to (one after) the end of the Candidates. More... | |
SpatialCellCandidateIterator | end (bool ignoreBad) |
void | insertCandidate (std::shared_ptr< SpatialCellCandidate > candidate) |
Add a candidate to the list, preserving ranking. More... | |
void | removeCandidate (std::shared_ptr< SpatialCellCandidate > candidate) |
Remove a candidate from the list. More... | |
void | setIgnoreBad (bool ignoreBad) |
Set whether we should omit BAD candidates from candidate list when traversing. More... | |
bool | getIgnoreBad () const |
Get whether we are omitting BAD candidates from candidate list when traversing. More... | |
std::shared_ptr< SpatialCellCandidate > | getCandidateById (int id, bool noThrow=false) |
Return the SpatialCellCandidate with the specified id. More... | |
std::string const & | getLabel () const |
Get SpatialCell's label. More... | |
lsst::geom::Box2I const & | getBBox () const |
Get SpatialCell's BBox. More... | |
void | visitCandidates (CandidateVisitor *visitor, int const nMaxPerCell=-1, bool const ignoreExceptions=false, bool const reset=true) |
Call the visitor's processCandidate method for each Candidate in the SpatialCell. More... | |
void | visitCandidates (CandidateVisitor *visitor, int const nMaxPerCell=-1, bool const ignoreExceptions=false, bool const reset=true) const |
Call the visitor's processCandidate method for each Candidate in the SpatialCell (const version) More... | |
void | visitAllCandidates (CandidateVisitor *visitor, bool const ignoreExceptions=false, bool const reset=true) |
Call the visitor's processCandidate method for every Candidate in the SpatialCell. More... | |
void | visitAllCandidates (CandidateVisitor *visitor, bool const ignoreExceptions=false, bool const reset=true) const |
Call the visitor's processCandidate method for each Candidate in the SpatialCell (const version) More... | |
Class to ensure constraints for spatial modeling.
A given image is divided up into cells, with each cell represented by an instance of this class. Each cell itself contains a list of instances of classes derived from SpatialCellCandidate. One class member from each cell will be chosen to fit to a spatial model. In case of a poor fit, the next class instance in the list will be fit for. If all instances in a list are rejected from the spatial model, the best one will be used.
Definition at line 223 of file SpatialCell.h.
using lsst::afw::math::SpatialCell::CandidateList = std::vector<std::shared_ptr<SpatialCellCandidate> > |
Definition at line 225 of file SpatialCell.h.
Definition at line 226 of file SpatialCell.h.
lsst::afw::math::SpatialCell::SpatialCell | ( | std::string const & | label, |
lsst::geom::Box2I const & | bbox = lsst::geom::Box2I() , |
||
CandidateList const & | candidateList = CandidateList() |
||
) |
Constructor.
label | string representing "name" of cell |
bbox | Bounding box of cell in overall image |
candidateList | list of candidates to represent this cell |
Definition at line 72 of file SpatialCell.cc.
|
default |
|
default |
|
virtualdefault |
Destructor.
|
inline |
Return an iterator to the beginning of the Candidates.
Definition at line 263 of file SpatialCell.h.
|
inline |
ignoreBad | If true, ignore BAD candidates |
Definition at line 266 of file SpatialCell.h.
bool lsst::afw::math::SpatialCell::empty | ( | ) | const |
Determine if cell has no usable candidates.
Definition at line 98 of file SpatialCell.cc.
|
inline |
Return an iterator to (one after) the end of the Candidates.
Definition at line 273 of file SpatialCell.h.
|
inline |
ignoreBad | If true, ignore BAD candidates |
Definition at line 276 of file SpatialCell.h.
|
inline |
std::shared_ptr< SpatialCellCandidate > lsst::afw::math::SpatialCell::getCandidateById | ( | int | id, |
bool | noThrow = false |
||
) |
Return the SpatialCellCandidate with the specified id.
id | The desired ID |
noThrow | Return NULL in case of error |
lsst::pex::exceptions::NotFoundError | if no candidate matches the id |
Definition at line 120 of file SpatialCell.cc.
|
inline |
Get whether we are omitting BAD candidates from candidate list when traversing.
Definition at line 296 of file SpatialCell.h.
|
inline |
void lsst::afw::math::SpatialCell::insertCandidate | ( | std::shared_ptr< SpatialCellCandidate > | candidate | ) |
Add a candidate to the list, preserving ranking.
Definition at line 82 of file SpatialCell.cc.
|
default |
|
default |
void lsst::afw::math::SpatialCell::removeCandidate | ( | std::shared_ptr< SpatialCellCandidate > | candidate | ) |
Remove a candidate from the list.
This is not a particularly efficient operation, since we're using a std::vector, but should not hurt too much if the number of candidates in a cell is small.
Definition at line 88 of file SpatialCell.cc.
|
inline |
Set whether we should omit BAD candidates from candidate list when traversing.
Definition at line 294 of file SpatialCell.h.
size_t lsst::afw::math::SpatialCell::size | ( | ) | const |
void lsst::afw::math::SpatialCell::sortCandidates | ( | ) |
void lsst::afw::math::SpatialCell::visitAllCandidates | ( | CandidateVisitor * | visitor, |
bool const | ignoreExceptions = false , |
||
bool const | reset = true |
||
) |
Call the visitor's processCandidate method for every Candidate in the SpatialCell.
visitor | Pass this object to every Candidate |
ignoreExceptions | Ignore any exceptions thrown by |
reset | Reset visitor before passing it around |
Definition at line 192 of file SpatialCell.cc.
void lsst::afw::math::SpatialCell::visitAllCandidates | ( | CandidateVisitor * | visitor, |
bool const | ignoreExceptions = false , |
||
bool const | reset = true |
||
) | const |
Call the visitor's processCandidate method for each Candidate in the SpatialCell (const version)
This is the const version of SpatialCellSet::visitAllCandidates
visitor | Pass this object to every Candidate |
ignoreExceptions | Ignore any exceptions thrown by the processing |
reset | Reset visitor before passing it around |
Definition at line 214 of file SpatialCell.cc.
void lsst::afw::math::SpatialCell::visitCandidates | ( | CandidateVisitor * | visitor, |
int const | nMaxPerCell = -1 , |
||
bool const | ignoreExceptions = false , |
||
bool const | reset = true |
||
) |
Call the visitor's processCandidate method for each Candidate in the SpatialCell.
visitor | Pass this object to every Candidate |
nMaxPerCell | Visit no more than this many Candidates (<= 0: all) |
ignoreExceptions | Ignore any exceptions thrown by the processing |
reset | Reset visitor before passing it around |
Definition at line 135 of file SpatialCell.cc.
void lsst::afw::math::SpatialCell::visitCandidates | ( | CandidateVisitor * | visitor, |
int const | nMaxPerCell = -1 , |
||
bool const | ignoreExceptions = false , |
||
bool const | reset = true |
||
) | const |
Call the visitor's processCandidate method for each Candidate in the SpatialCell (const version)
This is the const version of SpatialCellSet::visitCandidates
visitor | Pass this object to every Candidate |
nMaxPerCell | Visit no more than this many Candidates (-ve: all) |
ignoreExceptions | Ignore any exceptions thrown by the processing |
reset | Reset visitor before passing it around |
Definition at line 162 of file SpatialCell.cc.