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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
// Copyright (C) 2018 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include <QtTest>
#include <array>
#include <deque>
#include <list>
#include <memory>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// must get included after the containers above or gcc4.9 will have a problem using
// initializer_list related code on the templates inside algorithm.h
#include <utils/pointeralgorithm.h>
class tst_PointerAlgorithm : public QObject
{
Q_OBJECT
private slots:
void anyOf();
void count();
void contains();
void findOr();
void findOrDefault();
void toRawPointer();
void toReferences();
void take();
void takeOrDefault();
};
int stringToInt(const QString &s)
{
return s.toInt();
}
namespace {
struct BaseStruct
{
BaseStruct(int m) : member(m) {}
bool operator==(const BaseStruct &other) const { return member == other.member; }
int member;
};
struct Struct : public BaseStruct
{
Struct(int m) : BaseStruct(m) {}
bool isOdd() const { return member % 2 == 1; }
bool isEven() const { return !isOdd(); }
int getMember() const { return member; }
};
}
void tst_PointerAlgorithm::anyOf()
{
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
QVERIFY(Utils::anyOf(vector, ptrVector.at(0)));
int foo = 42;
QVERIFY(!Utils::anyOf(vector, &foo));
QVERIFY(Utils::anyOf(vector, nullptr));
}
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
QVERIFY(!Utils::anyOf(vector, nullptr));
}
}
void tst_PointerAlgorithm::count()
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::unique_ptr<int>());
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
QCOMPARE(Utils::count(vector, ptrVector.at(0)), 1);
int foo = 42;
QCOMPARE(Utils::count(vector, &foo), 0);
QCOMPARE(Utils::count(vector, nullptr), 2);
}
void tst_PointerAlgorithm::contains()
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
QVERIFY(Utils::contains(vector, ptrVector.at(0)));
int foo = 42;
QVERIFY(!Utils::contains(vector, &foo));
QVERIFY(Utils::contains(vector, nullptr));
}
void tst_PointerAlgorithm::findOr()
{
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(2));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
int foo = 42;
int bar = 23;
QVERIFY(Utils::findOr(vector, &foo, ptrVector.at(0)) == ptrVector.at(0));
QVERIFY(Utils::findOr(vector, nullptr, &foo) == nullptr);
QVERIFY(Utils::findOr(vector, &foo, nullptr) == nullptr);
QVERIFY(Utils::findOr(vector, &foo, &bar) == &foo);
QCOMPARE(Utils::findOr(vector, &foo,
[](const std::unique_ptr<int> &ip) { return ip && *ip == 2; }),
ptrVector.at(1));
QCOMPARE(Utils::findOr(vector, &foo,
[](const std::unique_ptr<int> &ip) { return ip && *ip == 43; }),
&foo);
}
{
std::vector<std::unique_ptr<Struct>> v3;
v3.emplace_back(std::make_unique<Struct>(1));
v3.emplace_back(std::make_unique<Struct>(3));
v3.emplace_back(std::make_unique<Struct>(5));
v3.emplace_back(std::make_unique<Struct>(7));
Struct defS(6);
QCOMPARE(Utils::findOr(v3, &defS, &Struct::isOdd), v3.at(0).get());
QCOMPARE(Utils::findOr(v3, &defS, &Struct::isEven), &defS);
}
{
std::vector<std::shared_ptr<Struct>> v4;
v4.emplace_back(std::make_shared<Struct>(1));
v4.emplace_back(std::make_shared<Struct>(3));
v4.emplace_back(std::make_shared<Struct>(5));
v4.emplace_back(std::make_shared<Struct>(7));
std::shared_ptr<Struct> sharedDefS = std::make_shared<Struct>(6);
QCOMPARE(Utils::findOr(v4, sharedDefS, &Struct::isOdd), v4.at(0));
QCOMPARE(Utils::findOr(v4, sharedDefS, &Struct::isEven), sharedDefS);
}
}
void tst_PointerAlgorithm::findOrDefault()
{
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
int foo = 42;
QVERIFY(Utils::findOrDefault(vector, ptrVector.at(0)) == ptrVector.at(0));
QVERIFY(Utils::findOrDefault(vector, &foo) == nullptr);
}
{
std::vector<std::unique_ptr<int>> v2;
v2.emplace_back(std::make_unique<int>(1));
v2.emplace_back(std::make_unique<int>(2));
v2.emplace_back(std::make_unique<int>(3));
v2.emplace_back(std::make_unique<int>(4));
QCOMPARE(Utils::findOrDefault(v2, [](const std::unique_ptr<int> &ip) { return *ip == 2; }), v2.at(1).get());
QCOMPARE(Utils::findOrDefault(v2, [](const std::unique_ptr<int> &ip) { return *ip == 5; }), static_cast<int*>(nullptr));
}
{
std::vector<std::unique_ptr<Struct>> v3;
v3.emplace_back(std::make_unique<Struct>(1));
v3.emplace_back(std::make_unique<Struct>(3));
v3.emplace_back(std::make_unique<Struct>(5));
v3.emplace_back(std::make_unique<Struct>(7));
QCOMPARE(Utils::findOrDefault(v3, &Struct::isOdd), v3.at(0).get());
QCOMPARE(Utils::findOrDefault(v3, &Struct::isEven), static_cast<Struct*>(nullptr));
}
}
void tst_PointerAlgorithm::toRawPointer()
{
const std::vector<std::unique_ptr<Struct>> v;
// same result container
const std::vector<Struct *> x1 = Utils::toRawPointer(v);
// different result container
const std::vector<Struct *> x2 = Utils::toRawPointer<std::vector>(v);
const QVector<Struct *> x3 = Utils::toRawPointer<QVector>(v);
const std::list<Struct *> x4 = Utils::toRawPointer<std::list>(v);
// different fully specified result container
const std::vector<BaseStruct *> x5 = Utils::toRawPointer<std::vector<BaseStruct *>>(v);
const QVector<BaseStruct *> x6 = Utils::toRawPointer<QVector<BaseStruct *>>(v);
}
void tst_PointerAlgorithm::toReferences()
{
// toReference
{
// std::vector -> std::vector
std::vector<Struct> v;
const std::vector<std::reference_wrapper<Struct>> x = Utils::toReferences(v);
}
{
// QList -> std::vector
QList<Struct> v;
const std::vector<std::reference_wrapper<Struct>> x = Utils::toReferences<std::vector>(v);
}
{
// std::vector -> QList
std::vector<Struct> v;
const QList<std::reference_wrapper<Struct>> x = Utils::toReferences<QList>(v);
}
{
// std::vector -> std::list
std::vector<Struct> v;
const std::list<std::reference_wrapper<Struct>> x = Utils::toReferences<std::list>(v);
}
// toConstReference
{
// std::vector -> std::vector
const std::vector<Struct> v;
const std::vector<std::reference_wrapper<const Struct>> x = Utils::toConstReferences(v);
}
{
// QList -> std::vector
const QList<Struct> v;
const std::vector<std::reference_wrapper<const Struct>> x
= Utils::toConstReferences<std::vector>(v);
}
{
// std::vector -> QList
const std::vector<Struct> v;
const QList<std::reference_wrapper<const Struct>> x = Utils::toConstReferences<QList>(v);
}
{
// std::vector -> std::list
const std::vector<Struct> v;
const std::list<std::reference_wrapper<const Struct>> x
= Utils::toConstReferences<std::list>(v);
}
}
void tst_PointerAlgorithm::take()
{
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(2));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
int foo = 42;
QVERIFY(Utils::take(vector, ptrVector.at(0)).value().get() == ptrVector.at(0));
QVERIFY(Utils::take(vector, ptrVector.at(0)) == std::nullopt);
QVERIFY(Utils::take(vector, &foo) == std::nullopt);
QVERIFY(Utils::take(vector, nullptr).value().get() == nullptr);
}
}
void tst_PointerAlgorithm::takeOrDefault()
{
{
std::vector<std::unique_ptr<int>> vector;
vector.emplace_back(std::make_unique<int>(5));
vector.emplace_back(std::make_unique<int>(2));
vector.emplace_back(std::make_unique<int>(6));
vector.emplace_back(std::make_unique<int>(7));
vector.emplace_back(std::unique_ptr<int>());
std::vector<int *> ptrVector = Utils::toRawPointer(vector);
int foo = 42;
QVERIFY(Utils::takeOrDefault(vector, ptrVector.at(0)).get() == ptrVector.at(0));
QVERIFY(Utils::takeOrDefault(vector, ptrVector.at(0)).get() == nullptr);
QVERIFY(Utils::takeOrDefault(vector, &foo).get() == nullptr);
QVERIFY(Utils::takeOrDefault(vector, nullptr).get() == nullptr);
}
}
QTEST_GUILESS_MAIN(tst_PointerAlgorithm)
#include "tst_pointeralgorithm.moc"
|
