Adobe Systems Incorporated

depth_fullorder_iterator< I > Class Template Reference

#include <forest.hpp>

List of all members.

Public Types

< depth_fullorder_iterator< I >
, I >::difference_type 

Public Member Functions

difference_type depth () const
 depth_fullorder_iterator (difference_type d=0)
 depth_fullorder_iterator (I x, difference_type d=0)
template<typename U >
 depth_fullorder_iterator (const depth_fullorder_iterator< U > &x)
std::size_t & edge ()
std::size_t edge () const
bool equal_node (depth_fullorder_iterator const &y) const


class boost::iterator_core_access

Detailed Description

template<typename I>
class adobe::depth_fullorder_iterator< I >

Definition at line 291 of file forest.hpp.

Member Typedef Documentation

typedef boost::iterator_adaptor<depth_fullorder_iterator<I>, I>::difference_type difference_type

Definition at line 294 of file forest.hpp.

Constructor & Destructor Documentation

Definition at line 296 of file forest.hpp.

depth_fullorder_iterator ( x,
difference_type  d = 0 
) [explicit]

Definition at line 297 of file forest.hpp.

Definition at line 301 of file forest.hpp.

Member Function Documentation

difference_type depth (  ) const

Definition at line 306 of file forest.hpp.

std::size_t edge (  ) const

Definition at line 307 of file forest.hpp.

std::size_t& edge (  )

Definition at line 308 of file forest.hpp.

bool equal_node ( depth_fullorder_iterator< I > const &  y ) const

Definition at line 309 of file forest.hpp.

Friends And Related Function Documentation

friend class boost::iterator_core_access [friend]

Definition at line 312 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