Match.h File Reference

#include <vector>
#include "lsst/pex/config.h"
#include "lsst/afw/table/fwd.h"
#include "lsst/afw/table/BaseRecord.h"
#include "lsst/afw/table/Simple.h"
#include "lsst/afw/table/Source.h"
#include "lsst/afw/table/Catalog.h"
#include "lsst/afw/geom/Angle.h"

Go to the source code of this file.

Classes
class	lsst::afw.table::MatchControl
	Pass parameters to algorithms that match list of sources. More...
struct	lsst::afw.table::Match< Record1, Record2 >
	Lightweight representation of a geometric match between two records. More...

Namespaces
	lsst
	Remove all non-astronomical counts from the Chunk Exposure's pixels.
	lsst::afw
	lsst.afw.table

Functions
SourceMatchVector	lsst.afw.table::matchXy (SourceCatalog const &cat1, SourceCatalog const &cat2, double radius, MatchControl const &mc=MatchControl())
	Compute all tuples (s1,s2,d) where s1 belings to cat1, s2 belongs to cat2 and d, the distance between s1 and s2, in pixels, is at most radius. More...
SourceMatchVector	lsst.afw.table::matchXy (SourceCatalog const &cat, double radius, MatchControl const &mc=MatchControl())
	Compute all tuples (s1,s2,d) where s1 != s2, s1 and s2 both belong to cat, and d, the distance between s1 and s2, in pixels, is at most radius. More...
SourceMatchVector	lsst.afw.table::matchXy (SourceCatalog const &cat1, SourceCatalog const &cat2, double radius, bool closest)
	Compute all tuples (s1,s2,d) where s1 belings to cat1, s2 belongs to cat2 and d, the distance between s1 and s2, in pixels, is at most radius. More...
SourceMatchVector	lsst.afw.table::matchXy (SourceCatalog const &cat, double radius, bool symmetric)
	Compute all tuples (s1,s2,d) where s1 != s2, s1 and s2 both belong to cat, and d, the distance between s1 and s2, in pixels, is at most radius. More...
template<typename Cat1 , typename Cat2 >
std::vector< Match< typename Cat1::Record, typename Cat2::Record > >	lsst.afw.table::matchRaDec (Cat1 const &cat1, Cat2 const &cat2, Angle radius, MatchControl const &mc=MatchControl())
	Compute all tuples (s1,s2,d) where s1 belings to cat1, s2 belongs to cat2 and d, the distance between s1 and s2, is at most radius. More...
template<typename Cat >
std::vector< Match< typename Cat::Record, typename Cat::Record > >	lsst.afw.table::matchRaDec (Cat const &cat, Angle radius, MatchControl const &mc=MatchControl())
template<typename Cat1 , typename Cat2 >
std::vector< Match< typename Cat1::Record, typename Cat2::Record > >	lsst.afw.table::matchRaDec (Cat1 const &cat1, Cat2 const &cat2, Angle radius, bool closest)
	Compute all tuples (s1,s2,d) where s1 belings to cat1, s2 belongs to cat2 and d, the distance between s1 and s2, is at most radius. More...
template<typename Cat >
std::vector< Match< typename Cat::Record, typename Cat::Record > >	lsst.afw.table::matchRaDec (Cat const &cat, Angle radius, bool symmetric)
template<typename Record1 , typename Record2 >
BaseCatalog	lsst.afw.table::packMatches (std::vector< Match< Record1, Record2 > > const &matches)
	Return a table representation of a MatchVector that can be used to persist it. More...
template<typename Cat1 , typename Cat2 >
std::vector< Match< typename Cat1::Record, typename Cat2::Record > >	lsst.afw.table::unpackMatches (BaseCatalog const &matches, Cat1 const &cat1, Cat2 const &cat2)
	Reconstruct a MatchVector from a BaseCatalog representation of the matches and a pair of catalogs. More...