Lines Matching refs:i

108   for (int i = 0; i < kNumFiles; ++i) {  in TEST_F()  local
113 ASSERT_OK(Put(Key(i * kNumPerFile + j), values[j])); in TEST_F()
114 if (j == 0 && i > 0) { in TEST_F()
156 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
161 ASSERT_OK(Put(GetNumericStr(kNumPerFile * i + j), values[j])); in TEST_F()
166 ASSERT_EQ(i + 1, NumTableFilesAtLevel(0)); in TEST_F()
177 for (size_t i = 0; i < files[1].size() - 1; ++i) { in TEST_F() local
179 .Compare(files[1][i].largest, files[1][i + 1].smallest) < in TEST_F()
216 for (int i = 0; i < 2; ++i) { in TEST_F() local
217 if (i > 0) { in TEST_F()
239 for (int i = 0; i < 2; ++i) { in TEST_F() local
240 if (i > 0) { in TEST_F()
262 for (int i = 0; i < kNum; ++i) { in TEST_F() local
263 if (i == kNum / 3) { in TEST_F()
265 } else if (i == 2 * kNum / 3) { in TEST_F()
269 db_->Put(WriteOptions(), GetNumericStr(i), "val"); in TEST_F()
273 for (int i = 0; i < kNum; ++i) { in TEST_F() local
277 if (i < kRangeBegin || i > kRangeEnd || i < kNum / 3 || i >= 2 * kNum / 3) { in TEST_F()
278 ASSERT_OK(db_->Get(read_opts, GetNumericStr(i), &value)); in TEST_F()
280 ASSERT_TRUE(db_->Get(read_opts, GetNumericStr(i), &value).IsNotFound()); in TEST_F()
298 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
299 if (i > 0) { in TEST_F()
302 GetNumericStr((i - 1) * kNumPerFile), in TEST_F()
303 GetNumericStr((i - 1) * kNumPerFile + kNumPerFile / 2)); in TEST_F()
313 db_->Put(WriteOptions(), GetNumericStr(i * kNumPerFile + j), "val"); in TEST_F()
316 ASSERT_EQ(i + 1, NumTableFilesAtLevel(0)); in TEST_F()
324 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
329 if (i == kNumFiles - 1 || j >= kNumPerFile / 2) { in TEST_F()
331 db_->Get(read_opts, GetNumericStr(i * kNumPerFile + j), &value)); in TEST_F()
334 db_->Get(read_opts, GetNumericStr(i * kNumPerFile + j), &value) in TEST_F()
355 for (int i = 0; i < 2; ++i) { in TEST_F() local
357 if (i > 0) { in TEST_F()
414 for (int i = 0; i < kNumLevels - 1; ++i) { in TEST_F() local
416 if (i == kNumLevels - 2) { in TEST_F()
439 ASSERT_GT(NumTableFilesAtLevel(kNumLevels - 1 - i), kFilesPerLevel - 1); in TEST_F()
467 for (int i = 0; i <= kNumFiles * kNumPerFile; ++i) { in TEST_F() local
468 if (i % kNumPerFile == 0 && i / kNumPerFile == kNumFiles - 1) { in TEST_F()
474 PutFixed64(&val, i); in TEST_F()
479 if (i > 0 && i % kNumPerFile == 0) { in TEST_F()
595 for (int i = 0; i < kNum; ++i) { in TEST_F() local
596 db_->Put(WriteOptions(), GetNumericStr(i), "val"); in TEST_F()
597 if (i > 0) { in TEST_F()
600 if (i >= kNum / 2 && i < kNum / 2 + kNumRanges) { in TEST_F()
690 for (int i = 0; i < kNumMergeOps; ++i) { in TEST_F() local
692 PutFixed64(&val, i); in TEST_F()
694 if (i == kNumMergeOps / 2) { in TEST_F()
753 for (int i = 0; i < kNum; ++i) { in TEST_F() local
754 if (i == kNum / 2) { in TEST_F()
758 db_->Put(WriteOptions(), GetNumericStr(i), "val"); in TEST_F()
786 for (int i = 0; i < kNum; ++i) { in TEST_F() local
787 if (i == kNum / 2) { in TEST_F()
792 db_->Put(WriteOptions(), GetNumericStr(i), "val"); in TEST_F()
831 int i = 0; in TEST_F() local
833 for (iter->SeekToFirst(); iter->Valid(); iter->Next(), ++i) { in TEST_F()
835 ASSERT_EQ(expected[i], iter->key()); in TEST_F()
837 ASSERT_EQ(3, i); in TEST_F()
851 for (int i = 0; i < 3; ++i) { in TEST_F() local
855 if (i == 2) { in TEST_F()
861 if (i == 0) { in TEST_F()
863 } else if (i == 1) { in TEST_F()
892 for (int i = 0; i < kNumKeysPerFile; ++i) { in TEST_F() local
893 ASSERT_OK(db_->Put(WriteOptions(), db_->DefaultColumnFamily(), Key(i), in TEST_F()
933 for (int i = 0; i < kNumKeys; ++i) { in TEST_F() local
934 ASSERT_OK(Put(Key(i), "val")); in TEST_F()
939 for (int i = 0; i < kNumKeys; ++i) { in TEST_F() local
941 ASSERT_TRUE(db_->Get(ReadOptions(), Key(i), &value).IsNotFound()); in TEST_F()
964 for (int i = 0; i < 3; ++i) { in TEST_F() local
997 if (i == 0) { in TEST_F()
1001 } else if (i == 1) { in TEST_F()
1006 } else if (i == 2) { in TEST_F()
1184 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
1189 if (i == kNumFiles - 1) { in TEST_F()
1268 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
1272 if (i < kNumFiles / 2) { in TEST_F()
1275 key = Key(1 + i * kFileBytes / kValueBytes + j); in TEST_F()
1279 if (i == 0) { in TEST_F()
1282 if (i == kNumFiles - 1) { in TEST_F()
1315 for (int i = kMaxKey; i > kMaxKey - kKeysOverwritten; --i) { in TEST_F() local
1317 ASSERT_OK(db_->Merge(WriteOptions(), Key(i), value)); in TEST_F()
1361 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
1365 if (i == 0 && j == kNumKeys) { in TEST_F()
1500 for (int i = 0; i < kFileBytes / kValueBytes; ++i) { in TEST_F() local
1502 key.append(Key(i)); in TEST_F()
1581 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
1586 ASSERT_OK(Put(Key(i * kNumPerFile + j), values[j])); in TEST_F()
1620 for (int i = 0; i < kNumFiles; ++i) { in TEST_F() local
1625 ASSERT_OK(Put(Key(i * kNumPerFile + j), values[j])); in TEST_F()
1633 for (int i = 1; i < kNumFiles * kNumPerFile + 1; i++) { in TEST_F() local
1634 ASSERT_OK(Put(Key(i), "0x123")); in TEST_F()