Lines Matching refs:k
87 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local
88 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F()
92 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local
95 assert(map_.Find(Node(k), &val, &rlock)); in TEST_F()
97 assert(val.val_ == std::string(1000, k % 255)); in TEST_F()
104 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local
105 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F()
112 uint64_t k = rand.Next() % max_keys; in TEST_F() local
113 if (erased.find(k) != erased.end()) { in TEST_F()
116 assert(map_.Erase(Node(k), /*ret=*/nullptr)); in TEST_F()
117 erased.insert(k); in TEST_F()
121 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local
124 bool status = map_.Find(Node(k), &val, &rlock); in TEST_F()
125 if (erased.find(k) == erased.end()) { in TEST_F()
128 assert(val.val_ == std::string(1000, k % 255)); in TEST_F()
139 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local
140 map_.Insert(new Node(k, std::string(1000, k % 255))); in TEST_F()
144 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local