|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Iterator on nodes of the tree. More...
#include <tpl_rbRk.H>
Private Types | |
| using | Base = BinTreeXt_Iterator< Gen_Rb_Tree_Rk, Node, Key, Compare > |
Additional Inherited Members | |
Public Member Functions inherited from Aleph::BinTreeXt_Iterator< Gen_Rb_Tree_Rk, Node, Key, Compare > | |
| BinTreeXt_Iterator () noexcept | |
| BinTreeXt_Iterator (const Gen_Rb_Tree_Rk &__tree) noexcept | |
| BinTreeXt_Iterator (const Gen_Rb_Tree_Rk &__tree, Node *__curr) noexcept | |
| BinTreeXt_Iterator (const Gen_Rb_Tree_Rk &__tree, const size_t pos) noexcept | |
| BinTreeXt_Iterator (const BinTreeXt_Iterator &itor) noexcept | |
| BinTreeXt_Iterator & | operator= (const BinTreeXt_Iterator &itor) noexcept |
| void | reset_first () noexcept |
| void | reset_last () noexcept |
| void | end () noexcept |
| void | reset_to_key (const Key &key) noexcept |
| void | reset_to_node (Node *node) noexcept |
| void | reset_to_pos (const size_t pos) noexcept |
| Node * | get_curr_ne () const noexcept |
| Node * | get_curr () const noexcept |
| size_t | get_current_position () const |
| size_t | get_pos () const |
| bool | has_curr () const noexcept |
| void | prev () |
| void | next_ne () noexcept |
| void | next () |
| Node * | del () |
| bool | operator== (const BinTreeXt_Iterator &itor) const noexcept |
| bool | operator!= (const BinTreeXt_Iterator &itor) const |
Protected Attributes inherited from Aleph::BinTreeXt_Iterator< Gen_Rb_Tree_Rk, Node, Key, Compare > | |
| Gen_Rb_Tree_Rk * | tree_ptr |
| Node * | curr |
| int | curr_pos |
Static Protected Attributes inherited from Aleph::BinTreeXt_Iterator< Gen_Rb_Tree_Rk, Node, Key, Compare > | |
| static constexpr int | Pos_Not_Current |
| static constexpr int | Pos_Empty_Container |
| static constexpr int | Pos_Not_Updated |
Iterator on nodes of the tree.
The visit order is inorder.
Definition at line 1522 of file tpl_rbRk.H.
|
private |
Definition at line 1524 of file tpl_rbRk.H.