LatticeIterator.h

Go to the documentation of this file.

// # LatticeIterator.h: Iterators for Lattices: readonly or read/write
// # Copyright (C) 1994,1995,1996,1997,1998,1999,2000,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: casa-feedback@nrao.edu.
// #        Postal address: AIPS++ Project Office
// #                        National Radio Astronomy Observatory
// #                        520 Edgemont Road
// #                        Charlottesville, VA 22903-2475 USA
 
#ifndef LATTICES_LATTICEITERATOR_H
#define LATTICES_LATTICEITERATOR_H
 
// # Includes
#include <casacore/casa/aips.h>
#include <casacore/lattices/Lattices/Lattice.h>
#include <casacore/lattices/Lattices/LatticeIterInterface.h>
#include <casacore/casa/Arrays/ArrayFwd.h>
#include <memory>
 
namespace casacore {  // # NAMESPACE CASACORE - BEGIN
 
// # Forward Declarations
class IPosition;
class LatticeNavigator;
 
// <summary>
// A readonly iterator for Lattices
// </summary>
 
// <use visibility=export>
 
// <reviewed reviewer="Peter Barnes" date="1999/10/30" tests="tLatticeIterator.cc">
// </reviewed>
 
// <prerequisite>
//   <li> <linkto class="Lattice">Lattice</linkto>
//   <li> <linkto class="LatticeNavigator">LatticeNavigator</linkto>
//   <li> <linkto class="Array">Array</linkto>
// </prerequisite>
 
// <etymology>
// The leading "RO" is shorthand for "readonly", which indicates that an
// RO_LatticeIterator is used for traversing a Lattice, examining and
// possibly extracting its contents, but not for modifying it.
// </etymology>
 
// <synopsis>
// This class provides a convenient way to traverse any class derived from
// Lattice. You can iterate through the Lattice's data from "start" to "end"
// by calling <src>operator++</src>, and reverse direction by calling
// <src>operator--</src>.  You can return immediately to the beginning by
// calling the <src>reset</src> function.  The RO_LatticeIterator gives the
// user the opportunity to methodically walk through the data, in an
// efficient way.
// <p>
// The supplied <linkto class=LatticeNavigator>LatticeNavigator</linkto>
// determines how to step through the Lattice. It can, for instance,
// be line by line, but it can also be in a more complicated way.
// When no navigator is supplied, a default navigator will be used
// which steps in the optimum way.
// <p>
// A cursor (which is an <linkto class=Array>Array</linkto> object) is
// used to return the data for each step in the iteration process.
// Depending on the navigator used the cursor can have a different shape
// for each step of the iteration. This is especially true when the
// end of an axis is reached for a non-integrally fitting cursor shape.
// <br> The cursor() function returns an Array which has the same
// dimensionality as the Lattice. It is, however, also possible to get
// an Array with a lower dimensionality by using the correct function
// in the group <src>vectorCursor()</src>, <src>matrixCursor()</src>, and
// <src>cubeCursor()</src>. Those functions remove (some) degenerated axes
// resulting in a vector, matrix or cube.
// When, for example, a LatticeStepper with shape [64,1,1] is used, the
// <src>vectorCursor()</src> can be used. It will remove the degenerated
// axes (length 1) and return the cursor as a Vector object. Note that
// <src>matrixCursor()</src> cannot be used, because removing the degenerated
// axes results in a 1D array.
// <p>
// Generally iterators should not be long-lived objects - create new ones
// when needed rather than keeping one around for a long time to be
// reused. This is because the cache memory used by the cursor will be
// released when the iterator is destroyed.
// <p>
// The purpose of this class is to hide the possibly complicated
// implementation and structure of the Lattice classes, and allow you to
// iterate through a Lattice with the same ease as one iterates through a
// Fortran or C vector.  For example, and assuming that initialization has
// been done properly, here's a typical 'for' loop:
// <srcblock>
//  // code omitted  which associates Lattice object and the iterator
//  for (iterator.reset(); !iterator.atEnd(); iterator++) {
//    meanValue = mean(iterator.cursor());
//  }
// </srcblock>
// The iterator's <src>cursor()</src> member function returns a reference to
// that part of the Lattice data which is presently "seen" by the
// LatticeIterator.
// <p>
// Before explaining the initialization of an iterator, the LatticeNavigator
// class must be further introduced. This is an abstract base class, from which
// concrete navigators are derived. After one of these is created, you
// attach it to the LatticeIterator, and it provides a specific technique
// for navigating through the Lattice. Different navigators deliver
// different traversal schemes.  The most basic is
// <linkto class=LatticeStepper>LatticeStepper</linkto>, which
// moves a specified shape sequentially through the Lattice -- for example,
// by moving one plane at a time, front to back, through a cube.  Another
// (future) navigator might be designed to move a small, 2-dimensional plane
// through a cube, centering each iteration on the brightest pixel of the
// cube's plane, and ignoring the darker regions of the cube.
// <p>
// The performance and memory usage of an iteration through a lattice
// (in particular through a <linkto class=PagedArray>PagedArray</linkto>)
// depends very heavily on the navigator used. Currently there are three
// navigators available:
// <ol>
//  <li> <linkto class=LatticeStepper>LatticeStepper</linkto> steps
// sequentially through a lattice with the given cursor shape.
// This can use a lot of memory for the PagedArray cache.
//  <li> <linkto class=TiledLineStepper>TiledLineStepper</linkto>
// steps line by line through a lattice. However, it is doing that
// in such a way that as few tiles as possible need to kept in the
// PagedArray cache. This reduces memory usage considerably.
//  <li> <linkto class=TileStepper>TileStepper</linkto> steps tile
// by tile through a lattice. This navigator requires a PagedArray cache
// of 1 tile only. However, it can only be used for application in which
// the iteration order is not important (e.g. addition, determining max).
// </ol>
// The class <linkto class=LatticeApply>LatticeApply</linkto> is very useful
// to iterate through a Lattice while applying an algorithm. It makes it
// possible for the user to concentrate on the algorithm.
// <p>
// Here's a typical iterator declaration:
// <srcblock>
// RO_LatticeIterator<Float> iterator(pagedArray, stepper);
// </srcblock>
// The template identifier <src>Float</src> defines the data type of
// Array object that will be the iterator's cursor.
//<br>
// The <src>pagedArray</src> constructor argument names a PagedArray object,
// which is what the iterator will traverse.  The <src>stepper</src>
// argument is a LatticeStepper which defines the method of iteration.
 
// <example>
// When passed the name of a previously created PagedArray stored on disk,
// this function will traverse the whole array, and report the average value
// of all of the elements. Imagine that the filename contains a PagedArray
// with dimension 64 x 64 x 8.
// <srcblock>
// void demonstrateIterator (const String& filename)
// {
//   PagedArray<Float> pagedArray(filename);
//   IPosition latticeShape = pagedArray.shape();
//   cout << "paged array has shape: " << latticeShape << endl;
//
//   // Construct the iterator.  since we only want to read the PagedArray,
//   // use the read-only class, which disallows writing back to the cursor.
//   // No navigator is given, so the default TileStepper is used
//   // which ensures optimum performance.
//   RO_LatticeIterator<Float> iterator(pagedArray);
//
//   // Add for each iteration step the sum of the cursor elements to the sum.
//   // Note that the cursor is an Array object and that the function sum
//   // is defined in ArrayMath.h.
//   Float runningSum = 0.0;
//   for (iterator.reset(); !iterator.atEnd(); iterator++) {
//       runningSum += sum(iterator.cursor());
//   }
//   cout << "average value, from demonstrateIterator: "
//       << runningSum / latticeShape.product() << endl;
// }
// </srcblock>
// </example>
 
// <motivation>
// Iterator classes are a standard feature in C++ libraries -- they
// provide convenience and allow the implementation of the "iteratee"
// to be kept hidden.
// </motivation>
 
// # <todo asof="1995/09/12">
// #  <li>
// # </todo>
 
template <class T>
class RO_LatticeIterator {
 public:
  // The default constructor creates an empty object which is practically
  // unusable.
  // It can only be used as the source or target of an assignment. It can
  // also be used as the source for the copy constructor and the copy function.
  // Other functions do not check if the object is empty and will usually
  // give a segmentation fault.
  // The function isNull() can be used to test if the object is empty.
  RO_LatticeIterator();
 
