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
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibTest/TestCase.h>
#include <AK/BinaryHeap.h>
#include <AK/String.h>
TEST_CASE(construct)
{
BinaryHeap<int, int, 5> empty;
EXPECT(empty.is_empty());
EXPECT(empty.size() == 0);
}
TEST_CASE(construct_from_existing)
{
int keys[] = { 3, 2, 1 };
char values[] = { 'c', 'b', 'a' };
BinaryHeap<int, char, 5> from_existing(keys, values, 3);
EXPECT(from_existing.size() == 3);
EXPECT_EQ(from_existing.pop_min(), 'a');
EXPECT_EQ(from_existing.pop_min(), 'b');
EXPECT_EQ(from_existing.pop_min(), 'c');
}
TEST_CASE(populate_int)
{
BinaryHeap<int, int, 5> ints;
ints.insert(1, 10);
ints.insert(3, 20);
ints.insert(2, 30);
EXPECT_EQ(ints.size(), 3u);
EXPECT_EQ(ints.pop_min(), 10);
EXPECT_EQ(ints.size(), 2u);
EXPECT_EQ(ints.pop_min(), 30);
EXPECT_EQ(ints.size(), 1u);
EXPECT_EQ(ints.pop_min(), 20);
EXPECT_EQ(ints.size(), 0u);
}
TEST_CASE(populate_string)
{
BinaryHeap<int, String, 5> strings;
strings.insert(1, "ABC");
strings.insert(2, "DEF");
EXPECT_EQ(strings.size(), 2u);
EXPECT_EQ(strings.pop_min(), "ABC");
EXPECT_EQ(strings.pop_min(), "DEF");
EXPECT(strings.is_empty());
}
TEST_CASE(large_populate_reverse)
{
BinaryHeap<int, int, 1024> ints;
for (int i = 1023; i >= 0; i--) {
ints.insert(i, i);
}
EXPECT_EQ(ints.size(), 1024u);
for (int i = 0; i < 1024; i++) {
EXPECT_EQ(ints.peek_min(), i);
EXPECT_EQ(ints.pop_min(), i);
}
}
|
