BinTree - Binary tree
Inherits:
sts
BinTree provides an ordered list with unique or not-unique instance collection in a balanced binary tree. A binary tree provides fast maintenance features for ordered collections. The order is defined by an elementary value and its position in the instance or by complex keys consisting of one or more key attributes.
Attributes
Functions
- AddEntry - - Title unknown
- BinTree - Constructor
- Clear - - internal feature (not documented)
- Compare - - Title unknown
- CompareKey - - Title unknown
- CreateEntry - - Title unknown
- DeleteEntry - - Title unknown
- GetCount - - Title unknown
- GetEntry - Get entry
- GetFirstEntry - - Title unknown
- GetKey - - internal feature (not documented)
- GetLastEntry - - Title unknown
- Lock - - Title unknown
- Print - - Title unknown
- RegisterIterator - - Title unknown
- RemoveEntry - - Title unknown
- SetDescending - - internal feature (not documented)
- SetIgnoreCase - - internal feature (not documented)
- SetKey - - Title unknown
- SetUnique - - internal feature (not documented)
- Unlock - - Title unknown
- ~BinTree - Destructor