Some smaller changes

Author: LoneWandererProductions

CommonExtendedObjectsTests/Utilities.cs

@@ -283,7 +283,7 @@ public void BinarySearchPerformanceAndCorrectness()
             // Warm-up to avoid JIT bias
             for (int i = 0; i < 10_000; i++)
             {
-                Utility.BinarySearch(keysSpan, N, i * 2);
+                Utility.BinarySearch(keysSpan, i * 2);
             }
 
             var sw = Stopwatch.StartNew();
@@ -292,7 +292,7 @@ public void BinarySearchPerformanceAndCorrectness()
             for (int i = 0; i < N; i++)
             {
                 int val = i * 2;
-                int idx = Utility.BinarySearch(keysSpan, N, val);
+                int idx = Utility.BinarySearch(keysSpan, val);
 
                 Assert.IsTrue(idx >= 0, $"Key {val} should be found.");
                 Assert.AreEqual(val, sortedKeys[idx]);
@@ -321,7 +321,7 @@ public void CompareCustomVsArrayBinarySearch_Performance()
             // Warm-up both methods
             for (int i = 0; i < 10_000; i++)
             {
-                Utility.BinarySearch(keysSpan, N, i * 2);
+                Utility.BinarySearch(keysSpan, i * 2);
                 Array.BinarySearch(sortedKeys, i * 2);
             }
 

ExtendedSystemObjects/Utility.cs

@@ -88,21 +88,37 @@ public static long GetFirstAvailableIndex(List<long> lst)
         }
 
         /// <summary>
-        /// Binary search of an int element.
+        /// Performs binary search on a sorted span of integers.
         /// </summary>
-        /// <param name="sortedKeys">The sorted keys.</param>
-        /// <param name="count">The count.</param>
-        /// <param name="target">The target.</param>
-        /// <returns>Index of the element</returns>
+        /// <param name="sortedKeys">The sorted span of integers.</param>
+        /// <param name="target">The value to search for.</param>
+        /// <returns>
+        /// Index of the element if found; otherwise, the bitwise complement of the insertion index.
+        /// </returns>
         [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        public static int BinarySearch(ReadOnlySpan<int> sortedKeys, int count, int target)
+        public static int BinarySearch(ReadOnlySpan<int> sortedKeys, int target)
+        {
+            return BinarySearch(sortedKeys, sortedKeys.Length, target);
+        }
+
+        /// <summary>
+        /// Internal binary search method using a specified count of elements.
+        /// </summary>
+        /// <param name="sortedKeys">The sorted span of integers.</param>
+        /// <param name="count">The number of elements to consider from the start of the span.</param>
+        /// <param name="target">The value to search for.</param>
+        /// <returns>
+        /// Index of the element if found; otherwise, the bitwise complement of the insertion index.
+        /// </returns>
+        [MethodImpl(MethodImplOptions.AggressiveInlining)]
+        internal static int BinarySearch(ReadOnlySpan<int> sortedKeys, int count, int target)
         {
             int left = 0, right = count - 1;
 
             while (left <= right)
             {
-                var mid = left + ((right - left) >> 1);
-                var midKey = sortedKeys[mid];
+                int mid = left + ((right - left) >> 1);
+                int midKey = sortedKeys[mid];
 
                 if (midKey == target)
                     return mid;