|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Iterator over the nodes. More...
#include <tpl_splay_tree.H>
Public Member Functions | |
| Iterator () noexcept=default | |
| Default constructor creates an "end" iterator. | |
| Iterator (GenTdSplayTree &t) | |
Public Member Functions inherited from Aleph::BinNodeInfixIterator< Node > | |
| bool | is_in_first () const noexcept |
Return true if the iterator is on the first node. | |
| bool | is_last () const noexcept |
| void | swap (BinNodeInfixIterator &it) noexcept |
| BinNodeInfixIterator ()=default | |
| BinNodeInfixIterator (Node *r) noexcept | |
| Initialize an iterator on the first node inorder. | |
| BinNodeInfixIterator (const BinNodeInfixIterator &it) | |
| BinNodeInfixIterator (BinNodeInfixIterator &&it) noexcept | |
| void | reset_first () noexcept |
| Reset the iterator to the first node inorder. | |
| void | reset_last () noexcept |
| Reset the iterator to the first node inorder. | |
| void | end () noexcept |
| BinNodeInfixIterator & | operator= (const BinNodeInfixIterator &it) |
| BinNodeInfixIterator & | operator= (BinNodeInfixIterator &&it) noexcept |
| bool | has_curr () const noexcept |
Return true the iterator has current node. | |
| Node * | get_curr_ne () const noexcept |
| Return the current link guaranteeing no exception. Be careful. | |
| Node * | get_curr () const |
Return the current node. Throw overflow_error if there is no current. | |
| size_t | get_pos () const |
| Return the current position of iterator. Only valid if has_curr() == true. | |
| void | next_ne () noexcept |
| void | next () |
| Move the iterator one position forward. | |
Iterator over the nodes.
This class allows traversing the tree nodes in sorted order according to the comparison criteria specified when the tree is instantiated.
Definition at line 382 of file tpl_splay_tree.H.
|
defaultnoexcept |
Default constructor creates an "end" iterator.
|
inline |
Definition at line 386 of file tpl_splay_tree.H.