C# Class System.util.collections.OrderedTree

Afficher le fichier Open project: mapo80/iTextSharp-Monotouch Class Usage Examples

Méthodes publiques

Méthode 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

Méthode 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 méthode

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
Résultat void

Clear() public méthode

public Clear ( ) : void
Résultat void

ContainsKey() public méthode

public ContainsKey ( IComparable key ) : bool
key IComparable
Résultat bool

Elements() public méthode

public Elements ( ) : OrderedTreeEnumerator
Résultat OrderedTreeEnumerator

Elements() public méthode

public Elements ( bool ascending ) : OrderedTreeEnumerator
ascending bool
Résultat OrderedTreeEnumerator

GetData() public méthode

public GetData ( IComparable key ) : object
key IComparable
Résultat object

GetEnumerator() public méthode

public GetEnumerator ( ) : OrderedTreeEnumerator
Résultat OrderedTreeEnumerator

GetMaxKey() public méthode

public GetMaxKey ( ) : IComparable
Résultat IComparable

GetMaxValue() public méthode

public GetMaxValue ( ) : object
Résultat object

GetMinKey() public méthode

public GetMinKey ( ) : IComparable
Résultat IComparable

GetMinValue() public méthode

public GetMinValue ( ) : object
Résultat object

IsEmpty() public méthode

public IsEmpty ( ) : bool
Résultat bool

KeyElements() public méthode

public KeyElements ( bool ascending ) : OrderedTreeEnumerator
ascending bool
Résultat OrderedTreeEnumerator

OrderedTree() public méthode

public OrderedTree ( ) : System
Résultat System

Remove() public méthode

public Remove ( IComparable key ) : void
key IComparable
Résultat void

RemoveMax() public méthode

public RemoveMax ( ) : void
Résultat void

RemoveMin() public méthode

public RemoveMin ( ) : void
Résultat void

RotateLeft() public méthode

RotateLeft Rebalance the tree by rotating the nodes to the left
public RotateLeft ( OrderedTreeNode x ) : void
x OrderedTreeNode
Résultat void

RotateRight() public méthode

RotateRight Rebalance the tree by rotating the nodes to the right
public RotateRight ( OrderedTreeNode x ) : void
x OrderedTreeNode
Résultat void

this() public méthode

public this ( IComparable key ) : object
key IComparable
Résultat object