|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <tpl_tree_node.H>
Public Types | |
| using | Item_Type = Tree_Node * |
Public Member Functions | |
| void | swap (Iterator &it) noexcept |
| Iterator (Tree_Node *r=nullptr) noexcept | |
| Iterator (Tree_Node &root) | |
| Iterator (const Iterator &it) | |
| Iterator (Iterator &&it) noexcept | |
| Iterator & | operator= (Iterator it) |
| void | reset_first () noexcept |
| bool | has_curr () const noexcept |
| Tree_Node * | get_curr_ne () const noexcept |
| Tree_Node * | get_curr () const |
| void | next_ne () noexcept |
| void | next () |
| void | end () |
| size_t | get_pos () const |
| Return the current position of iterator. Only valid if. | |
Private Attributes | |
| Tree_Node * | root = nullptr |
| Tree_Node * | curr = nullptr |
| long | pos = 0 |
| DynListStack< Tree_Node * > | s |
Definition at line 661 of file tpl_tree_node.H.
Definition at line 670 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 680 of file tpl_tree_node.H.
|
inline |
Definition at line 686 of file tpl_tree_node.H.
Definition at line 688 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 694 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::swap().
|
inline |
Definition at line 750 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr, Aleph::Tree_Node< T >::Iterator::pos, and Aleph::Tree_Node< T >::Iterator::s.
|
inline |
Definition at line 717 of file tpl_tree_node.H.
References ah_overflow_error_if, Aleph::Tree_Node< T >::Iterator::get_curr_ne(), Aleph::Tree_Node< T >::Iterator::has_curr(), and Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >::maps().
|
inlinenoexcept |
Definition at line 715 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr.
Referenced by Aleph::Tree_Node< T >::Iterator::get_curr().
|
inline |
Return the current position of iterator. Only valid if.
Definition at line 759 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::pos.
|
inlinenoexcept |
Definition at line 713 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr.
Referenced by Aleph::Tree_Node< T >::Iterator::get_curr(), Aleph::Tree_Node< T >::Iterator::next(), TEST(), and TEST().
|
inline |
Definition at line 744 of file tpl_tree_node.H.
References ah_overflow_error_if, Aleph::Tree_Node< T >::Iterator::has_curr(), Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >::maps(), and Aleph::Tree_Node< T >::Iterator::next_ne().
|
inlinenoexcept |
Definition at line 723 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr, Aleph::Tree_Node< T >::get_left_child(), Aleph::Tree_Node< T >::get_right_child(), Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >::maps(), Aleph::Tree_Node< T >::Iterator::pos, and Aleph::Tree_Node< T >::Iterator::s.
Referenced by Aleph::Tree_Node< T >::Iterator::next().
Definition at line 700 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::swap().
|
inlinenoexcept |
Definition at line 706 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr, Aleph::Tree_Node< T >::Iterator::pos, Aleph::Tree_Node< T >::Iterator::root, and Aleph::Tree_Node< T >::Iterator::s.
Referenced by TEST().
Definition at line 672 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Iterator::curr, Aleph::Tree_Node< T >::Iterator::pos, Aleph::Tree_Node< T >::Iterator::root, and Aleph::Tree_Node< T >::Iterator::s.
Referenced by Aleph::Tree_Node< T >::Iterator::Iterator(), and Aleph::Tree_Node< T >::Iterator::operator=().
Definition at line 664 of file tpl_tree_node.H.
Referenced by Aleph::Tree_Node< T >::Iterator::end(), Aleph::Tree_Node< T >::Iterator::get_curr_ne(), Aleph::Tree_Node< T >::Iterator::has_curr(), Aleph::Tree_Node< T >::Iterator::next_ne(), Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::Iterator::swap().
|
private |
Definition at line 665 of file tpl_tree_node.H.
Referenced by Aleph::Tree_Node< T >::Iterator::end(), Aleph::Tree_Node< T >::Iterator::get_pos(), Aleph::Tree_Node< T >::Iterator::next_ne(), Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::Iterator::swap().
Definition at line 663 of file tpl_tree_node.H.
Referenced by Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::Iterator::swap().
|
private |
Definition at line 666 of file tpl_tree_node.H.
Referenced by Aleph::Tree_Node< T >::Iterator::end(), Aleph::Tree_Node< T >::Iterator::next_ne(), Aleph::Tree_Node< T >::Iterator::reset_first(), and Aleph::Tree_Node< T >::Iterator::swap().