Lines Matching full:i
115 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
116 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
117 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
127 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
128 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
129 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
159 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
160 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
161 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
172 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
173 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
179 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
180 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
181 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
192 for (uint32_t i = NODE_NUMBERS / 2; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
193 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
194 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
216 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
217 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
218 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
224 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
225 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
226 std::string iValue = myValue + std::to_string(i + 1); in HWTEST_F_L0()
233 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
234 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
235 std::string iValue = myValue + std::to_string(i + 1); in HWTEST_F_L0()
242 for (uint32_t i = NODE_NUMBERS / 2; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
243 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
244 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
251 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
252 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
258 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
259 std::string iKey = myKey + std::to_string(i); in HWTEST_F_L0()
260 std::string iValue = myValue + std::to_string(i); in HWTEST_F_L0()
281 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
282 key.Update(JSTaggedValue(i)); in HWTEST_F_L0()
283 value.Update(JSTaggedValue(i)); in HWTEST_F_L0()
291 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0() local
307 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
321 for (uint32_t i = NODE_NUMBERS / 2 + 1; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
353 for (size_t i = 0; i < hashCollisionVector.size(); i++) { in HWTEST_F_L0() local
354 key.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
355 value.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
360 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
370 if (i <= NODE_NUMBERS - 1U) { in HWTEST_F_L0()
384 for (uint32_t i = 0; i < NODE_NUMBERS - 1; i++) { in HWTEST_F_L0() local
385 key.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
386 value.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
391 for (uint32_t i = 0; i < NODE_NUMBERS - 1; i++) { in HWTEST_F_L0() local
392 value.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
401 for (uint32_t i = 0; i < NODE_NUMBERS - 1; i++) { in HWTEST_F_L0() local
403 … thread, JSTaggedValue(hashCollisionVector[i]), JSTaggedValue(hashCollisionVector[i] * 2)); in HWTEST_F_L0()
406 for (uint32_t i = 0; i < NODE_NUMBERS - 1; i++) { in HWTEST_F_L0() local
408 thread, JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
409 EXPECT_EQ(replaceResult, JSTaggedValue(hashCollisionVector[i] * 2)); in HWTEST_F_L0()
424 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
425 key.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
426 dstValue.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
427 srcValue.Update(JSTaggedValue(hashCollisionVector[i] * 2)); in HWTEST_F_L0()
434 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
436 thread, JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
437 EXPECT_EQ(replaceResult, JSTaggedValue(hashCollisionVector[i] * 2)); in HWTEST_F_L0()
441 for (uint32_t i = 0; i < REMOVE_NUMBERS; i++) { in HWTEST_F_L0() local
442 key.Update(JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
447 for (uint32_t i = 0; i < REMOVE_NUMBERS; i++) { in HWTEST_F_L0() local
448 JSTaggedValue getResult = dstHashMap->Get(thread, JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
452 for (uint32_t i = REMOVE_NUMBERS; i < NODE_NUMBERS; i++) { in HWTEST_F_L0() local
453 JSTaggedValue getResult = dstHashMap->Get(thread, JSTaggedValue(hashCollisionVector[i])); in HWTEST_F_L0()
454 EXPECT_EQ(getResult, JSTaggedValue(hashCollisionVector[i] * 2)); in HWTEST_F_L0()