DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator Struct Reference

Read iterator on set elements. Model of ForwardIterator. More...

#include <DGtal/kernel/UnorderedSetByBlock.h>

Inheritance diagram for DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator:

Public Member Functions
	const_iterator ()
	Default constructor.
	const_iterator (const Self &aSet, typename Container::const_iterator anIt)
	const_iterator (const Self &aSet, typename Container::const_iterator anIt, Coordinate aBit)
	const_iterator (const Self &aSet, const Key &key)

Private Member Functions
void	increment ()
bool	equal (const const_iterator &other) const
const Key	dereference () const

Private Attributes
const Self *	collection
	the collection that this iterator is traversing.
Container::const_iterator	it
	the hidden iterator that traverses the block map.
Coordinate	bit
	the current position in the block.
Word	current
	the current value of the block, where visited bits have been erased.

Friends
struct	UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual >
class	boost::iterator_core_access

Detailed Description

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>
struct DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator

Read iterator on set elements. Model of ForwardIterator.

Definition at line 200 of file UnorderedSetByBlock.h.

Constructor & Destructor Documentation

const_iterator() [1/4]

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::const_iterator ( )

inline

Default constructor.

Definition at line 207 of file UnorderedSetByBlock.h.

                       : collection( nullptr ), it(),
                         bit( static_cast<Coordinate>(0) ),
                         current( static_cast<Word>(0) ) {}

References bit, collection, current, and it.

Referenced by equal().

const_iterator() [2/4]

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::const_iterator ( const Self & aSet, typename Container::const_iterator anIt )

inline

Constructor from set and container iterator

Parameters

aSet	a reference to the visited unordered block set
anIt	an iterator in the container of this set.

Definition at line 214 of file UnorderedSetByBlock.h.

        : collection( &aSet ), it( anIt )
      {
        if ( it != collection->my_elements.cend() )
          {
            current  = it->second;
            bit      = static_cast<Coordinate>( Bits::leastSignificantBit( current ) );
          }
        else
          {
            current = static_cast<Word>(0);
            bit     = static_cast<Coordinate>(0);
          }
      }

References collection, and it.

const_iterator() [3/4]

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::const_iterator ( const Self & aSet, typename Container::const_iterator anIt, Coordinate aBit )

inline

Constructor from set, container iterator and starting bit

Parameters

aSet	a reference to the visited unordered block set
anIt	an iterator in the container of this set.
aBit	the bit index in the word pointed by anIt.

Definition at line 233 of file UnorderedSetByBlock.h.

        : collection( &aSet ), it( anIt ), bit( aBit )
      {
        if ( it != collection->my_elements.cend() )
          {
            current  = it->second;
            current &= ~( ( static_cast<Word>(1) << bit ) - static_cast<Word>(1) );
          }
        else
          current = static_cast<Word>(0);
      }

References bit, collection, current, and it.

const_iterator() [4/4]

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::const_iterator ( const Self & aSet, const Key & key )

inline

Constructor from set and starting key.

Parameters

aSet	a reference to the visited unordered block set
key	any key (if it is in the set, the iterator point on the key, otherwise it is iterator cend().

Definition at line 249 of file UnorderedSetByBlock.h.

        : collection( &aSet )
      {
        auto se  = collection->my_splitter.split( key );
        it       = collection->my_elements.find( se.first );
        if ( it != collection->my_elements.cend() )
          {
            bit     = se.second;
            current = it->second & ~( (static_cast<Word>(1) << bit )
                                      - static_cast<Word>(1) );
          }
        else
          {
            bit     = static_cast<Coordinate>(0);
            current = static_cast<Word>(0);
          }
      }

References collection, and it.

Member Function Documentation

dereference()

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

const Key DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::dereference ( ) const

inlineprivate

Definition at line 298 of file UnorderedSetByBlock.h.

      {
        return collection->my_splitter.join( it->first, bit );
      }

References bit, collection, and it.

equal()

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

bool DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::equal ( const const_iterator & other ) const

inlineprivate

Definition at line 292 of file UnorderedSetByBlock.h.

      {
        ASSERT( collection == other.collection );
        return it == other.it && bit == other.bit;
      }

References bit, collection, const_iterator(), and it.

increment()

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

void DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::increment ( )

inlineprivate

Definition at line 269 of file UnorderedSetByBlock.h.

      {
        ASSERT( current != static_cast<Word>(0)
                && "Invalid increment on const_iterator" );
        current &= ~( static_cast<Word>(1) << bit );
        if ( current == static_cast<Word>(0) )
          {
            ++it;
            if ( it != collection->my_elements.cend() )
              {
                current = it->second;
                bit     = static_cast<Coordinate>(Bits::leastSignificantBit( current ));
              }
            else
              {
                current = static_cast<Word>(0);
                bit     = static_cast<Coordinate>(0); // NB: LSB(0) is undefined
              }
          }
        else
          bit = static_cast<Coordinate>(Bits::leastSignificantBit( current ));
      }

References bit, collection, current, it, and DGtal::Bits::leastSignificantBit().

Friends And Related Symbol Documentation

boost::iterator_core_access

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

friend class boost::iterator_core_access

friend

Definition at line 268 of file UnorderedSetByBlock.h.

References boost::iterator_core_access.

Referenced by boost::iterator_core_access.

UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual >

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

friend struct UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual >

friend

Definition at line 1101 of file UnorderedSetByBlock.h.

Field Documentation

bit

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

Coordinate DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::bit

private

the current position in the block.

Definition at line 308 of file UnorderedSetByBlock.h.

Referenced by const_iterator(), const_iterator(), dereference(), equal(), DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::iterator::equal(), and increment().

collection

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

const Self* DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::collection

private

the collection that this iterator is traversing.

Definition at line 304 of file UnorderedSetByBlock.h.

Referenced by const_iterator(), const_iterator(), const_iterator(), const_iterator(), dereference(), equal(), DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::iterator::equal(), and increment().

current

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

Word DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::current

private

the current value of the block, where visited bits have been erased.

Definition at line 310 of file UnorderedSetByBlock.h.

Referenced by const_iterator(), const_iterator(), and increment().

it

template<typename Key, typename TSplitter = Splitter< Key >, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class UnorderedMapAllocator = std::allocator< std::pair<const Key, typename TSplitter::Word > >>

Container::const_iterator DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::it

private

the hidden iterator that traverses the block map.

Definition at line 306 of file UnorderedSetByBlock.h.

Referenced by const_iterator(), const_iterator(), const_iterator(), const_iterator(), dereference(), equal(), DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::iterator::equal(), and increment().

---

The documentation for this struct was generated from the following file:

• UnorderedSetByBlock.h