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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
*/
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include <array>
#include "ds/SinglyLinkedList.h"
#include "jsapi-tests/tests.h"
using namespace js;
struct IntElement {
int value;
IntElement* next = nullptr;
explicit IntElement(int v) : value(v) {}
};
using TestList = SinglyLinkedList<IntElement>;
BEGIN_TEST(testSinglyLinkedList) {
// Test empty lists.
TestList list;
CHECK(list.isEmpty());
CHECK(!list.first());
CHECK(!list.last());
CHECK(CountList(list) == 0);
// Test list pushBack and first/last accessors.
list.pushBack(MakeElement(1));
CHECK(!list.isEmpty());
CHECK(list.first()->value == 1);
CHECK(list.last()->value == 1);
CHECK(CheckList<1>(list));
list.pushBack(MakeElement(2));
list.pushBack(MakeElement(3));
CHECK(!list.isEmpty());
CHECK(list.first()->value == 1);
CHECK(list.last()->value == 3);
CHECK((CheckList<1, 2, 3>(list)));
// Test popFront.
IntElement* e = list.popFront();
CHECK(e->value == 1);
js_delete(e);
CHECK(list.first()->value == 2);
CHECK((CheckList<2, 3>(list)));
e = list.popFront();
CHECK(e->value == 2);
js_delete(e);
CHECK(list.first()->value == 3);
// Test pushFront.
list.pushFront(MakeElement(2));
CHECK(list.first()->value == 2);
CHECK((CheckList<2, 3>(list)));
list.pushFront(MakeElement(1));
CHECK(list.first()->value == 1);
CHECK((CheckList<1, 2, 3>(list)));
// Test moveFrontToBack.
list.moveFrontToBack();
CHECK(list.first()->value == 2);
CHECK(list.last()->value == 1);
CHECK((CheckList<2, 3, 1>(list)));
list.moveFrontToBack();
list.moveFrontToBack();
CHECK((CheckList<1, 2, 3>(list)));
// Test move constructor and assignment.
TestList list2(std::move(list));
CHECK(list.isEmpty());
CHECK((CheckList<1, 2, 3>(list2)));
list = std::move(list2);
CHECK(list2.isEmpty());
CHECK((CheckList<1, 2, 3>(list)));
// Test release.
IntElement* head = list.release();
CHECK(list.isEmpty());
CHECK(head->value == 1);
CHECK(head->next->value == 2);
CHECK(head->next->next->value == 3);
CHECK(!head->next->next->next);
// Test construct from linked list.
list = TestList(head, head->next->next);
CHECK((CheckList<1, 2, 3>(list)));
// Test append.
CHECK(list2.isEmpty());
list.append(std::move(list2));
CHECK((CheckList<1, 2, 3>(list)));
CHECK(list2.isEmpty());
list2.pushBack(MakeElement(4));
list2.pushBack(MakeElement(5));
list2.pushBack(MakeElement(6));
list.append(std::move(list2));
CHECK((CheckList<1, 2, 3, 4, 5, 6>(list)));
CHECK(list2.isEmpty());
// Cleanup.
while (!list.isEmpty()) {
js_delete(list.popFront());
}
CHECK(list.isEmpty());
CHECK(!list.first());
CHECK(!list.last());
CHECK(CountList(list) == 0);
return true;
}
IntElement* MakeElement(int value) {
IntElement* element = js_new<IntElement>(value);
MOZ_RELEASE_ASSERT(element);
return element;
}
size_t CountList(const TestList& list) {
size_t i = 0;
for (auto iter = list.iter(); !iter.done(); iter.next()) {
i++;
}
return i;
}
template <int... Values>
bool CheckList(const TestList& list) {
int expected[] = {Values...};
constexpr size_t N = std::size(expected);
size_t i = 0;
for (auto iter = list.iter(); !iter.done(); iter.next()) {
CHECK(i < N);
CHECK(iter->value == expected[i]);
i++;
}
CHECK(i == N);
return true;
}
END_TEST(testSinglyLinkedList)
|