  // Construct the Iterator with the supplied data.
  // It uses a TileStepper as the default iteration strategy.
  // useRef=True means that if possible the cursor arrays returned
  // reference the data in the underlying lattice. This is only possible
  // for ArrayLattice objects (or e.g. a SubLattice using it).
  explicit RO_LatticeIterator(const Lattice<T>& data, Bool useRef = True);
 
  // Construct the Iterator with the supplied data, and iteration strategy
  RO_LatticeIterator(const Lattice<T>& data, const LatticeNavigator& method, Bool useRef = True);
 
  // Construct the Iterator with the supplied data.
  // It uses a LatticeStepper with the supplied cursor shape as the
  // iteration strategy.
  RO_LatticeIterator(const Lattice<T>& data, const IPosition& cursorShape, Bool useRef = True);
 
  // The copy constructor uses reference semantics (ie. NO real copy is made).
  // The function <src>copy</src> can be used to make a true copy.
  RO_LatticeIterator(const RO_LatticeIterator<T>& other);
 
  // Destructor (cleans up dangling references and releases memory)
  ~RO_LatticeIterator();
 
  // Assignment uses reference semantics (ie. NO real copy is made).
  // The function <src>copy</src> can be used to make a true copy.
  RO_LatticeIterator<T>& operator=(const RO_LatticeIterator<T>& other);
 
