|
LSST Applications 26.0.0,g0265f82a02+6660c170cc,g07994bdeae+30b05a742e,g0a0026dc87+17526d298f,g0a60f58ba1+17526d298f,g0e4bf8285c+96dd2c2ea9,g0ecae5effc+c266a536c8,g1e7d6db67d+6f7cb1f4bb,g26482f50c6+6346c0633c,g2bbee38e9b+6660c170cc,g2cc88a2952+0a4e78cd49,g3273194fdb+f6908454ef,g337abbeb29+6660c170cc,g337c41fc51+9a8f8f0815,g37c6e7c3d5+7bbafe9d37,g44018dc512+6660c170cc,g4a941329ef+4f7594a38e,g4c90b7bd52+5145c320d2,g58be5f913a+bea990ba40,g635b316a6c+8d6b3a3e56,g67924a670a+bfead8c487,g6ae5381d9b+81bc2a20b4,g93c4d6e787+26b17396bd,g98cecbdb62+ed2cb6d659,g98ffbb4407+81bc2a20b4,g9ddcbc5298+7f7571301f,ga1e77700b3+99e9273977,gae46bcf261+6660c170cc,gb2715bf1a1+17526d298f,gc86a011abf+17526d298f,gcf0d15dbbd+96dd2c2ea9,gdaeeff99f8+0d8dbea60f,gdb4ec4c597+6660c170cc,ge23793e450+96dd2c2ea9,gf041782ebf+171108ac67
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 |
1.9.7