block.h

Go to the documentation of this file.

/* This software and supporting documentation are distributed by
 *     Institut Federatif de Recherche 49
 *     CEA/NeuroSpin, Batiment 145,
 *     91191 Gif-sur-Yvette cedex
 *     France
 *
 * This software is governed by the CeCILL-B 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-B 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-B license and that you accept its terms.
 */

#ifndef CARTOBASE_BLOCK_BLOCK_H
#define CARTOBASE_BLOCK_BLOCK_H


#include <cartobase/config/cartobase_config.h>
#include <iterator>
#include <assert.h>


namespace carto
{

template < class T, size_t N >
struct block
{

  typedef T value_type;
  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 size_t size_type;

  typedef pointer iterator;
  typedef const_pointer const_iterator;

#if defined(CARTO_NO_PARTIAL_TEMPLATE_SPECIALIZATION)

  typedef std::reverse_iterator< iterator, value_type > reverse_iterator;
  typedef std::reverse_iterator< const_iterator,
                                 value_type > const_reverse_iterator;
#else

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

#endif

  reference operator[]( size_t d );
  const_reference operator[]( size_t d ) const;

  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;

  size_type size() const;
  size_type max_size() const;
  bool empty() const;

  T data[ N ];

};


} // namespace carto


template < class T, size_t  N>
inline
typename carto::block< T, N >::reference 
carto::block< T, N >::operator[]( size_t d )
{

  assert( d < N );
  return data[ d ];

}


template < class T, size_t N >
inline
typename carto::block< T, N >::const_reference 
carto::block< T, N >::operator[]( size_t d ) const
{

  assert( d < N );
  return data[ d ];

}


template < class T, size_t N >
inline
typename carto::block< T, N >::iterator carto::block< T, N >::begin()
{

  return data;

}


template < class T, size_t N >
inline
typename carto::block< T, N >::iterator carto::block< T, N >::end()
{

  return data + N;

}


template < class T, size_t N >
inline
typename carto::block< T, N >::const_iterator 
carto::block< T, N >::begin() const
{

  return data;

}


template < class T, size_t N >
inline
typename carto::block< T, N >::const_iterator carto::block< T, N >::end() const
{

  return data + N;

}


template < class T, size_t N >
inline
typename carto::block< T, N >::reverse_iterator carto::block< T, N >::rbegin()
{

  return reverse_iterator( end() );

}


template < class T, size_t N >
inline
typename carto::block< T, N >::reverse_iterator carto::block< T, N >::rend()
{

  return reverse_iterator( begin() );

}


template < class T, size_t N >
inline
typename carto::block< T, N >::const_reverse_iterator 
carto::block< T, N >::rbegin() const
{

  return const_reverse_iterator( end() );

}


template < class T, size_t N >
inline
typename carto::block< T, N >::const_reverse_iterator 
carto::block< T, N >::rend() const
{

  return const_reverse_iterator( begin() );

}


template < class T, size_t N >
inline
typename carto::block< T, N >::size_type carto::block< T, N >::size() const
{

  return N;

}


template < class T, size_t N >
inline
typename carto::block< T, N >::size_type carto::block< T, N >::max_size() const
{

  return N;

}


template < class T, size_t N >
inline
bool carto::block< T, N >::empty() const
{

  return N == 0;

}


template < class T, size_t N >
inline
bool operator==( const carto::block< T, N >& b1,
                 const carto::block< T, N >& b2)
{

  for ( size_t n = 0; n < N; ++n )
    if ( b1.data[ n ] != b2.data[ n ] )
      return false;
  return true;

}


#endif