LSST Applications g0fba68d861+849f694866,g1fd858c14a+7a7b9dd5ed,g2c84ff76c0+5cb23283cf,g30358e5240+f0e04ebe90,g35bb328faa+fcb1d3bbc8,g436fd98eb5+bdc6fcdd04,g4af146b050+742274f7cd,g4d2262a081+9d5bd0394b,g4e0f332c67+cb09b8a5b6,g53246c7159+fcb1d3bbc8,g5a012ec0e7+477f9c599b,g60b5630c4e+bdc6fcdd04,g67b6fd64d1+2218407a0c,g78460c75b0+2f9a1b4bcd,g786e29fd12+cf7ec2a62a,g7b71ed6315+fcb1d3bbc8,g87b7deb4dc+777438113c,g8852436030+ebf28f0d95,g89139ef638+2218407a0c,g9125e01d80+fcb1d3bbc8,g989de1cb63+2218407a0c,g9f33ca652e+42fb53f4c8,g9f7030ddb1+11b9b6f027,ga2b97cdc51+bdc6fcdd04,gab72ac2889+bdc6fcdd04,gabe3b4be73+1e0a283bba,gabf8522325+3210f02652,gb1101e3267+9c79701da9,gb58c049af0+f03b321e39,gb89ab40317+2218407a0c,gcf25f946ba+ebf28f0d95,gd6cbbdb0b4+e8f9c9c900,gd9a9a58781+fcb1d3bbc8,gde0f65d7ad+47bbabaf80,gded526ad44+8c3210761e,ge278dab8ac+3ef3db156b,ge410e46f29+2218407a0c,gf67bdafdda+2218407a0c,v29.0.0.rc3
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 ) |