#include <di/container/tree/rb_tree_iterator.h>
|
| 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 () |
|
| IteratorBase ()=default |
|
| IteratorBase (IteratorBase const &)=default |
|
| IteratorBase (IteratorBase &&)=default |
|
| IteratorBase (IteratorBase const &)=delete |
|
auto | operator= (IteratorBase const &) -> IteratorBase &=default |
|
auto | operator= (IteratorBase &&) -> IteratorBase &=default |
|
auto | operator= (IteratorBase const &) -> IteratorBase &requires(concepts::SameAs< BidirectionalIteratorTag, InputIteratorTag >)=delete |
|
constexpr auto | operator++ () -> RBTreeIterator< Value, Tag > & |
|
constexpr void | operator++ (int) |
|
constexpr auto | operator++ (int) -> RBTreeIterator< Value, Tag > requires(concepts::DerivedFrom< BidirectionalIteratorTag, ForwardIteratorTag >) |
|
constexpr auto | operator-- () -> RBTreeIterator< Value, Tag > &requires(concepts::DerivedFrom< BidirectionalIteratorTag, BidirectionalIteratorTag >) |
|
constexpr auto | operator-- (int) -> 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 >) |
|
◆ RBTreeIterator() [1/3]
template<typename Value, typename
Tag>
◆ RBTreeIterator() [2/3]
template<typename Value, typename
Tag>
◆ RBTreeIterator() [3/3]
template<typename Value, typename
Tag>
◆ advance_one()
template<typename Value, typename
Tag>
◆ back_one()
template<typename Value, typename
Tag>
◆ node()
template<typename Value, typename
Tag>
◆ operator*()
template<typename Value, typename
Tag>
◆ operator->()
template<typename Value, typename
Tag>
◆ operator==
template<typename Value, typename
Tag>
The documentation for this class was generated from the following file: