
(FPCore (x y z) :precision binary64 (* x (- 1.0 (* y z))))
double code(double x, double y, double z) {
return x * (1.0 - (y * z));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = x * (1.0d0 - (y * z))
end function
public static double code(double x, double y, double z) {
return x * (1.0 - (y * z));
}
def code(x, y, z): return x * (1.0 - (y * z))
function code(x, y, z) return Float64(x * Float64(1.0 - Float64(y * z))) end
function tmp = code(x, y, z) tmp = x * (1.0 - (y * z)); end
code[x_, y_, z_] := N[(x * N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \left(1 - y \cdot z\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* x (- 1.0 (* y z))))
double code(double x, double y, double z) {
return x * (1.0 - (y * z));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = x * (1.0d0 - (y * z))
end function
public static double code(double x, double y, double z) {
return x * (1.0 - (y * z));
}
def code(x, y, z): return x * (1.0 - (y * z))
function code(x, y, z) return Float64(x * Float64(1.0 - Float64(y * z))) end
function tmp = code(x, y, z) tmp = x * (1.0 - (y * z)); end
code[x_, y_, z_] := N[(x * N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \left(1 - y \cdot z\right)
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* y z) -5e+229) (* y (- 0.0 (* z x))) (- x (* (* y z) x))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else {
tmp = x - ((y * z) * x);
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((y * z) <= (-5d+229)) then
tmp = y * (0.0d0 - (z * x))
else
tmp = x - ((y * z) * x)
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else {
tmp = x - ((y * z) * x);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if (y * z) <= -5e+229: tmp = y * (0.0 - (z * x)) else: tmp = x - ((y * z) * x) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (Float64(y * z) <= -5e+229) tmp = Float64(y * Float64(0.0 - Float64(z * x))); else tmp = Float64(x - Float64(Float64(y * z) * x)); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((y * z) <= -5e+229)
tmp = y * (0.0 - (z * x));
else
tmp = x - ((y * z) * x);
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -5e+229], N[(y * N[(0.0 - N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(y * z), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot z \leq -5 \cdot 10^{+229}:\\
\;\;\;\;y \cdot \left(0 - z \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;x - \left(y \cdot z\right) \cdot x\\
\end{array}
\end{array}
if (*.f64 y z) < -5.0000000000000005e229Initial program 73.0%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.0%
Applied egg-rr73.0%
flip--N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip--N/A
sub-negN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-outN/A
sub0-negN/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
sub0-negN/A
distribute-lft-neg-outN/A
associate-*l*N/A
*-commutativeN/A
Applied egg-rr99.9%
Taylor expanded in z around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1%
Simplified73.1%
associate-/r/N/A
metadata-evalN/A
neg-mul-1N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f6499.8%
Applied egg-rr99.8%
if -5.0000000000000005e229 < (*.f64 y z) Initial program 98.7%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.7%
Applied egg-rr98.7%
Final simplification98.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* (* y z) (- 0.0 x))))
(if (<= (* y z) -5e+229)
(* y (- 0.0 (* z x)))
(if (<= (* y z) -1000000000.0) t_0 (if (<= (* y z) 5e-9) x t_0)))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = (y * z) * (0.0 - x);
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else if ((y * z) <= -1000000000.0) {
tmp = t_0;
} else if ((y * z) <= 5e-9) {
tmp = x;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (y * z) * (0.0d0 - x)
if ((y * z) <= (-5d+229)) then
tmp = y * (0.0d0 - (z * x))
else if ((y * z) <= (-1000000000.0d0)) then
tmp = t_0
else if ((y * z) <= 5d-9) then
tmp = x
else
tmp = t_0
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = (y * z) * (0.0 - x);
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else if ((y * z) <= -1000000000.0) {
tmp = t_0;
} else if ((y * z) <= 5e-9) {
tmp = x;
} else {
tmp = t_0;
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = (y * z) * (0.0 - x) tmp = 0 if (y * z) <= -5e+229: tmp = y * (0.0 - (z * x)) elif (y * z) <= -1000000000.0: tmp = t_0 elif (y * z) <= 5e-9: tmp = x else: tmp = t_0 return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(Float64(y * z) * Float64(0.0 - x)) tmp = 0.0 if (Float64(y * z) <= -5e+229) tmp = Float64(y * Float64(0.0 - Float64(z * x))); elseif (Float64(y * z) <= -1000000000.0) tmp = t_0; elseif (Float64(y * z) <= 5e-9) tmp = x; else tmp = t_0; end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = (y * z) * (0.0 - x);
tmp = 0.0;
if ((y * z) <= -5e+229)
tmp = y * (0.0 - (z * x));
elseif ((y * z) <= -1000000000.0)
tmp = t_0;
elseif ((y * z) <= 5e-9)
tmp = x;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * N[(0.0 - x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * z), $MachinePrecision], -5e+229], N[(y * N[(0.0 - N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * z), $MachinePrecision], -1000000000.0], t$95$0, If[LessEqual[N[(y * z), $MachinePrecision], 5e-9], x, t$95$0]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \left(y \cdot z\right) \cdot \left(0 - x\right)\\
\mathbf{if}\;y \cdot z \leq -5 \cdot 10^{+229}:\\
\;\;\;\;y \cdot \left(0 - z \cdot x\right)\\
\mathbf{elif}\;y \cdot z \leq -1000000000:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \cdot z \leq 5 \cdot 10^{-9}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 y z) < -5.0000000000000005e229Initial program 73.0%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.0%
Applied egg-rr73.0%
flip--N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip--N/A
sub-negN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-outN/A
sub0-negN/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
sub0-negN/A
distribute-lft-neg-outN/A
associate-*l*N/A
*-commutativeN/A
Applied egg-rr99.9%
Taylor expanded in z around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1%
Simplified73.1%
associate-/r/N/A
metadata-evalN/A
neg-mul-1N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f6499.8%
Applied egg-rr99.8%
if -5.0000000000000005e229 < (*.f64 y z) < -1e9 or 5.0000000000000001e-9 < (*.f64 y z) Initial program 96.8%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.9%
Applied egg-rr96.9%
flip--N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip--N/A
sub-negN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-outN/A
sub0-negN/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
sub0-negN/A
distribute-lft-neg-outN/A
associate-*l*N/A
*-commutativeN/A
Applied egg-rr89.2%
Taylor expanded in z around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.0%
Simplified94.0%
associate-/r/N/A
metadata-evalN/A
neg-mul-1N/A
neg-lowering-neg.f64N/A
remove-double-negN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
sub0-negN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
sub0-negN/A
remove-double-negN/A
*-lowering-*.f6494.1%
Applied egg-rr94.1%
if -1e9 < (*.f64 y z) < 5.0000000000000001e-9Initial program 100.0%
Taylor expanded in y around 0
Simplified97.7%
Final simplification96.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (let* ((t_0 (* (* y z) (- 0.0 x)))) (if (<= (* y z) -1.0) t_0 (if (<= (* y z) 1.0) x t_0))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = (y * z) * (0.0 - x);
double tmp;
if ((y * z) <= -1.0) {
tmp = t_0;
} else if ((y * z) <= 1.0) {
tmp = x;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (y * z) * (0.0d0 - x)
if ((y * z) <= (-1.0d0)) then
tmp = t_0
else if ((y * z) <= 1.0d0) then
tmp = x
else
tmp = t_0
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = (y * z) * (0.0 - x);
double tmp;
if ((y * z) <= -1.0) {
tmp = t_0;
} else if ((y * z) <= 1.0) {
tmp = x;
} else {
tmp = t_0;
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = (y * z) * (0.0 - x) tmp = 0 if (y * z) <= -1.0: tmp = t_0 elif (y * z) <= 1.0: tmp = x else: tmp = t_0 return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(Float64(y * z) * Float64(0.0 - x)) tmp = 0.0 if (Float64(y * z) <= -1.0) tmp = t_0; elseif (Float64(y * z) <= 1.0) tmp = x; else tmp = t_0; end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = (y * z) * (0.0 - x);
tmp = 0.0;
if ((y * z) <= -1.0)
tmp = t_0;
elseif ((y * z) <= 1.0)
tmp = x;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * z), $MachinePrecision] * N[(0.0 - x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * z), $MachinePrecision], -1.0], t$95$0, If[LessEqual[N[(y * z), $MachinePrecision], 1.0], x, t$95$0]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \left(y \cdot z\right) \cdot \left(0 - x\right)\\
\mathbf{if}\;y \cdot z \leq -1:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \cdot z \leq 1:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (*.f64 y z) < -1 or 1 < (*.f64 y z) Initial program 91.5%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.5%
Applied egg-rr91.5%
flip--N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip--N/A
sub-negN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-outN/A
sub0-negN/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
sub0-negN/A
distribute-lft-neg-outN/A
associate-*l*N/A
*-commutativeN/A
Applied egg-rr91.6%
Taylor expanded in z around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.3%
Simplified89.3%
associate-/r/N/A
metadata-evalN/A
neg-mul-1N/A
neg-lowering-neg.f64N/A
remove-double-negN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
sub0-negN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
sub0-negN/A
remove-double-negN/A
*-lowering-*.f6489.4%
Applied egg-rr89.4%
if -1 < (*.f64 y z) < 1Initial program 100.0%
Taylor expanded in y around 0
Simplified97.7%
Final simplification93.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* y z) -5e+229) (* y (- 0.0 (* z x))) (* x (- 1.0 (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else {
tmp = x * (1.0 - (y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((y * z) <= (-5d+229)) then
tmp = y * (0.0d0 - (z * x))
else
tmp = x * (1.0d0 - (y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if ((y * z) <= -5e+229) {
tmp = y * (0.0 - (z * x));
} else {
tmp = x * (1.0 - (y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if (y * z) <= -5e+229: tmp = y * (0.0 - (z * x)) else: tmp = x * (1.0 - (y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (Float64(y * z) <= -5e+229) tmp = Float64(y * Float64(0.0 - Float64(z * x))); else tmp = Float64(x * Float64(1.0 - Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((y * z) <= -5e+229)
tmp = y * (0.0 - (z * x));
else
tmp = x * (1.0 - (y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -5e+229], N[(y * N[(0.0 - N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot z \leq -5 \cdot 10^{+229}:\\
\;\;\;\;y \cdot \left(0 - z \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(1 - y \cdot z\right)\\
\end{array}
\end{array}
if (*.f64 y z) < -5.0000000000000005e229Initial program 73.0%
sub-negN/A
distribute-rgt-inN/A
fma-defineN/A
distribute-lft-neg-outN/A
fmm-undefN/A
*-lft-identityN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.0%
Applied egg-rr73.0%
flip--N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip--N/A
sub-negN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-outN/A
sub0-negN/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
sub0-negN/A
distribute-lft-neg-outN/A
associate-*l*N/A
*-commutativeN/A
Applied egg-rr99.9%
Taylor expanded in z around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1%
Simplified73.1%
associate-/r/N/A
metadata-evalN/A
neg-mul-1N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f64N/A
*-commutativeN/A
*-lowering-*.f6499.8%
Applied egg-rr99.8%
if -5.0000000000000005e229 < (*.f64 y z) Initial program 98.7%
Final simplification98.8%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 x)
assert(x < y && y < z);
double code(double x, double y, double z) {
return x;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = x
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return x;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return x
x, y, z = sort([x, y, z]) function code(x, y, z) return x end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = x;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := x
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
x
\end{array}
Initial program 95.9%
Taylor expanded in y around 0
Simplified51.8%
herbie shell --seed 2024145
(FPCore (x y z)
:name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, I"
:precision binary64
(* x (- 1.0 (* y z))))