
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (+ z 1.0) (* z z))))
(*
y_s
(*
x_s
(if (<= t_0 -2e+29)
(/ (/ (/ x_m z) (/ z y_m)) z)
(if (<= t_0 5e-112)
(/ (* (/ x_m z) y_m) z)
(/ x_m (* (/ z y_m) (* z (+ z 1.0))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = (z + 1.0) * (z * z);
double tmp;
if (t_0 <= -2e+29) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else if (t_0 <= 5e-112) {
tmp = ((x_m / z) * y_m) / z;
} else {
tmp = x_m / ((z / y_m) * (z * (z + 1.0)));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (z + 1.0d0) * (z * z)
if (t_0 <= (-2d+29)) then
tmp = ((x_m / z) / (z / y_m)) / z
else if (t_0 <= 5d-112) then
tmp = ((x_m / z) * y_m) / z
else
tmp = x_m / ((z / y_m) * (z * (z + 1.0d0)))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = (z + 1.0) * (z * z);
double tmp;
if (t_0 <= -2e+29) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else if (t_0 <= 5e-112) {
tmp = ((x_m / z) * y_m) / z;
} else {
tmp = x_m / ((z / y_m) * (z * (z + 1.0)));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = (z + 1.0) * (z * z) tmp = 0 if t_0 <= -2e+29: tmp = ((x_m / z) / (z / y_m)) / z elif t_0 <= 5e-112: tmp = ((x_m / z) * y_m) / z else: tmp = x_m / ((z / y_m) * (z * (z + 1.0))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(Float64(z + 1.0) * Float64(z * z)) tmp = 0.0 if (t_0 <= -2e+29) tmp = Float64(Float64(Float64(x_m / z) / Float64(z / y_m)) / z); elseif (t_0 <= 5e-112) tmp = Float64(Float64(Float64(x_m / z) * y_m) / z); else tmp = Float64(x_m / Float64(Float64(z / y_m) * Float64(z * Float64(z + 1.0)))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = (z + 1.0) * (z * z);
tmp = 0.0;
if (t_0 <= -2e+29)
tmp = ((x_m / z) / (z / y_m)) / z;
elseif (t_0 <= 5e-112)
tmp = ((x_m / z) * y_m) / z;
else
tmp = x_m / ((z / y_m) * (z * (z + 1.0)));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z + 1.0), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, -2e+29], N[(N[(N[(x$95$m / z), $MachinePrecision] / N[(z / y$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$0, 5e-112], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], N[(x$95$m / N[(N[(z / y$95$m), $MachinePrecision] * N[(z * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(z + 1\right) \cdot \left(z \cdot z\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{+29}:\\
\;\;\;\;\frac{\frac{\frac{x\_m}{z}}{\frac{z}{y\_m}}}{z}\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{-112}:\\
\;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\frac{z}{y\_m} \cdot \left(z \cdot \left(z + 1\right)\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1.99999999999999983e29Initial program 83.1%
clear-num83.0%
associate-/l*87.2%
pow287.2%
Applied egg-rr87.2%
associate-*r/83.0%
clear-num83.1%
*-commutative83.1%
distribute-rgt-in48.6%
*-un-lft-identity48.6%
unpow248.6%
distribute-lft-in83.1%
unpow283.1%
fma-undefine83.0%
frac-times88.5%
*-commutative88.5%
frac-times83.0%
associate-/l/87.2%
clear-num87.2%
*-un-lft-identity87.2%
associate-/l*92.6%
times-frac85.8%
fma-undefine85.8%
*-un-lft-identity85.8%
distribute-rgt-out85.8%
Applied egg-rr85.8%
associate-*l/85.8%
*-lft-identity85.8%
associate-/r*92.6%
*-commutative92.6%
times-frac87.2%
Simplified87.2%
associate-/r*88.8%
clear-num88.8%
associate-/r/88.8%
associate-/r*97.0%
Applied egg-rr97.0%
Taylor expanded in z around inf 96.6%
if -1.99999999999999983e29 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000000000044e-112Initial program 83.8%
Taylor expanded in z around 0 83.8%
associate-/l*81.7%
Simplified81.7%
*-un-lft-identity81.7%
unpow281.7%
times-frac92.0%
Applied egg-rr92.0%
associate-*l/92.0%
*-lft-identity92.0%
Simplified92.0%
*-un-lft-identity92.0%
associate-*l/92.0%
associate-*r*96.5%
div-inv96.5%
frac-2neg96.5%
associate-*r/94.0%
Applied egg-rr94.0%
if 5.00000000000000044e-112 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 86.6%
*-commutative86.6%
associate-*l*86.5%
times-frac96.3%
distribute-lft-in96.3%
*-rgt-identity96.3%
fma-define96.3%
Applied egg-rr96.3%
clear-num96.2%
frac-times89.2%
*-un-lft-identity89.2%
fma-undefine89.2%
*-un-lft-identity89.2%
distribute-rgt-out89.3%
Applied egg-rr89.3%
Final simplification93.2%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* (+ z 1.0) (* z z)) -5e+61)
(/ (/ (/ x_m z) (/ z y_m)) z)
(/ (* y_m (/ x_m (* z (+ z 1.0)))) z)))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (((z + 1.0) * (z * z)) <= -5e+61) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else {
tmp = (y_m * (x_m / (z * (z + 1.0)))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (((z + 1.0d0) * (z * z)) <= (-5d+61)) then
tmp = ((x_m / z) / (z / y_m)) / z
else
tmp = (y_m * (x_m / (z * (z + 1.0d0)))) / z
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (((z + 1.0) * (z * z)) <= -5e+61) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else {
tmp = (y_m * (x_m / (z * (z + 1.0)))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if ((z + 1.0) * (z * z)) <= -5e+61: tmp = ((x_m / z) / (z / y_m)) / z else: tmp = (y_m * (x_m / (z * (z + 1.0)))) / z return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(z + 1.0) * Float64(z * z)) <= -5e+61) tmp = Float64(Float64(Float64(x_m / z) / Float64(z / y_m)) / z); else tmp = Float64(Float64(y_m * Float64(x_m / Float64(z * Float64(z + 1.0)))) / z); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (((z + 1.0) * (z * z)) <= -5e+61)
tmp = ((x_m / z) / (z / y_m)) / z;
else
tmp = (y_m * (x_m / (z * (z + 1.0)))) / z;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(N[(z + 1.0), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision], -5e+61], N[(N[(N[(x$95$m / z), $MachinePrecision] / N[(z / y$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(y$95$m * N[(x$95$m / N[(z * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;\left(z + 1\right) \cdot \left(z \cdot z\right) \leq -5 \cdot 10^{+61}:\\
\;\;\;\;\frac{\frac{\frac{x\_m}{z}}{\frac{z}{y\_m}}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m \cdot \frac{x\_m}{z \cdot \left(z + 1\right)}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -5.00000000000000018e61Initial program 81.8%
clear-num81.7%
associate-/l*86.2%
pow286.2%
Applied egg-rr86.2%
associate-*r/81.7%
clear-num81.7%
*-commutative81.7%
distribute-rgt-in44.6%
*-un-lft-identity44.6%
unpow244.6%
distribute-lft-in81.7%
unpow281.7%
fma-undefine81.7%
frac-times87.6%
*-commutative87.6%
frac-times81.7%
associate-/l/86.2%
clear-num86.2%
*-un-lft-identity86.2%
associate-/l*92.1%
times-frac84.7%
fma-undefine84.7%
*-un-lft-identity84.7%
distribute-rgt-out84.7%
Applied egg-rr84.7%
associate-*l/84.7%
*-lft-identity84.7%
associate-/r*92.1%
*-commutative92.1%
times-frac86.2%
Simplified86.2%
associate-/r*87.9%
clear-num88.0%
associate-/r/87.9%
associate-/r*96.8%
Applied egg-rr96.8%
Taylor expanded in z around inf 96.8%
if -5.00000000000000018e61 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 85.3%
*-commutative85.3%
associate-*l*85.3%
times-frac96.5%
distribute-lft-in96.5%
*-rgt-identity96.5%
fma-define96.5%
Applied egg-rr96.5%
associate-*l/95.5%
fma-undefine95.5%
*-un-lft-identity95.5%
distribute-rgt-out95.5%
Applied egg-rr95.5%
Final simplification95.8%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (or (<= z -5.2) (not (<= z 1.0)))
(/ (/ (/ x_m z) (/ z y_m)) z)
(/ (* (/ x_m z) y_m) z)))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z <= -5.2) || !(z <= 1.0)) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else {
tmp = ((x_m / z) * y_m) / z;
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z <= (-5.2d0)) .or. (.not. (z <= 1.0d0))) then
tmp = ((x_m / z) / (z / y_m)) / z
else
tmp = ((x_m / z) * y_m) / z
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z <= -5.2) || !(z <= 1.0)) {
tmp = ((x_m / z) / (z / y_m)) / z;
} else {
tmp = ((x_m / z) * y_m) / z;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z <= -5.2) or not (z <= 1.0): tmp = ((x_m / z) / (z / y_m)) / z else: tmp = ((x_m / z) * y_m) / z return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if ((z <= -5.2) || !(z <= 1.0)) tmp = Float64(Float64(Float64(x_m / z) / Float64(z / y_m)) / z); else tmp = Float64(Float64(Float64(x_m / z) * y_m) / z); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z <= -5.2) || ~((z <= 1.0)))
tmp = ((x_m / z) / (z / y_m)) / z;
else
tmp = ((x_m / z) * y_m) / z;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[Or[LessEqual[z, -5.2], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(N[(N[(x$95$m / z), $MachinePrecision] / N[(z / y$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -5.2 \lor \neg \left(z \leq 1\right):\\
\;\;\;\;\frac{\frac{\frac{x\_m}{z}}{\frac{z}{y\_m}}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{z}\\
\end{array}\right)
\end{array}
if z < -5.20000000000000018 or 1 < z Initial program 82.9%
clear-num82.9%
associate-/l*88.0%
pow288.0%
Applied egg-rr88.0%
associate-*r/82.9%
clear-num82.9%
*-commutative82.9%
distribute-rgt-in64.7%
*-un-lft-identity64.7%
unpow264.7%
distribute-lft-in82.9%
unpow282.9%
fma-undefine82.9%
frac-times91.7%
*-commutative91.7%
frac-times82.9%
associate-/l/88.1%
clear-num88.0%
*-un-lft-identity88.0%
associate-/l*93.9%
times-frac86.0%
fma-undefine86.0%
*-un-lft-identity86.0%
distribute-rgt-out86.0%
Applied egg-rr86.0%
associate-*l/86.0%
*-lft-identity86.0%
associate-/r*93.9%
*-commutative93.9%
times-frac90.4%
Simplified90.4%
associate-/r*91.3%
clear-num91.3%
associate-/r/91.3%
associate-/r*96.9%
Applied egg-rr96.9%
Taylor expanded in z around inf 95.1%
if -5.20000000000000018 < z < 1Initial program 86.0%
Taylor expanded in z around 0 84.6%
associate-/l*82.8%
Simplified82.8%
*-un-lft-identity82.8%
unpow282.8%
times-frac91.6%
Applied egg-rr91.6%
associate-*l/91.6%
*-lft-identity91.6%
Simplified91.6%
*-un-lft-identity91.6%
associate-*l/91.6%
associate-*r*95.5%
div-inv95.5%
frac-2neg95.5%
associate-*r/93.3%
Applied egg-rr93.3%
Final simplification94.2%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ (/ x_m z) (/ (+ z 1.0) y_m)) z))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (((x_m / z) / ((z + 1.0) / y_m)) / z));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (((x_m / z) / ((z + 1.0d0) / y_m)) / z))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (((x_m / z) / ((z + 1.0) / y_m)) / z));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (((x_m / z) / ((z + 1.0) / y_m)) / z))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(Float64(x_m / z) / Float64(Float64(z + 1.0) / y_m)) / z))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (((x_m / z) / ((z + 1.0) / y_m)) / z));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(x$95$m / z), $MachinePrecision] / N[(N[(z + 1.0), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{\frac{x\_m}{z}}{\frac{z + 1}{y\_m}}}{z}\right)
\end{array}
Initial program 84.5%
clear-num84.4%
associate-/l*86.7%
pow286.7%
Applied egg-rr86.7%
associate-*r/84.4%
clear-num84.4%
*-commutative84.4%
distribute-rgt-in75.3%
*-un-lft-identity75.3%
unpow275.3%
distribute-lft-in84.4%
unpow284.4%
fma-undefine84.4%
frac-times94.3%
*-commutative94.3%
frac-times84.4%
associate-/l/91.1%
clear-num91.1%
*-un-lft-identity91.1%
associate-/l*95.7%
times-frac89.7%
fma-undefine89.8%
*-un-lft-identity89.8%
distribute-rgt-out89.7%
Applied egg-rr89.7%
associate-*l/89.8%
*-lft-identity89.8%
associate-/r*95.7%
*-commutative95.7%
times-frac93.8%
Simplified93.8%
associate-/r*94.1%
clear-num94.1%
associate-/r/94.1%
associate-/r*95.8%
Applied egg-rr95.8%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (* (/ x_m (+ z 1.0)) (/ y_m z)) z))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (((x_m / (z + 1.0)) * (y_m / z)) / z));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (((x_m / (z + 1.0d0)) * (y_m / z)) / z))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (((x_m / (z + 1.0)) * (y_m / z)) / z));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (((x_m / (z + 1.0)) * (y_m / z)) / z))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(Float64(x_m / Float64(z + 1.0)) * Float64(y_m / z)) / z))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (((x_m / (z + 1.0)) * (y_m / z)) / z));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(x$95$m / N[(z + 1.0), $MachinePrecision]), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{x\_m}{z + 1} \cdot \frac{y\_m}{z}}{z}\right)
\end{array}
Initial program 84.5%
clear-num84.4%
associate-/l*86.7%
pow286.7%
Applied egg-rr86.7%
associate-*r/84.4%
clear-num84.4%
*-commutative84.4%
distribute-rgt-in75.3%
*-un-lft-identity75.3%
unpow275.3%
distribute-lft-in84.4%
unpow284.4%
fma-undefine84.4%
frac-times94.3%
*-commutative94.3%
frac-times84.4%
associate-/l/91.1%
clear-num91.1%
*-un-lft-identity91.1%
associate-/l*95.7%
times-frac89.7%
fma-undefine89.8%
*-un-lft-identity89.8%
distribute-rgt-out89.7%
Applied egg-rr89.7%
associate-*l/89.8%
*-lft-identity89.8%
associate-/r*95.7%
*-commutative95.7%
times-frac93.8%
Simplified93.8%
associate-/r*94.1%
clear-num94.1%
associate-/r/94.1%
associate-/r*95.8%
Applied egg-rr95.8%
div-inv95.8%
div-inv95.8%
times-frac97.2%
associate-/r*97.1%
div-inv97.2%
clear-num97.2%
Applied egg-rr97.2%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (* y_m (/ (/ x_m z) z)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (y_m * ((x_m / z) / z)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (y_m * ((x_m / z) / z)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (y_m * ((x_m / z) / z)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (y_m * ((x_m / z) / z)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(y_m * Float64(Float64(x_m / z) / z)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (y_m * ((x_m / z) / z)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(y$95$m * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot \frac{\frac{x\_m}{z}}{z}\right)\right)
\end{array}
Initial program 84.5%
*-commutative84.5%
associate-*l*84.4%
times-frac94.4%
distribute-lft-in94.4%
*-rgt-identity94.4%
fma-define94.4%
Applied egg-rr94.4%
Taylor expanded in z around 0 75.3%
clear-num75.3%
associate-*l/75.3%
*-un-lft-identity75.3%
associate-/r/72.6%
Applied egg-rr72.6%
Final simplification72.6%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (* (/ x_m z) (/ y_m z)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((x_m / z) * (y_m / z)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * ((x_m / z) * (y_m / z)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((x_m / z) * (y_m / z)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((x_m / z) * (y_m / z)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(x_m / z) * Float64(y_m / z)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((x_m / z) * (y_m / z)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \left(\frac{x\_m}{z} \cdot \frac{y\_m}{z}\right)\right)
\end{array}
Initial program 84.5%
*-commutative84.5%
associate-*l*84.4%
times-frac94.4%
distribute-lft-in94.4%
*-rgt-identity94.4%
fma-define94.4%
Applied egg-rr94.4%
Taylor expanded in z around 0 75.3%
Final simplification75.3%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (* x_m (/ (/ y_m z) z)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (x_m * ((y_m / z) / z)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (x_m * ((y_m / z) / z)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (x_m * ((y_m / z) / z)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (x_m * ((y_m / z) / z)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(x_m * Float64(Float64(y_m / z) / z)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (x_m * ((y_m / z) / z)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(x$95$m * N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \left(x\_m \cdot \frac{\frac{y\_m}{z}}{z}\right)\right)
\end{array}
Initial program 84.5%
Taylor expanded in z around 0 71.4%
associate-/l*72.5%
Simplified72.5%
*-un-lft-identity72.5%
unpow272.5%
times-frac74.6%
Applied egg-rr74.6%
associate-*l/74.6%
*-lft-identity74.6%
Simplified74.6%
(FPCore (x y z) :precision binary64 (if (< z 249.6182814532307) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1.0 z)) x) z)))
double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
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 (z < 249.6182814532307d0) then
tmp = (y * (x / z)) / (z + (z * z))
else
tmp = (((y / z) / (1.0d0 + z)) * x) / z
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
def code(x, y, z): tmp = 0 if z < 249.6182814532307: tmp = (y * (x / z)) / (z + (z * z)) else: tmp = (((y / z) / (1.0 + z)) * x) / z return tmp
function code(x, y, z) tmp = 0.0 if (z < 249.6182814532307) tmp = Float64(Float64(y * Float64(x / z)) / Float64(z + Float64(z * z))); else tmp = Float64(Float64(Float64(Float64(y / z) / Float64(1.0 + z)) * x) / z); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if (z < 249.6182814532307) tmp = (y * (x / z)) / (z + (z * z)); else tmp = (((y / z) / (1.0 + z)) * x) / z; end tmp_2 = tmp; end
code[x_, y_, z_] := If[Less[z, 249.6182814532307], N[(N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision] / N[(z + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < 249.6182814532307:\\
\;\;\;\;\frac{y \cdot \frac{x}{z}}{z + z \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y}{z}}{1 + z} \cdot x}{z}\\
\end{array}
\end{array}
herbie shell --seed 2024096
(FPCore (x y z)
:name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
:precision binary64
:alt
(if (< z 249.6182814532307) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1.0 z)) x) z))
(/ (* x y) (* (* z z) (+ z 1.0))))