public SortedHashSet()
 {
     binarySearchTree = new RedBlackTree <T>();
 }
Beispiel #2
0
 public SortedDictionary()
 {
     binarySearchTree = new RedBlackTree <SortedDictionaryNode <K, V> >();
 }
Beispiel #3
0
 public void Dispose()
 {
     bst        = null;
     enumerator = null;
 }
Beispiel #4
0
 internal SortedDictionaryEnumerator(RedBlackTree <SortedDictionaryNode <K, V> > bst)
 {
     this.bst        = bst;
     this.enumerator = bst.GetEnumerator();
 }