Skip to content

Commit 1d5d728

Browse files
committed
Update tests
1 parent 77d3e49 commit 1d5d728

File tree

1 file changed

+12
-12
lines changed

1 file changed

+12
-12
lines changed

UnitTest/AlgorithmsTests/BinarySearcherTest.cs

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -14,16 +14,14 @@ public static void IntBinarySearchTest()
1414
IList<int> sortedList = new List<int> { 1, 3, 6, 7, 9, 10 };
1515
int numToSearch = 6;
1616
BinarySearcher<int> intSearcher = new BinarySearcher<int>(list, Comparer<int>.Default);
17-
intSearcher.SearchFor(numToSearch);
18-
int itemIndex = intSearcher.BinarySearch();
17+
int actualIndex = intSearcher.BinarySearch(numToSearch);
1918
int expectedIndex = sortedList.IndexOf(numToSearch);
2019

21-
Assert.Equal(expectedIndex, itemIndex);
20+
Assert.Equal(expectedIndex, actualIndex);
2221
Assert.Equal(numToSearch, intSearcher.Current);
2322

2423
numToSearch = 20;
25-
intSearcher.SearchFor(numToSearch);
26-
int itemNotExists = intSearcher.BinarySearch();
24+
int itemNotExists = intSearcher.BinarySearch(numToSearch);
2725
Assert.Equal(-1, itemNotExists);
2826
}
2927

@@ -35,33 +33,35 @@ public static void StringBinarySearchTest()
3533
IList<string> sortedAnimals = new List<string> { "bee", "cat", "lion", "sparrow", "tiger" };
3634
string itemToSearch = "bee";
3735
BinarySearcher<string> strSearcher = new BinarySearcher<string>(animals, Comparer<string>.Default);
38-
strSearcher.SearchFor(itemToSearch);
39-
int actualIndex = strSearcher.BinarySearch();
36+
int actualIndex = strSearcher.BinarySearch(itemToSearch);
4037
int expectedAnimalIndex = sortedAnimals.IndexOf(itemToSearch);
4138

4239
Assert.Equal(expectedAnimalIndex, actualIndex);
4340
Assert.Equal(itemToSearch, strSearcher.Current);
4441

4542
itemToSearch = "shark";
46-
strSearcher.SearchFor(itemToSearch);
47-
int itemNotExists = strSearcher.BinarySearch();
48-
Assert.Equal(-1, itemNotExists);
43+
int itemNotExist = strSearcher.BinarySearch(itemToSearch);
44+
Assert.Equal(-1, itemNotExist);
4945
}
5046

5147
[Fact]
5248
public static void MoveNextTest()
5349
{
5450
IList<int> items = new List<int> {3, 5, 2, 6, 1, 4};
5551
BinarySearcher<int> searcher = new BinarySearcher<int>(items, Comparer<int>.Default);
56-
searcher.SearchFor(1);
52+
searcher.BinarySearch(1);
53+
//reset indices to test MoveNext()
54+
searcher.Reset();
5755
IList<int> leftEnumeratedValues = new List<int> {3, 2, 1};
5856
int i = 0;
5957
while (searcher.MoveNext())
6058
{
6159
Assert.Equal(leftEnumeratedValues[i++], searcher.Current);
6260
}
6361

64-
searcher.SearchFor(6);
62+
searcher.BinarySearch(6);
63+
//reset indices to test MoveNext()
64+
searcher.Reset();
6565
IList<int> rightEnumeratedValues = new List<int> {3, 5, 6};
6666
i = 0;
6767
while (searcher.MoveNext())

0 commit comments

Comments
 (0)