public void BinarySearch_FromLowest()
{
var list = TypicalSortedList();
var result = ListExt.BinarySearch(list, TOO_LOW);
Assert.Equal(~0, result);
}
public void BinarySearch_None()
{
var list = TypicalSortedList();
var result = ListExt.BinarySearch(list, TOO_HIGH);
Assert.Equal(~3, result);
}
public void BinarySearch_Equal()
{
var list = TypicalSortedList();
var result = ListExt.BinarySearch(list, MEDIUM);
Assert.Equal(1, result);
}
public void BinarySearch_Typical()
{
var list = TypicalSortedList();
var result = ListExt.BinarySearch(list, TYPICAL_NOT_EXISTS);
Assert.Equal(~2, result);
}
public void BinarySearch_EqualWithOne()
{
var list = new List <int>()
{
MEDIUM
};
var result = ListExt.BinarySearch(list, MEDIUM);
Assert.Equal(0, result);
}
private int GetBlockIndex(int charIndex)
{
int i = ListExt.BinarySearch((IList <Pair <int, uint> >) _blkOffsets,
new Pair <int, uint>(charIndex, 0),
delegate(Pair <int, uint> a, Pair <int, uint> b) { return(a.A.CompareTo(b.A)); });
if (i < 0)
{
i = ~i - 1;
}
return(i);
}
