
(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 15 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 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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 2e+127)
(/ (/ 1.0 y_m) (* x_m (+ 1.0 (pow z_m 2.0))))
(* (/ 1.0 (hypot 1.0 z_m)) (/ 1.0 (* y_m (* z_m x_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 <= 2e+127) {
tmp = (1.0 / y_m) / (x_m * (1.0 + pow(z_m, 2.0)));
} else {
tmp = (1.0 / hypot(1.0, z_m)) * (1.0 / (y_m * (z_m * x_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 <= 2e+127) {
tmp = (1.0 / y_m) / (x_m * (1.0 + Math.pow(z_m, 2.0)));
} else {
tmp = (1.0 / Math.hypot(1.0, z_m)) * (1.0 / (y_m * (z_m * x_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 <= 2e+127: tmp = (1.0 / y_m) / (x_m * (1.0 + math.pow(z_m, 2.0))) else: tmp = (1.0 / math.hypot(1.0, z_m)) * (1.0 / (y_m * (z_m * x_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 <= 2e+127) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * Float64(1.0 + (z_m ^ 2.0)))); else tmp = Float64(Float64(1.0 / hypot(1.0, z_m)) * Float64(1.0 / Float64(y_m * Float64(z_m * x_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 <= 2e+127)
tmp = (1.0 / y_m) / (x_m * (1.0 + (z_m ^ 2.0)));
else
tmp = (1.0 / hypot(1.0, z_m)) * (1.0 / (y_m * (z_m * x_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, 2e+127], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(1.0 + N[Power[z$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(z$95$m * x$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 2 \cdot 10^{+127}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \left(1 + {z\_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\mathsf{hypot}\left(1, z\_m\right)} \cdot \frac{1}{y\_m \cdot \left(z\_m \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1.99999999999999991e127Initial program 94.4%
associate-/l/94.2%
metadata-eval94.2%
associate-*r/94.2%
associate-/l/94.4%
associate-*r/94.4%
associate-/l*94.1%
associate-/r/94.2%
/-rgt-identity94.2%
associate-*l*91.6%
*-commutative91.6%
sqr-neg91.6%
+-commutative91.6%
sqr-neg91.6%
fma-def91.6%
Simplified91.6%
fma-udef91.6%
+-commutative91.6%
*-commutative91.6%
associate-*l*94.2%
associate-/l/94.4%
add-sqr-sqrt48.5%
*-un-lft-identity48.5%
times-frac48.5%
*-commutative48.5%
sqrt-prod48.5%
hypot-1-def48.6%
*-commutative48.6%
sqrt-prod48.9%
hypot-1-def51.9%
Applied egg-rr51.9%
frac-times50.3%
*-un-lft-identity50.3%
associate-/l/50.1%
*-commutative50.1%
*-commutative50.1%
swap-sqr48.4%
add-sqr-sqrt94.2%
pow294.2%
associate-*r*91.6%
add-sqr-sqrt50.8%
pow250.8%
pow-prod-down52.1%
associate-/r*52.2%
*-commutative52.2%
unpow-prod-down50.9%
Applied egg-rr91.8%
if 1.99999999999999991e127 < z Initial program 65.1%
associate-/l/65.2%
metadata-eval65.2%
associate-*r/65.2%
associate-/l/65.1%
associate-*r/65.1%
associate-/l*65.2%
associate-/r/65.2%
/-rgt-identity65.2%
associate-*l*67.6%
*-commutative67.6%
sqr-neg67.6%
+-commutative67.6%
sqr-neg67.6%
fma-def67.6%
Simplified67.6%
fma-udef67.6%
+-commutative67.6%
*-commutative67.6%
associate-*l*65.2%
associate-/l/65.1%
add-sqr-sqrt29.1%
*-un-lft-identity29.1%
times-frac29.1%
*-commutative29.1%
sqrt-prod29.1%
hypot-1-def29.1%
*-commutative29.1%
sqrt-prod29.1%
hypot-1-def47.4%
Applied egg-rr47.4%
frac-times38.7%
*-un-lft-identity38.7%
inv-pow38.7%
metadata-eval38.7%
pow-prod-up28.6%
frac-times32.4%
associate-/r*32.3%
associate-/r*32.3%
frac-times26.1%
add-sqr-sqrt41.4%
Applied egg-rr41.4%
associate-*l/41.5%
associate-*r/41.5%
pow-sqr86.4%
metadata-eval86.4%
unpow-186.4%
*-rgt-identity86.4%
*-commutative86.4%
associate-*l/86.3%
associate-/l/86.5%
associate-*r/86.5%
*-rgt-identity86.5%
Simplified86.5%
associate-/l/97.5%
div-inv97.5%
Applied egg-rr97.5%
Taylor expanded in z around inf 97.5%
Final simplification92.7%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 t_0) (/ (/ 1.0 x_m) 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 / t_0) * ((1.0 / x_m) / 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 / t_0) * ((1.0 / x_m) / 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 / t_0) * ((1.0 / x_m) / 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 / t_0) * Float64(Float64(1.0 / x_m) / 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 / t_0) * ((1.0 / x_m) / 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 / t$95$0), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $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 := \mathsf{hypot}\left(1, z\_m\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \left(\frac{1}{t\_0} \cdot \frac{\frac{1}{x\_m}}{t\_0}\right)\right)
\end{array}
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
fma-udef87.8%
+-commutative87.8%
*-commutative87.8%
associate-*l*89.7%
associate-/l/89.8%
add-sqr-sqrt45.5%
*-un-lft-identity45.5%
times-frac45.5%
*-commutative45.5%
sqrt-prod45.5%
hypot-1-def45.5%
*-commutative45.5%
sqrt-prod45.8%
hypot-1-def51.2%
Applied egg-rr51.2%
Final simplification51.2%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (pow (/ (pow x_m -0.5) (* (hypot 1.0 z_m) (sqrt y_m))) 2.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) {
return y_s * (x_s * pow((pow(x_m, -0.5) / (hypot(1.0, z_m) * sqrt(y_m))), 2.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) {
return y_s * (x_s * Math.pow((Math.pow(x_m, -0.5) / (Math.hypot(1.0, z_m) * Math.sqrt(y_m))), 2.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): return y_s * (x_s * math.pow((math.pow(x_m, -0.5) / (math.hypot(1.0, z_m) * math.sqrt(y_m))), 2.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) return Float64(y_s * Float64(x_s * (Float64((x_m ^ -0.5) / Float64(hypot(1.0, z_m) * sqrt(y_m))) ^ 2.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)
tmp = y_s * (x_s * (((x_m ^ -0.5) / (hypot(1.0, z_m) * sqrt(y_m))) ^ 2.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_] := N[(y$95$s * N[(x$95$s * N[Power[N[(N[Power[x$95$m, -0.5], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.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])\\
\\
y\_s \cdot \left(x\_s \cdot {\left(\frac{{x\_m}^{-0.5}}{\mathsf{hypot}\left(1, z\_m\right) \cdot \sqrt{y\_m}}\right)}^{2}\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
fma-udef87.8%
+-commutative87.8%
*-commutative87.8%
associate-*l*89.7%
associate-/l/89.8%
add-sqr-sqrt62.5%
sqrt-div28.3%
inv-pow28.3%
sqrt-pow128.3%
metadata-eval28.3%
*-commutative28.3%
sqrt-prod28.2%
hypot-1-def28.3%
sqrt-div28.2%
inv-pow28.2%
sqrt-pow128.2%
metadata-eval28.2%
*-commutative28.2%
Applied egg-rr31.7%
unpow231.7%
Simplified31.7%
Final simplification31.7%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (hypot 1.0 z_m)) (/ 1.0 (* y_m (* (hypot 1.0 z_m) x_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 / hypot(1.0, z_m)) * (1.0 / (y_m * (hypot(1.0, z_m) * x_m)))));
}
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 / Math.hypot(1.0, z_m)) * (1.0 / (y_m * (Math.hypot(1.0, z_m) * x_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 / math.hypot(1.0, z_m)) * (1.0 / (y_m * (math.hypot(1.0, z_m) * x_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(Float64(1.0 / hypot(1.0, z_m)) * Float64(1.0 / Float64(y_m * Float64(hypot(1.0, z_m) * x_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 / hypot(1.0, z_m)) * (1.0 / (y_m * (hypot(1.0, z_m) * x_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[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$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 \left(\frac{1}{\mathsf{hypot}\left(1, z\_m\right)} \cdot \frac{1}{y\_m \cdot \left(\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m\right)}\right)\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
fma-udef87.8%
+-commutative87.8%
*-commutative87.8%
associate-*l*89.7%
associate-/l/89.8%
add-sqr-sqrt45.5%
*-un-lft-identity45.5%
times-frac45.5%
*-commutative45.5%
sqrt-prod45.5%
hypot-1-def45.5%
*-commutative45.5%
sqrt-prod45.8%
hypot-1-def51.2%
Applied egg-rr51.2%
frac-times48.5%
*-un-lft-identity48.5%
inv-pow48.5%
metadata-eval48.5%
pow-prod-up30.5%
frac-times31.7%
associate-/r*31.7%
associate-/r*31.7%
frac-times28.3%
add-sqr-sqrt50.5%
Applied egg-rr50.5%
associate-*l/50.5%
associate-*r/50.5%
pow-sqr93.2%
metadata-eval93.2%
unpow-193.2%
*-rgt-identity93.2%
*-commutative93.2%
associate-*l/93.2%
associate-/l/93.2%
associate-*r/93.2%
*-rgt-identity93.2%
Simplified93.2%
associate-/l/96.5%
div-inv96.4%
Applied egg-rr96.4%
Final simplification96.4%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (hypot 1.0 z_m)) (* (hypot 1.0 z_m) 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 / hypot(1.0, z_m)) / (hypot(1.0, z_m) * x_m)) / y_m));
}
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 / Math.hypot(1.0, z_m)) / (Math.hypot(1.0, z_m) * 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 / math.hypot(1.0, z_m)) / (math.hypot(1.0, z_m) * 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(Float64(Float64(1.0 / hypot(1.0, z_m)) / Float64(hypot(1.0, z_m) * 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 / hypot(1.0, z_m)) / (hypot(1.0, z_m) * 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[(N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $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{\frac{\frac{1}{\mathsf{hypot}\left(1, z\_m\right)}}{\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m}}{y\_m}\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
fma-udef87.8%
+-commutative87.8%
*-commutative87.8%
associate-*l*89.7%
associate-/l/89.8%
add-sqr-sqrt45.5%
*-un-lft-identity45.5%
times-frac45.5%
*-commutative45.5%
sqrt-prod45.5%
hypot-1-def45.5%
*-commutative45.5%
sqrt-prod45.8%
hypot-1-def51.2%
Applied egg-rr51.2%
frac-times48.5%
*-un-lft-identity48.5%
inv-pow48.5%
metadata-eval48.5%
pow-prod-up30.5%
frac-times31.7%
associate-/r*31.7%
associate-/r*31.7%
frac-times28.3%
add-sqr-sqrt50.5%
Applied egg-rr50.5%
associate-*l/50.5%
associate-*r/50.5%
pow-sqr93.2%
metadata-eval93.2%
unpow-193.2%
*-rgt-identity93.2%
*-commutative93.2%
associate-*l/93.2%
associate-/l/93.2%
associate-*r/93.2%
*-rgt-identity93.2%
Simplified93.2%
Final simplification93.2%
z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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) 2e+264)
(/ (/ 1.0 y_m) (* x_m (+ 1.0 (pow z_m 2.0))))
(* (/ 1.0 (hypot 1.0 z_m)) (/ 1.0 (* x_m (* z_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) {
double tmp;
if ((z_m * z_m) <= 2e+264) {
tmp = (1.0 / y_m) / (x_m * (1.0 + pow(z_m, 2.0)));
} else {
tmp = (1.0 / hypot(1.0, z_m)) * (1.0 / (x_m * (z_m * 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) <= 2e+264) {
tmp = (1.0 / y_m) / (x_m * (1.0 + Math.pow(z_m, 2.0)));
} else {
tmp = (1.0 / Math.hypot(1.0, z_m)) * (1.0 / (x_m * (z_m * 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) <= 2e+264: tmp = (1.0 / y_m) / (x_m * (1.0 + math.pow(z_m, 2.0))) else: tmp = (1.0 / math.hypot(1.0, z_m)) * (1.0 / (x_m * (z_m * 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) <= 2e+264) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * Float64(1.0 + (z_m ^ 2.0)))); else tmp = Float64(Float64(1.0 / hypot(1.0, z_m)) * Float64(1.0 / Float64(x_m * Float64(z_m * 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) <= 2e+264)
tmp = (1.0 / y_m) / (x_m * (1.0 + (z_m ^ 2.0)));
else
tmp = (1.0 / hypot(1.0, z_m)) * (1.0 / (x_m * (z_m * 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], 2e+264], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(1.0 + N[Power[z$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * N[(z$95$m * y$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 \cdot z\_m \leq 2 \cdot 10^{+264}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \left(1 + {z\_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\mathsf{hypot}\left(1, z\_m\right)} \cdot \frac{1}{x\_m \cdot \left(z\_m \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000009e264Initial program 98.1%
associate-/l/97.8%
metadata-eval97.8%
associate-*r/97.8%
associate-/l/98.1%
associate-*r/98.1%
associate-/l*97.7%
associate-/r/97.8%
/-rgt-identity97.8%
associate-*l*95.3%
*-commutative95.3%
sqr-neg95.3%
+-commutative95.3%
sqr-neg95.3%
fma-def95.3%
Simplified95.3%
fma-udef95.3%
+-commutative95.3%
*-commutative95.3%
associate-*l*97.8%
associate-/l/98.1%
add-sqr-sqrt50.5%
*-un-lft-identity50.5%
times-frac50.5%
*-commutative50.5%
sqrt-prod50.5%
hypot-1-def50.5%
*-commutative50.5%
sqrt-prod51.0%
hypot-1-def51.0%
Applied egg-rr51.0%
frac-times50.5%
*-un-lft-identity50.5%
associate-/l/50.4%
*-commutative50.4%
*-commutative50.4%
swap-sqr50.3%
add-sqr-sqrt97.8%
pow297.8%
associate-*r*95.3%
add-sqr-sqrt55.4%
pow255.4%
pow-prod-down55.4%
associate-/r*55.5%
*-commutative55.5%
unpow-prod-down55.5%
Applied egg-rr95.6%
if 2.00000000000000009e264 < (*.f64 z z) Initial program 68.4%
associate-/l/68.5%
metadata-eval68.5%
associate-*r/68.5%
associate-/l/68.4%
associate-*r/68.4%
associate-/l*68.5%
associate-/r/68.5%
/-rgt-identity68.5%
associate-*l*68.5%
*-commutative68.5%
sqr-neg68.5%
+-commutative68.5%
sqr-neg68.5%
fma-def68.5%
Simplified68.5%
fma-udef68.5%
+-commutative68.5%
*-commutative68.5%
associate-*l*68.5%
associate-/l/68.4%
add-sqr-sqrt32.5%
*-un-lft-identity32.5%
times-frac32.5%
*-commutative32.5%
sqrt-prod32.5%
hypot-1-def32.5%
*-commutative32.5%
sqrt-prod32.5%
hypot-1-def51.9%
Applied egg-rr51.9%
frac-times43.0%
*-un-lft-identity43.0%
inv-pow43.0%
metadata-eval43.0%
pow-prod-up24.7%
frac-times29.4%
associate-/r*29.4%
associate-/r*29.4%
frac-times23.3%
add-sqr-sqrt37.6%
Applied egg-rr37.6%
associate-*l/37.6%
associate-*r/37.6%
pow-sqr87.1%
metadata-eval87.1%
unpow-187.1%
*-rgt-identity87.1%
*-commutative87.1%
associate-*l/87.0%
associate-/l/87.1%
associate-*r/87.1%
*-rgt-identity87.1%
Simplified87.1%
associate-/l/97.1%
div-inv97.2%
Applied egg-rr97.2%
Taylor expanded in z around inf 82.2%
Final simplification91.9%
z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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) 1e+25)
(/ 1.0 (* x_m (* y_m (+ 1.0 (* z_m z_m)))))
(/ (/ (/ 1.0 (hypot 1.0 z_m)) (* z_m 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) {
double tmp;
if ((z_m * z_m) <= 1e+25) {
tmp = 1.0 / (x_m * (y_m * (1.0 + (z_m * z_m))));
} else {
tmp = ((1.0 / hypot(1.0, z_m)) / (z_m * x_m)) / 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) <= 1e+25) {
tmp = 1.0 / (x_m * (y_m * (1.0 + (z_m * z_m))));
} else {
tmp = ((1.0 / Math.hypot(1.0, z_m)) / (z_m * x_m)) / 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) <= 1e+25: tmp = 1.0 / (x_m * (y_m * (1.0 + (z_m * z_m)))) else: tmp = ((1.0 / math.hypot(1.0, z_m)) / (z_m * x_m)) / 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) <= 1e+25) tmp = Float64(1.0 / Float64(x_m * Float64(y_m * Float64(1.0 + Float64(z_m * z_m))))); else tmp = Float64(Float64(Float64(1.0 / hypot(1.0, z_m)) / Float64(z_m * x_m)) / 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) <= 1e+25)
tmp = 1.0 / (x_m * (y_m * (1.0 + (z_m * z_m))));
else
tmp = ((1.0 / hypot(1.0, z_m)) / (z_m * x_m)) / 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], 1e+25], N[(1.0 / N[(x$95$m * N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $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 10^{+25}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{\mathsf{hypot}\left(1, z\_m\right)}}{z\_m \cdot x\_m}}{y\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.00000000000000009e25Initial program 99.6%
associate-/l/99.7%
Simplified99.7%
if 1.00000000000000009e25 < (*.f64 z z) Initial program 79.0%
associate-/l/78.5%
metadata-eval78.5%
associate-*r/78.5%
associate-/l/79.0%
associate-*r/79.0%
associate-/l*78.5%
associate-/r/78.5%
/-rgt-identity78.5%
associate-*l*74.7%
*-commutative74.7%
sqr-neg74.7%
+-commutative74.7%
sqr-neg74.7%
fma-def74.7%
Simplified74.7%
fma-udef74.7%
+-commutative74.7%
*-commutative74.7%
associate-*l*78.5%
associate-/l/79.0%
add-sqr-sqrt43.0%
*-un-lft-identity43.0%
times-frac42.9%
*-commutative42.9%
sqrt-prod42.9%
hypot-1-def42.9%
*-commutative42.9%
sqrt-prod43.6%
hypot-1-def55.0%
Applied egg-rr55.0%
frac-times49.2%
*-un-lft-identity49.2%
inv-pow49.2%
metadata-eval49.2%
pow-prod-up31.7%
frac-times34.4%
associate-/r*34.4%
associate-/r*34.4%
frac-times27.1%
add-sqr-sqrt43.7%
Applied egg-rr43.7%
associate-*l/43.7%
associate-*r/43.8%
pow-sqr86.0%
metadata-eval86.0%
unpow-186.0%
*-rgt-identity86.0%
*-commutative86.0%
associate-*l/86.0%
associate-/l/86.1%
associate-*r/86.1%
*-rgt-identity86.1%
Simplified86.1%
Taylor expanded in z around inf 68.2%
Final simplification84.8%
z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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) 2e+264)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(/ 1.0 (* x_m (fma (* z_m y_m) z_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) {
double tmp;
if ((z_m * z_m) <= 2e+264) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = 1.0 / (x_m * fma((z_m * y_m), z_m, 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) <= 2e+264) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.0)))); else tmp = Float64(1.0 / Float64(x_m * fma(Float64(z_m * y_m), z_m, 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[(z$95$m * z$95$m), $MachinePrecision], 2e+264], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] * z$95$m + 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 2 \cdot 10^{+264}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \mathsf{fma}\left(z\_m \cdot y\_m, z\_m, y\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000009e264Initial program 98.1%
associate-/l/97.8%
metadata-eval97.8%
associate-*r/97.8%
associate-/l/98.1%
associate-*r/98.1%
associate-/l*97.7%
associate-/r/97.8%
/-rgt-identity97.8%
associate-*l*95.3%
*-commutative95.3%
sqr-neg95.3%
+-commutative95.3%
sqr-neg95.3%
fma-def95.3%
Simplified95.3%
if 2.00000000000000009e264 < (*.f64 z z) Initial program 68.4%
associate-/l/68.5%
Simplified68.5%
+-commutative68.5%
distribute-lft-in68.5%
associate-*r*85.7%
*-rgt-identity85.7%
fma-def85.7%
Applied egg-rr85.7%
Final simplification92.6%
z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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 6.6e+39)
(/ 1.0 (* x_m (fma (* z_m y_m) z_m y_m)))
(/ (/ 1.0 y_m) (* x_m (+ 1.0 (pow z_m 2.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 tmp;
if (y_m <= 6.6e+39) {
tmp = 1.0 / (x_m * fma((z_m * y_m), z_m, y_m));
} else {
tmp = (1.0 / y_m) / (x_m * (1.0 + pow(z_m, 2.0)));
}
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 (y_m <= 6.6e+39) tmp = Float64(1.0 / Float64(x_m * fma(Float64(z_m * y_m), z_m, y_m))); else tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * Float64(1.0 + (z_m ^ 2.0)))); 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[y$95$m, 6.6e+39], N[(1.0 / N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] * z$95$m + y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(1.0 + N[Power[z$95$m, 2.0], $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 \leq 6.6 \cdot 10^{+39}:\\
\;\;\;\;\frac{1}{x\_m \cdot \mathsf{fma}\left(z\_m \cdot y\_m, z\_m, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \left(1 + {z\_m}^{2}\right)}\\
\end{array}\right)
\end{array}
if y < 6.60000000000000042e39Initial program 87.9%
associate-/l/87.8%
Simplified87.8%
+-commutative87.8%
distribute-lft-in87.8%
associate-*r*94.0%
*-rgt-identity94.0%
fma-def94.0%
Applied egg-rr94.0%
if 6.60000000000000042e39 < y Initial program 96.5%
associate-/l/96.1%
metadata-eval96.1%
associate-*r/96.1%
associate-/l/96.5%
associate-*r/96.5%
associate-/l*95.9%
associate-/r/96.1%
/-rgt-identity96.1%
associate-*l*97.6%
*-commutative97.6%
sqr-neg97.6%
+-commutative97.6%
sqr-neg97.6%
fma-def97.6%
Simplified97.6%
fma-udef97.6%
+-commutative97.6%
*-commutative97.6%
associate-*l*96.1%
associate-/l/96.5%
add-sqr-sqrt96.3%
*-un-lft-identity96.3%
times-frac96.3%
*-commutative96.3%
sqrt-prod96.3%
hypot-1-def96.3%
*-commutative96.3%
sqrt-prod97.8%
hypot-1-def99.5%
Applied egg-rr99.5%
frac-times96.4%
*-un-lft-identity96.4%
associate-/l/95.8%
*-commutative95.8%
*-commutative95.8%
swap-sqr95.8%
add-sqr-sqrt96.1%
pow296.1%
associate-*r*97.6%
add-sqr-sqrt64.7%
pow264.7%
pow-prod-down66.3%
associate-/r*66.4%
*-commutative66.4%
unpow-prod-down64.7%
Applied egg-rr98.2%
Final simplification94.9%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (* y_m (* x_m (fma z_m z_m 1.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) {
return y_s * (x_s * (1.0 / (y_m * (x_m * fma(z_m, z_m, 1.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) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.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_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $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 \frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)\right)}\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
Final simplification87.8%
z_m = (fabs.f64 z)
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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 1e+307)
(/ (/ 1.0 x_m) t_0)
(* (/ (/ 1.0 x_m) y_m) (* (/ 1.0 z_m) (/ 1.0 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 <= 1e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / x_m) / y_m) * ((1.0 / z_m) * (1.0 / 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) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z_m * z_m))
if (t_0 <= 1d+307) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = ((1.0d0 / x_m) / y_m) * ((1.0d0 / z_m) * (1.0d0 / 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 t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= 1e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / x_m) / y_m) * ((1.0 / z_m) * (1.0 / 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 <= 1e+307: tmp = (1.0 / x_m) / t_0 else: tmp = ((1.0 / x_m) / y_m) * ((1.0 / z_m) * (1.0 / 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 <= 1e+307) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(Float64(1.0 / x_m) / y_m) * Float64(Float64(1.0 / z_m) * Float64(1.0 / 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 <= 1e+307)
tmp = (1.0 / x_m) / t_0;
else
tmp = ((1.0 / x_m) / y_m) * ((1.0 / z_m) * (1.0 / 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, 1e+307], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(1.0 / 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])\\
\\
\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 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m} \cdot \left(\frac{1}{z\_m} \cdot \frac{1}{z\_m}\right)\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 9.99999999999999986e306Initial program 94.8%
if 9.99999999999999986e306 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 63.8%
associate-/l/63.8%
metadata-eval63.8%
associate-*r/63.8%
associate-/l/63.8%
associate-*r/63.8%
associate-/l*63.8%
associate-/r/63.8%
/-rgt-identity63.8%
associate-*l*66.0%
*-commutative66.0%
sqr-neg66.0%
+-commutative66.0%
sqr-neg66.0%
fma-def66.0%
Simplified66.0%
fma-udef66.0%
+-commutative66.0%
*-commutative66.0%
associate-*l*63.8%
associate-/l/63.8%
add-sqr-sqrt63.8%
sqrt-div36.1%
inv-pow36.1%
sqrt-pow136.1%
metadata-eval36.1%
*-commutative36.1%
sqrt-prod36.1%
hypot-1-def36.1%
sqrt-div36.1%
inv-pow36.1%
sqrt-pow136.1%
metadata-eval36.1%
*-commutative36.1%
Applied egg-rr58.3%
unpow258.3%
Simplified58.3%
Taylor expanded in z around inf 58.3%
associate-/r*58.4%
div-inv58.3%
metadata-eval58.3%
sqrt-pow158.3%
inv-pow58.3%
sqrt-div53.7%
associate-/r*53.7%
sqrt-div48.8%
metadata-eval48.8%
Applied egg-rr48.8%
associate-*r/48.9%
*-rgt-identity48.9%
Simplified48.9%
unpow248.9%
div-inv48.8%
div-inv48.8%
swap-sqr37.8%
un-div-inv37.8%
associate-/r*37.8%
add-sqr-sqrt68.8%
associate-/r*68.8%
Applied egg-rr68.8%
Final simplification90.6%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 0.00122) (/ 1.0 (* y_m x_m)) (/ (/ 1.0 (* z_m 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) {
double tmp;
if (z_m <= 0.00122) {
tmp = 1.0 / (y_m * x_m);
} else {
tmp = (1.0 / (z_m * x_m)) / y_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 <= 0.00122d0) then
tmp = 1.0d0 / (y_m * x_m)
else
tmp = (1.0d0 / (z_m * x_m)) / y_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 <= 0.00122) {
tmp = 1.0 / (y_m * x_m);
} else {
tmp = (1.0 / (z_m * x_m)) / 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 <= 0.00122: tmp = 1.0 / (y_m * x_m) else: tmp = (1.0 / (z_m * x_m)) / 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 (z_m <= 0.00122) tmp = Float64(1.0 / Float64(y_m * x_m)); else tmp = Float64(Float64(1.0 / Float64(z_m * x_m)) / 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 <= 0.00122)
tmp = 1.0 / (y_m * x_m);
else
tmp = (1.0 / (z_m * x_m)) / 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[z$95$m, 0.00122], N[(1.0 / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $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 0.00122:\\
\;\;\;\;\frac{1}{y\_m \cdot x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z\_m \cdot x\_m}}{y\_m}\\
\end{array}\right)
\end{array}
if z < 0.00121999999999999995Initial program 93.6%
associate-/l/93.6%
metadata-eval93.6%
associate-*r/93.6%
associate-/l/93.6%
associate-*r/93.6%
associate-/l*93.5%
associate-/r/93.6%
/-rgt-identity93.6%
associate-*l*93.1%
*-commutative93.1%
sqr-neg93.1%
+-commutative93.1%
sqr-neg93.1%
fma-def93.1%
Simplified93.1%
Taylor expanded in z around 0 74.0%
if 0.00121999999999999995 < z Initial program 79.4%
associate-/l/78.8%
metadata-eval78.8%
associate-*r/78.8%
associate-/l/79.4%
associate-*r/79.4%
associate-/l*78.8%
associate-/r/78.8%
/-rgt-identity78.8%
associate-*l*73.4%
*-commutative73.4%
sqr-neg73.4%
+-commutative73.4%
sqr-neg73.4%
fma-def73.4%
Simplified73.4%
fma-udef73.4%
+-commutative73.4%
*-commutative73.4%
associate-*l*78.8%
associate-/l/79.4%
add-sqr-sqrt40.5%
*-un-lft-identity40.5%
times-frac40.4%
*-commutative40.4%
sqrt-prod40.4%
hypot-1-def40.4%
*-commutative40.4%
sqrt-prod40.4%
hypot-1-def51.2%
Applied egg-rr51.2%
frac-times46.2%
*-un-lft-identity46.2%
inv-pow46.2%
metadata-eval46.2%
pow-prod-up37.3%
frac-times39.4%
associate-/r*39.5%
associate-/r*39.4%
frac-times30.3%
add-sqr-sqrt48.0%
Applied egg-rr48.0%
associate-*l/48.1%
associate-*r/48.1%
pow-sqr84.9%
metadata-eval84.9%
unpow-184.9%
*-rgt-identity84.9%
*-commutative84.9%
associate-*l/84.8%
associate-/l/84.9%
associate-*r/84.9%
*-rgt-identity84.9%
Simplified84.9%
Taylor expanded in z around 0 43.8%
Taylor expanded in z around inf 43.8%
Final simplification66.0%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (+ 1.0 (* z_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) {
return y_s * (x_s * (1.0 / (x_m * (y_m * (1.0 + (z_m * z_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 * (1.0d0 + (z_m * z_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 * (1.0 + (z_m * z_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 * (1.0 + (z_m * z_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 * Float64(y_m * Float64(1.0 + Float64(z_m * z_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 * (1.0 + (z_m * z_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 * N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $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 \frac{1}{x\_m \cdot \left(y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\right)}\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
Simplified89.7%
Final simplification89.7%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (+ 1.0 (* z_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) {
return y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z_m * z_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 * (1.0d0 + (z_m * z_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 * (1.0 + (z_m * z_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 * (1.0 + (z_m * z_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(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z_m * z_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 * (1.0 + (z_m * z_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[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z$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 \frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z\_m \cdot z\_m\right)}\right)
\end{array}
Initial program 89.8%
Final simplification89.8%
z_m = (fabs.f64 z) x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 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 (* y_m x_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 / (y_m * x_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 / (y_m * x_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 / (y_m * x_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 / (y_m * x_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(y_m * x_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 / (y_m * x_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[(y$95$m * x$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}{y\_m \cdot x\_m}\right)
\end{array}
Initial program 89.8%
associate-/l/89.7%
metadata-eval89.7%
associate-*r/89.7%
associate-/l/89.8%
associate-*r/89.8%
associate-/l*89.6%
associate-/r/89.7%
/-rgt-identity89.7%
associate-*l*87.8%
*-commutative87.8%
sqr-neg87.8%
+-commutative87.8%
sqr-neg87.8%
fma-def87.8%
Simplified87.8%
Taylor expanded in z around 0 59.7%
Final simplification59.7%
(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 2024041
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:herbie-target
(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)))))