Searched refs:kNumFiles (Results 1 – 7 of 7) sorted by relevance
108 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()156 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()298 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()324 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()372 if (j < kNumFiles - 1) { in TEST_F()1165 const int kNumFiles = 4; in TEST_F() local1189 if (i == kNumFiles - 1) { in TEST_F()1250 const int kNumFiles = 4; in TEST_F() local1272 if (i < kNumFiles / 2) { in TEST_F()1282 if (i == kNumFiles - 1) { in TEST_F()[all …]
682 const int kNumFiles = 4; in TEST_F() local717 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()721 ASSERT_OK(Put(Key(j * kNumFiles + i), value.c_str())); in TEST_F()727 ASSERT_EQ(kNumFiles, NumTableFilesAtLevel(1)); in TEST_F()731 options, kNumFiles /* expected_compression_dict_misses */, in TEST_F()733 kNumFiles /* expected_compression_dict_inserts */); in TEST_F()740 ASSERT_NE("NOT_FOUND", Get(Key(kNumFiles * kNumEntriesPerFile - 1))); in TEST_F()
799 const uint32_t kNumFiles = kNumLevels * kFilesPerLevel; in TEST_F() local802 for (uint32_t i = 0; i < kNumFiles; ++i) { in TEST_F()814 (kEntriesPerFile - 2 * kDeletionsPerFile) * kNumFiles); in TEST_F()
3882 const int kNumFiles = 4; in TEST_F() local3916 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()3944 ASSERT_EQ(kNumFiles, periodic_compactions); in TEST_F()5228 constexpr size_t kNumFiles = 24; in TEST_F() local5232 for (size_t i = 0; i < kNumFiles; ++i) { in TEST_F()
1183 const int kNumFiles = 4; in TEST_F() local1196 for (int i = 0; i < kNumFiles; ++i) { in TEST_F()
199 const size_t kNumFiles = dummy_files_dirs_.size(); in TEST_F() local202 for (size_t i = 0; i < kNumFiles; i++) { in TEST_F()208 for (size_t i = 0; i < kNumFiles; i++) { in TEST_F()217 for (size_t i = 0; i < kNumFiles; i++) { in TEST_F()
569 const int kNumFiles = options.level0_file_num_compaction_trigger - 1; in TEST_F() local574 for (int i = 0; i != kNumFiles; ++i) { in TEST_F()590 ASSERT_EQ("value_" + std::to_string(kNumFiles - 1), in TEST_F()