LSST Applications g034a557a3c+dd8dd8f11d,g0afe43252f+b86e4b8053,g11f7dcd041+017865fdd3,g1cd03abf6b+8446defddb,g1ce3e0751c+f991eae79d,g28da252d5a+ca8a1a9fb3,g2bbee38e9b+b6588ad223,g2bc492864f+b6588ad223,g2cdde0e794+8523d0dbb4,g347aa1857d+b6588ad223,g35bb328faa+b86e4b8053,g3a166c0a6a+b6588ad223,g461a3dce89+b86e4b8053,g52b1c1532d+b86e4b8053,g7f3b0d46df+ad13c1b82d,g80478fca09+f29c5d6c70,g858d7b2824+293f439f82,g8cd86fa7b1+af721d2595,g965a9036f2+293f439f82,g979bb04a14+51ed57f74c,g9ddcbc5298+f24b38b85a,gae0086650b+b86e4b8053,gbb886bcc26+b97e247655,gc28159a63d+b6588ad223,gc30aee3386+a2f0f6cab9,gcaf7e4fdec+293f439f82,gcd45df26be+293f439f82,gcdd4ae20e8+70b5def7e6,gce08ada175+da9c58a417,gcf0d15dbbd+70b5def7e6,gdaeeff99f8+006e14e809,gdbce86181e+6a170ce272,ge3d4d395c2+224150c836,ge5f7162a3a+bb2241c923,ge6cb8fbbf7+d119aed356,ge79ae78c31+b6588ad223,gf048a9a2f4+40ffced2b8,gf0baf85859+b4cca3d10f,w.2024.30
LSST Data Management Base Package
|
An iterator that only returns usable members of the SpatialCell. More...
#include <SpatialCell.h>
Public Member Functions | |
void | operator++ () |
Advance the iterator, maybe skipping over candidates labelled BAD. | |
size_t | operator- (SpatialCellCandidateIterator const &rhs) const |
Return the number of candidate between this and rhs. | |
std::shared_ptr< SpatialCellCandidate const > | operator* () const |
Dereference the iterator to return the Candidate (if there is one) | |
std::shared_ptr< SpatialCellCandidate > | operator* () |
Return the std::shared_ptr<CellCandidate> | |
bool | operator== (SpatialCellCandidateIterator const &rhs) const |
Are two SpatialCellCandidateIterators equal? | |
bool | operator!= (SpatialCellCandidateIterator const &rhs) const |
Are two SpatialCellCandidateIterators unequal? | |
Protected Member Functions | |
SpatialCellCandidateIterator (CandidateList::iterator iterator, CandidateList::iterator end, bool ignoreBad) | |
ctor; designed to be used to pass begin to SpatialCellCandidateIterator | |
SpatialCellCandidateIterator (CandidateList::iterator iterator, CandidateList::iterator end, bool ignoreBad, bool) | |
ctor; designed to be used to pass end to SpatialCellCandidateIterator | |
Friends | |
class | SpatialCell |
An iterator that only returns usable members of the SpatialCell.
Definition at line 159 of file SpatialCell.h.
|
protected |
ctor; designed to be used to pass begin to SpatialCellCandidateIterator
iterator | Where this iterator should start |
end | One-past-the-end of iterator's range |
ignoreBad | Should we pass over bad Candidates? |
Definition at line 239 of file SpatialCell.cc.
|
protected |
ctor; designed to be used to pass end to SpatialCellCandidateIterator
iterator | start of of iterator's range; not used |
end | Where this iterator should start |
ignoreBad | Should we pass over bad Candidates? |
Definition at line 251 of file SpatialCell.cc.
|
inline |
Are two SpatialCellCandidateIterators unequal?
Definition at line 186 of file SpatialCell.h.
std::shared_ptr< SpatialCellCandidate > lsst::afw::math::SpatialCellCandidateIterator::operator* | ( | ) |
Return the std::shared_ptr<CellCandidate>
Definition at line 293 of file SpatialCell.cc.
std::shared_ptr< SpatialCellCandidate const > lsst::afw::math::SpatialCellCandidateIterator::operator* | ( | ) | const |
Dereference the iterator to return the Candidate (if there is one)
lsst::pex::exceptions::NotFoundError | if no candidate is available |
Definition at line 285 of file SpatialCell.cc.
void lsst::afw::math::SpatialCellCandidateIterator::operator++ | ( | ) |
Advance the iterator, maybe skipping over candidates labelled BAD.
Definition at line 260 of file SpatialCell.cc.
size_t lsst::afw::math::SpatialCellCandidateIterator::operator- | ( | SpatialCellCandidateIterator const & | rhs | ) | const |
Return the number of candidate between this and rhs.
Definition at line 274 of file SpatialCell.cc.
|
inline |
Are two SpatialCellCandidateIterators equal?
Definition at line 184 of file SpatialCell.h.
|
friend |
Definition at line 160 of file SpatialCell.h.