forest<T> |
Defined in
<forest.hpp> |
A hierarchical, node-based data structure that supports a number of different traversal iterators (forward, reverse, fullorder, preorder, postorder, and more).
Types
Type | Definition | Notes |
---|---|---|
stlab::child_iterator<iterator> |
child iterator type qualification needed since: A name N used in a class S shall refer to the same declaration in its context and when re-evaluated in the completed scope of S. |
|
stlab::child_iterator<const_iterator> |
const child iterator type |
|
detail::forest_const_iterator<T> |
const fullorder iterator type |
|
const T * |
const pointer type |
|
edge_iterator<stlab::forest::const_iterator, forest_edge::trailing> |
const postorder iterator type |
|
edge_iterator<stlab::forest::const_iterator, forest_edge::leading> |
const preorder iterator type |
|
const T & |
const reference type |
|
reverse_fullorder_iterator<stlab::forest::const_iterator> |
const reverse fullorder iterator type |
|
std::ptrdiff_t |
difference type |
|
detail::forest_iterator<T> |
fullorder iterator type |
|
T * |
pointer type |
|
edge_iterator<stlab::forest::iterator, forest_edge::trailing> |
postorder iterator type |
|
edge_iterator<stlab::forest::iterator, forest_edge::leading> |
preorder iterator type |
|
T & |
reference type types |
|
std::reverse_iterator<child_iterator> |
reverse child iterator type |
|
reverse_fullorder_iterator<stlab::forest::iterator> |
reverse fullorder iterator type |
|
std::size_t |
size type |
|
T |
value type |