last format today

Author: LoneWandererProductions

CommonExtendedObjectsTests/SortedKvStoreTests.cs

@@ -13,18 +13,18 @@
 namespace CommonExtendedObjectsTests
 {
     /// <summary>
-    /// Test my Key Value class
+    ///     Test my Key Value class
     /// </summary>
     [TestClass]
     public class SortedKvStoreTests
     {
         /// <summary>
-        /// The item count
+        ///     The item count
         /// </summary>
         private const int ItemCount = 100_000;
 
         /// <summary>
-        /// Adds the and try get works.
+        ///     Adds the and try get works.
         /// </summary>
         [TestMethod]
         public void AddAndTryGetWorks()
@@ -47,7 +47,7 @@ public void AddAndTryGetWorks()
         }
 
         /// <summary>
-        /// Tries the remove removes existing.
+        ///     Tries the remove removes existing.
         /// </summary>
         [TestMethod]
         public void TryRemoveRemovesExisting()
@@ -62,16 +62,18 @@ public void TryRemoveRemovesExisting()
         }
 
         /// <summary>
-        /// Removes the many works.
+        ///     Removes the many works.
         /// </summary>
         [TestMethod]
         public void RemoveManyWorks()
         {
             var store = new SortedKvStore();
             for (var i = 0; i < 10; i++)
+            {
                 store.Add(i, i * 10);
+            }
 
-            store.RemoveMany(new int[] { 2, 4, 6 });
+            store.RemoveMany(new[] { 2, 4, 6 });
 
             Assert.IsFalse(store.TryGet(2, out _));
             Assert.IsFalse(store.TryGet(4, out _));
@@ -81,14 +83,16 @@ public void RemoveManyWorks()
         }
 
         /// <summary>
-        /// Compacts the removes unoccupied.
+        ///     Compacts the removes unoccupied.
         /// </summary>
         [TestMethod]
         public void CompactRemovesUnoccupied()
         {
             var store = new SortedKvStore();
             for (var i = 0; i < 10; i++)
+            {
                 store.Add(i, i * 10);
+            }
 
             store.Remove(1);
             store.Remove(3);
@@ -99,7 +103,7 @@ public void CompactRemovesUnoccupied()
         }
 
         /// <summary>
-        /// Indexers the works.
+        ///     Indexers the works.
         /// </summary>
         [TestMethod]
         public void IndexerWorks()
@@ -113,17 +117,19 @@ public void IndexerWorks()
         }
 
         /// <summary>
-        /// Adds the and try get should return expected values.
+        ///     Adds the and try get should return expected values.
         /// </summary>
         [TestMethod]
         public void AddAndTryGetShouldReturnExpectedValues()
         {
             var store = new SortedKvStore();
 
-            for (int i = 0; i < 1000; i++)
+            for (var i = 0; i < 1000; i++)
+            {
                 store.Add(i, i * 10);
+            }
 
-            for (int i = 0; i < 1000; i++)
+            for (var i = 0; i < 1000; i++)
             {
                 Assert.IsTrue(store.TryGet(i, out var value));
                 Assert.AreEqual(i * 10, value);
@@ -133,7 +139,7 @@ public void AddAndTryGetShouldReturnExpectedValues()
         }
 
         /// <summary>
-        /// Performances the add and try get.
+        ///     Performances the add and try get.
         /// </summary>
         [TestMethod]
         public void PerformanceAddAndTryGet()
@@ -142,19 +148,23 @@ public void PerformanceAddAndTryGet()
 
             var sw = Stopwatch.StartNew();
 
-            for (int i = 0; i < ItemCount; i++)
+            for (var i = 0; i < ItemCount; i++)
+            {
                 store.Add(i, i * 2);
+            }
 
             sw.Stop();
             Trace.WriteLine($"Add {ItemCount} items: {sw.ElapsedMilliseconds} ms");
 
             sw.Restart();
 
-            int hits = 0;
-            for (int i = 0; i < ItemCount; i++)
+            var hits = 0;
+            for (var i = 0; i < ItemCount; i++)
             {
                 if (store.TryGet(i, out var value) && value == i * 2)
+                {
                     hits++;
+                }
             }
 
             sw.Stop();
@@ -164,19 +174,23 @@ public void PerformanceAddAndTryGet()
         }
 
         /// <summary>
-        /// Performances the remove compact.
+        ///     Performances the remove compact.
         /// </summary>
         [TestMethod]
         public void PerformanceRemoveCompact()
         {
             var store = new SortedKvStore(ItemCount);
 
-            for (int i = 0; i < ItemCount; i++)
+            for (var i = 0; i < ItemCount; i++)
+            {
                 store.Add(i, i);
+            }
 
             // Remove half of them
-            for (int i = 0; i < ItemCount; i += 2)
+            for (var i = 0; i < ItemCount; i += 2)
+            {
                 store.Remove(i);
+            }
 
             var sw = Stopwatch.StartNew();
             store.Compact();

CommonExtendedObjectsTests/Utilities.cs

@@ -268,31 +268,33 @@ public void FindSequencesShouldReturnCorrectResultWhenListHasMixedSequences()
         }
 
         /// <summary>
