#line 1 "/user/cvsspst/ees1cg/RAVL/RAVL-0.7/Core/Container/SArray/SArr1Iter2.hh" // This file is part of RAVL, Recognition And Vision Library // Copyright (C) 2001, University of Surrey // This code may be redistributed under the terms of the GNU Lesser // General Public License (LGPL). See the lgpl.licence file for details or // see http://www.gnu.org/copyleft/lesser.html // file-header-ends-here #ifndef RAVL_SARR1ITER2_HEADER #define RAVL_SARR1ITER2_HEADER 1 /////////////////////////////////////////////////// //! docentry="Ravl.Core.Arrays.1D" //! rcsid="$Id: SArr1Iter2.hh,v 1.4 2002/02/16 17:37:42 craftit Exp $" //! file="Ravl/Core/Container/SArray/SArr1Iter2.hh" //! lib=RavlCore //! author="Charles Galambos" //! date="10/09/98" //! userlevel=Advanced #include "Ravl/SArray1d.hh" #include "Ravl/BfAccIter2.hh" namespace RavlN { //! userlevel=Advanced //: Duel SArray1d iterator. // Fast simple array iterator. template class SArray1dIter2C : public BufferAccessIter2C { public: SArray1dIter2C() {} //: Default constructor. SArray1dIter2C(const SArray1dC &arr1,const SArray1dC &arr2); //: Constructor. inline void First() { BufferAccessIter2C::First(arr1,arr2); } // Goto first element in arrays. SArray1dC &Array1() { return arr1; } //: Access array. SArray1dC &Array2() { return arr2; } //: Access array. IndexC Index() const { return (IntT) (at1 - &arr1[0]); } //: Get current index. // This is a little slow. bool IsFirst() const { return at1 == &(arr1[0]); } //: Test if this is the first element in the range. // Note,this is slower than IsElm(). private: SArray1dC arr1; SArray1dC arr2; }; /////////////////////////////////////////// template SArray1dIter2C::SArray1dIter2C(const SArray1dC &narr1,const SArray1dC &narr2) : arr1(narr1), arr2(narr2) { First(); } } #endif