|
CppCommon 1.0.5.0
C++ Common Library
|
Intrusive binary tree reverse iterator. More...
#include <bintree.h>
Public Types | |
| typedef T | value_type |
| typedef value_type & | reference |
| typedef const value_type & | const_reference |
| typedef value_type * | pointer |
| typedef const value_type * | const_pointer |
| typedef ptrdiff_t | difference_type |
| typedef size_t | size_type |
| typedef std::bidirectional_iterator_tag | iterator_category |
Public Member Functions | |
| BinTreeReverseIterator () noexcept | |
| BinTreeReverseIterator (TContainer *container, T *node) noexcept | |
| BinTreeReverseIterator (const BinTreeReverseIterator &it) noexcept=default | |
| BinTreeReverseIterator (BinTreeReverseIterator &&it) noexcept=default | |
| ~BinTreeReverseIterator () noexcept=default | |
| BinTreeReverseIterator & | operator= (const BinTreeReverseIterator &it) noexcept=default |
| BinTreeReverseIterator & | operator= (BinTreeReverseIterator &&it) noexcept=default |
| BinTreeReverseIterator & | operator++ () noexcept |
| BinTreeReverseIterator | operator++ (int) noexcept |
| reference | operator* () noexcept |
| pointer | operator-> () noexcept |
| operator bool () const noexcept | |
| Check if the iterator is valid. | |
| bool | compare (const T &item1, const T &item2) const noexcept |
| Compare two items: if the first item is less than the second one? | |
| void | swap (BinTreeReverseIterator &it) noexcept |
| Swap two instances. | |
Friends | |
| bool | operator== (const BinTreeReverseIterator &it1, const BinTreeReverseIterator &it2) noexcept |
| bool | operator!= (const BinTreeReverseIterator &it1, const BinTreeReverseIterator &it2) noexcept |
| template<class UContainer , typename U > | |
| void | swap (BinTreeReverseIterator< UContainer, U > &it1, BinTreeReverseIterator< UContainer, U > &it2) noexcept |
Intrusive binary tree reverse iterator.
Not thread-safe.
| typedef const value_type* CppCommon::BinTreeReverseIterator< TContainer, T >::const_pointer |
| typedef const value_type& CppCommon::BinTreeReverseIterator< TContainer, T >::const_reference |
| typedef ptrdiff_t CppCommon::BinTreeReverseIterator< TContainer, T >::difference_type |
| typedef std::bidirectional_iterator_tag CppCommon::BinTreeReverseIterator< TContainer, T >::iterator_category |
| typedef value_type* CppCommon::BinTreeReverseIterator< TContainer, T >::pointer |
| typedef value_type& CppCommon::BinTreeReverseIterator< TContainer, T >::reference |
| typedef size_t CppCommon::BinTreeReverseIterator< TContainer, T >::size_type |
| typedef T CppCommon::BinTreeReverseIterator< TContainer, T >::value_type |
|
inlinenoexcept |
|
inlineexplicitnoexcept |
|
defaultnoexcept |
|
defaultnoexcept |
|
defaultnoexcept |
|
inlinenoexcept |
|
inlineexplicitnoexcept |
|
noexcept |
Definition at line 564 of file bintree.inl.
|
noexcept |
Definition at line 535 of file bintree.inl.
|
inlinenoexcept |
Definition at line 556 of file bintree.inl.
|
noexcept |
Definition at line 572 of file bintree.inl.
|
defaultnoexcept |
|
defaultnoexcept |
|
noexcept |
Swap two instances.
Definition at line 578 of file bintree.inl.
|
friend |
|
friend |
|
friend |