mpusz/mp-units
1
0
Fork 1
mirror of https://github.com/mpusz/mp-units.git synced 2025-08-05 13:14:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

Remove incorrectly included test

Browse Source 
We had removed this upstream, but apparently it snuck back in from a merge/rebase conflict.
This commit is contained in:
Chip Hogg
2022-04-06 00:31:18 +00:00
parent 746aa34fcc
commit 0f776b5b5b
1 changed files with 0 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
test/unit_test/runtime/magnitude_test.cpp
View File

@@ -168,15 +168,6 @@ TEST_CASE("make_ratio performs prime factorization correctly")
as_magnitude<ratio(16'605'390'666'050, 10'000'000'000'000)>(); as_magnitude<ratio(16'605'390'666'050, 10'000'000'000'000)>();
} }
SECTION("Can handle prime number which would exceed GCC iteration limit")
{
// GCC 10 has a constexpr loop iteration limit of 262144. A naive algorithm, which performs trial division on 2 and
// all odd numbers up to sqrt(N), will exceed this limit for the following prime. Thus, for this test to pass, we
// need to be using a more efficient algorithm. (We could increase the limit, but we don't want users to have to
// mess with compiler flags just to compile the code.)
as_magnitude<334'524'384'739>();
}
SECTION("Can bypass computing primes by providing known_first_factor<N>") SECTION("Can bypass computing primes by providing known_first_factor<N>")
{ {
// Sometimes, even wheel factorization isn't enough to handle the compilers' limits on constexpr steps and/or // Sometimes, even wheel factorization isn't enough to handle the compilers' limits on constexpr steps and/or