
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z_m z_m) 5e+82)
(* (pow (hypot 1.0 z_m) -2.0) (/ (/ 1.0 x_m) y_m))
(/
(* (sqrt (/ 1.0 y_m)) (/ (/ 1.0 x_m) z_m))
(* (hypot 1.0 z_m) (sqrt y_m)))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 5e+82) {
tmp = pow(hypot(1.0, z_m), -2.0) * ((1.0 / x_m) / y_m);
} else {
tmp = (sqrt((1.0 / y_m)) * ((1.0 / x_m) / z_m)) / (hypot(1.0, z_m) * sqrt(y_m));
}
return y_s * (x_s * tmp);
}
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 5e+82) {
tmp = Math.pow(Math.hypot(1.0, z_m), -2.0) * ((1.0 / x_m) / y_m);
} else {
tmp = (Math.sqrt((1.0 / y_m)) * ((1.0 / x_m) / z_m)) / (Math.hypot(1.0, z_m) * Math.sqrt(y_m));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if (z_m * z_m) <= 5e+82: tmp = math.pow(math.hypot(1.0, z_m), -2.0) * ((1.0 / x_m) / y_m) else: tmp = (math.sqrt((1.0 / y_m)) * ((1.0 / x_m) / z_m)) / (math.hypot(1.0, z_m) * math.sqrt(y_m)) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 5e+82) tmp = Float64((hypot(1.0, z_m) ^ -2.0) * Float64(Float64(1.0 / x_m) / y_m)); else tmp = Float64(Float64(sqrt(Float64(1.0 / y_m)) * Float64(Float64(1.0 / x_m) / z_m)) / Float64(hypot(1.0, z_m) * sqrt(y_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if ((z_m * z_m) <= 5e+82)
tmp = (hypot(1.0, z_m) ^ -2.0) * ((1.0 / x_m) / y_m);
else
tmp = (sqrt((1.0 / y_m)) * ((1.0 / x_m) / z_m)) / (hypot(1.0, z_m) * sqrt(y_m));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 5e+82], N[(N[Power[N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision], -2.0], $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 / y$95$m), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \cdot z\_m \leq 5 \cdot 10^{+82}:\\
\;\;\;\;{\left(\mathsf{hypot}\left(1, z\_m\right)\right)}^{-2} \cdot \frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{1}{y\_m}} \cdot \frac{\frac{1}{x\_m}}{z\_m}}{\mathsf{hypot}\left(1, z\_m\right) \cdot \sqrt{y\_m}}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.00000000000000015e82Initial program 99.7%
associate-/l/98.8%
remove-double-neg98.8%
distribute-rgt-neg-out98.8%
distribute-rgt-neg-out98.8%
remove-double-neg98.8%
associate-*l*96.9%
*-commutative96.9%
sqr-neg96.9%
+-commutative96.9%
sqr-neg96.9%
fma-define96.9%
Simplified96.9%
associate-*r*98.8%
*-commutative98.8%
*-commutative98.8%
add-sqr-sqrt52.3%
pow252.3%
sqrt-div44.7%
metadata-eval44.7%
sqrt-prod44.7%
fma-undefine44.7%
+-commutative44.7%
hypot-1-def44.7%
Applied egg-rr44.7%
frac-2neg44.7%
metadata-eval44.7%
div-inv44.7%
*-commutative44.7%
distribute-rgt-neg-in44.7%
Applied egg-rr44.7%
associate-*r/44.7%
metadata-eval44.7%
*-commutative44.7%
associate-/r*44.7%
neg-mul-144.7%
associate-/r*44.7%
metadata-eval44.7%
Simplified44.7%
div-inv44.7%
unpow-prod-down44.8%
pow244.8%
inv-pow44.8%
inv-pow44.8%
pow-prod-up44.7%
metadata-eval44.7%
metadata-eval44.7%
sqrt-div52.3%
associate-/l/51.1%
pow251.1%
add-sqr-sqrt99.7%
associate-/l/98.8%
associate-/r*99.7%
Applied egg-rr99.7%
if 5.00000000000000015e82 < (*.f64 z z) Initial program 76.2%
associate-/l/75.0%
remove-double-neg75.0%
distribute-rgt-neg-out75.0%
distribute-rgt-neg-out75.0%
remove-double-neg75.0%
associate-*l*77.6%
*-commutative77.6%
sqr-neg77.6%
+-commutative77.6%
sqr-neg77.6%
fma-define77.6%
Simplified77.6%
associate-*r*72.2%
*-commutative72.2%
associate-/r*72.8%
*-commutative72.8%
associate-/l/72.8%
fma-undefine72.8%
+-commutative72.8%
associate-/r*76.2%
*-un-lft-identity76.2%
add-sqr-sqrt38.2%
times-frac38.2%
+-commutative38.2%
fma-undefine38.2%
*-commutative38.2%
sqrt-prod38.2%
fma-undefine38.2%
+-commutative38.2%
hypot-1-def38.2%
+-commutative38.2%
Applied egg-rr49.7%
associate-*l/49.7%
*-lft-identity49.7%
associate-/l/49.8%
*-commutative49.8%
Simplified49.8%
Taylor expanded in z around inf 38.9%
*-commutative38.9%
associate-/r*38.9%
Simplified38.9%
Final simplification73.1%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (let* ((t_0 (* (hypot 1.0 z_m) (sqrt y_m)))) (* y_s (* x_s (/ (/ 1.0 (* x_m t_0)) t_0)))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = hypot(1.0, z_m) * sqrt(y_m);
return y_s * (x_s * ((1.0 / (x_m * t_0)) / t_0));
}
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = Math.hypot(1.0, z_m) * Math.sqrt(y_m);
return y_s * (x_s * ((1.0 / (x_m * t_0)) / t_0));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): t_0 = math.hypot(1.0, z_m) * math.sqrt(y_m) return y_s * (x_s * ((1.0 / (x_m * t_0)) / t_0))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) t_0 = Float64(hypot(1.0, z_m) * sqrt(y_m)) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / Float64(x_m * t_0)) / t_0))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
t_0 = hypot(1.0, z_m) * sqrt(y_m);
tmp = y_s * (x_s * ((1.0 / (x_m * t_0)) / t_0));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / N[(x$95$m * t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(1, z\_m\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m \cdot t\_0}}{t\_0}\right)
\end{array}
\end{array}
Initial program 89.4%
associate-/l/88.4%
remove-double-neg88.4%
distribute-rgt-neg-out88.4%
distribute-rgt-neg-out88.4%
remove-double-neg88.4%
associate-*l*88.4%
*-commutative88.4%
sqr-neg88.4%
+-commutative88.4%
sqr-neg88.4%
fma-define88.4%
Simplified88.4%
associate-*r*87.1%
*-commutative87.1%
associate-/r*87.4%
*-commutative87.4%
associate-/l/87.9%
fma-undefine87.9%
+-commutative87.9%
associate-/r*89.4%
*-un-lft-identity89.4%
add-sqr-sqrt49.3%
times-frac49.3%
+-commutative49.3%
fma-undefine49.3%
*-commutative49.3%
sqrt-prod49.3%
fma-undefine49.3%
+-commutative49.3%
hypot-1-def49.3%
+-commutative49.3%
Applied egg-rr54.4%
associate-*l/54.3%
*-lft-identity54.3%
associate-/l/54.4%
*-commutative54.4%
Simplified54.4%
Final simplification54.4%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* y_m (+ 1.0 (* z_m z_m))) INFINITY)
(/ (/ 1.0 x_m) (fma (* z_m y_m) z_m y_m))
(/ (/ (sqrt (/ 1.0 y_m)) (* x_m z_m)) (* (hypot 1.0 z_m) (sqrt y_m)))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((y_m * (1.0 + (z_m * z_m))) <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / fma((z_m * y_m), z_m, y_m);
} else {
tmp = (sqrt((1.0 / y_m)) / (x_m * z_m)) / (hypot(1.0, z_m) * sqrt(y_m));
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) <= Inf) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z_m * y_m), z_m, y_m)); else tmp = Float64(Float64(sqrt(Float64(1.0 / y_m)) / Float64(x_m * z_m)) / Float64(hypot(1.0, z_m) * sqrt(y_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z$95$m * y$95$m), $MachinePrecision] * z$95$m + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 / y$95$m), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(1 + z\_m \cdot z\_m\right) \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z\_m \cdot y\_m, z\_m, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\sqrt{\frac{1}{y\_m}}}{x\_m \cdot z\_m}}{\mathsf{hypot}\left(1, z\_m\right) \cdot \sqrt{y\_m}}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 89.4%
+-commutative89.4%
distribute-lft-in89.4%
associate-*r*94.6%
*-rgt-identity94.6%
fma-define94.6%
Applied egg-rr94.6%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 89.4%
associate-/l/88.4%
remove-double-neg88.4%
distribute-rgt-neg-out88.4%
distribute-rgt-neg-out88.4%
remove-double-neg88.4%
associate-*l*88.4%
*-commutative88.4%
sqr-neg88.4%
+-commutative88.4%
sqr-neg88.4%
fma-define88.4%
Simplified88.4%
associate-*r*87.1%
*-commutative87.1%
associate-/r*87.4%
*-commutative87.4%
associate-/l/87.9%
fma-undefine87.9%
+-commutative87.9%
associate-/r*89.4%
*-un-lft-identity89.4%
add-sqr-sqrt49.3%
times-frac49.3%
+-commutative49.3%
fma-undefine49.3%
*-commutative49.3%
sqrt-prod49.3%
fma-undefine49.3%
+-commutative49.3%
hypot-1-def49.3%
+-commutative49.3%
Applied egg-rr54.4%
associate-*l/54.3%
*-lft-identity54.3%
associate-/l/54.4%
*-commutative54.4%
Simplified54.4%
Taylor expanded in z around inf 23.9%
associate-*l/23.9%
*-lft-identity23.9%
Simplified23.9%
Final simplification94.6%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* y_m (+ 1.0 (* z_m z_m))) INFINITY)
(/ (/ 1.0 x_m) (fma (* z_m y_m) z_m y_m))
(/ 1.0 (* z_m (* y_m (* x_m z_m))))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((y_m * (1.0 + (z_m * z_m))) <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / fma((z_m * y_m), z_m, y_m);
} else {
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) <= Inf) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z_m * y_m), z_m, y_m)); else tmp = Float64(1.0 / Float64(z_m * Float64(y_m * Float64(x_m * z_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z$95$m * y$95$m), $MachinePrecision] * z$95$m + y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z$95$m * N[(y$95$m * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(1 + z\_m \cdot z\_m\right) \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z\_m \cdot y\_m, z\_m, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z\_m \cdot \left(y\_m \cdot \left(x\_m \cdot z\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 89.4%
+-commutative89.4%
distribute-lft-in89.4%
associate-*r*94.6%
*-rgt-identity94.6%
fma-define94.6%
Applied egg-rr94.6%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 89.4%
associate-/l/88.4%
remove-double-neg88.4%
distribute-rgt-neg-out88.4%
distribute-rgt-neg-out88.4%
remove-double-neg88.4%
associate-*l*88.4%
*-commutative88.4%
sqr-neg88.4%
+-commutative88.4%
sqr-neg88.4%
fma-define88.4%
Simplified88.4%
Taylor expanded in z around inf 49.4%
associate-*r*49.5%
associate-/r*49.8%
Simplified49.8%
associate-/l/49.5%
div-inv49.5%
unpow249.5%
times-frac58.3%
Applied egg-rr58.3%
*-commutative58.3%
frac-times49.5%
div-inv49.5%
associate-/l/58.8%
clear-num58.8%
associate-/l/58.2%
*-un-lft-identity58.2%
div-inv58.2%
*-commutative58.2%
times-frac58.6%
clear-num58.6%
/-rgt-identity58.6%
div-inv58.6%
clear-num58.6%
/-rgt-identity58.6%
*-commutative58.6%
Applied egg-rr58.6%
Final simplification94.6%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(let* ((t_0 (* y_m (+ 1.0 (* z_m z_m)))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(/ 1.0 (* z_m (* y_m (* x_m z_m)))))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): t_0 = y_m * (1.0 + (z_m * z_m)) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = 1.0 / (z_m * (y_m * (x_m * z_m))) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) t_0 = Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(1.0 / Float64(z_m * Float64(y_m * Float64(x_m * z_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
t_0 = y_m * (1.0 + (z_m * z_m));
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(z$95$m * N[(y$95$m * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z\_m \cdot \left(y\_m \cdot \left(x\_m \cdot z\_m\right)\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 89.4%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 89.4%
associate-/l/88.4%
remove-double-neg88.4%
distribute-rgt-neg-out88.4%
distribute-rgt-neg-out88.4%
remove-double-neg88.4%
associate-*l*88.4%
*-commutative88.4%
sqr-neg88.4%
+-commutative88.4%
sqr-neg88.4%
fma-define88.4%
Simplified88.4%
Taylor expanded in z around inf 49.4%
associate-*r*49.5%
associate-/r*49.8%
Simplified49.8%
associate-/l/49.5%
div-inv49.5%
unpow249.5%
times-frac58.3%
Applied egg-rr58.3%
*-commutative58.3%
frac-times49.5%
div-inv49.5%
associate-/l/58.8%
clear-num58.8%
associate-/l/58.2%
*-un-lft-identity58.2%
div-inv58.2%
*-commutative58.2%
times-frac58.6%
clear-num58.6%
/-rgt-identity58.6%
div-inv58.6%
clear-num58.6%
/-rgt-identity58.6%
*-commutative58.6%
Applied egg-rr58.6%
Final simplification89.4%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (if (<= z_m 1.0) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* z_m (* y_m (* x_m z_m))))))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
real(8) :: tmp
if (z_m <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = 1.0d0 / (z_m * (y_m * (x_m * z_m)))
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if z_m <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / (z_m * (y_m * (x_m * z_m))) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(z_m * Float64(y_m * Float64(x_m * z_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if (z_m <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / (z_m * (y_m * (x_m * z_m)));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(z$95$m * N[(y$95$m * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z\_m \cdot \left(y\_m \cdot \left(x\_m \cdot z\_m\right)\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 92.4%
associate-/l/91.6%
remove-double-neg91.6%
distribute-rgt-neg-out91.6%
distribute-rgt-neg-out91.6%
remove-double-neg91.6%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
Taylor expanded in z around 0 69.5%
*-commutative69.5%
associate-/r*69.4%
Simplified69.4%
if 1 < z Initial program 80.5%
associate-/l/78.6%
remove-double-neg78.6%
distribute-rgt-neg-out78.6%
distribute-rgt-neg-out78.6%
remove-double-neg78.6%
associate-*l*83.1%
*-commutative83.1%
sqr-neg83.1%
+-commutative83.1%
sqr-neg83.1%
fma-define83.1%
Simplified83.1%
Taylor expanded in z around inf 77.6%
associate-*r*76.6%
associate-/r*78.0%
Simplified78.0%
associate-/l/78.0%
div-inv78.0%
unpow278.0%
times-frac93.5%
Applied egg-rr93.5%
*-commutative93.5%
frac-times78.0%
div-inv78.0%
associate-/l/86.8%
clear-num86.8%
associate-/l/84.9%
*-un-lft-identity84.9%
div-inv84.9%
*-commutative84.9%
times-frac90.9%
clear-num90.9%
/-rgt-identity90.9%
div-inv90.9%
clear-num90.9%
/-rgt-identity90.9%
*-commutative90.9%
Applied egg-rr90.9%
Final simplification74.8%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (if (<= z_m 1.0) (/ (/ 1.0 y_m) x_m) (/ (/ 1.0 y_m) (* z_m (* x_m z_m)))))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / y_m) / (z_m * (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
real(8) :: tmp
if (z_m <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = (1.0d0 / y_m) / (z_m * (x_m * z_m))
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / y_m) / (z_m * (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if z_m <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = (1.0 / y_m) / (z_m * (x_m * z_m)) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(1.0 / y_m) / Float64(z_m * Float64(x_m * z_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if (z_m <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = (1.0 / y_m) / (z_m * (x_m * z_m));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(z$95$m * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{z\_m \cdot \left(x\_m \cdot z\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 92.4%
associate-/l/91.6%
remove-double-neg91.6%
distribute-rgt-neg-out91.6%
distribute-rgt-neg-out91.6%
remove-double-neg91.6%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
Taylor expanded in z around 0 69.5%
*-commutative69.5%
associate-/r*69.4%
Simplified69.4%
if 1 < z Initial program 80.5%
associate-/l/78.6%
remove-double-neg78.6%
distribute-rgt-neg-out78.6%
distribute-rgt-neg-out78.6%
remove-double-neg78.6%
associate-*l*83.1%
*-commutative83.1%
sqr-neg83.1%
+-commutative83.1%
sqr-neg83.1%
fma-define83.1%
Simplified83.1%
Taylor expanded in z around inf 77.6%
associate-*r*76.6%
associate-/r*78.0%
Simplified78.0%
associate-/l/78.0%
div-inv78.0%
unpow278.0%
times-frac93.5%
Applied egg-rr93.5%
*-commutative93.5%
clear-num93.5%
frac-times92.0%
*-un-lft-identity92.0%
div-inv92.0%
clear-num92.1%
/-rgt-identity92.1%
*-commutative92.1%
Applied egg-rr92.1%
Final simplification75.0%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
z_m = abs(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_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
end function
z_m = Math.abs(z);
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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * (1.0 / (x_m * y_m)))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m)))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right)
\end{array}
Initial program 89.4%
associate-/l/88.4%
remove-double-neg88.4%
distribute-rgt-neg-out88.4%
distribute-rgt-neg-out88.4%
remove-double-neg88.4%
associate-*l*88.4%
*-commutative88.4%
sqr-neg88.4%
+-commutative88.4%
sqr-neg88.4%
fma-define88.4%
Simplified88.4%
Taylor expanded in z around 0 56.3%
Final simplification56.3%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
(if (< t_1 (- INFINITY))
t_2
(if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))
double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z): t_0 = 1.0 + (z * z) t_1 = y * t_0 t_2 = (1.0 / y) / (t_0 * x) tmp = 0 if t_1 < -math.inf: tmp = t_2 elif t_1 < 8.680743250567252e+305: tmp = (1.0 / x) / (t_0 * y) else: tmp = t_2 return tmp
function code(x, y, z) t_0 = Float64(1.0 + Float64(z * z)) t_1 = Float64(y * t_0) t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x)) tmp = 0.0 if (t_1 < Float64(-Inf)) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z) t_0 = 1.0 + (z * z); t_1 = y * t_0; t_2 = (1.0 / y) / (t_0 * x); tmp = 0.0; if (t_1 < -Inf) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = (1.0 / x) / (t_0 * y); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + z \cdot z\\
t_1 := y \cdot t\_0\\
t_2 := \frac{\frac{1}{y}}{t\_0 \cdot x}\\
\mathbf{if}\;t\_1 < -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 < 8.680743250567252 \cdot 10^{+305}:\\
\;\;\;\;\frac{\frac{1}{x}}{t\_0 \cdot y}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024095
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))