volumebase_d.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 CARTODATA_VOLUME_VOLUMEBASE_D_H
#define CARTODATA_VOLUME_VOLUMEBASE_D_H
 
//--- cartodata --------------------------------------------------------------
#include <cartodata/volume/volumebase.h>
#include <cartodata/volume/volumebase_d_operators.h>
#include <cartodata/volume/volumebase_d_inline.h>
#include <cartodata/volume/volumebase_d_instantiate.h>
#include <cartodata/volume/volumeref.h>
#include <cartodata/volume/volumeproxy_d.h>
//--- cartobase --------------------------------------------------------------
#include <cartobase/type/limits.h>
#include <cartobase/type/string_conversion.h>
#include <cartobase/object/object.h>
#include <cartobase/object/property.h>
#include <cartobase/object/propertyfilter.h>
#include <cartobase/containers/nditerator.h>
#include <cartobase/uuid/uuid.h>
//--- soma-io ----------------------------------------------------------------
#include <soma-io/allocator/allocator.h>
//--- std --------------------------------------------------------------------
#include <cstdlib>
#include <algorithm>
#include <stdexcept>
#include <string>
#include <stdio.h>
//----------------------------------------------------------------------------
 
namespace carto
{
//============================================================================
//   CONSTRUCTORS
//============================================================================
 
