|
stlab 2.3.0
Modern, modular C++ algorithms, data structures, and concurrency primitives
|
Fullorder iterator that tracks depth in the tree as it advances or retreats. More...
#include <forest.hpp>
Public Types | |
| using | value_type |
| using | difference_type |
| using | reference |
| using | pointer |
| using | iterator_category |
Public Member Functions | |
| depth_fullorder_iterator (difference_type d=0) | |
| depth_fullorder_iterator (I x, difference_type d=0) | |
| template<class U> | |
| depth_fullorder_iterator (const depth_fullorder_iterator< U > &x) | |
| auto | depth () const -> difference_type |
| auto | edge () const -> forest_edge |
| auto | edge () -> forest_edge & |
| auto | equal_node (depth_fullorder_iterator const &y) const -> bool |
| auto | base () const -> I |
| auto | operator* () -> reference |
| auto | operator-> () -> pointer |
| auto | operator++ () -> auto & |
| auto | operator++ (int) -> depth_fullorder_iterator |
| auto | operator-- () -> auto & |
| auto | operator-- (int) -> depth_fullorder_iterator |
Fullorder iterator that tracks depth in the tree as it advances or retreats.