Lines Matching refs:K
246 for (auto K : Data.Keys) { in run() local
248 benchmark::DoNotOptimize(Map.insert(std::make_pair(K, 1))); in run()
250 bool Inserted = Map.insert(std::make_pair(K, 1)).second; in run()
288 for (auto K : Data.Keys) { in run() local
290 benchmark::DoNotOptimize(Map.insert(*H, std::make_pair(K, 1))); in run()
292 auto Inserted = Map.insert(*H, std::make_pair(K, 1)); in run()
319 for (auto K : Data.Keys) { in run() local
324 benchmark::DoNotOptimize(Map.insert(Itor, std::make_pair(K, 1))); in run()
327 Map.insert(Itor, std::make_pair(K, 1)); in run()
365 for (auto K : Data.Keys) { in run() local
367 benchmark::DoNotOptimize(Map.insert_or_assign(K, 1)); in run()
369 bool Inserted = Map.insert_or_assign(K, 1).second; in run()
407 for (auto K : Data.Keys) { in run() local
409 benchmark::DoNotOptimize(Map.insert_or_assign(*H, K, 1)); in run()
411 auto Inserted = Map.insert_or_assign(*H, K, 1); in run()
438 for (auto K : Data.Keys) { in run() local
443 benchmark::DoNotOptimize(Map.insert_or_assign(Itor, K, 1)); in run()
446 Map.insert_or_assign(Itor, K, 1); in run()
485 for (auto K : Data.Keys) { in run() local
487 benchmark::DoNotOptimize(Map.emplace(K, 1)); in run()
489 bool Inserted = Map.emplace(K, 1).second; in run()
527 for (auto K : Data.Keys) { in run() local
529 benchmark::DoNotOptimize(Map.emplace_hint(*H, K, 1)); in run()
531 auto Inserted = Map.emplace_hint(*H, K, 1); in run()
558 for (auto K : Data.Keys) { in run() local
563 benchmark::DoNotOptimize(Map.emplace_hint(Itor, K, 1)); in run()
566 Map.emplace_hint(Itor, K, 1); in run()
605 for (auto K : Data.Keys) { in run() local
607 benchmark::DoNotOptimize(Map.try_emplace(K, 1)); in run()
609 bool Inserted = Map.try_emplace(K, 1).second; in run()
647 for (auto K : Data.Keys) { in run() local
649 benchmark::DoNotOptimize(Map.try_emplace(*H, K, 1)); in run()
651 auto Inserted = Map.try_emplace(*H, K, 1); in run()
678 for (auto K : Data.Keys) { in run() local
683 benchmark::DoNotOptimize(Map.try_emplace(Itor, K, 1)); in run()
686 Map.try_emplace(Itor, K, 1); in run()
724 for (auto K : Data.Keys) { in run() local
726 benchmark::DoNotOptimize(Map.erase(K)); in run()
728 size_t I = Map.erase(K); in run()
827 for (auto K : Data.Keys) { in run() local
829 benchmark::DoNotOptimize(Map.count(K)); in run()
831 size_t I = Map.count(K); in run()
859 for (auto K : Data.Keys) { in run() local
861 benchmark::DoNotOptimize(Map.find(K)); in run()
863 auto Itor = Map.find(K); in run()
891 for (auto K : Data.Keys) { in run() local
893 benchmark::DoNotOptimize(Map.equal_range(K)); in run()
895 auto Range = Map.equal_range(K); in run()
898 auto Key = K; in run()
899 if (Range.second == Map.end() && K == 2 * MapSize) { in run()
903 if (Range.first == Map.end() || Range.first->first != K || in run()
907 if (Range.first == Map.end() || Range.first->first - 1 != K || in run()
908 Range.second == Map.end() || Range.second->first - 1 != K) in run()
931 for (auto K : Data.Keys) { in run() local
933 benchmark::DoNotOptimize(Map.lower_bound(K)); in run()
935 auto Itor = Map.lower_bound(K); in run()
937 if (Itor == Map.end() || Itor->first != K) in run()
940 if (Itor == Map.end() || Itor->first - 1 != K) in run()
963 for (auto K : Data.Keys) { in run() local
965 benchmark::DoNotOptimize(Map.upper_bound(K)); in run()
967 std::map<uint64_t, int64_t>::iterator Itor = Map.upper_bound(K); in run()
970 auto Key = K; in run()
971 if (Itor == Map.end() && K == 2 * MapSize) { in run()
978 if (Itor == Map.end() || Itor->first - 1 != K) in run()