feedc0de/mp-units
1
0
Fork 0
forked from mpusz/mp-units
Code Pull Requests Activity

Use std::accumulate

Browse Source
This commit is contained in:
Chip Hogg
2022-03-11 03:48:57 +00:00
parent 73a56115a1
commit bfa8db6139
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
src/core/include/units/bits/prime.h
View File

@@ -25,6 +25,7 @@
#include <array> #include <array>
#include <cassert> #include <cassert>
#include <cstddef> #include <cstddef>
#include <numeric>
#include <optional> #include <optional>
#include <tuple> #include <tuple>
@@ -88,9 +89,7 @@ constexpr auto coprimes_up_to(std::size_t n, const std::array<std::size_t, N> &b
template<std::size_t N> template<std::size_t N>
constexpr std::size_t product(const std::array<std::size_t, N> &values) { constexpr std::size_t product(const std::array<std::size_t, N> &values) {
std::size_t product = 1; return std::accumulate(std::begin(values), std::end(values), std::size_t{1u}, std::multiplies{});
for (const auto &v : values) { product *= v; }
return product;
} }
// A configurable instantiation of the "wheel factorization" algorithm [1] for prime numbers. // A configurable instantiation of the "wheel factorization" algorithm [1] for prime numbers.