
(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 11 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 2.22e+116)
(/ (/ 1.0 y_m) (* x_m (fma z_m z_m 1.0)))
(* (/ 1.0 z_m) (/ 1.0 (* 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 <= 2.22e+116) {
tmp = (1.0 / y_m) / (x_m * fma(z_m, z_m, 1.0));
} else {
tmp = (1.0 / z_m) * (1.0 / (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 <= 2.22e+116) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z_m, z_m, 1.0))); else tmp = Float64(Float64(1.0 / z_m) * Float64(1.0 / 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[z$95$m, 2.22e+116], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(1.0 / 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 2.22 \cdot 10^{+116}:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m \cdot \mathsf{fma}\left(z_m, z_m, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m} \cdot \frac{1}{y_m \cdot \left(x_m \cdot z_m\right)}\\
\end{array}\right)
\end{array}
if z < 2.2199999999999999e116Initial program 93.9%
associate-/r*93.8%
sqr-neg93.8%
+-commutative93.8%
sqr-neg93.8%
fma-def93.8%
Simplified93.8%
/-rgt-identity93.8%
*-commutative93.8%
fma-udef93.8%
+-commutative93.8%
associate-/l*93.7%
+-commutative93.7%
fma-udef93.7%
*-commutative93.7%
associate-/l*92.4%
associate-/l/92.4%
*-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in x around 0 93.8%
associate-/r*93.9%
+-commutative93.9%
unpow293.9%
fma-udef93.9%
associate-/r*92.6%
associate-/r*92.5%
associate-/l/92.6%
associate-/l/92.7%
*-commutative92.7%
Simplified92.7%
if 2.2199999999999999e116 < z Initial program 70.7%
associate-/l/70.7%
metadata-eval70.7%
associate-/r*70.7%
metadata-eval70.7%
neg-mul-170.7%
distribute-neg-frac70.7%
distribute-frac-neg70.7%
distribute-frac-neg70.7%
distribute-neg-frac70.7%
metadata-eval70.7%
neg-mul-170.7%
associate-/r*70.7%
metadata-eval70.7%
associate-/r*70.8%
sqr-neg70.8%
+-commutative70.8%
sqr-neg70.8%
fma-def70.8%
Simplified70.8%
Taylor expanded in z around inf 70.8%
div-inv70.8%
add-sqr-sqrt55.5%
associate-*l*55.4%
associate-/r*55.4%
sqrt-div32.0%
inv-pow32.0%
metadata-eval32.0%
pow-prod-up32.0%
sqrt-unprod32.0%
add-sqr-sqrt32.0%
unpow232.0%
sqrt-prod32.0%
add-sqr-sqrt32.0%
Applied egg-rr53.4%
associate-*r/53.5%
*-rgt-identity53.5%
associate-*r/34.4%
unpow234.4%
Simplified34.4%
unpow234.4%
frac-times32.0%
pow-prod-up70.7%
metadata-eval70.7%
inv-pow70.7%
unpow270.7%
associate-/r*70.8%
associate-/l/70.7%
add-sqr-sqrt70.6%
associate-/l*70.7%
sqrt-div70.8%
metadata-eval70.8%
unpow270.8%
sqrt-prod70.8%
add-sqr-sqrt70.8%
sqrt-div70.8%
metadata-eval70.8%
unpow270.8%
sqrt-prod78.0%
add-sqr-sqrt78.1%
Applied egg-rr78.1%
associate-/l/94.9%
div-inv94.7%
associate-/r/94.9%
/-rgt-identity94.9%
Applied egg-rr94.9%
Final simplification93.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 (pow (/ (pow x_m -0.5) (* (sqrt y_m) (hypot 1.0 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) {
return y_s * (x_s * pow((pow(x_m, -0.5) / (sqrt(y_m) * hypot(1.0, z_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.sqrt(y_m) * Math.hypot(1.0, z_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.sqrt(y_m) * math.hypot(1.0, z_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(sqrt(y_m) * hypot(1.0, z_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) / (sqrt(y_m) * hypot(1.0, z_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[y$95$m], $MachinePrecision] * N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $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}}{\sqrt{y_m} \cdot \mathsf{hypot}\left(1, z_m\right)}\right)}^{2}\right)
\end{array}
Initial program 90.4%
associate-/r*90.3%
sqr-neg90.3%
+-commutative90.3%
sqr-neg90.3%
fma-def90.3%
Simplified90.3%
fma-udef90.3%
+-commutative90.3%
associate-/r*90.4%
add-sqr-sqrt57.6%
sqrt-div20.5%
inv-pow20.5%
sqrt-pow120.5%
metadata-eval20.5%
+-commutative20.5%
fma-udef20.5%
sqrt-prod20.5%
fma-udef20.5%
+-commutative20.5%
hypot-1-def20.5%
sqrt-div20.5%
inv-pow20.5%
sqrt-pow120.5%
metadata-eval20.5%
Applied egg-rr22.5%
unpow222.5%
Simplified22.5%
Final simplification22.5%
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 x_m) (hypot 1.0 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) {
return y_s * (x_s * (((1.0 / hypot(1.0, z_m)) * ((1.0 / x_m) / hypot(1.0, z_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)) * ((1.0 / x_m) / Math.hypot(1.0, z_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)) * ((1.0 / x_m) / math.hypot(1.0, z_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(Float64(1.0 / x_m) / hypot(1.0, z_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)) * ((1.0 / x_m) / hypot(1.0, z_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[(1.0 / x$95$m), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $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{1}{\mathsf{hypot}\left(1, z_m\right)} \cdot \frac{\frac{1}{x_m}}{\mathsf{hypot}\left(1, z_m\right)}}{y_m}\right)
\end{array}
Initial program 90.4%
associate-/l/89.4%
metadata-eval89.4%
associate-/r*89.4%
metadata-eval89.4%
neg-mul-189.4%
distribute-neg-frac89.4%
distribute-frac-neg89.4%
distribute-frac-neg89.4%
distribute-neg-frac89.4%
metadata-eval89.4%
neg-mul-189.4%
associate-/r*89.4%
metadata-eval89.4%
associate-/r*89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-def89.3%
Simplified89.3%
associate-/r*89.4%
*-un-lft-identity89.4%
add-sqr-sqrt89.3%
times-frac89.3%
fma-udef89.3%
+-commutative89.3%
hypot-1-def89.3%
fma-udef89.3%
+-commutative89.3%
hypot-1-def92.2%
Applied egg-rr92.2%
Final simplification92.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
(let* ((t_0 (* y_m (+ 1.0 (* z_m z_m)))))
(*
y_s
(*
x_s
(if (<= t_0 1e+299)
(/ (/ 1.0 x_m) t_0)
(* (/ 1.0 z_m) (/ 1.0 (* 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 <= 1e+299) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z_m) * (1.0 / (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) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z_m * z_m))
if (t_0 <= 1d+299) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = (1.0d0 / z_m) * (1.0d0 / (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 t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= 1e+299) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z_m) * (1.0 / (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 <= 1e+299: tmp = (1.0 / x_m) / t_0 else: tmp = (1.0 / z_m) * (1.0 / (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 <= 1e+299) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(1.0 / z_m) * Float64(1.0 / 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 <= 1e+299)
tmp = (1.0 / x_m) / t_0;
else
tmp = (1.0 / z_m) * (1.0 / (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, 1e+299], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(1.0 / 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 10^{+299}:\\
\;\;\;\;\frac{\frac{1}{x_m}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m} \cdot \frac{1}{y_m \cdot \left(x_m \cdot z_m\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 1.0000000000000001e299Initial program 93.7%
if 1.0000000000000001e299 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 71.2%
associate-/l/73.8%
metadata-eval73.8%
associate-/r*73.8%
metadata-eval73.8%
neg-mul-173.8%
distribute-neg-frac73.8%
distribute-frac-neg73.8%
distribute-frac-neg73.8%
distribute-neg-frac73.8%
metadata-eval73.8%
neg-mul-173.8%
associate-/r*73.8%
metadata-eval73.8%
associate-/r*73.8%
sqr-neg73.8%
+-commutative73.8%
sqr-neg73.8%
fma-def73.8%
Simplified73.8%
Taylor expanded in z around inf 73.8%
div-inv73.8%
add-sqr-sqrt71.2%
associate-*l*71.2%
associate-/r*71.2%
sqrt-div46.5%
inv-pow46.5%
metadata-eval46.5%
pow-prod-up46.5%
sqrt-unprod46.4%
add-sqr-sqrt46.5%
unpow246.5%
sqrt-prod18.9%
add-sqr-sqrt43.9%
Applied egg-rr57.7%
associate-*r/57.8%
*-rgt-identity57.8%
associate-*r/49.0%
unpow249.0%
Simplified49.0%
unpow249.0%
frac-times46.4%
pow-prod-up73.8%
metadata-eval73.8%
inv-pow73.8%
unpow273.8%
associate-/r*73.8%
associate-/l/73.8%
add-sqr-sqrt73.8%
associate-/l*73.8%
sqrt-div73.8%
metadata-eval73.8%
unpow273.8%
sqrt-prod35.0%
add-sqr-sqrt71.4%
sqrt-div71.4%
metadata-eval71.4%
unpow271.4%
sqrt-prod37.5%
add-sqr-sqrt78.9%
Applied egg-rr78.9%
associate-/l/94.2%
div-inv94.0%
associate-/r/94.1%
/-rgt-identity94.1%
Applied egg-rr94.1%
Final simplification93.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 1.0)
(/ (/ 1.0 y_m) x_m)
(* (/ 1.0 z_m) (/ 1.0 (* 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) * (1.0 / (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) * (1.0d0 / (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) * (1.0 / (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) * (1.0 / (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(Float64(1.0 / z_m) * Float64(1.0 / 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) * (1.0 / (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[(N[(1.0 / z$95$m), $MachinePrecision] * N[(1.0 / 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 \frac{1}{y_m \cdot \left(x_m \cdot z_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.2%
associate-/r*93.1%
sqr-neg93.1%
+-commutative93.1%
sqr-neg93.1%
fma-def93.1%
Simplified93.1%
Taylor expanded in z around 0 75.9%
*-commutative75.9%
associate-/r*75.9%
Simplified75.9%
if 1 < z Initial program 81.3%
associate-/l/80.0%
metadata-eval80.0%
associate-/r*80.0%
metadata-eval80.0%
neg-mul-180.0%
distribute-neg-frac80.0%
distribute-frac-neg80.0%
distribute-frac-neg80.0%
distribute-neg-frac80.0%
metadata-eval80.0%
neg-mul-180.0%
associate-/r*80.0%
metadata-eval80.0%
associate-/r*80.0%
sqr-neg80.0%
+-commutative80.0%
sqr-neg80.0%
fma-def80.0%
Simplified80.0%
Taylor expanded in z around inf 78.5%
div-inv78.4%
add-sqr-sqrt49.0%
associate-*l*49.0%
associate-/r*49.0%
sqrt-div31.0%
inv-pow31.0%
metadata-eval31.0%
pow-prod-up30.9%
sqrt-unprod30.9%
add-sqr-sqrt30.9%
unpow230.9%
sqrt-prod30.9%
add-sqr-sqrt30.9%
Applied egg-rr44.4%
associate-*r/44.4%
*-rgt-identity44.4%
associate-*r/32.4%
unpow232.4%
Simplified32.4%
unpow232.4%
frac-times30.9%
pow-prod-up78.4%
metadata-eval78.4%
inv-pow78.4%
unpow278.4%
associate-/r*78.5%
associate-/l/78.4%
add-sqr-sqrt78.3%
associate-/l*78.4%
sqrt-div78.4%
metadata-eval78.4%
unpow278.4%
sqrt-prod78.3%
add-sqr-sqrt78.4%
sqrt-div78.4%
metadata-eval78.4%
unpow278.4%
sqrt-prod82.9%
add-sqr-sqrt83.0%
Applied egg-rr83.0%
associate-/l/94.0%
div-inv93.4%
associate-/r/93.6%
/-rgt-identity93.6%
Applied egg-rr93.6%
Final simplification80.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 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(1.0 / Float64(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[(1.0 / N[(y$95$m * N[(z$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}{y_m \cdot \left(z_m \cdot \left(x_m \cdot z_m\right)\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.2%
associate-/r*93.1%
sqr-neg93.1%
+-commutative93.1%
sqr-neg93.1%
fma-def93.1%
Simplified93.1%
Taylor expanded in z around 0 75.9%
*-commutative75.9%
associate-/r*75.9%
Simplified75.9%
if 1 < z Initial program 81.3%
associate-/r*81.4%
sqr-neg81.4%
+-commutative81.4%
sqr-neg81.4%
fma-def81.4%
Simplified81.4%
fma-udef81.4%
+-commutative81.4%
associate-/r*81.3%
add-sqr-sqrt60.4%
sqrt-div16.4%
inv-pow16.4%
sqrt-pow116.4%
metadata-eval16.4%
+-commutative16.4%
fma-udef16.4%
sqrt-prod16.4%
fma-udef16.4%
+-commutative16.4%
hypot-1-def16.4%
sqrt-div16.3%
inv-pow16.3%
sqrt-pow116.3%
metadata-eval16.3%
Applied egg-rr20.8%
unpow220.8%
Simplified20.8%
Taylor expanded in z around inf 79.8%
associate-*r*76.5%
*-commutative76.5%
associate-*r*78.3%
Simplified78.3%
add-sqr-sqrt31.0%
pow231.0%
*-commutative31.0%
sqrt-prod31.0%
unpow231.0%
sqrt-prod32.4%
add-sqr-sqrt32.5%
Applied egg-rr32.5%
unpow232.5%
*-commutative32.5%
*-commutative32.5%
swap-sqr30.9%
add-sqr-sqrt78.3%
associate-*l*83.0%
Applied egg-rr83.0%
Final simplification77.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 1.0) (/ (/ 1.0 y_m) x_m) (/ (/ 1.0 (* z_m (* 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 <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / (z_m * (x_m * z_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 <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = (1.0d0 / (z_m * (x_m * z_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 <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / (z_m * (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 <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = (1.0 / (z_m * (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 (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(1.0 / Float64(z_m * Float64(x_m * 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 <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = (1.0 / (z_m * (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[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * N[(x$95$m * z$95$m), $MachinePrecision]), $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 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z_m \cdot \left(x_m \cdot z_m\right)}}{y_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.2%
associate-/r*93.1%
sqr-neg93.1%
+-commutative93.1%
sqr-neg93.1%
fma-def93.1%
Simplified93.1%
Taylor expanded in z around 0 75.9%
*-commutative75.9%
associate-/r*75.9%
Simplified75.9%
if 1 < z Initial program 81.3%
associate-/l/80.0%
metadata-eval80.0%
associate-/r*80.0%
metadata-eval80.0%
neg-mul-180.0%
distribute-neg-frac80.0%
distribute-frac-neg80.0%
distribute-frac-neg80.0%
distribute-neg-frac80.0%
metadata-eval80.0%
neg-mul-180.0%
associate-/r*80.0%
metadata-eval80.0%
associate-/r*80.0%
sqr-neg80.0%
+-commutative80.0%
sqr-neg80.0%
fma-def80.0%
Simplified80.0%
Taylor expanded in z around inf 78.5%
/-rgt-identity78.5%
associate-/l*78.4%
Applied egg-rr78.4%
associate-/r/78.5%
/-rgt-identity78.5%
unpow278.5%
associate-*r*83.1%
Applied egg-rr83.1%
Final simplification77.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 (if (<= z_m 1.0) (/ (/ 1.0 y_m) x_m) (/ (/ (/ 1.0 z_m) (* 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 <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = ((1.0 / z_m) / (x_m * z_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 <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = ((1.0d0 / z_m) / (x_m * z_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 <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = ((1.0 / z_m) / (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 <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = ((1.0 / z_m) / (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 (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(Float64(1.0 / z_m) / Float64(x_m * 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 <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = ((1.0 / z_m) / (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[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / z$95$m), $MachinePrecision] / N[(x$95$m * z$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 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{z_m}}{x_m \cdot z_m}}{y_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.2%
associate-/r*93.1%
sqr-neg93.1%
+-commutative93.1%
sqr-neg93.1%
fma-def93.1%
Simplified93.1%
Taylor expanded in z around 0 75.9%
*-commutative75.9%
associate-/r*75.9%
Simplified75.9%
if 1 < z Initial program 81.3%
associate-/l/80.0%
metadata-eval80.0%
associate-/r*80.0%
metadata-eval80.0%
neg-mul-180.0%
distribute-neg-frac80.0%
distribute-frac-neg80.0%
distribute-frac-neg80.0%
distribute-neg-frac80.0%
metadata-eval80.0%
neg-mul-180.0%
associate-/r*80.0%
metadata-eval80.0%
associate-/r*80.0%
sqr-neg80.0%
+-commutative80.0%
sqr-neg80.0%
fma-def80.0%
Simplified80.0%
Taylor expanded in z around inf 78.5%
div-inv78.4%
add-sqr-sqrt49.0%
associate-*l*49.0%
associate-/r*49.0%
sqrt-div31.0%
inv-pow31.0%
metadata-eval31.0%
pow-prod-up30.9%
sqrt-unprod30.9%
add-sqr-sqrt30.9%
unpow230.9%
sqrt-prod30.9%
add-sqr-sqrt30.9%
Applied egg-rr44.4%
associate-*r/44.4%
*-rgt-identity44.4%
associate-*r/32.4%
unpow232.4%
Simplified32.4%
unpow232.4%
frac-times30.9%
pow-prod-up78.4%
metadata-eval78.4%
inv-pow78.4%
unpow278.4%
associate-/r*78.5%
associate-/l/78.4%
add-sqr-sqrt78.3%
associate-/l*78.4%
sqrt-div78.4%
metadata-eval78.4%
unpow278.4%
sqrt-prod78.3%
add-sqr-sqrt78.4%
sqrt-div78.4%
metadata-eval78.4%
unpow278.4%
sqrt-prod82.9%
add-sqr-sqrt83.0%
Applied egg-rr83.0%
Taylor expanded in x around 0 83.1%
Final simplification77.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)))))
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 90.4%
associate-/r*90.3%
sqr-neg90.3%
+-commutative90.3%
sqr-neg90.3%
fma-def90.3%
Simplified90.3%
Taylor expanded in z around 0 61.2%
Final simplification61.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 (/ (/ 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(Float64(1.0 / 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[(N[(1.0 / x$95$m), $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{1}{x_m}}{y_m}\right)
\end{array}
Initial program 90.4%
associate-/l/89.4%
metadata-eval89.4%
associate-/r*89.4%
metadata-eval89.4%
neg-mul-189.4%
distribute-neg-frac89.4%
distribute-frac-neg89.4%
distribute-frac-neg89.4%
distribute-neg-frac89.4%
metadata-eval89.4%
neg-mul-189.4%
associate-/r*89.4%
metadata-eval89.4%
associate-/r*89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-def89.3%
Simplified89.3%
Taylor expanded in z around 0 61.3%
Final simplification61.3%
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(Float64(1.0 / 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[(N[(1.0 / y$95$m), $MachinePrecision] / x$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{1}{y_m}}{x_m}\right)
\end{array}
Initial program 90.4%
associate-/r*90.3%
sqr-neg90.3%
+-commutative90.3%
sqr-neg90.3%
fma-def90.3%
Simplified90.3%
Taylor expanded in z around 0 61.2%
*-commutative61.2%
associate-/r*61.3%
Simplified61.3%
Final simplification61.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 2023333
(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)))))