Lines Matching refs:j
564 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
565 batch.Put(handles_[0], batch_keys[i][j], DummyString(1024)); in TEST_F()
606 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
607 keys_must_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
619 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
621 keys_must_not_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
624 keys_must_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
638 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
640 keys_must_not_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
643 keys_must_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
752 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
753 batch.Put(handles_[0], batch_keys[i][j], DummyString(1024)); in TEST_F()
777 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
778 if (i >= change_records_from_index && j >= num_keys_to_add_in_new_batch) { in TEST_F()
779 keys_must_not_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
782 keys_must_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
840 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
841 batch.Put(handles_[0], batch_keys[i][j], DummyString(1024)); in TEST_F()
864 for (size_t j = 0; j < batch_keys[i].size(); j++) { in TEST_F() local
865 keys_must_exist.push_back(Slice(batch_keys[i][j])); in TEST_F()
960 for (size_t j = 0; j < batch_keys_pre_flush[i].size(); j++) { in TEST_F() local
961 batch.Put(handles_[0], batch_keys_pre_flush[i][j], DummyString(1024)); in TEST_F()
962 batch.Put(handles_[1], batch_keys_pre_flush[i][j], DummyString(1024)); in TEST_F()
983 for (size_t j = 0; j < batch_keys_post_flush[i].size(); j++) { in TEST_F() local
984 batch.Put(handles_[0], batch_keys_post_flush[i][j], DummyString(1024)); in TEST_F()
985 batch.Put(handles_[1], batch_keys_post_flush[i][j], DummyString(1024)); in TEST_F()
1011 for (size_t j = 0; j < batch_keys_post_flush[i].size(); j++) { in TEST_F() local
1013 Slice batch_key(batch_keys_post_flush[i][j]); in TEST_F()
1023 for (size_t j = 0; j < batch_keys_pre_flush[i].size(); j++) { in TEST_F() local
1025 Slice batch_key(batch_keys_pre_flush[i][j]); in TEST_F()
1031 for (size_t j = 0; j < batch_keys_post_flush[i].size(); j++) { in TEST_F() local
1033 Slice batch_key(batch_keys_post_flush[i][j]); in TEST_F()
1122 for (int j = 0; j < 10; ++j) { in TEST_F() local
1123 seq_datas[j] = in TEST_F()
1128 for (int j = 0; j < kNumL0Files; ++j) { in TEST_F() local
1130 auto key_num = j * (kL0FileBytes / kBlockSizeBytes) + k; in TEST_F()
1135 ASSERT_EQ(j + 1, NumTableFilesAtLevel(0, 1)); in TEST_F()
1152 for (size_t j = 0; j < kNumL0Files * (kL0FileBytes / kBlockSizeBytes); in TEST_F() local
1153 j++) { in TEST_F()
1154 ASSERT_EQ(seq_datas[(j / 10) % 10], Get(1, Key(static_cast<int>(j)))); in TEST_F()
1197 for (int j = 0; j < kNumEntriesPerFile; ++j) { in TEST_F() local
1198 ASSERT_OK(Put(Key(i * kNumEntriesPerFile + j), in TEST_F()
1318 for (int j = 0; j < 5; j++) { in TEST_F() local
1377 for (int j = 0; j < 10; j++) { in TEST_F() local
1392 for (int j = 0; j < 10; j++) { in TEST_F() local
2497 for (int j = 0; j < 100; j++) { in TEST_F() local
2498 ASSERT_OK(Put(Key(j), RandomString(&rnd, 50))); in TEST_F()
2518 for (int j = 0; j < options.num_levels - i + 1; j++) { in TEST_F() local
2520 ASSERT_OK(Put(Key(k + j * 1000), RandomString(&rnd, 50))); in TEST_F()
2572 for (int j = 0; j < options.num_levels - i + 1; j++) { in TEST_F() local
2574 ASSERT_OK(Put(Key(k + j * 1000), RandomString(&rnd, 50))); in TEST_F()
2884 for (int j = 0; j <= kNumKeysPerFile; ++j) { in TEST_F() local
2885 ASSERT_OK(Put(Key(j), DummyString(kBytesPerKey))); in TEST_F()