LSSTApplications  16.0-11-g09ed895+2,16.0-11-g12e47bd,16.0-11-g9bb73b2+6,16.0-12-g5c924a4+6,16.0-14-g9a974b3+1,16.0-15-g1417920+1,16.0-15-gdd5ca33+1,16.0-16-gf0259e2,16.0-17-g31abd91+7,16.0-17-g7d7456e+7,16.0-17-ga3d2e9f+13,16.0-18-ga4d4bcb+1,16.0-18-gd06566c+1,16.0-2-g0febb12+21,16.0-2-g9d5294e+69,16.0-2-ga8830df+6,16.0-20-g21842373+7,16.0-24-g3eae5ec,16.0-28-gfc9ea6c+4,16.0-29-ge8801f9,16.0-3-ge00e371+34,16.0-4-g18f3627+13,16.0-4-g5f3a788+20,16.0-4-ga3eb747+10,16.0-4-gabf74b7+29,16.0-4-gb13d127+6,16.0-49-g42e581f7+6,16.0-5-g27fb78a+7,16.0-5-g6a53317+34,16.0-5-gb3f8a4b+87,16.0-6-g9321be7+4,16.0-6-gcbc7b31+42,16.0-6-gf49912c+29,16.0-7-gd2eeba5+51,16.0-71-ge89f8615e,16.0-8-g21fd5fe+29,16.0-8-g3a9f023+20,16.0-8-g4734f7a+1,16.0-8-g5858431+3,16.0-9-gf5c1f43+8,master-gd73dc1d098+1,w.2019.01
LSSTDataManagementBasePackage
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
typedef afwImage::Image<int> ImageT;
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;
}