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

Replace static_assert with template parameter constraints

Browse Source
This commit is contained in:
Chip Hogg
2022-01-04 20:06:41 -05:00
parent 63910131ff
commit 14d8d96b3c
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/core/include/units/magnitude.h
View File

@@ -103,8 +103,10 @@ namespace detail
{ {
// Helpers to perform prime factorization at compile time. // Helpers to perform prime factorization at compile time.
template<std::intmax_t N> template<std::intmax_t N>
requires requires { N > 0; }
struct prime_factorization; struct prime_factorization;
template<std::intmax_t N> template<std::intmax_t N>
requires requires { N > 0; }
using prime_factorization_t = typename prime_factorization<N>::type; using prime_factorization_t = typename prime_factorization<N>::type;
// A way to check whether a number is prime at compile time. // A way to check whether a number is prime at compile time.
@@ -115,9 +117,8 @@ constexpr bool is_prime(std::intmax_t n);
* @brief A template to represent prime number bases. * @brief A template to represent prime number bases.
*/ */
template<std::intmax_t N> template<std::intmax_t N>
struct prime_base : std::integral_constant<std::intmax_t, N> { requires requires { detail::is_prime(N); }
static_assert(detail::is_prime(N)); struct prime_base : std::integral_constant<std::intmax_t, N> {};
};
/** /**
* @brief Make a Magnitude that is a rational number. * @brief Make a Magnitude that is a rational number.
@@ -320,9 +321,8 @@ struct prime_factorization<1> { using type = magnitude<>; };
// Specialization for the prime factorization of larger numbers (recursive case). // Specialization for the prime factorization of larger numbers (recursive case).
template<std::intmax_t N> template<std::intmax_t N>
requires requires { N > 0; }
struct prime_factorization { struct prime_factorization {
static_assert(N > 1, "Can only factor positive integers.");
static constexpr std::intmax_t first_base = find_first_factor(N); static constexpr std::intmax_t first_base = find_first_factor(N);
static constexpr std::intmax_t first_power = multiplicity(first_base, N); static constexpr std::intmax_t first_power = multiplicity(first_base, N);
static constexpr std::intmax_t remainder = remove_power(first_base, first_power, N); static constexpr std::intmax_t remainder = remove_power(first_base, first_power, N);