ShuriZma
/
BizHawk
mirror of https://github.com/TASEmulators/BizHawk.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix BinarySearch test failures

This commit is contained in:
Morilli 2024-03-29 18:56:56 +01:00
parent af9d337900
commit 6d06dcd5d2
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/BizHawk.Common/Extensions/CollectionExtensions.cs
View File

@ -28,12 +28,13 @@ namespace BizHawk.Common.CollectionExtensions
public static int LowerBoundBinarySearch<T, TKey>(this IList<T> list, Func<T, TKey> keySelector, TKey key) public static int LowerBoundBinarySearch<T, TKey>(this IList<T> list, Func<T, TKey> keySelector, TKey key)
where TKey : IComparable<TKey> where TKey : IComparable<TKey>
{ {
if (list.Count is 0) return -1;
int min = 0; int min = 0;
int max = list.Count - 1; int max = list.Count - 1;
int mid;
while (min < max) while (min < max)
{ {
mid = (max + min) / 2; int mid = (max + min) / 2;
T midItem = list[mid]; T midItem = list[mid];
var midKey = keySelector(midItem); var midKey = keySelector(midItem);
int comp = midKey.CompareTo(key); int comp = midKey.CompareTo(key);
@ -69,7 +70,7 @@ namespace BizHawk.Common.CollectionExtensions
where TKey : IComparable<TKey> where TKey : IComparable<TKey>
{ {
int min = 0; int min = 0;
int max = list.Count; int max = list.Count - 1;
while (min < max) while (min < max)
{ {
int mid = (max + min) / 2; int mid = (max + min) / 2;