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
|
/* SPDX-License-Identifier: MPL-2.0 */
#include "../tests/testutil.hpp"
#include <radix_tree.hpp>
#include <stdint.hpp>
#include <set>
#include <string>
#include <string.h>
#include <unity.h>
#include <vector>
void setUp ()
{
}
void tearDown ()
{
}
bool tree_add (zmq::radix_tree_t &tree_, const std::string &key_)
{
return tree_.add (reinterpret_cast<const unsigned char *> (key_.data ()),
key_.size ());
}
bool tree_rm (zmq::radix_tree_t &tree_, const std::string &key_)
{
return tree_.rm (reinterpret_cast<const unsigned char *> (key_.data ()),
key_.size ());
}
bool tree_check (zmq::radix_tree_t &tree_, const std::string &key_)
{
return tree_.check (reinterpret_cast<const unsigned char *> (key_.data ()),
key_.size ());
}
void test_empty ()
{
zmq::radix_tree_t tree;
TEST_ASSERT_TRUE (tree.size () == 0);
}
void test_add_single_entry ()
{
zmq::radix_tree_t tree;
TEST_ASSERT_TRUE (tree_add (tree, "foo"));
}
void test_add_same_entry_twice ()
{
zmq::radix_tree_t tree;
TEST_ASSERT_TRUE (tree_add (tree, "test"));
TEST_ASSERT_FALSE (tree_add (tree, "test"));
}
void test_rm_when_empty ()
{
zmq::radix_tree_t tree;
TEST_ASSERT_FALSE (tree_rm (tree, "test"));
}
void test_rm_single_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "temporary");
TEST_ASSERT_TRUE (tree_rm (tree, "temporary"));
}
void test_rm_unique_entry_twice ()
{
zmq::radix_tree_t tree;
tree_add (tree, "test");
TEST_ASSERT_TRUE (tree_rm (tree, "test"));
TEST_ASSERT_FALSE (tree_rm (tree, "test"));
}
void test_rm_duplicate_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "test");
tree_add (tree, "test");
TEST_ASSERT_FALSE (tree_rm (tree, "test"));
TEST_ASSERT_TRUE (tree_rm (tree, "test"));
}
void test_rm_common_prefix ()
{
zmq::radix_tree_t tree;
tree_add (tree, "checkpoint");
tree_add (tree, "checklist");
TEST_ASSERT_FALSE (tree_rm (tree, "check"));
}
void test_rm_common_prefix_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "checkpoint");
tree_add (tree, "checklist");
tree_add (tree, "check");
TEST_ASSERT_TRUE (tree_rm (tree, "check"));
}
void test_rm_null_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "");
TEST_ASSERT_TRUE (tree_rm (tree, ""));
}
void test_check_empty ()
{
zmq::radix_tree_t tree;
TEST_ASSERT_FALSE (tree_check (tree, "foo"));
}
void test_check_added_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "entry");
TEST_ASSERT_TRUE (tree_check (tree, "entry"));
}
void test_check_common_prefix ()
{
zmq::radix_tree_t tree;
tree_add (tree, "introduce");
tree_add (tree, "introspect");
TEST_ASSERT_FALSE (tree_check (tree, "intro"));
}
void test_check_prefix ()
{
zmq::radix_tree_t tree;
tree_add (tree, "toasted");
TEST_ASSERT_FALSE (tree_check (tree, "toast"));
TEST_ASSERT_FALSE (tree_check (tree, "toaste"));
TEST_ASSERT_FALSE (tree_check (tree, "toaster"));
}
void test_check_nonexistent_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "red");
TEST_ASSERT_FALSE (tree_check (tree, "blue"));
}
void test_check_query_longer_than_entry ()
{
zmq::radix_tree_t tree;
tree_add (tree, "foo");
TEST_ASSERT_TRUE (tree_check (tree, "foobar"));
}
void test_check_null_entry_added ()
{
zmq::radix_tree_t tree;
tree_add (tree, "");
TEST_ASSERT_TRUE (tree_check (tree, "all queries return true"));
}
void test_size ()
{
zmq::radix_tree_t tree;
// Adapted from the example on wikipedia.
std::vector<std::string> keys;
keys.push_back ("tester");
keys.push_back ("water");
keys.push_back ("slow");
keys.push_back ("slower");
keys.push_back ("test");
keys.push_back ("team");
keys.push_back ("toast");
for (size_t i = 0; i < keys.size (); ++i)
TEST_ASSERT_TRUE (tree_add (tree, keys[i]));
TEST_ASSERT_TRUE (tree.size () == keys.size ());
for (size_t i = 0; i < keys.size (); ++i)
TEST_ASSERT_FALSE (tree_add (tree, keys[i]));
TEST_ASSERT_TRUE (tree.size () == 2 * keys.size ());
for (size_t i = 0; i < keys.size (); ++i)
TEST_ASSERT_FALSE (tree_rm (tree, keys[i]));
TEST_ASSERT_TRUE (tree.size () == keys.size ());
for (size_t i = 0; i < keys.size (); ++i)
TEST_ASSERT_TRUE (tree_rm (tree, keys[i]));
TEST_ASSERT_TRUE (tree.size () == 0);
}
void return_key (unsigned char *data_, size_t size_, void *arg_)
{
std::vector<std::string> *vec =
reinterpret_cast<std::vector<std::string> *> (arg_);
std::string key;
for (size_t i = 0; i < size_; ++i)
key.push_back (static_cast<char> (data_[i]));
vec->push_back (key);
}
void test_apply ()
{
zmq::radix_tree_t tree;
std::set<std::string> keys;
keys.insert ("tester");
keys.insert ("water");
keys.insert ("slow");
keys.insert ("slower");
keys.insert ("test");
keys.insert ("team");
keys.insert ("toast");
const std::set<std::string>::iterator end = keys.end ();
for (std::set<std::string>::iterator it = keys.begin (); it != end; ++it)
tree_add (tree, *it);
std::vector<std::string> *vec = new std::vector<std::string> ();
tree.apply (return_key, static_cast<void *> (vec));
for (size_t i = 0; i < vec->size (); ++i)
TEST_ASSERT_TRUE (keys.count ((*vec)[i]) > 0);
delete vec;
}
int main (void)
{
setup_test_environment ();
UNITY_BEGIN ();
RUN_TEST (test_empty);
RUN_TEST (test_add_single_entry);
RUN_TEST (test_add_same_entry_twice);
RUN_TEST (test_rm_when_empty);
RUN_TEST (test_rm_single_entry);
RUN_TEST (test_rm_unique_entry_twice);
RUN_TEST (test_rm_duplicate_entry);
RUN_TEST (test_rm_common_prefix);
RUN_TEST (test_rm_common_prefix_entry);
RUN_TEST (test_rm_null_entry);
RUN_TEST (test_check_empty);
RUN_TEST (test_check_added_entry);
RUN_TEST (test_check_common_prefix);
RUN_TEST (test_check_prefix);
RUN_TEST (test_check_nonexistent_entry);
RUN_TEST (test_check_query_longer_than_entry);
RUN_TEST (test_check_null_entry_added);
RUN_TEST (test_size);
RUN_TEST (test_apply);
return UNITY_END ();
}
|