public void NegativeTests()
{
Assert.Throws <ArgumentNullException>(() => BinarySearchClass <int> .FindNumber(ints, 3, null));
Assert.Throws <ArgumentNullException>(() => BinarySearchClass <int> .FindNumber(null, 3, new Comparators()));
Assert.Throws <ArgumentNullException>(() => BinarySearchClass <int> .FindNumber(new List <int> {
}, 3, new Comparators()));
}
public void AssertCorrectSearchingRecursive()
{
int[] array = new int[] { 1, 2, 3, 12, 54, 600 };
int expectedResult = 5;
int result = BinarySearchClass.BinarySearchRecursive(array, 600);
Assert.AreEqual(expectedResult, result);
}
public void AssertResultIfItemIsNotFoundIterative()
{
int[] array = new int[] { 1, 2, 3, 12, 54, 600 };
int expectedResult = -1;
int result = BinarySearchClass.BinarySearchIterative(array, 123);
Assert.AreEqual(expectedResult, result);
}
public void PositiveTests()
{
int actual = BinarySearchClass <double> .FindNumber(doubles, 2.45, new Comparators());
int expected = 1;
Assert.AreEqual(expected, actual);
actual = BinarySearchClass <int> .FindNumber(ints, 3, new Comparators());
expected = 2;
Assert.AreEqual(expected, actual);
actual = BinarySearchClass <string> .FindNumber(strings, "w", new Comparators());
expected = 4;
Assert.AreEqual(expected, actual);
}
/// <summary>
/// 在构造函数中直接进行初始化
/// binarySearch和quickSort
/// </summary>
public Adapter()
{
this.binarySearch = new BinarySearchClass();
this.quickSort = new QuickSortClass();
}
/// <summary>
/// 实例化
/// </summary>
public Adapter()
{
sortObj = new ScoreLibs.QuickSortClass();
searchObj = new BinarySearchClass();
}
private BinarySearchClass searchObj; //定义适配者BinarySearchClass对象
public OperationAdapter()
{
sortObj = new QuickSortClass();
searchObj = new BinarySearchClass();
}
public void BinarySearch_ArgumentNullException_Test(int[] arr, int value)
{
Assert.That(() => BinarySearchClass.BinarySearch <int>(arr, value), Throws.TypeOf <ArgumentNullException>());
}
public int BinarySearch_Double_Test(double[] arr, double value)
{
Array.Sort(arr);
return(BinarySearchClass.BinarySearch <double>(arr, value));
}
public int BinarySearch_Char_Test(char[] arr, char value)
{
Array.Sort(arr);
return(BinarySearchClass.BinarySearch <char>(arr, value));
}
public int BinarySearch_Int_Test(int[] arr, int value)
{
Array.Sort(arr);
return(BinarySearchClass.BinarySearch <int>(arr, value));
}