  // Make a copy of the iterator object.
  // This means that an independent navigator object is created to
  // be able to iterate independently through the same Lattice.
  // The position in the copied navigator is the same as the original.
  // The reset function has to be used to start at the beginning.
  // <br>Note that if the Lattice uses a cache (e.g. PagedArray), the
  // cache is shared by the iterators.
  RO_LatticeIterator<T> copy() const;
 
  // Is the iterator object empty?
  Bool isNull() const { return !itsIterPtr; }
 
  // Return the underlying lattice.
  Lattice<T>& lattice() const { return itsIterPtr->lattice(); }
 
  // Increment operator - increment the cursor to the next position.  These
  // functions are forwarded to the current LatticeNavigator and both
  // postfix and prefix versions will do the same thing.
  // <br>They return True if the cursor moved (which should always be the
  // case if the iterator is not at the end).
  // <group>
  Bool operator++();
  Bool operator++(int);
  // </group>
 
  // Decrement operator - decrement the cursor to the previous
  // position. These functions are forwarded to the current LatticeNavigator
  // and both postfix and prefix versions will do the same thing.
  // <br>They return True if the cursor moved (which should always be the
  // case if the iterator is not at the start).
  // <group>
  Bool operator--();
  Bool operator--(int);
  // </group>
 
  // Function which resets the cursor to the beginning of the Lattice and
  // resets the number of steps taken to zero.
  void reset();
 
  // Function which returns a value of "True" if the cursor is at the
  // beginning of the Lattice, otherwise, returns "False".
  Bool atStart() const;
 
  // Function which returns a value of "True" if an attempt has been made
  // to move the cursor beyond the end of the Lattice.
  Bool atEnd() const;
 
  // Function to return the number of steps (increments or decrements) taken
  // since construction (or since last reset).  This is a running count of
  // all cursor movement, thus doing N increments followed by N decrements
  // results in 2N steps.
  uInt nsteps() const;
 
  // Function which returns the current position of the beginning of the
  // cursor within the Lattice. The returned IPosition will have the same
  // number of axes as the underlying Lattice.
  IPosition position() const;
 
  // Function which returns the current position of the end of the
  // cursor. The returned IPosition will have the same number of axes as the
  // underlying Lattice.
  IPosition endPosition() const;
 
  // Function which returns the shape of the Lattice being iterated through.
  // The returned IPosition will always have the same number of axes as the
  // underlying Lattice.
  IPosition latticeShape() const;
 
  // Function which returns the shape of the cursor which is iterating
  // through the Lattice. The returned IPosition will have the same number
  // of axes as the underlying Lattice.
  IPosition cursorShape() const;
 
