Lines Matching refs:key

161   for (int key = 0; key <= 30; key++) {  in TEST()  local
162 cache.Put(key, key * 100); in TEST()
164 for (int key = 0; key <= 20; key++) { in TEST() local
165 EXPECT_FALSE(cache.HasKey(key)); in TEST()
167 for (int key = 21; key <= 30; key++) { in TEST() local
168 EXPECT_TRUE(cache.HasKey(key)); in TEST()
170 for (int key = 21; key <= 30; key++) { in TEST() local
171 EXPECT_TRUE(cache.Remove(key)); in TEST()
173 for (int key = 21; key <= 30; key++) { in TEST() local
174 EXPECT_FALSE(cache.HasKey(key)); in TEST()
180 for (int key = 0; key < 10; key++) { in TEST() local
181 cache.Put(key, key * 100); in TEST()
183 for (int key = 0; key < 10; key++) { in TEST() local
184 EXPECT_TRUE(cache.HasKey(key)); in TEST()
187 for (int key = 0; key < 10; key++) { in TEST() local
188 EXPECT_FALSE(cache.HasKey(key)); in TEST()
191 for (int key = 0; key < 10; key++) { in TEST() local
192 cache.Put(key, key * 1000); in TEST()
194 for (int key = 0; key < 10; key++) { in TEST() local
195 EXPECT_TRUE(cache.HasKey(key)); in TEST()
204 for (int key = 0; key < max_size; key++) { in TEST() local
205 cache.Put(key, key); in TEST()
209 for (int key = 0; key < max_size; key++) { in TEST() local
210 EXPECT_TRUE(cache.HasKey(key)); in TEST()
214 for (int key = 0; key < max_size; key++) { in TEST() local
215 int new_key = key + max_size; in TEST()
217 EXPECT_FALSE(cache.HasKey(key)); in TEST()
223 for (int key = max_size; key < 2 * max_size; key++) { in TEST() local
224 EXPECT_TRUE(cache.Get(key, value)); in TEST()
225 EXPECT_EQ(*value, key); in TEST()
226 EXPECT_TRUE(cache.Remove(key)); in TEST()
236 for (int key = 0; key < 100; key++) { in TEST() local
237 workers.push_back(std::thread([key, pointer]() { in TEST()
238 pointer->Put(key, key); in TEST()
239 EXPECT_TRUE(pointer->HasKey(key)); in TEST()
240 EXPECT_TRUE(pointer->Remove(key)); in TEST()