Forward cursor over Base-owned hash nodes. More...
#include <StormByte/safe/unordered_map.hxx>
Public Types | |
| using | iterator_category = std::forward_iterator_tag |
| Iterator category. | |
| using | iterator_concept = std::forward_iterator_tag |
| C++20 iterator concept. | |
| using | value_type = UnorderedMap::value_type |
| Entry type. | |
| using | difference_type = std::ptrdiff_t |
| Iterator distance type. | |
| using | reference = std::conditional_t<IsConst, const value_type&, value_type&> |
| Entry reference. | |
| using | pointer = std::conditional_t<IsConst, const value_type*, value_type*> |
| Entry pointer. | |
| using | StormByteSafeCursor = void |
| Base cursor mark. Copying the cursor copies one node pointer. | |
Public Member Functions | |
| BasicIterator () noexcept | |
| Construct a singular iterator. | |
| template<bool OtherConst> requires IsConst | |
| &&!OtherConst | BasicIterator (const BasicIterator< OtherConst > &other) noexcept |
| Convert a mutable iterator to a const iterator. | |
| reference | operator* () const noexcept |
| Return the entry stored in the node. | |
| pointer | operator-> () const noexcept |
| Access the entry stored in the node. | |
| BasicIterator & | operator++ () noexcept |
| Advance to the next occupied node, skipping empty buckets. | |
| BasicIterator | operator++ (int) noexcept |
| Advance to the next occupied node, skipping empty buckets. | |
| template<bool OtherConst> | |
| bool | operator== (const BasicIterator< OtherConst > &other) const noexcept |
| Compare node identity. | |
Friends | |
| class | UnorderedMap |
| template<bool> | |
| class | BasicIterator |
Forward cursor over Base-owned hash nodes.
| IsConst | Whether dereference is read-only. |
The cursor stores one node pointer and the map. Copying it does not allocate and does not take ownership. Order is bucket order, not insertion order. Rehash invalidates every cursor.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::difference_type = std::ptrdiff_t |
Iterator distance type.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::iterator_category = std::forward_iterator_tag |
Iterator category.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::iterator_concept = std::forward_iterator_tag |
C++20 iterator concept.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::pointer = std::conditional_t<IsConst, const value_type*, value_type*> |
Entry pointer.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::reference = std::conditional_t<IsConst, const value_type&, value_type&> |
Entry reference.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::StormByteSafeCursor = void |
Base cursor mark. Copying the cursor copies one node pointer.
| using StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst >::value_type = UnorderedMap::value_type |
Entry type.
|
inlinenoexcept |
Construct a singular iterator.
|
inlinenoexcept |
Convert a mutable iterator to a const iterator.
| other | Mutable iterator. |
|
inlinenoexcept |
Return the entry stored in the node.
|
noexcept |
Advance to the next occupied node, skipping empty buckets.
|
noexcept |
Advance to the next occupied node, skipping empty buckets.
|
inlinenoexcept |
Access the entry stored in the node.
|
inlinenoexcept |
Compare node identity.
| other | Iterator to compare. |
|
friend |
|
friend |