Lines Matching refs:benchmark
101 void run(benchmark::State& State) const { in run()
103 benchmark::DoNotOptimize(std::map<uint64_t, int64_t>()); in run()
113 void run(benchmark::State& State) const { in run()
118 benchmark::DoNotOptimize( in run()
134 void run(benchmark::State& State) const { in run()
140 benchmark::DoNotOptimize(M); in run()
155 void run(benchmark::State& State) const { in run()
160 benchmark::DoNotOptimize(M); in run()
178 void run(benchmark::State& State) const { in run()
183 benchmark::DoNotOptimize(Map.empty()); in run()
197 void run(benchmark::State& State) const { in run()
202 benchmark::DoNotOptimize(Map.size()); in run()
220 void run(benchmark::State& State) const { in run()
225 benchmark::DoNotOptimize(Map); in run()
240 void run(benchmark::State& State) const { in run()
248 benchmark::DoNotOptimize(Map.insert(std::make_pair(K, 1))); in run()
282 run(benchmark::State& State) const { in run()
290 benchmark::DoNotOptimize(Map.insert(*H, std::make_pair(K, 1))); in run()
313 run(benchmark::State& State) const { in run()
324 benchmark::DoNotOptimize(Map.insert(Itor, std::make_pair(K, 1))); in run()
345 void run(benchmark::State& State) const { in run()
359 void run(benchmark::State& State) const { in run()
367 benchmark::DoNotOptimize(Map.insert_or_assign(K, 1)); in run()
401 run(benchmark::State& State) const { in run()
409 benchmark::DoNotOptimize(Map.insert_or_assign(*H, K, 1)); in run()
432 run(benchmark::State& State) const { in run()
443 benchmark::DoNotOptimize(Map.insert_or_assign(Itor, K, 1)); in run()
464 void run(benchmark::State& State) const { in run()
478 void run(benchmark::State& State) const { in run()
487 benchmark::DoNotOptimize(Map.emplace(K, 1)); in run()
521 run(benchmark::State& State) const { in run()
529 benchmark::DoNotOptimize(Map.emplace_hint(*H, K, 1)); in run()
552 run(benchmark::State& State) const { in run()
563 benchmark::DoNotOptimize(Map.emplace_hint(Itor, K, 1)); in run()
584 void run(benchmark::State& State) const { in run()
598 void run(benchmark::State& State) const { in run()
607 benchmark::DoNotOptimize(Map.try_emplace(K, 1)); in run()
641 run(benchmark::State& State) const { in run()
649 benchmark::DoNotOptimize(Map.try_emplace(*H, K, 1)); in run()
672 run(benchmark::State& State) const { in run()
683 benchmark::DoNotOptimize(Map.try_emplace(Itor, K, 1)); in run()
704 void run(benchmark::State& State) const { in run()
718 void run(benchmark::State& State) const { in run()
726 benchmark::DoNotOptimize(Map.erase(K)); in run()
758 void run(benchmark::State& State) const { in run()
766 benchmark::DoNotOptimize(Map.erase(H)); in run()
791 void run(benchmark::State& State) const { in run()
796 benchmark::DoNotOptimize(Map.erase(Map.begin(), Map.end())); in run()
821 void run(benchmark::State& State) const { in run()
829 benchmark::DoNotOptimize(Map.count(K)); in run()
853 void run(benchmark::State& State) const { in run()
861 benchmark::DoNotOptimize(Map.find(K)); in run()
885 void run(benchmark::State& State) const { in run()
893 benchmark::DoNotOptimize(Map.equal_range(K)); in run()
925 void run(benchmark::State& State) const { in run()
933 benchmark::DoNotOptimize(Map.lower_bound(K)); in run()
957 void run(benchmark::State& State) const { in run()
965 benchmark::DoNotOptimize(Map.upper_bound(K)); in run()
994 benchmark::Initialize(&argc, argv); in main()
995 if (benchmark::ReportUnrecognizedArguments(argc, argv)) in main()
1036 benchmark::RunSpecifiedBenchmarks(); in main()