User Documentation |
RAVL, Recognition And Vision Library |
DEVELOP | HOME PAGE | CLASS LIST | CONTENTS |
Ravl - Core - Trees - AVLTreeC<class KeyT,class DataT> |
PUBLIC |
AVLTreeC::AVLTreeC(void) AVLTreeC::AVLTreeC(bool) BinaryTreeC::Copy(void) const BinaryTreeC::Empty(void) BinaryTreeC::Size(void) const BinaryTreeC::IsEmpty(void) const BinaryTreeC::Find(const KeyT &,DataT &) BinaryTreeC::Remove(const KeyT &) BinaryTreeC::Insert(const KeyT &,const DataT &,bool) BinaryTreeC::MinData(void) BinaryTreeC::MaxData(void) BinaryTreeC::MinKey(void) const BinaryTreeC::MaxKey(void) const BinaryTreeC::Dump(ostream &) RCHandleC::operator =(const RCHandleC RCHandleC::DeepCopy(UIntT) const RCHandleC::operator ==(const RCHandleC RCHandleC::operator !=(const RCHandleC RCHandleC::Hash(void) const RCHandleC::IsValid(void) const RCHandleC::Invalidate(void) RCHandleC::IsHandleType(const DT &) const RCHandleC::CheckHandleType(const DT &) const RCHandleC::References(void) const RCHandleC::operator <<(ostream &,const RCHandleC RCHandleC::operator >>(istream &,RCHandleC |
AVLTreeC<class KeyT,class DataT> | |
AVL Tree. | |
include | "Ravl/AVLTree.hh" |
User Level: | Normal |
Library: | RavlCore |
Example: | exAVLTree.cc |
In Scope: | RavlN |
Deletion is partly lazy, it will only remove nodes that are easy, the rest it flags for removal later.
Parent Classes:
#include "Ravl/BinaryTree.hh" |
#include "Ravl/RefCounter.hh" |
Maintainer:Charles Galambos, Documentation by CxxDoc: Tue Aug 13 09:59:02 2002 |