| 
    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 <iostream>#include <cmath>#include <list>#include <memory>#include <algorithm>#include "lsst/log/Log.h"#include "lsst/jointcal/BaseStar.h"#include "lsst/jointcal/StarMatch.h"#include "lsst/jointcal/AstrometryTransform.h"#include "lsst/jointcal/Histo2d.h"#include "lsst/jointcal/Histo4d.h"#include "lsst/jointcal/FastFinder.h"#include "lsst/jointcal/ListMatch.h"Go to the source code of this file.
Classes | |
| struct | lsst::jointcal::Segment | 
| class | lsst::jointcal::SegmentList | 
| struct | lsst::jointcal::SegmentPair | 
Namespaces | |
| lsst | |
| A base class for image defects.  | |
| lsst::jointcal | |
Macros | |
| #define | M_PI 3.14159265358979323846 /* pi */ | 
Typedefs | |
| typedef std::list< Segment >::iterator | lsst::jointcal::SegmentIterator | 
| typedef std::list< Segment >::const_iterator | lsst::jointcal::SegmentCIterator | 
| typedef std::list< SegmentPair > | lsst::jointcal::SegmentPairList | 
| typedef SegmentPairList::iterator | lsst::jointcal::SegmentPairListIterator | 
| typedef SegmentPairList::const_iterator | lsst::jointcal::SegmentPairListCIterator | 
| using | lsst::jointcal::SolList = std::list< std::unique_ptr< StarMatchList > > | 
Functions | |
| std::unique_ptr< StarMatchList > | lsst::jointcal::matchSearchRotShift (BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions) | 
| searches a geometrical transformation that goes from list1 to list2.  More... | |
| std::unique_ptr< StarMatchList > | lsst::jointcal::matchSearchRotShiftFlip (BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions) | 
| same as above but searches also a flipped solution.  More... | |
| std::unique_ptr< AstrometryTransformLinear > | lsst::jointcal::listMatchupShift (const BaseStarList &list1, const BaseStarList &list2, const AstrometryTransform &transform, double maxShift, double binSize=0) | 
| searches for a 2 dimensional shift using a very crude histogram method.  More... | |
| std::unique_ptr< StarMatchList > | lsst::jointcal::listMatchCollect (const BaseStarList &list1, const BaseStarList &list2, const AstrometryTransform *guess, const double maxDist) | 
| assembles star matches.  More... | |
| std::unique_ptr< StarMatchList > | lsst::jointcal::listMatchCollect (const BaseStarList &list1, const BaseStarList &list2, const double maxDist) | 
| same as before except that the transform is the identity  More... | |
| std::unique_ptr< AstrometryTransform > | lsst::jointcal::listMatchCombinatorial (const BaseStarList &list1, const BaseStarList &list2, const MatchConditions &conditions=MatchConditions()) | 
| std::unique_ptr< AstrometryTransform > | lsst::jointcal::listMatchRefine (const BaseStarList &list1, const BaseStarList &list2, std::unique_ptr< AstrometryTransform > transform, const int maxOrder=3) | 
| #define M_PI 3.14159265358979323846 /* pi */ | 
Definition at line 31 of file ListMatch.cc.