NCBI C++ ToolKit
|
Go to the source code of this file.
Go to the SVN repository for this file.
Classes | |
class | CDefaultNodeKeyGetter< TValue, TKeyEqualP > |
Bi-directionaly linked N way tree. More... | |
struct | CTreeNode< TValue, TKeyGetterP > |
definition of a Culling tree More... | |
class | CTreeNode< TValue, TKeyGetterP >::CSorter< TNodeComparator > |
class | CPairNodeKeyGetter< TNode, TKeyEqualP > |
Default key getter for pair-node (id + value) More... | |
struct | CTreePair< TId, TValue, TIdEqual > |
Node data template for id-value trees. More... | |
class | CCompareByLeafCount< TValue, TKeyGetter > |
Enumerations | |
enum | ETreeTraverseCode { eTreeTraverse , eTreeTraverseStop , eTreeTraverseStepOver } |
Tree traverse code returned by the traverse predicate function. More... | |
Functions | |
template<class TTreeNode , class Fun > | |
Fun | TreeDepthFirstTraverse (TTreeNode &tree_node, Fun func) |
Depth-first tree traversal algorithm. More... | |
template<class TTreeNode , class Fun > | |
Fun | TreeBreadthFirstTraverse (TTreeNode &tree_node, Fun func) |
Breadth-first tree traversal algorithm. More... | |
template<class TValue , class TNodeComparator > | |
void | SortTree (CTreeNode< TValue > &root, const TNodeComparator &compare) |