|
di 0.1.0
|
#include <di/container/tree/rb_tree_iterator.h>
Public Member Functions | |
| RBTreeIterator ()=default | |
| constexpr | RBTreeIterator (Node *node, bool at_end=false) |
| constexpr | RBTreeIterator (Node &node) |
| constexpr auto | operator* () const -> Value & |
| constexpr auto | operator-> () const -> Value * |
| constexpr auto | node () const -> Node & |
| constexpr void | advance_one () |
| constexpr void | back_one () |
| Public Member Functions inherited from di::container::IteratorBase< RBTreeIterator< Value, Tag >, BidirectionalIteratorTag, Value, ssize_t > | |
| IteratorBase ()=default | |
| auto | operator= (IteratorBase const &) -> IteratorBase &=default |
| constexpr auto | operator++ () -> RBTreeIterator< Value, Tag > & |
| constexpr auto | operator-- () -> RBTreeIterator< Value, Tag > &requires(concepts::DerivedFrom< BidirectionalIteratorTag, BidirectionalIteratorTag >) |
| constexpr auto | operator[] (ssize_t n) const -> decltype(auto) requires(concepts::DerivedFrom< BidirectionalIteratorTag, RandomAccessIteratorTag >) |
| constexpr auto | operator+= (ssize_t n) -> RBTreeIterator< Value, Tag > &requires(concepts::DerivedFrom< BidirectionalIteratorTag, RandomAccessIteratorTag >) |
| constexpr auto | operator-= (ssize_t n) -> RBTreeIterator< Value, Tag > &requires(concepts::DerivedFrom< BidirectionalIteratorTag, RandomAccessIteratorTag >) |
Friends | |
| constexpr friend auto | operator== (RBTreeIterator const &a, RBTreeIterator const &b) -> bool |
|
default |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
friend |