JCL Help:TJclIntegerBinaryTree

From Project JEDI Wiki
Jump to navigationJump to search

Class Hierarchy

IJclLockable
|
IJclBaseContainer
|
IJclIntegerCollection
|
IJclIntegerTree
|
TJclAbstractLockable
|
IJclCloneable
|
IJclIntfCloneable
|
TJclAbstractContainerBase
|
IJclIntegerComparer
|
IJclIntegerEqualityComparer
|
IJclIntegerHashConverter
|
IJclIntegerOwner
|
TJclIntegerAbstractContainer
|
IJclPackable
|
TJclIntegerBinaryTree


Summary

This class store objects in a red-black binary tree.


Pascal

 public TJclIntegerBinaryTree = class(TJclIntegerAbstractContainer, IJclLockable, IJclIntfCloneable, IJclCloneable, IJclPackable, IJclBaseContainer, IJclIntegerEqualityComparer, IJclIntegerComparer, IJclIntegerCollection, IJclIntegerTree);


Description

The description for this help topic does not exist, edit this page


About

Unit

JclBinaryTrees


Navigation

Donator

Jean-Philippe Bempel


Notes

The binary tree is always balanced with red-black algorithms (from CLR) for best performance in search. When an element is removed or insert, the tree is modified to keep balancing. You can traverse the tree with iterators in different order (PreOrder, Order and PostOrder). Iterators are bidirectionnal. If the compilation symbol THREADSAFE is defined, this container is threadsafe.


Contribute to this help topic

This documentation wiki is based on the collaborative effort of Project JEDI users. Your edits are welcome in order to improve documentation quality: edit this page