JCL Help:TJclExtendedBinaryTree

 JCL Help: TJclExtendedBinaryTree Class

JCL Classes

► JclBinaryTrees.pas Classes

[+] JclBinaryTrees.pas Classes

► TJclExtendedBinaryTree Methods

[+] TJclExtendedBinaryTree Methods

► TJclExtendedBinaryTree Properties

[+] TJclExtendedBinaryTree Properties

JEDI Code Library Help

• Packages
  • RTL enhancements
  • Containers
  • Developer Tools
  • VCL enhancements
• Files
  • Classes
  • Interfaces
  • Functions
  • Variables
  • Constants
  • Types
  • Records
• Project summary
• License

Search in JCL Help

 

Search in all projects

 

Class Hierarchy

IJclLockable

    |
IJclBaseContainer

    |
IJclExtendedContainer

    |
IJclExtendedCollection

    |
IJclExtendedTree

    |
TJclAbstractLockable

    |
IJclCloneable

    |
IJclIntfCloneable

    |
TJclAbstractContainerBase

    |
IJclExtendedComparer

    |
IJclExtendedEqualityComparer

    |
IJclExtendedHashConverter

    |
IJclExtendedOwner

    |
TJclExtendedAbstractContainer

    |
IJclPackable

    |
TJclExtendedBinaryTree

Summary

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

Pascal

 public TJclExtendedBinaryTree = class(TJclExtendedAbstractContainer, IJclLockable, IJclIntfCloneable, IJclCloneable, IJclPackable, IJclBaseContainer, IJclExtendedContainer, IJclExtendedEqualityComparer, IJclExtendedComparer, IJclExtendedCollection, IJclExtendedTree);

Description

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

About

Unit

JclBinaryTrees

Navigation

▼ TJclExtendedBinaryTree

  TJclExtendedBinaryTree

  TJclExtendedBinaryTree.Add@Extended

  TJclExtendedBinaryTree.AddAll@IJclExtendedCollection

  TJclExtendedBinaryTree.AssignDataTo@TJclAbstractContainerBase

  TJclExtendedBinaryTree.AssignPropertiesTo@TJclAbstractContainerBase

  TJclExtendedBinaryTree.AutoPack

  TJclExtendedBinaryTree.Clear

  TJclExtendedBinaryTree.CollectionEquals@IJclExtendedCollection

  TJclExtendedBinaryTree.Contains@Extended

  TJclExtendedBinaryTree.ContainsAll@IJclExtendedCollection

  TJclExtendedBinaryTree.Create@TExtendedCompare

  TJclExtendedBinaryTree.CreateEmptyContainer

  TJclExtendedBinaryTree.Destroy

  TJclExtendedBinaryTree.Extract@Extended

  TJclExtendedBinaryTree.ExtractAll@IJclExtendedCollection

  TJclExtendedBinaryTree.First

  TJclExtendedBinaryTree.GetEnumerator

  TJclExtendedBinaryTree.GetRoot

  TJclExtendedBinaryTree.GetTraverseOrder

  TJclExtendedBinaryTree.IsEmpty

  TJclExtendedBinaryTree.Last

  TJclExtendedBinaryTree.Pack

  TJclExtendedBinaryTree.Remove@Extended

  TJclExtendedBinaryTree.RemoveAll@IJclExtendedCollection

  TJclExtendedBinaryTree.RetainAll@IJclExtendedCollection

  TJclExtendedBinaryTree.Root

  TJclExtendedBinaryTree.SetCapacity@Integer

  TJclExtendedBinaryTree.SetTraverseOrder@TJclTraverseOrder

  TJclExtendedBinaryTree.Size

  TJclExtendedBinaryTree.TraverseOrder

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

The JEDI Code Library source code is hosted at : link to view the current source code, link to the subversion repository