
(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 13 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}
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 5e+300)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(pow (/ (pow x_m -0.5) (* z (sqrt y_m))) 2.0)))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+300) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = pow((pow(x_m, -0.5) / (z * sqrt(y_m))), 2.0);
}
return y_s * (x_s * tmp);
}
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 5e+300) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64((x_m ^ -0.5) / Float64(z * sqrt(y_m))) ^ 2.0; end return Float64(y_s * Float64(x_s * tmp)) end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+300], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[Power[x$95$m, -0.5], $MachinePrecision] / N[(z * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+300}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{{x\_m}^{-0.5}}{z \cdot \sqrt{y\_m}}\right)}^{2}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.00000000000000026e300Initial program 96.0%
associate-/l/95.8%
remove-double-neg95.8%
distribute-rgt-neg-out95.8%
distribute-rgt-neg-out95.8%
remove-double-neg95.8%
associate-*l*95.8%
*-commutative95.8%
sqr-neg95.8%
+-commutative95.8%
sqr-neg95.8%
fma-define95.8%
Simplified95.8%
*-commutative95.8%
associate-*r*95.8%
fma-undefine95.8%
+-commutative95.8%
associate-/l/96.0%
add-sqr-sqrt53.8%
add-sqr-sqrt29.3%
times-frac29.3%
Applied egg-rr29.8%
unpow229.8%
Simplified29.8%
div-inv29.8%
unpow-prod-down29.2%
pow229.2%
pow-prod-up55.1%
metadata-eval55.1%
inv-pow55.1%
metadata-eval55.1%
*-commutative55.1%
hypot-1-def55.1%
sqrt-prod55.1%
+-commutative55.1%
fma-undefine55.1%
sqrt-div57.7%
pow257.7%
add-sqr-sqrt95.9%
associate-/r*96.0%
fma-undefine96.0%
+-commutative96.0%
frac-times96.1%
Applied egg-rr96.1%
if 5.00000000000000026e300 < (*.f64 z z) Initial program 71.7%
associate-/l/71.7%
remove-double-neg71.7%
distribute-rgt-neg-out71.7%
distribute-rgt-neg-out71.7%
remove-double-neg71.7%
associate-*l*71.7%
*-commutative71.7%
sqr-neg71.7%
+-commutative71.7%
sqr-neg71.7%
fma-define71.7%
Simplified71.7%
*-commutative71.7%
associate-*r*71.7%
fma-undefine71.7%
+-commutative71.7%
associate-/l/71.7%
add-sqr-sqrt33.9%
add-sqr-sqrt14.8%
times-frac14.8%
Applied egg-rr21.4%
unpow221.4%
Simplified21.4%
Taylor expanded in z around inf 21.4%
Final simplification75.7%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (pow (/ (pow x_m -0.5) (* (hypot 1.0 z) (sqrt y_m))) 2.0))))
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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * pow((pow(x_m, -0.5) / (hypot(1.0, z) * sqrt(y_m))), 2.0));
}
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * Math.pow((Math.pow(x_m, -0.5) / (Math.hypot(1.0, z) * Math.sqrt(y_m))), 2.0));
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * math.pow((math.pow(x_m, -0.5) / (math.hypot(1.0, z) * math.sqrt(y_m))), 2.0))
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * (Float64((x_m ^ -0.5) / Float64(hypot(1.0, z) * sqrt(y_m))) ^ 2.0))) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (((x_m ^ -0.5) / (hypot(1.0, z) * sqrt(y_m))) ^ 2.0));
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := 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 ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot {\left(\frac{{x\_m}^{-0.5}}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}}\right)}^{2}\right)
\end{array}
Initial program 89.4%
associate-/l/89.2%
remove-double-neg89.2%
distribute-rgt-neg-out89.2%
distribute-rgt-neg-out89.2%
remove-double-neg89.2%
associate-*l*89.2%
*-commutative89.2%
sqr-neg89.2%
+-commutative89.2%
sqr-neg89.2%
fma-define89.2%
Simplified89.2%
*-commutative89.2%
associate-*r*89.2%
fma-undefine89.2%
+-commutative89.2%
associate-/l/89.4%
add-sqr-sqrt48.4%
add-sqr-sqrt25.3%
times-frac25.3%
Applied egg-rr27.5%
unpow227.5%
Simplified27.5%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* z (sqrt x_m))))
(*
y_s
(*
x_s
(if (<= (* z z) 5e+300)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(/ (/ (/ 1.0 y_m) t_0) t_0))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = z * sqrt(x_m);
double tmp;
if ((z * z) <= 5e+300) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = ((1.0 / y_m) / t_0) / t_0;
}
return y_s * (x_s * tmp);
}
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(z * sqrt(x_m)) tmp = 0.0 if (Float64(z * z) <= 5e+300) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(Float64(1.0 / y_m) / t_0) / t_0); end return Float64(y_s * Float64(x_s * tmp)) end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(z * N[Sqrt[x$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+300], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := z \cdot \sqrt{x\_m}\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+300}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y\_m}}{t\_0}}{t\_0}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 z z) < 5.00000000000000026e300Initial program 96.0%
associate-/l/95.8%
remove-double-neg95.8%
distribute-rgt-neg-out95.8%
distribute-rgt-neg-out95.8%
remove-double-neg95.8%
associate-*l*95.8%
*-commutative95.8%
sqr-neg95.8%
+-commutative95.8%
sqr-neg95.8%
fma-define95.8%
Simplified95.8%
*-commutative95.8%
associate-*r*95.8%
fma-undefine95.8%
+-commutative95.8%
associate-/l/96.0%
add-sqr-sqrt53.8%
add-sqr-sqrt29.3%
times-frac29.3%
Applied egg-rr29.8%
unpow229.8%
Simplified29.8%
div-inv29.8%
unpow-prod-down29.2%
pow229.2%
pow-prod-up55.1%
metadata-eval55.1%
inv-pow55.1%
metadata-eval55.1%
*-commutative55.1%
hypot-1-def55.1%
sqrt-prod55.1%
+-commutative55.1%
fma-undefine55.1%
sqrt-div57.7%
pow257.7%
add-sqr-sqrt95.9%
associate-/r*96.0%
fma-undefine96.0%
+-commutative96.0%
frac-times96.1%
Applied egg-rr96.1%
if 5.00000000000000026e300 < (*.f64 z z) Initial program 71.7%
associate-/l/71.7%
remove-double-neg71.7%
distribute-rgt-neg-out71.7%
distribute-rgt-neg-out71.7%
remove-double-neg71.7%
associate-*l*71.7%
*-commutative71.7%
sqr-neg71.7%
+-commutative71.7%
sqr-neg71.7%
fma-define71.7%
Simplified71.7%
*-commutative71.7%
associate-*r*71.7%
fma-undefine71.7%
+-commutative71.7%
associate-/l/71.7%
add-sqr-sqrt33.9%
add-sqr-sqrt14.8%
times-frac14.8%
Applied egg-rr21.4%
unpow221.4%
Simplified21.4%
Taylor expanded in z around inf 38.6%
associate-*r/38.6%
*-rgt-identity38.6%
associate-/r*38.6%
Simplified38.6%
unpow238.6%
frac-times29.2%
add-sqr-sqrt71.1%
associate-/l/71.1%
unpow271.1%
associate-/r*71.2%
associate-*r*71.7%
associate-/r*71.7%
add-sqr-sqrt33.9%
associate-/r*33.9%
*-commutative33.9%
sqrt-prod33.9%
sqrt-pow133.9%
metadata-eval33.9%
pow133.9%
*-commutative33.9%
sqrt-prod33.9%
sqrt-pow149.9%
metadata-eval49.9%
pow149.9%
Applied egg-rr49.9%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1e+14)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(if (<= (* z z) 1e+290)
(/ (/ 1.0 y_m) (* x_m (pow z 2.0)))
(* (/ (/ 1.0 z) y_m) (/ (/ 1.0 z) x_m)))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+14) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else if ((z * z) <= 1e+290) {
tmp = (1.0 / y_m) / (x_m * pow(z, 2.0));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
real(8) :: tmp
if ((z * z) <= 1d+14) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else if ((z * z) <= 1d+290) then
tmp = (1.0d0 / y_m) / (x_m * (z ** 2.0d0))
else
tmp = ((1.0d0 / z) / y_m) * ((1.0d0 / z) / x_m)
end if
code = y_s * (x_s * tmp)
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+14) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else if ((z * z) <= 1e+290) {
tmp = (1.0 / y_m) / (x_m * Math.pow(z, 2.0));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1e+14: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) elif (z * z) <= 1e+290: tmp = (1.0 / y_m) / (x_m * math.pow(z, 2.0)) else: tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m) return y_s * (x_s * tmp)
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+14) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); elseif (Float64(z * z) <= 1e+290) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * (z ^ 2.0))); else tmp = Float64(Float64(Float64(1.0 / z) / y_m) * Float64(Float64(1.0 / z) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1e+14)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
elseif ((z * z) <= 1e+290)
tmp = (1.0 / y_m) / (x_m * (z ^ 2.0));
else
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
end
tmp_2 = y_s * (x_s * tmp);
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+14], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 1e+290], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+14}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{elif}\;z \cdot z \leq 10^{+290}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot {z}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e14Initial program 99.8%
if 1e14 < (*.f64 z z) < 1.00000000000000006e290Initial program 88.7%
associate-/l/88.6%
remove-double-neg88.6%
distribute-rgt-neg-out88.6%
distribute-rgt-neg-out88.6%
remove-double-neg88.6%
associate-*l*88.7%
*-commutative88.7%
sqr-neg88.7%
+-commutative88.7%
sqr-neg88.7%
fma-define88.7%
Simplified88.7%
*-commutative88.7%
associate-*r*88.6%
fma-undefine88.6%
+-commutative88.6%
associate-/l/88.7%
add-sqr-sqrt51.8%
add-sqr-sqrt30.0%
times-frac30.0%
Applied egg-rr31.4%
unpow231.4%
Simplified31.4%
Taylor expanded in z around inf 50.7%
associate-*r/50.8%
*-rgt-identity50.8%
associate-/r*50.8%
Simplified50.8%
unpow250.8%
frac-times50.9%
add-sqr-sqrt90.7%
associate-/l/90.7%
unpow290.7%
associate-/r*90.2%
associate-*r*88.7%
associate-/r*89.2%
Applied egg-rr89.2%
if 1.00000000000000006e290 < (*.f64 z z) Initial program 72.1%
associate-/l/72.1%
remove-double-neg72.1%
distribute-rgt-neg-out72.1%
distribute-rgt-neg-out72.1%
remove-double-neg72.1%
associate-*l*72.0%
*-commutative72.0%
sqr-neg72.0%
+-commutative72.0%
sqr-neg72.0%
fma-define72.0%
Simplified72.0%
add-sqr-sqrt33.4%
pow233.4%
*-commutative33.4%
sqrt-prod33.4%
fma-undefine33.4%
+-commutative33.4%
hypot-1-def38.7%
Applied egg-rr38.7%
Taylor expanded in z around inf 38.7%
unpow238.7%
swap-sqr33.4%
add-sqr-sqrt72.0%
pow272.0%
associate-*r*71.6%
associate-/l/71.6%
pow271.6%
associate-/r*72.0%
un-div-inv72.0%
times-frac99.7%
Applied egg-rr99.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1e+290)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(* (/ (/ 1.0 z) y_m) (/ (/ 1.0 z) x_m))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+290) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+290) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(Float64(1.0 / z) / y_m) * Float64(Float64(1.0 / z) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+290], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+290}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.00000000000000006e290Initial program 96.0%
associate-/l/95.8%
remove-double-neg95.8%
distribute-rgt-neg-out95.8%
distribute-rgt-neg-out95.8%
remove-double-neg95.8%
associate-*l*95.8%
*-commutative95.8%
sqr-neg95.8%
+-commutative95.8%
sqr-neg95.8%
fma-define95.8%
Simplified95.8%
*-commutative95.8%
associate-*r*95.8%
fma-undefine95.8%
+-commutative95.8%
associate-/l/96.0%
add-sqr-sqrt54.1%
add-sqr-sqrt29.5%
times-frac29.5%
Applied egg-rr30.0%
unpow230.0%
Simplified30.0%
div-inv30.0%
unpow-prod-down29.4%
pow229.4%
pow-prod-up54.8%
metadata-eval54.8%
inv-pow54.8%
metadata-eval54.8%
*-commutative54.8%
hypot-1-def54.8%
sqrt-prod54.8%
+-commutative54.8%
fma-undefine54.8%
sqrt-div57.5%
pow257.5%
add-sqr-sqrt95.9%
associate-/r*95.9%
fma-undefine95.9%
+-commutative95.9%
frac-times96.1%
Applied egg-rr96.1%
if 1.00000000000000006e290 < (*.f64 z z) Initial program 72.1%
associate-/l/72.1%
remove-double-neg72.1%
distribute-rgt-neg-out72.1%
distribute-rgt-neg-out72.1%
remove-double-neg72.1%
associate-*l*72.0%
*-commutative72.0%
sqr-neg72.0%
+-commutative72.0%
sqr-neg72.0%
fma-define72.0%
Simplified72.0%
add-sqr-sqrt33.4%
pow233.4%
*-commutative33.4%
sqrt-prod33.4%
fma-undefine33.4%
+-commutative33.4%
hypot-1-def38.7%
Applied egg-rr38.7%
Taylor expanded in z around inf 38.7%
unpow238.7%
swap-sqr33.4%
add-sqr-sqrt72.0%
pow272.0%
associate-*r*71.6%
associate-/l/71.6%
pow271.6%
associate-/r*72.0%
un-div-inv72.0%
times-frac99.7%
Applied egg-rr99.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1e+273)
(/ 1.0 (* y_m (* x_m (fma z z 1.0))))
(* (/ (/ 1.0 z) y_m) (/ (/ 1.0 z) x_m))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * fma(z, z, 1.0)));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+273) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.0)))); else tmp = Float64(Float64(Float64(1.0 / z) / y_m) * Float64(Float64(1.0 / z) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+273], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+273}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 9.99999999999999945e272Initial program 96.1%
associate-/l/95.9%
remove-double-neg95.9%
distribute-rgt-neg-out95.9%
distribute-rgt-neg-out95.9%
remove-double-neg95.9%
associate-*l*96.4%
*-commutative96.4%
sqr-neg96.4%
+-commutative96.4%
sqr-neg96.4%
fma-define96.4%
Simplified96.4%
if 9.99999999999999945e272 < (*.f64 z z) Initial program 72.5%
associate-/l/72.5%
remove-double-neg72.5%
distribute-rgt-neg-out72.5%
distribute-rgt-neg-out72.5%
remove-double-neg72.5%
associate-*l*71.2%
*-commutative71.2%
sqr-neg71.2%
+-commutative71.2%
sqr-neg71.2%
fma-define71.2%
Simplified71.2%
add-sqr-sqrt33.6%
pow233.6%
*-commutative33.6%
sqrt-prod33.6%
fma-undefine33.6%
+-commutative33.6%
hypot-1-def38.8%
Applied egg-rr38.8%
Taylor expanded in z around inf 38.8%
unpow238.8%
swap-sqr33.6%
add-sqr-sqrt71.2%
pow271.2%
associate-*r*72.0%
associate-/l/72.4%
pow272.4%
associate-/r*72.8%
un-div-inv72.8%
times-frac99.4%
Applied egg-rr99.4%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1e+14)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(if (<= (* z z) 1e+273)
(/ 1.0 (* y_m (* x_m (* z z))))
(* (/ (/ 1.0 z) y_m) (/ (/ 1.0 z) x_m)))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+14) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
real(8) :: tmp
if ((z * z) <= 1d+14) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else if ((z * z) <= 1d+273) then
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
else
tmp = ((1.0d0 / z) / y_m) * ((1.0d0 / z) / x_m)
end if
code = y_s * (x_s * tmp)
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+14) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1e+14: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) elif (z * z) <= 1e+273: tmp = 1.0 / (y_m * (x_m * (z * z))) else: tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m) return y_s * (x_s * tmp)
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+14) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); elseif (Float64(z * z) <= 1e+273) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); else tmp = Float64(Float64(Float64(1.0 / z) / y_m) * Float64(Float64(1.0 / z) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1e+14)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
elseif ((z * z) <= 1e+273)
tmp = 1.0 / (y_m * (x_m * (z * z)));
else
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
end
tmp_2 = y_s * (x_s * tmp);
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+14], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 1e+273], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+14}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{elif}\;z \cdot z \leq 10^{+273}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e14Initial program 99.8%
if 1e14 < (*.f64 z z) < 9.99999999999999945e272Initial program 88.8%
associate-/l/88.7%
remove-double-neg88.7%
distribute-rgt-neg-out88.7%
distribute-rgt-neg-out88.7%
remove-double-neg88.7%
associate-*l*90.3%
*-commutative90.3%
sqr-neg90.3%
+-commutative90.3%
sqr-neg90.3%
fma-define90.3%
Simplified90.3%
Taylor expanded in z around inf 88.7%
*-commutative88.7%
associate-*r*90.3%
*-commutative90.3%
Simplified90.3%
pow290.3%
Applied egg-rr90.3%
if 9.99999999999999945e272 < (*.f64 z z) Initial program 72.5%
associate-/l/72.5%
remove-double-neg72.5%
distribute-rgt-neg-out72.5%
distribute-rgt-neg-out72.5%
remove-double-neg72.5%
associate-*l*71.2%
*-commutative71.2%
sqr-neg71.2%
+-commutative71.2%
sqr-neg71.2%
fma-define71.2%
Simplified71.2%
add-sqr-sqrt33.6%
pow233.6%
*-commutative33.6%
sqrt-prod33.6%
fma-undefine33.6%
+-commutative33.6%
hypot-1-def38.8%
Applied egg-rr38.8%
Taylor expanded in z around inf 38.8%
unpow238.8%
swap-sqr33.6%
add-sqr-sqrt71.2%
pow271.2%
associate-*r*72.0%
associate-/l/72.4%
pow272.4%
associate-/r*72.8%
un-div-inv72.8%
times-frac99.4%
Applied egg-rr99.4%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1.0)
(/ (/ 1.0 y_m) x_m)
(if (<= (* z z) 1e+273)
(/ 1.0 (* y_m (* x_m (* z z))))
(* (/ (/ 1.0 z) y_m) (/ (/ 1.0 z) x_m)))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
real(8) :: tmp
if ((z * z) <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else if ((z * z) <= 1d+273) then
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
else
tmp = ((1.0d0 / z) / y_m) * ((1.0d0 / z) / x_m)
end if
code = y_s * (x_s * tmp)
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
}
return y_s * (x_s * tmp);
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1.0: tmp = (1.0 / y_m) / x_m elif (z * z) <= 1e+273: tmp = 1.0 / (y_m * (x_m * (z * z))) else: tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m) return y_s * (x_s * tmp)
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); elseif (Float64(z * z) <= 1e+273) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); else tmp = Float64(Float64(Float64(1.0 / z) / y_m) * Float64(Float64(1.0 / z) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1.0)
tmp = (1.0 / y_m) / x_m;
elseif ((z * z) <= 1e+273)
tmp = 1.0 / (y_m * (x_m * (z * z)));
else
tmp = ((1.0 / z) / y_m) * ((1.0 / z) / x_m);
end
tmp_2 = y_s * (x_s * tmp);
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 1e+273], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{elif}\;z \cdot z \leq 10^{+273}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{y\_m} \cdot \frac{\frac{1}{z}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1Initial program 99.8%
associate-/l/99.5%
remove-double-neg99.5%
distribute-rgt-neg-out99.5%
distribute-rgt-neg-out99.5%
remove-double-neg99.5%
associate-*l*99.5%
*-commutative99.5%
sqr-neg99.5%
+-commutative99.5%
sqr-neg99.5%
fma-define99.5%
Simplified99.5%
*-commutative99.5%
associate-*r*99.5%
fma-undefine99.5%
+-commutative99.5%
associate-/l/99.8%
add-sqr-sqrt56.4%
add-sqr-sqrt29.4%
times-frac29.3%
Applied egg-rr29.3%
unpow229.3%
Simplified29.3%
div-inv29.4%
unpow-prod-down29.3%
pow229.3%
metadata-eval29.3%
*-commutative29.3%
hypot-1-def29.3%
sqrt-prod29.3%
+-commutative29.3%
fma-undefine29.3%
sqrt-div29.4%
pow229.4%
add-sqr-sqrt56.3%
pow-prod-up99.6%
metadata-eval99.6%
inv-pow99.6%
*-commutative99.6%
un-div-inv99.7%
Applied egg-rr99.7%
Taylor expanded in z around 0 98.7%
if 1 < (*.f64 z z) < 9.99999999999999945e272Initial program 89.4%
associate-/l/89.4%
remove-double-neg89.4%
distribute-rgt-neg-out89.4%
distribute-rgt-neg-out89.4%
remove-double-neg89.4%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
Taylor expanded in z around inf 87.8%
*-commutative87.8%
associate-*r*89.3%
*-commutative89.3%
Simplified89.3%
pow289.3%
Applied egg-rr89.3%
if 9.99999999999999945e272 < (*.f64 z z) Initial program 72.5%
associate-/l/72.5%
remove-double-neg72.5%
distribute-rgt-neg-out72.5%
distribute-rgt-neg-out72.5%
remove-double-neg72.5%
associate-*l*71.2%
*-commutative71.2%
sqr-neg71.2%
+-commutative71.2%
sqr-neg71.2%
fma-define71.2%
Simplified71.2%
add-sqr-sqrt33.6%
pow233.6%
*-commutative33.6%
sqrt-prod33.6%
fma-undefine33.6%
+-commutative33.6%
hypot-1-def38.8%
Applied egg-rr38.8%
Taylor expanded in z around inf 38.8%
unpow238.8%
swap-sqr33.6%
add-sqr-sqrt71.2%
pow271.2%
associate-*r*72.0%
associate-/l/72.4%
pow272.4%
associate-/r*72.8%
un-div-inv72.8%
times-frac99.4%
Applied egg-rr99.4%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 1.0)
(/ (/ 1.0 y_m) x_m)
(if (<= (* z z) 1e+273)
(/ 1.0 (* y_m (* x_m (* z z))))
(/ (/ 1.0 z) (* z (* x_m y_m))))))))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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = (1.0 / z) / (z * (x_m * y_m));
}
return y_s * (x_s * tmp);
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
real(8) :: tmp
if ((z * z) <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else if ((z * z) <= 1d+273) then
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
else
tmp = (1.0d0 / z) / (z * (x_m * y_m))
end if
code = y_s * (x_s * tmp)
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 1e+273) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = (1.0 / z) / (z * (x_m * y_m));
}
return y_s * (x_s * tmp);
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1.0: tmp = (1.0 / y_m) / x_m elif (z * z) <= 1e+273: tmp = 1.0 / (y_m * (x_m * (z * z))) else: tmp = (1.0 / z) / (z * (x_m * y_m)) return y_s * (x_s * tmp)
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); elseif (Float64(z * z) <= 1e+273) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); else tmp = Float64(Float64(1.0 / z) / Float64(z * Float64(x_m * y_m))); end return Float64(y_s * Float64(x_s * tmp)) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1.0)
tmp = (1.0 / y_m) / x_m;
elseif ((z * z) <= 1e+273)
tmp = 1.0 / (y_m * (x_m * (z * z)));
else
tmp = (1.0 / z) / (z * (x_m * y_m));
end
tmp_2 = y_s * (x_s * tmp);
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 1e+273], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(z * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{elif}\;z \cdot z \leq 10^{+273}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{z \cdot \left(x\_m \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1Initial program 99.8%
associate-/l/99.5%
remove-double-neg99.5%
distribute-rgt-neg-out99.5%
distribute-rgt-neg-out99.5%
remove-double-neg99.5%
associate-*l*99.5%
*-commutative99.5%
sqr-neg99.5%
+-commutative99.5%
sqr-neg99.5%
fma-define99.5%
Simplified99.5%
*-commutative99.5%
associate-*r*99.5%
fma-undefine99.5%
+-commutative99.5%
associate-/l/99.8%
add-sqr-sqrt56.4%
add-sqr-sqrt29.4%
times-frac29.3%
Applied egg-rr29.3%
unpow229.3%
Simplified29.3%
div-inv29.4%
unpow-prod-down29.3%
pow229.3%
metadata-eval29.3%
*-commutative29.3%
hypot-1-def29.3%
sqrt-prod29.3%
+-commutative29.3%
fma-undefine29.3%
sqrt-div29.4%
pow229.4%
add-sqr-sqrt56.3%
pow-prod-up99.6%
metadata-eval99.6%
inv-pow99.6%
*-commutative99.6%
un-div-inv99.7%
Applied egg-rr99.7%
Taylor expanded in z around 0 98.7%
if 1 < (*.f64 z z) < 9.99999999999999945e272Initial program 89.4%
associate-/l/89.4%
remove-double-neg89.4%
distribute-rgt-neg-out89.4%
distribute-rgt-neg-out89.4%
remove-double-neg89.4%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
Taylor expanded in z around inf 87.8%
*-commutative87.8%
associate-*r*89.3%
*-commutative89.3%
Simplified89.3%
pow289.3%
Applied egg-rr89.3%
if 9.99999999999999945e272 < (*.f64 z z) Initial program 72.5%
associate-/l/72.5%
remove-double-neg72.5%
distribute-rgt-neg-out72.5%
distribute-rgt-neg-out72.5%
remove-double-neg72.5%
associate-*l*71.2%
*-commutative71.2%
sqr-neg71.2%
+-commutative71.2%
sqr-neg71.2%
fma-define71.2%
Simplified71.2%
Taylor expanded in z around inf 72.5%
*-commutative72.5%
associate-*r*71.2%
*-commutative71.2%
Simplified71.2%
associate-*r*72.0%
associate-/r*72.3%
associate-/l/72.3%
add-sqr-sqrt29.4%
unpow229.4%
frac-times38.3%
div-inv38.4%
div-inv38.3%
swap-sqr29.8%
add-sqr-sqrt72.7%
associate-/l/72.7%
Applied egg-rr72.7%
un-div-inv72.7%
frac-times89.5%
*-un-lft-identity89.5%
*-commutative89.5%
Applied egg-rr89.5%
Final simplification93.7%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (if (<= (* z z) 1.0) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* y_m (* x_m (* z 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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (y_m * (x_m * (z * z)));
}
return y_s * (x_s * tmp);
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
real(8) :: tmp
if ((z * z) <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
end if
code = y_s * (x_s * tmp)
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (y_m * (x_m * (z * z)));
}
return y_s * (x_s * tmp);
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / (y_m * (x_m * (z * z))) return y_s * (x_s * tmp)
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); end return Float64(y_s * Float64(x_s * tmp)) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / (y_m * (x_m * (z * z)));
end
tmp_2 = y_s * (x_s * tmp);
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1Initial program 99.8%
associate-/l/99.5%
remove-double-neg99.5%
distribute-rgt-neg-out99.5%
distribute-rgt-neg-out99.5%
remove-double-neg99.5%
associate-*l*99.5%
*-commutative99.5%
sqr-neg99.5%
+-commutative99.5%
sqr-neg99.5%
fma-define99.5%
Simplified99.5%
*-commutative99.5%
associate-*r*99.5%
fma-undefine99.5%
+-commutative99.5%
associate-/l/99.8%
add-sqr-sqrt56.4%
add-sqr-sqrt29.4%
times-frac29.3%
Applied egg-rr29.3%
unpow229.3%
Simplified29.3%
div-inv29.4%
unpow-prod-down29.3%
pow229.3%
metadata-eval29.3%
*-commutative29.3%
hypot-1-def29.3%
sqrt-prod29.3%
+-commutative29.3%
fma-undefine29.3%
sqrt-div29.4%
pow229.4%
add-sqr-sqrt56.3%
pow-prod-up99.6%
metadata-eval99.6%
inv-pow99.6%
*-commutative99.6%
un-div-inv99.7%
Applied egg-rr99.7%
Taylor expanded in z around 0 98.7%
if 1 < (*.f64 z z) Initial program 80.5%
associate-/l/80.4%
remove-double-neg80.4%
distribute-rgt-neg-out80.4%
distribute-rgt-neg-out80.4%
remove-double-neg80.4%
associate-*l*80.5%
*-commutative80.5%
sqr-neg80.5%
+-commutative80.5%
sqr-neg80.5%
fma-define80.5%
Simplified80.5%
Taylor expanded in z around inf 79.7%
*-commutative79.7%
associate-*r*79.7%
*-commutative79.7%
Simplified79.7%
pow279.7%
Applied egg-rr79.7%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 y_m) x_m))))
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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
code = y_s * (x_s * ((1.0d0 / y_m) / x_m))
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / y_m) / x_m))
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / y_m) / x_m))) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / y_m) / x_m));
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{y\_m}}{x\_m}\right)
\end{array}
Initial program 89.4%
associate-/l/89.2%
remove-double-neg89.2%
distribute-rgt-neg-out89.2%
distribute-rgt-neg-out89.2%
remove-double-neg89.2%
associate-*l*89.2%
*-commutative89.2%
sqr-neg89.2%
+-commutative89.2%
sqr-neg89.2%
fma-define89.2%
Simplified89.2%
*-commutative89.2%
associate-*r*89.2%
fma-undefine89.2%
+-commutative89.2%
associate-/l/89.4%
add-sqr-sqrt48.4%
add-sqr-sqrt25.3%
times-frac25.3%
Applied egg-rr27.5%
unpow227.5%
Simplified27.5%
div-inv27.5%
unpow-prod-down25.7%
pow225.7%
metadata-eval25.7%
*-commutative25.7%
hypot-1-def25.3%
sqrt-prod25.3%
+-commutative25.3%
fma-undefine25.3%
sqrt-div32.0%
pow232.0%
add-sqr-sqrt48.4%
pow-prod-up89.3%
metadata-eval89.3%
inv-pow89.3%
*-commutative89.3%
un-div-inv89.3%
Applied egg-rr89.3%
Taylor expanded in z around 0 56.5%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 x_m) y_m))))
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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / x_m) / y_m));
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
code = y_s * (x_s * ((1.0d0 / x_m) / y_m))
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / x_m) / y_m));
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / x_m) / y_m))
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / x_m) / y_m))) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / x_m) / y_m));
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{x\_m}}{y\_m}\right)
\end{array}
Initial program 89.4%
associate-/l/89.2%
remove-double-neg89.2%
distribute-rgt-neg-out89.2%
distribute-rgt-neg-out89.2%
remove-double-neg89.2%
associate-*l*89.2%
*-commutative89.2%
sqr-neg89.2%
+-commutative89.2%
sqr-neg89.2%
fma-define89.2%
Simplified89.2%
Taylor expanded in z around 0 56.4%
associate-/r*56.6%
Simplified56.6%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
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);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
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 should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
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
code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
end function
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;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
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] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (1.0 / (x_m * y_m)))
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 = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m)))) end
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 = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
end
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 should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := 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}
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] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right)
\end{array}
Initial program 89.4%
associate-/l/89.2%
remove-double-neg89.2%
distribute-rgt-neg-out89.2%
distribute-rgt-neg-out89.2%
remove-double-neg89.2%
associate-*l*89.2%
*-commutative89.2%
sqr-neg89.2%
+-commutative89.2%
sqr-neg89.2%
fma-define89.2%
Simplified89.2%
Taylor expanded in z around 0 56.4%
Final simplification56.4%
(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 2024154
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))