
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
(FPCore (x)
:precision binary64
(if (<= x 3e-309)
(fmod
1.0
(fma
x
(* x (sqrt 0.041666666666666664))
(/ -0.25 (sqrt 0.041666666666666664))))
(if (<= x 0.5)
(*
(fmod
(fma (* x x) (* x (+ 0.16666666666666666 (/ 0.5 x))) x)
(sqrt (fma (* x x) (fma x (* x 0.041666666666666664) -0.5) 1.0)))
(- 1.0 x))
(* (fmod 1.0 (sqrt (cos x))) (exp (- x))))))
double code(double x) {
double tmp;
if (x <= 3e-309) {
tmp = fmod(1.0, fma(x, (x * sqrt(0.041666666666666664)), (-0.25 / sqrt(0.041666666666666664))));
} else if (x <= 0.5) {
tmp = fmod(fma((x * x), (x * (0.16666666666666666 + (0.5 / x))), x), sqrt(fma((x * x), fma(x, (x * 0.041666666666666664), -0.5), 1.0))) * (1.0 - x);
} else {
tmp = fmod(1.0, sqrt(cos(x))) * exp(-x);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 3e-309) tmp = rem(1.0, fma(x, Float64(x * sqrt(0.041666666666666664)), Float64(-0.25 / sqrt(0.041666666666666664)))); elseif (x <= 0.5) tmp = Float64(rem(fma(Float64(x * x), Float64(x * Float64(0.16666666666666666 + Float64(0.5 / x))), x), sqrt(fma(Float64(x * x), fma(x, Float64(x * 0.041666666666666664), -0.5), 1.0))) * Float64(1.0 - x)); else tmp = Float64(rem(1.0, sqrt(cos(x))) * exp(Float64(-x))); end return tmp end
code[x_] := If[LessEqual[x, 3e-309], N[With[{TMP1 = 1.0, TMP2 = N[(x * N[(x * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision] + N[(-0.25 / N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], If[LessEqual[x, 0.5], N[(N[With[{TMP1 = N[(N[(x * x), $MachinePrecision] * N[(x * N[(0.16666666666666666 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = N[Sqrt[N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3 \cdot 10^{-309}:\\
\;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x, x \cdot \sqrt{0.041666666666666664}, \frac{-0.25}{\sqrt{0.041666666666666664}}\right)\right)\right)\\
\mathbf{elif}\;x \leq 0.5:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(x \cdot x, x \cdot \left(0.16666666666666666 + \frac{0.5}{x}\right), x\right)\right) \bmod \left(\sqrt{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.041666666666666664, -0.5\right), 1\right)}\right)\right) \cdot \left(1 - x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}\\
\end{array}
\end{array}
if x < 3.000000000000001e-309Initial program 9.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f649.7
Simplified9.7%
Taylor expanded in x around inf
sub-negN/A
associate-*r/N/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
Simplified98.0%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f64N/A
sub-negN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f6495.3
Simplified95.3%
Taylor expanded in x around 0
Simplified100.0%
if 3.000000000000001e-309 < x < 0.5Initial program 7.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f646.9
Simplified6.9%
Taylor expanded in x around 0
neg-mul-1N/A
unsub-negN/A
lower--.f646.3
Simplified6.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f646.3
Simplified6.3%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
associate-+r+N/A
distribute-lft-inN/A
rgt-mult-inverseN/A
distribute-lft-inN/A
associate-*l*N/A
unpow2N/A
cube-multN/A
unpow3N/A
unpow2N/A
associate-*l*N/A
*-rgt-identityN/A
lower-fma.f64N/A
Simplified98.1%
if 0.5 < x Initial program 0.3%
Taylor expanded in x around 0
Simplified98.6%
Final simplification98.9%
(FPCore (x)
:precision binary64
(if (<= x 3e-309)
(fmod
1.0
(fma
x
(* x (sqrt 0.041666666666666664))
(/ -0.25 (sqrt 0.041666666666666664))))
(if (<= x 0.5)
(*
(fmod
(fma (* x x) (* x (+ 0.16666666666666666 (/ 0.5 x))) x)
(sqrt (fma (* x x) (fma x (* x 0.041666666666666664) -0.5) 1.0)))
(- 1.0 x))
(* (exp (- x)) (fmod (+ x 1.0) 1.0)))))
double code(double x) {
double tmp;
if (x <= 3e-309) {
tmp = fmod(1.0, fma(x, (x * sqrt(0.041666666666666664)), (-0.25 / sqrt(0.041666666666666664))));
} else if (x <= 0.5) {
tmp = fmod(fma((x * x), (x * (0.16666666666666666 + (0.5 / x))), x), sqrt(fma((x * x), fma(x, (x * 0.041666666666666664), -0.5), 1.0))) * (1.0 - x);
} else {
tmp = exp(-x) * fmod((x + 1.0), 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 3e-309) tmp = rem(1.0, fma(x, Float64(x * sqrt(0.041666666666666664)), Float64(-0.25 / sqrt(0.041666666666666664)))); elseif (x <= 0.5) tmp = Float64(rem(fma(Float64(x * x), Float64(x * Float64(0.16666666666666666 + Float64(0.5 / x))), x), sqrt(fma(Float64(x * x), fma(x, Float64(x * 0.041666666666666664), -0.5), 1.0))) * Float64(1.0 - x)); else tmp = Float64(exp(Float64(-x)) * rem(Float64(x + 1.0), 1.0)); end return tmp end
code[x_] := If[LessEqual[x, 3e-309], N[With[{TMP1 = 1.0, TMP2 = N[(x * N[(x * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision] + N[(-0.25 / N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], If[LessEqual[x, 0.5], N[(N[With[{TMP1 = N[(N[(x * x), $MachinePrecision] * N[(x * N[(0.16666666666666666 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = N[Sqrt[N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision], N[(N[Exp[(-x)], $MachinePrecision] * N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3 \cdot 10^{-309}:\\
\;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x, x \cdot \sqrt{0.041666666666666664}, \frac{-0.25}{\sqrt{0.041666666666666664}}\right)\right)\right)\\
\mathbf{elif}\;x \leq 0.5:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(x \cdot x, x \cdot \left(0.16666666666666666 + \frac{0.5}{x}\right), x\right)\right) \bmod \left(\sqrt{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.041666666666666664, -0.5\right), 1\right)}\right)\right) \cdot \left(1 - x\right)\\
\mathbf{else}:\\
\;\;\;\;e^{-x} \cdot \left(\left(x + 1\right) \bmod 1\right)\\
\end{array}
\end{array}
if x < 3.000000000000001e-309Initial program 9.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f649.7
Simplified9.7%
Taylor expanded in x around inf
sub-negN/A
associate-*r/N/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
Simplified98.0%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f64N/A
sub-negN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f6495.3
Simplified95.3%
Taylor expanded in x around 0
Simplified100.0%
if 3.000000000000001e-309 < x < 0.5Initial program 7.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f646.9
Simplified6.9%
Taylor expanded in x around 0
neg-mul-1N/A
unsub-negN/A
lower--.f646.3
Simplified6.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f646.3
Simplified6.3%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
associate-+r+N/A
distribute-lft-inN/A
rgt-mult-inverseN/A
distribute-lft-inN/A
associate-*l*N/A
unpow2N/A
cube-multN/A
unpow3N/A
unpow2N/A
associate-*l*N/A
*-rgt-identityN/A
lower-fma.f64N/A
Simplified98.1%
if 0.5 < x Initial program 0.3%
Taylor expanded in x around 0
Simplified0.1%
Taylor expanded in x around 0
lower-+.f6498.4
Simplified98.4%
Final simplification98.9%
(FPCore (x)
:precision binary64
(if (<= x 3e-309)
(fmod
1.0
(fma
x
(* x (sqrt 0.041666666666666664))
(/ -0.25 (sqrt 0.041666666666666664))))
(if (<= x 0.5)
(*
(fmod
(fma (* x x) (* x (+ 0.16666666666666666 (/ 0.5 x))) x)
(sqrt (fma (* x x) (fma x (* x 0.041666666666666664) -0.5) 1.0)))
(- 1.0 x))
(fmod 1.0 1.0))))
double code(double x) {
double tmp;
if (x <= 3e-309) {
tmp = fmod(1.0, fma(x, (x * sqrt(0.041666666666666664)), (-0.25 / sqrt(0.041666666666666664))));
} else if (x <= 0.5) {
tmp = fmod(fma((x * x), (x * (0.16666666666666666 + (0.5 / x))), x), sqrt(fma((x * x), fma(x, (x * 0.041666666666666664), -0.5), 1.0))) * (1.0 - x);
} else {
tmp = fmod(1.0, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 3e-309) tmp = rem(1.0, fma(x, Float64(x * sqrt(0.041666666666666664)), Float64(-0.25 / sqrt(0.041666666666666664)))); elseif (x <= 0.5) tmp = Float64(rem(fma(Float64(x * x), Float64(x * Float64(0.16666666666666666 + Float64(0.5 / x))), x), sqrt(fma(Float64(x * x), fma(x, Float64(x * 0.041666666666666664), -0.5), 1.0))) * Float64(1.0 - x)); else tmp = rem(1.0, 1.0); end return tmp end
code[x_] := If[LessEqual[x, 3e-309], N[With[{TMP1 = 1.0, TMP2 = N[(x * N[(x * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision] + N[(-0.25 / N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], If[LessEqual[x, 0.5], N[(N[With[{TMP1 = N[(N[(x * x), $MachinePrecision] * N[(x * N[(0.16666666666666666 + N[(0.5 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = N[Sqrt[N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3 \cdot 10^{-309}:\\
\;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x, x \cdot \sqrt{0.041666666666666664}, \frac{-0.25}{\sqrt{0.041666666666666664}}\right)\right)\right)\\
\mathbf{elif}\;x \leq 0.5:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(x \cdot x, x \cdot \left(0.16666666666666666 + \frac{0.5}{x}\right), x\right)\right) \bmod \left(\sqrt{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot 0.041666666666666664, -0.5\right), 1\right)}\right)\right) \cdot \left(1 - x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 \bmod 1\right)\\
\end{array}
\end{array}
if x < 3.000000000000001e-309Initial program 9.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f649.7
Simplified9.7%
Taylor expanded in x around inf
sub-negN/A
associate-*r/N/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
Simplified98.0%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f64N/A
sub-negN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f6495.3
Simplified95.3%
Taylor expanded in x around 0
Simplified100.0%
if 3.000000000000001e-309 < x < 0.5Initial program 7.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f646.9
Simplified6.9%
Taylor expanded in x around 0
neg-mul-1N/A
unsub-negN/A
lower--.f646.3
Simplified6.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f646.3
Simplified6.3%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
associate-+r+N/A
distribute-lft-inN/A
rgt-mult-inverseN/A
distribute-lft-inN/A
associate-*l*N/A
unpow2N/A
cube-multN/A
unpow3N/A
unpow2N/A
associate-*l*N/A
*-rgt-identityN/A
lower-fma.f64N/A
Simplified98.1%
if 0.5 < x Initial program 0.3%
Taylor expanded in x around 0
Simplified0.1%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f640.1
Simplified0.1%
Taylor expanded in x around 0
Simplified98.2%
Final simplification98.9%
(FPCore (x)
:precision binary64
(if (<= x 400.0)
(fmod
1.0
(fma
x
(* x (sqrt 0.041666666666666664))
(/ -0.25 (sqrt 0.041666666666666664))))
(fmod 1.0 1.0)))
double code(double x) {
double tmp;
if (x <= 400.0) {
tmp = fmod(1.0, fma(x, (x * sqrt(0.041666666666666664)), (-0.25 / sqrt(0.041666666666666664))));
} else {
tmp = fmod(1.0, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 400.0) tmp = rem(1.0, fma(x, Float64(x * sqrt(0.041666666666666664)), Float64(-0.25 / sqrt(0.041666666666666664)))); else tmp = rem(1.0, 1.0); end return tmp end
code[x_] := If[LessEqual[x, 400.0], N[With[{TMP1 = 1.0, TMP2 = N[(x * N[(x * N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision] + N[(-0.25 / N[Sqrt[0.041666666666666664], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 400:\\
\;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x, x \cdot \sqrt{0.041666666666666664}, \frac{-0.25}{\sqrt{0.041666666666666664}}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 \bmod 1\right)\\
\end{array}
\end{array}
if x < 400Initial program 8.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f648.3
Simplified8.3%
Taylor expanded in x around inf
sub-negN/A
associate-*r/N/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
Simplified51.8%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f64N/A
sub-negN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f6450.5
Simplified50.5%
Taylor expanded in x around 0
Simplified52.8%
if 400 < x Initial program 0.0%
Taylor expanded in x around 0
Simplified0.0%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f640.0
Simplified0.0%
Taylor expanded in x around 0
Simplified100.0%
Final simplification62.4%
(FPCore (x) :precision binary64 (fmod (+ x 1.0) 1.0))
double code(double x) {
return fmod((x + 1.0), 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod((x + 1.0d0), 1.0d0)
end function
def code(x): return math.fmod((x + 1.0), 1.0)
function code(x) return rem(Float64(x + 1.0), 1.0) end
code[x_] := N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x + 1\right) \bmod 1\right)
\end{array}
Initial program 7.0%
Taylor expanded in x around 0
Simplified6.3%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f645.2
Simplified5.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6425.1
Simplified25.1%
(FPCore (x) :precision binary64 (fmod 1.0 1.0))
double code(double x) {
return fmod(1.0, 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(1.0d0, 1.0d0)
end function
def code(x): return math.fmod(1.0, 1.0)
function code(x) return rem(1.0, 1.0) end
code[x_] := N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]
\begin{array}{l}
\\
\left(1 \bmod 1\right)
\end{array}
Initial program 7.0%
Taylor expanded in x around 0
Simplified6.3%
Taylor expanded in x around 0
lower-fmod.f64N/A
lower-exp.f645.2
Simplified5.2%
Taylor expanded in x around 0
Simplified23.6%
herbie shell --seed 2024207
(FPCore (x)
:name "expfmod (used to be hard to sample)"
:precision binary64
(* (fmod (exp x) (sqrt (cos x))) (exp (- x))))