Lines Matching refs:i
238 for (int i = 0; i < num_of_reasons; i++) { in VerifyCompactionStats() local
239 counts[i] += stat.counts[i]; in VerifyCompactionStats()
240 sum += stat.counts[i]; in VerifyCompactionStats()
246 for (int i = 0; i < num_of_reasons; i++) { in VerifyCompactionStats() local
247 ASSERT_EQ(collector.NumberOfCompactions(static_cast<CompactionReason>(i)), counts[i]); in VerifyCompactionStats()
365 int i = 0; in TEST_P() local
367 i++; in TEST_P()
369 ASSERT_EQ(i, 0); in TEST_P()
376 i = 0; in TEST_P()
378 i++; in TEST_P()
380 ASSERT_EQ(i, 4); in TEST_P()
388 i = 0; in TEST_P()
390 i++; in TEST_P()
392 ASSERT_EQ(i, 0); in TEST_P()
738 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_P() local
740 ASSERT_OK(Put(1, Key(i), values[i])); in TEST_P()
750 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_P() local
752 ASSERT_OK(Put(1, Key(i), values[i])); in TEST_P()
782 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
784 &sleeping_tasks[i], Env::Priority::LOW); in TEST_F()
785 sleeping_tasks[i].WaitUntilSleeping(); in TEST_F()
793 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
794 ASSERT_OK(Put(cf, Key(i), "")); in TEST_F()
810 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
811 ASSERT_OK(Put(2, Key(i), "")); in TEST_F()
822 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
823 sleeping_tasks[i].WakeUp(); in TEST_F()
824 sleeping_tasks[i].WaitUntilDone(); in TEST_F()
830 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
831 sleeping_tasks[i].Reset(); in TEST_F()
833 &sleeping_tasks[i], Env::Priority::LOW); in TEST_F()
834 sleeping_tasks[i].WaitUntilSleeping(); in TEST_F()
838 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
839 ASSERT_OK(Put(cf, Key(i), "")); in TEST_F()
852 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
853 sleeping_tasks[i].WakeUp(); in TEST_F()
854 sleeping_tasks[i].WaitUntilDone(); in TEST_F()
869 for (int i = 0; i < 80; i++) { in TEST_P() local
871 ASSERT_OK(Put(1, Key(i), values[i])); in TEST_P()
881 for (int i = 0; i < 80; i++) { in TEST_P() local
882 ASSERT_EQ(Get(1, Key(i)), values[i]); in TEST_P()
895 for (int i = 0; i < N; i++) { in TEST_F() local
896 ASSERT_OK(Put(1, Key(i), Key(i) + std::string(1000, 'v'))); in TEST_F()
901 for (int i = 0; i < N; i++) { in TEST_F() local
902 ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(1, Key(i))); in TEST_F()
907 for (int i = 0; i < N; i++) { in TEST_F() local
908 ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(1, Key(i))); in TEST_F()
936 for (int i = 0; i < 3; i++) { in TEST_F() local
969 for (int i = 0; i < 3; i++) { in TEST_F() local
1023 for (int i = 0; i < options.level0_file_num_compaction_trigger; i++) { in TEST_F() local
1041 for (int i = 0; i < 2; ++i) { in TEST_F() local
1044 Put(std::to_string(2 * i), std::string(1, 'A')); in TEST_F()
1045 Put(std::to_string(2 * i + 1), std::string(1, 'A')); in TEST_F()
1051 ASSERT_EQ(NumTableFilesAtLevel(1, 0), i + 1); in TEST_F()
1107 for (int i = 0; i < num_keys; i++) { in TEST_P() local
1109 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1138 for (int i = 0; i < num_keys; i++) { in TEST_P() local
1139 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_P()
1178 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P() local
1179 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1200 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P() local
1201 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1224 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P() local
1225 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1234 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P() local
1235 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1270 for (int32_t i = 0; i <= 300; i++) { in TEST_P() local
1271 values[i] = RandomString(&rnd, value_size); in TEST_P()
1272 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1277 for (int32_t i = 600; i <= 700; i++) { in TEST_P() local
1278 values[i] = RandomString(&rnd, value_size); in TEST_P()
1279 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1296 for (int32_t i = 0; i <= 300; i++) { in TEST_P() local
1297 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_P()
1299 for (int32_t i = 600; i <= 700; i++) { in TEST_P() local
1300 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_P()
1351 for (int32_t i = 0; i < 100; i++) { in TEST_P() local
1352 values[i] = RandomString(&rnd, value_size); in TEST_P()
1353 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1358 for (int32_t i = 100; i < 300; i++) { in TEST_P() local
1359 values[i] = RandomString(&rnd, value_size); in TEST_P()
1360 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1379 for (int32_t i = 0; i < 200; i++) { in TEST_P() local
1380 values[i] = RandomString(&rnd, value_size); in TEST_P()
1381 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1411 for (int32_t i = 300; i <= 400; i++) { in TEST_P() local
1412 values[i] = RandomString(&rnd, value_size); in TEST_P()
1413 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1418 for (int32_t i = 400; i <= 500; i++) { in TEST_P() local
1419 values[i] = RandomString(&rnd, value_size); in TEST_P()
1420 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1425 for (int32_t i = 500; i <= 600; i++) { in TEST_P() local
1426 values[i] = RandomString(&rnd, value_size); in TEST_P()
1427 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1443 for (int32_t i = 0; i < 600; i++) { in TEST_P() local
1444 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_P()
1493 for (int32_t i = 0; i < 100; i++) { in TEST_F() local
1494 values[i] = RandomString(&rnd, value_size); in TEST_F()
1495 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1500 for (int32_t i = 100; i < 300; i++) { in TEST_F() local
1501 values[i] = RandomString(&rnd, value_size); in TEST_F()
1502 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1519 for (int32_t i = 0; i < 200; i++) { in TEST_F() local
1520 values[i] = RandomString(&rnd, value_size); in TEST_F()
1521 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1546 for (int32_t i = 0; i <= 5; i++) { in TEST_F() local
1559 for (int32_t i = 1; i < options.num_levels; i++) { in TEST_F() local
1560 ASSERT_LE(SizeAtLevel(i), target_size); in TEST_F()
1570 for (int32_t i = 0; i < 4300; i++) { in TEST_F() local
1571 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_F()
1622 for (int32_t i = 0; i < 100; i++) { in TEST_F() local
1623 values[i] = RandomString(&rnd, value_size); in TEST_F()
1624 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1629 for (int32_t i = 100; i < 300; i++) { in TEST_F() local
1630 values[i] = RandomString(&rnd, value_size); in TEST_F()
1631 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1645 for (int32_t i = 0; i < 200; i++) { in TEST_F() local
1646 values[i] = RandomString(&rnd, value_size); in TEST_F()
1647 ASSERT_OK(Put(Key(i), values[i])); in TEST_F()
1652 for (int32_t i = 0; i <= 5; i++) { in TEST_F() local
1668 for (int32_t i = 1; i < options.num_levels; i++) { in TEST_F() local
1669 ASSERT_LE(SizeAtLevel(i), target_size); in TEST_F()
1682 for (int32_t i = 0; i < 4300; i++) { in TEST_F() local
1683 if (i < 1000 || i > 2000) { in TEST_F()
1684 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_F()
1688 Status s = db_->Get(roptions, Key(i), &result); in TEST_F()
1715 for (int32_t i = 0; i < 4300; i++) { in TEST_F() local
1718 Status s = db_->Get(roptions, Key(i), &result); in TEST_F()
1742 for (auto i = 0; i < 10; i++) { in TEST_F() local
1744 auto k = i * 100 + j; in TEST_F()
1758 for (auto i = 0; i < 10; i+=2) { in TEST_F() local
1760 auto k = i * 100 + j; in TEST_F()
1786 for (auto i = 0; i < 300; i++) { in TEST_F() local
1789 auto s = db_->Get(ropts, Key(i), &result); in TEST_F()
1792 for (auto i = 300; i < 1000; i++) { in TEST_F() local
1793 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_F()
1814 for (auto i = 600; i < 900; i++) { in TEST_F() local
1817 auto s = db_->Get(ropts, Key(i), &result); in TEST_F()
1820 for (auto i = 300; i < 600; i++) { in TEST_F() local
1821 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_F()
1823 for (auto i = 900; i < 1000; i++) { in TEST_F() local
1824 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_F()
1834 for (auto i = 0; i < 1000; i++) { in TEST_F() local
1837 auto s = db_->Get(ropts, Key(i), &result); in TEST_F()
1876 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
1877 vals[i] = RandomString(&rnd, kValSize); in TEST_F()
1878 Put(Key(i), vals[i]); in TEST_F()
1879 Put(Key(i + 1), vals[i]); in TEST_F()
1881 if (i == 0) { in TEST_F()
1918 for (int i = 0; i < 100; i++) { in TEST_P() local
1920 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1936 for (int i = 100; i < 200; i++) { in TEST_P() local
1938 ASSERT_OK(Put(Key(i), values[i])); in TEST_P()
1951 for (int i = 0; i < 200; i++) { in TEST_P() local
1952 ASSERT_EQ(Get(Key(i)), values[i]); in TEST_P()
1977 for (size_t i = 0; i < filenames.size(); ++i) { in TEST_P() local
1978 env_->DeleteFile(options.db_paths[1].path + "/" + filenames[i]); in TEST_P()
2058 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2059 auto v = Get(Key(i)); in TEST_P()
2066 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2067 auto v = Get(Key(i)); in TEST_P()
2094 for (size_t i = 0; i < filenames.size(); ++i) { in TEST_P() local
2095 env_->DeleteFile(options.db_paths[1].path + "/" + filenames[i]); in TEST_P()
2176 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2177 auto v = Get(Key(i)); in TEST_P()
2184 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2185 auto v = Get(Key(i)); in TEST_P()
2251 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2252 auto v = Get(0, Key(i)); in TEST_P()
2257 for (int i = 0; i < key_idx1; i++) { in TEST_P() local
2258 auto v = Get(1, Key(i)); in TEST_P()
2263 for (int i = 0; i < key_idx2; i++) { in TEST_P() local
2264 auto v = Get(2, Key(i)); in TEST_P()
2330 for (int i = 0; i <= max_key_level_insert; i++) { in TEST_P() local
2332 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, 10000))); in TEST_P()
2339 for (int i = 1; i < options.num_levels; i++) { in TEST_P() local
2340 non_level0_num_files += NumTableFilesAtLevel(i, 1); in TEST_P()
2389 for (int i = max_key_level_insert / 2; i <= max_key_universal_insert; i++) { in TEST_P() local
2390 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, 10000))); in TEST_P()
2396 for (int i = 1; i < options.num_levels; i++) { in TEST_P() local
2397 ASSERT_EQ(NumTableFilesAtLevel(i, 1), 0); in TEST_P()
2411 for (int i = 0; i <= max_key_universal_insert; i++) { in TEST_P() local
2412 expected_keys.append(Key(i)); in TEST_P()
2577 for (int i = 0; i < 3; ++i) { in TEST_P() local
2603 for (int i = 0; i < 3; ++i) { in TEST_P() local
2656 for (int i = 0; i < 10; i++) { in TEST_F() local
2825 for (int i = 0; i < 2; ++i) { in TEST_P() local
2828 ASSERT_OK(Put(Key(i * 50 + j), RandomString(&rnd, 10 * 1024))); in TEST_P()
2860 for (int i = 0; i < 2; ++i) { in TEST_P() local
2863 ASSERT_OK(Put(Key(i * 50 + j + 100), RandomString(&rnd, 10 * 1024))); in TEST_P()
2980 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2981 auto v = Get(Key(i)); in TEST_P()
2988 for (int i = 0; i < key_idx; i++) { in TEST_P() local
2989 auto v = Get(Key(i)); in TEST_P()
3072 static std::string ShortKey(int i) { in ShortKey() argument
3073 assert(i < 10000); in ShortKey()
3075 snprintf(buf, sizeof(buf), "key%04d", i); in ShortKey()
3120 for (int i = 0; i < 100; i++) { in TEST_P() local
3122 ASSERT_OK(Put(ShortKey(i), values[i])); in TEST_P()
3137 for (int i = 100; i < 200; i++) { in TEST_P() local
3139 ASSERT_OK(Put(ShortKey(i), values[i])); in TEST_P()
3155 for (int i = 200; i < 300; i++) { in TEST_P() local
3157 ASSERT_OK(Put(ShortKey(i), values[i])); in TEST_P()
3174 for (int i = 0; i < 300; i++) { in TEST_P() local
3175 ASSERT_EQ(Get(ShortKey(i)), values[i]); in TEST_P()
3209 for (int i = 0; i < 10; ++i) { in TEST_P() local
3211 if (i == 5) { in TEST_P()
3212 ASSERT_OK(Put(Key(i + 1), value + value)); in TEST_P()
3214 ASSERT_OK(Put(Key(i + 1), value)); in TEST_P()
3228 for (int i = 0; i < 2; ++i) { in TEST_P() local
3229 ASSERT_GE(level_to_files[0][i].fd.file_size, 1 << 21); in TEST_P()
3264 for (int i = 0; i < 10; ++i) { in TEST_P() local
3267 if (i < 5) { in TEST_P()
3272 ASSERT_OK(Put(Key(i + 1), value)); in TEST_P()
3346 for (int i = 0; i < 2; ++i) { in TEST_F() local
3347 Put(Key(2 * i + 1), "val"); in TEST_F()
3357 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
3359 Delete(Key(i + 1)); in TEST_F()
3364 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
3366 ASSERT_TRUE(db_->Get(ReadOptions(), Key(i + 1), &value).IsNotFound()); in TEST_F()
3399 for (int i = 0; i < kNumL0Files - 1; ++i) { in TEST_F() local
3401 ASSERT_OK(Put(Key(i + 1), "val")); in TEST_F()
3461 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3464 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
3466 if (i == kNumLevelFiles - 1) { in TEST_F()
3476 if (i < kNumLevelFiles - 1) { in TEST_F()
3477 ASSERT_EQ(i + 1, NumTableFilesAtLevel(0)); in TEST_F()
3505 for (size_t i = 0; i < pre_release_metadata.size(); ++i) { in TEST_F() local
3506 const auto& pre_file = pre_release_metadata[i]; in TEST_F()
3507 const auto& post_file = post_release_metadata[i]; in TEST_F()
3533 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3536 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
3545 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3547 ASSERT_OK(Delete(Key(i * kNumKeysPerFile + j))); in TEST_F()
3579 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3582 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
3591 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3593 ASSERT_OK(Delete(Key(i * kNumKeysPerFile + j))); in TEST_F()
3676 for (int i = 1; i <= 100; ++i) { in TEST_F() local
3677 ASSERT_OK(Put(Key(i), RandomString(&rnd, kValueSize))); in TEST_F()
3689 for (int i = 101; i <= 200; ++i) { in TEST_F() local
3690 ASSERT_OK(Put(Key(i), RandomString(&rnd, kValueSize))); in TEST_F()
3698 for (int i = 1; i <= 50; ++i) { in TEST_F() local
3699 ASSERT_OK(Put(Key(i), RandomString(&rnd, kValueSize))); in TEST_F()
3703 for (int i = 51; i <= 150; ++i) { in TEST_F() local
3704 ASSERT_OK(Put(Key(i), RandomString(&rnd, kValueSize))); in TEST_F()
3712 for (int i = 26; i <= 75; ++i) { in TEST_F() local
3713 ASSERT_OK(Put(Key(i), RandomString(&rnd, kValueSize))); in TEST_F()
3822 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3824 ASSERT_OK(Put(Key(i * kNumKeysPerFile + j), in TEST_F()
3916 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
3919 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
3923 if (i == 1) { in TEST_F()
3979 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
3982 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
4090 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
4093 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
4125 for (int i = 0; i < 2; ++i) { in TEST_F() local
4128 if (i == 0) { in TEST_F()
4135 if (i == 0) { in TEST_F()
4179 for (int i = 0; i < 2; ++i) { in TEST_F() local
4185 if (i == 1) { in TEST_F()
4190 if (i == 0) { in TEST_F()
4240 for (int i = 0; i < 2; ++i) { in TEST_F() local
4259 auto manual_compaction_thread = port::Thread([this, i]() { in TEST_F()
4263 if (i == 0) { in TEST_F()
4274 if (i == 0) { in TEST_F()
4313 for (int i = 0; i < kNumL0FilesLimit - 1; ++i) { in TEST_F() local
4352 for (int i = 0; i <= kNumEndpointKeys; ++i) { in TEST_F() local
4355 if (i == 0) { in TEST_F()
4358 begin = keys[i - 1]; in TEST_F()
4363 for (int j = std::max(0, i - 1); j <= kNumEndpointKeys; ++j) { in TEST_F()
4385 (i <= 4 && j >= 1 && (begin != "c" || end != "c"))) { in TEST_F()
4406 for (int i = 0; i < 32; i++) { in TEST_F() local
4613 for (size_t i = 0; i < kTotalCompactTasks; i++) { in TEST_F() local
4615 &sleeping_compact_tasks[i], Env::LOW); in TEST_F()
4616 sleeping_compact_tasks[i].WaitUntilSleeping(); in TEST_F()
4623 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
4644 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
4645 ASSERT_OK(Put(0, Key(i), "")); in TEST_F()
4658 for (size_t i = 0; i < kTotalCompactTasks; i++) { in TEST_F() local
4659 sleeping_compact_tasks[i].WakeUp(); in TEST_F()
4660 sleeping_compact_tasks[i].WaitUntilDone(); in TEST_F()
4680 for (int i = 0; i < kNumKeysPerFile; i++) { in TEST_F() local
4762 for (int i = 0; i < kNKeys; i++) { in TEST_P() local
4763 keys[i] = i; in TEST_P()
4767 for (int i = 0; i < kNKeys; i++) { in TEST_P() local
4768 ASSERT_OK(Put(Key(keys[i]), RandomString(&rnd, 102))); in TEST_P()
4772 for (int i = 0; i < kNKeys; i++) { in TEST_P() local
4773 ASSERT_NE("NOT_FOUND", Get(Key(i))); in TEST_P()
4808 for (auto i = 0; i < 8; ++i) { in TEST_F() local
4840 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
4888 for (auto i = 0; i < 8; ++i) { in TEST_F() local
4891 Put("foo" + std::to_string(i * 10 + j), RandomString(&rnd, 1024))); in TEST_F()
4898 for (auto i = 0; i < 8; ++i) { in TEST_F() local
4901 Put("bar" + std::to_string(i * 10 + j), RandomString(&rnd, 1024))); in TEST_F()
4932 for (auto i = 0; i < 2; ++i) { in TEST_F() local
4935 Put("foo" + std::to_string(i * 10 + j), RandomString(&rnd, 1024))); in TEST_F()
4983 for (int i = 0; i != options.level0_file_num_compaction_trigger; ++i) { in TEST_P() local
4987 if (0 == i) { in TEST_P()
4998 ASSERT_EQ(NumTableFilesAtLevel(0 /*level*/, 0 /*cf*/), i + 1); in TEST_P()
5093 for (int i = 0; i < 10; ++i) { in TEST_P() local
5094 ASSERT_OK(Put(Key(i), "")); // prevents trivial move in TEST_P()
5101 for (int i = 0; i < 5; ++i) { in TEST_P() local
5102 ASSERT_OK(Put(Key(i + 1), value)); in TEST_P()
5114 for (int i = 5; i < 10; i++) { in TEST_P() local
5115 IngestOneKeyValue(dbfull(), Key(i), value, options); in TEST_P()
5116 ASSERT_EQ(i + 1, NumTableFilesAtLevel(0)); in TEST_P()
5154 for (int i = 0; i < 10; ++i) { in TEST_P() local
5155 ASSERT_OK(Put(Key(i), "")); // prevents trivial move in TEST_P()
5170 for (int i = 0; i < 6; ++i) { in TEST_P() local
5171 if (i % 2 == 0) { in TEST_P()
5172 IngestOneKeyValue(dbfull(), Key(i), value, options); in TEST_P()
5174 ASSERT_OK(Put(Key(i), value)); in TEST_P()
5189 for (int i = 0; i < 6; ++i) { in TEST_P() local
5190 ASSERT_OK(Put(Key(i), bigvalue)); in TEST_P()
5195 for (int i = 6; i < 10; ++i) { in TEST_P() local
5196 ASSERT_EQ(i, NumTableFilesAtLevel(0)); in TEST_P()
5197 IngestOneKeyValue(dbfull(), Key(i), value2, options); in TEST_P()
5212 for (int i = 0; i < 6; ++i) { in TEST_P() local
5213 ASSERT_EQ(bigvalue, Get(Key(i))); in TEST_P()
5215 for (int i = 6; i < 10; ++i) { in TEST_P() local
5216 ASSERT_EQ(value2, Get(Key(i))); in TEST_P()
5232 for (size_t i = 0; i < kNumFiles; ++i) { in TEST_F() local
5234 ASSERT_OK(Put(std::to_string(j), "value_" + std::to_string(i))); in TEST_F()