
(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 12 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 z_m) 1e+276)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(/ (/ (/ 1.0 z_m) y_m) (* x_m (hypot 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 tmp;
if ((z_m * z_m) <= 1e+276) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = ((1.0 / z_m) / y_m) / (x_m * hypot(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) tmp = 0.0 if (Float64(z_m * z_m) <= 1e+276) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.0)))); else tmp = Float64(Float64(Float64(1.0 / z_m) / y_m) / Float64(x_m * hypot(1.0, z_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+276], 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[(N[(N[(1.0 / z$95$m), $MachinePrecision] / y$95$m), $MachinePrecision] / N[(x$95$m * N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $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 10^{+276}:\\
\;\;\;\;\frac{1}{y_m \cdot \left(x_m \cdot \mathsf{fma}\left(z_m, z_m, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{z_m}}{y_m}}{x_m \cdot \mathsf{hypot}\left(1, z_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.0000000000000001e276Initial program 97.1%
associate-/r*97.0%
sqr-neg97.0%
+-commutative97.0%
sqr-neg97.0%
fma-def97.0%
Simplified97.0%
associate-/r*97.1%
associate-/l/95.3%
associate-/r*95.0%
add-sqr-sqrt54.2%
*-un-lft-identity54.2%
times-frac54.3%
associate-/r*53.7%
sqrt-div51.8%
inv-pow51.8%
sqrt-pow151.9%
metadata-eval51.9%
fma-udef51.9%
+-commutative51.9%
hypot-1-def51.9%
Applied egg-rr54.4%
/-rgt-identity54.4%
associate-*r/52.0%
Applied egg-rr95.0%
if 1.0000000000000001e276 < (*.f64 z z) Initial program 75.2%
associate-/r*75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-def75.2%
Simplified75.2%
Taylor expanded in x around 0 75.2%
associate-/r*75.2%
*-commutative75.2%
+-commutative75.2%
unpow275.2%
fma-udef75.2%
associate-/l/74.5%
associate-/l/74.5%
associate-/r*74.5%
Simplified74.5%
div-inv74.5%
add-sqr-sqrt74.5%
times-frac75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def99.8%
Applied egg-rr99.8%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 84.1%
associate-/l/84.1%
un-div-inv84.2%
*-commutative84.2%
associate-/r*84.1%
Applied egg-rr84.1%
Final simplification91.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 (/ (pow x_m -0.5) (hypot 1.0 z_m)))) (* y_s (* x_s (* t_0 (/ t_0 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 t_0 = pow(x_m, -0.5) / hypot(1.0, z_m);
return y_s * (x_s * (t_0 * (t_0 / 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) {
double t_0 = Math.pow(x_m, -0.5) / Math.hypot(1.0, z_m);
return y_s * (x_s * (t_0 * (t_0 / 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): t_0 = math.pow(x_m, -0.5) / math.hypot(1.0, z_m) return y_s * (x_s * (t_0 * (t_0 / 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) t_0 = Float64((x_m ^ -0.5) / hypot(1.0, z_m)) return Float64(y_s * Float64(x_s * Float64(t_0 * Float64(t_0 / 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)
t_0 = (x_m ^ -0.5) / hypot(1.0, z_m);
tmp = y_s * (x_s * (t_0 * (t_0 / 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_] := Block[{t$95$0 = N[(N[Power[x$95$m, -0.5], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(t$95$0 * N[(t$95$0 / 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])\\
\\
\begin{array}{l}
t_0 := \frac{{x_m}^{-0.5}}{\mathsf{hypot}\left(1, z_m\right)}\\
y_s \cdot \left(x_s \cdot \left(t_0 \cdot \frac{t_0}{y_m}\right)\right)
\end{array}
\end{array}
Initial program 90.5%
associate-/r*90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-def90.5%
Simplified90.5%
associate-/r*90.5%
associate-/l/89.3%
associate-/r*89.1%
add-sqr-sqrt59.3%
*-un-lft-identity59.3%
times-frac59.4%
associate-/r*59.0%
sqrt-div46.9%
inv-pow46.9%
sqrt-pow146.9%
metadata-eval46.9%
fma-udef46.9%
+-commutative46.9%
hypot-1-def46.9%
Applied egg-rr53.2%
Final simplification53.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 90.5%
associate-/r*90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-def90.5%
Simplified90.5%
fma-udef90.5%
+-commutative90.5%
associate-/r*90.5%
add-sqr-sqrt61.6%
sqrt-div21.1%
inv-pow21.1%
sqrt-pow121.1%
metadata-eval21.1%
+-commutative21.1%
fma-udef21.1%
sqrt-prod21.1%
fma-udef21.1%
+-commutative21.1%
hypot-1-def21.1%
sqrt-div21.1%
inv-pow21.1%
sqrt-pow121.1%
metadata-eval21.1%
Applied egg-rr25.2%
unpow225.2%
Simplified25.2%
Final simplification25.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 (hypot 1.0 z_m)) (* y_m (* x_m (hypot 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) {
return y_s * (x_s * ((1.0 / hypot(1.0, z_m)) / (y_m * (x_m * hypot(1.0, z_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)) / (y_m * (x_m * Math.hypot(1.0, 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 / math.hypot(1.0, z_m)) / (y_m * (x_m * math.hypot(1.0, 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 / hypot(1.0, z_m)) / Float64(y_m * Float64(x_m * hypot(1.0, 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 / hypot(1.0, z_m)) / (y_m * (x_m * hypot(1.0, 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 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(y$95$m * N[(x$95$m * N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $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}{\mathsf{hypot}\left(1, z_m\right)}}{y_m \cdot \left(x_m \cdot \mathsf{hypot}\left(1, z_m\right)\right)}\right)
\end{array}
Initial program 90.5%
associate-/r*90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-def90.5%
Simplified90.5%
Taylor expanded in x around 0 90.5%
associate-/r*90.5%
*-commutative90.5%
+-commutative90.5%
unpow290.5%
fma-udef90.5%
associate-/l/91.4%
associate-/l/91.4%
associate-/r*91.4%
Simplified91.4%
div-inv91.3%
add-sqr-sqrt91.3%
times-frac90.3%
fma-udef90.3%
+-commutative90.3%
hypot-1-def90.3%
fma-udef90.3%
+-commutative90.3%
hypot-1-def97.7%
Applied egg-rr97.7%
associate-/l/97.4%
associate-/r*97.7%
Simplified97.7%
*-commutative97.7%
associate-/l/97.7%
frac-times98.4%
*-un-lft-identity98.4%
Applied egg-rr98.4%
Final simplification98.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
(if (<= (* z_m z_m) 200000.0)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z_m z_m))))
(if (<= (* z_m z_m) 1e+276)
(/ 1.0 (* y_m (* x_m (pow z_m 2.0))))
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* 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 * z_m) <= 200000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
} else if ((z_m * z_m) <= 1e+276) {
tmp = 1.0 / (y_m * (x_m * pow(z_m, 2.0)));
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 * z_m) <= 200000.0d0) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z_m * z_m)))
else if ((z_m * z_m) <= 1d+276) then
tmp = 1.0d0 / (y_m * (x_m * (z_m ** 2.0d0)))
else
tmp = (1.0d0 / (z_m * y_m)) * (1.0d0 / (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 * z_m) <= 200000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
} else if ((z_m * z_m) <= 1e+276) {
tmp = 1.0 / (y_m * (x_m * Math.pow(z_m, 2.0)));
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 * z_m) <= 200000.0: tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m))) elif (z_m * z_m) <= 1e+276: tmp = 1.0 / (y_m * (x_m * math.pow(z_m, 2.0))) else: tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m)) return y_s * (x_s * tmp)
z_m = abs(z) x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 200000.0) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z_m * z_m)))); elseif (Float64(z_m * z_m) <= 1e+276) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * (z_m ^ 2.0)))); else tmp = Float64(Float64(1.0 / Float64(z_m * y_m)) * Float64(1.0 / 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 * z_m) <= 200000.0)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
elseif ((z_m * z_m) <= 1e+276)
tmp = 1.0 / (y_m * (x_m * (z_m ^ 2.0)));
else
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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[N[(z$95$m * z$95$m), $MachinePrecision], 200000.0], 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], If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+276], N[(1.0 / N[(y$95$m * N[(x$95$m * N[Power[z$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \cdot z_m \leq 200000:\\
\;\;\;\;\frac{\frac{1}{x_m}}{y_m \cdot \left(1 + z_m \cdot z_m\right)}\\
\mathbf{elif}\;z_m \cdot z_m \leq 10^{+276}:\\
\;\;\;\;\frac{1}{y_m \cdot \left(x_m \cdot {z_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e5Initial program 99.7%
if 2e5 < (*.f64 z z) < 1.0000000000000001e276Initial program 91.1%
associate-/r*91.1%
sqr-neg91.1%
+-commutative91.1%
sqr-neg91.1%
fma-def91.1%
Simplified91.1%
Taylor expanded in x around 0 91.1%
associate-/r*91.1%
*-commutative91.1%
+-commutative91.1%
unpow291.1%
fma-udef91.1%
associate-/l/96.2%
associate-/l/96.1%
associate-/r*96.2%
Simplified96.2%
div-inv96.0%
add-sqr-sqrt96.0%
times-frac90.6%
fma-udef90.6%
+-commutative90.6%
hypot-1-def90.6%
fma-udef90.6%
+-commutative90.6%
hypot-1-def90.6%
Applied egg-rr90.6%
associate-/l/89.3%
associate-/r*90.5%
Simplified90.5%
Taylor expanded in z around inf 91.1%
associate-*r*96.2%
*-commutative96.2%
associate-*r*84.4%
Simplified84.4%
if 1.0000000000000001e276 < (*.f64 z z) Initial program 75.2%
associate-/r*75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-def75.2%
Simplified75.2%
Taylor expanded in x around 0 75.2%
associate-/r*75.2%
*-commutative75.2%
+-commutative75.2%
unpow275.2%
fma-udef75.2%
associate-/l/74.5%
associate-/l/74.5%
associate-/r*74.5%
Simplified74.5%
div-inv74.5%
add-sqr-sqrt74.5%
times-frac75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def99.8%
Applied egg-rr99.8%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 84.1%
Taylor expanded in z around inf 99.8%
Final simplification96.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
(if (<= (* z_m z_m) 200000.0)
(/ 1.0 (* x_m (* y_m (fma z_m z_m 1.0))))
(if (<= (* z_m z_m) 1e+276)
(/ 1.0 (* y_m (* x_m (pow z_m 2.0))))
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* 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 * z_m) <= 200000.0) {
tmp = 1.0 / (x_m * (y_m * fma(z_m, z_m, 1.0)));
} else if ((z_m * z_m) <= 1e+276) {
tmp = 1.0 / (y_m * (x_m * pow(z_m, 2.0)));
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = abs(z) x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 200000.0) tmp = Float64(1.0 / Float64(x_m * Float64(y_m * fma(z_m, z_m, 1.0)))); elseif (Float64(z_m * z_m) <= 1e+276) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * (z_m ^ 2.0)))); else tmp = Float64(Float64(1.0 / Float64(z_m * y_m)) * Float64(1.0 / Float64(x_m * z_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 200000.0], N[(1.0 / N[(x$95$m * N[(y$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+276], N[(1.0 / N[(y$95$m * N[(x$95$m * N[Power[z$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \cdot z_m \leq 200000:\\
\;\;\;\;\frac{1}{x_m \cdot \left(y_m \cdot \mathsf{fma}\left(z_m, z_m, 1\right)\right)}\\
\mathbf{elif}\;z_m \cdot z_m \leq 10^{+276}:\\
\;\;\;\;\frac{1}{y_m \cdot \left(x_m \cdot {z_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e5Initial program 99.7%
associate-/r*99.7%
sqr-neg99.7%
+-commutative99.7%
sqr-neg99.7%
fma-def99.7%
Simplified99.7%
if 2e5 < (*.f64 z z) < 1.0000000000000001e276Initial program 91.1%
associate-/r*91.1%
sqr-neg91.1%
+-commutative91.1%
sqr-neg91.1%
fma-def91.1%
Simplified91.1%
Taylor expanded in x around 0 91.1%
associate-/r*91.1%
*-commutative91.1%
+-commutative91.1%
unpow291.1%
fma-udef91.1%
associate-/l/96.2%
associate-/l/96.1%
associate-/r*96.2%
Simplified96.2%
div-inv96.0%
add-sqr-sqrt96.0%
times-frac90.6%
fma-udef90.6%
+-commutative90.6%
hypot-1-def90.6%
fma-udef90.6%
+-commutative90.6%
hypot-1-def90.6%
Applied egg-rr90.6%
associate-/l/89.3%
associate-/r*90.5%
Simplified90.5%
Taylor expanded in z around inf 91.1%
associate-*r*96.2%
*-commutative96.2%
associate-*r*84.4%
Simplified84.4%
if 1.0000000000000001e276 < (*.f64 z z) Initial program 75.2%
associate-/r*75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-def75.2%
Simplified75.2%
Taylor expanded in x around 0 75.2%
associate-/r*75.2%
*-commutative75.2%
+-commutative75.2%
unpow275.2%
fma-udef75.2%
associate-/l/74.5%
associate-/l/74.5%
associate-/r*74.5%
Simplified74.5%
div-inv74.5%
add-sqr-sqrt74.5%
times-frac75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def99.8%
Applied egg-rr99.8%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 84.1%
Taylor expanded in z around inf 99.8%
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
(if (<= (* z_m z_m) 1e+276)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* 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 * z_m) <= 1e+276) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = abs(z) x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 1e+276) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.0)))); else tmp = Float64(Float64(1.0 / Float64(z_m * y_m)) * Float64(1.0 / Float64(x_m * z_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+276], 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[(N[(1.0 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \cdot z_m \leq 10^{+276}:\\
\;\;\;\;\frac{1}{y_m \cdot \left(x_m \cdot \mathsf{fma}\left(z_m, z_m, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.0000000000000001e276Initial program 97.1%
associate-/r*97.0%
sqr-neg97.0%
+-commutative97.0%
sqr-neg97.0%
fma-def97.0%
Simplified97.0%
associate-/r*97.1%
associate-/l/95.3%
associate-/r*95.0%
add-sqr-sqrt54.2%
*-un-lft-identity54.2%
times-frac54.3%
associate-/r*53.7%
sqrt-div51.8%
inv-pow51.8%
sqrt-pow151.9%
metadata-eval51.9%
fma-udef51.9%
+-commutative51.9%
hypot-1-def51.9%
Applied egg-rr54.4%
/-rgt-identity54.4%
associate-*r/52.0%
Applied egg-rr95.0%
if 1.0000000000000001e276 < (*.f64 z z) Initial program 75.2%
associate-/r*75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-def75.2%
Simplified75.2%
Taylor expanded in x around 0 75.2%
associate-/r*75.2%
*-commutative75.2%
+-commutative75.2%
unpow275.2%
fma-udef75.2%
associate-/l/74.5%
associate-/l/74.5%
associate-/r*74.5%
Simplified74.5%
div-inv74.5%
add-sqr-sqrt74.5%
times-frac75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def99.8%
Applied egg-rr99.8%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 84.1%
Taylor expanded in z around inf 99.8%
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
(if (<= (* z_m z_m) 200000.0)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z_m z_m))))
(if (<= (* z_m z_m) 1e+276)
(/ (* (/ 1.0 z_m) (/ (/ 1.0 x_m) z_m)) y_m)
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* 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 * z_m) <= 200000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
} else if ((z_m * z_m) <= 1e+276) {
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 * z_m) <= 200000.0d0) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z_m * z_m)))
else if ((z_m * z_m) <= 1d+276) then
tmp = ((1.0d0 / z_m) * ((1.0d0 / x_m) / z_m)) / y_m
else
tmp = (1.0d0 / (z_m * y_m)) * (1.0d0 / (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 * z_m) <= 200000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
} else if ((z_m * z_m) <= 1e+276) {
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 * z_m) <= 200000.0: tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m))) elif (z_m * z_m) <= 1e+276: tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m else: tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m)) return y_s * (x_s * tmp)
z_m = abs(z) x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 200000.0) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z_m * z_m)))); elseif (Float64(z_m * z_m) <= 1e+276) tmp = Float64(Float64(Float64(1.0 / z_m) * Float64(Float64(1.0 / x_m) / z_m)) / y_m); else tmp = Float64(Float64(1.0 / Float64(z_m * y_m)) * Float64(1.0 / 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 * z_m) <= 200000.0)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)));
elseif ((z_m * z_m) <= 1e+276)
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
else
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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[N[(z$95$m * z$95$m), $MachinePrecision], 200000.0], 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], If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+276], N[(N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \cdot z_m \leq 200000:\\
\;\;\;\;\frac{\frac{1}{x_m}}{y_m \cdot \left(1 + z_m \cdot z_m\right)}\\
\mathbf{elif}\;z_m \cdot z_m \leq 10^{+276}:\\
\;\;\;\;\frac{\frac{1}{z_m} \cdot \frac{\frac{1}{x_m}}{z_m}}{y_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e5Initial program 99.7%
if 2e5 < (*.f64 z z) < 1.0000000000000001e276Initial program 91.1%
associate-/l/85.4%
metadata-eval85.4%
associate-/r*85.4%
metadata-eval85.4%
neg-mul-185.4%
distribute-neg-frac85.4%
distribute-frac-neg85.4%
distribute-frac-neg85.4%
distribute-neg-frac85.4%
metadata-eval85.4%
neg-mul-185.4%
associate-/r*85.4%
metadata-eval85.4%
associate-/r*84.5%
sqr-neg84.5%
+-commutative84.5%
sqr-neg84.5%
fma-def84.5%
Simplified84.5%
Taylor expanded in z around inf 84.5%
associate-/r*85.4%
*-un-lft-identity85.4%
unpow285.4%
times-frac85.4%
Applied egg-rr85.4%
if 1.0000000000000001e276 < (*.f64 z z) Initial program 75.2%
associate-/r*75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-def75.2%
Simplified75.2%
Taylor expanded in x around 0 75.2%
associate-/r*75.2%
*-commutative75.2%
+-commutative75.2%
unpow275.2%
fma-udef75.2%
associate-/l/74.5%
associate-/l/74.5%
associate-/r*74.5%
Simplified74.5%
div-inv74.5%
add-sqr-sqrt74.5%
times-frac75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def75.2%
fma-udef75.2%
+-commutative75.2%
hypot-1-def99.8%
Applied egg-rr99.8%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 84.1%
Taylor expanded in z around inf 99.8%
Final simplification96.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)
(if (<= z_m 1.95e+139)
(/ (* (/ 1.0 z_m) (/ (/ 1.0 x_m) z_m)) y_m)
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* 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 if (z_m <= 1.95e+139) {
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 if (z_m <= 1.95d+139) then
tmp = ((1.0d0 / z_m) * ((1.0d0 / x_m) / z_m)) / y_m
else
tmp = (1.0d0 / (z_m * y_m)) * (1.0d0 / (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 if (z_m <= 1.95e+139) {
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 elif z_m <= 1.95e+139: tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m else: tmp = (1.0 / (z_m * y_m)) * (1.0 / (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); elseif (z_m <= 1.95e+139) tmp = Float64(Float64(Float64(1.0 / z_m) * Float64(Float64(1.0 / x_m) / z_m)) / y_m); else tmp = Float64(Float64(1.0 / Float64(z_m * y_m)) * Float64(1.0 / 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;
elseif (z_m <= 1.95e+139)
tmp = ((1.0 / z_m) * ((1.0 / x_m) / z_m)) / y_m;
else
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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], If[LessEqual[z$95$m, 1.95e+139], N[(N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{elif}\;z_m \leq 1.95 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{1}{z_m} \cdot \frac{\frac{1}{x_m}}{z_m}}{y_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 92.9%
associate-/r*92.9%
sqr-neg92.9%
+-commutative92.9%
sqr-neg92.9%
fma-def92.9%
Simplified92.9%
Taylor expanded in z around 0 70.3%
*-commutative70.3%
associate-/r*70.3%
Simplified70.3%
if 1 < z < 1.95000000000000003e139Initial program 87.8%
associate-/l/86.9%
metadata-eval86.9%
associate-/r*86.9%
metadata-eval86.9%
neg-mul-186.9%
distribute-neg-frac86.9%
distribute-frac-neg86.9%
distribute-frac-neg86.9%
distribute-neg-frac86.9%
metadata-eval86.9%
neg-mul-186.9%
associate-/r*86.9%
metadata-eval86.9%
associate-/r*85.4%
sqr-neg85.4%
+-commutative85.4%
sqr-neg85.4%
fma-def85.4%
Simplified85.4%
Taylor expanded in z around inf 81.2%
associate-/r*82.8%
*-un-lft-identity82.8%
unpow282.8%
times-frac82.8%
Applied egg-rr82.8%
if 1.95000000000000003e139 < z Initial program 80.1%
associate-/r*80.1%
sqr-neg80.1%
+-commutative80.1%
sqr-neg80.1%
fma-def80.1%
Simplified80.1%
Taylor expanded in x around 0 80.1%
associate-/r*80.1%
*-commutative80.1%
+-commutative80.1%
unpow280.1%
fma-udef80.1%
associate-/l/79.4%
associate-/l/79.4%
associate-/r*79.4%
Simplified79.4%
div-inv79.4%
add-sqr-sqrt79.4%
times-frac80.1%
fma-udef80.1%
+-commutative80.1%
hypot-1-def80.1%
fma-udef80.1%
+-commutative80.1%
hypot-1-def99.7%
Applied egg-rr99.7%
associate-/l/99.8%
associate-/r*99.8%
Simplified99.8%
Taylor expanded in z around inf 99.8%
Taylor expanded in z around inf 99.8%
Final simplification76.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
(if (<= z_m 1.0)
(/ (/ 1.0 y_m) x_m)
(* (/ 1.0 (* z_m y_m)) (/ 1.0 (* x_m z_m)))))))z_m = fabs(z);
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = abs(z)
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8) :: tmp
if (z_m <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = (1.0d0 / (z_m * y_m)) * (1.0d0 / (x_m * z_m))
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(z);
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / (z_m * y_m)) * (1.0 / (x_m * z_m));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(z) x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if z_m <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 / Float64(z_m * y_m)) * Float64(1.0 / Float64(x_m * z_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if (z_m <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = (1.0 / (z_m * y_m)) * (1.0 / (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 / N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z_m \cdot y_m} \cdot \frac{1}{x_m \cdot z_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 92.9%
associate-/r*92.9%
sqr-neg92.9%
+-commutative92.9%
sqr-neg92.9%
fma-def92.9%
Simplified92.9%
Taylor expanded in z around 0 70.3%
*-commutative70.3%
associate-/r*70.3%
Simplified70.3%
if 1 < z Initial program 83.7%
associate-/r*83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-def83.7%
Simplified83.7%
Taylor expanded in x around 0 83.7%
associate-/r*83.7%
*-commutative83.7%
+-commutative83.7%
unpow283.7%
fma-udef83.7%
associate-/l/88.9%
associate-/l/88.8%
associate-/r*88.9%
Simplified88.9%
div-inv88.8%
add-sqr-sqrt88.8%
times-frac86.1%
fma-udef86.1%
+-commutative86.1%
hypot-1-def86.1%
fma-udef86.1%
+-commutative86.1%
hypot-1-def96.5%
Applied egg-rr96.5%
associate-/l/95.5%
associate-/r*96.5%
Simplified96.5%
Taylor expanded in z around inf 93.6%
Taylor expanded in z around inf 93.5%
Final simplification76.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 (if (<= z_m 1.0) (/ (/ 1.0 y_m) x_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 <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 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.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 / (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 / (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 / (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(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 <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = 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[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(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 \leq 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x_m \cdot \left(z_m \cdot y_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 92.9%
associate-/r*92.9%
sqr-neg92.9%
+-commutative92.9%
sqr-neg92.9%
fma-def92.9%
Simplified92.9%
Taylor expanded in z around 0 70.3%
*-commutative70.3%
associate-/r*70.3%
Simplified70.3%
if 1 < z Initial program 83.7%
associate-/r*83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-def83.7%
Simplified83.7%
Taylor expanded in x around 0 83.7%
associate-/r*83.7%
*-commutative83.7%
+-commutative83.7%
unpow283.7%
fma-udef83.7%
associate-/l/88.9%
associate-/l/88.8%
associate-/r*88.9%
Simplified88.9%
div-inv88.8%
add-sqr-sqrt88.8%
times-frac86.1%
fma-udef86.1%
+-commutative86.1%
hypot-1-def86.1%
fma-udef86.1%
+-commutative86.1%
hypot-1-def96.5%
Applied egg-rr96.5%
associate-/l/95.5%
associate-/r*96.5%
Simplified96.5%
Taylor expanded in z around inf 93.6%
Taylor expanded in z around 0 47.8%
Final simplification64.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 (* 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.5%
associate-/r*90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-def90.5%
Simplified90.5%
Taylor expanded in z around 0 57.5%
Final simplification57.5%
(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 2023334
(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)))))