LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
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.