lsst::ap::match::detail Namespace Reference

Classes
struct	CartesianNode
struct	SphericalNode
class	SweepStructure
class	CartesianSweep
class	SphericalSweep

Enumerations
enum	Color { BLACK = 0, RED }

Functions
bool	lessThan (CartesianNode const *a, CartesianNode const *b)
bool	operator< (std::pair< double, CartesianNode * > const &n1, std::pair< double, CartesianNode * > const &n2)
bool	lessThan (SphericalNode const *a, SphericalNode const *b)
bool	operator< (std::pair< double, SphericalNode * > const &left, std::pair< double, SphericalNode * > const &right)

Enumeration Type Documentation

enum lsst::ap::match::detail::Color

Nodes in an interval tree are either red or black.

Enumerator
BLACK
RED

Definition at line 46 of file SweepStructure.h.

           {
    BLACK = 0, RED
};

Function Documentation

bool lsst::ap::match::detail::lessThan ( CartesianNode const *  a, CartesianNode const *  b  )

inline

Orders tree nodes by minimum coordinate-0 (x) value, using the addresses of embedded BBox instances to break ties.

Definition at line 87 of file SweepStructure.cc.

                                                                     {
    return (a->minCoord0 == b->minCoord0) ?
           a->bbox < b->bbox : a->minCoord0 < b->minCoord0;
}

bool lsst::ap::match::detail::lessThan ( SphericalNode const *  a, SphericalNode const *  b  )

inline

Orders tree nodes by minimum coordinate-0 (longitude/right-ascension) value, using the addresses of embedded BBox instances to break ties.

Definition at line 156 of file SweepStructure.cc.

                                                                     {
    return (a->minCoord0 == b->minCoord0) ?
           a->bbox < b->bbox : a->minCoord0 < b->minCoord0;
}

bool lsst::ap::match::detail::operator< ( std::pair< double, CartesianNode * > const &  n1, std::pair< double, CartesianNode * > const &  n2  )

inline

Definition at line 92 of file SweepStructure.cc.

{
    return n1.first > n2.first;
}

bool lsst::ap::match::detail::operator< ( std::pair< double, SphericalNode * > const &  left, std::pair< double, SphericalNode * > const &  right  )

inline

Definition at line 161 of file SweepStructure.cc.

{
    return left.first > right.first;
}