3 ! MOD/MODULO of large arguments.
4 ! The naive algorithm goes pear-shaped for large arguments, instead
6 ! Here we test only with constant arguments (evaluated with
7 ! mpfr_fmod), as we don't want to cause failures on targets with a
13 if (abs(r1
- 0.995928764) > 1e-5) STOP 1
14 r1
= modulo (1e22
, -1.7)
15 if (abs(r1
+ 0.704071283) > 1e-5) STOP 2
16 end program mod_large_1