stlab::reverse_fullorder_iterator< I > Struct Template Reference

Reverses the direction of a fullorder walk while preserving edge semantics (bidirectional). More...

#include <forest.hpp>

Public Types
using	iterator_type
using	value_type
using	difference_type
using	reference
using	pointer
using	iterator_category

Public Member Functions
	reverse_fullorder_iterator (I x)
template<class U>
	reverse_fullorder_iterator (const reverse_fullorder_iterator< U > &x)
auto	base () const -> iterator_type
auto	edge () const -> forest_edge
auto	edge () -> forest_edge &
auto	equal_node (const reverse_fullorder_iterator &y) const -> bool
auto	operator* () -> reference
auto	operator-> () -> pointer
auto	operator++ () -> auto &
auto	operator++ (int) -> reverse_fullorder_iterator
auto	operator-- () -> auto &
auto	operator-- (int) -> reverse_fullorder_iterator

Detailed Description

template<class I>
struct stlab::reverse_fullorder_iterator< I >

Reverses the direction of a fullorder walk while preserving edge semantics (bidirectional).

---

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

• stlab/forest.hpp