LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
LSST Data Management Base Package
|
#include <vector>
#include "lsst/pex/config.h"
#include "lsst/afw/table/fwd.h"
#include "lsst/afw/table/BaseRecord.h"
#include "lsst/afw/table/Simple.h"
#include "lsst/afw/table/Source.h"
#include "lsst/afw/table/Catalog.h"
#include "lsst/geom/Angle.h"
Go to the source code of this file.
Classes | |
class | lsst::afw::table::MatchControl |
Pass parameters to algorithms that match list of sources. More... | |
struct | lsst::afw::table::Match< Record1, Record2 > |
Lightweight representation of a geometric match between two records. More... | |
Namespaces | |
namespace | lsst |
A base class for image defects. | |
namespace | lsst::afw |
namespace | lsst::afw::table |
Functions | |
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 . More... | |
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 . More... | |
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 . More... | |
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<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. More... | |
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. More... | |