JCL Help:TJclPtrBinaryTree

 JCL Help: TJclPtrBinaryTree Class

JCL Classes

► JclBinaryTrees.pas Classes

[+] JclBinaryTrees.pas Classes

► TJclPtrBinaryTree Methods

[+] TJclPtrBinaryTree Methods

► TJclPtrBinaryTree Properties

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

    |
IJclPtrCollection

    |
IJclPtrTree

    |
TJclAbstractLockable

    |
IJclCloneable

    |
IJclIntfCloneable

    |
TJclAbstractContainerBase

    |
IJclPtrComparer

    |
IJclPtrEqualityComparer

    |
IJclPtrHashConverter

    |
IJclPtrOwner

    |
TJclPtrAbstractContainer

    |
IJclPackable

    |
TJclPtrBinaryTree

Summary

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

Pascal

 public TJclPtrBinaryTree = class(TJclPtrAbstractContainer, IJclLockable, IJclIntfCloneable, IJclCloneable, IJclPackable, IJclBaseContainer, IJclPtrEqualityComparer, IJclPtrComparer, IJclPtrCollection, IJclPtrTree);

Description

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

About

Unit

JclBinaryTrees

Navigation

▼ TJclPtrBinaryTree

  TJclPtrBinaryTree

  TJclPtrBinaryTree.Add@Pointer

  TJclPtrBinaryTree.AddAll@IJclPtrCollection

  TJclPtrBinaryTree.AssignDataTo@TJclAbstractContainerBase

  TJclPtrBinaryTree.AssignPropertiesTo@TJclAbstractContainerBase

  TJclPtrBinaryTree.AutoPack

  TJclPtrBinaryTree.Clear

  TJclPtrBinaryTree.CollectionEquals@IJclPtrCollection

  TJclPtrBinaryTree.Contains@Pointer

  TJclPtrBinaryTree.ContainsAll@IJclPtrCollection

  TJclPtrBinaryTree.Create@TPtrCompare

  TJclPtrBinaryTree.CreateEmptyContainer

  TJclPtrBinaryTree.Destroy

  TJclPtrBinaryTree.Extract@Pointer

  TJclPtrBinaryTree.ExtractAll@IJclPtrCollection

  TJclPtrBinaryTree.First

  TJclPtrBinaryTree.GetEnumerator

  TJclPtrBinaryTree.GetRoot

  TJclPtrBinaryTree.GetTraverseOrder

  TJclPtrBinaryTree.IsEmpty

  TJclPtrBinaryTree.Last

  TJclPtrBinaryTree.Pack

  TJclPtrBinaryTree.Remove@Pointer

  TJclPtrBinaryTree.RemoveAll@IJclPtrCollection

  TJclPtrBinaryTree.RetainAll@IJclPtrCollection

  TJclPtrBinaryTree.Root

  TJclPtrBinaryTree.SetCapacity@Integer

  TJclPtrBinaryTree.SetTraverseOrder@TJclTraverseOrder

  TJclPtrBinaryTree.Size

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