enumerable support

Author: justcoding121

Advanced.Algorithms.Tests/Advanced.Algorithms.Tests.csproj

@@ -64,7 +64,7 @@
     <Compile Include="Combinatorics\Permutation_Tests.cs" />
     <Compile Include="Compression\HuffmanCoding_Tests.cs" />
     <Compile Include="DataStructures\Dictionary\Dictionary_Tests.cs" />
-    <Compile Include="DataStructures\Dictionary\TreeDictionary_Tests.cs" />
+    <Compile Include="DataStructures\Dictionary\SortedDictionary_Tests.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyMatrix\DiGraph_Tests.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyMatrix\Graph_Tests.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyMatrix\WeightedDiGraph_Tests.cs" />
@@ -74,7 +74,7 @@
     <Compile Include="DataStructures\Graph\AdjacencyList\WeightedDiGraph_Tests.cs" />
     <Compile Include="DataStructures\Graph\AdjacencyList\WeightedGraph_Tests.cs" />
     <Compile Include="DataStructures\HashSet\HashSet_Tests.cs" />
-    <Compile Include="DataStructures\HashSet\TreeHashSet_Tests.cs" />
+    <Compile Include="DataStructures\HashSet\SortedHashSet_Tests.cs" />
     <Compile Include="DataStructures\Heap\Max\BinomialMaxHeap_Tests.cs" />
     <Compile Include="DataStructures\Heap\Max\BMaxHeap_Tests.cs" />
     <Compile Include="DataStructures\Heap\Max\D-aryMaxHeap_Tests.cs" />

Advanced.Algorithms.Tests/DataStructures/Dictionary/Dictionary_Tests.cs

@@ -14,92 +14,108 @@ public class Dictionary_Tests
         [TestMethod]
         public void Dictionary_SeparateChaining_Test()
         {
-            var Dictionary = new Dictionary<int, int>(DictionaryType.SeparateChaining);
+            var dictionary = new Dictionary<int, int>(DictionaryType.SeparateChaining);
             int nodeCount = 1000 * 10;
+          
             //insert test
-
-
             for (int i = 0; i <= nodeCount; i++)
             {
-                Dictionary.Add(i, i);
-                Assert.AreEqual(true, Dictionary.ContainsKey(i));
+                dictionary.Add(i, i);
+                Assert.AreEqual(true, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
 
             for (int i = 0; i <= nodeCount; i++)
             {
-                Dictionary.Remove(i);
-                Assert.AreEqual(false, Dictionary.ContainsKey(i));
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
 
             var rnd = new Random();
             var testSeries = Enumerable.Range(1, nodeCount).OrderBy(x => rnd.Next()).ToList();
 
-            
             foreach (var item in testSeries)
             {
-                Dictionary.Add(item, item);
-                Assert.AreEqual(true, Dictionary.ContainsKey(item));
+                dictionary.Add(item, item);
+                Assert.AreEqual(true, dictionary.ContainsKey(item));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
             foreach (var item in testSeries)
             {
-                Assert.AreEqual(true, Dictionary.ContainsKey(item));
+                Assert.AreEqual(true, dictionary.ContainsKey(item));
             }
 
             for (int i = 1; i <= nodeCount; i++)
             {
-                Dictionary.Remove(i);
-                Assert.AreEqual(false, Dictionary.ContainsKey(i));
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
         }
 
 
         [TestMethod]
         public void Dictionary_OpenAddressing_Test()
         {
-            var Dictionary = new Dictionary<int, int>(DictionaryType.OpenAddressing);
+            var dictionary = new Dictionary<int, int>(DictionaryType.OpenAddressing);
             int nodeCount = 1000 * 10;
+          
             //insert test
-
-
             for (int i = 0; i <= nodeCount; i++)
             {
-                Dictionary.Add(i, i);
-                Assert.AreEqual(true, Dictionary.ContainsKey(i));
+                dictionary.Add(i, i);
+                Assert.AreEqual(true, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
 
             for (int i = 0; i <= nodeCount; i++)
             {
-                Dictionary.Remove(i);
-                Assert.AreEqual(false, Dictionary.ContainsKey(i));
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
 
             var rnd = new Random();
             var testSeries = Enumerable.Range(1, nodeCount).OrderBy(x => rnd.Next()).ToList();
 
-
             foreach (var item in testSeries)
             {
-                Dictionary.Add(item, item);
-                Assert.AreEqual(true, Dictionary.ContainsKey(item));
+                dictionary.Add(item, item);
+                Assert.AreEqual(true, dictionary.ContainsKey(item));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
             foreach (var item in testSeries)
             {
-                Assert.AreEqual(true, Dictionary.ContainsKey(item));
+                Assert.AreEqual(true, dictionary.ContainsKey(item));
             }
 
             for (int i = 1; i <= nodeCount; i++)
             {
-                Dictionary.Remove(i);
-                Assert.AreEqual(false, Dictionary.ContainsKey(i));
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
             }
 
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
         }
     }
 }

Advanced.Algorithms.Tests/DataStructures/Dictionary/SortedDictionary_Tests.cs

@@ -0,0 +1,62 @@
+using Advanced.Algorithms.DataStructures;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+using System;
+using System.Linq;
+
+namespace Advanced.Algorithms.Tests.DataStructures
+{
+    [TestClass]
+    public class SortedDictionary_Tests
+    {
+        /// <summary>
+        /// key value dictionary tests 
+        /// </summary>
+        [TestMethod]
+        public void SortedDictionary_Test()
+        {
+            var dictionary = new SortedDictionary<int, int>();
+
+            int nodeCount = 1000;
+
+            //insert test
+            for (int i = 0; i <= nodeCount; i++)
+            {
+                dictionary.Add(i, i);
+                Assert.AreEqual(true, dictionary.ContainsKey(i));
+            }
+
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
+            for (int i = 0; i <= nodeCount; i++)
+            {
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
+            }
+
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
+            var rnd = new Random();
+            var testSeries = Enumerable.Range(1, nodeCount).OrderBy(x => rnd.Next()).ToList();
+
+            foreach (var item in testSeries)
+            {
+                dictionary.Add(item, item);
+                Assert.AreEqual(true, dictionary.ContainsKey(item));
+            }
+
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+
+            for (int i = 1; i <= nodeCount; i++)
+            {
+                dictionary.Remove(i);
+                Assert.AreEqual(false, dictionary.ContainsKey(i));
+            }
+
+            //IEnumerable test using linq
+            Assert.AreEqual(dictionary.Count, dictionary.Count());
+        }
+    }
+}