• Home
  • Raw
  • Download

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