filter_fullorder_iterator< I, P > Class Template Reference

#include <forest.hpp>

List of all members.

Public Member Functions
std::size_t	edge () const
std::size_t &	edge ()
bool	equal_node (const filter_fullorder_iterator &y) const
	filter_fullorder_iterator (I f, I l)
	filter_fullorder_iterator ()
	filter_fullorder_iterator (I f, I l, P p)
template<typename U >
	filter_fullorder_iterator (const filter_fullorder_iterator< U, P > &x)
P	predicate () const
Friends
class	boost::iterator_core_access

---

Detailed Description

template<typename I, typename P>
class adobe::filter_fullorder_iterator< I, P >

Definition at line 135 of file forest.hpp.

---

Constructor & Destructor Documentation

filter_fullorder_iterator

(

)

Definition at line 139 of file forest.hpp.

filter_fullorder_iterator	(	I	f,
		I	l,
		P	p
	)

Definition at line 141 of file forest.hpp.

filter_fullorder_iterator	(	I	f,
		I	l
	)

Definition at line 149 of file forest.hpp.

filter_fullorder_iterator

(

const filter_fullorder_iterator< U, P > &

x )

Definition at line 156 of file forest.hpp.

---

Member Function Documentation

std::size_t edge

(

)

const

Definition at line 166 of file forest.hpp.

std::size_t& edge

(

)

Definition at line 167 of file forest.hpp.

bool equal_node

(

const filter_fullorder_iterator< I, P > &

y )

const

Definition at line 169 of file forest.hpp.

P predicate

(

)

const

Definition at line 164 of file forest.hpp.

---

Friends And Related Function Documentation

friend class boost::iterator_core_access [friend]

Definition at line 172 of file forest.hpp.