HiraokaHyperTools.iTextSharp-LGPL  0.2.5
System.util.collections.OrderedTree Class Reference

Public Member Functions

 OrderedTree ()
 
void Add (IComparable key, object data)
 
void RotateLeft (OrderedTreeNode x)
 
void RotateRight (OrderedTreeNode x)
 
bool ContainsKey (IComparable key)
 
object GetData (IComparable key)
 
IComparable GetMinKey ()
 
IComparable GetMaxKey ()
 
object GetMinValue ()
 
object GetMaxValue ()
 
OrderedTreeEnumerator GetEnumerator ()
 
OrderedTreeEnumerator KeyElements (bool ascending)
 
OrderedTreeEnumerator Elements ()
 
OrderedTreeEnumerator Elements (bool ascending)
 
bool IsEmpty ()
 
void Remove (IComparable key)
 
void RemoveMin ()
 
void RemoveMax ()
 
void Clear ()
 

Static Public Attributes

static OrderedTreeNode sentinelNode
 

Properties

object this[IComparable key] [get, set]
 
OrderedTreeEnumerator Keys [get]
 
OrderedTreeEnumerator Values [get]
 
int Count [get]
 

Constructor & Destructor Documentation

◆ OrderedTree()

System.util.collections.OrderedTree.OrderedTree ( )

Member Function Documentation

◆ Add()

void System.util.collections.OrderedTree.Add ( IComparable  key,
object  data 
)

summary> RestoreAfterInsert Additions to red-black trees usually destroy the red-black properties. Examine the tree and restore. Rotations are normally required to restore it /summary>

◆ Clear()

void System.util.collections.OrderedTree.Clear ( )

◆ ContainsKey()

bool System.util.collections.OrderedTree.ContainsKey ( IComparable  key)

summary> GetData Gets the data object associated with the specified key summary>

◆ Elements() [1/2]

OrderedTreeEnumerator System.util.collections.OrderedTree.Elements ( )

◆ Elements() [2/2]

OrderedTreeEnumerator System.util.collections.OrderedTree.Elements ( bool  ascending)

summary> IsEmpty Is the tree empty? summary>

◆ GetData()

object System.util.collections.OrderedTree.GetData ( IComparable  key)

summary> GetMinKey Returns the minimum key value summary>

◆ GetEnumerator()

OrderedTreeEnumerator System.util.collections.OrderedTree.GetEnumerator ( )

summary> Keys if(ascending is true, the keys will be returned in ascending order, else the keys will be returned in descending order. summary>

◆ GetMaxKey()

IComparable System.util.collections.OrderedTree.GetMaxKey ( )

summary> GetMinValue Returns the object having the minimum key value summary>

◆ GetMaxValue()

object System.util.collections.OrderedTree.GetMaxValue ( )

summary> GetEnumerator return an enumerator that returns the tree nodes in order summary>

◆ GetMinKey()

IComparable System.util.collections.OrderedTree.GetMinKey ( )

summary> GetMaxKey Returns the maximum key value summary>

◆ GetMinValue()

object System.util.collections.OrderedTree.GetMinValue ( )

summary> GetMaxValue Returns the object having the maximum key summary>

◆ IsEmpty()

bool System.util.collections.OrderedTree.IsEmpty ( )

summary> Remove removes the key and data object (delete) summary>

◆ KeyElements()

OrderedTreeEnumerator System.util.collections.OrderedTree.KeyElements ( bool  ascending)

summary> Values Provided for .NET compatibility. summary>

◆ Remove()

void System.util.collections.OrderedTree.Remove ( IComparable  key)

summary> Delete Delete a node from the tree and restore red black properties summary>

◆ RemoveMax()

void System.util.collections.OrderedTree.RemoveMax ( )

summary> Clear Empties or clears the tree summary>

◆ RemoveMin()

void System.util.collections.OrderedTree.RemoveMin ( )

summary> RemoveMax removes the node with the maximum key summary>

◆ RotateLeft()

void System.util.collections.OrderedTree.RotateLeft ( OrderedTreeNode  x)

summary> RotateRight Rebalance the tree by rotating the nodes to the right /summary>

◆ RotateRight()

void System.util.collections.OrderedTree.RotateRight ( OrderedTreeNode  x)

Member Data Documentation

◆ sentinelNode

OrderedTreeNode System.util.collections.OrderedTree.sentinelNode
static

Property Documentation

◆ Count

int System.util.collections.OrderedTree.Count
get

◆ Keys

OrderedTreeEnumerator System.util.collections.OrderedTree.Keys
get

◆ this[IComparable key]

object System.util.collections.OrderedTree.this[IComparable key]
getset

summary> Add args: ByVal key As IComparable, ByVal data As Object key is object that implements IComparable interface performance tip: change to use use int type (such as the hashcode) /summary>

◆ Values

OrderedTreeEnumerator System.util.collections.OrderedTree.Values
get

summary> Elements Returns an enumeration of the data objects. if(ascending is true, the objects will be returned in ascending order, else the objects will be returned in descending order. summary>


The documentation for this class was generated from the following file: