164   for (int i = 1; i < 100; ++i) {  in TEST_P()  local
165     std::string key(i, 'a');  in TEST_P()
181   for (uint64_t i = 1; i < kCapacity; ++i) {  in TEST_P()  local
182     auto key = ToString(i);  in TEST_P()
209   for (int i = 1; i < 100; ++i) {  in TEST_P()  local
210     std::string key(i, 'a');  in TEST_P()
223     if (i % 2 == 0) {  in TEST_P()
233     if (i % 3 == 0) {  in TEST_P()
240       if (i % 2 == 0) {  in TEST_P()
251   for (uint64_t i = 1; i < 2 * kCapacity; ++i) {  in TEST_P()  local
252     auto key = ToString(i);  in TEST_P()
363   for (int i = 0; i < kCacheSize * 2; i++) {  in TEST_P()  local
364     Insert(1000+i, 2000+i);  in TEST_P()
378   for (int i = 0; i < 3; ++i) {  in TEST_P()  local
379     if (i > 0) {  in TEST_P()
390     if (i < 2) {  in TEST_P()
416   for (int i = 0; i < kCacheSize * 2; i++) {  in TEST_P()  local
417     Insert(1000 + i, 2000 + i);  in TEST_P()
510   for (int i = 0; i < index; i++) {  in TEST_P()  local
511     const int weight = (i & 1 ? kLight : kHeavy);  in TEST_P()
512     int r = Lookup(i);  in TEST_P()
515       ASSERT_EQ(1000+i, r);  in TEST_P()
574   for (size_t i = 0; i < 5; i++) {  in TEST_P()  local
575     std::string key = ToString(i+1);  in TEST_P()
576     Status s = cache->Insert(key, new Value(i + 1), 1,  in TEST_P()
577                              SimpleDeleter<Value>::GetInstance(), &handles[i]);  in TEST_P()
590   for (size_t i = 5; i < 10; i++) {  in TEST_P()  local
591     std::string key = ToString(i+1);  in TEST_P()
592     Status s = cache->Insert(key, new Value(i + 1), 1,  in TEST_P()
593                              SimpleDeleter<Value>::GetInstance(), &handles[i]);  in TEST_P()
598   for (size_t i = 0; i < 5; i++) {  in TEST_P()  local
599     cache->Release(handles[i]);  in TEST_P()
608   for (size_t i = 5; i < 10; i++) {  in TEST_P()  local
609     cache->Release(handles[i]);  in TEST_P()
619   for (size_t i = 0; i < 10; i++) {  in TEST_P()  local
620     std::string key = ToString(i + 1);  in TEST_P()
621     s = cache->Insert(key, new Value(i + 1), 1,  in TEST_P()
622                       SimpleDeleter<Value>::GetInstance(), &handles[i]);  in TEST_P()
624     ASSERT_NE(nullptr, handles[i]);  in TEST_P()
639   for (size_t i = 0; i < 10; i++) {  in TEST_P()  local
640     cache->Release(handles[i]);  in TEST_P()
645   for (size_t i = 0; i < 5; i++) {  in TEST_P()  local
646     std::string key = ToString(i + 1);  in TEST_P()
647     s = cache2->Insert(key, new Value(i + 1), 1,  in TEST_P()
648                        SimpleDeleter<Value>::GetInstance(), &handles[i]);  in TEST_P()
650     ASSERT_NE(nullptr, handles[i]);  in TEST_P()
664   for (size_t i = 0; i < 5; i++) {  in TEST_P()  local
665     cache2->Release(handles[i]);  in TEST_P()
678   for (size_t i = 0; i < n + 1; i++) {  in TEST_P()  local
679     std::string key = ToString(i+1);  in TEST_P()
680     Status s = cache->Insert(key, new Value(i + 1), 1,  in TEST_P()
681                              SimpleDeleter<Value>::GetInstance(), &handles[i]);  in TEST_P()
686   for (size_t i = 0; i < n + 1; i++) {  in TEST_P()  local
687     std::string key = ToString(i+1);  in TEST_P()
695   for (size_t i = 0; i < n + 1; i++) {  in TEST_P()  local
696     cache->Release(handles[i]);  in TEST_P()
707   for (size_t i = 0; i < n + 1; i++) {  in TEST_P()  local
708     std::string key = ToString(i+1);  in TEST_P()
711       ASSERT_NE(i, 0U);  in TEST_P()
714       ASSERT_EQ(i, 0U);  in TEST_P()
730   for (int i = 0; i < 10; ++i) {  in TEST_P()  local
731     Insert(i, i * 2, i + 1);  in TEST_P()
732     inserted.push_back({i * 2, i + 1});  in TEST_P()