Lines Matching refs:Map
115 auto& Map = Data.Maps.front(); in run() local
119 std::map<uint64_t, int64_t>(Map.begin(), Map.end())); in run()
121 std::map<uint64_t, int64_t> M{Map.begin(), Map.end()}; in run()
122 if (M != Map) in run()
136 auto& Map = Data.Maps.front(); in run() local
139 std::map<uint64_t, int64_t> M(Map); in run()
142 std::map<uint64_t, int64_t> M(Map); in run()
143 if (M != Map) in run()
158 for (auto& Map : Data.Maps) { in run() local
159 std::map<uint64_t, int64_t> M(std::move(Map)); in run()
180 auto& Map = Data.Maps.front(); in run() local
183 benchmark::DoNotOptimize(Map.empty()); in run()
185 if (Map.empty()) in run()
199 auto& Map = Data.Maps.front(); in run() local
202 benchmark::DoNotOptimize(Map.size()); in run()
204 if (Map.size() != MapSize) in run()
223 for (auto& Map : Data.Maps) { in run() local
224 Map.clear(); in run()
225 benchmark::DoNotOptimize(Map); in run()
245 for (auto& Map : Data.Maps) { 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()
286 auto& Map = Data.Maps[I]; 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()
317 auto& Map = Data.Maps[I]; in run() local
321 ? Map.begin() in run()
322 : hint == ::Hint::Third ? Third : Map.end(); in run()
324 benchmark::DoNotOptimize(Map.insert(Itor, std::make_pair(K, 1))); in run()
326 size_t Size = Map.size(); in run()
327 Map.insert(Itor, std::make_pair(K, 1)); in run()
329 if (Size != Map.size()) in run()
332 if (Size + 1 != Map.size()) in run()
364 for (auto& Map : Data.Maps) { 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()
405 auto& Map = Data.Maps[I]; 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()
436 auto& Map = Data.Maps[I]; in run() local
440 ? Map.begin() in run()
441 : hint == ::Hint::Third ? Third : Map.end(); in run()
443 benchmark::DoNotOptimize(Map.insert_or_assign(Itor, K, 1)); in run()
445 size_t Size = Map.size(); in run()
446 Map.insert_or_assign(Itor, K, 1); in run()
448 if (Size != Map.size()) in run()
451 if (Size + 1 != Map.size()) in run()
484 for (auto& Map : Data.Maps) { in run() local
487 benchmark::DoNotOptimize(Map.emplace(K, 1)); in run()
489 bool Inserted = Map.emplace(K, 1).second; in run()
525 auto& Map = Data.Maps[I]; 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()
556 auto& Map = Data.Maps[I]; in run() local
560 ? Map.begin() in run()
561 : hint == ::Hint::Third ? Third : Map.end(); in run()
563 benchmark::DoNotOptimize(Map.emplace_hint(Itor, K, 1)); in run()
565 size_t Size = Map.size(); in run()
566 Map.emplace_hint(Itor, K, 1); in run()
568 if (Size != Map.size()) in run()
571 if (Size + 1 != Map.size()) in run()
604 for (auto& Map : Data.Maps) { in run() local
607 benchmark::DoNotOptimize(Map.try_emplace(K, 1)); in run()
609 bool Inserted = Map.try_emplace(K, 1).second; in run()
645 auto& Map = Data.Maps[I]; 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()
676 auto& Map = Data.Maps[I]; in run() local
680 ? Map.begin() in run()
681 : hint == ::Hint::Third ? Third : Map.end(); in run()
683 benchmark::DoNotOptimize(Map.try_emplace(Itor, K, 1)); in run()
685 size_t Size = Map.size(); in run()
686 Map.try_emplace(Itor, K, 1); in run()
688 if (Size != Map.size()) in run()
691 if (Size + 1 != Map.size()) in run()
723 for (auto& Map : Data.Maps) { in run() local
726 benchmark::DoNotOptimize(Map.erase(K)); in run()
728 size_t I = Map.erase(K); in run()
764 auto& Map = Data.Maps[I]; in run() local
766 benchmark::DoNotOptimize(Map.erase(H)); in run()
769 if (!Map.empty()) in run()
794 for (auto& Map : Data.Maps) { in run() local
796 benchmark::DoNotOptimize(Map.erase(Map.begin(), Map.end())); in run()
798 Map.erase(Map.begin(), Map.end()); in run()
799 if (!Map.empty()) in run()
825 auto& Map = Data.Maps.front(); in run() local
829 benchmark::DoNotOptimize(Map.count(K)); in run()
831 size_t I = Map.count(K); in run()
857 auto& Map = Data.Maps.front(); in run() local
861 benchmark::DoNotOptimize(Map.find(K)); in run()
863 auto Itor = Map.find(K); in run()
865 if (Itor == Map.end()) in run()
868 if (Itor != Map.end()) in run()
889 auto& Map = Data.Maps.front(); in run() local
893 benchmark::DoNotOptimize(Map.equal_range(K)); in run()
895 auto Range = Map.equal_range(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()
904 Range.second == Map.end() || Range.second->first - 2 != Key) 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()
929 auto& Map = Data.Maps.front(); 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()
961 auto& Map = Data.Maps.front(); 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()
971 if (Itor == Map.end() && K == 2 * MapSize) { in run()
975 if (Itor == Map.end() || Itor->first - 2 != Key) in run()
978 if (Itor == Map.end() || Itor->first - 1 != K) in run()