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
|
/* Copyright 2015 OpenMarket Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "axolotl/list.hh"
#include "unittest.hh"
int main() {
{ /** List insert test **/
TestCase test_case("List insert");
axolotl::List<int, 4> test_list;
assert_equals(std::size_t(0), test_list.size());
for (int i = 0; i < 4; ++i) {
test_list.insert(test_list.end(), i);
}
assert_equals(std::size_t(4), test_list.size());
int i = 0;
for (auto item : test_list) {
assert_equals(i++, item);
}
assert_equals(4, i);
test_list.insert(test_list.end(), 4);
assert_equals(4, test_list[3]);
} /** List insert test **/
{ /** List erase test **/
TestCase test_case("List erase");
axolotl::List<int, 4> test_list;
assert_equals(std::size_t(0), test_list.size());
for (int i = 0; i < 4; ++i) {
test_list.insert(test_list.end(), i);
}
assert_equals(std::size_t(4), test_list.size());
test_list.erase(test_list.begin());
assert_equals(std::size_t(3), test_list.size());
int i = 0;
for (auto item : test_list) {
assert_equals(i + 1, item);
++i;
}
assert_equals(3, i);
}
}
|