174     marisa::Trie *trie, std::vector<marisa::UInt32> *key_ids) {  in benchmark_build()  argument
176   trie->build(keys, key_ids, num_tries  in benchmark_build()
185     const std::vector<marisa::UInt32> &key_ids) {  in benchmark_restore()  argument
188   for (std::size_t i = 0; i < key_ids.size(); ++i) {  in benchmark_restore()
190     trie.restore(key_ids[i], &key);  in benchmark_restore()
196   print_time_info(key_ids.size(), cl.elasped());  in benchmark_restore()
201     const std::vector<marisa::UInt32> &key_ids) {  in benchmark_lookup()  argument
205     if (key_id != key_ids[i]) {  in benchmark_lookup()
215     const std::vector<marisa::UInt32> &key_ids) {  in benchmark_find()  argument
221     if ((num_keys == 0) || (found_key_ids.back() != key_ids[i])) {  in benchmark_find()
231     const std::vector<marisa::UInt32> &key_ids) {  in benchmark_predict_breadth_first()  argument
242     if ((num_keys == 0) || (found_key_ids.front() != key_ids[i])) {  in benchmark_predict_breadth_first()
252     const std::vector<marisa::UInt32> &key_ids) {  in benchmark_predict_depth_first()  argument
263     if ((num_keys == 0) || (found_key_ids.front() != key_ids[i])) {  in benchmark_predict_depth_first()
274   std::vector<marisa::UInt32> key_ids;  in benchmark()  local
275   benchmark_build(keys, num_tries, &trie, &key_ids);  in benchmark()
277     benchmark_restore(trie, keys, key_ids);  in benchmark()
278     benchmark_lookup(trie, keys, key_ids);  in benchmark()
279     benchmark_find(trie, keys, key_ids);  in benchmark()
280     benchmark_predict_breadth_first(trie, keys, key_ids);  in benchmark()
281     benchmark_predict_depth_first(trie, keys, key_ids);  in benchmark()