enable node lookup

justcoding121 · justcoding121 · commit ab0119e94f6d · 2018-10-29T18:20:53.000-04:00
diff --git a/src/Advanced.Algorithms/DataStructures/Dictionary/OrderedDictionary.cs b/src/Advanced.Algorithms/DataStructures/Dictionary/OrderedDictionary.cs
@@ -20,7 +20,7 @@ public class OrderedDictionary<K, V> : IEnumerable<KeyValuePair<K, V>> where K :
 
         public OrderedDictionary()
         {
-            binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>();
+            binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>(true);
         }
 
         /// <summary>
@@ -215,6 +215,11 @@ internal OrderedKeyValuePair(K key, V value)
             this.Value = value;
         }
 
+        public KeyValuePair<K, V> ToKeyValuePair()
+        {
+            return new KeyValuePair<K, V>(Key, Value);
+        }
+
         public int CompareTo(object obj)
         {
             if (obj is OrderedKeyValuePair<K, V> itemToComare)
@@ -225,10 +230,16 @@ public int CompareTo(object obj)
             throw new ArgumentException("Compare object is nu");
         }
 
-        public KeyValuePair<K, V> ToKeyValuePair()
+        public override bool Equals(object obj)
         {
-            return new KeyValuePair<K, V>(Key, Value);
+            return Key.Equals(((OrderedKeyValuePair<K, V>)obj).Key);
         }
+
+        public override int GetHashCode()
+        {
+            return Key.GetHashCode();
+        }
+
     }
 
     internal class SortedDictionaryEnumerator<K, V> : IEnumerator<KeyValuePair<K, V>> where K : IComparable
diff --git a/src/Advanced.Algorithms/DataStructures/HashSet/OrderedHashSet.cs b/src/Advanced.Algorithms/DataStructures/HashSet/OrderedHashSet.cs
@@ -18,7 +18,7 @@ public class OrderedHashSet<T> : IEnumerable<T> where T : IComparable
 
         public OrderedHashSet()
         {
-            binarySearchTree = new RedBlackTree<T>();
+            binarySearchTree = new RedBlackTree<T>(true);
         }
 
         /// <summary>

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@ public class OrderedDictionary<K, V> : IEnumerable<KeyValuePair<K, V>> where K :`
`20`	`20`
`21`	`21`	`public OrderedDictionary()`
`22`	`22`	`{`
`23`		`- binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>();`
	`23`	`+ binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>(true);`
`24`	`24`	`}`
`25`	`25`
`26`	`26`	`/// <summary>`
`@@ -215,6 +215,11 @@ internal OrderedKeyValuePair(K key, V value)`
`215`	`215`	`this.Value = value;`
`216`	`216`	`}`
`217`	`217`
	`218`	`+ public KeyValuePair<K, V> ToKeyValuePair()`
	`219`	`+ {`
	`220`	`+ return new KeyValuePair<K, V>(Key, Value);`
	`221`	`+ }`
	`222`	`+`
`218`	`223`	`public int CompareTo(object obj)`
`219`	`224`	`{`
`220`	`225`	`if (obj is OrderedKeyValuePair<K, V> itemToComare)`
`@@ -225,10 +230,16 @@ public int CompareTo(object obj)`
`225`	`230`	`throw new ArgumentException("Compare object is nu");`
`226`	`231`	`}`
`227`	`232`
`228`		`- public KeyValuePair<K, V> ToKeyValuePair()`
	`233`	`+ public override bool Equals(object obj)`
`229`	`234`	`{`
`230`		`- return new KeyValuePair<K, V>(Key, Value);`
	`235`	`+ return Key.Equals(((OrderedKeyValuePair<K, V>)obj).Key);`
`231`	`236`	`}`
	`237`	`+`
	`238`	`+ public override int GetHashCode()`
	`239`	`+ {`
	`240`	`+ return Key.GetHashCode();`
	`241`	`+ }`
	`242`	`+`
`232`	`243`	`}`
`233`	`244`
`234`	`245`	`internal class SortedDictionaryEnumerator<K, V> : IEnumerator<KeyValuePair<K, V>> where K : IComparable`
Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ public class OrderedHashSet<T> : IEnumerable<T> where T : IComparable`
`18`	`18`
`19`	`19`	`public OrderedHashSet()`
`20`	`20`	`{`
`21`		`- binarySearchTree = new RedBlackTree<T>();`
	`21`	`+ binarySearchTree = new RedBlackTree<T>(true);`
`22`	`22`	`}`
`23`	`23`
`24`	`24`	`/// <summary>`