
(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 200.0 x (* -200.0 y)))
double code(double x, double y) {
return fma(200.0, x, (-200.0 * y));
}
function code(x, y) return fma(200.0, x, Float64(-200.0 * y)) end
code[x_, y_] := N[(200.0 * x + N[(-200.0 * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(200, x, -200 \cdot y\right)
\end{array}
Initial program 99.9%
Taylor expanded in y around inf 88.8%
clear-num88.8%
un-div-inv88.9%
Applied egg-rr88.9%
Taylor expanded in y around 0 99.9%
*-commutative99.9%
+-commutative99.9%
fma-define100.0%
*-commutative100.0%
Simplified100.0%
(FPCore (x y) :precision binary64 (fma -200.0 y (* 200.0 x)))
double code(double x, double y) {
return fma(-200.0, y, (200.0 * x));
}
function code(x, y) return fma(-200.0, y, Float64(200.0 * x)) end
code[x_, y_] := N[(-200.0 * y + N[(200.0 * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(-200, y, 200 \cdot x\right)
\end{array}
Initial program 99.9%
Taylor expanded in x around 0 99.9%
fma-define100.0%
Simplified100.0%
(FPCore (x y) :precision binary64 (if (or (<= y -0.004) (not (<= y 4.1e+34))) (* -200.0 y) (* 200.0 x)))
double code(double x, double y) {
double tmp;
if ((y <= -0.004) || !(y <= 4.1e+34)) {
tmp = -200.0 * y;
} else {
tmp = 200.0 * x;
}
return tmp;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if ((y <= (-0.004d0)) .or. (.not. (y <= 4.1d+34))) then
tmp = (-200.0d0) * y
else
tmp = 200.0d0 * x
end if
code = tmp
end function
public static double code(double x, double y) {
double tmp;
if ((y <= -0.004) || !(y <= 4.1e+34)) {
tmp = -200.0 * y;
} else {
tmp = 200.0 * x;
}
return tmp;
}
def code(x, y): tmp = 0 if (y <= -0.004) or not (y <= 4.1e+34): tmp = -200.0 * y else: tmp = 200.0 * x return tmp
function code(x, y) tmp = 0.0 if ((y <= -0.004) || !(y <= 4.1e+34)) tmp = Float64(-200.0 * y); else tmp = Float64(200.0 * x); end return tmp end
function tmp_2 = code(x, y) tmp = 0.0; if ((y <= -0.004) || ~((y <= 4.1e+34))) tmp = -200.0 * y; else tmp = 200.0 * x; end tmp_2 = tmp; end
code[x_, y_] := If[Or[LessEqual[y, -0.004], N[Not[LessEqual[y, 4.1e+34]], $MachinePrecision]], N[(-200.0 * y), $MachinePrecision], N[(200.0 * x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq -0.004 \lor \neg \left(y \leq 4.1 \cdot 10^{+34}\right):\\
\;\;\;\;-200 \cdot y\\
\mathbf{else}:\\
\;\;\;\;200 \cdot x\\
\end{array}
\end{array}
if y < -0.0040000000000000001 or 4.0999999999999998e34 < y Initial program 100.0%
Taylor expanded in x around 0 82.8%
if -0.0040000000000000001 < y < 4.0999999999999998e34Initial program 99.9%
Taylor expanded in x around inf 77.9%
Final simplification80.1%
(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%
(FPCore (x y) :precision binary64 (* -200.0 y))
double code(double x, double y) {
return -200.0 * y;
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (-200.0d0) * y
end function
public static double code(double x, double y) {
return -200.0 * y;
}
def code(x, y): return -200.0 * y
function code(x, y) return Float64(-200.0 * y) end
function tmp = code(x, y) tmp = -200.0 * y; end
code[x_, y_] := N[(-200.0 * y), $MachinePrecision]
\begin{array}{l}
\\
-200 \cdot y
\end{array}
Initial program 99.9%
Taylor expanded in x around 0 50.0%
herbie shell --seed 2024100
(FPCore (x y)
:name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
:precision binary64
(* 200.0 (- x y)))