LSSTApplications  17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
LSSTDataManagementBasePackage
iterators.cc
Go to the documentation of this file.
1 /*
2  * LSST Data Management System
3  * Copyright 2008, 2009, 2010 LSST Corporation.
4  *
5  * This product includes software developed by the
6  * LSST Project (http://www.lsst.org/).
7  *
8  * This program is free software: you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License as published by
10  * the Free Software Foundation, either version 3 of the License, or
11  * (at your option) any later version.
12  *
13  * This program is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the LSST License Statement and
19  * the GNU General Public License along with this program. If not,
20  * see <http://www.lsstcorp.org/LegalNotices/>.
21  */
22 
23 /*
24  * A set of pseudo-code to permit me to document the Image iterator API.
25  *
26  * This is needed as the actual implementation is opaque, based on the boost::gil
27  * libraries.
28  */
29 namespace lsst { namespace afw { namespace image {
32 public:
36  void operator++();
38  void operator++(int);
40  void operator+=(std::ptrdiff_t delta
41  );
43  void operator-=(std::ptrdiff_t delta
44  );
46  bool operator==(imageIterator const& rhs
47  );
49  bool operator!=(imageIterator const& rhs
50  );
52  bool operator<(imageIterator const& rhs);
53 };
54 
56 class imageLocator {
57 public:
59  typedef void cached_location_t;
66  Image::Pixel& operator()(int x, int y);
68  xy_x_iterator x();
70  xy_y_iterator y();
71 
73  struct xy_x_iterator {
77  void operator++();
79  void operator++(int);
80  };
81 
83  struct xy_y_iterator {
87  void operator++();
89  void operator++(int);
90  };
91 
93  cached_location_t cache_location(int x, int y);
95  Image::Pixel& operator[](cached_location_t const&);
96 };
97 
98 }}}
void operator++()
Advance an iterator (prefix)
bool operator<(imageIterator const &rhs)
Return true if the lhs is less than the rhs.
PixelT Pixel
A pixel in this ImageBase.
Definition: ImageBase.h:116
int y
Definition: SpanSet.cc:49
An y_iterator created from an xy_locator
Definition: iterators.cc:83
An ImageBase locator.
Definition: iterators.cc:56
An ImageBase iterator.
Definition: iterators.cc:31
bool operator!=(imageIterator const &rhs)
Return true if the lhs doesn&#39;t equal the rhs.
A base class for image defects.
void operator+=(std::ptrdiff_t delta)
Increment the iterator by delta
double x
Image::Pixel & operator*()
Dereference an iterator, returning a reference to a Pixel.
bool operator==(imageIterator const &rhs)
Return true if the lhs equals the rhs.
Backwards-compatibility support for depersisting the old Calib (FluxMag0/FluxMag0Err) objects...
void cached_location_t
type to store relative location for efficient repeated access (not really void)
Definition: iterators.cc:59
An x_iterator created from an xy_locator
Definition: iterators.cc:73
void operator-=(std::ptrdiff_t delta)
Decrement the iterator by delta