TheCodingMonkey.Collections Documentation
The Coding Monkey Collections
Binary Search Tree Iterators
Command Line Arguments Parser
Sorting Algorithm Performance Characteristics
Reference
TheCodingMonkey.Collections assembly
TheCodingMonkey.Collections
CmdArguments class
IBiDirEnumerator<T> interface
CmdArguments
CmdArguments.Add method (1 of 2)
CmdArguments.CaseSensitive property
CmdArguments.Clear method
CmdArguments constructor
CmdArguments.Contains method
CmdArguments.ContainsKey method
CmdArguments.CopyTo method
CmdArguments.Count property
CmdArguments.GetEnumerator method
CmdArguments.IsReadOnly property
CmdArguments indexer
CmdArguments.Keys property
CmdArguments.Remove method (1 of 2)
CmdArguments.TryGetValue method
CmdArguments.Values property
IBiDirEnumerator 1
IBiDirEnumerator<T>.MovePrevious method
TheCodingMonkey.Collections.BST
AVLException class
AVLNode<TKey,TValue> class
AVLTree<TKey,TValue> class
BSTException class
BinarySearchTree<TKey,TValue> class
FlatEnumerator<TKey,TValue> class
InOrderFlatEnumerator<TKey,TValue> class
LevelOrderFlatEnumerator<TKey,TValue> class
Node<TKey,TValue>.CompType<TKey,TValue> enumeration
Node<TKey,TValue> class
PostOrderFlatEnumerator<TKey,TValue> class
PreOrderFlatEnumerator<TKey,TValue> class
RedBlackNode<TKey,TValue> class
RedBlackTree<TKey,TValue> class
TraversalEnumerator<TKey,TValue> class
AVLException
AVLException constructor (1 of 2)
AVLException.Balance property
AVLException.Height property
AVLNode 2
AVLNode<TKey,TValue>.Add method
AVLNode<TKey,TValue>.BALANCED field
AVLNode<TKey,TValue>.BALANCED field
See Also
AVLNode<TKey,TValue>.Balance property
AVLNode<TKey,TValue>.Clone method
AVLNode<TKey,TValue>.CloneInstance method
AVLNode<TKey,TValue>.Height property
AVLNode<TKey,TValue>.LEFT_HEAVY field
AVLNode<TKey,TValue>.RIGHT_HEAVY field
AVLNode<TKey,TValue>.Remove method
AVLTree 2
AVLTree<TKey,TValue> constructor
AVLTree<TKey,TValue>.Add method
AVLTree<TKey,TValue>.CloneInstance method
AVLTree<TKey,TValue>.CreateInstance method
AVLTree<TKey,TValue>.Remove method
BSTException
BSTException constructor (1 of 2)
BSTException.CurrentKey property
BSTException.CurrentValue property
BSTException.OtherKey property
BSTException.OtherValue property
BinarySearchTree 2
BinarySearchTree<TKey,TValue>.Add method (1 of 2)
BinarySearchTree<TKey,TValue> constructor
BinarySearchTree<TKey,TValue>.Clear method
BinarySearchTree<TKey,TValue>.Clone method
BinarySearchTree<TKey,TValue>.CloneInstance method
BinarySearchTree<TKey,TValue>.Compare method
BinarySearchTree<TKey,TValue>.Contains method
BinarySearchTree<TKey,TValue>.ContainsKey method
BinarySearchTree<TKey,TValue>.CopyTo method
BinarySearchTree<TKey,TValue>.Count property
BinarySearchTree<TKey,TValue>.CreateInstance method
BinarySearchTree<TKey,TValue>.Empty property
BinarySearchTree<TKey,TValue>.IsFixedSize property
BinarySearchTree<TKey,TValue>.IsReadOnly property
BinarySearchTree<TKey,TValue>.IsSynchronized property
BinarySearchTree<TKey,TValue> indexer
BinarySearchTree<TKey,TValue>.Keys property
BinarySearchTree<TKey,TValue>.Remove method (1 of 2)
BinarySearchTree<TKey,TValue>.Search method
BinarySearchTree<TKey,TValue>.SyncRoot property
BinarySearchTree<TKey,TValue>.TryGetValue method
BinarySearchTree<TKey,TValue>.Values property
FlatEnumerator 2
FlatEnumerator<TKey,TValue>.Current property
FlatEnumerator<TKey,TValue>.Dispose method
FlatEnumerator<TKey,TValue> constructor
FlatEnumerator<TKey,TValue>.Key property
FlatEnumerator<TKey,TValue>.MoveNext method
FlatEnumerator<TKey,TValue>.Reset method
FlatEnumerator<TKey,TValue>.Traverse method
FlatEnumerator<TKey,TValue>.Value property
InOrderFlatEnumerator 2
InOrderFlatEnumerator<TKey,TValue> constructor
InOrderFlatEnumerator<TKey,TValue>.Traverse method
LevelOrderFlatEnumerator 2
LevelOrderFlatEnumerator<TKey,TValue> constructor
LevelOrderFlatEnumerator<TKey,TValue>.Traverse method
Node 2
Node<TKey,TValue>.Clone method
Node<TKey,TValue>.CloneInstance method
Node<TKey,TValue>.Compare method
Node<TKey,TValue>.Key property
Node<TKey,TValue>.LEFT field
Node<TKey,TValue>.Nodes field
Node<TKey,TValue>.Opposite method
Node<TKey,TValue>.RIGHT field
Node<TKey,TValue>.Value property
PostOrderFlatEnumerator 2
PostOrderFlatEnumerator<TKey,TValue> constructor
PostOrderFlatEnumerator<TKey,TValue>.Traverse method
PreOrderFlatEnumerator 2
PreOrderFlatEnumerator<TKey,TValue> constructor
PreOrderFlatEnumerator<TKey,TValue>.Traverse method
RedBlackNode 2
RedBlackNode<TKey,TValue>.Add method
RedBlackNode<TKey,TValue>.Clone method
RedBlackNode<TKey,TValue>.CloneInstance method
RedBlackNode<TKey,TValue>.Height property
RedBlackNode<TKey,TValue>.Remove method
RedBlackTree 2
RedBlackTree<TKey,TValue>.Add method
RedBlackTree<TKey,TValue>.CloneInstance method
RedBlackTree<TKey,TValue>.CreateInstance method
RedBlackTree<TKey,TValue> constructor
RedBlackTree<TKey,TValue>.Remove method
TraversalEnumerator 2
TraversalEnumerator<TKey,TValue>.Current property
TraversalEnumerator<TKey,TValue>.Dispose method
TraversalEnumerator<TKey,TValue>.MoveNext method
TraversalEnumerator<TKey,TValue>.Reset method
TraversalEnumerator<TKey,TValue> constructor
TraversalEnumerator<TKey,TValue>.currentNode field
TheCodingMonkey.Collections.Lists
ForwardEnumerator<T> class
LinkedList<T> class
ListEnumerator<T> class
Node<T> class
ReverseEnumerator<T> class
ForwardEnumerator 1
ForwardEnumerator<T> constructor
ForwardEnumerator<T>.MoveNext method
ForwardEnumerator<T>.MovePrevious method
LinkedList 1
LinkedList<T>.Add method
LinkedList<T>.Clear method
LinkedList<T>.Clone method
LinkedList<T>.Contains method
LinkedList<T>.CopyTo method
LinkedList<T>.Count property
LinkedList<T>.Empty property
LinkedList<T>.GetEnumerator method
LinkedList<T>.Head property
LinkedList<T>.IndexOf method
LinkedList<T>.Insert method (1 of 2)
LinkedList<T>.IsFixedSize property
LinkedList<T>.IsReadOnly property
LinkedList<T>.IsSynchronized property
LinkedList<T> indexer
LinkedList<T> constructor
LinkedList<T>.Remove method (1 of 2)
LinkedList<T>.RemoveAt method (1 of 2)
LinkedList<T>.SyncRoot property
LinkedList<T>.Tail property
ListEnumerator 1
ListEnumerator<T>.Current property
ListEnumerator<T>.CurrentNode property
ListEnumerator<T>.Dispose method
ListEnumerator<T> constructor
ListEnumerator<T>.MoveNext method
ListEnumerator<T>.MovePrevious method
ListEnumerator<T>.Reset method
ListEnumerator<T>.isReset field
ListEnumerator<T>.linkedList field
Node 1
Node<T>.Next property
Node<T>.Previous property
Node<T>.Value property
ReverseEnumerator 1
ReverseEnumerator<T>.MoveNext method
ReverseEnumerator<T>.MovePrevious method
ReverseEnumerator<T> constructor
TheCodingMonkey.Collections.SkipList
Enumerator<TKey,TValue> class
Node<TKey,TValue> class
SkipList<TKey,TValue> class
Enumerator 2
Enumerator<TKey,TValue>.Current property
Enumerator<TKey,TValue>.Dispose method
Enumerator<TKey,TValue> constructor
Enumerator<TKey,TValue>.Key property
Enumerator<TKey,TValue>.MoveNext method
Enumerator<TKey,TValue>.Reset method
Enumerator<TKey,TValue>.Value property
Node 2
Node<TKey,TValue>.DecrementHeight method
Node<TKey,TValue>.Height property
Node<TKey,TValue>.IncrementHeight method
Node<TKey,TValue> indexer
Node<TKey,TValue>.Key property
Node<TKey,TValue>.Value property
SkipList 2
SkipList<TKey,TValue>.Add method (1 of 2)
SkipList<TKey,TValue>.Clear method
SkipList<TKey,TValue>.Clone method
SkipList<TKey,TValue>.Contains method
SkipList<TKey,TValue>.ContainsKey method
SkipList<TKey,TValue>.CopyTo method
SkipList<TKey,TValue>.Count property
SkipList<TKey,TValue>.Empty property
SkipList<TKey,TValue>.GetEnumerator method
SkipList<TKey,TValue>.IsFixedSize property
SkipList<TKey,TValue>.IsReadOnly property
SkipList<TKey,TValue>.IsSynchronized property
SkipList<TKey,TValue> indexer
SkipList<TKey,TValue>.Keys property
SkipList<TKey,TValue>.Remove method (1 of 2)
SkipList<TKey,TValue> constructor (1 of 2)
SkipList<TKey,TValue>.SyncRoot property
SkipList<TKey,TValue>.TryGetValue method
SkipList<TKey,TValue>.Values property
TheCodingMonkey.Collections.Sort
BitonicMergeSort<T> class
BubbleSort<T> class
CombSort<T> class
Direction enumeration
HeapSort<T> class
IInPlaceSort<T> interface
IOutOfPlaceSort<T> interface
InsertionSort<T> class
MergeSort<T> class
OddEvenSort<T> class
QuickSort<T> class
SelectionSort<T> class
ShellSort<T> class
BitonicMergeSort 1
BitonicMergeSort<T> constructor
BitonicMergeSort<T>.Sort method (1 of 2)
BubbleSort 1
BubbleSort<T> constructor
BubbleSort<T>.Sort method
CombSort 1
CombSort<T> constructor
CombSort<T>.Sort method
HeapSort 1
HeapSort<T> constructor
HeapSort<T>.Sort method
IInPlaceSort 1
IInPlaceSort<T>.Sort method
IOutOfPlaceSort 1
IOutOfPlaceSort<T>.Sort method
InsertionSort 1
InsertionSort<T> constructor
InsertionSort<T>.Sort method
MergeSort 1
MergeSort<T> constructor
MergeSort<T>.Sort method
OddEvenSort 1
OddEvenSort<T> constructor
OddEvenSort<T>.Sort method
QuickSort 1
QuickSort<T> constructor
QuickSort<T>.Sort method
SelectionSort 1
SelectionSort<T> constructor
SelectionSort<T>.Sort method
ShellSort 1
ShellSort<T> constructor
ShellSort<T>.Sort method
TheCodingMonkey.Collections Documentation
Docs
»
AVLNode 2 »
TheCodingMonkey.Collections.BST »
Reference »
AVLNode<TKey,TValue>.BALANCED field
AVLNode<TKey,TValue>.BALANCED field
Balance Constant: Tree is balanced.
protected const int BALANCED;
See Also
class
AVLNode<TKey,TValue>
namespace
TheCodingMonkey.Collections.BST
« Previous
Next »