JCL Help:TJclCardinalBinaryTree

 JCL Help: TJclCardinalBinaryTree Class

JCL Classes

► JclBinaryTrees.pas Classes

[+] JclBinaryTrees.pas Classes

► TJclCardinalBinaryTree Methods

[+] TJclCardinalBinaryTree Methods

► TJclCardinalBinaryTree Properties

[+] TJclCardinalBinaryTree 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

    |
IJclCardinalCollection

    |
IJclCardinalTree

    |
TJclAbstractLockable

    |
IJclCloneable

    |
IJclIntfCloneable

    |
TJclAbstractContainerBase

    |
IJclCardinalComparer

    |
IJclCardinalEqualityComparer

    |
IJclCardinalHashConverter

    |
IJclCardinalOwner

    |
TJclCardinalAbstractContainer

    |
IJclPackable

    |
TJclCardinalBinaryTree

Summary

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

Pascal

 public TJclCardinalBinaryTree = class(TJclCardinalAbstractContainer, IJclLockable, IJclIntfCloneable, IJclCloneable, IJclPackable, IJclBaseContainer, IJclCardinalEqualityComparer, IJclCardinalComparer, IJclCardinalCollection, IJclCardinalTree);

Description

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

About

Unit

JclBinaryTrees

Navigation

▼ TJclCardinalBinaryTree

  TJclCardinalBinaryTree

  TJclCardinalBinaryTree.Add@Cardinal

  TJclCardinalBinaryTree.AddAll@IJclCardinalCollection

  TJclCardinalBinaryTree.AssignDataTo@TJclAbstractContainerBase

  TJclCardinalBinaryTree.AssignPropertiesTo@TJclAbstractContainerBase

  TJclCardinalBinaryTree.AutoPack

  TJclCardinalBinaryTree.Clear

  TJclCardinalBinaryTree.CollectionEquals@IJclCardinalCollection

  TJclCardinalBinaryTree.Contains@Cardinal

  TJclCardinalBinaryTree.ContainsAll@IJclCardinalCollection

  TJclCardinalBinaryTree.Create@TCardinalCompare

  TJclCardinalBinaryTree.CreateEmptyContainer

  TJclCardinalBinaryTree.Destroy

  TJclCardinalBinaryTree.Extract@Cardinal

  TJclCardinalBinaryTree.ExtractAll@IJclCardinalCollection

  TJclCardinalBinaryTree.First

  TJclCardinalBinaryTree.GetEnumerator

  TJclCardinalBinaryTree.GetRoot

  TJclCardinalBinaryTree.GetTraverseOrder

  TJclCardinalBinaryTree.IsEmpty

  TJclCardinalBinaryTree.Last

  TJclCardinalBinaryTree.Pack

  TJclCardinalBinaryTree.Remove@Cardinal

  TJclCardinalBinaryTree.RemoveAll@IJclCardinalCollection

  TJclCardinalBinaryTree.RetainAll@IJclCardinalCollection

  TJclCardinalBinaryTree.Root

  TJclCardinalBinaryTree.SetCapacity@Integer

  TJclCardinalBinaryTree.SetTraverseOrder@TJclTraverseOrder

  TJclCardinalBinaryTree.Size

  TJclCardinalBinaryTree.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