Class FlatHashTable::const_iterator

• Defined in File FlatHashTable.h

Nested Relationships

This class is a nested type of Template Class FlatHashTable.

Class Documentation

class const_iterator

the iterator on the full places, by its group, the slot of the first place of the group and the mask of the full places of the group from its own on, the lowest bit its place: a step clears that bit and keeps the places still full in the control bytes, so that the next place depends on the previous one by two operations on the mask and a place emptied meanwhile is skipped; past the group it skips the empty groups whole, up to a sentinel group after the last, whose byte 0 is full and whose first place is the end, so that a step tests no bound

Public Types

using value_type = std::pair<const K&, const V&>

using reference = value_type

using difference_type = std::ptrdiff_t

using iterator_concept = std::bidirectional_iterator_tag

using iterator_category = std::input_iterator_tag

Public Functions

const_iterator(void) = default

inline reference operator*(void) const

inline const_iterator &operator++(void)

const_iterator &operator--(void)

inline const_iterator operator++(int)

inline const_iterator operator--(int)

inline bool operator==(const const_iterator &o) const