Array2d.hpp

Go to the documentation of this file.

/*
 * Copyright(c):
 * Signal Image and Communications (SIC) Department 
 * http://www.sic.sp2mi.univ-poitiers.fr/ 
 *  - University of Poitiers, France http://www.univ-poitiers.fr 
 *  - XLIM  Institute UMR CNRS 7252  http://www.xlim.fr/ 
 * 
 * and 
 * 
 * D2 Fluid, Thermic and Combustion 
 *  - University of Poitiers, France http://www.univ-poitiers.fr 
 *  - PPRIME Institute -  UPR CNRS 3346  http://www.pprime.fr
 *  - ISAE-ENSMA http://www.ensma.fr
 *
 * Contributor(s):
 * The SLIP team,
 * Benoit Tremblais <tremblais_AT_sic.univ-poitiers.fr>,
 * Laurent David <laurent.david_AT_lea.univ-poitiers.fr>, 
 * Ludovic Chatellier <ludovic.chatellier_AT_univ-poitiers.fr>, 
 * Lionel Thomas <lionel.thomas_AT_univ-poitiers.fr>, 
 * Denis Arrivault <arrivault_AT_sic.univ-poitiers.fr>, 
 * Julien Dombre <julien.dombre_AT_univ-poitiers.fr>.
 *
 * Description:
 * The Simple Library of Image Processing (SLIP) is a new image processing 
 * library. It is written in the C++ language following as much as possible 
 * the ISO/ANSI C++ standard. It is consequently compatible with any system  
 * satisfying the ANSI C++ complience. It works on different Unix , Linux ,  
 * Mircrosoft Windows and Mac OS X plateforms. SLIP is a research library that  
 * was created by the Signal, Image and Communications (SIC) departement of  
 * the XLIM, UMR 7252 CNRS Institute in collaboration with the Fluids, Thermic  
 * and Combustion departement of the P', UPR 3346 CNRS Institute of the  
 * University of Poitiers.
 * 
 * The SLIP Library source code has been registered to the APP (French Agency 
 * for the Protection of Programs) by the University of Poitiers and CNRS, 
 * under  registration number IDDN.FR.001.300034.000.S.P.2010.000.21000.

 * http://www.sic.sp2mi.univ-poitiers.fr/slip/
 *
 * This software is governed by the CeCILL-C license under French law and
 * abiding by the rules of distribution of free software.  You can  use, 
 * modify and/ or redistribute the software under the terms of the CeCILL-C 
 * license as circulated by CEA, CNRS and INRIA at the following URL 
 * http://www.cecill.info.
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 * 
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the 
 * same conditions as regards security. 
 *
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL-C license and that you accept its terms.
 */






#ifndef SLIP_ARRAY2D_HPP
#define SLIP_ARRAY2D_HPP

#include <iostream>
#include <iterator>
#include <cassert>
#include <string>
#include <cstddef>
#include "Box2d.hpp"
#include "Point2d.hpp"
#include "DPoint2d.hpp"
#include "stride_iterator.hpp"
#include "iterator2d_box.hpp"
#include "Range.hpp"
#include "iterator2d_range.hpp"


#include <boost/serialization/access.hpp>
#include <boost/serialization/split_member.hpp>
#include <boost/serialization/string.hpp>
#include <boost/serialization/complex.hpp>
#include <boost/serialization/version.hpp>

namespace slip
{

template<class T>
class stride_iterator;

template<class T>
class iterator2d_box;

template<class T>
class iterator2d_range;

template<class T>
class const_iterator2d_box;

template<class T>
class const_iterator2d_range;


template <class T>
class DPoint2d;

template <class T>
class Point2d;

template <typename T>
class Array2d;

template <typename T>
std::ostream& operator<<(std::ostream & out, 
                                                 const slip::Array2d<T>& a);

template<typename T>
bool operator==(const slip::Array2d<T>& x, 
                                const slip::Array2d<T>& y);

template<typename T>
bool operator!=(const slip::Array2d<T>& x, 
                                const slip::Array2d<T>& y);

template<typename T>
bool operator<(const slip::Array2d<T>& x, 
                       const slip::Array2d<T>& y);

template<typename T>
bool operator>(const slip::Array2d<T>& x, 
                       const slip::Array2d<T>& y);

template<typename T>
bool operator<=(const slip::Array2d<T>& x, 
                                const slip::Array2d<T>& y);

template<typename T>
bool operator>=(const slip::Array2d<T>& x, 
                                const slip::Array2d<T>& y);


template <typename T>
class Array2d
{
public:
  typedef T value_type;
  typedef Array2d<T> self;
  typedef const Array2d<T> const_self;

  typedef value_type& reference;
  typedef value_type const& const_reference;

  typedef value_type* pointer;
  typedef value_type const* const_pointer;
 

  typedef ptrdiff_t difference_type;
  typedef std::size_t size_type;

  typedef pointer iterator;
  typedef const_pointer const_iterator;
  
  typedef std::reverse_iterator<iterator> reverse_iterator;
  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;

  typedef pointer row_iterator;
  typedef const_pointer const_row_iterator;

  typedef slip::stride_iterator<pointer> col_iterator;
  typedef slip::stride_iterator<const_pointer> const_col_iterator;
 
  typedef slip::iterator2d_box<self> iterator2d;
  typedef slip::const_iterator2d_box<const_self> const_iterator2d;
  
