|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Iterator over the children of this. More...
#include <tpl_tree_node.H>
Public Member Functions | |
| Children_Iterator (const Tree_Node &p) noexcept | |
| Children_Iterator (Tree_Node &p) noexcept | |
| Children_Iterator (Tree_Node *p) noexcept | |
| Children_Iterator (const Children_Iterator &it) noexcept | |
| bool | has_curr () const noexcept |
| Tree_Node * | get_curr_ne () const noexcept |
| Tree_Node * | get_curr () const |
| void | next_ne () noexcept |
| void | next () |
Private Attributes | |
| Tree_Node * | curr = nullptr |
Iterator over the children of this.
Definition at line 609 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 615 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 618 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 621 of file tpl_tree_node.H.
|
inlinenoexcept |
Definition at line 624 of file tpl_tree_node.H.
|
inline |
Definition at line 631 of file tpl_tree_node.H.
References ah_overflow_error_if, Aleph::Tree_Node< T >::Children_Iterator::curr, and Aleph::Tree_Node< T >::Children_Iterator::get_curr_ne().
|
inlinenoexcept |
Definition at line 629 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Children_Iterator::curr.
Referenced by Aleph::Tree_Node< T >::Children_Iterator::get_curr().
|
inlinenoexcept |
Definition at line 627 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Children_Iterator::curr.
Referenced by sample_tree().
|
inline |
Definition at line 639 of file tpl_tree_node.H.
References ah_overflow_error_if, Aleph::Tree_Node< T >::Children_Iterator::curr, and Aleph::Tree_Node< T >::Children_Iterator::next_ne().
|
inlinenoexcept |
Definition at line 637 of file tpl_tree_node.H.
References Aleph::Tree_Node< T >::Children_Iterator::curr, and Aleph::Tree_Node< T >::get_right_sibling().
Referenced by Aleph::Tree_Node< T >::Children_Iterator::next().
Definition at line 611 of file tpl_tree_node.H.
Referenced by Aleph::Tree_Node< T >::Children_Iterator::get_curr(), Aleph::Tree_Node< T >::Children_Iterator::get_curr_ne(), Aleph::Tree_Node< T >::Children_Iterator::has_curr(), Aleph::Tree_Node< T >::Children_Iterator::next(), and Aleph::Tree_Node< T >::Children_Iterator::next_ne().