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, 1 | MARISA_WITHOUT_TAIL | MARISA_LABEL_ORDER);
91 for (std::size_t i = 0; i < keys.size(); ++i) {
94 ASSERT(trie[keys[i]] == key_ids[i]);
95 ASSERT(trie[key_ids[i]] == keys[i]);
96 ASSERT(key_length == keys[i].length());
97 ASSERT(keys[i] == key_buf);
107 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_WEIGHT_ORDER);
120 for (std::size_t i = 0; i < keys.size(); ++i) {
121 ASSERT(trie[keys[i]] == key_ids[i]);
122 ASSERT(trie[key_ids[i]] == keys[i]);
184 std::vector<std::string> keys;
185 keys.push_back("after");
186 keys.push_back("bar");
187 keys.push_back("car");
188 keys.push_back("caster");
192 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE
201 for (std::size_t i = 0; i < keys.size(); ++i) {
204 ASSERT(trie[keys[i]] == key_ids[i]);
205 ASSERT(trie[key_ids[i]] == keys[i]);
206 ASSERT(key_length == keys[i].length());
207 ASSERT(keys[i] == key_buf);
212 ASSERT(key_length == keys[0].length());
217 ASSERT(key_length == keys[0].length());
221 ASSERT(key_length == keys[0].length());
223 trie.build(keys, &key_ids, 2 | MARISA_PREFIX_TRIE
230 for (std::size_t i = 0; i < keys.size(); ++i) {
233 ASSERT(trie[keys[i]] == key_ids[i]);
234 ASSERT(trie[key_ids[i]] == keys[i]);
235 ASSERT(key_length == keys[i].length());
236 ASSERT(keys[i] == key_buf);
241 ASSERT(key_length == keys[0].length());
246 ASSERT(key_length == keys[0].length());
250 ASSERT(key_length == keys[0].length());
252 trie.build(keys, &key_ids, 2 | MARISA_PREFIX_TRIE
259 for (std::size_t i = 0; i < keys.size(); ++i) {
262 ASSERT(trie[keys[i]] == key_ids[i]);
263 ASSERT(trie[key_ids[i]] == keys[i]);
264 ASSERT(key_length == keys[i].length());
265 ASSERT(keys[i] == key_buf);
278 for (std::size_t i = 0; i < keys.size(); ++i) {
281 ASSERT(trie[keys[i]] == key_ids[i]);
282 ASSERT(trie[key_ids[i]] == keys[i]);
283 ASSERT(key_length == keys[i].length());
284 ASSERT(keys[i] == key_buf);
296 for (std::size_t i = 0; i < keys.size(); ++i) {
299 ASSERT(trie[keys[i]] == key_ids[i]);
300 ASSERT(trie[key_ids[i]] == keys[i]);
301 ASSERT(key_length == keys[i].length());
302 ASSERT(keys[i] == key_buf);
305 trie.build(keys, &key_ids, 3 | MARISA_PREFIX_TRIE
312 for (std::size_t i = 0; i < keys.size(); ++i) {
315 ASSERT(trie[keys[i]] == key_ids[i]);
316 ASSERT(trie[key_ids[i]] == keys[i]);
317 ASSERT(key_length == keys[i].length());
318 ASSERT(keys[i] == key_buf);
409 std::vector<std::string> keys;
410 keys.push_back("bach");
411 keys.push_back("bet");
412 keys.push_back("chat");
413 keys.push_back("check");
414 keys.push_back("check");
418 trie.build(keys, &key_ids, 1);
433 for (std::size_t i = 0; i < keys.size(); ++i) {
436 ASSERT(trie[keys[i]] == key_ids[i]);
437 ASSERT(trie[key_ids[i]] == keys[i]);
438 ASSERT(key_length == keys[i].length());
439 ASSERT(keys[i] == key_buf);
442 trie.build(keys, &key_ids, 2 | MARISA_WITHOUT_TAIL);
448 for (std::size_t i = 0; i < keys.size(); ++i) {
451 ASSERT(trie[keys[i]] == key_ids[i]);
452 ASSERT(trie[key_ids[i]] == keys[i]);
453 ASSERT(key_length == keys[i].length());
454 ASSERT(keys[i] == key_buf);
457 trie.build(keys, &key_ids, 2);
463 for (std::size_t i = 0; i < keys.size(); ++i) {
466 ASSERT(trie[keys[i]] == key_ids[i]);
467 ASSERT(trie[key_ids[i]] == keys[i]);
468 ASSERT(key_length == keys[i].length());
469 ASSERT(keys[i] == key_buf);
472 trie.build(keys, &key_ids, 3 | MARISA_WITHOUT_TAIL);
478 for (std::size_t i = 0; i < keys.size(); ++i) {
481 ASSERT(trie[keys[i]] == key_ids[i]);
482 ASSERT(trie[key_ids[i]] == keys[i]);
483 ASSERT(key_length == keys[i].length());
484 ASSERT(keys[i] == key_buf);
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);
511 std::vector<std::string> keys;
512 keys.push_back("");
516 trie.build(keys, &key_ids);
575 std::vector<std::string> keys;
576 keys.push_back(binary_key);
580 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL);
591 ASSERT(trie[keys[0]] == key_ids[0]);
592 ASSERT(trie[key_ids[0]] == keys[0]);
593 ASSERT(std::string(key_buf, key_length) == keys[0]);
595 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE | MARISA_BINARY_TAIL);
604 ASSERT(trie[keys[0]] == key_ids[0]);
605 ASSERT(trie[key_ids[0]] == keys[0]);
606 ASSERT(std::string(key_buf, key_length) == keys[0]);
608 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE | MARISA_TEXT_TAIL);
617 ASSERT(trie[keys[0]] == key_ids[0]);
618 ASSERT(trie[key_ids[0]] == keys[0]);
619 ASSERT(std::string(key_buf, key_length) == keys[0]);
630 ASSERT(strs[0] == keys[0]);
