LSSTApplications  1.1.2+25,10.0+13,10.0+132,10.0+133,10.0+224,10.0+41,10.0+8,10.0-1-g0f53050+14,10.0-1-g4b7b172+19,10.0-1-g61a5bae+98,10.0-1-g7408a83+3,10.0-1-gc1e0f5a+19,10.0-1-gdb4482e+14,10.0-11-g3947115+2,10.0-12-g8719d8b+2,10.0-15-ga3f480f+1,10.0-2-g4f67435,10.0-2-gcb4bc6c+26,10.0-28-gf7f57a9+1,10.0-3-g1bbe32c+14,10.0-3-g5b46d21,10.0-4-g027f45f+5,10.0-4-g86f66b5+2,10.0-4-gc4fccf3+24,10.0-40-g4349866+2,10.0-5-g766159b,10.0-5-gca2295e+25,10.0-6-g462a451+1
LSSTDataManagementBasePackage
Namespaces | Macros | Functions
SweepStructure.cc File Reference

Inline/templated sweep-line data structure method implementations. More...

#include "SweepStructure.h"
#include <math.h>
#include <climits>
#include <algorithm>
#include "lsst/pex/exceptions.h"
#include "lsst/afw/geom/Angle.h"
#include "../../utils/SpatialUtils.h"

Go to the source code of this file.

Namespaces

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

Macros

#define LSST_AP_MATCH_DETAIL_SWEEPSTRUCTURE_CC
 

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

Inline/templated sweep-line data structure method implementations.

Author
Serge Monkewitz

Definition in file SweepStructure.cc.

Macro Definition Documentation

#define LSST_AP_MATCH_DETAIL_SWEEPSTRUCTURE_CC

Definition at line 32 of file SweepStructure.cc.