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

Convert names to standard_case

Browse Source
This commit is contained in:
Chip Hogg
2022-03-19 16:07:39 +00:00
parent 48b6280486
commit c339383873
3 changed files with 28 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/core/include/units/bits/prime.h
+1 -1
View File
@@ -124,7 +124,7 @@ constexpr std::size_t product(const std::array<std::size_t, N>& values)
//
// [1] https://en.wikipedia.org/wiki/Wheel_factorization
template<std::size_t BasisSize>
struct WheelFactorizer {
struct wheel_factorizer {
static constexpr auto basis = first_n_primes<BasisSize>();
static constexpr std::size_t wheel_size = product(basis);
static constexpr auto coprimes_in_first_wheel =
src/core/include/units/magnitude.h
+3 -3
View File
@@ -34,7 +34,7 @@
namespace units {
namespace detail {
// Higher numbers use fewer trial divisions, at the price of more storage space.
using Factorizer = WheelFactorizer<4>;
using factorizer = wheel_factorizer<4>;
} // namespace detail
/**
@@ -274,7 +274,7 @@ constexpr std::intmax_t remove_power(std::intmax_t base, std::intmax_t pow, std:
}
// A way to check whether a number is prime at compile time.
constexpr bool is_prime(std::intmax_t n) { return (n >= 0) && Factorizer::is_prime(static_cast<std::size_t>(n)); }
constexpr bool is_prime(std::intmax_t n) { return (n >= 0) && factorizer::is_prime(static_cast<std::size_t>(n)); }
constexpr bool is_valid_base_power(const BasePower auto& bp)
{
@@ -502,7 +502,7 @@ struct prime_factorization {
if constexpr (known_first_factor<N>.has_value()) {
return known_first_factor<N>.value();
} else {
return static_cast<std::intmax_t>(Factorizer::find_first_factor(N));
return static_cast<std::intmax_t>(factorizer::find_first_factor(N));
}
}