Loading [MathJax]/extensions/tex2jax.js
LSST Applications g04dff08e69+fafbcb10e2,g0d33ba9806+e09a96fa4e,g0fba68d861+cc01b48236,g1e78f5e6d3+fb95f9dda6,g1ec0fe41b4+f536777771,g1fd858c14a+ae46bc2a71,g35bb328faa+fcb1d3bbc8,g4af146b050+dd94f3aad7,g4d2262a081+7ee6f976aa,g53246c7159+fcb1d3bbc8,g5a012ec0e7+b20b785ecb,g60b5630c4e+e09a96fa4e,g6273192d42+bf8cfc5e62,g67b6fd64d1+4086c0989b,g78460c75b0+2f9a1b4bcd,g786e29fd12+cf7ec2a62a,g7b71ed6315+fcb1d3bbc8,g87b7deb4dc+831c06c8fc,g8852436030+54b48a5987,g89139ef638+4086c0989b,g9125e01d80+fcb1d3bbc8,g94187f82dc+e09a96fa4e,g989de1cb63+4086c0989b,g9f33ca652e+64be6d9d51,g9f7030ddb1+d11454dffd,ga2b97cdc51+e09a96fa4e,gabe3b4be73+1e0a283bba,gabf8522325+fa80ff7197,gb1101e3267+23605820ec,gb58c049af0+f03b321e39,gb89ab40317+4086c0989b,gcf25f946ba+54b48a5987,gd6cbbdb0b4+af3c3595f5,gd9a9a58781+fcb1d3bbc8,gde0f65d7ad+15f2daff9d,ge278dab8ac+d65b3c2b70,ge410e46f29+4086c0989b,gf67bdafdda+4086c0989b,v29.0.0.rc5
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
FastFinder.h
Go to the documentation of this file.
1// -*- LSST-C++ -*-
2/*
3 * This file is part of jointcal.
4 *
5 * Developed for the LSST Data Management System.
6 * This product includes software developed by the LSST Project
7 * (https://www.lsst.org).
8 * See the COPYRIGHT file at the top-level directory of this distribution
9 * for details of code ownership.
10 *
11 * This program is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation, either version 3 of the License, or
14 * (at your option) any later version.
15 *
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
20 *
21 * You should have received a copy of the GNU General Public License
22 * along with this program. If not, see <https://www.gnu.org/licenses/>.
23 */
24
25#ifndef LSST_JOINTCAL_FAST_FINDER_H
26#define LSST_JOINTCAL_FAST_FINDER_H
27
28#include <vector>
30
31namespace lsst {
32namespace jointcal {
33
37
52
55public:
56 const BaseStarList baselist; // shallow copy of the initial list of stars (not used, acts as a
57 // conservatory). The need is arguable.
58 unsigned count; // total number of objects (size of input list stars).
59 /* the sorted pointer array: It does not seem very wise to use smart
60 pointers here because reference counts will uselessly jump around
61 during sorting */
62 // Unfortunately we *must* use shared_ptr here because the return value of findClosest is used to pass
63 // ownership
65 unsigned nslice; // number of (X) slices
66 std::vector<unsigned> index; // index in "stars" of first object of each slice.
67 double xmin, xmax, xstep; // x bounds, slice size
68
69 using stars_element = decltype(stars)::value_type;
70 using pstar = decltype(stars)::const_iterator;
71
73 FastFinder(const BaseStarList &list, unsigned nXSlice = 100);
74
76 std::shared_ptr<const BaseStar> findClosest(const Point &where, double maxDist,
77 bool (*SkipIt)(const BaseStar &) = nullptr) const;
78
80 std::shared_ptr<const BaseStar> secondClosest(const Point &where, double maxDist,
82 bool (*SkipIt)(const BaseStar &) = nullptr) const;
83
85 void print(std::ostream &out) const;
86
89
90 class Iterator {
91 public: // could be made private, but what for??
94 double yStart, yEnd; // Y limits ( for all stripes)
95 /* pointers to the first and beyond last stars in the y range for
96 the current stripe : */
98 pstar null_value; // with pointers being iterators, the null value is not NULL
99
100 void check() const;
101
102 public:
103 Iterator(const FastFinder &f, const Point &where, double maxDist);
104 void operator++();
105 stars_element operator*() const;
106 };
107
108 Iterator beginScan(const Point &where, double maxDist) const;
109
110 void findRangeInSlice(int iSlice, double yStart, double yEnd, pstar &start,
111 pstar &end) const;
112 pstar locateYStart(pstar begin, pstar end, double yVal) const;
113 pstar locateYEnd(pstar begin, pstar end, double yVal) const;
114};
115} // namespace jointcal
116} // namespace lsst
117#endif // LSST_JOINTCAL_FAST_FINDER_H
T begin(T... args)
The base class for handling stars. Used by all matching routines.
Definition BaseStar.h:51
Iterator meant to traverse objects within some limiting distance.
Definition FastFinder.h:90
Iterator(const FastFinder &f, const Point &where, double maxDist)
decltype(stars)::const_iterator pstar
Definition FastFinder.h:70
decltype(stars)::value_type stars_element
Definition FastFinder.h:69
pstar locateYStart(pstar begin, pstar end, double yVal) const
void findRangeInSlice(int iSlice, double yStart, double yEnd, pstar &start, pstar &end) const
void print(std::ostream &out) const
mostly for debugging
Definition FastFinder.cc:77
std::shared_ptr< const BaseStar > findClosest(const Point &where, double maxDist, bool(*SkipIt)(const BaseStar &)=nullptr) const
Find the closest with some rejection capability.
Definition FastFinder.cc:83
const BaseStarList baselist
Definition FastFinder.h:56
FastFinder(const BaseStarList &list, unsigned nXSlice=100)
Constructor.
Definition FastFinder.cc:38
std::shared_ptr< const BaseStar > secondClosest(const Point &where, double maxDist, std::shared_ptr< const BaseStar > &closest, bool(*SkipIt)(const BaseStar &)=nullptr) const
Iterator beginScan(const Point &where, double maxDist) const
std::vector< unsigned > index
Definition FastFinder.h:66
std::vector< std::shared_ptr< const BaseStar > > stars
Definition FastFinder.h:64
pstar locateYEnd(pstar begin, pstar end, double yVal) const
A point in a plane.
Definition Point.h:37
T end(T... args)
StarList< BaseStar > BaseStarList
Definition BaseStar.h:121
FastFinder::Iterator Iterator