Home | History | Annotate | Download | only in marisa

Lines Matching refs:key_ids

12   PredictCallback(T key_ids, U keys, std::size_t max_num_results)
13 : key_ids_(key_ids), keys_(keys),
79 UInt32 *key_ids, std::size_t *key_lengths,
84 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
88 UInt32 *key_ids, std::size_t *key_lengths,
93 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
97 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
102 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
106 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
111 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
143 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
147 predict_breadth_first(str, key_ids, keys, max_num_results) :
148 predict_depth_first(str, key_ids, keys, max_num_results);
152 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
156 predict_breadth_first(ptr, length, key_ids, keys, max_num_results) :
157 predict_depth_first(ptr, length, key_ids, keys, max_num_results);
161 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
166 predict_breadth_first(str, key_ids, keys, max_num_results) :
167 predict_depth_first(str, key_ids, keys, max_num_results);
171 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
176 predict_breadth_first(ptr, length, key_ids, keys, max_num_results) :
177 predict_depth_first(ptr, length, key_ids, keys, max_num_results);
181 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
185 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
189 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
193 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
197 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
202 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
206 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
211 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
215 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
219 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
223 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
227 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
231 const char *str, std::vector<UInt32> *key_ids,
236 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
240 const char *ptr, std::size_t length, std::vector<UInt32> *key_ids,
245 MakeContainer(key_ids), MakeContainer(keys), max_num_results);
462 std::size_t Trie::find_(T query, U key_ids, V key_lengths,
472 if (key_ids.is_valid()) {
473 key_ids.insert(count, node_to_key_id(node));
523 std::size_t Trie::predict_breadth_first_(T query, U key_ids, V keys,
539 if (key_ids.is_valid()) {
540 key_ids.insert(count, key_id);
559 if (key_ids.is_valid()) {
562 key_ids.insert(temp_count, key_id);
590 std::size_t Trie::predict_depth_first_(T query, U key_ids, V keys,
595 PredictCallback<U, V> callback(key_ids, keys, max_num_results);
608 if (key_ids.is_valid()) {
609 key_ids.insert(count, node_to_key_id(node));
634 if (key_ids.is_valid()) {
635 key_ids.insert(count, cur.key_id());