public static int BinarySearchCat <T>(IList <T> list, T targetValue, int leftIndex, int rightIndex,
IndexOccurType indexOccurType = IndexOccurType.Any_Index,
IList <Comparison <T> > compareRules = null)
{
int resultIndex = -1;
ListSortedType listSortedType = list.GetListSortedType(compareRules);
while (leftIndex <= rightIndex)
{
int middleIndex = (leftIndex + rightIndex) / 2;
T middleValue = list[middleIndex];
int compareResult = CompareUtil.CompareWithRules(targetValue, middleValue, compareRules);
if (compareResult == 0) //相等的情况
{
switch (indexOccurType)
{
case IndexOccurType.Any_Index:
return(middleIndex);
default:
resultIndex = middleIndex;
_BinarySearchSetLeftRightIndex(ref leftIndex, ref rightIndex, compareResult,
indexOccurType, listSortedType);
break;
}
}
else
{
_BinarySearchSetLeftRightIndex(ref leftIndex, ref rightIndex, compareResult, indexOccurType,
listSortedType);
}
}
return(resultIndex);
}
private static void _BinarySearchSetLeftRightIndex(ref int leftIndex, ref int rightIndex, int compareResult,
IndexOccurType indexOccurType = IndexOccurType.Any_Index,
ListSortedType listSortedType = ListSortedType.Increase)
{
int middleIndex = (leftIndex + rightIndex) / 2;
if (compareResult == 0)
{
switch (indexOccurType)
{
case IndexOccurType.First_Index:
rightIndex = middleIndex - 1;
return;
case IndexOccurType.Last_Index:
leftIndex = middleIndex + 1;
return;
}
return;
}
switch (listSortedType)
{
case ListSortedType.Increase:
if (compareResult > 0)
{
leftIndex = middleIndex + 1;
}
else
{
rightIndex = middleIndex - 1;
}
break;
case ListSortedType.Decrease:
if (compareResult > 0)
{
rightIndex = middleIndex - 1;
}
else
{
leftIndex = middleIndex + 1;
}
break;
default:
throw new Exception("Not Support ListSortedType:" + listSortedType);
}
}
