RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-26 02:17:34 +00:00
Code Issues Activity Actions

AK: Remove a really slow unit test.

Browse source
This commit is contained in:
asynts 2020-10-25 17:54:50 +01:00 • committed by Andreas Kling
parent 7eee39b850
commit 0ab3488b60
1 changed files with 0 additions and 38 deletions
Download patch file Download diff file Expand all files Collapse all files

38
AK/Tests/TestBinarySearch.cpp
View file

@ -108,44 +108,6 @@ TEST_CASE(no_elements)
EXPECT_EQ(test1, nullptr); EXPECT_EQ(test1, nullptr);
} }
TEST_CASE(huge_char_array)
{
const size_t N = 2147483680;
Bytes span { new (std::nothrow) u8[N], N };
EXPECT(span.data() != nullptr);
for (size_t i = 0; i < span.size(); ++i)
span[i] = 'a';
size_t index = N - 1;
for (u8 c = 'z'; c > 'b'; --c)
span[index--] = c;
EXPECT_EQ(span[N - 1], 'z');
const u8 a = 'a';
auto where = binary_search(span, a, AK::integral_compare<u8>);
EXPECT(where != nullptr);
EXPECT_EQ(*where, 'a');
const u8 z = 'z';
where = binary_search(span, z, AK::integral_compare<u8>);
EXPECT(where != nullptr);
EXPECT_EQ(*where, 'z');
size_t near = 0;
const u8 tilde = '~';
where = binary_search(span, tilde, AK::integral_compare<u8>, &near);
EXPECT_EQ(where, nullptr);
EXPECT_EQ(near, N - 1);
const u8 b = 'b';
where = binary_search(span, b, AK::integral_compare<u8>, &near);
EXPECT_EQ(where, nullptr);
EXPECT_EQ(near, N - ('z' - b + 1));
delete[] span.data();
}
TEST_CASE(constexpr_array_search) TEST_CASE(constexpr_array_search)
{ {
constexpr Array<int, 3> array = { 1, 17, 42 }; constexpr Array<int, 3> array = { 1, 17, 42 };