  /***************************************************************************
   * Default Constructor
   **************************************************************************/
  template < typename T >
  Volume< T >::Volume( int sizeX, int sizeY, int sizeZ, int sizeT,
                       const AllocatorContext& allocatorContext,
                       bool allocated )
    : VolumeProxy< T >( sizeX, sizeY, sizeZ, sizeT ),
      _items( 0U, allocatorContext ),
      _start( &_items[0] ),
      _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( -1, -1, -1, -1, allocated, allocatorContext );
  }
 
  template < typename T >
  Volume< T >::Volume( const Position4Di & size,
                       const AllocatorContext& allocatorContext,
                       bool allocated ):
    VolumeProxy< T >( size[0] > 0 ? size[0] : 1,
                      size[1] > 0 ? size[1] : 1,
                      size[2] > 0 ? size[2] : 1,
                      size[3] > 0 ? size[3] : 1 ),
    _items( 0U, allocatorContext ),
    _start( &_items[0] ),
    _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( -1, -1, -1, -1, allocated, allocatorContext );
  }
 
  /***************************************************************************
   * Constructor with border
   **************************************************************************/
 
  template < typename T >
  void Volume< T >::constructBorders( const Position & bordersize,
                                      const AllocatorContext& allocatorContext,
                                      bool allocated )
  {
    bool has_border = false;
    if( !bordersize.empty() )
    {
      size_t i, n = bordersize.size();
      for( i=0; !has_border && i<n; ++i )
        if( bordersize[i] != 0 )
          has_border = true;
    }
 
    if( has_border )
    {
      size_t i, n = VolumeProxy<T>::_size.size();
      size_t bsize = sizeof(T);
      std::vector<int> large_size( n );
      for( i=0; i<n; ++i )
      {
        large_size[i] = VolumeProxy<T>::_size[i];
        if( i < bordersize.size() )
          large_size[i] += bordersize[i] * 2;
        bsize *= VolumeProxy<T>::_size[i];
      }
      _refvol.reset( new Volume<T>( large_size,
                                    allocatorContext, allocated ) );
 
      allocate( -1, -1, -1, -1, true,
        _refvol->allocatorContext().isAllocated()
          ? AllocatorContext( AllocatorStrategy::NotOwner,
                              rc_ptr<DataSource>( new BufferDataSource
                                ( (char *) &(*_refvol)( bordersize ),
                                  bsize ) ) )
          : allocatorContext );
      if( _refvol->allocatorContext().isAllocated() )
      {
        // fix offsets
        blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
        int i, n=VolumeProxy<T>::_size.size();
        for(i=0; i<n; ++i )
          dims[i] = VolumeProxy<T>::_size[i];
        for( ; i<Volume<T>::DIM_MAX; ++i )
          dims[i] = 1;
        _blitz.reference
          ( blitz::Array<T,8>
            ( _start,
              dims,
              _refvol->_blitz.stride(),
              blitz::GeneralArrayStorage<8>
              ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
      }
    }
    else // no border
    {
      allocate( -1, -1, -1, -1, allocated, allocatorContext );
    }
  }
 
  template < typename T >
  Volume< T >::Volume( int sizeX, int sizeY, int sizeZ, int sizeT,
                       const Position4Di & bordersize,
                       const AllocatorContext& allocatorContext,
                       bool allocated )
    : VolumeProxy< T >( sizeX, sizeY, sizeZ, sizeT ),
      _items( 0U, AllocatorContext( AllocatorStrategy::NotOwner,
        DataSource::none() ) ),
      _start( &_items[0] ),
      _pos( bordersize.toVector() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    constructBorders( bordersize.toVector(), allocatorContext, allocated );
  }
 
  template < typename T >
  Volume< T >::Volume( const Position4Di & size,
                       const Position4Di & bordersize,
                       const AllocatorContext& allocatorContext,
                       bool allocated ):
    VolumeProxy< T >( size[0] > 0 ? size[0] : 1,
                      size[1] > 0 ? size[1] : 1,
                      size[2] > 0 ? size[2] : 1,
                      size[3] > 0 ? size[3] : 1 ),
    _items( 0U, AllocatorContext( AllocatorStrategy::NotOwner,
            DataSource::none() ) ),
    _start( &_items[0] ),
    _pos( bordersize.toVector() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    constructBorders( bordersize.toVector(), allocatorContext, allocated );
  }
 
  template < typename T >
  Volume< T >::Volume( int sizeX, int sizeY, int sizeZ,
                       int sizeT, int bordersize,
                       const AllocatorContext& allocatorContext,
                       bool allocated )
    : VolumeProxy< T >( sizeX, sizeY, sizeZ, sizeT ),
      _items( 0U, AllocatorContext( AllocatorStrategy::NotOwner,
        DataSource::none() ) ),
      _start( &_items[0] ),
      _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    _pos[0] = bordersize;
    _pos[1] = bordersize;
    _pos[2] = bordersize;
 
    constructBorders(
      Position4Di( bordersize, bordersize, bordersize, 0 ).toVector(),
      allocatorContext, allocated );
  }
 
  template < typename T >
  Volume< T >::Volume( const Position4Di & size,
                       int bordersize,
                       const AllocatorContext& allocatorContext,
                       bool allocated ):
    VolumeProxy< T >( size[0] > 0 ? size[0] : 1,
                      size[1] > 0 ? size[1] : 1,
                      size[2] > 0 ? size[2] : 1,
                      size[3] > 0 ? size[3] : 1 ),
    _items( 0U, AllocatorContext( AllocatorStrategy::NotOwner,
            DataSource::none() ) ),
    _start( &_items[0] ),
    _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    _pos[0] = bordersize;
    _pos[1] = bordersize;
    _pos[2] = bordersize;
    constructBorders(
      Position4Di( bordersize, bordersize, bordersize, 0 ).toVector(),
      allocatorContext, allocated );
  }
 
 
  template < typename T >
  Volume< T >::Volume( const std::vector<int> & size,
                       const AllocatorContext& allocatorContext,
                       bool allocated ):
    VolumeProxy< T >( size ),
    _items( 0U, allocatorContext ),
    _start( &_items[0] ),
    _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( std::vector<int>( 1, -1 ), allocated, allocatorContext );
  }
 
 
  template < typename T >
  Volume< T >::Volume( const std::vector<int> & size,
                       const std::vector<int> & bordersize,
                       const AllocatorContext& allocatorContext,
                       bool allocated ):
    VolumeProxy< T >( size ),
    _items( 0U, AllocatorContext( AllocatorStrategy::NotOwner,
            DataSource::none() ) ),
    _start( &_items[0] ),
    _pos( bordersize )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    while( _pos.size() < 4 )
      _pos.push_back( 0 );
    constructBorders( bordersize, allocatorContext, allocated );
  }
 
  /***************************************************************************
   * Buffer Constructor
   **************************************************************************/
  template < typename T >
  Volume< T >::Volume( int sizeX, int sizeY, int sizeZ, int sizeT, T* buffer,
                       const std::vector<long> *strides )
    : VolumeProxy< T >( sizeX, sizeY, sizeZ, sizeT ),
      _items( sizeX * sizeY * sizeZ * sizeT, buffer ),
      _start( &_items[0] ),
      _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( -1, -1, -1, -1, true, allocatorContext(), strides );
  }
 
 
  template < typename T >
  Volume< T >::Volume( const Position4Di & size, T* buffer,
                       const std::vector<long> *strides ):
    VolumeProxy< T >( size[0] > 0 ? size[0] : 1,
                      size[1] > 0 ? size[1] : 1,
                      size[2] > 0 ? size[2] : 1,
                      size[3] > 0 ? size[3] : 1 ),
    _items( (long)(size[0] > 0 ? size[0] : 1) *
            (long)(size[1] > 0 ? size[1] : 1) *
            (long)(size[2] > 0 ? size[2] : 1) *
            (long)(size[3] > 0 ? size[3] : 1), buffer ),
    _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( -1, -1, -1, -1, true, allocatorContext(), strides );
  }
 
 
  template < typename T >
  Volume< T >::Volume( const std::vector<int> & size, T* buffer,
                       const std::vector<long> *strides ):
    VolumeProxy< T >( size ),
    _items( (long) Position4Di::size_num_elements( size ), buffer ),
    _pos( 4, 0 )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    allocate( std::vector<int>( 1, -1 ), true, allocatorContext(), strides );
  }
 
  namespace
  {
 
    template <typename T>
    void _updateHeaderFromParent( Volume<T> *vol )
    {
      rc_ptr<Volume<T> > parent = vol->refVolume();
      if( !parent )
        return; // no parent: nothing to do.
 
      /* copy voxel_size from underlying volume, if any.
        This should probably be more general, but cannot be applied to all
        header properties (size, transformations...).
        WARNING: Moreover here we do not guarantee to keep both voxel_size
        unique: we point to the same vector of values for now, but it can be
        replaced (thus, duplicated) by a setProperty().
        We could use a addBuiltinProperty(), but then the voxel size has to be
        stored in a fixed location somewhere.
      */
      try
      {
        carto::Object vs = parent->header().getProperty( "voxel_size" );
        size_t n = vol->getSize().size();
        if( vs->size() > n )
        {
          // drop additional sizes
          size_t i;
          std::vector<carto::Object> vs2( n );
          for( i=0; i<n; ++i )
            vs2[i] = vs->getArrayItem( i );
          vol->header().setProperty( "voxel_size", vs2 );
        }
        else
          vol->header().setProperty( "voxel_size", vs );
      }
      catch( ... )
      {
        // never mind.
      }
 
      // handle transformation to parent ref
      std::vector<float> vs = vol->getVoxelSize();
      while( vs.size() < 3 )
        vs.push_back( 1.f );
      typename Volume<T>::Position pos = vol->posInRefVolume();
      std::vector<float> trv( 16, 0.f );
      trv[0] = 1.f;
      trv[5] = 1.f;
      trv[10] = 1.f;
      trv[15] = 1.f;
      trv[3] = pos[0] * vs[0];
      trv[7] = pos[1] * vs[1];
      trv[11] = pos[2] * vs[2];
      AffineTransformationBase tr( trv );
 
      std::string ref = parent->referential().uuid();
      std::vector<std::string> refs;
      std::vector<std::vector<float> > trans;
      refs.push_back( ref );
      trans.push_back( trv );
      try
      {
        carto::Object tl = parent->header().getProperty( "transformations" );
        trans.reserve( tl->size() + 1 );
        carto::Object it;
        for( it = tl->objectIterator(); it->isValid(); it->next() )
        {
          AffineTransformationBase tn( it->currentValue() );
          tn *= tr;
          trans.push_back( tn.toVector() );
        }
        carto::Object rl = parent->header().getProperty( "referentials" );
        refs.reserve( rl->size() + 1 );
        for( it = rl->objectIterator(); it->isValid(); it->next() )
          refs.push_back( it->currentValue()->getString() );
      }
      catch( ... )
      {
      }
      vol->header().setProperty( "referentials", refs );
      vol->header().setProperty( "transformations", trans );
    }
 
  }
 
 
  /***************************************************************************
   * View Constructor
   **************************************************************************/
  template<typename T> inline
  Volume<T>::Volume( rc_ptr<Volume<T> > other,
                     const Position4Di & pos, const Position4Di & size,
                     const AllocatorContext & allocContext )
    : VolumeProxy<T>( size[0] >= 0 ? size[0] :
          other->allocatorContext().isAllocated() ? other->getSizeX() : 1,
        size[1] >= 0 ? size[1] :
          other->allocatorContext().isAllocated() ? other->getSizeY() : 1,
        size[2] >= 0 ? size[2] :
          other->allocatorContext().isAllocated() ? other->getSizeZ() : 1,
        size[3] >= 0 ? size[3] :
          other->allocatorContext().isAllocated() ? other->getSizeT() : 1 ),
      _items( 0U, allocContext ),
      _refvol( other ),
      _pos( pos.toVector() ),
      _referential( other->referential() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    // use a unique referential UUID, but keep orientation information
    UUID uuid;
    uuid.generate();
    _referential.setUuid( uuid.toString() );
 
    if( other->allocatorContext().isAllocated() )
    {
      size_t bsize = sizeof(T);
      std::vector<int> osize = other->getSize();
      int i, n = osize.size();
      for( i=0; i<n; ++i )
        bsize *= osize[i];
 
      allocate( -1, -1, -1, -1, true,
                AllocatorContext( AllocatorStrategy::NotOwner,
                                  rc_ptr<DataSource>( new BufferDataSource
                                    ( (char *) &other->_items[0],
                                      bsize ) ) ) );
      // fix offsets
      blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
      n = VolumeProxy<T>::_size.size();
      for( i=0; i<n; ++i )
        dims[i] = VolumeProxy<T>::_size[i];
      for( ; i<Volume<T>::DIM_MAX; ++i )
        dims[i] = 1;
      _start = &(*other)( pos.toVector() );
      _blitz.reference
        ( blitz::Array<T,Volume<T>::DIM_MAX>
          ( _start,
            dims,
            other->_blitz.stride(),
            blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
            ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
    }
    else
      allocate( -1, -1, -1, -1, true, allocContext );
 
    _updateHeaderFromParent( this );
  }
 
 
  template<typename T> inline
  Volume<T>::Volume( rc_ptr<Volume<T> > other,
                     const Position & pos, const Position & size,
                     const AllocatorContext & allocContext )
    : VolumeProxy<T>( Position4Di::fixed_size( size ) ),
      _items( 0U, allocContext ),
      _refvol( other ),
      _pos( Position4Di::fixed_position( pos ) ),
      _referential( other->referential() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    // use a unique referential UUID, but keep orientation information
    UUID uuid;
    uuid.generate();
    _referential.setUuid( uuid.toString() );
 
    if( other->allocatorContext().isAllocated() )
    {
      size_t bsize = sizeof(T);
      std::vector<int> osize = other->getSize();
      int i, n = osize.size();
      for( i=0; i<n; ++i )
        bsize *= osize[i];
 
//       std::cout << "use block start: " << (char *) ( &_items[0] + (&(*other)( pos ) - other->_start ) ) << std::endl;
 
      allocate( -1, -1, -1, -1, true,
                AllocatorContext( AllocatorStrategy::NotOwner,
                                  rc_ptr<DataSource>( new BufferDataSource
                                    ( (char *) &other->_items[0],
                                      bsize ) ) ) );
 
      // fix offsets
      blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
      n = VolumeProxy<T>::_size.size();
      for(i=0; i<n; ++i )
        dims[i] = VolumeProxy<T>::_size[i];
      for( ; i<Volume<T>::DIM_MAX; ++i )
        dims[i] = 1;
      _start = &(*other)( pos );
      _blitz.reference
        ( blitz::Array<T,Volume<T>::DIM_MAX>
          ( _start,
            dims,
            other->_blitz.stride(),
            blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
            ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
    }
    else
      allocate( -1, -1, -1, -1, true, allocContext );
 
    _updateHeaderFromParent( this );
  }
 
 
  // view + buffer (only for IO)
 
  template < typename T >
  Volume< T >::Volume( rc_ptr<Volume<T> > other, const Position & pos,
                       const Position & size, T* buffer,
                       const std::vector<long> & strides )
    : VolumeProxy<T>( size ),
      _items( (long) Position4Di::size_num_elements( size ), buffer ),
      _refvol( other ),
      _pos( pos ),
      _referential( other->referential() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    // use a unique referential UUID, but keep orientation information
    UUID uuid;
    uuid.generate();
    _referential.setUuid( uuid.toString() );
 
    allocate( -1, -1, -1, -1, true, allocatorContext(), &strides );
  }
 
 
  /***************************************************************************
   * Copy Constructor
   **************************************************************************/
  template < typename T >
  Volume< T >::Volume( const Volume< T >& other )
    : RCObject(),
      VolumeProxy< T >( other ),
      _items( other._items ),
      _start( &_items[0] + ( other._start - &other._items[0] ) ),
 
      // TODO: test blitz ownership / strides
      // _blitz = other.blitz;
      _blitz( _start,
              other._blitz.shape(),
              other._blitz.stride(),
              blitz::GeneralArrayStorage<8>
              ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ),
      _refvol( other.refVolume().get() ?
        new Volume<T>( *other.refVolume() ) : 0 ),
      _pos( other.posInRefVolume() ),
      _referential( other.referential() )
  {
    this->header().addBuiltinProperty( "referential", _referential.uuid() );
    if( _refvol.get() ) // view case: the underlying volume is copied.
    {
      Position4Di pos = other.posInRefVolume();
      std::vector<int> oldSize(1, -1);
      allocate( oldSize, true, _refvol->allocatorContext().isAllocated()
                ? AllocatorContext( AllocatorStrategy::NotOwner,
                    rc_ptr<DataSource>( new BufferDataSource
                      ( (char *) &(*_refvol)( pos[0], pos[1], pos[2], pos[3] ),
                      VolumeProxy<T>::getSizeX() * VolumeProxy<T>::getSizeY()
                        * VolumeProxy<T>::getSizeZ()
                        * VolumeProxy<T>::getSizeT()
                        * sizeof(T) ) ) )
                : AllocatorContext( other.allocatorContext() ) );
      if( _refvol->allocatorContext().isAllocated() )
      {
        // fix offsets
        blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
        int i, n=VolumeProxy<T>::_size.size();
        for( i=0; i<n; ++i )
          dims[i] = VolumeProxy<T>::_size[i];
        for( ; i<Volume<T>::DIM_MAX; ++i )
          dims[i] = 1;
        _blitz.reference
          ( blitz::Array<T,Volume<T>::DIM_MAX>
            ( _start,
              dims,
              other._blitz.stride(),
              blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
              ( blitz::shape( 0, 1, 2, 3, 5, 6, 7, 8 ), true ) ) );
      }
    }
  }
 
  template < typename T >
  Volume< T >::~Volume()
  {
  }
 
//============================================================================
//   M E T H O D S
//============================================================================
 
  template < typename T > inline
  const AllocatorContext& Volume<T>::allocatorContext() const
  {
    return _items.allocatorContext();
  }
 
  template <typename T> inline
  rc_ptr<Volume<T> > Volume<T>::refVolume() const
  {
    return _refvol;
  }
 
  template <typename T> inline
  const typename Volume<T>::Position & Volume<T>::posInRefVolume() const
  {
    return _pos;
  }
  
  template <typename T>
  inline
  int Volume<T>::getLevelsCount() const {
    int l = 0;
    rc_ptr<Volume<T> > v(const_cast<Volume<T> *>(this));
    while (!v.isNull()) {
      l++;
      v = v->refVolume();
    }
    return l;
  }
 
  template <typename T>
  inline
  int Volume<T>::refLevel(const int level) const {
    int c = getLevelsCount();
    int l = level;
    if (l < 0) {
      l = c + l;
    }
        
    if ((l < 0) && (l >= c)) {
      throw std::out_of_range("level " + carto::toString(level)
                             + " is out range (" + carto::toString(-c)
                             + ", " + carto::toString(c-1) + ")");
    }
       
    return l;
  }
 
  template <typename T>
  inline
  rc_ptr<Volume<T> > Volume<T>::refVolumeAtLevel(const int level) const {
    int l = refLevel(level);
    int c = 0;    
    rc_ptr<Volume<T> > v(const_cast<Volume<T> *>(this));
            
    while ((c < l) && (!v.isNull())) {
      v = v->refVolume();
      c++;
    }
        
    return v;
  }
 
  template <typename T>
  inline
  typename Volume<T>::Position Volume<T>::posInRefVolumeAtLevel(
      const int level) const {
    int l = refLevel(level);
    size_t s = this->getSize().size();
    typename Volume<T>::Position offset(s, 0);
    int c = 0;
    rc_ptr<Volume<T> > v(const_cast<Volume<T> *>(this));
    while ((c < l) && (!v.isNull())) {
      const Position & pos = v->posInRefVolume();
      
      for (size_t i = 0; i < s; ++i)
        offset[i] += pos[i];
      
      v = v->refVolume();
      c++;
    }
        
    return offset;
  }
 
  template <typename T> inline
  void Volume<T>::updateItemsBuffer()
  {
 
    if ( !allocatorContext().isAllocated()
         || (allocatorContext().accessMode() == AllocatorStrategy::NotOwner) )
    {
 
      // Free old buffer
      _items.free();
 
      if (_refvol.get())
      {
        // Recreate items buffer that reference volume
        // using correct sizes and position
        if( _refvol->allocatorContext().isAllocated() )
        {
          size_t size = sizeof(T);
          int i, n = VolumeProxy<T>::_size.size();
          for( i=0; i<n; ++i )
            size *= VolumeProxy<T>::_size[i];
          _items.allocate(
            0U,
            AllocatorContext( AllocatorStrategy::NotOwner,
                              rc_ptr<DataSource>( new BufferDataSource
                                ( (char *) &(*(_refvol))( _pos ),
                                  size ) ) ) );
        }
        else
          _items.allocate( 0U, allocatorContext() );
        _start = &_items[0];
 
        if ( _refvol->allocatorContext().isAllocated() )
        {
          // fix offsets
          blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
          int i, n=VolumeProxy<T>::_size.size();
          for( i=0; i<n; ++i )
            dims[i] = VolumeProxy<T>::_size[i];
          for( ; i<Volume<T>::DIM_MAX; ++i )
            dims[i] = 1;
          _blitz.reference
            ( blitz::Array<T,Volume<T>::DIM_MAX>
              ( _start,
                dims,
                _refvol->_blitz.stride(),
                blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
                ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
        }
 
        /* copy voxel_size from underlying volume, if any.
          This should probably be more general, but cannot be applied to all
          header properties (size, transformations...).
          WARNING: Moreover here we do not guarantee to keep both voxel_size
          unique: we point to the same vector of values for now, but it can be
          replaced (thus, duplicated) by a setProperty().
          We could use a addBuiltinProperty(), but then the voxel size has to be
          stored in a fixed location somewhere.
        */
        try
        {
          carto::Object vs = _refvol->header().getProperty( "voxel_size" );
          this->header().setProperty( "voxel_size", vs );
        }
        catch( ... )
        {
          // never mind.
        }
      }
    }
  }
 
  template <typename T> inline
  void Volume<T>::setPosInRefVolume( const Position4Di & pos )
  {
    if ( pos != _pos )
    {
      _pos = pos.toVector();
      updateItemsBuffer();
    }
  }
 
 
  template <typename T> inline
  void Volume<T>::setPosInRefVolume( const Position & pos ) {
    if (pos != _pos)
    {
      _pos = pos;
      while( _pos.size() < 4 )
        _pos.push_back( 0 );
      updateItemsBuffer();
    }
  }
 
  template <typename T> inline
  void Volume<T>::setRefVolume( const rc_ptr<Volume<T> > & refvol) {
    if (refvol.get() != _refvol.get()) {
      _refvol = refvol;
      updateItemsBuffer();
    }
  }
 
  template <typename T> inline
  std::vector<int> Volume<T>::getBorders() const
  {
    std::vector<int> borders( VolumeProxy<T>::_size.size() * 2, 0 );
    if( _refvol.get() && _refvol->allocatorContext().isAllocated() )
    {
      int i, n = VolumeProxy<T>::_size.size();
      for( i=0; i<n; ++i )
        borders[i*2 + 1] = _refvol->_size[i] - VolumeProxy<T>::_size[i];
      for( i=0, n=_pos.size(); i<n; ++i )
      {
        borders[i*2] = _pos[i];
        borders[i*2+1] -= _pos[i];
      }
    }
 
    return borders;
  }
 
  template <typename T> inline
  std::vector<long> Volume<T>::getStrides() const
  {
 
    const blitz::TinyVector<BlitzStridesType, Volume<T>::DIM_MAX>& bstrides = _blitz.stride();
    int d, n = VolumeProxy<T>::_size.size();
    std::vector<long> strides( n );
    for (d = 0; d < n; ++d)
        strides[d] = bstrides[d];
 
    return strides;
  }
 
  template < typename T >
  Volume< T >& Volume< T >::operator=( const Volume< T >& other )
  {
    if( &other == this )
      return *this;
 
    bool        b = Headered::signalsBlocked();
    if( !b )
      Headered::blockSignals( true );
    this->VolumeProxy< T >::operator=( other );
    // copy buffer, preserving allocator
    _items.copy( other._items, other.allocatorContext() );
    _start = &_items[0] + ( other._start - &other._items[0] );
 
    // TODO: test blitz ownership / strides
    // _blitz.reference( other.blitz );
    blitz::TinyVector<long, Volume<T>::DIM_MAX> dims;
    int i, n = VolumeProxy<T>::_size.size();
    for( i=0; i<n; ++i )
      dims[i] = VolumeProxy<T>::_size[i];
    for( ; i<Volume<T>::DIM_MAX; ++i )
      dims[i] = 1;
    _blitz.reference
        ( blitz::Array<T,Volume<T>::DIM_MAX>
        ( _start,
            dims,
            other._blitz.stride(),
            blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
            ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
    _refvol = other._refvol;
    _pos = other._pos;
    _referential = other._referential;
 
    initialize();
 
    if( !b )
      Headered::blockSignals( false );
 
    return *this;
 
  }
 
  template <typename T>
  void Volume<T>::copySubVolume( const Volume<T> & source,
                                 const std::vector<int> & pos )
  {
    std::vector<int> size = this->getSize();
    std::vector<int> osize = source.getSize();
    int i;
 
    for( i=0; i<size.size() && i<osize.size(); ++i )
    {
      int ip = 0;
      if( pos.size() > i )
        ip = pos[i];
      size[i] = std::min( size[i] - ip, osize[i] );
    }
    for( ; i<size.size(); ++i )
      size[i] = 1;
 
    line_NDIterator<T> it( &at( pos ), size, this->getStrides() );
    const_line_NDIterator<T> oit( &source.at( 0 ), size, source.getStrides() );
    T *p, *pn;
    const T *op;
 
    for( ; !it.ended(); ++it, ++oit )
    {
      p = &*it;
      op = &*oit;
      for( pn=p + it.line_length(); p!=pn;
           it.inc_line_ptr( p ), oit.inc_line_ptr( op ) )
        *p = *op;
    }
  }
 
  template <typename T>
  void Volume<T>::copySubVolume( const rc_ptr<Volume<T> > & source,
                                 const std::vector<int> & pos )
  {
    copySubVolume( *source, pos );
  }
 
  template < typename T >
  typename Volume< T >::iterator Volume< T >::begin()
  {
 
    return _blitz.begin();
 
  }
 
 
  template < typename T >
  typename Volume< T >::iterator Volume< T >::end()
  {
 
    return _blitz.end();
 
  }
 
 
  template < typename T >
  typename Volume< T >::const_iterator Volume< T >::begin() const
  {
 
    return _blitz.begin();
 
  }
 
 
  template < typename T >
  typename Volume< T >::const_iterator Volume< T >::end() const
  {
 
    return _blitz.end();
 
  }
 
 
  template < typename T >
  void Volume< T >::initialize()
  {
 
    // initializing headered stuff
    this->Headered::initialize();
 
    // creating size filter
    std::set< std::string > sizePropertyNames;
    sizePropertyNames.insert( "sizeX" );
    sizePropertyNames.insert( "sizeY" );
    sizePropertyNames.insert( "sizeZ" );
    sizePropertyNames.insert( "sizeT" );
    sizePropertyNames.insert( "volume_dimension" );
    rc_ptr< PropertyFilter >
      sizeRcPropertyFilter( new PropertyFilter( "size", sizePropertyNames ) );
 
    // adding size filter to headered and connecting signal to slot
    Headered::addPropertyFilter( sizeRcPropertyFilter );
    Headered::connect( sizeRcPropertyFilter->getName(),
                       ::sigc::mem_fun( *this, &Volume< T >::slotSizeChanged ) );
 
  }
 
 
  template < typename T >
  void Volume< T >::allocate( int oldSizeX,
                              int oldSizeY,
                              int oldSizeZ,
                              int oldSizeT,
                              bool allocate,
                              const AllocatorContext& ac,
                              const std::vector<long> *strides )
  {
    std::vector<int> oldSize(4);
    oldSize[0] = oldSizeX;
    oldSize[1] = oldSizeY;
    oldSize[2] = oldSizeZ;
    oldSize[3] = oldSizeT;
    Volume< T >::allocate( oldSize, allocate, ac, strides );
  }
 
 
  template < typename T >
  void Volume< T >::allocate( const std::vector<int> & oldSize,
                              bool allocate,
                              const AllocatorContext& ac,
                              const std::vector<long> *nstrides )
  {
    std::vector<long long int> strides(Volume<T>::DIM_MAX, 0);
    int i = 0, n = oldSize.size(), nn = VolumeProxy<T>::_size.size();
 
    unsigned long long int stride_max = 0;
    unsigned long long int total_len = 0;
    unsigned long long absstride = 0;
    unsigned long long int offset = 0;
 
    if( nstrides )
    {
      for( ; i<std::min(nstrides->size(), size_t(nn)); ++i )
      {
        strides[i] = (*nstrides)[i];
        absstride = std::abs( strides[i] );
        if( absstride > stride_max )
          stride_max = absstride;
        if( absstride * VolumeProxy<T>::_size[i] > total_len )
          total_len = absstride * VolumeProxy<T>::_size[i];
        if( strides[i] < 0 )
          offset += absstride * ( VolumeProxy<T>::_size[i] - 1 );
      }
    }
 
    for( ; i<nn; ++i )
    {
      strides[i] = ( i == 0 ? 1 : VolumeProxy<T>::_size[i-1] * stride_max );
      if( strides[i] > stride_max )
        stride_max = strides[i];
      if( strides[i] * VolumeProxy<T>::_size[i] > total_len )
        total_len = strides[i] * VolumeProxy<T>::_size[i];
    }
    for( ; i<Volume<T>::DIM_MAX; ++i )
      strides[i] = ( i == nn ? VolumeProxy<T>::_size[i-1] * stride_max
                     : strides[i-1] );
 
    if ( total_len * sizeof(T) >
         (unsigned long long int) std::numeric_limits< size_t >::max() )
      {
 
        throw std::runtime_error
          ( std::string( "attempt to allocate a volume which size is greater "
                         "than allowed by the system (" )
            + toString( std::numeric_limits< size_t >::max() ) + " bytes)" );
 
      }
 
    bool no_old = true;
    for( i=0; i<n; ++i )
      if( oldSize[i] != -1 )
      {
        no_old = false;
        break;
      }
 
    if ( !allocate // why !allocate ?
          || !_items.allocatorContext().isAllocated()
          || no_old )
    {
      // allocating memory space
      _items.free();
      if( allocate )
      {
        _items.allocate( ( size_t ) total_len, ac );
      }
    }
    else if ( oldSize != VolumeProxy<T>::_size
              || &ac != &_items.allocatorContext() )
    {
 
      // allocating a new memory space
      AllocatedVector<T> newItems( ( size_t ) total_len, ac );
 
      std::vector<int> minSize = VolumeProxy<T>::_size;
      for( i=0; i<std::min(n, nn); ++i )
        if( oldSize[i] < minSize[i] )
          minSize[i] = oldSize[i];
 
      // preserving data
      int x, y, z, t;
      if( newItems.allocatorContext().allocatorType()
          != AllocatorStrategy::ReadOnlyMap )
        for ( t = 0; t < minSize[3]; t++ )
          {
 
            for ( z = 0; z < minSize[2]; z++ )
              {
 
                for ( y = 0; y < minSize[1]; y++ )
                  {
 
                    for ( x = 0; x < minSize[0]; x++ )
                      {
                        // TODO: handle former strides with oldSize
                        newItems[ x * strides[0] +
                                  y * strides[1] +
                                  z * ( size_t ) strides[2] +
                                  t * ( size_t ) strides[3] ] =
                          _items[ x +
                                  y * oldSize[0] +
                                  z * ( size_t ) oldSize[0]
                                  * ( size_t ) oldSize[1] +
                                  t * ( size_t ) oldSize[0] *
                                  ( size_t ) oldSize[1]
                                  * ( size_t ) oldSize[2] ];
 
                      }
 
                  }
 
              }
 
        }
 
      // copying new data to old one
      _items = newItems;
 
    }
 
    blitz::TinyVector<BlitzStridesType, Volume<T>::DIM_MAX> bstrides;
    if( nstrides )
    {
      for( i=0; i<nn; ++i )
        bstrides[i] = strides[i];
      int n;
      for( ; i<Volume<T>::DIM_MAX; ++i )
      {
        if( i < nn )
          n = VolumeProxy<T>::_size[i];
        else
          n = 1;
        bstrides[i] = ( i == 0 ? n : n * stride_max );
        if( strides[i] > stride_max )
          stride_max = bstrides[i];
      }
    }
 
    if( allocate )
    {
      _start = &_items[0] + offset;
 
      // TODO: test blitz ownership / strides
      /*
      std::cout << "alloc blitz: " << VolumeProxy<T>::_size[0] << ", "
                << VolumeProxy<T>::_size[1] << ", "
                << VolumeProxy<T>::_size[2] << ", "
                << VolumeProxy<T>::_size[3] << std::endl;
      */
      blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
      for( i=0; i<nn; ++i )
        dims[i] = VolumeProxy<T>::_size[i];
      for( ; i<Volume<T>::DIM_MAX; ++i )
        dims[i] = 1;
      if( nstrides)
        _blitz.reference( blitz::Array<T,Volume<T>::DIM_MAX>
                          ( _start,
                            dims,
                            bstrides,
                            blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
                            ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ),
                              true ) ) );
      else
        _blitz.reference( blitz::Array<T,Volume<T>::DIM_MAX>
                          ( _start,
                            dims,
                            blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
                            ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ),
                              true ) ) );
      /*
      std::cout << &_items[0] << " / " << &_blitz( 0 ) << std::endl;
      std::cout << blitz::shape( VolumeProxy<T>::_size[0],
                                  VolumeProxy<T>::_size[1],
                                  VolumeProxy<T>::_size[2],
                                  VolumeProxy<T>::_size[3}] ) << std::endl;
      std::cout << "blitz data: " << _blitz.data() << std::endl;
      std::cout << "blitz ordering: " << _blitz.ordering() << std::endl;
      std::cout << "blitz numEl: " << _blitz.numElements() << std::endl;
      std::cout << "blitz strides: " << _blitz.stride() << std::endl;
      */
    }
    else
    {
      _start = (T*)( 0 ) + offset;
      blitz::TinyVector<int, Volume<T>::DIM_MAX> dims;
      for( i=0; i<nn; ++i )
        dims[i] = VolumeProxy<T>::_size[i];
      for( ; i<Volume<T>::DIM_MAX; ++i )
        dims[i] = 1;
      if( nstrides )
        // TODO: test blitz ownership
        _blitz.reference( blitz::Array<T,Volume<T>::DIM_MAX>
                      ( 0,
                        dims,
                        bstrides,
                        blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
                        ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
      else
        // TODO: test blitz ownership / strides
        _blitz.reference( blitz::Array<T,Volume<T>::DIM_MAX>
                      ( 0,
                        dims,
                        blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
                        ( blitz::shape( 0, 1, 2, 3, 4, 5, 6, 7 ), true ) ) );
    }
    _referential.ensureOrder( VolumeProxy<T>::_size.size() );
 
  }
 
 
  template < typename T >
  void Volume< T >::allocate()
  {
    if( !allocatorContext().isAllocated() )
    {
      std::vector<long> strides = getStrides();
      allocate( VolumeProxy<T>::getSize(), true, allocatorContext(),
                &strides );
    }
  }
 
 
  template < typename T >
  void Volume< T >::slotSizeChanged( const PropertyFilter& propertyFilter )
  {
 
    /* std::cout << "Volume< " << DataTypeCode<T>::name()
              << " >::slotSizeChanged"
              << std::endl; */
 
    std::vector<int> oldSize = VolumeProxy<T>::_size;
 
    if ( propertyFilter.hasOldValue( "sizeX" ) )
      {
 
        oldSize[0] =
          propertyFilter.getOldValue( "sizeX" )->GenericObject::value< int >();
 
      }
    if ( propertyFilter.hasOldValue( "sizeY" ) )
      {
 
        oldSize[1] =
          propertyFilter.getOldValue( "sizeY" )->GenericObject::value< int >();
 
      }
    if ( propertyFilter.hasOldValue( "sizeZ" ) )
      {
 
        oldSize[2] =
          propertyFilter.getOldValue( "sizeZ" )->GenericObject::value< int >();
 
      }
    if ( propertyFilter.hasOldValue( "sizeT" ) )
      {
 
        oldSize[3] =
          propertyFilter.getOldValue( "sizeT" )->GenericObject::value< int >();
 
      }
    /*
    std::cout << "old size: " << oldSize[0] << ", " << oldSize[1] << ", "
              << oldSize[2] << ", " << oldSize[3] << std::endl;
    std::cout << "new size: " << VolumeProxy<T>::_size[0] << ", "
              << VolumeProxy<T>::_size[1] << ", "
              << VolumeProxy<T>::_size[2] << ", " << VolumeProxy<T>::_size[3]
              << std::endl;
    */
    allocate( oldSize,
              _items.allocatorContext().isAllocated(), allocatorContext() );
 
  }
 
 
  template < typename T >
  void Volume< T >::reallocate( int sizeX,
                                int sizeY,
                                int sizeZ,
                                int sizeT,
                                bool keepcontents,
                                const AllocatorContext & ac,
                                bool alloc,
                                const std::vector<long> *strides )
  {
    int oldx = VolumeProxy<T>::_size[0];
    int oldy = VolumeProxy<T>::_size[1];
    int oldz = VolumeProxy<T>::_size[2];
    int oldt = VolumeProxy<T>::_size[3];
    VolumeProxy<T>::_size.resize( 4 );
    VolumeProxy<T>::_size[0] = sizeX;
    VolumeProxy<T>::_size[1] = sizeY;
    VolumeProxy<T>::_size[2] = sizeZ;
    VolumeProxy<T>::_size[3] = sizeT;
    if( keepcontents || ( sizeX == oldx && sizeY == oldy && sizeZ == oldz
                          && sizeT ==  oldt ) )
      allocate( oldx, oldy, oldz, oldt, alloc, ac, strides );
    else
      allocate( std::vector<int>(1, -1), alloc, ac, strides );
    // emit a signal ?
  }
 
  template < typename T >
  void Volume< T >::reallocate( const Position4Di & size,
                                bool keepcontents,
                                const AllocatorContext & ac,
                                bool alloc,
                                const std::vector<long> *strides )
  {
    return reallocate( size[0] > 0 ? size[0] : 1,
                       size[1] > 0 ? size[1] : 1,
                       size[2] > 0 ? size[2] : 1,
                       size[3] > 0 ? size[3] : 1,
                       keepcontents, ac, alloc, strides );
  }
 
  template < typename T >
  void Volume< T >::reallocate( const std::vector<int> & size,
                                bool keepcontents,
                                const AllocatorContext & ac,
                                bool alloc,
                                const std::vector<long> *strides )
  {
    std::vector<int> old = VolumeProxy<T>::_size;
 
    VolumeProxy<T>::_size = size;
    while( VolumeProxy<T>::_size.size() < 4 )
      VolumeProxy<T>::_size.push_back( 1 );
 
    VolumeProxy<T>::header().changeBuiltinProperty( "sizeX",
                                                    VolumeProxy<T>::_size[0] );
    VolumeProxy<T>::header().changeBuiltinProperty( "sizeY",
                                                    VolumeProxy<T>::_size[1] );
    VolumeProxy<T>::header().changeBuiltinProperty( "sizeZ",
                                                    VolumeProxy<T>::_size[2] );
    VolumeProxy<T>::header().changeBuiltinProperty( "sizeT",
                                                    VolumeProxy<T>::_size[3] );
 
    if( keepcontents || size == old )
      allocate( old, alloc, ac, strides );
    else
      allocate( std::vector<int>(1, -1), alloc, ac, strides );
    // emit a signal ?
  }
 
 
  template < typename T >
  void Volume< T >::allocateBorders( int bsx, int bsy, int bsz )
  {
    std::vector<int> border( 3 );
    border[0] = bsx;
    border[1] = ( bsy < 0 ? bsx : bsy );
    border[2] = ( bsz < 0 ? bsx : bsz );
 
    allocateBorders( border );
  }
 
 
  template < typename T >
  void Volume< T >::allocateBorders( const std::vector<int> & border )
  {
    Volume<T> vol_copy = this->copy();
 
    bool has_border = false;
    if( !border.empty() )
    {
      size_t i, n = border.size();
      for( i=0; !has_border && i<n; ++i )
        if( border[i] != 0 )
          has_border = true;
    }
    // constructBorders will not erase _refvol since it is normally used
    // only in constructors.
    if( !has_border )
      _refvol.reset( 0 );
 
    constructBorders( border, carto::AllocatorContext(), true );
    _pos = border;
    if( _pos.size() < 4 )
      _pos.resize( 4, 0 );
 
    this->copySubVolume( vol_copy );
  }
 
 
  template < typename T >
  void Volume< T >::flipToOrientation( const std::string & orient )
  {
    if( _referential.orientationVector( orient, _referential.order() )
        == _referential.axesOrientation() )
      // already in the same orientation
      return;
 
    blitz::TinyVector<int, Volume<T>::DIM_MAX> dims = _blitz.shape();
    blitz::TinyVector<BlitzStridesType, Volume<T>::DIM_MAX>
      strides = _blitz.stride();
 
    int i, n = this->getSize().size();
    std::vector<float>transl( n, 0.f );
 
    for( i=0; i<n; ++i )
      transl[i] = dims[i] - 1;
    carto::rc_ptr<Transformation> flipt
      = referential().toOrientation( orient, transl );
    soma::AffineTransformationBase & flip
      = dynamic_cast<soma::AffineTransformationBase &>( *flipt );
    std::unique_ptr<AffineTransformationBase> iflip = flip.inverse();
    blitz::TinyVector<BlitzStridesType, Volume<T>::DIM_MAX>
      new_strides = strides;
    long long offset = 0, old_offset = _start - &_items[0];
    long old_stride;
    for( i=0; i<n; ++i )
    {
      std::vector<int> p( n, 0 );
      p[i] = 1;
      std::vector<int> p1 = iflip->transformVector( p );
      new_strides[i] = &at( p1 ) - &at( 0 );
    }
    std::vector<int> vdims( dims.begin(), dims.end() );
    std::vector<int> new_dims = flip.transformVector( vdims );
    for( i=0; i<n; ++i )
      new_dims[i] = std::abs( new_dims[i] );
    blitz::TinyVector<int, Volume<T>::DIM_MAX> new_bdims = dims;
    for( i=0; i<n; ++i )
      new_bdims[i] = new_dims[i];
    for( i=0; i<n; ++i )
    {
      if( new_strides[i] < 0 )
        offset += -new_strides[i] * ( new_dims[i] - 1 );
      if( strides[i] < 0 )
        old_offset += strides[i] * ( dims[i] - 1 );
    }
 
    Object reor_hdr = reorientedHeader( orient );
 
    this->blockSignals( true );
 
    this->header().copyProperties( reor_hdr );
 
    _start = &_items[0] + offset + old_offset;
    _blitz.reference(
      blitz::Array<T,Volume<T>::DIM_MAX>(
        _start,
        new_bdims,
        new_strides,
        blitz::GeneralArrayStorage<Volume<T>::DIM_MAX>
        ( blitz::shape( 0, 1, 2, 3, 5, 6, 7, 8 ), true ) ) );
    this->blockSignals( false );
 
    // update referential info, generate a new ID
    _referential.setOrientation( orient );
    if( _referential.isLpiOriented() ) // initial LPI orientation
      _referential.setUuid( _referential.lpiReferentialUuid() );
    else
    {
      UUID uuid;
      uuid.generate();
      _referential.setUuid( uuid.toString() );
    }
  }
 
 
  template < typename T >
  void Volume< T >::flipToOrientation(
      const std::string & orient, const std::string & force_memory_layout )
  {
    // calculate strides and dims for asked memory layout
    std::vector<int> dims = this->getSize();
    int i, n = dims.size();
    std::vector<float>transl( n, 0.f );
    for( i=0; i<n; ++i )
      transl[i] = dims[i] - 1;
 
    carto::rc_ptr<Transformation> flipt
      = referential().toOrientation( force_memory_layout, transl );
    soma::AffineTransformationBase & flip
      = dynamic_cast<soma::AffineTransformationBase &>( *flipt );
 
    bool change_layout = false;
    std::vector<int> new_dims = flip.transformVector( dims );
    for( i=0; i<n; ++i )
      new_dims[i] = std::abs( new_dims[i] );
 
    long cstride = 1;
 
    std::unique_ptr<AffineTransformationBase> iflip = flip.inverse();
    for( i=0; i<n; ++i )
    {
      std::vector<int> p0( n, 0 );
      p0[i] = 1;
      p0 = iflip->transformVector( p0 );
      long st = &this->at( p0 ) - &this->at( 0 );
      if( st != cstride )
      {
        change_layout = true;
        break;
      }
      cstride *= new_dims[i];
    }
 
    if( change_layout )
    {
 
      // allocate a new Volume before copying it into this
      VolumeRef<T> copy( new_dims );
      copy->copyHeaderFrom( this->header() );
      copy->referential().setOrientation( force_memory_layout );
      copy->referential().setLpiReferential(
        this->referential().lpiReferentialUuid() );
 
      // copy data in the new layout
      line_NDIterator<T> it( &this->at( 0 ), this->getSize(),
                             this->getStrides(), true );
      T* p, *pp, *dp;
      long dstride = 0;
      std::vector<int> pos;
      std::vector<int> p0;
      pos = flip.transform( it.position() );
      dp = &copy->at( pos );
      p0 = std::vector<int>( n, 0 );
      p0[it.line_direction()] = 1;
      pos = flip.transform( p0 );
      dstride = &copy->at( pos ) - dp;
 
      for( ; !it.ended(); ++it )
      {
        p = &*it;
        pos = flip.transform( it.position() );
        dp = &copy->at( pos );
 
        for( pp=p + it.line_length(); p!=pp;
            it.inc_line_ptr( p ), dp += dstride )
          *dp = *p;
      }
 
      // copy back data to this
      *this = *copy;
    }
 
    // then flip strides to the wanted orientation
    this->flipToOrientation( orient );
  }
 
 
  template <typename T>
  Object Volume<T>::reorientedHeader( const std::string & orient ) const
  {
    Object rhdr = Object::value( PropertySet() );
    const PropertySet & hdr = this->header();
 
    rhdr->copyProperties( Object::reference( hdr ) );
 
    std::vector<int> dims = this->getSize();
    size_t i, n = dims.size();
    std::vector<float>transl( n, 0.f );
 
    for( i=0; i<n; ++i )
      transl[i] = dims[i] - 1;
    carto::rc_ptr<Transformation> flipt
      = referential().toOrientation( orient, transl );
    soma::AffineTransformationBase & flip
      = dynamic_cast<soma::AffineTransformationBase &>( *flipt );
    std::unique_ptr<AffineTransformationBase> iflip = flip.inverse();
 
    dims = flip.transformVector( dims );
    for( i=0, n=dims.size(); i<n; ++i )
      dims[i] = std::abs( dims[i] );
    rhdr->setProperty( "volume_dimension", dims );
    if( rhdr->hasProperty( "sizeX" ) )
      rhdr->removeProperty( "sizeX" );
    if( rhdr->hasProperty( "sizeY" ) )
      rhdr->removeProperty( "sizeY" );
    if( rhdr->hasProperty( "sizeZ" ) )
      rhdr->removeProperty( "sizeZ" );
    if( rhdr->hasProperty( "sizeT" ) )
      rhdr->removeProperty( "sizeT" );
 
    std::vector<float> vs = this->getVoxelSize();
    std::vector<float> rvs = flip.transformVector( vs );
    for( i=0, n=rvs.size(); i<n; ++i )
      rvs[i] = std::abs( rvs[i] );
    rhdr->setProperty( "voxel_size", rvs );
 
    bool is3d = this->referential().is3DOriented( orient );
 
    if( hdr.hasProperty( "transformations" ) )
    {
      AffineTransformationBase mvs( dims.size() );
      AffineTransformationBase rmvs( dims.size() );
      for( i=0, n=vs.size(); i<n; ++i )
      {
        mvs.matrix()(i, i) = vs[i];
        rmvs.matrix()(i, i) = 1.f / rvs[i];
      }
      // affine in mm
      AffineTransformationBase iflipmm = mvs * *iflip * rmvs;
 
      std::vector<std::vector<float> > rtrans;
      Object transs = hdr.getProperty( "transformations" );
      rtrans.reserve( transs->size() );
      Object tit = transs->objectIterator();
      for(; tit->isValid(); tit->next() )
      {
        AffineTransformationBase trans( tit->currentValue() );
        trans.extendOrder( flip.order() );
        // TODO extend both to max order( flip, trans )
        // then handle non-3D transforms in header
        trans = trans * iflipmm;
        if( is3d )
          trans.squeezeOrder( 3, true, false );
        rtrans.push_back( trans.toVector() );
      }
      rhdr->setProperty( "transformations", rtrans );
    }
 
    if( hdr.hasProperty( "storage_to_memory" ) )
    {
      AffineTransformationBase
        s2m( hdr.getProperty( "storage_to_memory" ) );
      s2m.extendOrder( flip.order() );
      s2m = flip * s2m;
      if( is3d )
        s2m.squeezeOrder( 3, true, false );
      rhdr->setProperty( "storage_to_memory", s2m.toVector() );
    }
 
    if( rhdr->hasProperty( "referential" ) )
    {
      if( orient == "LPI" ) // initial LPI orientation
        rhdr->setProperty( "referential", _referential.lpiReferentialUuid() );
      else
        rhdr->removeProperty( "referential" );
    }
 
    return rhdr;
  }
 
 
  template <typename T>
  std::vector<int> Volume<T>::memoryLayoutOrientation() const
  {
    std::vector<long> strides = this->getStrides();
    size_t i, j, n = strides.size();
    std::multimap<std::pair<long, bool>, size_t> ordered_strides;
    std::vector<int> orient( n, 0 );
    std::vector<int> dims = this->getSize();
 
    for( i=0; i<n; ++i )
    {
      bool several = ( dims[i] > 1 );
      ordered_strides.insert(
        std::make_pair( std::make_pair( std::abs( strides[i] ), several),
                        i ) );
    }
 
    std::vector<int> aorient = this->referential().axesOrientation();
    std::multimap<std::pair<long, bool>, size_t>::const_iterator
      im, em = ordered_strides.end();
 
    for( im=ordered_strides.begin(), i=0; im!=em; ++im, ++i )
    {
      j = ( ( aorient[ im->second ] - 1 ) / 2 ) * 2 + 1;
      bool neg = ( aorient[ im->second ] - 1 ) % 2;
      if( strides[ im->second] < 0 )
        neg = !neg;
      if( neg )
        ++j;
      orient[i] = j;
    }
 
    return orient;
  }
 
 
  template <typename T>
  std::vector<int> Volume<T>::storageLayoutOrientation() const
  {
    try
    {
      Object s2mo = this->header().getProperty( "storage_to_memory" );
      soma::AffineTransformationBase s2m( s2mo );
      std::unique_ptr<AffineTransformationBase> m2s = s2m.inverse();
      return this->referential().orientationFromTransform( *m2s );
    }
    catch( ... )
    {
    }
 
    std::vector<int> orient( this->getSize().size(), 0 );
    return orient;
  }
 
 
//============================================================================
//   U T I L I T I E S
//============================================================================
 
  template <typename T>
  Volume<T>* Creator<Volume<T> >::create( Object header,
                                          const AllocatorContext & context,
                                          Object options )
  {
    std::vector<int> dims( 4, 1 );
    bool        unalloc = false;
    if( !header->getProperty( "volume_dimension", dims ) )
    {
      header->getProperty( "sizeX", dims[0] );
      header->getProperty( "sizeY", dims[1] );
      header->getProperty( "sizeZ", dims[2] );
      header->getProperty( "sizeT", dims[3] );
    }
 
    unsigned n = dims.size();
 
    try
    {
      Object uao = options->getProperty( "unallocated" );
      unalloc = bool( uao->getScalar() );
    }
    catch( ... )
    {
    }
 
    std::string orient;
    try
    {
      Object oo = options->getProperty( "orientation" );
      orient = oo->getString();
    }
    catch( ... )
    {
    }
 
    rc_ptr<soma::AffineTransformationBase> ortr(
      new soma::AffineTransformationBase( dims.size() ) );
    std::vector<int> tdims = dims;
 
    if( !orient.empty() )
    {
      // dims and borders are given in LPI orientation
 
      Referential ref( dims.size() );
      if( orient == "storage" )
      {
        try
        {
          // std::cout << "request storage orientation\n";
          Object s2mo = header->getProperty( "storage_to_memory" );
          soma::AffineTransformationBase s2m( s2mo );
          // volume will be in storage orientation,
          // and ortr will get from LPI orientation to storage one
          rc_ptr<Transformation> t = s2m.getInverse();
          ortr.reset(
            dynamic_cast<soma::AffineTransformationBase *>( t.get() ) );
          // determine storage orientation
          orient = ref.orientationStr( ref.orientationFromTransform( *ortr ) );
          // std::cout << "orient: " << orient << std::endl;
        }
        catch( ... )
        {
        }
      }
      else
      {
        // ref.setOrientation( orient );
        rc_ptr<Transformation> t
          = ref.toOrientation( orient, soma::Transformation::vsub( dims, 1 ) );
        ortr.reset(
          dynamic_cast<soma::AffineTransformationBase *>( t.get() ) );
      }
      tdims = ortr->transformVector( dims );
      for( unsigned i=0; i<n; ++i )
        tdims[i] = std::abs( tdims[i] );
      // tdims are in memory orientation
      orient = ref.orientationStr( orient );
      if( orient == ref.orientationStr( "LPI" ) )
      {
        // orient is LPI: no need to transform things
        orient.clear();
      }
    }
 
    std::vector<int> borders( 3, 0 );
    try {
      borders[0] = (int) rint( options->getProperty( "border" )->getScalar() );
      borders[1] = borders[0];
      borders[2] = borders[0];
    } catch( ... ) {}
    try {
      borders[0] = (int) rint( options->getProperty( "bx" )->getScalar() );
    } catch( ... ) {}
    try {
      borders[1] = (int) rint( options->getProperty( "by" )->getScalar() );
    } catch( ... ) {}
    try {
      borders[2] = (int) rint( options->getProperty( "bz" )->getScalar() );
    } catch( ... ) {}
 
    Volume<T>        *obj;
    if( borders[0] != 0 || borders[1] != 0 || borders[2] != 0 )
    {
      std::vector<int> big_dims = dims;
      big_dims[0] += borders[0] * 2;
      big_dims[1] += borders[1] * 2;
      big_dims[2] += borders[2] * 2;
 
      big_dims = ortr->transformVector( big_dims );
      for( unsigned i=0; i<big_dims.size(); ++i )
        big_dims[i] = std::abs( big_dims[i] );
      borders = ortr->transformVector( borders );
      for( unsigned i=0; i<borders.size(); ++i )
        borders[i] = std::abs( borders[i] );
 
      obj = new Volume<T>( big_dims, context, !unalloc );
      if( !orient.empty() )
        obj->referential().setOrientation( orient );
      obj = new Volume<T>( rc_ptr<Volume<T> >( obj ), borders, tdims, context );
    }
    else
      obj = new Volume<T>( tdims, context, !unalloc );
 
    if( !orient.empty() )
    {
      obj->referential().setOrientation( orient );
//       // copy header to a temp, unallocated volume
//       Volume<T> tvol( dims, AllocatorContext( &NullAllocator::singleton() ) );
//       tvol.header().copyProperties( header );
//       // then get a properly reoriented header
//       header = tvol.reorientedHeader( orient );
//       std::cout << "reoriented header\n";
 
      // set strides orientation to default LPI
      obj->flipToOrientation( "LPI" );
    }
 
    obj->blockSignals( true );
    try
    {
      obj->copyHeaderFrom( header, false );
    }
    catch( std::exception & )
    {
      // not beautiful, but don't crash for that
    }
    // restore original sizes : temporary too...
    obj->blockSignals( false );
 
    return obj;
  }
 
  template <typename T>
  void Creator<Volume<T> >::setup( Volume<T> & obj, Object header,
                                   const AllocatorContext & context,
                                   Object options )
  {
    std::vector<int> dims( 4, 1 );
    bool        unalloc = false, partial = false, keep_allocation = false;
    try
    {
      carto::Object p = options->getProperty( "partial_reading" );
      partial = bool( p->getScalar() );
    }
    catch( ... ) {}
    if( !partial )
    {
      if( !header->getProperty( "volume_dimension", dims ) )
      {
        header->getProperty( "sizeX", dims[0] );
        header->getProperty( "sizeY", dims[1] );
        header->getProperty( "sizeZ", dims[2] );
        header->getProperty( "sizeT", dims[3] );
      }
      try
      {
        carto::Object p = options->getProperty( "unallocated" );
        unalloc = bool( p->getScalar() );
      }
      catch( ... ) {}
      try
      {
        carto::Object p = options->getProperty( "keep_allocation" );
        keep_allocation = bool( p->getScalar() );
      }
      catch( ... ) {}
      if( !keep_allocation || !obj.allocatorContext().isAllocated()
          || obj.allocatorContext().allocatorType()
             != AllocatorStrategy::Unallocated )
        obj.reallocate( dims, false, context, !unalloc );
    }
    else
    {
      const_cast<AllocatorContext &>( obj.allocatorContext() ).setDataSource
        ( context.dataSource() );
      // preserve dimensions
      dims = obj.getSize();
    }
    obj.blockSignals( true );
    obj.header().copyProperties( header );
    if( partial )
      {
        // restore dimensions
        PropertySet        & ps = obj.header();
        ps.setProperty( "volume_dimension", dims );
        ps.setProperty( "sizeX", dims[0] );
        ps.setProperty( "sizeY", dims[1] );
        ps.setProperty( "sizeZ", dims[2] );
        ps.setProperty( "sizeT", dims[3] );
      }
    obj.blockSignals( false );
  }
 
} // namespace carto
 
#endif // CARTODATA_VOLUME_VOLUMEBASE_D_H