stlab 2.3.0
Modern, modular C++ algorithms, data structures, and concurrency primitives
Loading...
Searching...
No Matches
stlab::edge_iterator< I, Edge > Struct Template Reference

Fullorder iterator restricted to a single edge kind: visits only leading or trailing positions (e.g. preorder vs. postorder when Edge is fixed). More...

#include <forest.hpp>

Public Types

using value_type
using difference_type
using reference
using pointer
using iterator_category

Public Member Functions

 edge_iterator (const I &x)
template<class U>
 edge_iterator (const edge_iterator< U, Edge > &u)
auto base () const -> I
auto operator* () -> reference
auto operator-> () -> pointer
auto operator++ () -> auto &
auto operator++ (int) -> edge_iterator
auto operator-- () -> auto &
auto operator-- (int) -> edge_iterator

Detailed Description

template<class I, forest_edge Edge>
struct stlab::edge_iterator< I, Edge >

Fullorder iterator restricted to a single edge kind: visits only leading or trailing positions (e.g. preorder vs. postorder when Edge is fixed).


The documentation for this struct was generated from the following file: