DGtal: DGtal::LabelledMap< TData, L, TWord, N, M >::_

#include <DGtal/base/LabelledMap.h>

Public Member Functions
	__AnyBlock ()

Data &	insert (size_t idx, size_t size, const Data &v)

__AnyBlock *	erase (size_t idx, size_t size)

Data Fields
Data	datas [M]

__AnyBlock *	next

Detailed Description

template<typename TData, unsigned int L, typename TWord, unsigned int N, unsigned int M>
struct DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock

Represents a block (except the first) in the container. Internal structure.

Definition at line 302 of file LabelledMap.h.

Constructor & Destructor Documentation

◆ __AnyBlock()

template<typename TData , unsigned int L, typename TWord , unsigned int N, unsigned int M>

DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::__AnyBlock ( )

inline

Definition at line 303 of file LabelledMap.h.

303 : next( 0 ) {}

DGtal::LabelledMap::__AnyBlock::next

__AnyBlock * next

Definition: LabelledMap.h:386

Referenced by DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::insert().

Member Function Documentation

◆ erase()

template<typename TData , unsigned int L, typename TWord , unsigned int N, unsigned int M>

__AnyBlock* DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::erase	(	size_t	idx,
		size_t	size
	)

inline

Definition at line 357 of file LabelledMap.h.

       {
         // std::cerr << "__AnyBlock::erase(" << idx << "," << size << ")" 
         //        << " this=" << this
         //        << " next=" << next
         //        << std::endl;
         if ( size == 1 )
           {
             ASSERT( idx == 0 );
             delete this;
             return 0;
           }
         if ( idx < M )
           {
             std::copy( datas + idx + 1, datas + M, datas + idx );
             if ( next != 0 )
               {
                 ASSERT( size > M );
                 datas[ M - 1 ] = next->datas[ 0 ];
                 next = next->erase( 0, size - M );
               }
           }
         else
           next = next->erase( idx - M, size - M );
         return this;
       }

References DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::datas, DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::erase(), and DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::next.

Referenced by DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::erase().

◆ insert()

template<typename TData , unsigned int L, typename TWord , unsigned int N, unsigned int M>

Data& DGtal::LabelledMap< TData, L, TWord, N, M >::__AnyBlock::insert	(	size_t	idx,
		size_t	size,
		const Data &	v
	)

inline

Definition at line 306 of file LabelledMap.h.

       {
         ASSERT( idx <= size );
         if ( idx >= M ) 
           {
             if ( next == 0 )
               {
                 ASSERT( size == M );
                 ASSERT( idx == M );
                 next = new __AnyBlock;
                 return ( next->datas[ 0 ] = v );
               }
             else
               {
                 ASSERT( size > M );
                 return next->insert( idx - M, size - M, v );
               }
           }
         else 
           { // idx < M
             if ( size <= ( M - 1) ) // ( size < ( M - 1) )
               {
                 ASSERT( next == 0 );
                 std::copy_backward( datas + idx, datas + size, 
                                     datas + size + 1 );
                 return ( datas[ idx ] = v );
               }
             else
               {
                 Data v1 = datas[ M - 1 ];
                 std::copy_backward( datas + idx, datas + M - 1, datas + M );
                 // if ( size >= M )
                 //   {
                 if ( next == 0 )
                   {
                     ASSERT( size == M );
                     next = new __AnyBlock;
                     next->datas[ 0 ] = v1;
                   }
                 else
                   {
                     ASSERT( size > M );
                     next->insert( 0, size - M, v1 );
                   }
                 // }
                 return ( datas[ idx ] = v );
               }
           }
       }