TMatRowsAsArraysIterator_decl.h

Go to the documentation of this file.

// -*- C++ -*-

// PLearn (A C++ Machine Learning Library)
// Copyright (C) 1998 Pascal Vincent
// Copyright (C) 1999-2002 Pascal Vincent, Yoshua Bengio and University of Montreal
//

// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// 
//  1. Redistributions of source code must retain the above copyright
//     notice, this list of conditions and the following disclaimer.
// 
//  2. Redistributions in binary form must reproduce the above copyright
//     notice, this list of conditions and the following disclaimer in the
//     documentation and/or other materials provided with the distribution.
// 
//  3. The name of the authors may not be used to endorse or promote
//     products derived from this software without specific prior written
//     permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN
// NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// 
// This file is part of the PLearn library. For more information on the PLearn
// library, go to the PLearn Web site at www.plearn.org


 
/* *******************************************************      
   * $Id: TMatRowsAsArraysIterator_decl.h,v 1.2 2004/07/21 16:30:53 chrish42 Exp $
   * AUTHORS: Pascal Vincent & Yoshua Bengio
   * This file is part of the PLearn library.
   ******************************************************* */


#ifndef TMatRowsAsArraysIterator_decl_INC
#define TMatRowsAsArraysIterator_decl_INC

#include <plearn/base/Array_impl.h>

namespace PLearn {
using namespace std;



template <class T>
class TMatRowsAsArraysIterator
{
public:
  typedef random_access_iterator_tag iterator_category;
  typedef Array<T>                    value_type;
  typedef ptrdiff_t                  difference_type;
  typedef Array<T>*                   pointer;
  typedef Array<T>&                   reference;
  
private:
  T* ptr;                                    
  int width;                                 
  int mod;                                   
  Array<T> v;

public:
  TMatRowsAsArraysIterator()
    : ptr(), width(), mod() {}

  TMatRowsAsArraysIterator(T* p, int w, int m)
    : ptr(p), width(w), mod(m) {}

  // Implement trivial iterator functions
  bool operator==(const TMatRowsAsArraysIterator& other) const {
    return ptr == other.ptr && width == other.width && mod == other.mod;
  }

  bool operator!=(const TMatRowsAsArraysIterator& y)
  { return !operator==(y); }

  Array<T>& operator*() 
  {
    v.view(TVec<T>(width, ptr));
    return v;
  }

  // cannot define operator-> here since we cannot return a pointer to a
  // temporary (e.g. stack-based) vector and expect this to work properly...
  
  // Implement forward iterator functions
  TMatRowsAsArraysIterator& operator++() {
    ptr += mod;
    return *this;
  }

  TMatRowsAsArraysIterator operator++(int) {
    TMatRowsAsArraysIterator r(*this);
    ptr += mod;
    return r;
  }

  // Implement bidirectional iterator functions
  TMatRowsAsArraysIterator& operator--() {
    ptr -= mod;
    return *this;
  }

  TMatRowsAsArraysIterator operator--(int) {
    TMatRowsAsArraysIterator r(*this);
    ptr -= mod;
    return r;
  }

  // Implement random access iterator functions
  TMatRowsAsArraysIterator& operator+=(difference_type n) {
    ptr += n*mod;
    return *this;
  }

  TMatRowsAsArraysIterator operator+(difference_type n) {
    TMatRowsAsArraysIterator r(*this);
    r += n;
    return r;
  }
  
  TMatRowsAsArraysIterator& operator-=(difference_type n) {
    ptr -= n*mod;
    return *this;
  }

  TMatRowsAsArraysIterator operator-(difference_type n) {
    TMatRowsAsArraysIterator r(*this);
    r -= n;
    return r;
  }

  difference_type operator-(const TMatRowsAsArraysIterator& y) {
    return (ptr - y.ptr) / mod;
  }
  
  value_type operator[](difference_type n) {
    return TVec<T>(width, ptr + n*mod);
  }

  bool operator<(const TMatRowsAsArraysIterator& y) {
    return ptr < y.ptr;
  }

};



} // end of namesapce PLearn

#endif

---