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
163
164
165
|
/*
* SPDX-FileCopyrightText: 2016-2016 CSSlayer <wengxt@gmail.com>
*
* SPDX-License-Identifier: LGPL-2.1-or-later
*
*/
#include <algorithm>
#include <iterator>
#include <vector>
#include "fcitx-utils/intrusivelist.h"
#include "fcitx-utils/log.h"
using namespace fcitx;
struct Foo : public IntrusiveListNode {
Foo(int d) : data(d) {}
int data;
};
void test_regular() {
IntrusiveList<Foo> list;
Foo a(1), b(2), c(3), d(4);
list.push_back(a);
list.push_back(b);
list.push_back(c);
list.push_back(d);
std::vector<int> check = {1, 2, 3, 4};
FCITX_ASSERT(list.size() == 4);
int idx = 0;
for (auto &f : list) {
FCITX_ASSERT(f.data == check[idx]);
idx++;
}
FCITX_ASSERT(idx == 4);
list.pop_back();
FCITX_ASSERT(list.size() == 3);
idx = 0;
for (auto &f : list) {
FCITX_ASSERT(f.data == check[idx]);
idx++;
}
FCITX_ASSERT(idx == 3);
static_assert(
std::is_same<
std::iterator_traits<decltype(list)::iterator>::iterator_category,
std::bidirectional_iterator_tag>::value,
"Error");
auto iter = std::find_if(list.begin(), list.end(),
[](Foo &f) { return f.data == 2; });
FCITX_ASSERT(iter != list.end());
list.erase(iter);
FCITX_ASSERT(list.size() == 2);
FCITX_ASSERT(list.front().data == 1);
FCITX_ASSERT(list.back().data == 3);
FCITX_ASSERT(std::distance(list.begin(), list.end()) == 2);
auto iter2 = list.insert(list.begin(), d);
FCITX_ASSERT(iter2->data == 4);
FCITX_ASSERT(list.size() == 3);
list.insert(list.end(), b);
FCITX_ASSERT(list.size() == 4);
std::vector<int> check2 = {4, 1, 3, 2};
idx = 0;
for (auto &f : list) {
FCITX_ASSERT(f.data == check2[idx]);
idx++;
}
idx = 0;
auto list2 = std::move(list);
for (auto &f : list2) {
FCITX_ASSERT(f.data == check2[idx]);
idx++;
}
}
void test_move() {
{
// empty to empty
IntrusiveList<Foo> list;
IntrusiveList<Foo> list2;
list2 = std::move(list);
FCITX_ASSERT(list2.empty());
}
{
// something to empty
IntrusiveList<Foo> list;
Foo a(1), b(2), c(3), d(4);
list.push_back(a);
list.push_back(b);
list.push_back(c);
list.push_back(d);
IntrusiveList<Foo> list2;
list2 = std::move(list);
FCITX_ASSERT(a.isInList());
FCITX_ASSERT(b.isInList());
FCITX_ASSERT(c.isInList());
FCITX_ASSERT(d.isInList());
FCITX_ASSERT(list2.size() == 4);
std::vector<int> check = {1, 2, 3, 4};
size_t idx = 0;
for (auto &f : list2) {
FCITX_ASSERT(f.data == check[idx]);
idx++;
}
}
{
// something to empty
IntrusiveList<Foo> list;
IntrusiveList<Foo> list2;
Foo a(1), b(2), c(3), d(4);
list2.push_back(a);
list2.push_back(b);
list2.push_back(c);
list2.push_back(d);
list2 = std::move(list);
FCITX_ASSERT(!a.isInList());
FCITX_ASSERT(!b.isInList());
FCITX_ASSERT(!c.isInList());
FCITX_ASSERT(!d.isInList());
FCITX_ASSERT(list2.empty());
}
}
void test_const() {
{
// something to empty
IntrusiveList<Foo> list;
Foo a(1), b(2), c(3), d(4);
list.push_back(a);
list.push_back(b);
list.push_back(c);
list.push_back(d);
const IntrusiveList<Foo> &cref = list;
std::vector<int> check = {1, 2, 3, 4};
size_t idx = 0;
for (auto &f : cref) {
FCITX_ASSERT(f.data == check[idx]);
idx++;
}
auto citer = cref.begin();
auto iter = list.begin();
static_assert(!std::is_same_v<decltype(iter), decltype(citer)>);
citer = iter;
}
}
int main() {
test_regular();
test_move();
test_const();
return 0;
}
|