  typedef slip::stride_iterator<pointer> row_range_iterator;
  typedef slip::stride_iterator<const_pointer> const_row_range_iterator;
  typedef slip::stride_iterator<col_iterator> col_range_iterator;
  typedef slip::stride_iterator<const_col_iterator> const_col_range_iterator;

  typedef slip::iterator2d_range<self> iterator2d_range;
  typedef slip::const_iterator2d_range<const_self> const_iterator2d_range;

  typedef std::reverse_iterator<iterator> reverse_row_iterator;
  typedef std::reverse_iterator<const_iterator> const_reverse_row_iterator;
  typedef std::reverse_iterator<col_iterator> reverse_col_iterator;
  typedef std::reverse_iterator<const_col_iterator> const_reverse_col_iterator;
  typedef std::reverse_iterator<iterator2d> reverse_iterator2d;
  typedef std::reverse_iterator<const_iterator2d> const_reverse_iterator2d;
  typedef std::reverse_iterator<row_range_iterator> reverse_row_range_iterator;
  typedef std::reverse_iterator<const_row_range_iterator> const_reverse_row_range_iterator;
  typedef std::reverse_iterator<col_range_iterator> reverse_col_range_iterator;
  typedef std::reverse_iterator<const_col_range_iterator> const_reverse_col_range_iterator;
  typedef std::reverse_iterator<iterator2d_range> reverse_iterator2d_range;
  typedef std::reverse_iterator<const_iterator2d_range> const_reverse_iterator2d_range;
  
 //default iterator of the container
  typedef iterator2d default_iterator;
  typedef const_iterator2d const_default_iterator;

  static const std::size_t DIM = 2;

  Array2d();
 
  Array2d(const size_type d1,
                  const size_type d2);
  
  Array2d(const size_type d1,
                  const size_type d2, 
                  const T& val);
 
  Array2d(const size_type d1,
                  const size_type d2, 
                  const T* val);
 
  template<typename InputIterator>
  Array2d(const size_type d1,
                  const size_type d2, 
                  InputIterator first,
                  InputIterator last):
    d1_(d1),d2_(d2),size_(d1*d2)
  {
    this->allocate();
    std::fill_n(this->begin(),this->size_,T());
    std::copy(first,last, this->begin());
  }

  Array2d(const self& rhs);

  ~Array2d();
  

  void resize(const size_type d1,
                      const size_type d2,
                      const T& val = T());

 
  iterator begin();


  iterator end();

  const_iterator begin() const;

  
  const_iterator end() const;
  
  reverse_iterator rbegin();
  
  reverse_iterator rend();
  
  const_reverse_iterator rbegin() const;

  
  const_reverse_iterator rend() const;

 
  row_iterator row_begin(const size_type row);

  
  row_iterator row_end(const size_type row);


  const_row_iterator row_begin(const size_type row) const;


  const_row_iterator row_end(const size_type row) const;
  
  col_iterator col_begin(const size_type col);


  col_iterator col_end(const size_type col);

  const_col_iterator col_begin(const size_type col) const;



  const_col_iterator col_end(const size_type col) const;


  row_range_iterator row_begin(const size_type row,
                                                       const slip::Range<int>& range);



  row_range_iterator row_end(const size_type row,
                                                     const slip::Range<int>& range);


  const_row_range_iterator row_begin(const size_type row,
                                                                     const slip::Range<int>& range) const;


  const_row_range_iterator row_end(const size_type row,
                                                                   const slip::Range<int>& range) const;


  col_range_iterator col_begin(const size_type col,
                                                       const slip::Range<int>& range);

  col_range_iterator col_end(const size_type col,
                                                     const slip::Range<int>& range);




  const_col_range_iterator col_begin(const size_type col,
                                                                     const slip::Range<int>& range) const;

 
  const_col_range_iterator col_end(const size_type col,
                                                                   const slip::Range<int>& range) const;

  

  reverse_row_iterator row_rbegin(const size_type row);


  reverse_row_iterator row_rend(const size_type row);

  const_reverse_row_iterator row_rbegin(const size_type row) const;

  const_reverse_row_iterator row_rend(const size_type row) const;

  reverse_col_iterator col_rbegin(const size_type col);

  
  reverse_col_iterator col_rend(const size_type col);

  const_reverse_col_iterator col_rbegin(const size_type col) const;

    
  const_reverse_col_iterator col_rend(const size_type col) const;
 

  reverse_row_range_iterator row_rbegin(const size_type row,
                                                                                const slip::Range<int>& range);

 
  reverse_row_range_iterator row_rend(const size_type row,
                                                                      const slip::Range<int>& range);



  const_reverse_row_range_iterator row_rbegin(const size_type row,
                                                                                      const slip::Range<int>& range) const;


  const_reverse_row_range_iterator row_rend(const size_type row,
                                                                                    const slip::Range<int>& range) const;
 
 


  reverse_col_range_iterator col_rbegin(const size_type col,
                                                                                const slip::Range<int>& range);

  reverse_col_range_iterator col_rend(const size_type col,
                                                                      const slip::Range<int>& range);


  const_reverse_col_range_iterator 
  col_rbegin(const size_type col,
                     const slip::Range<int>& range) const;

 
  const_reverse_col_range_iterator col_rend(const size_type col,
                                                                                    const slip::Range<int>& range) const;


  iterator2d upper_left();
  
  
  iterator2d bottom_right();


  const_iterator2d upper_left() const;
  
 
  const_iterator2d bottom_right() const;

