LSST Applications  21.0.0-147-g0e635eb1+1acddb5be5,22.0.0+052faf71bd,22.0.0+1ea9a8b2b2,22.0.0+6312710a6c,22.0.0+729191ecac,22.0.0+7589c3a021,22.0.0+9f079a9461,22.0.1-1-g7d6de66+b8044ec9de,22.0.1-1-g87000a6+536b1ee016,22.0.1-1-g8e32f31+6312710a6c,22.0.1-10-gd060f87+016f7cdc03,22.0.1-12-g9c3108e+df145f6f68,22.0.1-16-g314fa6d+c825727ab8,22.0.1-19-g93a5c75+d23f2fb6d8,22.0.1-19-gb93eaa13+aab3ef7709,22.0.1-2-g8ef0a89+b8044ec9de,22.0.1-2-g92698f7+9f079a9461,22.0.1-2-ga9b0f51+052faf71bd,22.0.1-2-gac51dbf+052faf71bd,22.0.1-2-gb66926d+6312710a6c,22.0.1-2-gcb770ba+09e3807989,22.0.1-20-g32debb5+b8044ec9de,22.0.1-23-gc2439a9a+fb0756638e,22.0.1-3-g496fd5d+09117f784f,22.0.1-3-g59f966b+1e6ba2c031,22.0.1-3-g849a1b8+f8b568069f,22.0.1-3-gaaec9c0+c5c846a8b1,22.0.1-32-g5ddfab5d3+60ce4897b0,22.0.1-4-g037fbe1+64e601228d,22.0.1-4-g8623105+b8044ec9de,22.0.1-5-g096abc9+d18c45d440,22.0.1-5-g15c806e+57f5c03693,22.0.1-7-gba73697+57f5c03693,master-g6e05de7fdc+c1283a92b8,master-g72cdda8301+729191ecac,w.2021.39
LSST Data Management Base Package
image1.cc
/*
* LSST Data Management System
* Copyright 2008, 2009, 2010 LSST Corporation.
*
* This product includes software developed by the
* LSST Project (http://www.lsst.org/).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the LSST License Statement and
* the GNU General Public License along with this program. If not,
* see <http://www.lsstcorp.org/LegalNotices/>.
*/
/*
* Image iterator tutorial.
*/
// Include the necessary headers;
// if using many image modules then you may prefer to include "lsst/afw/image.h"
#include "lsst/geom.h"
// Declare the desired Image type.
// Note: only specific types are supported; for the list of available types
// see the explicit instantiation code at the end of lsst/afw/image/src/Image.cc
using ImageT = afwImage::Image<int>;
int main() {
// Declare an Image; its pixels are not yet initialized.
ImageT img(lsst::geom::Extent2I(10, 6));
// Initialize all pixels to a given value.
img = 100;
// Alternatively you can specify an initial value in the constructor:
ImageT img2(img.getDimensions(), 100.0);
// Here is a common and efficient way to set all pixels of the image.
// Note that the end condition is only computed once, for efficiency.
for (int y = 0; y != img.getHeight(); ++y) {
for (ImageT::x_iterator ptr = img.row_begin(y), end = img.row_end(y); ptr != end; ++ptr) {
*ptr = 100;
}
}
// It is probably slower to compute the end condition each time, as is done here.
for (int y = 0; y != img.getHeight(); ++y) {
for (ImageT::x_iterator ptr = img.row_begin(y); ptr != img.row_end(y); ++ptr) {
*ptr = 100;
}
}
// STL-compliant iterators are available.
// However, they are not very efficient because the image data may not be contiguous
// so these iterators must test for end-of-row on every increment.
// (By the way, we do guarantee that an image's row data is contiguous).
// iterator
for (ImageT::iterator ptr = img.begin(), end = img.end(); ptr != end; ++ptr) {
*ptr = 100;
}
// reverse_iterator
for (ImageT::reverse_iterator ptr = img.rbegin(), end = img.rend(); ptr != end; ++ptr) {
*ptr = 100;
}
// A different way of choosing begin() for use with (inefficient) iterator
for (ImageT::iterator ptr = img.at(0, 0), end = img.end(); ptr != end; ++ptr) {
*ptr = 100;
}
// There is one efficient STL-compliant iterator: "fast_iterator", but it only works for contiguous images
// (such as newly allocated images). If you attempt to use this on a subimage you will get an exception.
for (ImageT::fast_iterator ptr = img.begin(true), end = img.end(true); ptr != end; ++ptr) {
*ptr = 100;
}
// It is possible to traverse the image by columns instead of by rows,
// but because the data is row-contiguous, this has awful consequences upon cache performance.
for (int x = 0; x != img.getWidth(); ++x) {
for (ImageT::y_iterator ptr = img.col_begin(x), end = img.col_end(x); ptr != end; ++ptr) {
*ptr = 100;
}
}
// If you must traverse the image by columns then consider doing it in batches to improve
// cache performance, as shown here:
int x = 0;
for (; x != img.getWidth() % 4; ++x) {
for (ImageT::y_iterator ptr = img.col_begin(x), end = img.col_end(x); ptr != end; ++ptr) {
*ptr = 100;
}
}
for (; x != img.getWidth(); x += 4) {
for (ImageT::y_iterator ptr0 = img.col_begin(x + 0), end0 = img.col_end(x + 0),
ptr1 = img.col_begin(x + 1), ptr2 = img.col_begin(x + 2),
ptr3 = img.col_begin(x + 3);
ptr0 != end0; ++ptr0, ++ptr1, ++ptr2, ++ptr3) {
*ptr0 = *ptr1 = *ptr2 = *ptr3 = 100;
}
}
// Save the image to disk
img.writeFits("foo.fits");
return 0;
}
int end
double x
afw::table::Key< afw::table::Array< ImagePixelT > > image
uint64_t * ptr
Definition: RangeSet.cc:88
int y
Definition: SpanSet.cc:48
A class to represent a 2-dimensional array of pixels.
Definition: Image.h:51
Backwards-compatibility support for depersisting the old Calib (FluxMag0/FluxMag0Err) objects.