
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
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.25e+113)
(/ (/ 1.0 (* (hypot 1.0 z) x_m)) (* y_m (hypot 1.0 z)))
(/ (/ 1.0 (hypot 1.0 z)) (* (hypot 1.0 z) (* 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 <= 1.25e+113) {
tmp = (1.0 / (hypot(1.0, z) * x_m)) / (y_m * hypot(1.0, z));
} else {
tmp = (1.0 / hypot(1.0, z)) / (hypot(1.0, z) * (y_m * x_m));
}
return y_s * (x_s * tmp);
}
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 (y_m <= 1.25e+113) {
tmp = (1.0 / (Math.hypot(1.0, z) * x_m)) / (y_m * Math.hypot(1.0, z));
} else {
tmp = (1.0 / Math.hypot(1.0, z)) / (Math.hypot(1.0, z) * (y_m * 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 y_m <= 1.25e+113: tmp = (1.0 / (math.hypot(1.0, z) * x_m)) / (y_m * math.hypot(1.0, z)) else: tmp = (1.0 / math.hypot(1.0, z)) / (math.hypot(1.0, z) * (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 <= 1.25e+113) tmp = Float64(Float64(1.0 / Float64(hypot(1.0, z) * x_m)) / Float64(y_m * hypot(1.0, z))); else tmp = Float64(Float64(1.0 / hypot(1.0, z)) / Float64(hypot(1.0, z) * Float64(y_m * 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 (y_m <= 1.25e+113)
tmp = (1.0 / (hypot(1.0, z) * x_m)) / (y_m * hypot(1.0, z));
else
tmp = (1.0 / hypot(1.0, z)) / (hypot(1.0, z) * (y_m * 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[y$95$m, 1.25e+113], N[(N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(y$95$m * x$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}\;y\_m \leq 1.25 \cdot 10^{+113}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot x\_m}}{y\_m \cdot \mathsf{hypot}\left(1, z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{hypot}\left(1, z\right)}}{\mathsf{hypot}\left(1, z\right) \cdot \left(y\_m \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if y < 1.25e113Initial program 90.5%
associate-/l/90.2%
associate-*l*88.1%
*-commutative88.1%
sqr-neg88.1%
+-commutative88.1%
sqr-neg88.1%
fma-define88.1%
Simplified88.1%
clear-num88.1%
associate-*r*90.1%
*-commutative90.1%
*-commutative90.1%
associate-/r/90.1%
associate-/r*90.5%
Applied egg-rr90.5%
add-sqr-sqrt90.4%
associate-/l*90.4%
sqrt-div90.4%
metadata-eval90.4%
fma-undefine90.4%
unpow290.4%
+-commutative90.4%
metadata-eval90.4%
unpow290.4%
hypot-undefine90.4%
sqrt-div90.4%
metadata-eval90.4%
fma-undefine90.4%
unpow290.4%
+-commutative90.4%
metadata-eval90.4%
unpow290.4%
hypot-undefine95.6%
Applied egg-rr95.6%
*-commutative95.6%
div-inv95.7%
associate-/r*97.9%
associate-/l/97.3%
associate-/l/97.3%
Applied egg-rr97.3%
if 1.25e113 < y Initial program 81.8%
associate-/l/81.8%
associate-*l*97.1%
*-commutative97.1%
sqr-neg97.1%
+-commutative97.1%
sqr-neg97.1%
fma-define97.1%
Simplified97.1%
clear-num97.1%
associate-*r*97.0%
*-commutative97.0%
*-commutative97.0%
associate-/r/97.0%
associate-/r*97.0%
Applied egg-rr97.0%
add-sqr-sqrt97.0%
associate-/l*97.0%
sqrt-div97.1%
metadata-eval97.1%
fma-undefine97.1%
unpow297.1%
+-commutative97.1%
metadata-eval97.1%
unpow297.1%
hypot-undefine97.1%
sqrt-div97.1%
metadata-eval97.1%
fma-undefine97.1%
unpow297.1%
+-commutative97.1%
metadata-eval97.1%
unpow297.1%
hypot-undefine99.7%
Applied egg-rr99.7%
frac-times99.7%
*-un-lft-identity99.7%
Applied egg-rr99.7%
Final simplification97.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 (sqrt y_m)) (hypot 1.0 z))
(* x_m (* (sqrt y_m) (hypot 1.0 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) {
return y_s * (x_s * (((1.0 / sqrt(y_m)) / hypot(1.0, z)) / (x_m * (sqrt(y_m) * hypot(1.0, z)))));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
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.sqrt(y_m)) / Math.hypot(1.0, z)) / (x_m * (Math.sqrt(y_m) * Math.hypot(1.0, z)))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = 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.sqrt(y_m)) / math.hypot(1.0, z)) / (x_m * (math.sqrt(y_m) * math.hypot(1.0, z)))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = 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 / sqrt(y_m)) / hypot(1.0, z)) / Float64(x_m * Float64(sqrt(y_m) * hypot(1.0, z)))))) 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 / sqrt(y_m)) / hypot(1.0, z)) / (x_m * (sqrt(y_m) * hypot(1.0, z)))));
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[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(N[Sqrt[y$95$m], $MachinePrecision] * N[Sqrt[1.0 ^ 2 + z ^ 2], $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{\frac{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\right)}}{x\_m \cdot \left(\sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\right)\right)}\right)
\end{array}
Initial program 89.3%
associate-/l/89.1%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
associate-*r*91.0%
*-commutative91.0%
associate-/r*91.3%
*-commutative91.3%
associate-/l/91.4%
fma-undefine91.4%
+-commutative91.4%
associate-/r*89.3%
*-un-lft-identity89.3%
add-sqr-sqrt43.5%
times-frac43.5%
+-commutative43.5%
fma-undefine43.5%
*-commutative43.5%
sqrt-prod43.5%
fma-undefine43.5%
+-commutative43.5%
hypot-1-def43.5%
+-commutative43.5%
Applied egg-rr48.9%
associate-/l/48.9%
associate-*r/48.9%
*-rgt-identity48.9%
*-commutative48.9%
associate-/r*48.9%
*-commutative48.9%
Simplified48.9%
Final simplification48.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 (let* ((t_0 (* (sqrt y_m) (hypot 1.0 z)))) (* 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 = sqrt(y_m) * hypot(1.0, z);
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.sqrt(y_m) * Math.hypot(1.0, z);
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.sqrt(y_m) * math.hypot(1.0, z) 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(sqrt(y_m) * hypot(1.0, z)) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(t_0 * Float64(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 = sqrt(y_m) * hypot(1.0, z);
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[y$95$m], $MachinePrecision] * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(1.0 / N[(t$95$0 * N[(x$95$m * t$95$0), $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 := \sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\right)\\
y\_s \cdot \left(x\_s \cdot \frac{1}{t\_0 \cdot \left(x\_m \cdot t\_0\right)}\right)
\end{array}
\end{array}
Initial program 89.3%
associate-/l/89.1%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
associate-*r*91.0%
*-commutative91.0%
associate-/r*91.3%
*-commutative91.3%
associate-/l/91.4%
fma-undefine91.4%
+-commutative91.4%
associate-/r*89.3%
*-un-lft-identity89.3%
add-sqr-sqrt43.5%
times-frac43.5%
+-commutative43.5%
fma-undefine43.5%
*-commutative43.5%
sqrt-prod43.5%
fma-undefine43.5%
+-commutative43.5%
hypot-1-def43.5%
+-commutative43.5%
Applied egg-rr48.9%
associate-/l/48.9%
associate-*r/48.9%
*-rgt-identity48.9%
*-commutative48.9%
associate-/r*48.9%
*-commutative48.9%
Simplified48.9%
frac-2neg48.9%
div-inv48.9%
associate-/l/48.9%
distribute-neg-frac48.9%
metadata-eval48.9%
*-commutative48.9%
distribute-rgt-neg-in48.9%
Applied egg-rr48.9%
associate-*r/48.9%
*-rgt-identity48.9%
distribute-rgt-neg-out48.9%
*-commutative48.9%
distribute-neg-frac248.9%
associate-/l/48.9%
distribute-neg-frac48.9%
metadata-eval48.9%
*-commutative48.9%
*-commutative48.9%
Simplified48.9%
Final simplification48.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
(let* ((t_0 (* y_m (+ 1.0 (* z z)))))
(*
y_s
(*
x_s
(if (<= t_0 2e+301)
(/ (/ 1.0 x_m) t_0)
(/ 1.0 (* y_m (* x_m (pow z 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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 2e+301) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / (y_m * (x_m * pow(z, 2.0)));
}
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 <= 2d+301) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = 1.0d0 / (y_m * (x_m * (z ** 2.0d0)))
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 <= 2e+301) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / (y_m * (x_m * Math.pow(z, 2.0)));
}
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 <= 2e+301: tmp = (1.0 / x_m) / t_0 else: tmp = 1.0 / (y_m * (x_m * math.pow(z, 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) t_0 = Float64(y_m * Float64(1.0 + Float64(z * z))) tmp = 0.0 if (t_0 <= 2e+301) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(1.0 / Float64(y_m * Float64(x_m * (z ^ 2.0)))); 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 <= 2e+301)
tmp = (1.0 / x_m) / t_0;
else
tmp = 1.0 / (y_m * (x_m * (z ^ 2.0)));
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, 2e+301], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[Power[z, 2.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])\\
\\
\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 2 \cdot 10^{+301}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot {z}^{2}\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 2.00000000000000011e301Initial program 93.5%
if 2.00000000000000011e301 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 72.0%
associate-/l/72.0%
associate-*l*84.6%
*-commutative84.6%
sqr-neg84.6%
+-commutative84.6%
sqr-neg84.6%
fma-define84.6%
Simplified84.6%
Taylor expanded in z around inf 84.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
(if (<= (* z z) 5e+240)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(/ (/ (/ 1.0 x_m) z) (* y_m (hypot 1.0 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) <= 5e+240) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = ((1.0 / x_m) / z) / (y_m * hypot(1.0, 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) <= 5e+240) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(Float64(1.0 / x_m) / z) / Float64(y_m * hypot(1.0, z))); 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+240], 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 / x$95$m), $MachinePrecision] / z), $MachinePrecision] / N[(y$95$m * N[Sqrt[1.0 ^ 2 + z ^ 2], $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 5 \cdot 10^{+240}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{z}}{y\_m \cdot \mathsf{hypot}\left(1, z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.0000000000000003e240Initial program 95.4%
associate-/l/95.0%
associate-*l*95.9%
*-commutative95.9%
sqr-neg95.9%
+-commutative95.9%
sqr-neg95.9%
fma-define95.9%
Simplified95.9%
associate-*r*98.0%
*-commutative98.0%
*-commutative98.0%
add-sqr-sqrt55.6%
sqrt-div48.5%
metadata-eval48.5%
sqrt-prod48.5%
fma-undefine48.5%
+-commutative48.5%
hypot-1-def48.5%
sqrt-div48.5%
metadata-eval48.5%
sqrt-prod48.7%
fma-undefine48.7%
+-commutative48.7%
hypot-1-def48.7%
Applied egg-rr48.7%
unpow-148.7%
unpow-148.7%
pow-sqr48.9%
metadata-eval48.9%
Simplified48.9%
unpow-prod-down48.8%
sqrt-pow298.5%
*-commutative98.5%
metadata-eval98.5%
inv-pow98.5%
hypot-undefine98.5%
metadata-eval98.5%
unpow298.5%
sqrt-pow298.4%
+-commutative98.4%
unpow298.4%
fma-undefine98.4%
metadata-eval98.4%
inv-pow98.4%
associate-/r*98.5%
frac-times96.4%
*-un-lft-identity96.4%
Applied egg-rr96.4%
if 5.0000000000000003e240 < (*.f64 z z) Initial program 75.8%
associate-/l/75.8%
associate-*l*74.6%
*-commutative74.6%
sqr-neg74.6%
+-commutative74.6%
sqr-neg74.6%
fma-define74.6%
Simplified74.6%
clear-num74.6%
associate-*r*75.5%
*-commutative75.5%
*-commutative75.5%
associate-/r/75.5%
associate-/r*75.5%
Applied egg-rr75.5%
add-sqr-sqrt75.4%
associate-/l*75.4%
sqrt-div75.5%
metadata-eval75.5%
fma-undefine75.5%
unpow275.5%
+-commutative75.5%
metadata-eval75.5%
unpow275.5%
hypot-undefine75.5%
sqrt-div75.5%
metadata-eval75.5%
fma-undefine75.5%
unpow275.5%
+-commutative75.5%
metadata-eval75.5%
unpow275.5%
hypot-undefine91.1%
Applied egg-rr91.1%
*-commutative91.1%
div-inv91.1%
associate-/r*98.5%
associate-/l/96.2%
associate-/l/96.2%
Applied egg-rr96.2%
Taylor expanded in z around inf 84.0%
associate-/r*84.1%
Simplified84.1%
Final simplification92.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
(if (<= (* z z) 5e+260)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(/ (/ 1.0 (* (hypot 1.0 z) x_m)) (* y_m 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) <= 5e+260) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = (1.0 / (hypot(1.0, z) * x_m)) / (y_m * 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) <= 5e+260) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(1.0 / Float64(hypot(1.0, z) * x_m)) / Float64(y_m * z)); 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+260], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * z), $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 5 \cdot 10^{+260}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot x\_m}}{y\_m \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 4.9999999999999996e260Initial program 95.4%
associate-/l/95.1%
associate-*l*95.4%
*-commutative95.4%
sqr-neg95.4%
+-commutative95.4%
sqr-neg95.4%
fma-define95.4%
Simplified95.4%
associate-*r*98.0%
*-commutative98.0%
*-commutative98.0%
add-sqr-sqrt55.8%
sqrt-div48.8%
metadata-eval48.8%
sqrt-prod48.8%
fma-undefine48.8%
+-commutative48.8%
hypot-1-def48.8%
sqrt-div48.8%
metadata-eval48.8%
sqrt-prod49.0%
fma-undefine49.0%
+-commutative49.0%
hypot-1-def49.0%
Applied egg-rr49.0%
unpow-149.0%
unpow-149.0%
pow-sqr49.2%
metadata-eval49.2%
Simplified49.2%
unpow-prod-down49.1%
sqrt-pow298.5%
*-commutative98.5%
metadata-eval98.5%
inv-pow98.5%
hypot-undefine98.5%
metadata-eval98.5%
unpow298.5%
sqrt-pow298.5%
+-commutative98.5%
unpow298.5%
fma-undefine98.5%
metadata-eval98.5%
inv-pow98.5%
associate-/r*98.5%
frac-times95.9%
*-un-lft-identity95.9%
Applied egg-rr95.9%
if 4.9999999999999996e260 < (*.f64 z z) Initial program 74.8%
associate-/l/74.8%
associate-*l*74.8%
*-commutative74.8%
sqr-neg74.8%
+-commutative74.8%
sqr-neg74.8%
fma-define74.8%
Simplified74.8%
clear-num74.8%
associate-*r*74.5%
*-commutative74.5%
*-commutative74.5%
associate-/r/74.5%
associate-/r*74.5%
Applied egg-rr74.5%
add-sqr-sqrt74.5%
associate-/l*74.5%
sqrt-div74.5%
metadata-eval74.5%
fma-undefine74.5%
unpow274.5%
+-commutative74.5%
metadata-eval74.5%
unpow274.5%
hypot-undefine74.5%
sqrt-div74.5%
metadata-eval74.5%
fma-undefine74.5%
unpow274.5%
+-commutative74.5%
metadata-eval74.5%
unpow274.5%
hypot-undefine90.8%
Applied egg-rr90.8%
*-commutative90.8%
div-inv90.8%
associate-/r*98.5%
associate-/l/96.0%
associate-/l/96.0%
Applied egg-rr96.0%
Taylor expanded in z around inf 84.7%
Final simplification92.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
(if (<= z 430000000000.0)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(/ (/ 1.0 y_m) (* x_m (pow z 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 <= 430000000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) / (x_m * pow(z, 2.0));
}
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 <= 430000000000.0d0) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = (1.0d0 / y_m) / (x_m * (z ** 2.0d0))
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 <= 430000000000.0) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) / (x_m * Math.pow(z, 2.0));
}
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 <= 430000000000.0: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = (1.0 / y_m) / (x_m * math.pow(z, 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 (z <= 430000000000.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(x_m * (z ^ 2.0))); 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 <= 430000000000.0)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = (1.0 / y_m) / (x_m * (z ^ 2.0));
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, 430000000000.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[(x$95$m * N[Power[z, 2.0], $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 \leq 430000000000:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot {z}^{2}}\\
\end{array}\right)
\end{array}
if z < 4.3e11Initial program 93.2%
if 4.3e11 < z Initial program 78.4%
associate-/l/78.4%
associate-*l*80.9%
*-commutative80.9%
sqr-neg80.9%
+-commutative80.9%
sqr-neg80.9%
fma-define80.9%
Simplified80.9%
associate-*r*79.3%
*-commutative79.3%
*-commutative79.3%
add-sqr-sqrt64.2%
sqrt-div39.0%
metadata-eval39.0%
sqrt-prod39.0%
fma-undefine39.0%
+-commutative39.0%
hypot-1-def39.0%
sqrt-div39.0%
metadata-eval39.0%
sqrt-prod38.9%
fma-undefine38.9%
+-commutative38.9%
hypot-1-def41.8%
Applied egg-rr41.8%
unpow-141.8%
unpow-141.8%
pow-sqr41.9%
metadata-eval41.9%
Simplified41.9%
unpow-prod-down40.2%
sqrt-pow281.1%
*-commutative81.1%
metadata-eval81.1%
inv-pow81.1%
hypot-undefine79.9%
metadata-eval79.9%
unpow279.9%
sqrt-pow279.8%
+-commutative79.8%
unpow279.8%
fma-undefine79.8%
metadata-eval79.8%
inv-pow79.8%
associate-/r*79.8%
frac-times81.4%
*-un-lft-identity81.4%
Applied egg-rr81.4%
Taylor expanded in z around inf 81.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 (/ (/ 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(Float64(1.0 / 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[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $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{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\right)
\end{array}
Initial program 89.3%
associate-/l/89.1%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
associate-*r*91.0%
*-commutative91.0%
*-commutative91.0%
add-sqr-sqrt60.6%
sqrt-div45.8%
metadata-eval45.8%
sqrt-prod45.8%
fma-undefine45.8%
+-commutative45.8%
hypot-1-def45.8%
sqrt-div45.8%
metadata-eval45.8%
sqrt-prod45.9%
fma-undefine45.9%
+-commutative45.9%
hypot-1-def48.2%
Applied egg-rr48.2%
unpow-148.2%
unpow-148.2%
pow-sqr48.3%
metadata-eval48.3%
Simplified48.3%
unpow-prod-down46.7%
sqrt-pow292.0%
*-commutative92.0%
metadata-eval92.0%
inv-pow92.0%
hypot-undefine91.4%
metadata-eval91.4%
unpow291.4%
sqrt-pow291.3%
+-commutative91.3%
unpow291.3%
fma-undefine91.3%
metadata-eval91.3%
inv-pow91.3%
associate-/r*91.4%
frac-times89.6%
*-un-lft-identity89.6%
Applied egg-rr89.6%
Final simplification89.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 (* 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 89.3%
associate-/l/89.1%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
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 (+ 1.0 (* 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) {
return y_s * (x_s * ((1.0 / x_m) / (y_m * (1.0 + (z * z)))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z 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 * (1.0d0 + (z * z)))))
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 * (1.0 + (z * z)))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = 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 * (1.0 + (z * z)))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = 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) / Float64(y_m * Float64(1.0 + Float64(z * z)))))) 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 * (1.0 + (z * z)))));
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] / N[(y$95$m * N[(1.0 + 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 \frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\right)
\end{array}
Initial program 89.3%
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 89.3%
associate-/l/89.1%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
Taylor expanded in z around 0 56.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 2024100
(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)))))