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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// SPDX-FileCopyrightText: 2024 - 2025 Kohei Yoshida
//
// SPDX-License-Identifier: MIT
#include "test_main.hpp"
#include <type_traits>
#define _TEST_FUNC_SCOPE MDDS_TEST_FUNC_SCOPE_NS("trie_test_move_value")
namespace trie_test_move_value {
namespace {
struct move_value
{
std::string value;
move_value() = default;
move_value(std::string v) : value(std::move(v))
{}
move_value(const move_value&) = delete;
move_value(move_value&&) = default;
move_value& operator=(const move_value&) = delete;
move_value& operator=(move_value&&) = default;
bool operator==(const move_value& other) const
{
return value == other.value;
}
};
static_assert(!std::is_copy_constructible_v<move_value>);
static_assert(std::is_move_constructible_v<move_value>);
using map_type = mdds::trie_map<std::string, move_value>;
void test_basic()
{
_TEST_FUNC_SCOPE;
map_type store;
store.insert("test", move_value("one"));
store.insert("test", move_value("two")); // overwrite
{
auto results = store.prefix_search("te");
auto it = results.begin();
TEST_ASSERT(it != results.end());
TEST_ASSERT(it->second.value == "two");
TEST_ASSERT(++it == results.end());
}
{
auto it = store.find("test");
TEST_ASSERT(it != store.end());
TEST_ASSERT(it->second.value == "two");
TEST_ASSERT(++it == store.end());
}
auto packed = store.pack();
{
auto results = packed.prefix_search("te");
auto it = results.begin();
TEST_ASSERT(it != results.end());
TEST_ASSERT(it->second.value == "two");
TEST_ASSERT(++it == results.end());
}
{
auto it = packed.find("test");
TEST_ASSERT(it != packed.end());
TEST_ASSERT(it->second.value == "two");
TEST_ASSERT(++it == packed.end());
}
}
void test_node_traversal()
{
_TEST_FUNC_SCOPE;
map_type store;
store.insert("one", move_value("one"));
store.insert("two", move_value("two"));
{
auto node = store.root_node();
TEST_ASSERT(node.valid());
node = node.child('o');
TEST_ASSERT(node.valid());
node = node.child('n');
TEST_ASSERT(node.valid());
node = node.child('e');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value().value == "one");
node = store.root_node();
TEST_ASSERT(node.valid());
node = node.child('t');
TEST_ASSERT(node.valid());
node = node.child('w');
TEST_ASSERT(node.valid());
node = node.child('o');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value().value == "two");
}
auto packed = store.pack();
{
auto node = packed.root_node();
TEST_ASSERT(node.valid());
node = node.child('o');
TEST_ASSERT(node.valid());
node = node.child('n');
TEST_ASSERT(node.valid());
node = node.child('e');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value().value == "one");
node = packed.root_node();
TEST_ASSERT(node.valid());
node = node.child('t');
TEST_ASSERT(node.valid());
node = node.child('w');
TEST_ASSERT(node.valid());
node = node.child('o');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value().value == "two");
}
}
void test_equality()
{
_TEST_FUNC_SCOPE;
map_type store1, store2;
store1.insert("one", move_value("one"));
store1.insert("two", move_value("two"));
store2.insert("one", move_value("one"));
store2.insert("two", move_value("two"));
// TODO: implement operator== for trie_map
// TEST_ASSERT(store1 == store2);
auto packed1 = store1.pack();
auto packed2 = store2.pack();
TEST_ASSERT(packed1 == packed2);
}
void test_non_equality()
{
_TEST_FUNC_SCOPE;
map_type store1, store2;
store1.insert("one", move_value("one"));
store1.insert("two", move_value("two"));
store2.insert("one", move_value("1"));
store2.insert("two", move_value("2"));
// TODO: implement operator!= for trie_map
// TEST_ASSERT(store1 != store2);
auto packed1 = store1.pack();
auto packed2 = store2.pack();
TEST_ASSERT(packed1 != packed2);
}
void test_move_construction()
{
_TEST_FUNC_SCOPE;
map_type store;
store.insert("one", move_value("one"));
store.insert("two", move_value("two"));
map_type moved(std::move(store));
{
auto it = moved.find("one");
TEST_ASSERT(it != moved.end());
TEST_ASSERT(it->second.value == "one");
it = moved.find("two");
TEST_ASSERT(it != moved.end());
TEST_ASSERT(it->second.value == "two");
}
auto packed = moved.pack();
decltype(packed) packed_moved(std::move(packed));
{
auto it = packed_moved.find("one");
TEST_ASSERT(it != packed_moved.end());
TEST_ASSERT(it->second.value == "one");
it = packed_moved.find("two");
TEST_ASSERT(it != packed_moved.end());
TEST_ASSERT(it->second.value == "two");
}
}
} // anonymous namespace
void run()
{
test_basic();
test_node_traversal();
test_equality();
test_non_equality();
test_move_construction();
}
} // namespace trie_test_move_value
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
