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
|
/*
* Copyright (c) 2020, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibTest/TestCase.h>
#include <AK/Array.h>
static constexpr int constexpr_sum(ReadonlySpan<int> const span)
{
int sum = 0;
for (auto value : span)
sum += value;
return sum;
}
TEST_CASE(compile_time_constructible)
{
constexpr Array<int, 4> array = { 0, 1, 2, 3 };
static_assert(array.size() == 4);
}
TEST_CASE(compile_time_iterable)
{
constexpr Array<int, 8> array = { 0, 1, 2, 3, 4, 5, 6, 7 };
static_assert(constexpr_sum(array) == 28);
}
TEST_CASE(contains_slow)
{
constexpr Array<int, 8> array = { 0, 1, 2, 3, 4, 5, 6, 7 };
EXPECT(array.contains_slow(0));
EXPECT(array.contains_slow(4));
EXPECT(array.contains_slow(7));
EXPECT(!array.contains_slow(42));
}
TEST_CASE(first_index_of)
{
constexpr Array<int, 8> array = { 0, 1, 2, 3, 4, 5, 6, 7 };
EXPECT(array.first_index_of(0) == 0u);
EXPECT(array.first_index_of(4) == 4u);
EXPECT(array.first_index_of(7) == 7u);
EXPECT(!array.first_index_of(42).has_value());
}
|
