
(FPCore (x y) :precision binary64 (* 200.0 (- x y)))
double code(double x, double y) {
return 200.0 * (x - y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = 200.0d0 * (x - y)
end function
public static double code(double x, double y) {
return 200.0 * (x - y);
}
def code(x, y): return 200.0 * (x - y)
function code(x, y) return Float64(200.0 * Float64(x - y)) end
function tmp = code(x, y) tmp = 200.0 * (x - y); end
code[x_, y_] := N[(200.0 * N[(x - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
200 \cdot \left(x - y\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (* 200.0 (- x y)))
double code(double x, double y) {
return 200.0 * (x - y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = 200.0d0 * (x - y)
end function
public static double code(double x, double y) {
return 200.0 * (x - y);
}
def code(x, y): return 200.0 * (x - y)
function code(x, y) return Float64(200.0 * Float64(x - y)) end
function tmp = code(x, y) tmp = 200.0 * (x - y); end
code[x_, y_] := N[(200.0 * N[(x - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
200 \cdot \left(x - y\right)
\end{array}
(FPCore (x y) :precision binary64 (fma x 200.0 (* 200.0 (- y))))
double code(double x, double y) {
return fma(x, 200.0, (200.0 * -y));
}
function code(x, y) return fma(x, 200.0, Float64(200.0 * Float64(-y))) end
code[x_, y_] := N[(x * 200.0 + N[(200.0 * (-y)), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, 200, 200 \cdot \left(-y\right)\right)
\end{array}
Initial program 99.9%
sub-neg99.9%
distribute-rgt-in99.9%
fma-define100.0%
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (x y) :precision binary64 (fma -200.0 y (* x 200.0)))
double code(double x, double y) {
return fma(-200.0, y, (x * 200.0));
}
function code(x, y) return fma(-200.0, y, Float64(x * 200.0)) end
code[x_, y_] := N[(-200.0 * y + N[(x * 200.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(-200, y, x \cdot 200\right)
\end{array}
Initial program 99.9%
Taylor expanded in x around 0 99.9%
fma-define99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (x y) :precision binary64 (if (or (<= y -6.6e+24) (not (<= y 4.3e-78))) (* y -200.0) (* x 200.0)))
double code(double x, double y) {
double tmp;
if ((y <= -6.6e+24) || !(y <= 4.3e-78)) {
tmp = y * -200.0;
} else {
tmp = x * 200.0;
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if ((y <= (-6.6d+24)) .or. (.not. (y <= 4.3d-78))) then
tmp = y * (-200.0d0)
else
tmp = x * 200.0d0
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if ((y <= -6.6e+24) || !(y <= 4.3e-78)) {
tmp = y * -200.0;
} else {
tmp = x * 200.0;
}
return tmp;
}
def code(x, y): tmp = 0 if (y <= -6.6e+24) or not (y <= 4.3e-78): tmp = y * -200.0 else: tmp = x * 200.0 return tmp
function code(x, y) tmp = 0.0 if ((y <= -6.6e+24) || !(y <= 4.3e-78)) tmp = Float64(y * -200.0); else tmp = Float64(x * 200.0); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if ((y <= -6.6e+24) || ~((y <= 4.3e-78))) tmp = y * -200.0; else tmp = x * 200.0; end tmp_2 = tmp; end
code[x_, y_] := If[Or[LessEqual[y, -6.6e+24], N[Not[LessEqual[y, 4.3e-78]], $MachinePrecision]], N[(y * -200.0), $MachinePrecision], N[(x * 200.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq -6.6 \cdot 10^{+24} \lor \neg \left(y \leq 4.3 \cdot 10^{-78}\right):\\
\;\;\;\;y \cdot -200\\
\mathbf{else}:\\
\;\;\;\;x \cdot 200\\
\end{array}
\end{array}
if y < -6.5999999999999998e24 or 4.29999999999999994e-78 < y Initial program 100.0%
Taylor expanded in x around 0 72.8%
if -6.5999999999999998e24 < y < 4.29999999999999994e-78Initial program 99.9%
Taylor expanded in x around inf 85.6%
Final simplification78.8%
(FPCore (x y) :precision binary64 (* 200.0 (- x y)))
double code(double x, double y) {
return 200.0 * (x - y);
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = 200.0d0 * (x - y)
end function
public static double code(double x, double y) {
return 200.0 * (x - y);
}
def code(x, y): return 200.0 * (x - y)
function code(x, y) return Float64(200.0 * Float64(x - y)) end
function tmp = code(x, y) tmp = 200.0 * (x - y); end
code[x_, y_] := N[(200.0 * N[(x - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
200 \cdot \left(x - y\right)
\end{array}
Initial program 99.9%
Final simplification99.9%
(FPCore (x y) :precision binary64 (* y -200.0))
double code(double x, double y) {
return y * -200.0;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = y * (-200.0d0)
end function
public static double code(double x, double y) {
return y * -200.0;
}
def code(x, y): return y * -200.0
function code(x, y) return Float64(y * -200.0) end
function tmp = code(x, y) tmp = y * -200.0; end
code[x_, y_] := N[(y * -200.0), $MachinePrecision]
\begin{array}{l}
\\
y \cdot -200
\end{array}
Initial program 99.9%
Taylor expanded in x around 0 45.9%
Final simplification45.9%
herbie shell --seed 2024034
(FPCore (x y)
:name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
:precision binary64
(* 200.0 (- x y)))