
(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 16 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
(let* ((t_0 (* z (sqrt x_m))))
(*
y_s
(*
x_s
(if (<= (* z z) 2e+274)
(/ (/ (/ 1.0 x_m) (fma z z 1.0)) y_m)
(/ (/ (/ 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) <= 2e+274) {
tmp = ((1.0 / x_m) / fma(z, z, 1.0)) / y_m;
} 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) <= 2e+274) tmp = Float64(Float64(Float64(1.0 / x_m) / fma(z, z, 1.0)) / y_m); 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], 2e+274], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / y$95$m), $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 2 \cdot 10^{+274}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y\_m}}{t\_0}}{t\_0}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 z z) < 1.99999999999999984e274Initial program 96.7%
associate-/l/96.2%
remove-double-neg96.2%
distribute-rgt-neg-out96.2%
distribute-rgt-neg-out96.2%
remove-double-neg96.2%
associate-*l*97.7%
*-commutative97.7%
sqr-neg97.7%
+-commutative97.7%
sqr-neg97.7%
fma-define97.7%
Simplified97.7%
associate-*r*97.7%
*-commutative97.7%
associate-/r*98.0%
*-commutative98.0%
associate-/l/98.3%
fma-undefine98.3%
+-commutative98.3%
associate-/r*96.7%
*-un-lft-identity96.7%
add-sqr-sqrt53.1%
times-frac53.1%
+-commutative53.1%
fma-undefine53.1%
*-commutative53.1%
sqrt-prod53.1%
fma-undefine53.1%
+-commutative53.1%
hypot-1-def53.1%
+-commutative53.1%
Applied egg-rr54.6%
frac-times53.2%
*-un-lft-identity53.2%
*-commutative53.2%
*-commutative53.2%
swap-sqr53.2%
add-sqr-sqrt96.7%
hypot-undefine96.7%
metadata-eval96.7%
unpow296.7%
hypot-undefine96.7%
metadata-eval96.7%
unpow296.7%
add-sqr-sqrt96.7%
+-commutative96.7%
unpow296.7%
fma-undefine96.7%
Applied egg-rr98.2%
if 1.99999999999999984e274 < (*.f64 z z) Initial program 76.4%
associate-/l/76.4%
remove-double-neg76.4%
distribute-rgt-neg-out76.4%
distribute-rgt-neg-out76.4%
remove-double-neg76.4%
associate-*l*75.2%
*-commutative75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-define75.2%
Simplified75.2%
Taylor expanded in z around inf 75.2%
associate-/r*75.2%
*-un-lft-identity75.2%
add-sqr-sqrt35.1%
times-frac35.1%
*-commutative35.1%
sqrt-prod35.1%
sqrt-pow135.1%
metadata-eval35.1%
pow135.1%
*-commutative35.1%
sqrt-prod35.1%
sqrt-pow148.5%
metadata-eval48.5%
pow148.5%
Applied egg-rr48.5%
associate-*l/48.5%
*-lft-identity48.5%
Simplified48.5%
Final simplification83.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 (* (hypot 1.0 z) (sqrt y_m)))) (* y_s (* x_s (* (/ 1.0 t_0) (/ (/ 1.0 x_m) 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 = hypot(1.0, z) * sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_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) {
double t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_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): t_0 = math.hypot(1.0, z) * math.sqrt(y_m) return y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_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) t_0 = Float64(hypot(1.0, z) * sqrt(y_m)) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / t_0) * Float64(Float64(1.0 / x_m) / t_0)))) end
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)
t_0 = hypot(1.0, z) * sqrt(y_m);
tmp = y_s * (x_s * ((1.0 / t_0) * ((1.0 / x_m) / t_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_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
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 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \left(\frac{1}{t\_0} \cdot \frac{\frac{1}{x\_m}}{t\_0}\right)\right)
\end{array}
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
associate-*r*91.6%
*-commutative91.6%
associate-/r*91.8%
*-commutative91.8%
associate-/l/92.0%
fma-undefine92.0%
+-commutative92.0%
associate-/r*90.7%
*-un-lft-identity90.7%
add-sqr-sqrt47.6%
times-frac47.5%
+-commutative47.5%
fma-undefine47.5%
*-commutative47.5%
sqrt-prod47.5%
fma-undefine47.5%
+-commutative47.5%
hypot-1-def47.5%
+-commutative47.5%
Applied egg-rr50.1%
Final simplification50.1%
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 (* (hypot 1.0 z) (sqrt y_m)))) (* y_s (* x_s (/ (/ 1.0 (* t_0 x_m)) 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 = hypot(1.0, z) * sqrt(y_m);
return y_s * (x_s * ((1.0 / (t_0 * x_m)) / t_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) {
double t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
return y_s * (x_s * ((1.0 / (t_0 * x_m)) / t_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): t_0 = math.hypot(1.0, z) * math.sqrt(y_m) return y_s * (x_s * ((1.0 / (t_0 * x_m)) / t_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) t_0 = Float64(hypot(1.0, z) * sqrt(y_m)) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / Float64(t_0 * x_m)) / t_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)
t_0 = hypot(1.0, z) * sqrt(y_m);
tmp = y_s * (x_s * ((1.0 / (t_0 * x_m)) / t_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_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / N[(t$95$0 * x$95$m), $MachinePrecision]), $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 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{t\_0 \cdot x\_m}}{t\_0}\right)
\end{array}
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
associate-*r*91.6%
*-commutative91.6%
associate-/r*91.8%
*-commutative91.8%
associate-/l/92.0%
fma-undefine92.0%
+-commutative92.0%
associate-/r*90.7%
*-un-lft-identity90.7%
add-sqr-sqrt47.6%
times-frac47.5%
+-commutative47.5%
fma-undefine47.5%
*-commutative47.5%
sqrt-prod47.5%
fma-undefine47.5%
+-commutative47.5%
hypot-1-def47.5%
+-commutative47.5%
Applied egg-rr50.1%
associate-*l/50.1%
*-lft-identity50.1%
associate-/l/50.1%
*-commutative50.1%
Simplified50.1%
Final simplification50.1%
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 (* (hypot 1.0 z) (sqrt y_m)))) (* y_s (* x_s (/ (/ 1.0 t_0) (* t_0 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 t_0 = hypot(1.0, z) * sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) / (t_0 * x_m)));
}
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 t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) / (t_0 * 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): t_0 = math.hypot(1.0, z) * math.sqrt(y_m) return y_s * (x_s * ((1.0 / t_0) / (t_0 * 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) t_0 = Float64(hypot(1.0, z) * sqrt(y_m)) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / t_0) / Float64(t_0 * 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)
t_0 = hypot(1.0, z) * sqrt(y_m);
tmp = y_s * (x_s * ((1.0 / t_0) / (t_0 * 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_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / t$95$0), $MachinePrecision] / N[(t$95$0 * 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])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{t\_0}}{t\_0 \cdot x\_m}\right)
\end{array}
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
associate-*r*91.6%
*-commutative91.6%
associate-/r*91.8%
*-commutative91.8%
associate-/l/92.0%
fma-undefine92.0%
+-commutative92.0%
associate-/r*90.7%
*-un-lft-identity90.7%
add-sqr-sqrt47.6%
times-frac47.5%
+-commutative47.5%
fma-undefine47.5%
*-commutative47.5%
sqrt-prod47.5%
fma-undefine47.5%
+-commutative47.5%
hypot-1-def47.5%
+-commutative47.5%
Applied egg-rr50.1%
associate-/l/50.1%
associate-*r/50.1%
*-rgt-identity50.1%
*-commutative50.1%
Simplified50.1%
Final simplification50.1%
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) (* (hypot 1.0 z) (* (hypot 1.0 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) {
return y_s * (x_s * ((-(-1.0) / (hypot(1.0, z) * (hypot(1.0, z) * x_m))) / y_m));
}
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) / (Math.hypot(1.0, z) * (Math.hypot(1.0, z) * 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) / (math.hypot(1.0, z) * (math.hypot(1.0, z) * 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(Float64(-(-1.0)) / Float64(hypot(1.0, z) * Float64(hypot(1.0, z) * 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) / (hypot(1.0, z) * (hypot(1.0, z) * 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) / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $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}{\mathsf{hypot}\left(1, z\right) \cdot \left(\mathsf{hypot}\left(1, z\right) \cdot x\_m\right)}}{y\_m}\right)
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
associate-*r*91.6%
*-commutative91.6%
associate-/r*91.8%
*-commutative91.8%
associate-/l/92.0%
fma-undefine92.0%
+-commutative92.0%
associate-/r*90.7%
*-un-lft-identity90.7%
add-sqr-sqrt47.6%
times-frac47.5%
+-commutative47.5%
fma-undefine47.5%
*-commutative47.5%
sqrt-prod47.5%
fma-undefine47.5%
+-commutative47.5%
hypot-1-def47.5%
+-commutative47.5%
Applied egg-rr50.1%
*-commutative50.1%
associate-/r*49.7%
associate-/r*49.7%
frac-times47.9%
associate-/l/47.9%
add-sqr-sqrt96.0%
Applied egg-rr96.0%
un-div-inv96.0%
frac-2neg96.0%
metadata-eval96.0%
associate-/l/96.0%
distribute-rgt-neg-in96.0%
Applied egg-rr96.0%
Final simplification96.0%
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) 2e+15)
(/ (/ (/ 1.0 x_m) (fma z z 1.0)) y_m)
(/ (/ (- -1.0) (* (hypot 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) <= 2e+15) {
tmp = ((1.0 / x_m) / fma(z, z, 1.0)) / y_m;
} else {
tmp = (-(-1.0) / (hypot(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) <= 2e+15) tmp = Float64(Float64(Float64(1.0 / x_m) / fma(z, z, 1.0)) / y_m); else tmp = Float64(Float64(Float64(-(-1.0)) / Float64(hypot(1.0, z) * Float64(z * x_m))) / y_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], 2e+15], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[((--1.0) / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $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 \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{--1}{\mathsf{hypot}\left(1, z\right) \cdot \left(z \cdot x\_m\right)}}{y\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e15Initial program 99.1%
associate-/l/98.8%
remove-double-neg98.8%
distribute-rgt-neg-out98.8%
distribute-rgt-neg-out98.8%
remove-double-neg98.8%
associate-*l*99.5%
*-commutative99.5%
sqr-neg99.5%
+-commutative99.5%
sqr-neg99.5%
fma-define99.5%
Simplified99.5%
associate-*r*99.5%
*-commutative99.5%
associate-/r*99.5%
*-commutative99.5%
associate-/l/99.8%
fma-undefine99.8%
+-commutative99.8%
associate-/r*99.1%
*-un-lft-identity99.1%
add-sqr-sqrt55.8%
times-frac55.7%
+-commutative55.7%
fma-undefine55.7%
*-commutative55.7%
sqrt-prod55.7%
fma-undefine55.7%
+-commutative55.7%
hypot-1-def55.7%
+-commutative55.7%
Applied egg-rr56.4%
frac-times55.8%
*-un-lft-identity55.8%
*-commutative55.8%
*-commutative55.8%
swap-sqr55.8%
add-sqr-sqrt99.1%
hypot-undefine99.1%
metadata-eval99.1%
unpow299.1%
hypot-undefine99.1%
metadata-eval99.1%
unpow299.1%
add-sqr-sqrt99.1%
+-commutative99.1%
unpow299.1%
fma-undefine99.1%
Applied egg-rr99.8%
if 2e15 < (*.f64 z z) Initial program 80.6%
associate-/l/80.2%
remove-double-neg80.2%
distribute-rgt-neg-out80.2%
distribute-rgt-neg-out80.2%
remove-double-neg80.2%
associate-*l*81.0%
*-commutative81.0%
sqr-neg81.0%
+-commutative81.0%
sqr-neg81.0%
fma-define81.0%
Simplified81.0%
associate-*r*82.3%
*-commutative82.3%
associate-/r*82.7%
*-commutative82.7%
associate-/l/82.7%
fma-undefine82.7%
+-commutative82.7%
associate-/r*80.6%
*-un-lft-identity80.6%
add-sqr-sqrt37.8%
times-frac37.8%
+-commutative37.8%
fma-undefine37.8%
*-commutative37.8%
sqrt-prod37.8%
fma-undefine37.8%
+-commutative37.8%
hypot-1-def37.8%
+-commutative37.8%
Applied egg-rr42.5%
*-commutative42.5%
associate-/r*41.8%
associate-/r*41.8%
frac-times37.7%
associate-/l/37.8%
add-sqr-sqrt91.5%
Applied egg-rr91.5%
un-div-inv91.5%
frac-2neg91.5%
metadata-eval91.5%
associate-/l/91.5%
distribute-rgt-neg-in91.5%
Applied egg-rr91.5%
Taylor expanded in z around inf 75.6%
associate-*r*75.6%
mul-1-neg75.6%
Simplified75.6%
Final simplification88.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) 200000000.0)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(* (/ 1.0 y_m) (/ (pow z -2.0) 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) <= 200000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) * (pow(z, -2.0) / 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) <= 200000000.0d0) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = (1.0d0 / y_m) * ((z ** (-2.0d0)) / 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) <= 200000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) * (Math.pow(z, -2.0) / 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) <= 200000000.0: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = (1.0 / y_m) * (math.pow(z, -2.0) / 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) <= 200000000.0) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(1.0 / y_m) * Float64((z ^ -2.0) / 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) <= 200000000.0)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = (1.0 / y_m) * ((z ^ -2.0) / 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], 200000000.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[Power[z, -2.0], $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 200000000:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{{z}^{-2}}{x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e8Initial program 99.8%
if 2e8 < (*.f64 z z) Initial program 80.1%
associate-/l/79.8%
remove-double-neg79.8%
distribute-rgt-neg-out79.8%
distribute-rgt-neg-out79.8%
remove-double-neg79.8%
associate-*l*81.3%
*-commutative81.3%
sqr-neg81.3%
+-commutative81.3%
sqr-neg81.3%
fma-define81.3%
Simplified81.3%
associate-*r*82.6%
*-commutative82.6%
associate-/r*83.0%
*-commutative83.0%
associate-/l/83.0%
fma-undefine83.0%
+-commutative83.0%
associate-/r*80.1%
*-un-lft-identity80.1%
add-sqr-sqrt37.2%
times-frac37.2%
+-commutative37.2%
fma-undefine37.2%
*-commutative37.2%
sqrt-prod37.2%
fma-undefine37.2%
+-commutative37.2%
hypot-1-def37.2%
+-commutative37.2%
Applied egg-rr42.6%
*-commutative42.6%
associate-/r*42.0%
associate-/r*42.0%
frac-times37.9%
associate-/l/38.0%
add-sqr-sqrt91.6%
Applied egg-rr91.6%
Taylor expanded in z around inf 81.6%
associate-/r*81.6%
Simplified81.6%
div-inv81.6%
associate-/l/81.7%
associate-/r*81.6%
pow-flip82.4%
metadata-eval82.4%
Applied egg-rr82.4%
Final simplification91.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 (<= y_m 1.8e-35)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(/ 1.0 (* y_m (* x_m (fma z z 1.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 (y_m <= 1.8e-35) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = 1.0 / (y_m * (x_m * fma(z, z, 1.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 (y_m <= 1.8e-35) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.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[y$95$m, 1.8e-35], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $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}\;y\_m \leq 1.8 \cdot 10^{-35}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\end{array}\right)
\end{array}
if y < 1.80000000000000009e-35Initial program 89.1%
+-commutative89.1%
distribute-lft-in89.1%
associate-*r*93.6%
*-rgt-identity93.6%
fma-define93.6%
Applied egg-rr93.6%
if 1.80000000000000009e-35 < y Initial program 94.7%
associate-/l/93.6%
remove-double-neg93.6%
distribute-rgt-neg-out93.6%
distribute-rgt-neg-out93.6%
remove-double-neg93.6%
associate-*l*97.5%
*-commutative97.5%
sqr-neg97.5%
+-commutative97.5%
sqr-neg97.5%
fma-define97.5%
Simplified97.5%
Final simplification94.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 (<= y_m 9e-46)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(/ (/ 1.0 (fma z z 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) {
double tmp;
if (y_m <= 9e-46) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = (1.0 / fma(z, z, 1.0)) / (y_m * 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 (y_m <= 9e-46) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64(1.0 / fma(z, z, 1.0)) / Float64(y_m * 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[y$95$m, 9e-46], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * 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}\;y\_m \leq 9 \cdot 10^{-46}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m \cdot x\_m}\\
\end{array}\right)
\end{array}
if y < 9.00000000000000001e-46Initial program 89.0%
+-commutative89.0%
distribute-lft-in89.0%
associate-*r*93.6%
*-rgt-identity93.6%
fma-define93.6%
Applied egg-rr93.6%
if 9.00000000000000001e-46 < y Initial program 94.8%
associate-/l/93.7%
remove-double-neg93.7%
distribute-rgt-neg-out93.7%
distribute-rgt-neg-out93.7%
remove-double-neg93.7%
associate-*l*97.5%
*-commutative97.5%
sqr-neg97.5%
+-commutative97.5%
sqr-neg97.5%
fma-define97.5%
Simplified97.5%
Taylor expanded in y around 0 93.7%
associate-*r*97.5%
+-commutative97.5%
unpow297.5%
fma-undefine97.5%
associate-/l/98.1%
Simplified98.1%
Final simplification94.8%
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 (<= y_m 1e-35)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(/ (/ (/ 1.0 x_m) (fma z z 1.0)) 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 (y_m <= 1e-35) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = ((1.0 / x_m) / fma(z, z, 1.0)) / 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 (y_m <= 1e-35) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64(Float64(1.0 / x_m) / fma(z, z, 1.0)) / y_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[y$95$m, 1e-35], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $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 \begin{array}{l}
\mathbf{if}\;y\_m \leq 10^{-35}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m}\\
\end{array}\right)
\end{array}
if y < 1.00000000000000001e-35Initial program 89.1%
+-commutative89.1%
distribute-lft-in89.1%
associate-*r*93.6%
*-rgt-identity93.6%
fma-define93.6%
Applied egg-rr93.6%
if 1.00000000000000001e-35 < y Initial program 94.7%
associate-/l/93.6%
remove-double-neg93.6%
distribute-rgt-neg-out93.6%
distribute-rgt-neg-out93.6%
remove-double-neg93.6%
associate-*l*97.5%
*-commutative97.5%
sqr-neg97.5%
+-commutative97.5%
sqr-neg97.5%
fma-define97.5%
Simplified97.5%
associate-*r*97.5%
*-commutative97.5%
associate-/r*98.1%
*-commutative98.1%
associate-/l/98.6%
fma-undefine98.6%
+-commutative98.6%
associate-/r*94.7%
*-un-lft-identity94.7%
add-sqr-sqrt94.5%
times-frac94.5%
+-commutative94.5%
fma-undefine94.5%
*-commutative94.5%
sqrt-prod94.5%
fma-undefine94.5%
+-commutative94.5%
hypot-1-def94.5%
+-commutative94.5%
Applied egg-rr99.6%
frac-times94.5%
*-un-lft-identity94.5%
*-commutative94.5%
*-commutative94.5%
swap-sqr94.5%
add-sqr-sqrt94.7%
hypot-undefine94.7%
metadata-eval94.7%
unpow294.7%
hypot-undefine94.7%
metadata-eval94.7%
unpow294.7%
add-sqr-sqrt94.7%
+-commutative94.7%
unpow294.7%
fma-undefine94.7%
Applied egg-rr98.5%
Final simplification95.0%
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) 200000000.0)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(/ (/ (pow z -2.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) {
double tmp;
if ((z * z) <= 200000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (pow(z, -2.0) / 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) <= 200000000.0d0) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = ((z ** (-2.0d0)) / 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) <= 200000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (Math.pow(z, -2.0) / 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) <= 200000000.0: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = (math.pow(z, -2.0) / 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) <= 200000000.0) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64((z ^ -2.0) / 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) <= 200000000.0)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = ((z ^ -2.0) / 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], 200000000.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[z, -2.0], $MachinePrecision] / 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 \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 200000000:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{z}^{-2}}{x\_m}}{y\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e8Initial program 99.8%
if 2e8 < (*.f64 z z) Initial program 80.1%
associate-/l/79.8%
remove-double-neg79.8%
distribute-rgt-neg-out79.8%
distribute-rgt-neg-out79.8%
remove-double-neg79.8%
associate-*l*81.3%
*-commutative81.3%
sqr-neg81.3%
+-commutative81.3%
sqr-neg81.3%
fma-define81.3%
Simplified81.3%
associate-*r*82.6%
*-commutative82.6%
associate-/r*83.0%
*-commutative83.0%
associate-/l/83.0%
fma-undefine83.0%
+-commutative83.0%
associate-/r*80.1%
*-un-lft-identity80.1%
add-sqr-sqrt37.2%
times-frac37.2%
+-commutative37.2%
fma-undefine37.2%
*-commutative37.2%
sqrt-prod37.2%
fma-undefine37.2%
+-commutative37.2%
hypot-1-def37.2%
+-commutative37.2%
Applied egg-rr42.6%
*-commutative42.6%
associate-/r*42.0%
associate-/r*42.0%
frac-times37.9%
associate-/l/38.0%
add-sqr-sqrt91.6%
Applied egg-rr91.6%
Taylor expanded in z around inf 81.6%
associate-/r*81.6%
Simplified81.6%
div-inv81.6%
pow-flip82.3%
metadata-eval82.3%
*-un-lft-identity82.3%
associate-*l/82.4%
*-un-lft-identity82.4%
Applied egg-rr82.4%
*-lft-identity82.4%
Simplified82.4%
Final simplification91.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 (fma z z 1.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 * (1.0 / (y_m * (x_m * fma(z, z, 1.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(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.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[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $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 \frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\right)
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
Final simplification91.0%
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 (* y_m (+ 1.0 (* z z)))))
(*
y_s
(*
x_s
(if (<= t_0 1e+308)
(/ (/ 1.0 x_m) t_0)
(/ 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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 1e+308) {
tmp = (1.0 / x_m) / t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z * z))
if (t_0 <= 1d+308) then
tmp = (1.0d0 / x_m) / t_0
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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 1e+308) {
tmp = (1.0 / x_m) / t_0;
} 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): t_0 = y_m * (1.0 + (z * z)) tmp = 0 if t_0 <= 1e+308: tmp = (1.0 / x_m) / t_0 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) t_0 = Float64(y_m * Float64(1.0 + Float64(z * z))) tmp = 0.0 if (t_0 <= 1e+308) tmp = Float64(Float64(1.0 / x_m) / t_0); 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)
t_0 = y_m * (1.0 + (z * z));
tmp = 0.0;
if (t_0 <= 1e+308)
tmp = (1.0 / x_m) / t_0;
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_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 1e+308], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $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])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z \cdot z\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 10^{+308}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 1e308Initial program 92.2%
if 1e308 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 80.6%
associate-/l/80.6%
remove-double-neg80.6%
distribute-rgt-neg-out80.6%
distribute-rgt-neg-out80.6%
remove-double-neg80.6%
associate-*l*88.6%
*-commutative88.6%
sqr-neg88.6%
+-commutative88.6%
sqr-neg88.6%
fma-define88.6%
Simplified88.6%
Taylor expanded in z around inf 88.5%
unpow288.5%
Applied egg-rr88.5%
Final simplification91.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) 2.7e-5)
(/ (/ 1.0 x_m) y_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) <= 2.7e-5) {
tmp = (1.0 / x_m) / y_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) <= 2.7d-5) then
tmp = (1.0d0 / x_m) / y_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) <= 2.7e-5) {
tmp = (1.0 / x_m) / y_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) <= 2.7e-5: tmp = (1.0 / x_m) / y_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) <= 2.7e-5) tmp = Float64(Float64(1.0 / x_m) / y_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) <= 2.7e-5)
tmp = (1.0 / x_m) / y_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], 2.7e-5], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$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 2.7 \cdot 10^{-5}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_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) < 2.6999999999999999e-5Initial program 99.8%
Taylor expanded in z around 0 99.8%
if 2.6999999999999999e-5 < (*.f64 z z) Initial program 80.6%
associate-/l/80.2%
remove-double-neg80.2%
distribute-rgt-neg-out80.2%
distribute-rgt-neg-out80.2%
remove-double-neg80.2%
associate-*l*81.7%
*-commutative81.7%
sqr-neg81.7%
+-commutative81.7%
sqr-neg81.7%
fma-define81.7%
Simplified81.7%
Taylor expanded in z around inf 80.8%
unpow280.8%
Applied egg-rr80.8%
Final simplification90.8%
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 1.0) (/ (/ 1.0 x_m) y_m) (/ (/ (/ 1.0 x_m) (* z z)) 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 <= 1.0) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = ((1.0 / x_m) / (z * z)) / 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 <= 1.0d0) then
tmp = (1.0d0 / x_m) / y_m
else
tmp = ((1.0d0 / x_m) / (z * z)) / 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 <= 1.0) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = ((1.0 / x_m) / (z * z)) / 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 <= 1.0: tmp = (1.0 / x_m) / y_m else: tmp = ((1.0 / x_m) / (z * z)) / 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 (z <= 1.0) tmp = Float64(Float64(1.0 / x_m) / y_m); else tmp = Float64(Float64(Float64(1.0 / x_m) / Float64(z * z)) / 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 <= 1.0)
tmp = (1.0 / x_m) / y_m;
else
tmp = ((1.0 / x_m) / (z * z)) / 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[z, 1.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z * z), $MachinePrecision]), $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 \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{z \cdot z}}{y\_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 94.5%
Taylor expanded in z around 0 73.9%
if 1 < z Initial program 78.5%
associate-/l/78.5%
remove-double-neg78.5%
distribute-rgt-neg-out78.5%
distribute-rgt-neg-out78.5%
remove-double-neg78.5%
associate-*l*83.1%
*-commutative83.1%
sqr-neg83.1%
+-commutative83.1%
sqr-neg83.1%
fma-define83.1%
Simplified83.1%
associate-*r*80.0%
*-commutative80.0%
associate-/r*79.9%
*-commutative79.9%
associate-/l/80.0%
fma-undefine80.0%
+-commutative80.0%
associate-/r*78.5%
*-un-lft-identity78.5%
add-sqr-sqrt34.7%
times-frac34.7%
+-commutative34.7%
fma-undefine34.7%
*-commutative34.7%
sqrt-prod34.6%
fma-undefine34.6%
+-commutative34.6%
hypot-1-def34.6%
+-commutative34.6%
Applied egg-rr42.3%
*-commutative42.3%
associate-/r*42.4%
associate-/r*42.5%
frac-times39.3%
associate-/l/39.3%
add-sqr-sqrt95.0%
Applied egg-rr95.0%
Taylor expanded in z around inf 82.4%
associate-/r*82.3%
Simplified82.3%
unpow282.4%
Applied egg-rr82.3%
Final simplification75.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 (/ 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(1.0 / Float64(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[(1.0 / N[(y$95$m * 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 \frac{1}{y\_m \cdot x\_m}\right)
\end{array}
Initial program 90.7%
associate-/l/90.3%
remove-double-neg90.3%
distribute-rgt-neg-out90.3%
distribute-rgt-neg-out90.3%
remove-double-neg90.3%
associate-*l*91.0%
*-commutative91.0%
sqr-neg91.0%
+-commutative91.0%
sqr-neg91.0%
fma-define91.0%
Simplified91.0%
Taylor expanded in z around 0 59.8%
Final simplification59.8%
(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 2024076
(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)))))