Block2d.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_BLOCK2D_HPP
#define SLIP_BLOCK2D_HPP

#include <iostream>
#include <iterator>
#include <cassert>
#include <string>
#include <cstddef>
#include "Box2d.hpp"
#include "Point2d.hpp"
#include "DPoint2d.hpp"
#include "Range.hpp"
#include "kstride_iterator.hpp"
#include "stride_iterator.hpp"
#include "iterator2d_box.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, int NC>
class kstride_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, std::size_t NR, std::size_t NC>
struct block2d;

template <typename T, std::size_t NR, std::size_t NC>
std::ostream& operator<<(std::ostream & out,
                                                 const slip::block2d<T,NR,NC>& b);

template <typename T, std::size_t NR, std::size_t NC>
bool operator==(const slip:: block2d<T,NR,NC>& x, 
                                const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
bool operator!=(const slip::block2d<T,NR,NC>& x, 
                                const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
bool operator<(const slip::block2d<T,NR,NC>& x, 
                       const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
bool operator>(const slip::block2d<T,NR,NC>& x, 
                       const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
bool operator<=(const slip::block2d<T,NR,NC>& x, 
                                const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
bool operator>=(const slip::block2d<T,NR,NC>& x, 
                                const slip::block2d<T,NR,NC>& y);

template <typename T, std::size_t NR, std::size_t NC>
struct block2d
{
  typedef T value_type;
  typedef block2d<T,NR,NC> self;
  typedef const block2d<T,NR,NC> const_self;
  
  typedef value_type* pointer;
  typedef const value_type* const_pointer;
  typedef value_type& reference;
  typedef const value_type& const_reference;

  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::kstride_iterator<pointer,NC> col_iterator;
  typedef slip::kstride_iterator<const_pointer,NC> 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 SIZE = NR * NC;

  static const std::size_t DIM = 2;
 
 
 
  iterator begin() {return data;}
  

 
  const_iterator begin() const {return data;}

 
  iterator end() {return data + SIZE;}
 
 
  const_iterator end() const {return data + SIZE;}


  reverse_iterator rbegin() {return reverse_iterator(this->end());}

  const_reverse_iterator rbegin() const {return const_reverse_iterator(this->end());}

  reverse_iterator rend() {return reverse_iterator(this->begin());}

  
  const_reverse_iterator rend() const {return const_reverse_iterator(this->begin());}
  


  row_iterator row_begin(const size_type row) 
  {
    return this->data + NC * row;
  }

  
  const_row_iterator row_begin(const size_type row) const
  {
    return this->data + NC * row;
  }


  col_iterator col_begin(const size_type col)
  {
    return col_iterator(this->data + col);    
  }


  const_col_iterator col_begin(const size_type col) const
  {
    return const_col_iterator(this->data + col);
  }

  row_iterator row_end(const size_type row)
  {
    return  this->row_begin(row) + NR - 1;
  }


  const_row_iterator row_end(const size_type row) const
  {
     return  this->row_begin(row) + NR - 1;
  }

  col_iterator col_end(const size_type col)
  {
    return col_iterator(this->data + NR * (NR - 1) + col);  
  }


  const_col_iterator col_end(const size_type col) const
  {
    return const_col_iterator(this->data + NR *(NR - 1) + col);
  }



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

  row_range_iterator row_end(const size_type row,
                                                     const slip::Range<int>& range)
  {
    assert(row < NR);
    assert(range.start() < int(NC));
    assert(range.stop()  < int(NC));
    return ++(slip::stride_iterator<typename block2d<T,NR,NC>::row_iterator>(this->row_begin(row) + range.start() + range.iterations() * range.stride(),range.stride()));
  }

  const_row_range_iterator row_begin(const size_type row,
                                                                     const slip::Range<int>& range) const
  {
    assert(row < NR);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < int(NC));
    assert(range.stop()  < int(NC));
    return slip::stride_iterator<typename block2d<T,NR,NC>::const_row_iterator>(this->row_begin(row) + range.start(),range.stride());
  }



  const_row_range_iterator row_end(const size_type row,
                                                                   const slip::Range<int>& range) const
  {
    assert(row < NR);
    assert(range.start() < int(NC));
    assert(range.stop()  < int(NC));
    return ++(slip::stride_iterator<typename block2d<T,NR,NC>::const_row_iterator>(this->row_begin(row) + range.start() + range.stride() * range.iterations(),range.stride()));
  }


  col_range_iterator col_begin(const size_type col,
                                                       const slip::Range<int>& range)
  {
    assert(col < NC);
    assert(range.is_valid());
    assert(range.start() >= 0);
    assert(range.stop()  >= 0);
    assert(range.start() < int(NR));
    assert(range.stop()  < int(NR));
    return slip::stride_iterator<typename block2d<T,NR,NC>::col_iterator>(this->col_begin(col) + range.start(),range.stride());
  }

  col_range_iterator col_end(const size_type col,
                                                     const slip::Range<int>& range)
  {
    assert(col < NC);
    assert(range.start() < int(NR));
    assert(range.stop()  < int(NR));
    return ++(slip::stride_iterator<typename block2d<T,NR,NC>::col_iterator>(this->col_begin(col) + range.start() + range.stride() * range.iterations(),range.stride()));
  }




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

 
  const_col_range_iterator col_end(const size_type col,
                                                                   const slip::Range<int>& range) const
  {
    assert(col < NC);
    assert(range.start() < int(NR));
    assert(range.stop()  < int(NR));
    return ++(slip::stride_iterator<typename block2d<T,NR,NC>::const_col_iterator>(this->col_begin(col) + range.start() + range.stride() * range.iterations(),range.stride()));
  }

  

  reverse_row_iterator row_rbegin(const size_type row)
  {
     return reverse_row_iterator(this->row_end(row));
  }


  const_reverse_row_iterator row_rbegin(const size_type row) const
  {
    return const_reverse_iterator(this->row_end(row));
  }

  reverse_col_iterator col_rbegin(const size_type col)
  {
    return reverse_col_iterator(this->col_end(col));
  }

  const_reverse_col_iterator col_rbegin(const size_type col) const
  {
    return const_reverse_col_iterator(this->col_end(col));
  }

  reverse_row_iterator row_rend(const size_type row)
  {
    return reverse_row_iterator(this->row_begin(row)); 
  }

  const_reverse_row_iterator row_rend(const size_type row) const
  {
     return const_reverse_row_iterator(this->row_begin(row));
  }

  reverse_col_iterator col_rend(const size_type col)
  {
    return reverse_col_iterator(this->col_begin(col));
  }

  const_reverse_col_iterator col_rend(const size_type col) const
  {
    return const_reverse_col_iterator(this->col_begin(col)); 
  }

  reverse_row_range_iterator row_rbegin(const size_type row,
                                                                                const slip::Range<int>& range)
  {
    return typename block2d<T,NR,NC>::reverse_row_range_iterator(this->row_end(row,range));
  }

 
  reverse_row_range_iterator row_rend(const size_type row,
                                                                      const slip::Range<int>& range)
  {
    return typename block2d<T,NR,NC>::reverse_row_range_iterator(this->row_begin(row,range));
  }



  const_reverse_row_range_iterator row_rbegin(const size_type row,
                                                                                      const slip::Range<int>& range) const
  {
    return typename block2d<T,NR,NC>::const_reverse_row_range_iterator(this->row_end(row,range));
  }


  const_reverse_row_range_iterator row_rend(const size_type row,
                                                                                    const slip::Range<int>& range) const
  {
    return typename block2d<T,NR,NC>::const_reverse_row_range_iterator(this->row_begin(row,range));
  }
 
 


  reverse_col_range_iterator col_rbegin(const size_type col,
                                                                                const slip::Range<int>& range)
  {
     return typename block2d<T,NR,NC>::reverse_col_range_iterator(this->col_end(col,range));
  }

  reverse_col_range_iterator col_rend(const size_type col,
                                                                      const slip::Range<int>& range)
  {
     return typename block2d<T,NR,NC>::reverse_col_range_iterator(this->col_begin(col,range));
  }


  const_reverse_col_range_iterator 
  col_rbegin(const size_type col,
                     const slip::Range<int>& range) const
  {
    return typename block2d<T,NR,NC>::const_reverse_col_range_iterator(this->col_end(col,range));
  }

 
  const_reverse_col_range_iterator col_rend(const size_type col,
                                                                                    const slip::Range<int>& range) const
  {
    return typename block2d<T,NR,NC>::const_reverse_col_range_iterator(this->col_begin(col,range));
  }


 
  iterator2d upper_left()
  {
    return iterator2d(this,Box2d<int>(0,0,NR-1,NC-1));
  }

  const_iterator2d upper_left() const
  {
    return const_iterator2d(this,Box2d<int>(0,0,NR-1,NC-1));
  }

  iterator2d bottom_right()
  {
    DPoint2d<int> dp(NR,NC);
    iterator2d it = (*this).upper_left() + dp;
    return it;
  }

  const_iterator2d bottom_right() const
  {
    DPoint2d<int> dp(NR,NC);
    const_iterator2d it = (*this).upper_left() + dp;
    return it;
  }


  iterator2d upper_left(const Box2d<int>& box)
  {
    return iterator2d(this,box);
  }

  const_iterator2d upper_left(const Box2d<int>& box) const
  {
    return const_iterator2d(this,box);
  }

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

  const_iterator2d bottom_right(const Box2d<int>& box) const
  {
    DPoint2d<int> dp(box.height(),box.width());
    const_iterator2d it = (*this).upper_left(box) + dp;
    return it;
  }


  iterator2d_range upper_left(const Range<int>& row_range,
                                                      const Range<int>& col_range)
  {
    return typename block2d<T,NR,NC>::iterator2d_range(this,row_range,col_range);
  }

  iterator2d_range 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 block2d<T,NR,NC>::iterator2d_range((*this).upper_left(row_range,col_range) + dp);
  }


  const_iterator2d_range upper_left(const Range<int>& row_range,
                                                                    const Range<int>& col_range) const
  {
    return typename block2d<T,NR,NC>::const_iterator2d_range(this,row_range,col_range);
  }


  const_iterator2d_range 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 block2d<T,NR,NC>::const_iterator2d_range((*this).upper_left(row_range,col_range) + dp);
  }



 


  iterator2d_range upper_left(const Range<int>& range)
  {
    return this->upper_left(range,range);
  }
 

  iterator2d_range bottom_right(const Range<int>& range)
  {
    return this->bottom_right(range,range);
  }

 

  
  const_iterator2d_range upper_left(const Range<int>& range) const
  {
    return this->upper_left(range,range);
  }

 

  const_iterator2d_range bottom_right(const Range<int>& range) const
  {
    return this->bottom_right(range,range);
  }


  reverse_iterator2d rupper_left()
  {
    slip::DPoint2d<int> dp(1,0);
    return typename block2d<T,NR,NC>::reverse_iterator2d(this->bottom_right() - dp);
  }
  
  reverse_iterator2d rbottom_right()
  {
    return typename block2d<T,NR,NC>::reverse_iterator2d(this->upper_left());
  }

  const_reverse_iterator2d rupper_left() const
  {
    slip::DPoint2d<int> dp(1,0);
    return typename block2d<T,NR,NC>::const_reverse_iterator2d(this->bottom_right() - dp);
  }
 
 
  const_reverse_iterator2d rbottom_right() const
  {
    return typename block2d<T,NR,NC>::const_reverse_iterator2d(this->upper_left());
  }
  

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

  reverse_iterator2d rbottom_right(const Box2d<int>& box)
  {
    return typename block2d<T,NR,NC>::reverse_iterator2d(this->upper_left(box));
  }

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


  const_reverse_iterator2d rbottom_right(const Box2d<int>& box) const
  {
    return typename block2d<T,NR,NC>::const_reverse_iterator2d(this->upper_left(box));
  }

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


 
  reverse_iterator2d_range rbottom_right(const Range<int>& row_range,
                                                                                 const Range<int>& col_range)
  {
      return typename block2d<T,NR,NC>::reverse_iterator2d_range(this->upper_left(row_range,col_range));
  }


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

  const_reverse_iterator2d_range rbottom_right(const Range<int>& row_range,
                                                                                       const Range<int>& col_range) const
  {
    return typename block2d<T,NR,NC>::const_reverse_iterator2d_range(this->upper_left(row_range,col_range));
  }


 
  reverse_iterator2d_range rupper_left(const Range<int>& range)
  {
    return this->rupper_left(range,range);
  }



  reverse_iterator2d_range rbottom_right(const Range<int>& range)
  {
     return this->rbottom_right(range,range);
  }

  

  const_reverse_iterator2d_range rupper_left(const Range<int>& range) const
  {
    return this->rupper_left(range,range);
  }


  const_reverse_iterator2d_range rbottom_right(const Range<int>& range) const
  {
    return this->rbottom_right(range,range);
  }
  
 

  
  friend std::ostream& operator<< <>(std::ostream & out, 
                                                                     const block2d<T,NR,NC>& b);

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

  template<typename InputIterator>
  void fill(InputIterator first,
                    InputIterator last)
  {
    std::copy(first,last, this->begin());
  }

  self& operator=(const T& value)
  {
    this->fill(value);
    return *this;
  }
  friend bool operator== <>(const block2d<T,NR,NC>& x, 
                                                    const block2d<T,NR,NC>& y);
 

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

  friend bool operator> <>(const block2d<T,NR,NC>& x, 
                                                   const block2d<T,NR,NC>&y);

  friend bool operator<= <>(const block2d<T,NR,NC>& x, 
                                                    const block2d<T,NR,NC>& y);

  friend bool operator>= <>(const block2d<T,NR,NC>& x, 
                                                    const block2d<T,NR,NC>&y);

 
  pointer operator[](const size_type i) 
  {
    assert(i < NR);
    return this->data + NC * i;
  }

  const_pointer operator[](const size_type i) const
  {
    assert(i < NR);
    return this->data + NC * i;
  }

 
  reference operator()(const size_type i,
                                       const size_type j)
  {
    assert(i < NR);
    assert(j < NC);
    return this->data[i * NC + j];
  }
   
  const_reference operator()(const size_type i,
                                                     const size_type j) const
  {
    assert(i < NR);
    assert(j < NC);
    return this->data[i * NC + j];
  }

  reference operator()(const Point2d<size_type>& point2d)
  {
    assert(this->data != 0);
    assert(point2d[0] < NR);
    assert(point2d[1] < NC);
    return this->data[point2d[0] * NC + point2d[1]];
  }
 
  const_reference operator()(const Point2d<size_type>& point2d) const
  {
    assert(this->data != 0);
    assert(point2d[0] < NR);
    assert(point2d[1] < NC);
    return this->data[point2d[0] * NC + point2d[1]];
  }




  std::string name() const {return "block2d";}

  static size_type dim1() {return NR;}
  static size_type rows() {return NR;}
  static size_type dim2() {return NC;}
  static size_type columns() {return NC;}

  static size_type cols() {return NC;}
  
  static size_type size() {return SIZE;}
   
  static size_type max_size() {return SIZE;}

  static bool empty(){return SIZE == 0;}

  void swap(block2d<T,NR,NC>& x)
  {
     std::swap_ranges(begin(),end(),x.begin());
  }
 
  T data[SIZE];
private:
  friend class boost::serialization::access;
  template<class Archive>
    void save(Archive & ar, const unsigned int version) const
    {
      ar & data;
    }
  template<class Archive>
    void load(Archive & ar, const unsigned int version)
    {
      ar & data;
    }
  
  BOOST_SERIALIZATION_SPLIT_MEMBER()
};


}//slip::

namespace slip
{
  /* @{ */
  template<typename T,std::size_t NR, std::size_t NC>
  inline
  std::ostream& operator<<(std::ostream & out, 
                                                   const block2d<T,NR,NC>& b)
  {
    for(std::size_t i = 0; i < NR; ++i)
      {
                for(std::size_t j = 0; j < NC; ++j)
                  {
                    assert( (i * NC + j) < NR*NC);
                    out<<b.data[i * NC + j]<<" ";
                  }
                out<<std::endl;
      }         
    return out;
  }
/* @} */
  /* @{ */
  template <typename T, std::size_t NR, std::size_t NC>
  inline
  bool operator==(const block2d<T,NR,NC>& x, 
                                  const block2d<T,NR,NC>& y)
  {
    return ( x.size() == y.size()
                     && std::equal(x.begin(),x.end(),y.begin())); 
  }

  template <typename T, std::size_t NR, std::size_t NC>
  inline
  bool operator!=(const block2d<T,NR,NC>& x, 
                                  const block2d<T,NR,NC>& y)
  {
    return !(x == y);
  }

/* @} */

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

  template <typename T, std::size_t NR, std::size_t NC>
  inline
  bool operator>(const block2d<T,NR,NC>& x, 
                                 const block2d<T,NR,NC>& y)
  {
    return (y < x);
  }

  template <typename T, std::size_t NR, std::size_t NC>
  inline
  bool operator<=(const block2d<T,NR,NC>& x, 
                                  const block2d<T,NR,NC>& y)
  {
    return !(y < x);
  }

  template <typename T, std::size_t NR, std::size_t NC>
  inline
  bool operator>=(const block2d<T,NR,NC>& x, 
                                  const block2d<T,NR,NC>& y)
  {
    return !(x < y);
  }
  /* @} */

}//slip::

#endif //SLIP_BLOCK2D_HPP