• 홈
• System
• util
• collections
• OrderedTree

C# 클래스 System.util.collections.OrderedTree

파일 보기 프로젝트 열기: mapo80/iTextSharp-Monotouch 1 사용 예제들

공개 메소드들

메소드	설명
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

비공개 메소드들

메소드	설명
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

메소드 상세