Lines Matching refs:key

162   for (int key = 0; key <= 30; key++) {  in TEST()  local
163 cache.Put(key, key * 100); in TEST()
165 for (int key = 0; key <= 20; key++) { in TEST() local
166 EXPECT_FALSE(cache.HasKey(key)); in TEST()
168 for (int key = 21; key <= 30; key++) { in TEST() local
169 EXPECT_TRUE(cache.HasKey(key)); in TEST()
171 for (int key = 21; key <= 30; key++) { in TEST() local
172 EXPECT_TRUE(cache.Remove(key)); in TEST()
174 for (int key = 21; key <= 30; key++) { in TEST() local
175 EXPECT_FALSE(cache.HasKey(key)); in TEST()
181 for (int key = 0; key < 10; key++) { in TEST() local
182 cache.Put(key, key * 100); in TEST()
184 for (int key = 0; key < 10; key++) { in TEST() local
185 EXPECT_TRUE(cache.HasKey(key)); in TEST()
188 for (int key = 0; key < 10; key++) { in TEST() local
189 EXPECT_FALSE(cache.HasKey(key)); in TEST()
192 for (int key = 0; key < 10; key++) { in TEST() local
193 cache.Put(key, key * 1000); in TEST()
195 for (int key = 0; key < 10; key++) { in TEST() local
196 EXPECT_TRUE(cache.HasKey(key)); in TEST()
206 for (int key = 0; key < max_size; key++) { in TEST() local
207 cache.Put(key, key); in TEST()
211 for (int key = 0; key < max_size; key++) { in TEST() local
212 EXPECT_TRUE(cache.HasKey(key)); in TEST()
216 for (int key = 0; key < max_size; key++) { in TEST() local
217 int new_key = key + max_size; in TEST()
219 EXPECT_FALSE(cache.HasKey(key)); in TEST()
225 for (int key = max_size; key < 2 * max_size; key++) { in TEST() local
226 EXPECT_TRUE(cache.Get(key, value)); in TEST()
227 EXPECT_EQ(*value, key); in TEST()
228 EXPECT_TRUE(cache.Remove(key)); in TEST()
247 for (int key = 0; key < 100; key++) { in TEST() local
248 workers.push_back(std::thread([key, pointer]() { in TEST()
249 pointer->Put(key, key); in TEST()
250 EXPECT_TRUE(pointer->HasKey(key)); in TEST()
251 EXPECT_TRUE(pointer->Remove(key)); in TEST()