Lines Matching defs:keys
34 std::vector<std::string> *keys)
35 : key_ids_(key_ids), keys_(keys) {}
63 std::vector<std::string> keys;
64 trie.build(keys);
69 keys.push_back("apple");
70 keys.push_back("and");
71 keys.push_back("Bad");
72 keys.push_back("apple");
73 keys.push_back("app");
76 trie.build(keys, &key_ids,
92 for (std::size_t i = 0; i < keys.size(); ++i) {
95 ASSERT(trie[keys[i]] == key_ids[i]);
96 ASSERT(trie[key_ids[i]] == keys[i]);
97 ASSERT(key_length == keys[i].length());
98 ASSERT(keys[i] == key_buf);
108 trie.build(keys, &key_ids,
122 for (std::size_t i = 0; i < keys.size(); ++i) {
123 ASSERT(trie[keys[i]] == key_ids[i]);
124 ASSERT(trie[key_ids[i]] == keys[i]);
186 std::vector<std::string> keys;
187 keys.push_back("after");
188 keys.push_back("bar");
189 keys.push_back("car");
190 keys.push_back("caster");
194 trie.build(keys, &key_ids, 1 | MARISA_ALPHA_PREFIX_TRIE
203 for (std::size_t i = 0; i < keys.size(); ++i) {
206 ASSERT(trie[keys[i]] == key_ids[i]);
207 ASSERT(trie[key_ids[i]] == keys[i]);
208 ASSERT(key_length == keys[i].length());
209 ASSERT(keys[i] == key_buf);
214 ASSERT(key_length == keys[0].length());
219 ASSERT(key_length == keys[0].length());
223 ASSERT(key_length == keys[0].length());
225 trie.build(keys, &key_ids, 2 | MARISA_ALPHA_PREFIX_TRIE
232 for (std::size_t i = 0; i < keys.size(); ++i) {
235 ASSERT(trie[keys[i]] == key_ids[i]);
236 ASSERT(trie[key_ids[i]] == keys[i]);
237 ASSERT(key_length == keys[i].length());
238 ASSERT(keys[i] == key_buf);
243 ASSERT(key_length == keys[0].length());
248 ASSERT(key_length == keys[0].length());
252 ASSERT(key_length == keys[0].length());
254 trie.build(keys, &key_ids, 2 | MARISA_ALPHA_PREFIX_TRIE
261 for (std::size_t i = 0; i < keys.size(); ++i) {
264 ASSERT(trie[keys[i]] == key_ids[i]);
265 ASSERT(trie[key_ids[i]] == keys[i]);
266 ASSERT(key_length == keys[i].length());
267 ASSERT(keys[i] == key_buf);
280 for (std::size_t i = 0; i < keys.size(); ++i) {
283 ASSERT(trie[keys[i]] == key_ids[i]);
284 ASSERT(trie[key_ids[i]] == keys[i]);
285 ASSERT(key_length == keys[i].length());
286 ASSERT(keys[i] == key_buf);
298 for (std::size_t i = 0; i < keys.size(); ++i) {
301 ASSERT(trie[keys[i]] == key_ids[i]);
302 ASSERT(trie[key_ids[i]] == keys[i]);
303 ASSERT(key_length == keys[i].length());
304 ASSERT(keys[i] == key_buf);
307 trie.build(keys, &key_ids, 3 | MARISA_ALPHA_PREFIX_TRIE
314 for (std::size_t i = 0; i < keys.size(); ++i) {
317 ASSERT(trie[keys[i]] == key_ids[i]);
318 ASSERT(trie[key_ids[i]] == keys[i]);
319 ASSERT(key_length == keys[i].length());
320 ASSERT(keys[i] == key_buf);
412 for (std::size_t i = 0; i < keys.size(); ++i) {
415 ASSERT(trie[keys[i]] == key_ids[i]);
416 ASSERT(trie[key_ids[i]] == keys[i]);
417 ASSERT(key_length == keys[i].length());
418 ASSERT(keys[i] == key_buf);
427 std::vector<std::string> keys;
428 keys.push_back("bach");
429 keys.push_back("bet");
430 keys.push_back("chat");
431 keys.push_back("check");
432 keys.push_back("check");
436 trie.build(keys, &key_ids, 1);
451 for (std::size_t i = 0; i < keys.size(); ++i) {
454 ASSERT(trie[keys[i]] == key_ids[i]);
455 ASSERT(trie[key_ids[i]] == keys[i]);
456 ASSERT(key_length == keys[i].length());
457 ASSERT(keys[i] == key_buf);
460 trie.build(keys, &key_ids, 2 | MARISA_ALPHA_WITHOUT_TAIL);
466 for (std::size_t i = 0; i < keys.size(); ++i) {
469 ASSERT(trie[keys[i]] == key_ids[i]);
470 ASSERT(trie[key_ids[i]] == keys[i]);
471 ASSERT(key_length == keys[i].length());
472 ASSERT(keys[i] == key_buf);
475 trie.build(keys, &key_ids, 2);
481 for (std::size_t i = 0; i < keys.size(); ++i) {
484 ASSERT(trie[keys[i]] == key_ids[i]);
485 ASSERT(trie[key_ids[i]] == keys[i]);
486 ASSERT(key_length == keys[i].length());
487 ASSERT(keys[i] == key_buf);
490 trie.build(keys, &key_ids, 3 | MARISA_ALPHA_WITHOUT_TAIL);
496 for (std::size_t i = 0; i < keys.size(); ++i) {
499 ASSERT(trie[keys[i]] == key_ids[i]);
500 ASSERT(trie[key_ids[i]] == keys[i]);
501 ASSERT(key_length == keys[i].length());
502 ASSERT(keys[i] == key_buf);
514 for (std::size_t i = 0; i < keys.size(); ++i) {
517 ASSERT(trie[keys[i]] == key_ids[i]);
518 ASSERT(trie[key_ids[i]] == keys[i]);
519 ASSERT(key_length == keys[i].length());
520 ASSERT(keys[i] == key_buf);
529 std::vector<std::string> keys;
530 keys.push_back("");
534 trie.build(keys, &key_ids);
593 keys;
594 keys.push_back(binary_key);
598 trie.build(keys, &key_ids, 1 | MARISA_ALPHA_WITHOUT_TAIL);
609 ASSERT(trie[keys[0]] == key_ids[0]);
610 ASSERT(trie[key_ids[0]] == keys[0]);
611 ASSERT(std::string(key_buf, key_length) == keys[0]);
613 trie.build(keys, &key_ids,
623 ASSERT(trie[keys[0]] == key_ids[0]);
624 ASSERT(trie[key_ids[0]] == keys[0]);
625 ASSERT(std::string(key_buf, key_length) == keys[0]);
627 trie.build(keys, &key_ids,
637 ASSERT(trie[keys[0]] == key_ids[0]);
638 ASSERT(trie[key_ids[0]] == keys[0]);
639 ASSERT(std::string(key_buf, key_length) == keys[0]);
650 ASSERT(strs[0] == keys[0]);
