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

#include <DGtal/kernel/UnorderedSetByBlock.h>

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

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

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

Private Attributes
Self *	collection
	the collection that this iterator is traversing.
Container::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 >::iterator

Read-write iterator on set elements. Model of ForwardIterator.

Definition at line 315 of file UnorderedSetByBlock.h.

Constructor & Destructor Documentation

◆ iterator() [1/6]

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 >::iterator::iterator ( )

inline

Default constructor.

Definition at line 322 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().

◆ iterator() [2/6]

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 >::iterator::iterator	(	Self &	aSet,
		typename Container::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 329 of file UnorderedSetByBlock.h.

        : collection( &aSet ), it( anIt )
      {
        if ( it != collection->my_elements.end() )
          {
            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.

◆ iterator() [3/6]

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 >::iterator::iterator	(	Self &	aSet,
		typename Container::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 348 of file UnorderedSetByBlock.h.

        : collection( &aSet ), it( anIt ), bit( aBit )
      {
        if ( it != collection->my_elements.end() )
          {
            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.

◆ iterator() [4/6]

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 >::iterator::iterator	(	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 end().

Definition at line 366 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.end() )
          {
            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.

◆ iterator() [5/6]

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 >::iterator::iterator ( const const_iterator & other )

inline

Constructor from const_iterator

Parameters

other any const_iterator

Definition at line 386 of file UnorderedSetByBlock.h.

        : collection( other.collection ), it( other.it ),
          bit( other.bit ), current( other.current )
      {}

References bit, collection, current, and it.

◆ iterator() [6/6]

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 >::iterator::iterator ( const_iterator && other )

inline

Move constructor from const_iterator

Parameters

other any const_iterator

Definition at line 393 of file UnorderedSetByBlock.h.

        : collection( std::move( other.collection ) ),
          it( std::move( other.it ) ),
          bit( std::move( other.bit ) ),
          current( std::move( other.current ) )
      {}

References bit, collection, current, 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 >::iterator::dereference ( ) const

inlineprivate

Definition at line 447 of file UnorderedSetByBlock.h.

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

References bit, collection, and it.

◆ equal() [1/2]

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 >::iterator::equal ( const const_iterator & other ) const

inlineprivate

Definition at line 441 of file UnorderedSetByBlock.h.

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

References DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::bit, bit, DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::collection, collection, DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::const_iterator::it, and it.

◆ equal() [2/2]

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 >::iterator::equal ( const iterator & other ) const

inlineprivate

Definition at line 432 of file UnorderedSetByBlock.h.

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

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

◆ 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 >::iterator::increment ( )

inlineprivate

Definition at line 409 of file UnorderedSetByBlock.h.

      {
        ASSERT( current != static_cast<Word>(0)
                && "Invalid increment on iterator" );
        current &= ~( static_cast<Word>(1) << bit );
        if ( current == static_cast<Word>(0) )
          {
            ++it;
            if ( it != collection->my_elements.end() )
              {
                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().

◆ operator const_iterator()

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 >::iterator::operator const_iterator ( ) const

inline

Conversation to const_iterator

Returns: the corresponding const_iterator

Definition at line 402 of file UnorderedSetByBlock.h.

      {
        return const_iterator( *collection, it, bit );
      }

References bit, collection, and it.

◆ 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 408 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 310 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 >::iterator::bit

private

the current position in the block.

Definition at line 457 of file UnorderedSetByBlock.h.

Referenced by dereference(), equal(), equal(), increment(), iterator(), iterator(), iterator(), iterator(), and operator const_iterator().

◆ 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 > >>

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

private

the collection that this iterator is traversing.

Definition at line 453 of file UnorderedSetByBlock.h.

Referenced by dereference(), equal(), equal(), increment(), iterator(), iterator(), iterator(), iterator(), iterator(), iterator(), and operator const_iterator().

◆ 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 >::iterator::current

private

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

Definition at line 459 of file UnorderedSetByBlock.h.

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

◆ 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::iterator DGtal::UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual, UnorderedMapAllocator >::iterator::it

private

the hidden iterator that traverses the block map.

Definition at line 455 of file UnorderedSetByBlock.h.

Referenced by dereference(), equal(), equal(), increment(), iterator(), iterator(), iterator(), iterator(), iterator(), iterator(), and operator const_iterator().

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

UnorderedSetByBlock.h

Public Member Functions

Private Member Functions

Private Attributes

Friends

Detailed Description

Constructor & Destructor Documentation

◆ iterator() [1/6]

◆ iterator() [2/6]

◆ iterator() [3/6]

◆ iterator() [4/6]

◆ iterator() [5/6]

◆ iterator() [6/6]

Member Function Documentation

◆ dereference()

◆ equal() [1/2]

◆ equal() [2/2]

◆ increment()

◆ operator const_iterator()

Friends And Related Symbol Documentation

◆ boost::iterator_core_access

◆ UnorderedSetByBlock< Key, TSplitter, Hash, KeyEqual >

Field Documentation

◆ bit

◆ collection

◆ current

◆ it