quantity constraints refactored

This commit is contained in:
Mateusz Pusz committed 2019-11-15 20:20:25 +01:00
1 parent 2b5eb30cd4
commit 57e464cc99
6 files changed
+241 -145

No files matched your search

+19 -39
View File
@@ -23,51 +23,31 @@
#pragma once
#include <units/bits/hacks.h>
#include <units/bits/numeric_concepts.h>
#include <units/bits/customization_points.h>
#include <units/ratio.h>
namespace units {
#if __GNUC__ < 10
namespace detail {
template<typename T>
concept Number = std::regular<T> &&
std::totally_ordered<T> &&
requires(T a, T b) {
{ a + b } -> T;
{ a - b } -> T;
{ a * b } -> T;
{ a / b } -> T;
{ +a } -> T;
{ -a } -> T;
{ a += b } -> T&;
{ a -= b } -> T&;
{ a *= b } -> T&;
{ a /= b } -> T&;
{ T{0} }; // can construct a T from a zero
// …
};
template<typename T, typename U = T>
concept basic_arithmetic = // exposition only
std::magma<std::ranges::plus, T, U> &&
std::magma<std::ranges::minus, T, U> &&
std::magma<std::ranges::times, T, U> &&
std::magma<std::ranges::divided_by, T, U>;
#else
template<typename From, typename To>
concept safe_convertible = // exposition only
std::convertible_to<From, To> &&
(treat_as_floating_point<To> || (!treat_as_floating_point<From>));
template<typename T>
concept Number = std::regular<T> &&
std::totally_ordered<T> &&
requires(T a, T b) {
{ a + b } -> std::same_as<T>;
{ a - b } -> std::same_as<T>;
{ a * b } -> std::same_as<T>;
{ a / b } -> std::same_as<T>;
{ +a } -> std::same_as<T>;
{ -a } -> std::same_as<T>;
{ a += b } -> std::same_as<T&>;
{ a -= b } -> std::same_as<T&>;
{ a *= b } -> std::same_as<T&>;
{ a /= b } -> std::same_as<T&>;
{ T{0} }; // can construct a T from a zero
// …
};
template<typename Rep, typename unit_from, typename unit_to>
concept safe_divisible = // exposition only
treat_as_floating_point<Rep> ||
ratio_divide<typename unit_from::ratio, typename unit_to::ratio>::den == 1;
#endif
// InstanceOf
}
} // namespace units