stlab::filter_fullorder_iterator< I, P > Struct Template Reference

Fullorder iterator that visits only positions whose values satisfy predicate P (skipping others by advancing through the underlying fullorder sequence). More...

#include <forest.hpp>

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

Public Member Functions
	filter_fullorder_iterator (I f, I l, P p)
	filter_fullorder_iterator (I f, I l)
template<class U>
	filter_fullorder_iterator (const filter_fullorder_iterator< U, P > &x)
auto	predicate () const -> P
auto	edge () const -> forest_edge
auto	edge () -> forest_edge &
auto	equal_node (const filter_fullorder_iterator &y) const -> bool
auto	base () const -> I
auto	base_reference () -> I &
auto	operator* () -> reference
auto	operator-> () -> pointer
auto	operator++ () -> auto &
auto	operator++ (int) -> filter_fullorder_iterator
auto	operator-- () -> auto &
auto	operator-- (int) -> filter_fullorder_iterator

Detailed Description

template<class I, class P>
struct stlab::filter_fullorder_iterator< I, P >

Fullorder iterator that visits only positions whose values satisfy predicate P (skipping others by advancing through the underlying fullorder sequence).

---

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

• stlab/forest.hpp