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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* Copyright (c) 2024 Kohei Yoshida
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
************************************************************************/
#include "test_main.hpp"
#define _TEST_FUNC_SCOPE MDDS_TEST_FUNC_SCOPE_NS("trie_test_node")
namespace trie_test_node {
namespace {
using map_type = mdds::trie_map<std::string, int>;
using mdds::trie::dump_structure_type;
void test_empty()
{
_TEST_FUNC_SCOPE;
{
map_type::const_node_type node; // default constructor
TEST_ASSERT(!node.valid());
TEST_ASSERT(!node.has_child());
TEST_ASSERT(!node.has_value());
TEST_ASSERT(!node.child('c').valid());
}
{
map_type::packed_type::const_node_type node; // default constructor
TEST_ASSERT(!node.valid());
TEST_ASSERT(!node.has_child());
TEST_ASSERT(!node.has_value());
TEST_ASSERT(!node.child('c').valid());
}
auto verify = [](std::string_view name, const auto& trie) {
std::cout << "trie type: " << name << std::endl;
auto node = trie.root_node();
TEST_ASSERT(node.valid());
TEST_ASSERT(!node.has_child());
TEST_ASSERT(!node.has_value());
TEST_ASSERT(!node.child('d').valid());
};
map_type original;
verify("original", original);
auto packed = original.pack();
verify("packed", packed);
std::cout << packed.dump_structure(dump_structure_type::packed_buffer) << std::endl;
std::cout << packed.dump_structure(dump_structure_type::trie_traversal) << std::endl;
}
void test_basic()
{
_TEST_FUNC_SCOPE;
auto verify = [](std::string_view name, const auto& trie) {
std::cout << "trie type: " << name << std::endl;
auto node = trie.root_node();
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_child());
TEST_ASSERT(!node.has_value());
node = node.child('t');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_child());
TEST_ASSERT(!node.has_value());
node = node.child('e');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_child());
TEST_ASSERT(!node.has_value());
node = node.child('s');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_child());
TEST_ASSERT(!node.has_value());
node = node.child('t');
TEST_ASSERT(node.valid());
TEST_ASSERT(!node.has_child());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value() == 42);
// no more child nodes
TEST_ASSERT(!node.child('f').valid());
};
map_type original;
original.insert("test", 42);
verify("original", original);
auto packed = original.pack();
verify("packed", packed);
std::cout << packed.dump_structure(dump_structure_type::packed_buffer) << std::endl;
std::cout << packed.dump_structure(dump_structure_type::trie_traversal) << std::endl;
}
void test_26_child_nodes()
{
_TEST_FUNC_SCOPE;
auto verify = [](std::string_view name, const auto& trie) {
std::cout << "trie type: " << name << std::endl;
auto node = trie.root_node();
TEST_ASSERT(node.valid());
TEST_ASSERT(!node.has_value());
TEST_ASSERT(node.has_child());
for (char c = 'a'; c <= 'z'; ++c)
{
auto child = node.child(c);
TEST_ASSERT(child.valid());
TEST_ASSERT(child.has_value());
TEST_ASSERT(child.value() == int(c - 'a'));
std::cout << "- char='" << c << "'; value=" << child.value() << std::endl;
}
};
map_type original;
for (char c = 'a'; c <= 'z'; ++c)
original.insert(std::string{c}, int(c - 'a'));
verify("original", original);
auto packed = original.pack();
verify("packed", packed);
std::cout << packed.dump_structure(dump_structure_type::packed_buffer) << std::endl;
std::cout << packed.dump_structure(dump_structure_type::trie_traversal) << std::endl;
}
void test_packed_nodes()
{
_TEST_FUNC_SCOPE;
using _map_type = mdds::packed_trie_map<std::string, bool>;
// Keys must be sorted.
const _map_type::entry entries[] = {
{MDDS_ASCII("DIV/0!"), true}, {MDDS_ASCII("N/A"), true}, {MDDS_ASCII("NAME?"), true},
{MDDS_ASCII("NULL!"), true}, {MDDS_ASCII("NUM!"), true}, {MDDS_ASCII("REF!"), true},
{MDDS_ASCII("VALUE!"), true},
};
_map_type errors(entries, std::size(entries));
auto it = errors.find("REF!");
TEST_ASSERT(it != errors.end());
TEST_ASSERT(it->second == true);
auto node = errors.root_node();
TEST_ASSERT(node.valid());
node = node.child('R');
TEST_ASSERT(node.valid());
node = node.child('E');
TEST_ASSERT(node.valid());
node = node.child('F');
TEST_ASSERT(node.valid());
node = node.child('!');
TEST_ASSERT(node.valid());
TEST_ASSERT(node.has_value());
TEST_ASSERT(node.value() == true);
}
} // anonymous namespace
void run()
{
test_empty();
test_basic();
test_26_child_nodes();
test_packed_nodes();
}
} // namespace trie_test_node
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