  // Functions which returns a window to the data in the Lattice. These are
  // used to read the data within the Lattice.  Use the function that is
  // appropriate to the current cursor dimension, AFTER REMOVING DEGENERATE
  // AXES, or use the <src>cursor</src> function which works with any number
  // of dimensions in the cursor. A call of the function whose return value
  // is inappropriate with respect to the current cursor dimension will
  // throw an exception (AipsError).
  // <group>
  const Vector<T>& vectorCursor() const;
  const Matrix<T>& matrixCursor() const;
  const Cube<T>& cubeCursor() const;
  const Array<T>& cursor() const;
  // </group>
 
  // Function which checks the internals of the class for consistency.
  // Returns True if everything is fine otherwise returns False.
  Bool ok() const;
 
 protected:
  // The pointer to the Iterator
  std::shared_ptr<LatticeIterInterface<T>> itsIterPtr;
};
 
// <summary>
// A read/write lattice iterator
// </summary>
 
// <use visibility=export>
 
// <reviewed reviewer="Peter Barnes" date="1999/10/30" tests="tLatticeIterator.cc">
// </reviewed>
 
// <prerequisite>
//   <li> <linkto class="RO_LatticeIterator">RO_LatticeIterator</linkto>
//   <li> <linkto class="Lattice">Lattice</linkto>
//   <li> <linkto class="LatticeNavigator">LatticeNavigator</linkto>
//   <li> <linkto class="Array">Array</linkto>
// </prerequisite>
 
// <synopsis>
// LatticeIterator differs from the RO_LatticeIterator class in that
// the window into the Lattice data which moves with each iterative step may
// be used to alter the Lattice data itself.  The moving "cursor" gives the
// user the door to reach in and change the basic Lattice before moving to
// another section of the Lattice.
// <p>
// LatticeIterator can be used in 3 ways:
// <br> - For readonly purposes using the cursor() functions. Note that if
// the entire iteration is readonly, it is better to use an
// <linkto class=RO_LatticeIterator>RO_LatticeIterator</linkto> object.
// <br> - To update (part of)the contents of the lattice (e.g. clip the value
// of some pixels). For this purpose the <src>rwCursor</src> functions
// should be used. They read the data (if not read yet) and mark the
// cursor for write.
// <br> - To fill the lattice. For this purpose the <src>woCursor</src>
// functions should be used. They do not read the data, but only mark the
// cursor for write.
// <p>
// When needed, writing the cursor data is done automatically when the
// cursor position changes or when the iterator is destructed.
// </synopsis>
 
// <example>
// Here's an iterator that runs through a cube, assigning every element
// of each plane of the cube a value equal to the number of the plane.
// See <linkto class=LatticeStepper>LatticeStepper</linkto> for an
// explanation of the navigator used here.
// <srcblock>
//      PagedArray<Float> pa("someName");
//      IPosition windowShape(2,pa.shape(0), pa.shape(1));
//      LatticeStepper stepper(pa.shape(), windowShape);
//      LatticeIterator<Float> iterator(pa, stepper);
//      Int planeNumber = 0;
//      for (iterator.reset(); !iterator.atEnd(); iterator++) {
//        iterator.woCursor() = planeNumber++;
//      }
// </srcblock>
//
// Here's an iterator that runs through a cube, subtracting the mean from
// each line of the cube with a mean < 0.
// See <linkto class=TiledLineStepper>TiledLineStepper</linkto> for an
// explanation of the navigator used here.
// <srcblock>
//      PagedArray<Float> pa("someName");
//      TiledLineStepper stepper(pa.shape(), pa.niceCursorShape(), 0);
//      LatticeIterator<Float> iterator(pa, stepper);
//      Int planeNumber = 0;
//      for (iterator.reset(); !iterator.atEnd(); iterator++) {
//        Float meanLine = mean(iterator.cursor());
//        if (meanLine < 0) {
//          iterator.rwCursor() -= meanLine;
//        }
//      }
// </srcblock>
// Note that in this last example no more vectors than required are written.
// This is achieved by using the readonly function <src>cursor</src> in
// the test and using <src>rwCursor</src> only when data needs to be changed.
// <br>Note that <src>rwCursor</src> does not read the data again. They are
// still readily available.
// </example>
 
template <class T>
class LatticeIterator : public RO_LatticeIterator<T> {
 public:
  // The default constructor creates an empty object which is practically
  // unusable.
  // It can only be used as the source or target of an assignment. It can
  // also be used as the source for the copy constructor and the copy function.
  // Other functions do not check if the object is empty and will usually
  // give a segmentation fault.
  // The function isNull() can be used to test if the object is empty.
  LatticeIterator();
 
