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
|
/********************* */
/*! \file map_util_black.h
** \verbatim
** Top contributors (to current version):
** Tim King, Andres Noetzli
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Black box testing of map utility functions.
**
** Black box testing of map utility functions.
**/
#include <cxxtest/TestSuite.h>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include "base/map_util.h"
#include "context/cdhashmap.h"
#include "context/cdhashset.h"
#include "context/cdinsert_hashmap.h"
#include "context/context.h"
using CVC4::ContainsKey;
using CVC4::FindOrDie;
using CVC4::FindOrNull;
using CVC4::context::CDHashMap;
using CVC4::context::CDInsertHashMap;
using CVC4::context::Context;
using std::string;
class MapUtilBlack : public CxxTest::TestSuite
{
public:
void setUp() override {}
void tearDown() override {}
// Returns a map containing {"key"->"value", "other"->"entry"}.
static const std::map<string, string>& DefaultMap()
{
static const std::map<string, string> static_stored_map{{"key", "value"},
{"other", "entry"}};
return static_stored_map;
}
void testMap()
{
std::map<string, string> map = DefaultMap();
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
if (string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
*found_value = "new value";
}
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "new value");
}
void testConstantMap()
{
const std::map<string, string> map = DefaultMap();
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
// Cannot do death tests for FindOrDie.
}
void testUnorderedMap()
{
std::unordered_map<string, string> map(DefaultMap().begin(),
DefaultMap().end());
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
if (string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
*found_value = "new value";
}
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "new value");
}
void testConstUnorderedMap()
{
const std::unordered_map<string, string> map(DefaultMap().begin(),
DefaultMap().end());
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
// Cannot do death tests for FindOrDie.
}
void testSet()
{
std::set<string> set{"entry", "other"};
TS_ASSERT(ContainsKey(set, "entry"));
TS_ASSERT(!ContainsKey(set, "non member"));
const std::set<string> const_set{"entry", "other"};
TS_ASSERT(ContainsKey(const_set, "entry"));
TS_ASSERT(!ContainsKey(const_set, "non member"));
}
void testUnorderedSet()
{
std::unordered_set<string> set{"entry", "other"};
TS_ASSERT(ContainsKey(set, "entry"));
TS_ASSERT(!ContainsKey(set, "non member"));
const std::unordered_set<string> const_set{"entry", "other"};
TS_ASSERT(ContainsKey(const_set, "entry"));
TS_ASSERT(!ContainsKey(const_set, "non member"));
}
// For each <key, value> pair in source, inserts mapping from key to value
// using insert into dest.
template <class M>
void InsertAll(const std::map<string, string>& source, M* dest)
{
for (const auto& key_value : source)
{
dest->insert(key_value.first, key_value.second);
}
}
void testCDHashMap()
{
Context context;
CDHashMap<string, string> map(&context);
InsertAll(DefaultMap(), &map);
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
}
void testConstCDHashMap()
{
Context context;
CDHashMap<string, string> store(&context);
InsertAll(DefaultMap(), &store);
const auto& map = store;
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
}
void testCDInsertHashMap()
{
Context context;
CDInsertHashMap<string, string> map(&context);
InsertAll(DefaultMap(), &map);
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
}
void testConstCDInsertHashMap()
{
Context context;
CDInsertHashMap<string, string> store(&context);
InsertAll(DefaultMap(), &store);
const auto& map = store;
TS_ASSERT(ContainsKey(map, "key"));
TS_ASSERT(!ContainsKey(map, "non key"));
if (const string* found_value = FindOrNull(map, "other"))
{
TS_ASSERT_EQUALS(*found_value, "entry");
}
TS_ASSERT(FindOrNull(map, "non key") == nullptr);
TS_ASSERT_EQUALS(FindOrDie(map, "other"), "entry");
}
}; /* class MapUtilBlack */
|
