Lines Matching refs:i
53 for (uint32_t i = 0; i < num_hash_fun; i++) { in AddHashLookups() local
54 v.push_back(bucket_id + i); in AddHashLookups()
86 std::string NumToStr(int64_t i) { in NumToStr() argument
87 return std::string(reinterpret_cast<char*>(&i), sizeof(i)); in NumToStr()
123 for (uint32_t i = 0; i < num_items; ++i) { in CreateCuckooFileAndCheckReader() local
126 GetContext::kNotFound, Slice(user_keys[i]), &value, in CreateCuckooFileAndCheckReader()
129 reader.Get(ReadOptions(), Slice(keys[i]), &get_context, nullptr)); in CreateCuckooFileAndCheckReader()
130 ASSERT_STREQ(values[i].c_str(), value.data()); in CreateCuckooFileAndCheckReader()
134 for (uint32_t i = 0; i < num_items; i++) { in UpdateKeys() local
135 ParsedInternalKey ikey(user_keys[i], in UpdateKeys()
136 with_zero_seqno ? 0 : i + 1000, kTypeValue); in UpdateKeys()
137 keys[i].clear(); in UpdateKeys()
138 AppendInternalKey(&keys[i], ikey); in UpdateKeys()
229 for (uint64_t i = 0; i < num_items; i++) { in TEST_F() local
230 user_keys[i] = "key" + NumToStr(i); in TEST_F()
231 ParsedInternalKey ikey(user_keys[i], i + 1000, kTypeValue); in TEST_F()
232 AppendInternalKey(&keys[i], ikey); in TEST_F()
233 values[i] = "value" + NumToStr(i); in TEST_F()
235 AddHashLookups(user_keys[i], i, kNumHashFunc); in TEST_F()
243 for (uint32_t i = 0; i < num_items; i++) { in TEST_F() local
244 AddHashLookups(user_keys[i], 0, kNumHashFunc); in TEST_F()
256 for (uint64_t i = 0; i < num_items; i++) { in TEST_F() local
257 user_keys[i].resize(8); in TEST_F()
258 memcpy(&user_keys[i][0], static_cast<void*>(&i), 8); in TEST_F()
259 ParsedInternalKey ikey(user_keys[i], i + 1000, kTypeValue); in TEST_F()
260 AppendInternalKey(&keys[i], ikey); in TEST_F()
261 values[i] = "value" + NumToStr(i); in TEST_F()
263 AddHashLookups(user_keys[i], i, kNumHashFunc); in TEST_F()
271 for (uint32_t i = 0; i < num_items; i++) { in TEST_F() local
272 AddHashLookups(user_keys[i], 0, kNumHashFunc); in TEST_F()
284 for (uint64_t i = 0; i < num_items; i++) { in TEST_F() local
285 user_keys[i] = "key" + NumToStr(i); in TEST_F()
286 ParsedInternalKey ikey(user_keys[i], 1000, kTypeValue); in TEST_F()
287 AppendInternalKey(&keys[i], ikey); in TEST_F()
288 values[i] = "value" + NumToStr(i); in TEST_F()
290 AddHashLookups(user_keys[i], num_items-i-1, kNumHashFunc); in TEST_F()
303 for (uint64_t i = 0; i < num_items; i++) { in TEST_F() local
304 user_keys[i].resize(8); in TEST_F()
305 memcpy(&user_keys[i][0], static_cast<void*>(&i), 8); in TEST_F()
306 ParsedInternalKey ikey(user_keys[i], 1000, kTypeValue); in TEST_F()
307 AppendInternalKey(&keys[i], ikey); in TEST_F()
308 values[i] = "value" + NumToStr(i); in TEST_F()
310 AddHashLookups(user_keys[i], num_items-i-1, kNumHashFunc); in TEST_F()
324 for (uint64_t i = 0; i < num_items; i++) { in TEST_F() local
325 user_keys[i] = "key" + NumToStr(i); in TEST_F()
326 ParsedInternalKey ikey(user_keys[i], i + 1000, kTypeValue); in TEST_F()
327 AppendInternalKey(&keys[i], ikey); in TEST_F()
328 values[i] = "value" + NumToStr(i); in TEST_F()
330 AddHashLookups(user_keys[i], 0, kNumHashFunc); in TEST_F()
461 for (uint64_t i = 0; i < num; ++i) { in WriteFile() local
464 ASSERT_OK(reader.Get(r_options, Slice(keys[i]), &get_context, nullptr)); in WriteFile()
465 ASSERT_TRUE(Slice(keys[i]) == Slice(&keys[i][0], 4)); in WriteFile()
500 for (uint64_t i = 0; i < num; ++i) { in ReadKeys() local
501 keys.push_back(2 * i); in ReadKeys()
512 for (uint64_t i = 0; i < num; i += batch_size) { in ReadKeys() local
513 for (uint64_t j = i; j < i+batch_size && j < num; ++j) { in ReadKeys()
516 for (uint64_t j = i; j < i+batch_size && j < num; ++j) { in ReadKeys()
522 for (uint64_t i = 0; i < num; i++) { in ReadKeys() local
523 reader.Get(r_options, Slice(reinterpret_cast<char*>(&keys[i]), 16), in ReadKeys()