tree::compare_nodes

tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering > Class Template Reference

Collaboration diagram for tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >:

Collaboration graph
[legend]

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class StrictWeakOrdering>
class tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >

Comparator class for two nodes of a tree (used for sorting and searching).

Definition at line 443 of file tree.h.


Public Member Functions

 compare_nodes (StrictWeakOrdering comp)
bool operator() (const tree_node *a, const tree_node *b)

Private Attributes

StrictWeakOrdering comp_

Constructor & Destructor Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class StrictWeakOrdering>
tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >::compare_nodes ( StrictWeakOrdering  comp  )  [inline]

Definition at line 445 of file tree.h.

00445 : comp_(comp) {};

Member Function Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class StrictWeakOrdering>
bool tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >::operator() ( const tree_node *  a,
const tree_node *  b 
) [inline]

Definition at line 447 of file tree.h.

References tree_node_< T >::data.

00448                {
00449                static StrictWeakOrdering comp;
00450                return comp(a->data, b->data);
00451                }

Field Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class StrictWeakOrdering>
StrictWeakOrdering tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >::comp_ [private]

Definition at line 453 of file tree.h.

The documentation for this class was generated from the following file:
Generated on Wed Feb 27 20:32:35 2008 for php.ast.svn.src. by  doxygen 1.5.3