Lines Matching full:keys
88 @@ -63,15 +63,9 @@ void Trie::build_trie(Vector<Key<String> > &keys,
89 build_trie(keys, static_cast<UInt32 *>(NULL), flags);
93 - std::vector<UInt32> temp_key_ids(keys.size());
94 - build_trie(keys, temp_key_ids.empty() ? NULL : &temp_key_ids[0], flags);
101 + std::vector<UInt32> temp_key_ids(keys.size());
102 + build_trie(keys, temp_key_ids.empty() ? NULL : &temp_key_ids[0], flags);
106 void Trie::build_trie(Vector<Key<String> > &keys,
107 @@ -168,7 +162,7 @@ void Trie::build_trie(Vector<Key<T> > &keys,
110 void Trie::build_cur(Vector<Key<T> > &keys,
113 num_keys_ = sort_keys(keys);
116 @@ -261,10 +255,6 @@ void Trie::build_cur(Vector<Key<T> > &keys,
118 build_terminals(keys, terminals);
119 keys.swap(&rest_keys);
126 void Trie::build_next(Vector<Key<String> > &keys,
133 marisa_status marisa_build(marisa_trie *h, const char * const *keys,
140 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
469 std::size_t Trie::predict_breadth_first_(T query, U key_ids, V keys,
475 @@ -596,15 +584,11 @@ std::size_t Trie::predict_breadth_first_(T query, U key_ids, V keys,
486 std::size_t Trie::predict_depth_first_(T query, U key_ids, V keys,
491 } else if (keys.is_valid()) {
492 @@ -665,10 +649,6 @@ std::size_t Trie::predict_depth_first_(T query, U key_ids, V keys,