-        /// Binaries the search performance and correctness.
+        ///     Binaries the search performance and correctness.
         /// </summary>
         [TestMethod]
         public void BinarySearchPerformanceAndCorrectness()
         {
             const int N = 1_000_000;
-            int[] sortedKeys = new int[N];
-            for (int i = 0; i < N; i++)
+            var sortedKeys = new int[N];
+            for (var i = 0; i < N; i++)
+            {
                 sortedKeys[i] = i * 2; // even numbers sorted
+            }
 
             var keysSpan = sortedKeys.AsSpan();
 
             // Warm-up to avoid JIT bias
-            for (int i = 0; i < 10_000; i++)
+            for (var i = 0; i < 10_000; i++)
             {
                 Utility.BinarySearch(keysSpan, i * 2);
             }
 
             var sw = Stopwatch.StartNew();
 
-            int foundCount = 0;
-            for (int i = 0; i < N; i++)
+            var foundCount = 0;
+            for (var i = 0; i < N; i++)
             {
-                int val = i * 2;
-                int idx = Utility.BinarySearch(keysSpan, val);
+                var val = i * 2;
+                var idx = Utility.BinarySearch(keysSpan, val);
 
                 Assert.IsTrue(idx >= 0, $"Key {val} should be found.");
                 Assert.AreEqual(val, sortedKeys[idx]);
@@ -312,37 +314,41 @@ public void BinarySearchPerformanceAndCorrectness()
         public void CompareCustomVsArrayBinarySearch_Performance()
         {
             const int N = 1_000_000;
-            int[] sortedKeys = new int[N];
-            for (int i = 0; i < N; i++)
+            var sortedKeys = new int[N];
+            for (var i = 0; i < N; i++)
+            {
                 sortedKeys[i] = i * 2; // even numbers sorted
+            }
 
             var keysSpan = sortedKeys.AsSpan();
 
             // Warm-up both methods
-            for (int i = 0; i < 10_000; i++)
+            for (var i = 0; i < 10_000; i++)
             {
                 Utility.BinarySearch(keysSpan, i * 2);
                 Array.BinarySearch(sortedKeys, i * 2);
             }
 
             // Custom BinarySearch benchmark
             var swCustom = Stopwatch.StartNew();
-            for (int i = 0; i < N; i++)
+            for (var i = 0; i < N; i++)
             {
-                int val = i * 2;
-                int idx = Utility.BinarySearch(keysSpan, N, val);
+                var val = i * 2;
+                var idx = Utility.BinarySearch(keysSpan, N, val);
                 Assert.IsTrue(idx >= 0);
             }
+
             swCustom.Stop();
 
             // Array.BinarySearch benchmark
             var swArray = Stopwatch.StartNew();
-            for (int i = 0; i < N; i++)
+            for (var i = 0; i < N; i++)
             {
-                int val = i * 2;
-                int idx = Array.BinarySearch(sortedKeys, val);
+                var val = i * 2;
+                var idx = Array.BinarySearch(sortedKeys, val);
                 Assert.IsTrue(idx >= 0);
             }
+
             swArray.Stop();
 
             Trace.WriteLine($"Custom BinarySearch: {swCustom.ElapsedMilliseconds} ms");
@@ -352,6 +358,5 @@ public void CompareCustomVsArrayBinarySearch_Performance()
             Assert.IsTrue(swCustom.ElapsedMilliseconds < swArray.ElapsedMilliseconds * 2,
                 $"Custom BinarySearch is too slow: {swCustom.ElapsedMilliseconds} ms vs {swArray.ElapsedMilliseconds} ms");
         }
-
     }
 }

ExtendedSystemObjects/CategorizedDictionary.cs

@@ -126,7 +126,8 @@ public IEnumerable<TK> GetKeys()
             _lock.EnterReadLock();
             try
             {
-                return _data.Keys.ToList(); ; ; // Create a copy for thread safety
+                return _data.Keys.ToList();
+                // Create a copy for thread safety
             }
             finally
             {
@@ -164,7 +165,7 @@ public void Add(TK key, TV value)
         }
 
         /// <summary>
-        /// Removes the specified key.
+        ///     Removes the specified key.
         /// </summary>
         /// <param name="key">The key.</param>
         /// <returns>If item was removed</returns>
@@ -351,7 +352,7 @@ public List<KeyValuePair<TK, TV>> ToKeyValueList()
         }
 
         /// <summary>
-        /// Clears this instance.
+        ///     Clears this instance.
         /// </summary>
         public void Clear()
         {
@@ -472,7 +473,7 @@ public override int GetHashCode()
         }
 
         /// <summary>
-        /// Adds the internal.
+        ///     Adds the internal.
         /// </summary>
         /// <param name="category">The category.</param>
         /// <param name="key">The key.</param>
@@ -487,6 +488,5 @@ private void AddInternal(string category, TK key, TV value)
 
             _data[key] = (category, value);
         }
-
     }
 }