stlab.adobe.com Adobe Systems Incorporated
filter_fullorder_iterator< I, P > Class Template Reference

#include <forest.hpp>

Public Member Functions

std::size_t edge () const
 
std::size_t & edge ()
 
bool equal_node (const filter_fullorder_iterator &y) const
 
 filter_fullorder_iterator ()
 
 filter_fullorder_iterator (I f, I l, P p)
 
 filter_fullorder_iterator (I f, I l)
 
template<typename U >
 filter_fullorder_iterator (const filter_fullorder_iterator< U, P > &x)
 
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() [1/4]

Definition at line 139 of file forest.hpp.

§ filter_fullorder_iterator() [2/4]

filter_fullorder_iterator ( f,
l,
p 
)

Definition at line 141 of file forest.hpp.

§ filter_fullorder_iterator() [3/4]

filter_fullorder_iterator ( f,
l 
)

Definition at line 149 of file forest.hpp.

§ filter_fullorder_iterator() [4/4]

Definition at line 156 of file forest.hpp.

Member Function Documentation

§ edge() [1/2]

std::size_t edge ( ) const

Definition at line 166 of file forest.hpp.

§ edge() [2/2]

std::size_t& edge ( )

Definition at line 167 of file forest.hpp.

§ equal_node()

bool equal_node ( const filter_fullorder_iterator< I, P > &  y) const

Definition at line 169 of file forest.hpp.

§ predicate()

P predicate ( ) const

Definition at line 164 of file forest.hpp.

Friends And Related Function Documentation

§ boost::iterator_core_access

friend class boost::iterator_core_access
friend

Definition at line 172 of file forest.hpp.

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google