add a test

Author: LoneWandererProductions

CommonExtendedObjectsTests/SortedKvStoreTests.cs

@@ -28,10 +28,6 @@ public class SortedKvStoreTests
         /// </summary>
         private const int ItemCount = 100_000;
 
-        private SortedKvStore _store;
-
-        private int _entryCount;
-
         /// <summary>
         ///     Adds the and try get works.
         /// </summary>
@@ -477,32 +473,28 @@ public void RemoveAndCompactTest()
             Assert.IsTrue(store.ContainsKey(9));
         }
 
-        public void TestCase()
+        /// <summary>
+        /// Removes the and compact test.
+        /// </summary>
+        [TestMethod]
+        public void BinarySearch()
         {
-            const int size = 1024;
-            var count = 10;
+            var store = new SortedKvStore(128);
 
+            for (int i = 0; i < 10; i++)
+            {
+                store.Add(i, i);
+            }
 
-            _store = new SortedKvStore(128);
-
-            for (var cycle = 0; cycle < 5; cycle++)
+            for (int i = 5; i < 10; i++)
             {
-                var handles = new List<int>(count);
-                for (var i = 0; i < count; i++)
-                    handles[i] = Allocate(size);
-                for (var i = 0; i < count; i++)
-                    Free(handles[i]);
+                store.Remove(i);
             }
-        }
 
-        private void Free(int memoryHandle)
-        {
-            //_store[id] = _entryCount; 
-        }
+            Trace.WriteLine(store.ToString());
+            var position = store.BinarySearch(9);
 
-        private int Allocate(int size)
-        {
-            return 1;
+            Assert.AreEqual(9, position, "Wrong position.");
         }
     }
 }

ExtendedSystemObjects/SortedKvStore.cs

@@ -385,6 +385,18 @@ public void Compact()
             ArrayPool<int>.Shared.Return(rented);
         }
 
+        /// <summary>
+        ///     Performs a binary search for the specified key.
+        /// </summary>
+        /// <param name="key">The key to locate.</param>
+        /// <returns>
+        ///     The index of the key if found; otherwise, the bitwise complement of the index at which the key should be inserted.
+        /// </returns>
+        public int BinarySearch(int key)
+        {
+            return Utility.BinarySearch(_keys.AsSpan(), Count, key);
+        }
+
         /// <summary>
         ///     Removes all entries from the store.
         /// </summary>
@@ -433,17 +445,5 @@ private void EnsureCapacity()
             _values.EnsureCapacity(Count + 1);
             _occupied.EnsureCapacity(Count + 1);
         }
-
-        /// <summary>
-        ///     Performs a binary search for the specified key.
-        /// </summary>
-        /// <param name="key">The key to locate.</param>
-        /// <returns>
-        ///     The index of the key if found; otherwise, the bitwise complement of the index at which the key should be inserted.
-        /// </returns>
-        private int BinarySearch(int key)
-        {
-            return Utility.BinarySearch(_keys.AsSpan(), Count, key);
-        }
     }
 }