Lines Matching full:mv
70 MapVector<int, int> MV; in TEST() local
73 R = MV.insert(std::make_pair(1, 2)); in TEST()
74 ASSERT_EQ(R.first, MV.begin()); in TEST()
79 R = MV.insert(std::make_pair(1, 3)); in TEST()
80 ASSERT_EQ(R.first, MV.begin()); in TEST()
85 R = MV.insert(std::make_pair(4, 5)); in TEST()
86 ASSERT_NE(R.first, MV.end()); in TEST()
91 EXPECT_EQ(MV.size(), 2u); in TEST()
92 EXPECT_EQ(MV[1], 2); in TEST()
93 EXPECT_EQ(MV[4], 5); in TEST()
95 MV.pop_back(); in TEST()
96 EXPECT_EQ(MV.size(), 1u); in TEST()
97 EXPECT_EQ(MV[1], 2); in TEST()
99 R = MV.insert(std::make_pair(4, 7)); in TEST()
100 ASSERT_NE(R.first, MV.end()); in TEST()
105 EXPECT_EQ(MV.size(), 2u); in TEST()
106 EXPECT_EQ(MV[1], 2); in TEST()
107 EXPECT_EQ(MV[4], 7); in TEST()
116 MapVector<A, AAndU> mv; in TEST() local
119 auto try0 = mv.try_emplace(zero, zero, nullptr); in TEST()
125 auto try1 = mv.try_emplace(zero, zero, nullptr); in TEST()
136 auto try2 = mv.try_emplace(2, std::move(two), std::make_unique<int>(2)); in TEST()
142 auto try3 = mv.try_emplace(std::move(two), 3, std::move(p)); in TEST()
155 MapVector<A, A> mv; in TEST() local
158 auto try0 = mv.insert_or_assign(zero, zero); in TEST()
164 auto try1 = mv.insert_or_assign(zero, zero); in TEST()
175 auto try2 = mv.try_emplace(2, std::move(two)); in TEST()
180 auto try3 = mv.insert_or_assign(std::move(two), 3); in TEST()
192 MapVector<int, int> MV; in TEST() local
194 MV.insert(std::make_pair(1, 2)); in TEST()
195 MV.insert(std::make_pair(3, 4)); in TEST()
196 MV.insert(std::make_pair(5, 6)); in TEST()
197 ASSERT_EQ(MV.size(), 3u); in TEST()
199 ASSERT_TRUE(MV.contains(1)); in TEST()
200 MV.erase(MV.find(1)); in TEST()
201 ASSERT_EQ(MV.size(), 2u); in TEST()
202 ASSERT_FALSE(MV.contains(1)); in TEST()
203 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
204 ASSERT_EQ(MV[3], 4); in TEST()
205 ASSERT_EQ(MV[5], 6); in TEST()
207 ASSERT_EQ(MV.erase(3), 1u); in TEST()
208 ASSERT_EQ(MV.size(), 1u); in TEST()
209 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
210 ASSERT_EQ(MV[5], 6); in TEST()
212 ASSERT_EQ(MV.erase(79), 0u); in TEST()
213 ASSERT_EQ(MV.size(), 1u); in TEST()
217 MapVector<int, int> MV; in TEST() local
219 MV.insert(std::make_pair(1, 11)); in TEST()
220 MV.insert(std::make_pair(2, 12)); in TEST()
221 MV.insert(std::make_pair(3, 13)); in TEST()
222 MV.insert(std::make_pair(4, 14)); in TEST()
223 MV.insert(std::make_pair(5, 15)); in TEST()
224 MV.insert(std::make_pair(6, 16)); in TEST()
225 ASSERT_EQ(MV.size(), 6u); in TEST()
227 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; }); in TEST()
228 ASSERT_EQ(MV.size(), 3u); in TEST()
229 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
230 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
231 ASSERT_EQ(MV.find(5), MV.end()); in TEST()
232 ASSERT_EQ(MV[2], 12); in TEST()
233 ASSERT_EQ(MV[4], 14); in TEST()
234 ASSERT_EQ(MV[6], 16); in TEST()
238 MapVector<int, int> MV; in TEST() local
240 MV.insert(std::make_pair(1, 11)); in TEST()
241 MV.insert(std::make_pair(2, 12)); in TEST()
242 MV.insert(std::make_pair(3, 13)); in TEST()
243 MV.insert(std::make_pair(4, 14)); in TEST()
244 MV.insert(std::make_pair(5, 15)); in TEST()
245 MV.insert(std::make_pair(6, 16)); in TEST()
246 ASSERT_EQ(MV.size(), 6u); in TEST()
249 for (auto P : make_range(MV.begin(), MV.end())) { in TEST()
255 for (auto P : make_range(MV.rbegin(), MV.rend())) { in TEST()
262 MapVector<int, std::unique_ptr<int>> MV; in TEST() local
263 MV.insert(std::make_pair(1, std::make_unique<int>(1))); in TEST()
264 MV.insert(std::make_pair(2, std::make_unique<int>(2))); in TEST()
266 ASSERT_EQ(MV.count(1), 1u); in TEST()
267 ASSERT_EQ(*MV.find(2)->second, 2); in TEST()
284 MapVectorType MV; in TYPED_TEST() local
287 R = MV.insert(std::make_pair(1, 2)); in TYPED_TEST()
288 ASSERT_EQ(R.first, MV.begin()); in TYPED_TEST()
294 R = MV.insert(Elem); in TYPED_TEST()
295 ASSERT_EQ(R.first, MV.begin()); in TYPED_TEST()
300 int& value = MV[4]; in TYPED_TEST()
304 EXPECT_EQ(MV.size(), 2u); in TYPED_TEST()
305 EXPECT_EQ(MV[1], 2); in TYPED_TEST()
306 EXPECT_EQ(MV[4], 5); in TYPED_TEST()
310 SmallMapVector<int, int, 32> MV; in TEST() local
313 R = MV.insert(std::make_pair(1, 2)); in TEST()
314 ASSERT_EQ(R.first, MV.begin()); in TEST()
319 R = MV.insert(std::make_pair(1, 3)); in TEST()
320 ASSERT_EQ(R.first, MV.begin()); in TEST()
325 R = MV.insert(std::make_pair(4, 5)); in TEST()
326 ASSERT_NE(R.first, MV.end()); in TEST()
331 EXPECT_EQ(MV.size(), 2u); in TEST()
332 EXPECT_EQ(MV[1], 2); in TEST()
333 EXPECT_EQ(MV[4], 5); in TEST()
335 MV.pop_back(); in TEST()
336 EXPECT_EQ(MV.size(), 1u); in TEST()
337 EXPECT_EQ(MV[1], 2); in TEST()
339 R = MV.insert(std::make_pair(4, 7)); in TEST()
340 ASSERT_NE(R.first, MV.end()); in TEST()
345 EXPECT_EQ(MV.size(), 2u); in TEST()
346 EXPECT_EQ(MV[1], 2); in TEST()
347 EXPECT_EQ(MV[4], 7); in TEST()
351 SmallMapVector<int, int, 32> MV; in TEST() local
353 MV.insert(std::make_pair(1, 2)); in TEST()
354 MV.insert(std::make_pair(3, 4)); in TEST()
355 MV.insert(std::make_pair(5, 6)); in TEST()
356 ASSERT_EQ(MV.size(), 3u); in TEST()
358 MV.erase(MV.find(1)); in TEST()
359 ASSERT_EQ(MV.size(), 2u); in TEST()
360 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
361 ASSERT_EQ(MV[3], 4); in TEST()
362 ASSERT_EQ(MV[5], 6); in TEST()
364 ASSERT_EQ(MV.erase(3), 1u); in TEST()
365 ASSERT_EQ(MV.size(), 1u); in TEST()
366 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
367 ASSERT_EQ(MV[5], 6); in TEST()
369 ASSERT_EQ(MV.erase(79), 0u); in TEST()
370 ASSERT_EQ(MV.size(), 1u); in TEST()
374 SmallMapVector<int, int, 32> MV; in TEST() local
376 MV.insert(std::make_pair(1, 11)); in TEST()
377 MV.insert(std::make_pair(2, 12)); in TEST()
378 MV.insert(std::make_pair(3, 13)); in TEST()
379 MV.insert(std::make_pair(4, 14)); in TEST()
380 MV.insert(std::make_pair(5, 15)); in TEST()
381 MV.insert(std::make_pair(6, 16)); in TEST()
382 ASSERT_EQ(MV.size(), 6u); in TEST()
384 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; }); in TEST()
385 ASSERT_EQ(MV.size(), 3u); in TEST()
386 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
387 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
388 ASSERT_EQ(MV.find(5), MV.end()); in TEST()
389 ASSERT_EQ(MV[2], 12); in TEST()
390 ASSERT_EQ(MV[4], 14); in TEST()
391 ASSERT_EQ(MV[6], 16); in TEST()
395 SmallMapVector<int, int, 32> MV; in TEST() local
397 MV.insert(std::make_pair(1, 11)); in TEST()
398 MV.insert(std::make_pair(2, 12)); in TEST()
399 MV.insert(std::make_pair(3, 13)); in TEST()
400 MV.insert(std::make_pair(4, 14)); in TEST()
401 MV.insert(std::make_pair(5, 15)); in TEST()
402 MV.insert(std::make_pair(6, 16)); in TEST()
403 ASSERT_EQ(MV.size(), 6u); in TEST()
406 for (auto P : make_range(MV.begin(), MV.end())) { in TEST()
412 for (auto P : make_range(MV.rbegin(), MV.rend())) { in TEST()
419 SmallMapVector<int, std::unique_ptr<int>, 8> MV; in TEST() local
420 MV.insert(std::make_pair(1, std::make_unique<int>(1))); in TEST()
421 MV.insert(std::make_pair(2, std::make_unique<int>(2))); in TEST()
423 ASSERT_EQ(MV.count(1), 1u); in TEST()
424 ASSERT_EQ(*MV.find(2)->second, 2); in TEST()
428 SmallMapVector<int, int, 1> MV; in TEST() local
431 R = MV.insert(std::make_pair(1, 2)); in TEST()
432 ASSERT_EQ(R.first, MV.begin()); in TEST()
437 R = MV.insert(std::make_pair(1, 3)); in TEST()
438 ASSERT_EQ(R.first, MV.begin()); in TEST()
443 R = MV.insert(std::make_pair(4, 5)); in TEST()
444 ASSERT_NE(R.first, MV.end()); in TEST()
449 EXPECT_EQ(MV.size(), 2u); in TEST()
450 EXPECT_EQ(MV[1], 2); in TEST()
451 EXPECT_EQ(MV[4], 5); in TEST()
453 MV.pop_back(); in TEST()
454 EXPECT_EQ(MV.size(), 1u); in TEST()
455 EXPECT_EQ(MV[1], 2); in TEST()
457 R = MV.insert(std::make_pair(4, 7)); in TEST()
458 ASSERT_NE(R.first, MV.end()); in TEST()
463 EXPECT_EQ(MV.size(), 2u); in TEST()
464 EXPECT_EQ(MV[1], 2); in TEST()
465 EXPECT_EQ(MV[4], 7); in TEST()
469 SmallMapVector<int, int, 1> MV; in TEST() local
471 MV.insert(std::make_pair(1, 2)); in TEST()
472 MV.insert(std::make_pair(3, 4)); in TEST()
473 MV.insert(std::make_pair(5, 6)); in TEST()
474 ASSERT_EQ(MV.size(), 3u); in TEST()
476 MV.erase(MV.find(1)); in TEST()
477 ASSERT_EQ(MV.size(), 2u); in TEST()
478 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
479 ASSERT_EQ(MV[3], 4); in TEST()
480 ASSERT_EQ(MV[5], 6); in TEST()
482 ASSERT_EQ(MV.erase(3), 1u); in TEST()
483 ASSERT_EQ(MV.size(), 1u); in TEST()
484 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
485 ASSERT_EQ(MV[5], 6); in TEST()
487 ASSERT_EQ(MV.erase(79), 0u); in TEST()
488 ASSERT_EQ(MV.size(), 1u); in TEST()
492 SmallMapVector<int, int, 1> MV; in TEST() local
494 MV.insert(std::make_pair(1, 11)); in TEST()
495 MV.insert(std::make_pair(2, 12)); in TEST()
496 MV.insert(std::make_pair(3, 13)); in TEST()
497 MV.insert(std::make_pair(4, 14)); in TEST()
498 MV.insert(std::make_pair(5, 15)); in TEST()
499 MV.insert(std::make_pair(6, 16)); in TEST()
500 ASSERT_EQ(MV.size(), 6u); in TEST()
502 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; }); in TEST()
503 ASSERT_EQ(MV.size(), 3u); in TEST()
504 ASSERT_EQ(MV.find(1), MV.end()); in TEST()
505 ASSERT_EQ(MV.find(3), MV.end()); in TEST()
506 ASSERT_EQ(MV.find(5), MV.end()); in TEST()
507 ASSERT_EQ(MV[2], 12); in TEST()
508 ASSERT_EQ(MV[4], 14); in TEST()
509 ASSERT_EQ(MV[6], 16); in TEST()
513 SmallMapVector<int, int, 1> MV; in TEST() local
515 MV.insert(std::make_pair(1, 11)); in TEST()
516 MV.insert(std::make_pair(2, 12)); in TEST()
517 MV.insert(std::make_pair(3, 13)); in TEST()
518 MV.insert(std::make_pair(4, 14)); in TEST()
519 MV.insert(std::make_pair(5, 15)); in TEST()
520 MV.insert(std::make_pair(6, 16)); in TEST()
521 ASSERT_EQ(MV.size(), 6u); in TEST()
524 for (auto P : make_range(MV.begin(), MV.end())) { in TEST()
530 for (auto P : make_range(MV.rbegin(), MV.rend())) { in TEST()