  // Construct the Iterator with the supplied data.
  // It uses a TileStepper as the default iteration strategy.
  // useRef=True means that if possible the cursor arrays returned
  // reference the data in the underlying lattice. This is only possible
  // for ArrayLattice objects (or e.g. a SubLattice using it).
  explicit LatticeIterator(Lattice<T>& data, Bool useRef = True);
 
  // Construct the Iterator with the supplied data, and iteration strategy
  LatticeIterator(Lattice<T>& data, const LatticeNavigator& method, Bool useRef = True);
 
  // Iterate through the data with a LatticeStepper that has uses the
  // supplied cursorShape.
  LatticeIterator(Lattice<T>& data, const IPosition& cursorShape, Bool useRef = True);
 
  // The copy constructor uses reference semantics (ie. NO real copy is made).
  // The function <src>copy</src> can be used to make a true copy.
  LatticeIterator(const LatticeIterator<T>& other);
 
  // destructor (cleans up dangling references and releases memory)
  ~LatticeIterator();
 
  // Assignment uses reference semantics (ie. NO real copy is made).
  // The function <src>copy</src> can be used to make a true copy.
  LatticeIterator<T>& operator=(const LatticeIterator<T>& other);
 
  // Make a copy of the iterator object.
  // This means that an independent navigator object is created to
  // be able to iterate independently through the same Lattice.
  // The position in the copied navigator is the same as the original.
  // The reset function has to be used to start at the beginning.
  // <br>Note that if the Lattice uses a cache (e.g. PagedArray), the
  // cache is shared by the iterators.
  LatticeIterator<T> copy() const;
 
  // Functions to return a window to the data in the Lattice. Use the function
  // that is appropriate to the current cursor dimension, AFTER REMOVING
  // DEGENERATE AXES, or use the <src>cursor</src> function which works with
  // any number of dimensions in the cursor. A call of the function whose
  // return value is inappropriate with respect to the current cursor
  // dimension will throw an exception (AipsError) (e.g. VectorCursor
  // cannot be used when the cursor is 2D).
  // <br>
  // When the iterator state changes (e.g. by moving, destruction) the
  // data are automatically rewritten before the iterator state is changed.
  // <br>The <src>rw</src> (read/write) versions should be used to read the
  // data first. They are useful to update a lattice.
  // The <src>wo</src> (writeonly) versions do not read the data.
  // They only return a cursor of the correct shape and are useful to
  // fill a lattice. Note that it sets the state to 'data read'. I.e.,
  // a subsequent call to, say, <src>cursor()</src> does not read the
  // data, which would destroy the contents of the cursor which may
  // just be filled by the user.
  // <group>
  Vector<T>& rwVectorCursor();
  Matrix<T>& rwMatrixCursor();
  Cube<T>& rwCubeCursor();
  Array<T>& rwCursor();
  Vector<T>& woVectorCursor();
  Matrix<T>& woMatrixCursor();
  Cube<T>& woCubeCursor();
  Array<T>& woCursor();
  //</group>
 
  // Function which checks the internals of the class for consistency.
  // Returns True if everything is fine. Otherwise returns False.
  Bool ok() const;
 
  // # Make members of parent class known.
 public:
  using RO_LatticeIterator<T>::isNull;
  using RO_LatticeIterator<T>::position;
  using RO_LatticeIterator<T>::endPosition;
  using RO_LatticeIterator<T>::cursorShape;
 
 protected:
  using RO_LatticeIterator<T>::itsIterPtr;
};
 
}  // namespace casacore
 
// # See comments in Lattice.h why Lattice.tcc is included here.
#ifndef CASACORE_NO_AUTO_TEMPLATES
#include <casacore/lattices/Lattices/Lattice.tcc>
#include <casacore/lattices/Lattices/LatticeIterator.tcc>
#endif  // # CASACORE_NO_AUTO_TEMPLATES
#endif