  iterator2d upper_left(const Box2d<int>& box);

 
  iterator2d bottom_right(const Box2d<int>& box);


  const_iterator2d upper_left(const Box2d<int>& box) const;

 
  const_iterator2d bottom_right(const Box2d<int>& box) const;


  iterator2d_range upper_left(const Range<int>& row_range,
                                                      const Range<int>& col_range);

  iterator2d_range bottom_right(const Range<int>& row_range,
                                                                const Range<int>& col_range);


  const_iterator2d_range upper_left(const Range<int>& row_range,
                                                                    const Range<int>& col_range) const;


  const_iterator2d_range bottom_right(const Range<int>& row_range,
                                                                      const Range<int>& col_range) const;


 


  iterator2d_range upper_left(const Range<int>& range);
 

  iterator2d_range bottom_right(const Range<int>& range);

 

  
  const_iterator2d_range upper_left(const Range<int>& range) const;

 

  const_iterator2d_range bottom_right(const Range<int>& range) const;

 
  reverse_iterator2d rupper_left();
  
  reverse_iterator2d rbottom_right();

  const_reverse_iterator2d rupper_left() const;
 
 
  const_reverse_iterator2d rbottom_right() const;
  

  reverse_iterator2d rupper_left(const Box2d<int>& box);

  reverse_iterator2d rbottom_right(const Box2d<int>& box);

  const_reverse_iterator2d rupper_left(const Box2d<int>& box) const;


  const_reverse_iterator2d rbottom_right(const Box2d<int>& box) const;

 
  reverse_iterator2d_range rupper_left(const Range<int>& row_range,
                                                                       const Range<int>& col_range);


 
  reverse_iterator2d_range rbottom_right(const Range<int>& row_range,
                                                                                 const Range<int>& col_range);


 
  const_reverse_iterator2d_range rupper_left(const Range<int>& row_range,
                                                                                     const Range<int>& col_range) const;

  const_reverse_iterator2d_range rbottom_right(const Range<int>& row_range,
                                                                                       const Range<int>& col_range) const;


 
  reverse_iterator2d_range rupper_left(const Range<int>& range);



  reverse_iterator2d_range rbottom_right(const Range<int>& range);
  

  const_reverse_iterator2d_range rupper_left(const Range<int>& range) const;


  const_reverse_iterator2d_range rbottom_right(const Range<int>& range) const;
  

  friend std::ostream& operator<< <>(std::ostream & out, 
                                                                     const self& a);

  self& operator=(const self & rhs);


  self& operator=(const T& value)
  {
    this->fill(value);
    return *this;
  }


  void fill(const T& value)
  {
    std::fill_n(this->begin(),this->size_,value);
  } 
  
  void fill(const T* value)
  {
    std::copy(value,value + this->size_, this->begin());
  } 

  template<typename InputIterator>
  void fill(InputIterator first,
                    InputIterator last)
  {
    std::copy(first,last, this->begin());
  }
  friend bool operator== <>(const Array2d<T>& x, 
                                                    const Array2d<T>& y);

  friend bool operator!= <>(const Array2d<T>& x, 
                                                    const Array2d<T>& y);

  friend bool operator< <>(const Array2d<T>& x, 
                                                   const Array2d<T>& y);

  friend bool operator> <>(const Array2d<T>& x, 
                                                   const Array2d<T>& y);

  friend bool operator<= <>(const Array2d<T>& x, 
                                                    const Array2d<T>& y);

  friend bool operator>= <>(const Array2d<T>& x, 
                                                    const Array2d<T>& y);


  pointer operator[](const size_type i);

  const_pointer operator[](const size_type i) const;


  reference operator()(const size_type i,
                                       const size_type j);
 
  const_reference operator()(const size_type i,
                                                     const size_type j) const;

  reference operator()(const Point2d<size_type>& point2d);
 
  const_reference operator()(const Point2d<size_type>& point2d) const;


  self operator()(const Range<int>& row_range,
                                  const Range<int>& col_range);
 

  std::string name() const;


  size_type dim1() const;

  size_type rows() const;
  
  size_type dim2() const;

  size_type columns() const;

  size_type cols() const;

  size_type size() const;

  size_type max_size() const;

  bool empty()const;

  void swap(self& M);
 
private:
  size_type d1_;
  size_type d2_;
  size_type size_;
  T** data_;
  
  void allocate();
  void desallocate();
  void copy_attributes(const self& rhs);

 
    friend class boost::serialization::access;
    template<class Archive>
    void save(Archive & ar, const unsigned int version) const
    {
      ar & this->d1_ & this->d2_ & this->size_ ;
      for(std::size_t i = 0; i < this->size_; ++i)
                {
                  ar & data_[0][i];
                }
    }
    template<class Archive>
    void load(Archive & ar, const unsigned int version)
    {
      ar & this->d1_ & this->d2_ & this->size_ ;
      this->desallocate();
      this->allocate();
       for(std::size_t i = 0; i < this->size_; ++i)
                {
                  ar & data_[0][i];
                }
    }
    BOOST_SERIALIZATION_SPLIT_MEMBER();
};
 // end of Containers2d group

  typedef slip::Array2d<double> Array2d_d;
  typedef slip::Array2d<float> Array2d_f;
  typedef slip::Array2d<long> Array2d_l;
  typedef slip::Array2d<unsigned long> Array2d_ul;
  typedef slip::Array2d<short> Array2d_s;
  typedef slip::Array2d<unsigned short> Array2d_us;
  typedef slip::Array2d<int> Array2d_i;
  typedef slip::Array2d<unsigned int> Array2d_ui;
  typedef slip::Array2d<char> Array2d_c;
  typedef slip::Array2d<unsigned char> Array2d_uc;
  

}//slip::

