AVLTree< Item > Class Template Reference

AVL-type balanced tree. More...

#include <AVLTree.h>

Public Member Functions
void	add (const Item &item)
	Add (copy) Item into the tree. More...
bool	find (Item &item)
	Try to find item in tree. More...
void	traverse (void(*visit)(const Item &, void *), void *arg=0)
	Sorted (inorder) traverse, calling visitor routine on each item.
void	clear ()
	Delete all tree entries.
void	make_dotfile (const char *name)
	Generates a graphviz 'dot' file. More...
bool	selftest ()
	Tests if the tree is AVL-balanced.

Detailed Description

template<class Item>
class AVLTree< Item >

AVL-type balanced tree.

Sorted binary tree for Items that support the following comparison member function:

• int sort_compare(const item &a, const item &b);

Member Function Documentation

template<class Item >

void AVLTree< Item >::add ( const Item &  item )

inline

Add (copy) Item into the tree.

Exceptions

GenericException

template<class Item >

bool AVLTree< Item >::find ( Item &  item )

inline

Try to find item in tree.

Result: true if found, in which case the item argument is set to the one found.

---

The documentation for this class was generated from the following file:

• /home/malitsky/projects/epics-archiver/sourceforge/trunk/ea4-cpp/include/common/tools/AVLTree.h