forked from eclipse-paho/paho.mqtt.cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_string_collection.cpp
425 lines (310 loc) · 10.8 KB
/
test_string_collection.cpp
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
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
// test_string_collection.cpp
//
// Unit tests for the string_collection and name_value_collection classes in
// the Paho MQTT C++ library.
//
/*******************************************************************************
* Copyright (c) 2017-2020 Frank Pagliughi <[email protected]>
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* and Eclipse Distribution License v1.0 which accompany this distribution.
*
* The Eclipse Public License is available at
* http://www.eclipse.org/legal/epl-v10.html
* and the Eclipse Distribution License is available at
* http://www.eclipse.org/org/documents/edl-v10.php.
*
* Contributors:
* Frank Pagliughi - initial implementation and documentation
*******************************************************************************/
#define UNIT_TESTS
#include <vector>
#include <cstring>
#include "catch2/catch.hpp"
#include "mqtt/string_collection.h"
using namespace mqtt;
static const string STR { "Some random string" };
static const std::vector<string> VEC { "test0", "test1", "test2" };
static const std::map<string, string> NV_PAIRS {
{ "name0", "value0" },
{ "name1", "value1" },
{ "name2", "value2" }
};
// ----------------------------------------------------------------------
// Test the default constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection default ctor", "[collections]")
{
string_collection sc;
REQUIRE(sc.empty());
REQUIRE(sc.size() == size_t(0));
}
// ----------------------------------------------------------------------
// Test the string copy constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection str copy ctor", "[collections]")
{
string_collection sc(STR);
REQUIRE(size_t(1) == sc.size());
REQUIRE(STR == sc[0]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(STR.c_str(), c_arr[0]));
}
// ----------------------------------------------------------------------
// Test the string move constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection str move ctor", "[collections]")
{
string str(STR);
string_collection sc(std::move(str));
REQUIRE(size_t(1) == sc.size());
REQUIRE(STR == sc[0]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(STR.c_str(), c_arr[0]));
}
// ----------------------------------------------------------------------
// Test the vector copy constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection vec copy ctor", "[collections]")
{
string_collection sc(VEC);
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the vector move constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection vec move ctor", "[collections]")
{
std::vector<string> vec{ VEC };
string_collection sc(std::move(vec));
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the ini vector constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection ini str ctor", "[collections]")
{
string_collection sc( { VEC[0], VEC[1], VEC[2] } );
REQUIRE(size_t(3) == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the ini vector constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection ini cstr ctor", "[collections]")
{
string_collection sc( { "test0", "test1", "test2" } );
REQUIRE(size_t(3) == sc.size());
REQUIRE(string("test0") == sc[0]);
REQUIRE(string("test1") == sc[1]);
REQUIRE(string("test2") == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(sc[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(sc[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(sc[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the copy constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection copy ctor", "[collections]")
{
string_collection orgSC(VEC);
string_collection sc(orgSC);;
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the move constructor
// ----------------------------------------------------------------------
TEST_CASE("string_collection move ctor", "[collections]")
{
string_collection orgSC(VEC);
string_collection sc(std::move(orgSC));
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the copy assignment
// ----------------------------------------------------------------------
TEST_CASE("string_collection copy assignment", "[collections]")
{
string_collection orgSC(VEC);
string_collection sc;
sc = orgSC;
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the move assignment
// ----------------------------------------------------------------------
TEST_CASE("string_collection move assignment", "[collections]")
{
string_collection orgSC(VEC);
string_collection sc;
sc = std::move(orgSC);
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the push back of strings
// ----------------------------------------------------------------------
TEST_CASE("string_collection push str", "[collections]")
{
string_collection sc;
for (const auto& s : VEC)
sc.push_back(s);
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the push back of C strings
// ----------------------------------------------------------------------
TEST_CASE("string_collection push cstr", "[collections]")
{
string_collection sc;
for (const auto& s : VEC)
sc.push_back(s.c_str());
REQUIRE(VEC.size() == sc.size());
REQUIRE(VEC[0] == sc[0]);
REQUIRE(VEC[1] == sc[1]);
REQUIRE(VEC[2] == sc[2]);
auto c_arr = sc.c_arr();
REQUIRE(0 == strcmp(VEC[0].c_str(), c_arr[0]));
REQUIRE(0 == strcmp(VEC[1].c_str(), c_arr[1]));
REQUIRE(0 == strcmp(VEC[2].c_str(), c_arr[2]));
}
// ----------------------------------------------------------------------
// Test the clear method
// ----------------------------------------------------------------------
TEST_CASE("string_collection clear", "[collections]")
{
string_collection sc(VEC);
REQUIRE_FALSE(sc.empty());
sc.clear();
REQUIRE(sc.empty());
REQUIRE(size_t(0) == sc.size());
}
/////////////////////////////////////////////////////////////////////////////
// name_value_collection
/////////////////////////////////////////////////////////////////////////////
TEST_CASE("name_value_collection default ctor", "[collections]")
{
name_value_collection nvc;
REQUIRE(nvc.empty());
REQUIRE(0 == nvc.size());
}
TEST_CASE("name_value_collection initializer ctor", "[collections]")
{
name_value_collection nvc {
{ "name0", "value0" },
{ "name1", "value1" },
{ "name2", "value2" }
};
REQUIRE_FALSE(nvc.empty());
REQUIRE(3 == nvc.size());
auto cArr = nvc.c_arr();
REQUIRE(0 == strcmp("name0", cArr[0].name));
REQUIRE(0 == strcmp("value0", cArr[0].value));
REQUIRE(0 == strcmp("name1", cArr[1].name));
REQUIRE(0 == strcmp("value1", cArr[1].value));
REQUIRE(0 == strcmp("name2", cArr[2].name));
REQUIRE(0 == strcmp("value2", cArr[2].value));
REQUIRE(nullptr == cArr[3].name);
REQUIRE(nullptr == cArr[3].value);
}
TEST_CASE("name_value_collection coll ctor", "[collections]")
{
name_value_collection nvc { NV_PAIRS };
std::map<string, string> nvPairs { NV_PAIRS };
const size_t SZ = nvPairs.size();
REQUIRE_FALSE(nvc.empty());
REQUIRE(SZ == nvc.size());
auto cArr = nvc.c_arr();
for (size_t i=0; i<SZ; ++i) {
auto key = string(cArr[i].name);
auto val = string(cArr[i].value);
auto it = nvPairs.find(key);
if (it == nvPairs.end()) {
FAIL("Can't find name/value key");
}
REQUIRE(it->first == key);
REQUIRE(it->second == val);
nvPairs.erase(it);
}
REQUIRE(nvPairs.empty());
}
TEST_CASE("name_value_collection insert", "[collections]")
{
name_value_collection nvc;
std::map<string, string> nvPairs { NV_PAIRS };
for (const auto& nv : nvPairs) {
nvc.insert(nv);
}
const size_t SZ = nvPairs.size();
REQUIRE_FALSE(nvc.empty());
REQUIRE(SZ == nvc.size());
auto cArr = nvc.c_arr();
for (size_t i=0; i<SZ; ++i) {
auto key = string(cArr[i].name);
auto val = string(cArr[i].value);
auto it = nvPairs.find(key);
if (it == nvPairs.end()) {
FAIL("Can't find name/value key");
}
REQUIRE(it->first == key);
REQUIRE(it->second == val);
nvPairs.erase(it);
}
REQUIRE(nvPairs.empty());
}