/usr/include/casacore/lattices/Lattices/RebinLattice.tcc is in casacore-dev 2.2.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 | //# RebinLattice.cc: rebin a lattice
//# Copyright (C) 2003
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library 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 Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id$
#ifndef LATTICES_REBINLATTICE_TCC
#define LATTICES_REBINLATTICE_TCC
#include <casacore/lattices/Lattices/RebinLattice.h>
#include <casacore/casa/Arrays/ArrayMath.h>
#include <casacore/lattices/Lattices/ArrayLattice.h>
#include <casacore/lattices/Lattices/LatticeStepper.h>
#include <casacore/lattices/Lattices/LatticeIterator.h>
#include <casacore/casa/Logging/LogIO.h>
#include <casacore/casa/BasicMath/Math.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/Exceptions/Error.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
template<class T>
RebinLattice<T>::RebinLattice ()
: itsLatticePtr (0),
itsAllUnity (False)
{}
template<class T>
RebinLattice<T>::RebinLattice (const MaskedLattice<T>& lattice,
const IPosition& bin)
: itsLatticePtr(lattice.cloneML())
{
LogIO os(LogOrigin("RebinLattice", "RebinLattice(...)", WHERE));
const uInt nDim = lattice.ndim();
if (bin.nelements() != nDim) {
os << "Binning vector and lattice must have same dimension" << LogIO::EXCEPTION;
}
//
itsBin.resize(bin.nelements());
const IPosition shapeIn = lattice.shape();
itsAllUnity = True;
for (uInt i=0; i<bin.nelements(); i++) {
if (bin[i]==0) {
os << "Binning vector values must be positive integers" << LogIO::EXCEPTION;
}
//
itsBin[i] = bin[i];
if (bin[i] > shapeIn[i]) {
os << LogIO::WARN << "Truncating bin to lattice shape for axis " << i+1 << LogIO::POST;
itsBin[i] = shapeIn[i];
}
if (bin[i] != 1) itsAllUnity = False;
}
}
template<class T>
RebinLattice<T>::RebinLattice (const RebinLattice<T>& other)
: MaskedLattice<T>(),
itsLatticePtr(0)
{
operator= (other);
}
template<class T>
RebinLattice<T>::~RebinLattice()
{
delete itsLatticePtr;
}
template<class T>
RebinLattice<T>& RebinLattice<T>::operator=(const RebinLattice<T>& other)
{
if (this != &other) {
delete itsLatticePtr;
itsLatticePtr = 0;
if (other.itsLatticePtr) {
itsLatticePtr = other.itsLatticePtr->cloneML();
}
// Clear the cache.
itsData.resize();
itsMask.resize();
itsSlicer = Slicer();
//
itsBin = other.itsBin;
itsAllUnity = other.itsAllUnity;
}
return *this;
}
template<class T>
MaskedLattice<T>* RebinLattice<T>::cloneML() const
{
return new RebinLattice<T> (*this);
}
template<class T>
Bool RebinLattice<T>::isMasked() const
{
return itsLatticePtr->isMasked();
}
template<class T>
Bool RebinLattice<T>::isPaged() const
{
return itsLatticePtr->isPaged();
}
template<class T>
Bool RebinLattice<T>::isWritable() const
{
return False;
}
template<class T>
Bool RebinLattice<T>::lock (FileLocker::LockType type, uInt nattempts)
{
return itsLatticePtr->lock (type, nattempts);
}
template<class T>
void RebinLattice<T>::unlock()
{
itsLatticePtr->unlock();
}
template<class T>
Bool RebinLattice<T>::hasLock (FileLocker::LockType type) const
{
return itsLatticePtr->hasLock (type);
}
template<class T>
void RebinLattice<T>::resync()
{
itsLatticePtr->resync();
}
template<class T>
void RebinLattice<T>::flush()
{
itsLatticePtr->flush();
}
template<class T>
void RebinLattice<T>::tempClose()
{
itsLatticePtr->tempClose();
}
template<class T>
void RebinLattice<T>::reopen()
{
itsLatticePtr->reopen();
}
template<class T>
const LatticeRegion* RebinLattice<T>::getRegionPtr() const
{
return 0;
}
template<class T>
IPosition RebinLattice<T>::shape() const
{
return rebinShape(itsLatticePtr->shape(), itsBin);
}
template<class T>
String RebinLattice<T>::name (Bool stripPath) const
{
return itsLatticePtr->name(stripPath);
}
template<class T>
Bool RebinLattice<T>::doGetSlice (Array<T>& buffer, const Slicer& section)
{
// If all unity, access the lattice directly.
if (itsAllUnity) {
return itsLatticePtr->doGetSlice (buffer, section);
}
// Get the result for this section if not in cache
if (!(section == itsSlicer)) {
getDataAndMask (section);
}
buffer.reference(itsData);
return True;
}
template<class T>
void RebinLattice<T>::doPutSlice (const Array<T>&,
const IPosition&,
const IPosition&)
{
throw (AipsError ("RebinLattice::putSlice - non-writable lattice"));
}
template<class T>
uInt RebinLattice<T>::advisedMaxPixels() const
{
return itsLatticePtr->advisedMaxPixels();
}
template<class T>
Bool RebinLattice<T>::doGetMaskSlice (Array<Bool>& buffer,
const Slicer& section)
{
// If not masked, simply fill the buffer
if (!itsLatticePtr->isMasked()) {
buffer.resize (section.length());
buffer = True;
return False;
}
// If all unity, access the lattice directly.
if (itsAllUnity) {
return itsLatticePtr->doGetMaskSlice (buffer, section);
}
// Get the result for this section if not in cache
if (!(section == itsSlicer)) {
getDataAndMask (section);
}
buffer.reference(itsMask);
return True;
}
template <class T>
Bool RebinLattice<T>::ok() const
{
return itsLatticePtr->ok();
}
template<class T>
void RebinLattice<T>::getDataAndMask (const Slicer& section)
{
// Work out the slicer for the input Lattice given the slicer for
// the binned Lattice
Slicer sectionIn = findOriginalSlicer (section);
// Fetch
Array<T> data;
Array<Bool> mask;
itsData.resize (section.length());
itsLatticePtr->getSlice(data, sectionIn);
if (itsLatticePtr->isMasked()) {
itsLatticePtr->getMaskSlice(mask, sectionIn);
itsMask.resize (section.length());
bin (data, mask);
} else {
bin (data);
}
// Remember what is in cache
itsSlicer = section;
}
template <class T>
void RebinLattice<T>::bin (const Array<T>& dataIn)
{
// Make Lattice from Array to get decent iterators
const uInt nDim = dataIn.ndim();
LatticeStepper stepper (dataIn.shape(), itsBin, LatticeStepper::RESIZE);
ArrayLattice<T> latIn (dataIn);
RO_LatticeIterator<T> inIter(latIn, stepper);
// Do it
IPosition outPos(nDim);
//
for (inIter.reset(); !inIter.atEnd(); inIter++) {
const Array<T>& cursor(inIter.cursor());
const uInt nSum = cursor.nelements();
T sumData = sum(cursor);
if (nSum>0) sumData /= nSum;
// Write output
const IPosition& inPos = inIter.position();
outPos = inPos / itsBin;
itsData(outPos) = sumData;
}
}
template <class T>
void RebinLattice<T>::bin (const Array<T>& dataIn, const Array<Bool>& maskIn)
{
// Make Lattice from Array to get decent iterators
const uInt nDim = dataIn.ndim();
ArrayLattice<T> latIn (dataIn);
Array<Bool> maskInRef(maskIn);
// Make Lattice iterators
LatticeStepper stepper (latIn.shape(), itsBin, LatticeStepper::RESIZE);
RO_LatticeIterator<T> inIter(latIn, stepper);
// Do it
IPosition outPos(nDim);
Array<Bool> cursorMask;
//
for (inIter.reset(); !inIter.atEnd(); inIter++) {
const Array<T>& cursor(inIter.cursor());
Array<Bool> cursorMask (maskInRef(inIter.position(),
inIter.endPosition()));
// Iterate through cursor with STL iterators
T sumData = 0;
Int nSum = 0;
typename Array<T>::const_iterator dataIterEnd = cursor.end();
typename Array<T>::const_iterator dataIter;
typename Array<Bool>::const_iterator maskIter;
for (dataIter=cursor.begin(),maskIter=cursorMask.begin();
dataIter!=dataIterEnd; ++dataIter,++maskIter) {
if (*maskIter) {
sumData += *dataIter;
nSum++;
}
}
if (nSum>0) sumData /= nSum;
// Write output (perhaps could redo this with an iterator)
const IPosition& inPos = inIter.position();
outPos = inPos / itsBin;
itsData(outPos) = sumData;
itsMask(outPos) = nSum>0;
}
}
template<class T>
IPosition RebinLattice<T>::rebinShape (const IPosition& inShape,
const IPosition& bin)
{
AlwaysAssert(inShape.nelements()==bin.nelements(), AipsError);
//
const uInt nDim = inShape.nelements();
IPosition outShape(nDim);
for (uInt i=0; i<nDim; i++) {
Int n = inShape[i] / bin[i];
Int rem = inShape[i] - n*bin[i];
if (rem > 0) n += 1; // Allow last bin to be non-integral
outShape[i] = n;
}
return outShape;
}
template<class T>
Slicer RebinLattice<T>::findOriginalSlicer (const Slicer& section) const
//
// For a slicer for the RebinLattice, find the Slicer for the original
// Lattice from which we must get data to then rebin
//
{
const uInt nDim = itsLatticePtr->ndim();
const IPosition shapeOrig = itsLatticePtr->shape();
//
const IPosition& blc = section.start();
const IPosition& trc = section.end();
const IPosition& stride = section.stride();
//
IPosition blcOrig(blc);
IPosition trcOrig(trc);
for (uInt i=0; i<nDim; i++) {
if (stride[i] != 1) {
throw (AipsError("RebinLattice: Slices with non-unit stride are not yet supported"));
}
//
blcOrig[i] = blc[i] * itsBin[i];
trcOrig[i] = trc[i] * itsBin[i] + (itsBin[i] - 1);
//
blcOrig[i] = std::max(ssize_t(0), std::min(blcOrig[i], shapeOrig[i]-1));
trcOrig[i] = std::max(ssize_t(0), std::min(trcOrig[i], shapeOrig[i]-1));
}
//
IPosition strideOrig(nDim,1);
return Slicer(blcOrig, trcOrig, strideOrig, Slicer::endIsLast);
}
} //# NAMESPACE CASACORE - END
#endif
|