LSST Applications g0fba68d861+5616995c1c,g1ebb85f214+2420ccdea7,g1fd858c14a+44c57a1f81,g21d47ad084+8e51fce9ac,g262e1987ae+1a7d68eb3b,g2cef7863aa+3bd8df3d95,g35bb328faa+fcb1d3bbc8,g36ff55ed5b+2420ccdea7,g47891489e3+5c6313fe9a,g53246c7159+fcb1d3bbc8,g646c943bdb+dbb9921566,g67b6fd64d1+5c6313fe9a,g6bd32b75b5+2420ccdea7,g74acd417e5+37fc0c974d,g786e29fd12+cf7ec2a62a,g86c591e316+6e13bcb9e9,g87389fa792+1e0a283bba,g89139ef638+5c6313fe9a,g90f42f885a+fce05a46d3,g9125e01d80+fcb1d3bbc8,g93e38de9ac+5345a64125,g95a1e89356+47d08a1cc6,g97be763408+bba861c665,ga9e4eb89a6+85210110a1,gb0b61e0e8e+1f27f70249,gb58c049af0+f03b321e39,gb89ab40317+5c6313fe9a,gc4e39d7843+4e09c98c3d,gd16ba4ae74+5402bcf54a,gd8ff7fe66e+2420ccdea7,gd9a9a58781+fcb1d3bbc8,gdab6d2f7ff+37fc0c974d,gde280f09ee+604b327636,ge278dab8ac+50e2446c94,ge410e46f29+5c6313fe9a,gef3c2e6661+6b480e0fb7,gf67bdafdda+5c6313fe9a,gffca2db377+fcb1d3bbc8,v29.2.0.rc1
LSST Data Management Base Package
|
#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/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 | |
namespace | lsst |
namespace | lsst::afw |
namespace | 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 . | |
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 . | |
template<typename Cat1, typename Cat2> | |
std::vector< Match< typename Cat1::Record, typename Cat2::Record > > | lsst::afw::table::matchRaDec (Cat1 const &cat1, Cat2 const &cat2, lsst::geom::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 . | |
template<typename Cat> | |
std::vector< Match< typename Cat::Record, typename Cat::Record > > | lsst::afw::table::matchRaDec (Cat const &cat, lsst::geom::Angle radius, MatchControl const &mc=MatchControl()) |
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. | |
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. | |