BTIterator - Iterator fot a binary tree
The binary tree iterator allows iterating through a binary tree. Several iterator functions and operators select an entry in the binary tree as "current entry". This allows accessing the instance from the currently selected entry after the operation has been performed (GetAt()).
Attributes
Functions
- BTIterator - Constructor
- Cancel - - internal feature (not documented)
- Clear - - internal feature (not documented)
- DeleteTree - Delete tree
- Get - Get instance from binary tree
- GetAt - Get instance at current position
- GetCount - Get number of instances in the collection
- GetHead - Get first instance from binary tree
- GetIndex -
- GetNext - Get next instance
- GetNextEntry - Locate next entry
- GetPosition -
- GetPrevious - Get previous instance
- GetPreviousEntry - Locate previous entry
- GetTail - Get last instance from binary tree
- GetTree -
- Insert -
- Lock -
- Remove -
- RemoveAt -
- RemoveHead -
- RemoveTail -
- SetTree -
- Unlock -
- operator() - Position operator
- operator++ - Locate next entry
- operator-- - Locare previous entry
- operator-> -
- ~BTIterator - Destructur