Average Error: 56.8 → 56.8
Time: 1.8s
Precision: binary64
\[\left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi\]
↓
\[\left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi\]
\left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi
↓
\left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi
double code(double x, double pi) {
	return ((double) (((double) fmod(((double) (x + pi)), ((double) (2.0 * pi)))) - pi));
}
↓
double code(double x, double pi) {
	return ((double) (((double) fmod(((double) (x + pi)), ((double) (2.0 * pi)))) - pi));
}

Error

Bits error versus x

Bits error versus pi

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 56.8

    \[\left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi\]

  2. Final simplification56.8

    \[\leadsto \left(\left(x + pi\right) \bmod \left(2 \cdot pi\right)\right) - pi\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x pi)
  :name "(- (fmod (+ x pi) (* 2 pi)) pi)"
  :precision binary64
  (- (fmod (+ x pi) (* 2.0 pi)) pi))