mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-08-22 02:09:24 +00:00
Tests: Rename AK/TestMemMem.cpp to AK/TestMemory.cpp
Rename to create a new generic test group for the AK memory APIs.
This commit is contained in:
parent
c575710e5e
commit
02b2f2787a
Notes:
sideshowbarker
2024-07-17 17:28:04 +09:00
Author: https://github.com/bgianfo
Commit: 02b2f2787a
Pull-request: https://github.com/SerenityOS/serenity/pull/13021
Reviewed-by: https://github.com/alimpfard
Reviewed-by: https://github.com/awesomekling ✅
2 changed files with 1 additions and 1 deletions
68
Tests/AK/TestMemory.cpp
Normal file
68
Tests/AK/TestMemory.cpp
Normal file
|
@ -0,0 +1,68 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
*
|
||||
* SPDX-License-Identifier: BSD-2-Clause
|
||||
*/
|
||||
|
||||
#include <LibTest/TestCase.h>
|
||||
|
||||
#include <AK/MemMem.h>
|
||||
|
||||
TEST_CASE(bitap)
|
||||
{
|
||||
Array<u8, 8> haystack { 1, 0, 1, 2, 3, 4, 5, 0 };
|
||||
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
||||
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
||||
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
||||
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
||||
|
||||
auto result_0 = AK::memmem(haystack.data(), haystack.size(), needle_0.data(), needle_0.size());
|
||||
auto result_1 = AK::memmem(haystack.data(), haystack.size(), needle_1.data(), needle_1.size());
|
||||
auto result_2 = AK::memmem(haystack.data(), haystack.size(), needle_2.data(), needle_2.size());
|
||||
auto result_3 = AK::memmem(haystack.data(), haystack.size(), needle_3.data(), needle_3.size());
|
||||
|
||||
EXPECT_EQ(result_0, &haystack[3]);
|
||||
EXPECT_EQ(result_1, &haystack[2]);
|
||||
EXPECT_EQ(result_2, &haystack[4]);
|
||||
EXPECT_EQ(result_3, nullptr);
|
||||
}
|
||||
|
||||
TEST_CASE(kmp_one_chunk)
|
||||
{
|
||||
Array<u8, 8> haystack { 1, 0, 1, 2, 3, 4, 5, 0 };
|
||||
Array<Array<u8, 8>, 1> haystack_arr { haystack };
|
||||
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
||||
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
||||
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
||||
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
||||
|
||||
auto result_0 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_0);
|
||||
auto result_1 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_1);
|
||||
auto result_2 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_2);
|
||||
auto result_3 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_3);
|
||||
|
||||
EXPECT_EQ(result_0.value_or(9), 3u);
|
||||
EXPECT_EQ(result_1.value_or(9), 2u);
|
||||
EXPECT_EQ(result_2.value_or(9), 4u);
|
||||
EXPECT(!result_3.has_value());
|
||||
}
|
||||
|
||||
TEST_CASE(kmp_two_chunks)
|
||||
{
|
||||
Array<u8, 4> haystack_first_half { 1, 0, 1, 2 }, haystack_second_half { 3, 4, 5, 0 };
|
||||
Array<Array<u8, 4>, 2> haystack { haystack_first_half, haystack_second_half };
|
||||
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
||||
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
||||
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
||||
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
||||
|
||||
auto result_0 = AK::memmem(haystack.begin(), haystack.end(), needle_0);
|
||||
auto result_1 = AK::memmem(haystack.begin(), haystack.end(), needle_1);
|
||||
auto result_2 = AK::memmem(haystack.begin(), haystack.end(), needle_2);
|
||||
auto result_3 = AK::memmem(haystack.begin(), haystack.end(), needle_3);
|
||||
|
||||
EXPECT_EQ(result_0.value_or(9), 3u);
|
||||
EXPECT_EQ(result_1.value_or(9), 2u);
|
||||
EXPECT_EQ(result_2.value_or(9), 4u);
|
||||
EXPECT(!result_3.has_value());
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue