LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
Public Member Functions | Public Attributes | List of all members
lsst::jointcal::FastFinder::Iterator Class Reference

Iterator meant to traverse objects within some limiting distance. More...

#include <FastFinder.h>

Public Member Functions

void check () const
 
 Iterator (const FastFinder &f, const Point &where, double maxDist)
 
void operator++ ()
 
stars_element operator* () const
 

Public Attributes

const FastFinderfinder
 
int currentSlice
 
int endSlice
 
double yStart
 
double yEnd
 
pstar current
 
pstar pend
 
pstar null_value
 

Detailed Description

Iterator meant to traverse objects within some limiting distance.

Initializer is beginScan and end condition is (*it == NULL). Used by findClosest & co.

Definition at line 90 of file FastFinder.h.

Constructor & Destructor Documentation

◆ Iterator()

lsst::jointcal::Iterator::Iterator ( const FastFinder f,
const Point where,
double  maxDist 
)

Definition at line 180 of file FastFinder.cc.

181  : finder(F), null_value(F.stars.end()) {
182  current = pend = null_value; // does not iterate
183  int startSlice = 0;
184  if (finder.xstep != 0) // means we have several slices
185  {
186  startSlice = std::max(0, int((where.x - maxDist - finder.xmin) / finder.xstep));
187  /* obviously, endSlice (and starSlice) can be negative.
188  This is why slice indices are "int" rather than "unsigned". */
189  endSlice = std::min(int(finder.nslice), int((where.x + maxDist - finder.xmin) / finder.xstep) + 1);
190  } else {
191  startSlice = 0;
192  endSlice = 1;
193  }
194  // beyond limits:
195  if (startSlice >= int(finder.nslice) || endSlice < 0) return;
196  // we are inside in x, so, we setup the y range:
197  yStart = where.y - maxDist;
198  yEnd = where.y + maxDist;
199  /* rather than initializing here, we step back one
200  slice and let "++" do its job */
201  currentSlice = startSlice - 1; // again, this requires "int" slices
202  ++(*this);
203 }
T max(T... args)
T min(T... args)

Member Function Documentation

◆ check()

void lsst::jointcal::FastFinder::Iterator::check ( ) const

Definition at line 225 of file FastFinder.cc.

225  {
226  if (current != null_value &&
227  (current < finder.stars.begin() || current >= finder.stars.begin() + finder.count)) {
228  LOGLS_ERROR(_log, "Error in FastFinder " << *current << " " << *(finder.stars.begin()) << ' '
229  << *(finder.stars.begin() + finder.count));
230  }
231 }
#define LOGLS_ERROR(logger, message)
Log a error-level message using an iostream-based interface.
Definition: Log.h:668
std::vector< std::shared_ptr< const BaseStar > > stars
Definition: FastFinder.h:64

◆ operator*()

FastFinder::stars_element lsst::jointcal::Iterator::operator* ( ) const

Definition at line 205 of file FastFinder.cc.

205  {
206  if (current != null_value) return *current;
207  return nullptr;
208 }

◆ operator++()

void lsst::jointcal::Iterator::operator++ ( )

Definition at line 210 of file FastFinder.cc.

210  {
211  if (current != pend) {
212  current++;
213  } else
214  do {
215  currentSlice++;
216  if (currentSlice >= endSlice) {
218  return;
219  }
221  } while (current == null_value);
222  check();
223 }
void findRangeInSlice(const int iSlice, const double yStart, const double yEnd, pstar &start, pstar &end) const
Definition: FastFinder.cc:168

Member Data Documentation

◆ current

pstar lsst::jointcal::FastFinder::Iterator::current

Definition at line 97 of file FastFinder.h.

◆ currentSlice

int lsst::jointcal::FastFinder::Iterator::currentSlice

Definition at line 93 of file FastFinder.h.

◆ endSlice

int lsst::jointcal::FastFinder::Iterator::endSlice

Definition at line 93 of file FastFinder.h.

◆ finder

const FastFinder& lsst::jointcal::FastFinder::Iterator::finder

Definition at line 92 of file FastFinder.h.

◆ null_value

pstar lsst::jointcal::FastFinder::Iterator::null_value

Definition at line 98 of file FastFinder.h.

◆ pend

pstar lsst::jointcal::FastFinder::Iterator::pend

Definition at line 97 of file FastFinder.h.

◆ yEnd

double lsst::jointcal::FastFinder::Iterator::yEnd

Definition at line 94 of file FastFinder.h.

◆ yStart

double lsst::jointcal::FastFinder::Iterator::yStart

Definition at line 94 of file FastFinder.h.


The documentation for this class was generated from the following files: