| 
    LSST Applications
    21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
    
   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 | |
| lsst | |
| A base class for image defects.  | |
| lsst::afw | |
| 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... | |