C# Class System.util.collections.OrderedTree

Mostra file Open project: mapo80/iTextSharp-Monotouch Class Usage Examples

Public Methods

Method	Description
Add ( IComparable key, object data ) : void	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)
Clear ( ) : void
ContainsKey ( IComparable key ) : bool
Elements ( ) : OrderedTreeEnumerator
Elements ( bool ascending ) : OrderedTreeEnumerator
GetData ( IComparable key ) : object
GetEnumerator ( ) : OrderedTreeEnumerator
GetMaxKey ( ) : IComparable
GetMaxValue ( ) : object
GetMinKey ( ) : IComparable
GetMinValue ( ) : object
IsEmpty ( ) : bool
KeyElements ( bool ascending ) : OrderedTreeEnumerator
OrderedTree ( ) : System
Remove ( IComparable key ) : void
RemoveMax ( ) : void
RemoveMin ( ) : void
RotateLeft ( OrderedTreeNode x ) : void	RotateLeft Rebalance the tree by rotating the nodes to the left
RotateRight ( OrderedTreeNode x ) : void	RotateRight Rebalance the tree by rotating the nodes to the right
this ( IComparable key ) : object

Private Methods

Method	Description
Delete ( OrderedTreeNode z ) : void
RestoreAfterDelete ( OrderedTreeNode x ) : void	RestoreAfterDelete Deletions from red-black trees may destroy the red-black properties. Examine the tree and restore. Rotations are normally required to restore it
RestoreAfterInsert ( OrderedTreeNode x ) : void	RestoreAfterInsert Additions to red-black trees usually destroy the red-black properties. Examine the tree and restore. Rotations are normally required to restore it

Method Details

Add() public method

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)

public Add ( IComparable key, object data ) : void
key	IComparable
data	object
return	void

Clear() public method

public Clear ( ) : void
return	void

ContainsKey() public method

public ContainsKey ( IComparable key ) : bool
key	IComparable
return	bool

Elements() public method

public Elements ( ) : OrderedTreeEnumerator
return	OrderedTreeEnumerator

Elements() public method

public Elements ( bool ascending ) : OrderedTreeEnumerator
ascending	bool
return	OrderedTreeEnumerator

GetData() public method

public GetData ( IComparable key ) : object
key	IComparable
return	object

GetEnumerator() public method

public GetEnumerator ( ) : OrderedTreeEnumerator
return	OrderedTreeEnumerator

GetMaxKey() public method

public GetMaxKey ( ) : IComparable
return	IComparable

GetMaxValue() public method

public GetMaxValue ( ) : object
return	object

GetMinKey() public method

public GetMinKey ( ) : IComparable
return	IComparable

GetMinValue() public method

public GetMinValue ( ) : object
return	object

IsEmpty() public method

public IsEmpty ( ) : bool
return	bool

KeyElements() public method

public KeyElements ( bool ascending ) : OrderedTreeEnumerator
ascending	bool
return	OrderedTreeEnumerator

OrderedTree() public method

public OrderedTree ( ) : System
return	System

Remove() public method

public Remove ( IComparable key ) : void
key	IComparable
return	void

RemoveMax() public method

public RemoveMax ( ) : void
return	void

RemoveMin() public method

public RemoveMin ( ) : void
return	void

RotateLeft() public method

RotateLeft Rebalance the tree by rotating the nodes to the left

public RotateLeft ( OrderedTreeNode x ) : void
x	OrderedTreeNode
return	void

RotateRight() public method

RotateRight Rebalance the tree by rotating the nodes to the right

public RotateRight ( OrderedTreeNode x ) : void
x	OrderedTreeNode
return	void

this() public method

public this ( IComparable key ) : object
key	IComparable
return	object