namespace slip
{
  template<typename T>
  inline
  Array2d<T>::Array2d():
    d1_(0),d2_(0),size_(0),data_(0)
  {}

  template<typename T>
  inline
  Array2d<T>::Array2d(const typename Array2d<T>::size_type d1,
                                      const typename Array2d<T>::size_type d2):
    d1_(d1),d2_(d2),size_(d1*d2)
  {
    this->allocate();
    std::fill_n(this->data_[0],this->size_,T());
  }
  
  template<typename T>
  inline
  Array2d<T>::Array2d(const typename Array2d<T>::size_type d1,
                                    const typename Array2d<T>::size_type d2, 
                                    const T& val):
    d1_(d1),d2_(d2),size_(d1*d2)
  {
    this->allocate();
    std::fill_n(this->data_[0],this->size_,val);
  }

  template<typename T>
  inline
  Array2d<T>::Array2d(const typename Array2d<T>::size_type d1,
                                    const typename Array2d<T>::size_type d2, 
                                    const T* val):
    d1_(d1),d2_(d2),size_(d1*d2)
  {
    this->allocate();
    std::copy(val,val + this->size_, this->data_[0]); 
  }
  
  template<typename T>
  inline
  Array2d<T>::Array2d(const Array2d<T>& rhs):
    d1_(rhs.d1_),d2_(rhs.d2_),size_(rhs.size_)
  {
    this->allocate();
    if(this->size_ != 0)
      {
                std::copy(rhs.data_[0],rhs.data_[0] + this->size_,this->data_[0]);
      }
  }
  
  template<typename T>
  inline
  Array2d<T>& Array2d<T>::operator=(const Array2d<T> & rhs)
  {
    if(this != &rhs)
      {
                if( this->d1_ != rhs.d1_ || this->d2_ != rhs.d2_)
                  {
                    this->desallocate();
                    this->copy_attributes(rhs);
                    this->allocate();
                  }
                if(rhs.size_ != 0)
                  {
                    std::copy(rhs.data_[0],rhs.data_[0] + this->size_,this->data_[0]);
                  }
      }
    return *this;
  }
  
  template<typename T>
  inline
  void Array2d<T>::resize(const typename Array2d<T>::size_type d1,
                                                  const typename Array2d<T>::size_type d2,
                                                  const T& val)
  {
    if( this->d1_ != d1 || this->d2_ != d2 )
      {
                this->desallocate();
                this->d1_ = d1;
                this->d2_ = d2;
                this->size_ = d1 * d2;
                this->allocate();
      }
    if((this->d1_ != 0) && (this->d2_ != 0))
      {
                std::fill_n(this->data_[0],this->size_,val);
      }
    
  }


  template<typename T>
  inline
  typename Array2d<T>::iterator Array2d<T>::begin()
  {
    return this->data_[0];
  }

  template<typename T>
  inline
  typename Array2d<T>::iterator Array2d<T>::end()
  {
    return this->data_[0] + this->size_;
  }
  
  template<typename T>
  inline
  typename Array2d<T>::const_iterator Array2d<T>::begin() const
  {
    return this->data_[0];
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator Array2d<T>::end() const
  {
    return this->data_[0] + this->size_;
  }
  

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator Array2d<T>::rbegin()
  {
    return typename Array2d<T>::reverse_iterator(this->end());
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator Array2d<T>::rbegin() const
  {
    return typename Array2d<T>::const_reverse_iterator(this->end());
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator Array2d<T>::rend()
  {
    return typename Array2d<T>::reverse_iterator(this->begin());
  }

  
  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator Array2d<T>::rend() const
  {
    return  typename Array2d<T>::const_reverse_iterator(this->begin());
  }

  template<typename T>
  inline
  typename Array2d<T>::row_iterator 
  Array2d<T>::row_begin(const typename Array2d<T>::size_type row)
  {
    assert(row < this->d1_);
    return this->data_[row];
  }
 
  template<typename T>
  inline
  typename Array2d<T>::const_row_iterator 
  Array2d<T>::row_begin(const typename Array2d<T>::size_type row) const
  {
    assert(row < this->d1_);
    return this->data_[row];
  }

  template<typename T>
  inline
  typename Array2d<T>::row_range_iterator 
  Array2d<T>::row_begin(const typename Array2d<T>::size_type row,
                                                const slip::Range<int>& range)
  {
    assert(row < this->d1_);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < (int)this->d2_);
    assert(range.stop()  < (int)this->d2_);
    return slip::stride_iterator<typename Array2d<T>::row_iterator>(this->row_begin(row) + range.start(),range.stride());
  }

  template<typename T>
  inline
  typename Array2d<T>::const_row_range_iterator 
  Array2d<T>::row_begin(const typename Array2d<T>::size_type row,
                                                const slip::Range<int>& range) const
  {
    assert(row < this->d1_);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < (int)this->d2_);
    assert(range.stop() < (int)this->d2_);
    return slip::stride_iterator<typename Array2d<T>::const_row_iterator>(this->row_begin(row) + range.start(),range.stride());
  }
  
  template<typename T>
  inline
  typename Array2d<T>::col_range_iterator 
  Array2d<T>::col_begin(const typename Array2d<T>::size_type col,
                                                const slip::Range<int>& range)
  {
    assert(col < this->d2_);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < (int)this->d1_);
    assert(range.stop()  < (int)this->d1_);
    return slip::stride_iterator<typename Array2d<T>::col_iterator>(this->col_begin(col) + range.start(),range.stride());
  }

