Lines Matching defs:keys
59 " -S, --print-speed print speed [1000 keys/s] (default)\n"
129 void read_keys(std::istream *input, std::vector<Key> *keys) {
146 keys->push_back(key);
151 std::vector<Key> *keys) {
153 read_keys(&std::cin, keys);
162 read_keys(&input_file, keys);
164 std::cout << "#keys: " << keys->size() << std::endl;
166 for (std::size_t i = 0; i < keys->size(); ++i) {
167 total_length += (*keys)[i].first.length();
173 void benchmark_build(const std::vector<Key> &keys, int num_tries,
176 trie->build(keys, key_ids, num_tries
180 print_time_info(keys.size(), cl.elasped());
184 const std::vector<Key> &keys,
191 if (key != keys[i].first) {
200 const std::vector<Key> &keys,
203 for (std::size_t i = 0; i < keys.size(); ++i) {
204 const marisa::UInt32 key_id = trie.lookup(keys[i].first);
210 print_time_info(keys.size(), cl.elasped());
214 const std::vector<Key> &keys,
218 for (std::size_t i = 0; i < keys.size(); ++i) {
220 const std::size_t num_keys = trie.find(keys[i].first, &found_key_ids);
226 print_time_info(keys.size(), cl.elasped());
230 const std::vector<Key> &keys,
237 for (std::size_t i = 0; i < keys.size(); ++i) {
241 keys[i].first, &found_key_ids, found_keys_ref);
247 print_time_info(keys.size(), cl.elasped());
251 const std::vector<Key> &keys,
258 for (std::size_t i = 0; i < keys.size(); ++i) {
262 keys[i].first, &found_key_ids, found_keys_ref);
268 print_time_info(keys.size(), cl.elasped());
271 void benchmark(const std::vector<Key> &keys, int num_tries) {
275 benchmark_build(keys, num_tries, &trie, &key_ids);
277 benchmark_restore(trie, keys, key_ids);
278 benchmark_lookup(trie, keys, key_ids);
279 benchmark_find(trie, keys, key_ids);
280 benchmark_predict_breadth_first(trie, keys, key_ids);
281 benchmark_predict_depth_first(trie, keys, key_ids);
287 std::vector<Key> keys;
288 const int ret = read_keys(args, num_args, &keys);
310 benchmark(keys, i);
