mirror of
https://github.com/boostorg/math.git
synced 2026-02-11 11:52:21 +00:00
111 lines
3.9 KiB
C++
111 lines
3.9 KiB
C++
// Copyright 2020 Matt Borland
|
|
//
|
|
// Use, modification and distribution are subject to the
|
|
// Boost Software License, Version 1.0.
|
|
// (See accompanying file LICENSE_1_0.txt
|
|
// or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include <boost/math/special_functions/prime_sieve.hpp>
|
|
#include <benchmark/benchmark.h>
|
|
#include <primesieve.hpp>
|
|
#include <vector>
|
|
|
|
// Individual Algos
|
|
template<class Integer>
|
|
inline auto linear_sieve_helper(Integer upper_bound, std::vector<Integer> primes) -> std::vector<Integer>
|
|
{
|
|
boost::math::detail::linear_sieve(upper_bound, primes);
|
|
return primes;
|
|
}
|
|
|
|
template<class Integer>
|
|
void linear_sieve(benchmark::State& state)
|
|
{
|
|
Integer upper = static_cast<Integer>(state.range(0));
|
|
for(auto _ : state)
|
|
{
|
|
std::vector<Integer> primes;
|
|
benchmark::DoNotOptimize(linear_sieve_helper(upper, primes));
|
|
}
|
|
state.SetComplexityN(state.range(0));
|
|
}
|
|
|
|
template<class Integer>
|
|
inline auto mask_sieve_helper(Integer lower_bound, Integer upper_bound, std::vector<Integer> primes) -> std::vector<Integer>
|
|
{
|
|
boost::math::detail::mask_sieve(lower_bound, upper_bound, primes);
|
|
return primes;
|
|
}
|
|
|
|
template<class Integer>
|
|
void mask_sieve(benchmark::State& state)
|
|
{
|
|
Integer lower = static_cast<Integer>(2);
|
|
Integer upper = static_cast<Integer>(state.range(0));
|
|
for(auto _ : state)
|
|
{
|
|
std::vector<Integer> primes;
|
|
benchmark::DoNotOptimize(mask_sieve_helper(lower, upper, primes));
|
|
}
|
|
state.SetComplexityN(state.range(0));
|
|
}
|
|
|
|
template<class ExecuitionPolicy, class Integer, class Container>
|
|
inline auto prime_sieve_helper(ExecuitionPolicy policy, Integer upper, Container primes)
|
|
{
|
|
boost::math::prime_sieve(policy, upper, primes);
|
|
return primes;
|
|
}
|
|
|
|
// Complete Implementations
|
|
template <class Integer>
|
|
void prime_sieve(benchmark::State& state)
|
|
{
|
|
Integer upper = static_cast<Integer>(state.range(0));
|
|
for(auto _ : state)
|
|
{
|
|
std::vector<Integer> primes;
|
|
benchmark::DoNotOptimize(prime_sieve_helper(std::execution::par, upper, primes));
|
|
}
|
|
state.SetComplexityN(state.range(0));
|
|
}
|
|
|
|
template <class Integer>
|
|
inline auto kimwalish_primes_helper(Integer upper, std::vector<Integer> primes) -> std::vector<Integer>
|
|
{
|
|
primesieve::generate_primes(upper, &primes);
|
|
return primes;
|
|
}
|
|
|
|
template <class Integer>
|
|
void kimwalish_primes(benchmark::State& state)
|
|
{
|
|
|
|
Integer upper = static_cast<Integer>(state.range(0));
|
|
for (auto _ : state)
|
|
{
|
|
std::vector<Integer> primes;
|
|
benchmark::DoNotOptimize(kimwalish_primes_helper(upper, primes));
|
|
}
|
|
state.SetComplexityN(state.range(0));
|
|
}
|
|
|
|
// Invidiual Implementations
|
|
// Linear
|
|
BENCHMARK_TEMPLATE(linear_sieve, int32_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 16)->Complexity(benchmark::oN);
|
|
BENCHMARK_TEMPLATE(linear_sieve, int64_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 16)->Complexity(benchmark::oN);
|
|
BENCHMARK_TEMPLATE(linear_sieve, uint32_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 16)->Complexity(benchmark::oN);
|
|
|
|
// Segmented
|
|
BENCHMARK_TEMPLATE(mask_sieve, int32_t)->RangeMultiplier(2)->Range(1 << 2, 2 << 22)->Complexity(benchmark::oNLogN);
|
|
BENCHMARK_TEMPLATE(mask_sieve, int64_t)->RangeMultiplier(2)->Range(1 << 2, 2 << 22)->Complexity(benchmark::oNLogN);
|
|
BENCHMARK_TEMPLATE(mask_sieve, uint32_t)->RangeMultiplier(2)->Range(1 << 2, 2 << 22)->Complexity(benchmark::oNLogN);
|
|
|
|
// Complete Implemenations
|
|
BENCHMARK_TEMPLATE(prime_sieve, int32_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 22)->Complexity(benchmark::oN)->UseRealTime();
|
|
BENCHMARK_TEMPLATE(prime_sieve, int64_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 30)->Complexity(benchmark::oN)->UseRealTime();
|
|
BENCHMARK_TEMPLATE(kimwalish_primes, int64_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 30)->Complexity(benchmark::oN)->UseRealTime(); // Benchmark
|
|
BENCHMARK_TEMPLATE(prime_sieve, uint32_t)->RangeMultiplier(2)->Range(1 << 1, 1 << 22)->Complexity(benchmark::oN)->UseRealTime();
|
|
|
|
BENCHMARK_MAIN();
|