LSST Applications 28.0.0,g1653933729+a8ce1bb630,g1a997c3884+a8ce1bb630,g28da252d5a+5bd70b7e6d,g2bbee38e9b+638fca75ac,g2bc492864f+638fca75ac,g3156d2b45e+07302053f8,g347aa1857d+638fca75ac,g35bb328faa+a8ce1bb630,g3a166c0a6a+638fca75ac,g3e281a1b8c+7bbb0b2507,g4005a62e65+17cd334064,g414038480c+5b5cd4fff3,g41af890bb2+4ffae9de63,g4e1a3235cc+0f1912dca3,g6249c6f860+3c3976f90c,g80478fca09+46aba80bd6,g82479be7b0+77990446f6,g858d7b2824+78ba4d1ce1,g89c8672015+f667a5183b,g9125e01d80+a8ce1bb630,ga5288a1d22+2a6264e9ca,gae0086650b+a8ce1bb630,gb58c049af0+d64f4d3760,gc22bb204ba+78ba4d1ce1,gc28159a63d+638fca75ac,gcf0d15dbbd+32ddb6096f,gd6b7c0dfd1+3e339405e9,gda3e153d99+78ba4d1ce1,gda6a2b7d83+32ddb6096f,gdaeeff99f8+1711a396fd,gdd5a9049c5+b18c39e5e3,ge2409df99d+a5e4577cdc,ge33fd446bb+78ba4d1ce1,ge79ae78c31+638fca75ac,gf0baf85859+64e8883e75,gf5289d68f6+e1b046a8d7,gfa443fc69c+91d9ed1ecf,gfda6b12a05+8419469a56
LSST Data Management Base Package
|
#include <algorithm>
#include <cmath>
#include <memory>
#include "lsst/pex/exceptions.h"
#include "lsst/log/Log.h"
#include "lsst/geom/Angle.h"
#include "lsst/afw/table/Match.h"
Go to the source code of this file.
Namespaces | |
namespace | lsst |
namespace | lsst::afw |
namespace | lsst::afw::table |
Macros | |
#define | LSST_MATCH_RADEC(RTYPE, C1, C2) |
#define | LSST_MATCH_RADEC(RTYPE, C) |
Functions | |
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, bool closest) |
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 SimpleMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, SimpleCatalog const &, lsst::geom::Angle, bool) |
template SimpleMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, SimpleCatalog const &, lsst::geom::Angle, MatchControl const &) |
template ReferenceMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, SourceCatalog const &, lsst::geom::Angle, bool) |
template ReferenceMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, SourceCatalog const &, lsst::geom::Angle, MatchControl const &) |
template SourceMatchVector | lsst::afw::table::matchRaDec (SourceCatalog const &, SourceCatalog const &, lsst::geom::Angle, bool) |
template SourceMatchVector | lsst::afw::table::matchRaDec (SourceCatalog const &, SourceCatalog const &, lsst::geom::Angle, MatchControl const &) |
template<typename Cat > | |
std::vector< Match< typename Cat::Record, typename Cat::Record > > | lsst::afw::table::matchRaDec (Cat const &cat, lsst::geom::Angle radius, bool symmetric) |
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 SimpleMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, lsst::geom::Angle, bool) |
template SimpleMatchVector | lsst::afw::table::matchRaDec (SimpleCatalog const &, lsst::geom::Angle, MatchControl const &) |
template SourceMatchVector | lsst::afw::table::matchRaDec (SourceCatalog const &, lsst::geom::Angle, bool) |
template SourceMatchVector | lsst::afw::table::matchRaDec (SourceCatalog const &, lsst::geom::Angle, MatchControl const &) |
SourceMatchVector | lsst::afw::table::matchXy (SourceCatalog const &cat1, SourceCatalog const &cat2, double radius, bool closest) |
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, bool symmetric) |
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 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 BaseCatalog | lsst::afw::table::packMatches (SimpleMatchVector const &) |
template BaseCatalog | lsst::afw::table::packMatches (ReferenceMatchVector const &) |
template BaseCatalog | lsst::afw::table::packMatches (SourceMatchVector const &) |
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. | |
template SimpleMatchVector | lsst::afw::table::unpackMatches (BaseCatalog const &, SimpleCatalog const &, SimpleCatalog const &) |
template ReferenceMatchVector | lsst::afw::table::unpackMatches (BaseCatalog const &, SimpleCatalog const &, SourceCatalog const &) |
template SourceMatchVector | lsst::afw::table::unpackMatches (BaseCatalog const &, SourceCatalog const &, SourceCatalog const &) |
#define LSST_MATCH_RADEC | ( | RTYPE, | |
C ) |
#define LSST_MATCH_RADEC | ( | RTYPE, | |
C1, | |||
C2 ) |
std::shared_ptr<RecordT> src |