RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-05-31 10:28:10 +00:00
Code Issues Activity Actions

AK: Make binary_search signature more generic.

Browse source
This commit is contained in:
asynts 2020-12-29 16:13:16 +01:00 • committed by Andreas Kling
parent 35c4338625
commit 50d24e4f98
6 changed files with 63 additions and 53 deletions
Download patch file Download diff file Expand all files Collapse all files

56
AK/Tests/TestBinarySearch.cpp
View file

@ -38,24 +38,32 @@ TEST_CASE(vector_ints)
ints.append(2);
ints.append(3);
auto test1 = *binary_search(ints.span(), 1, AK::integral_compare<int>);
auto test2 = *binary_search(ints.span(), 2, AK::integral_compare<int>);
auto test3 = *binary_search(ints.span(), 3, AK::integral_compare<int>);
auto test1 = *binary_search(ints, 1);
auto test2 = *binary_search(ints, 2);
auto test3 = *binary_search(ints, 3);
EXPECT_EQ(test1, 1);
EXPECT_EQ(test2, 2);
EXPECT_EQ(test3, 3);
}
TEST_CASE(span_rvalue_reference)
{
Array<long, 3> array { 1, 2, 3 };
size_t nearby_index = 0;
auto* pointer = binary_search(array.span(), 2, &nearby_index);
EXPECT_EQ(nearby_index, 1u);
EXPECT_EQ(pointer, &array[1]);
}
TEST_CASE(array_doubles)
{
double doubles[] = { 1.1, 9.9, 33.33 };
Array<double, 3> array { 1.1, 9.9, 33.33 };
auto test1 = *binary_search(Span<double> { doubles, 3 }, 1.1, AK::integral_compare<double>);
auto test2 = *binary_search(Span<double> { doubles, 3 }, 9.9, AK::integral_compare<double>);
auto test3 = *binary_search(Span<double> { doubles, 3 }, 33.33, AK::integral_compare<double>);
EXPECT_EQ(test1, 1.1);
EXPECT_EQ(test2, 9.9);
EXPECT_EQ(test3, 33.33);
EXPECT_EQ(binary_search(array, 1.1), &array[0]);
EXPECT_EQ(binary_search(array, 33.33), &array[2]);
EXPECT_EQ(binary_search(array, 9.9), &array[1]);
}
TEST_CASE(vector_strings)
@ -68,9 +76,9 @@ TEST_CASE(vector_strings)
auto string_compare = [](const String& a, const String& b) -> int {
return strcmp(a.characters(), b.characters());
};
auto test1 = *binary_search(strings.span(), String("bat"), string_compare);
auto test2 = *binary_search(strings.span(), String("cat"), string_compare);
auto test3 = *binary_search(strings.span(), String("dog"), string_compare);
auto test1 = *binary_search(strings, String("bat"), nullptr, string_compare);
auto test2 = *binary_search(strings, String("cat"), nullptr, string_compare);
auto test3 = *binary_search(strings, String("dog"), nullptr, string_compare);
EXPECT_EQ(test1, String("bat"));
EXPECT_EQ(test2, String("cat"));
EXPECT_EQ(test3, String("dog"));
@ -81,7 +89,7 @@ TEST_CASE(single_element)
Vector<int> ints;
ints.append(1);
auto test1 = *binary_search(ints.span(), 1, AK::integral_compare<int>);
auto test1 = *binary_search(ints, 1);
EXPECT_EQ(test1, 1);
}
@ -92,9 +100,9 @@ TEST_CASE(not_found)
ints.append(2);
ints.append(3);
auto test1 = binary_search(ints.span(), -1, AK::integral_compare<int>);
auto test2 = binary_search(ints.span(), 0, AK::integral_compare<int>);
auto test3 = binary_search(ints.span(), 4, AK::integral_compare<int>);
auto test1 = binary_search(ints, -1);
auto test2 = binary_search(ints, 0);
auto test3 = binary_search(ints, 4);
EXPECT_EQ(test1, nullptr);
EXPECT_EQ(test2, nullptr);
EXPECT_EQ(test3, nullptr);
@ -104,7 +112,7 @@ TEST_CASE(no_elements)
{
Vector<int> ints;
auto test1 = binary_search(ints.span(), 1, AK::integral_compare<int>);
auto test1 = binary_search(ints, 1);
EXPECT_EQ(test1, nullptr);
}
@ -112,15 +120,9 @@ TEST_CASE(constexpr_array_search)
{
constexpr Array<int, 3> array = { 1, 17, 42 };
constexpr auto test1 = *binary_search(array.span(), 1, AK::integral_compare<int>);
constexpr auto test2 = *binary_search(array.span(), 17, AK::integral_compare<int>);
constexpr auto test3 = *binary_search(array.span(), 42, AK::integral_compare<int>);
constexpr auto test4 = binary_search(array.span(), 99, AK::integral_compare<int>);
static_assert(test1 == 1, "Binary search should find value at compile-time.");
static_assert(test2 == 17, "Binary search should find value at compile-time.");
static_assert(test3 == 42, "Binary search should find value at compile-time.");
static_assert(test4 == nullptr, "Binary search should return nullptr for missing value at compile-time.");
static_assert(binary_search(array, 42) == &array[2]);
static_assert(binary_search(array, 17) == &array[1]);
static_assert(binary_search(array, 3) == nullptr);
}
TEST_MAIN(BinarySearch)