
(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 10 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) 2e+169)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(/ (/ (/ 1.0 y_m) z_m) (* (hypot 1.0 z_m) x_m))))))z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 2e+169) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = ((1.0 / y_m) / z_m) / (hypot(1.0, z_m) * x_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 2e+169) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.0)))); else tmp = Float64(Float64(Float64(1.0 / y_m) / z_m) / Float64(hypot(1.0, z_m) * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 2e+169], 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 / y$95$m), $MachinePrecision] / z$95$m), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \cdot z\_m \leq 2 \cdot 10^{+169}:\\
\;\;\;\;\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}{y\_m}}{z\_m}}{\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999987e169Initial program 96.8%
associate-/l/96.5%
associate-*l*98.1%
*-commutative98.1%
sqr-neg98.1%
+-commutative98.1%
sqr-neg98.1%
fma-define98.1%
Simplified98.1%
if 1.99999999999999987e169 < (*.f64 z z) Initial program 80.9%
associate-/l/81.0%
associate-*l*82.1%
*-commutative82.1%
sqr-neg82.1%
+-commutative82.1%
sqr-neg82.1%
fma-define82.1%
Simplified82.1%
associate-*r*80.7%
*-commutative80.7%
associate-/r*79.6%
*-commutative79.6%
associate-/l/79.6%
fma-undefine79.6%
+-commutative79.6%
associate-/r*80.9%
*-un-lft-identity80.9%
add-sqr-sqrt41.8%
times-frac41.8%
+-commutative41.8%
fma-undefine41.8%
*-commutative41.8%
sqrt-prod41.9%
fma-undefine41.9%
+-commutative41.9%
hypot-1-def41.9%
+-commutative41.9%
Applied egg-rr54.0%
associate-/l/53.9%
associate-*r/53.9%
*-rgt-identity53.9%
*-commutative53.9%
associate-/r*53.9%
*-commutative53.9%
Simplified53.9%
div-inv53.9%
div-inv53.9%
associate-*l*53.9%
pow1/253.9%
pow-flip54.0%
metadata-eval54.0%
associate-/l/54.0%
associate-/l/54.0%
associate-/l/54.0%
pow1/254.0%
pow-flip53.9%
metadata-eval53.9%
Applied egg-rr53.9%
associate-*r/54.0%
associate-*l/54.0%
*-lft-identity54.0%
associate-*r/53.9%
associate-*r/54.0%
pow-sqr99.8%
metadata-eval99.8%
Simplified99.8%
Taylor expanded in z around inf 84.0%
associate-/r*83.9%
Simplified83.9%
Final simplification93.4%
z_m = (fabs.f64 z)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 1 x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(/
(/ (/ 1.0 (sqrt y_m)) (hypot 1.0 z_m))
(* x_m (* (sqrt y_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 / sqrt(y_m)) / hypot(1.0, z_m)) / (x_m * (sqrt(y_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.sqrt(y_m)) / Math.hypot(1.0, z_m)) / (x_m * (Math.sqrt(y_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.sqrt(y_m)) / math.hypot(1.0, z_m)) / (x_m * (math.sqrt(y_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(Float64(1.0 / sqrt(y_m)) / hypot(1.0, z_m)) / Float64(x_m * Float64(sqrt(y_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 / sqrt(y_m)) / hypot(1.0, z_m)) / (x_m * (sqrt(y_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[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(N[Sqrt[y$95$m], $MachinePrecision] * 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{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\_m\right)}}{x\_m \cdot \left(\sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\_m\right)\right)}\right)
\end{array}
Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
associate-*r*92.3%
*-commutative92.3%
associate-/r*92.0%
*-commutative92.0%
associate-/l/92.3%
fma-undefine92.3%
+-commutative92.3%
associate-/r*91.6%
*-un-lft-identity91.6%
add-sqr-sqrt48.0%
times-frac48.0%
+-commutative48.0%
fma-undefine48.0%
*-commutative48.0%
sqrt-prod48.0%
fma-undefine48.0%
+-commutative48.0%
hypot-1-def48.0%
+-commutative48.0%
Applied egg-rr52.8%
associate-/l/52.8%
associate-*r/52.8%
*-rgt-identity52.8%
*-commutative52.8%
associate-/r*52.8%
*-commutative52.8%
Simplified52.8%
Final simplification52.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 (/ (/ (pow y_m -1.0) (hypot 1.0 z_m)) (* (hypot 1.0 z_m) x_m)))))
z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((pow(y_m, -1.0) / hypot(1.0, z_m)) / (hypot(1.0, z_m) * x_m)));
}
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((Math.pow(y_m, -1.0) / Math.hypot(1.0, z_m)) / (Math.hypot(1.0, z_m) * x_m)));
}
z_m = math.fabs(z) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * ((math.pow(y_m, -1.0) / math.hypot(1.0, z_m)) / (math.hypot(1.0, z_m) * x_m)))
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64((y_m ^ -1.0) / hypot(1.0, z_m)) / Float64(hypot(1.0, z_m) * x_m)))) end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (((y_m ^ -1.0) / hypot(1.0, z_m)) / (hypot(1.0, z_m) * x_m)));
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $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{{y\_m}^{-1}}{\mathsf{hypot}\left(1, z\_m\right)}}{\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m}\right)
\end{array}
Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
associate-*r*92.3%
*-commutative92.3%
associate-/r*92.0%
*-commutative92.0%
associate-/l/92.3%
fma-undefine92.3%
+-commutative92.3%
associate-/r*91.6%
*-un-lft-identity91.6%
add-sqr-sqrt48.0%
times-frac48.0%
+-commutative48.0%
fma-undefine48.0%
*-commutative48.0%
sqrt-prod48.0%
fma-undefine48.0%
+-commutative48.0%
hypot-1-def48.0%
+-commutative48.0%
Applied egg-rr52.8%
associate-/l/52.8%
associate-*r/52.8%
*-rgt-identity52.8%
*-commutative52.8%
associate-/r*52.8%
*-commutative52.8%
Simplified52.8%
div-inv52.8%
div-inv52.8%
associate-*l*52.4%
pow1/252.4%
pow-flip52.5%
metadata-eval52.5%
associate-/l/52.5%
associate-/l/52.5%
associate-/l/52.2%
pow1/252.2%
pow-flip52.1%
metadata-eval52.1%
Applied egg-rr52.1%
associate-*r/52.1%
associate-*l/52.1%
*-lft-identity52.1%
associate-*r/52.1%
associate-*r/52.1%
pow-sqr98.4%
metadata-eval98.4%
Simplified98.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 (let* ((t_0 (/ 1.0 (hypot 1.0 z_m)))) (* y_s (* x_s (* (/ t_0 y_m) (/ t_0 x_m))))))
z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = 1.0 / hypot(1.0, z_m);
return y_s * (x_s * ((t_0 / y_m) * (t_0 / x_m)));
}
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = 1.0 / Math.hypot(1.0, z_m);
return y_s * (x_s * ((t_0 / y_m) * (t_0 / 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): t_0 = 1.0 / math.hypot(1.0, z_m) return y_s * (x_s * ((t_0 / y_m) * (t_0 / 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) t_0 = Float64(1.0 / hypot(1.0, z_m)) return Float64(y_s * Float64(x_s * Float64(Float64(t_0 / y_m) * Float64(t_0 / 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)
t_0 = 1.0 / hypot(1.0, z_m);
tmp = y_s * (x_s * ((t_0 / y_m) * (t_0 / 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_] := Block[{t$95$0 = N[(1.0 / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(t$95$0 / y$95$m), $MachinePrecision] * N[(t$95$0 / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{\mathsf{hypot}\left(1, z\_m\right)}\\
y\_s \cdot \left(x\_s \cdot \left(\frac{t\_0}{y\_m} \cdot \frac{t\_0}{x\_m}\right)\right)
\end{array}
\end{array}
Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
clear-num92.8%
associate-*r*92.3%
*-commutative92.3%
*-commutative92.3%
associate-/r/92.3%
associate-/r*92.3%
Applied egg-rr92.3%
add-sqr-sqrt92.3%
*-commutative92.3%
times-frac93.0%
clear-num93.0%
sqrt-div93.0%
metadata-eval93.0%
/-rgt-identity93.0%
fma-undefine93.0%
unpow293.0%
+-commutative93.0%
metadata-eval93.0%
unpow293.0%
hypot-undefine93.0%
Applied egg-rr98.5%
Final simplification98.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) 2e+307)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(* (/ (/ 1.0 z_m) y_m) (/ (/ 1.0 z_m) x_m))))))z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 2e+307) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = ((1.0 / z_m) / y_m) * ((1.0 / z_m) / x_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 2e+307) 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(Float64(1.0 / z_m) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 2e+307], 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[(N[(1.0 / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \cdot z\_m \leq 2 \cdot 10^{+307}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z\_m}}{y\_m} \cdot \frac{\frac{1}{z\_m}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999997e307Initial program 96.2%
associate-/l/95.8%
associate-*l*97.8%
*-commutative97.8%
sqr-neg97.8%
+-commutative97.8%
sqr-neg97.8%
fma-define97.8%
Simplified97.8%
if 1.99999999999999997e307 < (*.f64 z z) Initial program 77.4%
associate-/l/77.4%
associate-*l*77.4%
*-commutative77.4%
sqr-neg77.4%
+-commutative77.4%
sqr-neg77.4%
fma-define77.4%
Simplified77.4%
clear-num77.4%
associate-*r*77.1%
*-commutative77.1%
*-commutative77.1%
associate-/r/77.1%
associate-/r*77.1%
Applied egg-rr77.1%
Taylor expanded in z around inf 77.1%
add-sqr-sqrt77.1%
*-commutative77.1%
times-frac77.4%
sqrt-div77.4%
metadata-eval77.4%
sqrt-pow177.4%
metadata-eval77.4%
pow177.4%
sqrt-div77.4%
metadata-eval77.4%
sqrt-pow199.8%
metadata-eval99.8%
pow199.8%
Applied egg-rr99.8%
Final simplification98.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
(let* ((t_0 (* y_m (+ 1.0 (* z_m z_m)))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(* (/ 1.0 z_m) (/ (/ 1.0 z_m) (* 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) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z_m) * ((1.0 / z_m) / (y_m * x_m));
}
return y_s * (x_s * tmp);
}
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z_m) * ((1.0 / z_m) / (y_m * x_m));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(z) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): t_0 = y_m * (1.0 + (z_m * z_m)) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = (1.0 / z_m) * ((1.0 / z_m) / (y_m * x_m)) return y_s * (x_s * tmp)
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) t_0 = Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(1.0 / z_m) * Float64(Float64(1.0 / z_m) / Float64(y_m * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
t_0 = y_m * (1.0 + (z_m * z_m));
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = (1.0 / z_m) * ((1.0 / z_m) / (y_m * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(N[(1.0 / z$95$m), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z\_m} \cdot \frac{\frac{1}{z\_m}}{y\_m \cdot x\_m}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < +inf.0Initial program 91.6%
if +inf.0 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
clear-num92.8%
associate-*r*92.3%
*-commutative92.3%
*-commutative92.3%
associate-/r/92.3%
associate-/r*92.3%
Applied egg-rr92.3%
Taylor expanded in z around inf 50.2%
add-sqr-sqrt50.2%
associate-/l*50.2%
sqrt-div50.2%
metadata-eval50.2%
sqrt-pow139.5%
metadata-eval39.5%
pow139.5%
sqrt-div39.5%
metadata-eval39.5%
sqrt-pow156.7%
metadata-eval56.7%
pow156.7%
Applied egg-rr56.7%
Final simplification91.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
(let* ((t_0 (* y_m (+ 1.0 (* z_m z_m)))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(* (/ (/ 1.0 z_m) y_m) (/ (/ 1.0 z_m) x_m)))))))z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / z_m) / y_m) * ((1.0 / z_m) / x_m);
}
return y_s * (x_s * tmp);
}
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / z_m) / y_m) * ((1.0 / z_m) / x_m);
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(z) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): t_0 = y_m * (1.0 + (z_m * z_m)) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = ((1.0 / z_m) / y_m) * ((1.0 / z_m) / x_m) return y_s * (x_s * tmp)
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) t_0 = Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(Float64(1.0 / z_m) / y_m) * Float64(Float64(1.0 / z_m) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
t_0 = y_m * (1.0 + (z_m * z_m));
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = ((1.0 / z_m) / y_m) * ((1.0 / z_m) / x_m);
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 / z$95$m), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z\_m}}{y\_m} \cdot \frac{\frac{1}{z\_m}}{x\_m}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < +inf.0Initial program 91.6%
if +inf.0 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
clear-num92.8%
associate-*r*92.3%
*-commutative92.3%
*-commutative92.3%
associate-/r/92.3%
associate-/r*92.3%
Applied egg-rr92.3%
Taylor expanded in z around inf 50.2%
add-sqr-sqrt50.2%
*-commutative50.2%
times-frac49.6%
sqrt-div49.6%
metadata-eval49.6%
sqrt-pow139.0%
metadata-eval39.0%
pow139.0%
sqrt-div39.0%
metadata-eval39.0%
sqrt-pow155.1%
metadata-eval55.1%
pow155.1%
Applied egg-rr55.1%
Final simplification91.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 (* x_m (* y_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 / (x_m * (y_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 / (x_m * (y_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 / (x_m * (y_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 / (x_m * (y_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(x_m * Float64(y_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 / (x_m * (y_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[(x$95$m * N[(y$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}{x\_m \cdot \left(y\_m \cdot z\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.6%
associate-/l/93.3%
associate-*l*93.8%
*-commutative93.8%
sqr-neg93.8%
+-commutative93.8%
sqr-neg93.8%
fma-define93.8%
Simplified93.8%
associate-*r*93.7%
*-commutative93.7%
associate-/r*93.7%
*-commutative93.7%
associate-/l/94.1%
fma-undefine94.1%
+-commutative94.1%
associate-/r*93.6%
*-un-lft-identity93.6%
add-sqr-sqrt50.9%
times-frac50.9%
+-commutative50.9%
fma-undefine50.9%
*-commutative50.9%
sqrt-prod50.9%
fma-undefine50.9%
+-commutative50.9%
hypot-1-def50.9%
+-commutative50.9%
Applied egg-rr54.4%
associate-/l/54.5%
associate-*r/54.4%
*-rgt-identity54.4%
*-commutative54.4%
associate-/r*54.4%
*-commutative54.4%
Simplified54.4%
div-inv54.4%
div-inv54.5%
associate-*l*54.0%
pow1/254.0%
pow-flip54.0%
metadata-eval54.0%
associate-/l/54.0%
associate-/l/54.0%
associate-/l/53.5%
pow1/253.5%
pow-flip53.5%
metadata-eval53.5%
Applied egg-rr53.5%
associate-*r/53.5%
associate-*l/53.5%
*-lft-identity53.5%
associate-*r/53.5%
associate-*r/53.5%
pow-sqr98.2%
metadata-eval98.2%
Simplified98.2%
Taylor expanded in z around 0 74.5%
associate-/l/74.9%
Simplified74.9%
if 1 < z Initial program 85.8%
associate-/l/85.9%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*88.6%
*-commutative88.6%
associate-/r*87.2%
*-commutative87.2%
associate-/l/87.3%
fma-undefine87.3%
+-commutative87.3%
associate-/r*85.8%
*-un-lft-identity85.8%
add-sqr-sqrt40.0%
times-frac40.0%
+-commutative40.0%
fma-undefine40.0%
*-commutative40.0%
sqrt-prod40.1%
fma-undefine40.1%
+-commutative40.1%
hypot-1-def40.1%
+-commutative40.1%
Applied egg-rr48.2%
associate-/l/48.2%
associate-*r/48.2%
*-rgt-identity48.2%
*-commutative48.2%
associate-/r*48.3%
*-commutative48.3%
Simplified48.3%
div-inv48.3%
div-inv48.2%
associate-*l*48.1%
pow1/248.1%
pow-flip48.2%
metadata-eval48.2%
associate-/l/48.3%
associate-/l/48.3%
associate-/l/48.3%
pow1/248.3%
pow-flip48.2%
metadata-eval48.2%
Applied egg-rr48.2%
associate-*r/48.2%
associate-*l/48.2%
*-lft-identity48.2%
associate-*r/48.3%
associate-*r/48.3%
pow-sqr99.2%
metadata-eval99.2%
Simplified99.2%
Taylor expanded in z around 0 47.7%
Taylor expanded in z around inf 46.6%
Final simplification67.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 (+ 1.0 (* z_m z_m)))))))
z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)))));
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
code = y_s * (x_s * ((1.0d0 / x_m) / (y_m * (1.0d0 + (z_m * z_m)))))
end function
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)))));
}
z_m = math.fabs(z) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)))))
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z_m * z_m)))))) end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z_m * z_m)))));
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z\_m \cdot z\_m\right)}\right)
\end{array}
Initial program 91.6%
Final simplification91.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 (/ 1.0 (* y_m x_m)))))
z_m = fabs(z);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
code = y_s * (x_s * (1.0d0 / (y_m * x_m)))
end function
z_m = Math.abs(z);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
z_m = math.fabs(z) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * (1.0 / (y_m * x_m)))
z_m = abs(z) x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * x_m)))) end
z_m = abs(z);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (1.0 / (y_m * x_m)));
end
z_m = N[Abs[z], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{y\_m \cdot x\_m}\right)
\end{array}
Initial program 91.6%
associate-/l/91.3%
associate-*l*92.8%
*-commutative92.8%
sqr-neg92.8%
+-commutative92.8%
sqr-neg92.8%
fma-define92.8%
Simplified92.8%
Taylor expanded in z around 0 61.6%
Final simplification61.6%
(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 2024096
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))