SweepStructure.h File Reference

Sweep line data structures useful for region-region matching. More...

#include <vector>
#include "../BBox.h"
#include "../../utils/Arena.h"
#include "SweepStructure.cc"

Go to the source code of this file.

Classes
struct	lsst::ap::match::detail::CartesianNode
struct	lsst::ap::match::detail::SphericalNode
class	lsst::ap::match::detail::SweepStructure< Node >
class	lsst::ap::match::detail::CartesianSweep< Region >
class	lsst::ap::match::detail::SphericalSweep< Region >

Namespaces
	lsst
	< multiple inclusion guard macro
	lsst::ap
	lsst::ap::match
	lsst::ap::match::detail

Enumerations
enum	lsst::ap::match::detail::Color { lsst::ap::match::detail::BLACK = 0, lsst::ap::match::detail::RED }

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

Detailed Description

Sweep line data structures useful for region-region matching.

Author

Serge Monkewitz

Definition in file SweepStructure.h.