Lines Matching refs:keys
34 std::vector<std::string> *keys) in PredictCallback() argument
35 : key_ids_(key_ids), keys_(keys) {} in PredictCallback()
63 std::vector<std::string> keys; in TestTrie() local
64 trie.build(keys); in TestTrie()
69 keys.push_back("apple"); in TestTrie()
70 keys.push_back("and"); in TestTrie()
71 keys.push_back("Bad"); in TestTrie()
72 keys.push_back("apple"); in TestTrie()
73 keys.push_back("app"); in TestTrie()
76 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_LABEL_ORDER); in TestTrie()
91 for (std::size_t i = 0; i < keys.size(); ++i) { in TestTrie()
94 ASSERT(trie[keys[i]] == key_ids[i]); in TestTrie()
95 ASSERT(trie[key_ids[i]] == keys[i]); in TestTrie()
96 ASSERT(key_length == keys[i].length()); in TestTrie()
97 ASSERT(keys[i] == key_buf); in TestTrie()
107 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_WEIGHT_ORDER); in TestTrie()
120 for (std::size_t i = 0; i < keys.size(); ++i) { in TestTrie()
121 ASSERT(trie[keys[i]] == key_ids[i]); in TestTrie()
122 ASSERT(trie[key_ids[i]] == keys[i]); in TestTrie()
184 std::vector<std::string> keys; in TestPrefixTrie() local
185 keys.push_back("after"); in TestPrefixTrie()
186 keys.push_back("bar"); in TestPrefixTrie()
187 keys.push_back("car"); in TestPrefixTrie()
188 keys.push_back("caster"); in TestPrefixTrie()
192 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE in TestPrefixTrie()
201 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
204 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
205 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
206 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
207 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
212 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
217 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
221 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
223 trie.build(keys, &key_ids, 2 | MARISA_PREFIX_TRIE in TestPrefixTrie()
230 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
233 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
234 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
235 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
236 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
241 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
246 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
250 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
252 trie.build(keys, &key_ids, 2 | MARISA_PREFIX_TRIE in TestPrefixTrie()
259 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
262 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
263 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
264 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
265 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
278 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
281 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
282 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
283 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
284 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
296 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
299 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
300 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
301 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
302 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
305 trie.build(keys, &key_ids, 3 | MARISA_PREFIX_TRIE in TestPrefixTrie()
312 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPrefixTrie()
315 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
316 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
317 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
318 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
409 std::vector<std::string> keys; in TestPatriciaTrie() local
410 keys.push_back("bach"); in TestPatriciaTrie()
411 keys.push_back("bet"); in TestPatriciaTrie()
412 keys.push_back("chat"); in TestPatriciaTrie()
413 keys.push_back("check"); in TestPatriciaTrie()
414 keys.push_back("check"); in TestPatriciaTrie()
418 trie.build(keys, &key_ids, 1); in TestPatriciaTrie()
433 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPatriciaTrie()
436 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
437 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
438 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
439 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
442 trie.build(keys, &key_ids, 2 | MARISA_WITHOUT_TAIL); in TestPatriciaTrie()
448 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPatriciaTrie()
451 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
452 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
453 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
454 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
457 trie.build(keys, &key_ids, 2); in TestPatriciaTrie()
463 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPatriciaTrie()
466 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
467 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
468 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
469 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
472 trie.build(keys, &key_ids, 3 | MARISA_WITHOUT_TAIL); in TestPatriciaTrie()
478 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPatriciaTrie()
481 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
482 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
483 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
484 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
496 for (std::size_t i = 0; i < keys.size(); ++i) { in TestPatriciaTrie()
499 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
500 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
501 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
502 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
511 std::vector<std::string> keys; in TestEmptyString() local
512 keys.push_back(""); in TestEmptyString()
516 trie.build(keys, &key_ids); in TestEmptyString()
575 std::vector<std::string> keys; in TestBinaryKey() local
576 keys.push_back(binary_key); in TestBinaryKey()
580 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL); in TestBinaryKey()
591 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
592 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
593 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
595 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE | MARISA_BINARY_TAIL); in TestBinaryKey()
604 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
605 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
606 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
608 trie.build(keys, &key_ids, 1 | MARISA_PREFIX_TRIE | MARISA_TEXT_TAIL); in TestBinaryKey()
617 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
618 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
619 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
630 ASSERT(strs[0] == keys[0]); in TestBinaryKey()