Bidirectional cursor. More...
#include <StormByte/safe/set.hxx>
Public Types | |
| using | iterator_category = std::bidirectional_iterator_tag |
| Iterator category. | |
| using | iterator_concept = std::bidirectional_iterator_tag |
| C++20 iterator concept. | |
| using | value_type = K |
| Stored value. | |
| using | difference_type = std::ptrdiff_t |
| Iterator distance type. | |
| using | pointer = const K* |
| Pointer to the key. | |
| using | reference = const K& |
| Reference to the key. | |
| using | StormByteSafeCursor = void |
| Base cursor mark. Copying the cursor copies one node pointer. | |
Public Member Functions | |
| iterator () noexcept=default | |
| Construct a singular iterator. | |
| reference | operator* () const |
| Return the key. | |
| pointer | operator-> () const |
| Return a pointer to the key. | |
| iterator & | operator++ () |
| Advance to the next key. | |
| iterator | operator++ (int) |
| Advance to the next key. | |
| iterator & | operator-- () |
| Move to the previous key. | |
| iterator | operator-- (int) |
| Move to the previous key. | |
| bool | operator== (const iterator &other) const noexcept |
| Compare node identity. | |
Friends | |
| class | Set |
Bidirectional cursor.
Dereference is the key.
| using StormByte::Safe::Set< K, Compare >::iterator::difference_type = std::ptrdiff_t |
Iterator distance type.
| using StormByte::Safe::Set< K, Compare >::iterator::iterator_category = std::bidirectional_iterator_tag |
Iterator category.
| using StormByte::Safe::Set< K, Compare >::iterator::iterator_concept = std::bidirectional_iterator_tag |
C++20 iterator concept.
| using StormByte::Safe::Set< K, Compare >::iterator::pointer = const K* |
Pointer to the key.
| using StormByte::Safe::Set< K, Compare >::iterator::reference = const K& |
Reference to the key.
| using StormByte::Safe::Set< K, Compare >::iterator::StormByteSafeCursor = void |
Base cursor mark. Copying the cursor copies one node pointer.
| using StormByte::Safe::Set< K, Compare >::iterator::value_type = K |
Stored value.
|
defaultnoexcept |
Construct a singular iterator.
|
inline |
Return the key.
|
inline |
Advance to the next key.
|
inline |
Advance to the next key.
|
inline |
Move to the previous key.
|
inline |
Move to the previous key.
|
inline |
Return a pointer to the key.
|
inlinenoexcept |
Compare node identity.
| other | Iterator to compare. |
|
friend |