LSST Applications g04e9c324dd+8c5ae1fdc5,g134cb467dc+b203dec576,g18429d2f64+358861cd2c,g199a45376c+0ba108daf9,g1fd858c14a+dd066899e3,g262e1987ae+ebfced1d55,g29ae962dfc+72fd90588e,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+b668f15bc5,g4595892280+3897dae354,g47891489e3+abcf9c3559,g4d44eb3520+fb4ddce128,g53246c7159+8c5ae1fdc5,g67b6fd64d1+abcf9c3559,g67fd3c3899+1f72b5a9f7,g74acd417e5+cb6b47f07b,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+abcf9c3559,g8d7436a09f+bcf525d20c,g8ea07a8fe4+9f5ccc88ac,g90f42f885a+6054cc57f1,g97be763408+06f794da49,g9dd6db0277+1f72b5a9f7,ga681d05dcb+7e36ad54cd,gabf8522325+735880ea63,gac2eed3f23+abcf9c3559,gb89ab40317+abcf9c3559,gbf99507273+8c5ae1fdc5,gd8ff7fe66e+1f72b5a9f7,gdab6d2f7ff+cb6b47f07b,gdc713202bf+1f72b5a9f7,gdfd2d52018+8225f2b331,ge365c994fd+375fc21c71,ge410e46f29+abcf9c3559,geaed405ab2+562b3308c0,gf9a733ac38+8c5ae1fdc5,w.2025.35
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 ) |