|
LSST Applications g013ef56533+63812263fb,g083dd6704c+a047e97985,g199a45376c+0ba108daf9,g1fd858c14a+fde7a7a78c,g210f2d0738+db0c280453,g262e1987ae+abed931625,g29ae962dfc+058d1915d8,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+64337f1634,g47891489e3+f459a6810c,g53246c7159+8c5ae1fdc5,g54cd7ddccb+890c8e1e5d,g5a60e81ecd+d9e514a434,g64539dfbff+db0c280453,g67b6fd64d1+f459a6810c,g6ebf1fc0d4+8c5ae1fdc5,g7382096ae9+36d16ea71a,g74acd417e5+c70e70fbf6,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+f459a6810c,g8d7436a09f+1b779678e3,g8ea07a8fe4+81eaaadc04,g90f42f885a+34c0557caf,g97be763408+9583a964dd,g98a1a72a9c+028271c396,g98df359435+530b675b85,gb8cb2b794d+4e54f68785,gbf99507273+8c5ae1fdc5,gc2a301910b+db0c280453,gca7fc764a6+f459a6810c,gd7ef33dd92+f459a6810c,gdab6d2f7ff+c70e70fbf6,ge410e46f29+f459a6810c,ge41e95a9f2+db0c280453,geaed405ab2+e3b4b2a692,gf9a733ac38+8c5ae1fdc5,w.2025.43
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 ) |