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

style: clang-format new rules applied to the code base

Browse Source
This commit is contained in:
Mateusz Pusz
2023-05-26 14:20:00 +02:00
parent 561fbf7c93
commit 52bbd00ab4
20 changed files with 78 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/unit_test/runtime/almost_equals.h
+2 -2
View File
@@ -31,8 +31,8 @@ struct AlmostEqualsMatcher : Catch::Matchers::MatcherGenericBase {
AlmostEqualsMatcher(const T& target) : target_{target} {}
template<std::convertible_to<T> U>
requires std::same_as<typename T::rep, typename U::rep> && treat_as_floating_point<typename T::rep> bool
match(const U& other) const
requires std::same_as<typename T::rep, typename U::rep> && treat_as_floating_point<typename T::rep>
bool match(const U& other) const
{
using std::abs;
using common = std::common_type_t<T, U>;
test/unit_test/runtime/fmt_test.cpp
+2 -2
View File
@@ -722,8 +722,8 @@ TEST_CASE("localization with the 'L' specifier", "[text][fmt][localization]")
SECTION("full format {:%LQ %q} on a quantity")
{
CHECK(UNITS_STD_FMT::format(grp2, "{:%LQ %q}", 299792458 * isq::speed[m / s]) == "2_99_79_24_58 m/s");
CHECK(UNITS_STD_FMT::format(grp3, "{:%LQ %q}", 299792458 * isq::speed[m / s]) == "299'792'458 m/s");
CHECK(UNITS_STD_FMT::format(grp2, "{:%LQ %q}", 299'792'458 * isq::speed[m / s]) == "2_99_79_24_58 m/s");
CHECK(UNITS_STD_FMT::format(grp3, "{:%LQ %q}", 299'792'458 * isq::speed[m / s]) == "299'792'458 m/s");
}
}
test/unit_test/static/prime_test.cpp
+1 -1
View File
@@ -44,7 +44,7 @@ static_assert(check_primes<2>(std::make_index_sequence<122>{}));
// using numbers of the form (210 * n + 121) as trial divisors, which is a problem if any are prime. For n = 1, we have
// a divisor of (210 + 121 = 331), which happens to be prime but will not be used. Thus, (331 * 331 = 109561) is a
// composite number which could wrongly appear prime if we skip over 331.
static_assert(wheel_factorizer<4>::is_prime(109561) == is_prime_by_trial_division(109561));
static_assert(wheel_factorizer<4>::is_prime(109'561) == is_prime_by_trial_division(109'561));
static_assert(wheel_factorizer<1>::coprimes_in_first_wheel.size() == 1);
static_assert(wheel_factorizer<2>::coprimes_in_first_wheel.size() == 2);
test/unit_test/static/quantity_test.cpp
+16 -16
View File
@@ -760,10 +760,10 @@ static_assert(321. * m != 123 * m);
static_assert(!(123. * m == 321 * m));
static_assert(!(123. * m != 123 * m));
static_assert(123 * km == 123000 * m);
static_assert(321 * km != 123000 * m);
static_assert(!(123 * km == 321000 * m));
static_assert(!(123 * km != 123000 * m));
static_assert(123 * km == 123'000 * m);
static_assert(321 * km != 123'000 * m);
static_assert(!(123 * km == 321'000 * m));
static_assert(!(123 * km != 123'000 * m));
// dimensionless
static_assert(std::equality_comparable_with<quantity<dimensionless[one]>, double>);
@@ -818,18 +818,18 @@ static_assert(!(123. * m > 321 * m));
static_assert(!(123. * m > 123 * m));
static_assert(!(123. * m >= 321 * m));
static_assert(123 * km < 321000 * m);
static_assert(123 * km <= 123000 * m);
static_assert(123 * km <= 321000 * m);
static_assert(321 * km > 123000 * m);
static_assert(123 * km >= 123000 * m);
static_assert(321 * km >= 123000 * m);
static_assert(!(321 * km < 123000 * m));
static_assert(!(123 * km < 123000 * m));
static_assert(!(321 * km <= 123000 * m));
static_assert(!(123 * km > 321000 * m));
static_assert(!(123 * km > 123000 * m));
static_assert(!(123 * km >= 321000 * m));
static_assert(123 * km < 321'000 * m);
static_assert(123 * km <= 123'000 * m);
static_assert(123 * km <= 321'000 * m);
static_assert(321 * km > 123'000 * m);
static_assert(123 * km >= 123'000 * m);
static_assert(321 * km >= 123'000 * m);
static_assert(!(321 * km < 123'000 * m));
static_assert(!(123 * km < 123'000 * m));
static_assert(!(321 * km <= 123'000 * m));
static_assert(!(123 * km > 321'000 * m));
static_assert(!(123 * km > 123'000 * m));
static_assert(!(123 * km >= 321'000 * m));
// dimensionless
static_assert(123 * one < 321);