1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/*
* Copyright (c) 2021, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibTest/TestCase.h>
#include <AK/Array.h>
#include <AK/Find.h>
#include <AK/Vector.h>
TEST_CASE(should_return_end_if_not_in_container)
{
constexpr Array<int, 10> a {};
static_assert(a.end() == AK::find(a.begin(), a.end(), 1));
EXPECT(a.end() == AK::find(a.begin(), a.end(), 1));
}
TEST_CASE(should_return_iterator_to_first_matching_value_in_container)
{
static constexpr Array<int, 10> a { 1, 2, 3, 4, 0, 6, 7, 8, 0, 0 };
constexpr auto expected = a.begin() + 4;
static_assert(expected == AK::find(a.begin(), a.end(), 0));
EXPECT(expected == AK::find(a.begin(), a.end(), 0));
}
TEST_CASE(should_return_iterator_to_first_predicate_matching_value_in_container)
{
static constexpr Array<int, 10> a { 1, 2, 3, 4, 0, 6, 7, 8, 0, 0 };
constexpr auto expected = a.begin() + 4;
static_assert(expected == AK::find_if(a.begin(), a.end(), [](auto v) { return v == 0; }));
EXPECT(expected == AK::find_if(a.begin(), a.end(), [](auto v) { return v == 0; }));
auto find_me = 8;
EXPECT(find_me == *AK::find_if(a.begin(), a.end(), [&](auto v) { return v == find_me; }));
}
TEST_CASE(should_return_index_to_first_predicate_matching_value_in_container)
{
static constexpr Array<int, 10> a { 1, 2, 3, 4, 0, 6, 7, 8, 0, 0 };
static_assert(4 == AK::find_index(a.begin(), a.end(), 0));
EXPECT(4 == AK::find_index(a.begin(), a.end(), 0));
}
|
