docs & range tree duplicate point support

Author: justcoding121

Advanced.Algorithms.Tests/DataStructures/Tree/RangeTreeTests.cs

@@ -19,17 +19,21 @@ public void RangeTree1D_Smoke_Test()
             tree.Insert(new int[] { 2 });
             tree.Insert(new int[] { 3 });
             tree.Insert(new int[] { 4 });
+            tree.Insert(new int[] { 4 });
             tree.Insert(new int[] { 5 });
             tree.Insert(new int[] { 6 });
             tree.Insert(new int[] { 7 });
 
             var rangeResult = tree.GetInRange(new int[] { 2 }, new int[] { 6 });
-            Assert.IsTrue(rangeResult.Count == 5);
+            Assert.IsTrue(rangeResult.Count == 6);
 
             tree.Delete(new int[] { 4 });
             rangeResult = tree.GetInRange(new int[] { 2 }, new int[] { 6 });
-            Assert.IsTrue(rangeResult.Count == 4);
+            Assert.IsTrue(rangeResult.Count == 5);
 
+            tree.Delete(new int[] { 4 });
+            rangeResult = tree.GetInRange(new int[] { -1 }, new int[] { 6 });
+            Assert.IsTrue(rangeResult.Count == 6);
 
             tree.Delete(new int[] { 0 });
             tree.Delete(new int[] { 1 });
@@ -51,6 +55,7 @@ public void RangeTree2D_Smoke_Test()
             tree.Insert(new int[] { 2, 5 });
             tree.Insert(new int[] { 3, 6 });
             tree.Insert(new int[] { 4, 5 });
+            tree.Insert(new int[] { 4, 7 });
             tree.Insert(new int[] { 5, 8 });
             tree.Insert(new int[] { 6, 9 });
             tree.Insert(new int[] { 7, 10 });
@@ -69,9 +74,12 @@ public void RangeTree2D_Smoke_Test()
             tree.Delete(new int[] { 0, 1 });
             tree.Delete(new int[] { 1, 1 });
             tree.Delete(new int[] { 4, 5 });
+            tree.Delete(new int[] { 4, 7 });
             tree.Delete(new int[] { 5, 8 });
             tree.Delete(new int[] { 6, 9 });
             tree.Delete(new int[] { 7, 10 });
+
+
         }
     }
-}
+}

Advanced.Algorithms/Advanced.Algorithms.Docs.csproj

@@ -64,7 +64,7 @@
     <Compile Include="DataStructures\Dictionary\Dictionary.cs" />
     <Compile Include="DataStructures\Dictionary\OpenAddressDictionary.cs" />
     <Compile Include="DataStructures\Dictionary\SeparateChainingDictionary.cs" />
-    <Compile Include="DataStructures\Dictionary\TreeDictionary.cs" />
+    <Compile Include="DataStructures\Dictionary\SortedDictionary.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyList\DiGraph.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyList\Graph.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyList\WeightedDiGraph.cs" />
@@ -76,7 +76,7 @@
     <Compile Include="DataStructures\HashSet\HashSet.cs" />
     <Compile Include="DataStructures\HashSet\OpenAddressHashSet.cs" />
     <Compile Include="DataStructures\HashSet\SeparateChainingHashSet.cs" />
-    <Compile Include="DataStructures\HashSet\TreeHashSet.cs" />
+    <Compile Include="DataStructures\HashSet\SortedHashSet.cs" />
     <Compile Include="DataStructures\Heap\BinomialHeapNode.cs" />
     <Compile Include="DataStructures\Heap\FibornacciHeapNode.cs" />
     <Compile Include="DataStructures\Heap\Max\BinomialMaxHeap.cs" />

Advanced.Algorithms/DataStructures/Tree/RangeTree.cs

@@ -1,4 +1,5 @@
 using System;
+using System.Linq;
 using System.Collections.Generic;
 
 namespace Advanced.Algorithms.DataStructures
@@ -9,18 +10,20 @@ namespace Advanced.Algorithms.DataStructures
     /// <typeparam name="T"></typeparam>
     internal class RangeTreeNode<T> : IComparable where T : IComparable
     {
-        internal T Data { get; set; }
+        internal T Value => Values[0];
+
+        internal List<T> Values { get; set; }
 
         internal RangeTree<T> tree { get; set; }
 
         public int CompareTo(object obj)
         {
-            return Data.CompareTo(((RangeTreeNode<T>)obj).Data);
+            return Value.CompareTo(((RangeTreeNode<T>)obj).Value);
         }
 
         public RangeTreeNode(T value)
         {
-            Data = value;
+            Values = new List<T>(new T[] { value });
             tree = new RangeTree<T>();
         }
     }
@@ -142,10 +145,10 @@ private List<T[]> getInRange(
             {
                 var result = new List<T[]>();
 
-                foreach (var node in nodes)
+                foreach (var value in nodes.SelectMany(x => x.Values))
                 {
                     var thisDimResult = new T[dimensions];
-                    thisDimResult[dimension] = node.Data;
+                    thisDimResult[dimension] = value;
                     result.Add(thisDimResult);
                 }
 
@@ -159,10 +162,13 @@ private List<T[]> getInRange(
                 {
                     var nextDimResult = getInRange(node.tree, start, end, dimension + 1);
 
-                    foreach (var nextResult in nextDimResult)
+                    foreach (var value in node.Values)
                     {
-                        nextResult[dimension] = node.Data;
-                        result.Add(nextResult);
+                        foreach (var nextResult in nextDimResult)
+                        {
+                            nextResult[dimension] = value;
+                            result.Add(nextResult);
+                        }
                     }
                 }
 
@@ -215,13 +221,31 @@ public RangeTreeNode<T> Find(T value)
         internal RangeTreeNode<T> Insert(T value)
         {
             var newNode = new RangeTreeNode<T>(value);
+
+            var existing = tree.FindNode(newNode);
+            if (existing != null)
+            {
+                existing.Value.Values.Add(value);
+                return existing.Value;
+            }
+
             tree.Insert(newNode);
             return newNode;
         }
 
         internal void Delete(T value)
         {
-            tree.Delete(new RangeTreeNode<T>(value));
+            var existing = tree.FindNode(new RangeTreeNode<T>(value));
+
+            if (existing.Value.Values.Count == 1)
+            {
+                tree.Delete(new RangeTreeNode<T>(value));
+                return;
+            }
+
+            //remove last
+            existing.Value.Values.RemoveAt(existing.Value.Values.Count - 1);
+
         }
 
         internal List<RangeTreeNode<T>> GetInRange(T start, T end)
@@ -251,7 +275,7 @@ private List<RangeTreeNode<T>> getInRange(List<RangeTreeNode<T>> result, System.
             //move left
             else
             {
-                if (start.CompareTo(currentNode.Value.Data) <= 0)
+                if (start.CompareTo(currentNode.Value.Value) <= 0)
                 {
                     if (currentNode.Left != null)
                     {
@@ -269,7 +293,7 @@ private List<RangeTreeNode<T>> getInRange(List<RangeTreeNode<T>> result, System.
                 //if start is greater than current
                 //and end is greater than current
                 //move right
-                if (end.CompareTo(currentNode.Value.Data) < 0)
+                if (end.CompareTo(currentNode.Value.Value) < 0)
                 {
                     return result;
                 }
@@ -304,8 +328,8 @@ private List<RangeTreeNode<T>> getInRange(List<RangeTreeNode<T>> result, System.
         private bool inRange(RedBlackTreeNode<RangeTreeNode<T>> currentNode, T start, T end)
         {
             //start is less than current & end is greater than current
-            return start.CompareTo(currentNode.Value.Data) <= 0
-                && end.CompareTo(currentNode.Value.Data) >= 0;
+            return start.CompareTo(currentNode.Value.Value) <= 0
+                && end.CompareTo(currentNode.Value.Value) >= 0;
         }
     }
 }