Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / test / benchmarks / algorithms / count.bench.cpp
blob46b85e909efa5dce2d3b933d2b75b336e43ce8c5
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-exception
6 //
7 //===----------------------------------------------------------------------===//
9 // UNSUPPORTED: c++03, c++11, c++14, c++17
11 #include <algorithm>
12 #include <benchmark/benchmark.h>
13 #include <cstring>
14 #include <random>
15 #include <vector>
17 static void bm_vector_bool_count(benchmark::State& state) {
18 std::vector<bool> vec1(state.range(), false);
20 for (auto _ : state) {
21 benchmark::DoNotOptimize(vec1);
22 benchmark::DoNotOptimize(std::count(vec1.begin(), vec1.end(), true));
25 BENCHMARK(bm_vector_bool_count)->DenseRange(1, 8)->Range(16, 1 << 20);
27 static void bm_vector_bool_ranges_count(benchmark::State& state) {
28 std::vector<bool> vec1(state.range(), false);
30 for (auto _ : state) {
31 benchmark::DoNotOptimize(vec1);
32 benchmark::DoNotOptimize(std::ranges::count(vec1.begin(), vec1.end(), true));
35 BENCHMARK(bm_vector_bool_ranges_count)->DenseRange(1, 8)->Range(16, 1 << 20);
37 BENCHMARK_MAIN();