54 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// UNSUPPORTED: c++03, c++11, c++14, c++1710 11#include <algorithm>12#include <cstddef>13#include <deque>14#include <iterator>15#include <list>16#include <string>17#include <vector>18 19#include "benchmark/benchmark.h"20#include "../../GenerateInput.h"21 22int main(int argc, char** argv) {23 auto std_reverse = [](auto first, auto last) { return std::reverse(first, last); };24 25 // {std,ranges}::reverse(normal container)26 {27 auto bm = []<class Container>(std::string name, auto reverse) {28 benchmark::RegisterBenchmark(name, [reverse](auto& st) {29 std::size_t const size = st.range(0);30 using ValueType = typename Container::value_type;31 Container c;32 std::generate_n(std::back_inserter(c), size, [] { return Generate<ValueType>::random(); });33 34 for ([[maybe_unused]] auto _ : st) {35 benchmark::DoNotOptimize(c);36 reverse(c.begin(), c.end());37 benchmark::DoNotOptimize(c);38 }39 })->Range(8, 1 << 15);40 };41 bm.operator()<std::vector<int>>("std::reverse(vector<int>)", std_reverse);42 bm.operator()<std::deque<int>>("std::reverse(deque<int>)", std_reverse);43 bm.operator()<std::list<int>>("std::reverse(list<int>)", std_reverse);44 bm.operator()<std::vector<int>>("rng::reverse(vector<int>)", std::ranges::reverse);45 bm.operator()<std::deque<int>>("rng::reverse(deque<int>)", std::ranges::reverse);46 bm.operator()<std::list<int>>("rng::reverse(list<int>)", std::ranges::reverse);47 }48 49 benchmark::Initialize(&argc, argv);50 benchmark::RunSpecifiedBenchmarks();51 benchmark::Shutdown();52 return 0;53}54