  template<typename T>
  inline
  typename Array2d<T>::const_col_range_iterator 
  Array2d<T>::col_begin(const typename Array2d<T>::size_type col,
                                                const slip::Range<int>& range) const
  {
    assert(col < this->d2_);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < (int)this->d1_);
    assert(range.stop()  < (int)this->d1_);
    return slip::stride_iterator<typename Array2d<T>::const_col_iterator>(this->col_begin(col) + range.start(),range.stride());
  }

 template<typename T>
 inline
 typename Array2d<T>::row_iterator 
 Array2d<T>::row_end(const typename Array2d<T>::size_type row)
 {
    assert(row < this->d1_);
    return this->data_[row] + this->d2_;
  }

 template<typename T>
 inline
 typename Array2d<T>::const_row_iterator 
 Array2d<T>::row_end(const typename Array2d<T>::size_type row) const
 {
    assert(row < this->d1_);
    return this->data_[row] + this->d2_;
  }
  
  template<typename T>
  inline
  typename Array2d<T>::row_range_iterator 
  Array2d<T>::row_end(const typename Array2d<T>::size_type row,
                                      const slip::Range<int>& range)
  {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    assert(range.stop()  < (int)this->d2_);
    //  return ++(slip::stride_iterator<typename Array2d<T>::row_iterator>(this->data_[row] + range.stop(),range.stride()));
    return ++(this->row_begin(row,range) + range.iterations());
  }

  template<typename T>
 inline
 typename Array2d<T>::const_row_range_iterator 
 Array2d<T>::row_end(const typename Array2d<T>::size_type row,
                                     const slip::Range<int>& range) const
 {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    assert(range.stop()  < (int)this->d2_);
    // return ++(slip::stride_iterator<typename Array2d<T>::const_row_iterator>(this->data_[row] + range.stop(),range.stride()));
    return ++(this->row_begin(row,range) + range.iterations());
  }

  template<typename T>
  inline
  typename Array2d<T>::col_range_iterator 
  Array2d<T>::col_end(const typename Array2d<T>::size_type col,
                                      const slip::Range<int>& range)
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    assert(range.stop()  < (int)this->d1_);
    //  return ++(slip::stride_iterator<typename Array2d<T>::col_iterator>(this->col_begin(col) + range.stop(),range.stride()));
    return ++(this->col_begin(col,range) + range.iterations());
  }

  template<typename T>
  inline
  typename Array2d<T>::const_col_range_iterator 
  Array2d<T>::col_end(const typename Array2d<T>::size_type col,
                                      const slip::Range<int>& range) const
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    assert(range.stop()  < (int)this->d1_);
    //  return ++(slip::stride_iterator<typename Array2d<T>::const_col_iterator>(this->col_begin(col) + range.stop(),range.stride()));
    return ++(this->col_begin(col,range) + range.iterations());
  }

  template<typename T>
  inline
  typename Array2d<T>::col_iterator 
  Array2d<T>::col_begin(const typename Array2d<T>::size_type col)
  {
    assert(col < this->d2_);
    return typename Array2d<T>::col_iterator(this->data_[0] + col,this->d2_);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_col_iterator 
  Array2d<T>::col_begin(const typename Array2d<T>::size_type col) const
  {
    assert(col < this->d2_);
    return typename Array2d<T>::const_col_iterator(this->data_[0] + col,this->d2_);
  }

  template<typename T>
  inline
  typename Array2d<T>::col_iterator 
  Array2d<T>::col_end(const typename Array2d<T>::size_type col)
  {
    assert(col < this->d2_);
    return ++(typename Array2d<T>::col_iterator(this->data_[this->d1_- 1] + col,this->d2_));
  }
  
  template<typename T>
  inline
  typename Array2d<T>::const_col_iterator 
  Array2d<T>::col_end(const typename Array2d<T>::size_type col) const
  {
    assert(col < this->d2_);
    return ++(typename Array2d<T>::const_col_iterator(this->data_[this->d1_- 1] + col,this->d2_));
  }


  template<typename T>
  inline
  typename Array2d<T>::reverse_row_iterator 
  Array2d<T>::row_rbegin(const typename Array2d<T>::size_type row)
  {
    return typename Array2d<T>::reverse_row_iterator(this->row_end(row));
  }
 
  template<typename T>
  inline
  typename Array2d<T>::const_reverse_row_iterator 
  Array2d<T>::row_rbegin(const typename Array2d<T>::size_type row) const
  {
    return typename Array2d<T>::const_reverse_row_iterator(this->row_end(row));
  }
  
  template<typename T>
  inline
  typename Array2d<T>::reverse_row_iterator 
  Array2d<T>::row_rend(const typename Array2d<T>::size_type row)
  {
    return typename Array2d<T>::reverse_row_iterator(this->row_begin(row));
  }
 
  template<typename T>
  inline
  typename Array2d<T>::const_reverse_row_iterator 
  Array2d<T>::row_rend(const typename Array2d<T>::size_type row) const
  {
    return typename Array2d<T>::const_reverse_row_iterator(this->row_begin(row));
  }

  
  template<typename T>
  inline
  typename Array2d<T>::reverse_col_iterator 
  Array2d<T>::col_rbegin(const typename Array2d<T>::size_type col)
  {
    return typename Array2d<T>::reverse_col_iterator(this->col_end(col));
  }
 
  template<typename T>
  inline
  typename Array2d<T>::const_reverse_col_iterator 
  Array2d<T>::col_rbegin(const typename Array2d<T>::size_type col) const
  {
    return typename Array2d<T>::const_reverse_col_iterator(this->col_end(col));
  }
  
  template<typename T>
  inline
  typename Array2d<T>::reverse_col_iterator 
  Array2d<T>::col_rend(const typename Array2d<T>::size_type col)
  {
    return typename Array2d<T>::reverse_col_iterator(this->col_begin(col));
  }
 
  template<typename T>
  inline
  typename Array2d<T>::const_reverse_col_iterator 
  Array2d<T>::col_rend(const typename Array2d<T>::size_type col) const
  {
    return typename Array2d<T>::const_reverse_col_iterator(this->col_begin(col));
  }
  //------------
  template<typename T>
  inline
  typename Array2d<T>::reverse_row_range_iterator 
  Array2d<T>::row_rbegin(const typename Array2d<T>::size_type row,
                                                 const slip::Range<int>& range)
  {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    return typename Array2d<T>::reverse_row_range_iterator(this->row_end(row,range));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_row_range_iterator 
  Array2d<T>::row_rbegin(const typename Array2d<T>::size_type row,
                                                 const slip::Range<int>& range) const
  {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    return typename Array2d<T>::const_reverse_row_range_iterator(this->row_end(row,range));
  }


  template<typename T>
  inline
  typename Array2d<T>::reverse_col_range_iterator 
  Array2d<T>::col_rbegin(const typename Array2d<T>::size_type col,
                                                 const slip::Range<int>& range)
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    return typename Array2d<T>::reverse_col_range_iterator(this->col_end(col,range));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_col_range_iterator 
  Array2d<T>::col_rbegin(const typename Array2d<T>::size_type col,
                                                 const slip::Range<int>& range) const
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    return typename Array2d<T>::const_reverse_col_range_iterator(this->col_end(col,range));
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_row_range_iterator 
  Array2d<T>::row_rend(const typename Array2d<T>::size_type row,
                                       const slip::Range<int>& range)
  {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    return typename Array2d<T>::reverse_row_range_iterator(this->row_begin(row,range));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_row_range_iterator 
  Array2d<T>::row_rend(const typename Array2d<T>::size_type row,
                                                 const slip::Range<int>& range) const
  {
    assert(row < this->d1_);
    assert(range.start() < (int)this->d2_);
    return typename Array2d<T>::const_reverse_row_range_iterator(this->row_begin(row,range));
  }


  template<typename T>
  inline
  typename Array2d<T>::reverse_col_range_iterator 
  Array2d<T>::col_rend(const typename Array2d<T>::size_type col,
                                       const slip::Range<int>& range)
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    return typename Array2d<T>::reverse_col_range_iterator(this->col_begin(col,range));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_col_range_iterator 
  Array2d<T>::col_rend(const typename Array2d<T>::size_type col,
                                       const slip::Range<int>& range) const
  {
    assert(col < this->d2_);
    assert(range.start() < (int)this->d1_);
    return typename Array2d<T>::const_reverse_col_range_iterator(this->col_begin(col,range));
  }


  template<typename T>
  inline
  typename Array2d<T>::iterator2d Array2d<T>::upper_left()
  {
    return typename Array2d<T>::iterator2d(this,Box2d<int>(0,0,this->d1_-1,this->d2_-1));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d Array2d<T>::upper_left() const
  {
    return typename Array2d<T>::const_iterator2d(this,Box2d<int>(0,0,this->d1_-1,this->d2_-1));
  }


  template<typename T>
  inline
  typename Array2d<T>::iterator2d Array2d<T>::bottom_right()
  {
     DPoint2d<int> dp(this->d1_,this->d2_);
     typename Array2d<T>::iterator2d it = (*this).upper_left() + dp;
    return it;
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d Array2d<T>::bottom_right() const
  {
    DPoint2d<int> dp(this->d1_,this->d2_);
    typename Array2d<T>::const_iterator2d it = (*this).upper_left() + dp;
    return it;
  }

  template<typename T>
  inline
  typename Array2d<T>::iterator2d Array2d<T>::upper_left(const Box2d<int>& box)
  {
    return typename Array2d<T>::iterator2d(this,box);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d Array2d<T>::upper_left(const Box2d<int>& box) const
  {
    return typename Array2d<T>::const_iterator2d(this,box);
  }


  template<typename T>
  inline
  typename Array2d<T>::iterator2d 
  Array2d<T>::bottom_right(const Box2d<int>& box)
  {
    DPoint2d<int> dp(box.height(),box.width());
    typename Array2d<T>::iterator2d it = (*this).upper_left(box) + dp;
    return it;
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d 
  Array2d<T>::bottom_right(const Box2d<int>& box) const
  {
    DPoint2d<int> dp(box.height(),box.width());
    typename Array2d<T>::const_iterator2d it = (*this).upper_left(box) + dp;
    return it;
  }
  
  template<typename T>
  inline
  typename Array2d<T>::iterator2d_range 
  Array2d<T>::upper_left(const Range<int>& row_range,
                                                 const Range<int>& col_range)
  {
    return typename Array2d<T>::iterator2d_range(this,row_range,col_range);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d_range 
  Array2d<T>::upper_left(const Range<int>& row_range,
                                                 const Range<int>& col_range) const
  {
    return typename Array2d<T>::const_iterator2d_range(this,row_range,col_range);
  }

  template<typename T>
  inline
  typename Array2d<T>::iterator2d_range 
  Array2d<T>::bottom_right(const Range<int>& row_range,
                                                   const Range<int>& col_range)
  {
     DPoint2d<int> dp(row_range.iterations()+1,col_range.iterations()+1);
    return  typename Array2d<T>::iterator2d_range((*this).upper_left(row_range,col_range) + dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d_range 
  Array2d<T>::bottom_right(const Range<int>& row_range,
                                                   const Range<int>& col_range) const
  {
    DPoint2d<int> dp(row_range.iterations()+1,col_range.iterations()+1);
    return  typename Array2d<T>::const_iterator2d_range ((*this).upper_left(row_range,col_range) + dp);
  }


   template<typename T>
  inline
  typename Array2d<T>::iterator2d_range 
  Array2d<T>::upper_left(const Range<int>& range)
  {
    return this->upper_left(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d_range 
  Array2d<T>::upper_left(const Range<int>& range) const
  {
    return this->upper_left(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::iterator2d_range 
  Array2d<T>::bottom_right(const Range<int>& range)
  {
    return this->bottom_right(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_iterator2d_range 
  Array2d<T>::bottom_right(const Range<int>& range) const
  {
    return this->bottom_right(range,range);
  }
  //--
  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d 
  Array2d<T>::rbottom_right()
  {
    return typename Array2d<T>::reverse_iterator2d(this->upper_left());
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d 
  Array2d<T>::rbottom_right() const
  {
    return typename Array2d<T>::const_reverse_iterator2d(this->upper_left());
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d 
  Array2d<T>::rupper_left()
  {
    slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::reverse_iterator2d(this->bottom_right() - dp);
   }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d 
  Array2d<T>::rupper_left() const
  {
    slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::const_reverse_iterator2d(this->bottom_right()-dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d 
  Array2d<T>::rbottom_right(const Box2d<int>& box)
  {
    return typename Array2d<T>::reverse_iterator2d(this->upper_left(box));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d 
  Array2d<T>::rbottom_right(const Box2d<int>& box) const
  {
    return typename Array2d<T>::const_reverse_iterator2d(this->upper_left(box));
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d 
  Array2d<T>::rupper_left(const Box2d<int>& box)
  {
     slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::reverse_iterator2d(this->bottom_right(box) - dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d 
  Array2d<T>::rupper_left(const Box2d<int>& box) const
  {
    slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::const_reverse_iterator2d(this->bottom_right(box) - dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d_range 
  Array2d<T>::rupper_left(const Range<int>& row_range,
                                                  const Range<int>& col_range)
  {
    slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::reverse_iterator2d_range(this->bottom_right(row_range,col_range) - dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d_range 
  Array2d<T>::rupper_left(const Range<int>& row_range,
                                                 const Range<int>& col_range) const
  {
    slip::DPoint2d<int> dp(1,0);
    return typename Array2d<T>::const_reverse_iterator2d_range(this->bottom_right(row_range,col_range)- dp);
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d_range 
  Array2d<T>::rbottom_right(const Range<int>& row_range,
                                                    const Range<int>& col_range)
  {
    return typename Array2d<T>::reverse_iterator2d_range(this->upper_left(row_range,col_range));
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d_range 
  Array2d<T>::rbottom_right(const Range<int>& row_range,
                                                    const Range<int>& col_range) const
  {
    return typename Array2d<T>::const_reverse_iterator2d_range(this->upper_left(row_range,col_range));
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d_range 
  Array2d<T>::rupper_left(const Range<int>& range)
  {
    return this->rupper_left(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d_range 
  Array2d<T>::rupper_left(const Range<int>& range) const
  {
    return this->rupper_left(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::reverse_iterator2d_range 
  Array2d<T>::rbottom_right(const Range<int>& range)
  {
    return this->rbottom_right(range,range);
  }

  template<typename T>
  inline
  typename Array2d<T>::const_reverse_iterator2d_range 
  Array2d<T>::rbottom_right(const Range<int>& range) const
  {
    return this->rbottom_right(range,range);
  }
 
  /* @{ */
  template <typename T>
  inline
  std::ostream& operator<<(std::ostream & out, const Array2d<T>& a)
  {
    for(std::size_t i = 0; i < a.d1_; ++i)
      {
                for(std::size_t j = 0; j < a.d2_; ++j)
                  {
                    out<<a[i][j]<<" ";
                  }
                out<<std::endl;
      }         
    //  out<<std::endl;
    return out;
  }
  /* @} */

  template<typename T>
  inline
  typename Array2d<T>::pointer 
  Array2d<T>::operator[](const typename Array2d<T>::size_type i)
  {
    assert(this->data_ != 0);
    assert(i < this->size_);
    return this->data_[i];
  }
  
  template<typename T>
  inline
  typename Array2d<T>::const_pointer 
  Array2d<T>::operator[](const typename Array2d<T>::size_type i) const 
  {
    assert(this->data_ != 0);
    assert(i < this->size_);
    return this->data_[i];
  }
  
  template<typename T>
  inline
  typename Array2d<T>::reference 
  Array2d<T>::operator()(const typename Array2d<T>::size_type i,
                                                 const typename Array2d<T>::size_type j)
  {
    assert(this->data_ != 0);
    assert(i < this->d1_);
    assert(j < this->d2_);
    return this->data_[i][j];
  }
  
  template<typename T>
  inline
  typename Array2d<T>::const_reference 
  Array2d<T>::operator()(const typename Array2d<T>::size_type i,
                                                 const typename Array2d<T>::size_type j) const
  {
    assert(this->data_ != 0);
    assert(i < this->d1_);
    assert(j < this->d2_);
    return this->data_[i][j];
  }
                
  template<typename T>
  inline
  typename Array2d<T>::reference 
  Array2d<T>::operator()(const Point2d<typename Array2d<T>::size_type>& point2d)
  {
    assert(this->data_ != 0);
    assert(point2d[0] < this->d1_);
    assert(point2d[1] < this->d2_);
    return this->data_[point2d[0]][point2d[1]];
  }
  
  template<typename T>
  inline
  typename Array2d<T>::const_reference 
  Array2d<T>::operator()(const Point2d<typename Array2d<T>::size_type>& point2d) const
  {
    assert(this->data_ != 0);
    assert(point2d[0] < this->d1_);
    assert(point2d[1] < this->d2_);
    return this->data_[point2d[0]][point2d[1]];
  }


  template<typename T>
  inline
  Array2d<T> 
  Array2d<T>::operator()(const Range<int>& row_range,
                                                 const Range<int>& col_range)
  {
     assert(this->data_ != 0);
     assert(row_range.is_valid());
     assert(row_range.start() < (int)this->d2_);
     assert(row_range.stop()  < (int)this->d2_);
     assert(col_range.is_valid());
     assert(col_range.start() < (int)this->d1_);
     assert(col_range.stop()  < (int)this->d1_);
     std::size_t rows = row_range.iterations() + 1;
     std::size_t cols = col_range.iterations() + 1;
     return Array2d<T>(rows,cols,this->upper_left(row_range,col_range),
                                       this->bottom_right(row_range,col_range));
  }


  template<typename T>
  inline
  std::string 
  Array2d<T>::name() const {return "Array2d";} 
  

  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::dim1() const {return this->d1_;} 
  
  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::rows() const {return this->dim1();} 
  

  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::dim2() const {return this->d2_;} 
  
  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::columns() const {return this->dim2();} 
  
  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::cols() const {return this->dim2();} 
  
  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::size() const {return this->size_;}

  template<typename T>
  inline
  typename Array2d<T>::size_type 
  Array2d<T>::max_size() const 
  {
    return typename Array2d<T>::size_type(-1)/sizeof(T);
  }


  template<typename T>
  inline
  bool Array2d<T>::empty()const {return this->size_ == 0;}

  template<typename T>
  inline
  void Array2d<T>::swap(Array2d<T>& M)
  {
    assert(this->d1_ == M.d1_);
    assert(this->d2_ == M.d2_);
    std::swap_ranges(this->begin(),this->end(),M.begin());
  }

  template<typename T>
  inline
  Array2d<T>::~Array2d()
  {
    this->desallocate();
  }
  
  template<typename T>
  inline
  void Array2d<T>::allocate()
  {
    if((this->d1_ != 0) && (this->d2_ != 0))
      {
                this->data_ = new T*[this->d1_];
                //the first row of data_ "contains" all the elements 
                //of the 2D array 
                this->data_[0] = new T[this->d1_ * this->d2_];
                //the other elements of the data_ array contains pointers to the
                //other rows of the 2D array
                for(typename Array2d<T>::size_type i = 1; i < this->d1_; ++i)
                  {
                    this->data_[i] = this->data_[i - 1] + this->d2_;
                  }  
      }
    else
      {
                this->data_ = 0;
      }
  }

  template<typename T>
  inline
  void Array2d<T>::desallocate()
  {
    if(this->data_ != 0)
      {
                delete[] (this->data_[0]);
                delete[] (this->data_);
      }
  }

  template<typename T>
  inline
  void Array2d<T>::copy_attributes(const Array2d<T>& rhs)
  {
    this->d1_ = rhs.d1_;
    this->d2_ = rhs.d2_;
    this->size_ = rhs.d1_ * rhs.d2_;
  }

  /* @{ */
template<typename T>
inline
bool operator==(const Array2d<T>& x, 
                                const Array2d<T>& y)
{
  return ( x.size() == y.size()
                   && std::equal(x.begin(),x.end(),y.begin())); 
}

template<typename T>
inline
bool operator!=(const Array2d<T>& x, 
                                const Array2d<T>& y)
{
  return !(x == y);
}

/* @} */

  /* @{ */
template<typename T>
inline
bool operator<(const Array2d<T>& x, 
                       const Array2d<T>& y)
{
  return std::lexicographical_compare(x.begin(), x.end(),
                                                                      y.begin(), y.end());
}


template<typename T>
inline
bool operator>(const Array2d<T>& x, 
                       const Array2d<T>& y)
{
  return (y < x);
}

template<typename T>
inline
bool operator<=(const Array2d<T>& x, 
                                const Array2d<T>& y)
{
  return !(y < x);
}

template<typename T>
inline
bool operator>=(const Array2d<T>& x, 
                                const Array2d<T>& y)
{
  return !(x < y);
} 
/* @} */

}//slip::

#endif //SLIP_ARRAY2D_HPP