Lines Matching refs:i
204 for (int i = 5; i < 90; i += 10) { in TEST_P() local
205 ASSERT_EQ(Get(Key(i)), "NOT_FOUND"); in TEST_P()
224 for (int i = 5; i < 90; i += 10) { in TEST_P() local
225 ASSERT_EQ(Get(Key(i)), "NOT_FOUND"); in TEST_P()
363 for (int i = 0; i < 11; i++) { in TEST_P() local
421 for (int i = 0; i < 11; i++) { in TEST_P() local
500 for (int i = 0; i < 11; i++) { in TEST_P() local
641 for (int i = 0; i < 210; i++) { in TEST_P() local
642 ASSERT_OK(Put(Key(i), RandomString(&rnd, 100))); in TEST_P()
646 for (int i = 200; i < 300; i++) { in TEST_P() local
647 ASSERT_OK(Put(Key(i), RandomString(&rnd, 100))); in TEST_P()
651 for (int i = 250; i < 260; i++) { in TEST_P() local
652 ASSERT_OK(Put(Key(i), RandomString(&rnd, 100))); in TEST_P()
692 for (int i = 0; i < num_keys * 2; i++) { in TEST_P() local
693 ASSERT_OK(Put(1, Key(i % num_keys), Key(i))); in TEST_P()
698 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P() local
699 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
737 for (int i = 0; i < num_keys; i++) { in TEST_P() local
738 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
803 for (int i = 0; i < num_keys * 2; i++) { in TEST_P() local
804 ASSERT_OK(Put(1, Key(i % num_keys), Key(i))); in TEST_P()
812 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P() local
813 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
818 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P() local
819 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
857 for (int i = 1; i <= 70; i++) { in TEST_P() local
860 if (i % 10 == 0) { in TEST_P()
873 for (int i = 0; i < 3; i++) { in TEST_P() local
901 for (int i = 1; i <= 70; i++) { in TEST_P() local
904 if (i % 10 == 0) { in TEST_P()
917 for (int i = 0; i < 8; i++) { in TEST_P() local
962 for (int i = 0; i < 100; i++) { in TEST_P() local
1000 for (int i = 0; i < 100; i++) { in TEST_P() local
1010 for (int i = 0; i < 100; i++) { in TEST_P() local
1031 for (int i = 0; i < 100; i++) { in TEST_P() local
1041 for (int i = 0; i < 100; i++) { in TEST_P() local
1052 for (int i = 0; i < 100; i++) { in TEST_P() local
1081 for (int i = 0; i < 11; i++) { in TEST_P() local
1093 for (int i = 0; i < 11; i++) { in TEST_P() local
1106 for (int i = 0; i < 11; i++) { in TEST_P() local
1119 for (int i = 0; i < 11; i++) { in TEST_P() local
1149 for (int i = 0; i < 12; i++) { in TEST_P() local
1194 for (int i = 0; i < num_keys; i++) { in TEST_P() local
1195 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
1240 for (int i = 0; i < num_keys; i++) { in TEST_P() local
1241 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
1272 for (size_t i = 0; i < filenames.size(); ++i) { in TEST_P() local
1273 env_->DeleteFile(options.db_paths[1].path + "/" + filenames[i]); in TEST_P()
1339 for (int i = 0; i < key_idx; i++) { in TEST_P() local
1340 auto v = Get(Key(i)); in TEST_P()
1347 for (int i = 0; i < key_idx; i++) { in TEST_P() local
1348 auto v = Get(Key(i)); in TEST_P()
1410 for (int i = 0; i < key_idx; i++) { in TEST_P() local
1411 auto v = Get(0, Key(i)); in TEST_P()
1416 for (int i = 0; i < key_idx1; i++) { in TEST_P() local
1417 auto v = Get(1, Key(i)); in TEST_P()
1422 for (int i = 0; i < key_idx2; i++) { in TEST_P() local
1423 auto v = Get(2, Key(i)); in TEST_P()
1507 for (int i = 0; i <= num_keys_in_db; i++) { in TEST_P() local
1508 expected_keys.append(Key(i)); in TEST_P()
1531 for (int i = 0; i <= max_key1; i++) { in TEST_P() local
1533 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, 10000))); in TEST_P()
1549 for (int i = max_key1 + 1; i <= max_key2; i++) { in TEST_P() local
1551 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, 10000))); in TEST_P()
1581 for (int i = max_key2 + 1; i <= max_key3; i++) { in TEST_P() local
1583 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, 10000))); in TEST_P()
1612 for (size_t i = 0; i < filenames.size(); ++i) { in TEST_P() local
1613 env_->DeleteFile(options.db_paths[1].path + "/" + filenames[i]); in TEST_P()
1676 for (int i = 0; i < key_idx; i++) { in TEST_P() local
1677 auto v = Get(Key(i)); in TEST_P()
1684 for (int i = 0; i < key_idx; i++) { in TEST_P() local
1685 auto v = Get(Key(i)); in TEST_P()
1723 for (int i = 0; i < 2; ++i) { in TEST_P() local
1732 if (i == 0) { in TEST_P()
1831 for (int i = 0; i < 2; ++i) { in TEST_P() local
1933 int i; in TEST_F() local
1934 for (i = 0; i < 2000; ++i) { in TEST_F()
1935 Put(Key(i), "val"); in TEST_F()
1941 for (i = 1999; i < kNumKeys; ++i) { in TEST_F()
1942 if (i >= kNumKeys - kWindowSize && in TEST_F()
1943 i < kNumKeys - kWindowSize + kNumDelsTrigger) { in TEST_F()
1944 Delete(Key(i)); in TEST_F()
1946 Put(Key(i), "val"); in TEST_F()
1975 int i; in TEST_F() local
1976 for (i = 0; i < 2000; ++i) { in TEST_F()
1977 Put(Key(i), "val"); in TEST_F()
1981 for (i = 1999; i < kNumKeys; ++i) { in TEST_F()
1982 if (i >= kNumKeys - kWindowSize && in TEST_F()
1983 i < kNumKeys - kWindowSize + kNumDelsTrigger) { in TEST_F()
1984 Delete(Key(i)); in TEST_F()
1986 Put(Key(i), "val"); in TEST_F()
2012 int i; in TEST_F() local
2013 for (i = 0; i < 500; ++i) { in TEST_F()
2014 Put(Key(i), "val"); in TEST_F()
2017 for (i = 500; i < 1000; ++i) { in TEST_F()
2018 Put(Key(i), "val"); in TEST_F()
2021 for (i = 1000; i < 1500; ++i) { in TEST_F()
2022 Put(Key(i), "val"); in TEST_F()
2025 for (i = 1500; i < 2000; ++i) { in TEST_F()
2026 Put(Key(i), "val"); in TEST_F()
2034 for (i = 1999; i < 2333; ++i) { in TEST_F()
2035 Put(Key(i), "val"); in TEST_F()
2038 for (i = 2333; i < 2666; ++i) { in TEST_F()
2039 Put(Key(i), "val"); in TEST_F()
2042 for (i = 2666; i < 2999; ++i) { in TEST_F()
2043 Put(Key(i), "val"); in TEST_F()
2052 for (i = 1900; i < 2100; ++i) { in TEST_F()
2053 Delete(Key(i)); in TEST_F()
2084 int i; in TEST_F() local
2085 for (i = 0; i < 2000; ++i) { in TEST_F()
2086 Put(Key(i), "val"); in TEST_F()
2089 for (i = 2000; i < 3000; ++i) { in TEST_F()
2090 Put(Key(i), "val"); in TEST_F()
2093 for (i = 3500; i < 4000; ++i) { in TEST_F()
2094 Put(Key(i), "val"); in TEST_F()
2097 for (i = 2900; i < 3100; ++i) { in TEST_F()
2098 Delete(Key(i)); in TEST_F()
2126 int i; in TEST_F() local
2127 for (i = 0; i < 2000; ++i) { in TEST_F()
2128 Put(Key(i), "val"); in TEST_F()
2134 for (i = 1999; i < kNumKeys; ++i) { in TEST_F()
2135 if (i >= kNumKeys - kWindowSize && in TEST_F()
2136 i < kNumKeys - kWindowSize + kNumDelsTrigger) { in TEST_F()
2137 Delete(Key(i)); in TEST_F()
2139 Put(Key(i), "val"); in TEST_F()