File: key_value_container_t.cpp

package info (click to toggle)
openorienteering-mapper 0.9.6-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 67,132 kB
  • sloc: cpp: 114,710; ansic: 1,455; sh: 430; java: 240; xml: 140; sed: 64; makefile: 28
file content (169 lines) | stat: -rw-r--r-- 5,536 bytes parent folder | download | duplicates (4)
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
/*
 *    Copyright 2020 Kai Pastor
 *
 *    This file is part of OpenOrienteering.
 *
 *    OpenOrienteering is free software: you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation, either version 3 of the License, or
 *    (at your option) any later version.
 *
 *    OpenOrienteering is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with OpenOrienteering.  If not, see <http://www.gnu.org/licenses/>.
 */


#include <algorithm>
#include <iterator>
#include <stdexcept>
#include <utility>
#include <vector>

#include <Qt>
#include <QtTest>
#include <QObject>
#include <QString>

#include "util/key_value_container.h"

using namespace OpenOrienteering;

#define QSL(str) QStringLiteral(str)

/**
 * @test Tests printing and export features
 */
class KeyValueContainterTest : public QObject
{
Q_OBJECT
	
private slots:
	void keyValueTest()
	{
		QVERIFY((KeyValue{QSL("ak"), QSL("aa")} == KeyValue{QSL("ak"), QSL("aa")}));
		QVERIFY((KeyValue{QSL("BK"), QSL("aa")} != KeyValue{QSL("ak"), QSL("aa")}));
		QVERIFY((KeyValue{QSL("ak"), QSL("BB")} != KeyValue{QSL("ak"), QSL("aa")}));
		QVERIFY((KeyValue{QSL("ak"), QSL("aa")} != KeyValue{QSL("BK"), QSL("aa")}));
		QVERIFY((KeyValue{QSL("ak"), QSL("aa")} != KeyValue{QSL("ak"), QSL("BB")}));
	}
	
	void emptyContainerTest()
	{
		auto container = KeyValueContainer();
		QVERIFY(container.empty());
		QCOMPARE(int(container.size()), 0);
	}
	
	void crudTest_data()
	{
		QTest::addColumn<QString>("key");
		QTest::addColumn<QString>("value");
		QTest::newRow("null key")  << QString{} << QSL("null");
		QTest::newRow("empty key") << QSL("")   << QSL("empty");  // clazy:exclude=empty-qstringliteral
		QTest::newRow("bk")        << QSL("bk") << QSL("bb");
	}
	
	void crudTest()
	{
		QFETCH(QString, key);
		QFETCH(QString, value);
		
		auto container = KeyValueContainer{};
		QVERIFY(container.find(key) == end(container));
		QVERIFY(!container.contains(key));
		QVERIFY_EXCEPTION_THROWN(container.at(key), std::out_of_range);
		
		// operator[]
		QVERIFY(container[key].isEmpty());
		QVERIFY(container.find(key) != container.end());
		QVERIFY(container.contains(key));
		QVERIFY(container.at(key).isEmpty());
		
		container[key] = value;
		QVERIFY(container.find(key) != container.end());
		QCOMPARE(*container.find(key), (KeyValue{key, value}));
		QVERIFY(container.contains(key));
		QCOMPARE(container.at(key), value);
		QCOMPARE(container[key], value);
		
		// contains()
		QVERIFY(container.contains(key));
		auto const key_uc = key.toUpper();
		if (key.compare(key_uc, Qt::CaseSensitive) != 0)
			QVERIFY(!container.contains(key_uc));
		
		// erase()
		container.erase(container.find(key));
		QVERIFY(container.find(key) == container.end());
		QVERIFY(!container.contains(key));
		QVERIFY_EXCEPTION_THROWN(container.at(key), std::out_of_range);
		
		// Order-preserving
		auto kv_a = KeyValue{QSL("ak"), QSL("aa")};
		auto kv_c = KeyValue{QSL("ck"), QSL("cc")};
		
		QVERIFY(container.empty());
		auto const result_a = container.insert(kv_a);
		QCOMPARE(*result_a.first, kv_a);
		QCOMPARE(result_a.second, true);
		auto const result_key = container.insert_or_assign(key, value);
		QCOMPARE(result_key.first->key, key);
		QCOMPARE(result_key.first->value, value);
		QCOMPARE(result_key.second, true);
		container.insert(kv_c);
		QCOMPARE(container.front(), kv_a);
		QCOMPARE(container.at(key), value);
		QCOMPARE(container.back(), kv_c);
		
		auto container2 = KeyValueContainer{};
		QVERIFY(container2.empty());
		container2.insert(kv_c);
		container2.insert(kv_a);
		container2.insert_or_assign(container2.begin(), key, value);
		QCOMPARE(container2.front(), (KeyValue{key, value}));
		QCOMPARE(container2.at(kv_c.key), kv_c.value);
		QCOMPARE(container2.back(), kv_a);
		
		// Comparing containers
		QVERIFY(container2 != container);
		QVERIFY(std::is_permutation(begin(container2), end(container2), begin(container), end(container)));
		
		// insert() and insert_or_assign(), existing vs. new key
		auto const old_size = container.size();
		
		auto const result_insert = container.insert({key, QSL("new value")});
		QCOMPARE(result_insert.second, false);
		QCOMPARE(container[key], value);
		QCOMPARE(container.size(), old_size);
		
		auto const result_insert_or_assign = container.insert_or_assign(key, QSL("new value"));
		QCOMPARE(result_insert_or_assign.second, false);
		QCOMPARE(container[key], QSL("new value"));
		QCOMPARE(container.size(), old_size);
		
		container[key] = value;
		QCOMPARE(container.at(key), value);
		QCOMPARE(container.size(), old_size);
		
		auto const result_insert_2 = container.insert({QSL("insert_2"), QSL("new value")});
		QCOMPARE(result_insert_2.second, true);
		QCOMPARE(container[result_insert_2.first->key], QSL("new value"));
		QCOMPARE(container.size(), old_size + 1);
		
		auto const result_insert_or_assign_2 = container.insert_or_assign(QSL("insert_or_assign_2"), QSL("new value"));
		QCOMPARE(result_insert_or_assign_2.second, true);
		QCOMPARE(container[result_insert_or_assign_2.first->key], QSL("new value"));
		QCOMPARE(container.size(), old_size + 2);
	}
	
};



QTEST_GUILESS_MAIN(KeyValueContainterTest)
#include "key_value_container_t.moc"  // IWYU pragma: keep