
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 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 (/ (pow x_m -0.5) z)))
(*
y_s
(*
x_s
(if (<= (* z z) 5e+189)
(/ (/ 1.0 (/ (fma z z 1.0) (/ 1.0 x_m))) y_m)
(* t_0 (* t_0 (/ 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 t_0 = pow(x_m, -0.5) / z;
double tmp;
if ((z * z) <= 5e+189) {
tmp = (1.0 / (fma(z, z, 1.0) / (1.0 / x_m))) / y_m;
} else {
tmp = t_0 * (t_0 * (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) t_0 = Float64((x_m ^ -0.5) / z) tmp = 0.0 if (Float64(z * z) <= 5e+189) tmp = Float64(Float64(1.0 / Float64(fma(z, z, 1.0) / Float64(1.0 / x_m))) / y_m); else tmp = Float64(t_0 * Float64(t_0 * Float64(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_] := Block[{t$95$0 = N[(N[Power[x$95$m, -0.5], $MachinePrecision] / z), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+189], N[(N[(1.0 / N[(N[(z * z + 1.0), $MachinePrecision] / N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(t$95$0 * N[(t$95$0 * N[(1.0 / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{{x_m}^{-0.5}}{z}\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+189}:\\
\;\;\;\;\frac{\frac{1}{\frac{\mathsf{fma}\left(z, z, 1\right)}{\frac{1}{x_m}}}}{y_m}\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \left(t_0 \cdot \frac{1}{y_m}\right)\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 z z) < 5.0000000000000004e189Initial program 98.6%
associate-/l/98.6%
metadata-eval98.6%
associate-/r*98.6%
metadata-eval98.6%
neg-mul-198.6%
distribute-neg-frac98.6%
distribute-frac-neg98.6%
distribute-frac-neg98.6%
distribute-neg-frac98.6%
metadata-eval98.6%
neg-mul-198.6%
associate-/r*98.6%
metadata-eval98.6%
associate-/r*98.6%
sqr-neg98.6%
+-commutative98.6%
sqr-neg98.6%
fma-def98.6%
Simplified98.6%
/-rgt-identity98.6%
*-commutative98.6%
associate-/l*98.6%
Applied egg-rr98.6%
if 5.0000000000000004e189 < (*.f64 z z) Initial program 76.4%
associate-/l/77.1%
metadata-eval77.1%
associate-/r*77.1%
metadata-eval77.1%
neg-mul-177.1%
distribute-neg-frac77.1%
distribute-frac-neg77.1%
distribute-frac-neg77.1%
distribute-neg-frac77.1%
metadata-eval77.1%
neg-mul-177.1%
associate-/r*77.1%
metadata-eval77.1%
associate-/r*77.1%
sqr-neg77.1%
+-commutative77.1%
sqr-neg77.1%
fma-def77.1%
Simplified77.1%
Taylor expanded in z around inf 77.1%
div-inv77.1%
add-sqr-sqrt72.1%
associate-*l*72.1%
associate-/r*72.1%
sqrt-div42.8%
inv-pow42.8%
sqrt-pow142.8%
metadata-eval42.8%
unpow242.8%
sqrt-prod20.1%
add-sqr-sqrt37.9%
associate-/r*37.9%
sqrt-div37.9%
inv-pow37.9%
sqrt-pow137.9%
metadata-eval37.9%
unpow237.9%
sqrt-prod22.4%
add-sqr-sqrt53.6%
Applied egg-rr53.6%
Final simplification84.5%
x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x_m, y_m, and z 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)) (/ (/ 1.0 x_m) (hypot 1.0 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) {
return y_s * (x_s * (((1.0 / hypot(1.0, z)) * ((1.0 / x_m) / hypot(1.0, z))) / 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)) * ((1.0 / x_m) / Math.hypot(1.0, z))) / 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)) * ((1.0 / x_m) / math.hypot(1.0, z))) / 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 / hypot(1.0, z)) * Float64(Float64(1.0 / x_m) / hypot(1.0, z))) / 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)) * ((1.0 / x_m) / hypot(1.0, z))) / 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[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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 \frac{\frac{1}{x_m}}{\mathsf{hypot}\left(1, z\right)}}{y_m}\right)
\end{array}
Initial program 91.6%
associate-/l/91.9%
metadata-eval91.9%
associate-/r*91.9%
metadata-eval91.9%
neg-mul-191.9%
distribute-neg-frac91.9%
distribute-frac-neg91.9%
distribute-frac-neg91.9%
distribute-neg-frac91.9%
metadata-eval91.9%
neg-mul-191.9%
associate-/r*91.9%
metadata-eval91.9%
associate-/r*91.9%
sqr-neg91.9%
+-commutative91.9%
sqr-neg91.9%
fma-def91.9%
Simplified91.9%
associate-/r*91.9%
*-un-lft-identity91.9%
add-sqr-sqrt91.9%
times-frac91.9%
fma-udef91.9%
+-commutative91.9%
hypot-1-def91.9%
fma-udef91.9%
+-commutative91.9%
hypot-1-def95.3%
Applied egg-rr95.3%
Final simplification95.3%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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) 1000000000000.0)
(/ (/ (/ 1.0 y_m) x_m) (fma z z 1.0))
(/ (* (/ 1.0 (hypot 1.0 z)) (/ 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) {
double tmp;
if ((z * z) <= 1000000000000.0) {
tmp = ((1.0 / y_m) / x_m) / fma(z, z, 1.0);
} else {
tmp = ((1.0 / hypot(1.0, z)) * (1.0 / (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) <= 1000000000000.0) tmp = Float64(Float64(Float64(1.0 / y_m) / x_m) / fma(z, z, 1.0)); else tmp = Float64(Float64(Float64(1.0 / hypot(1.0, z)) * Float64(1.0 / 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], 1000000000000.0], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / 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 1000000000000:\\
\;\;\;\;\frac{\frac{\frac{1}{y_m}}{x_m}}{\mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{1}{z \cdot x_m}}{y_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e12Initial program 99.7%
associate-/r*99.0%
sqr-neg99.0%
+-commutative99.0%
sqr-neg99.0%
fma-def99.0%
Simplified99.0%
Taylor expanded in x around 0 99.0%
associate-/r*99.7%
*-commutative99.7%
+-commutative99.7%
unpow299.7%
fma-udef99.7%
associate-/l/99.7%
associate-/l/99.0%
associate-/r*99.7%
Simplified99.7%
if 1e12 < (*.f64 z z) Initial program 83.2%
associate-/l/83.7%
metadata-eval83.7%
associate-/r*83.7%
metadata-eval83.7%
neg-mul-183.7%
distribute-neg-frac83.7%
distribute-frac-neg83.7%
distribute-frac-neg83.7%
distribute-neg-frac83.7%
metadata-eval83.7%
neg-mul-183.7%
associate-/r*83.7%
metadata-eval83.7%
associate-/r*83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-def83.7%
Simplified83.7%
associate-/r*83.7%
*-un-lft-identity83.7%
add-sqr-sqrt83.7%
times-frac83.7%
fma-udef83.7%
+-commutative83.7%
hypot-1-def83.7%
fma-udef83.7%
+-commutative83.7%
hypot-1-def90.7%
Applied egg-rr90.7%
Taylor expanded in z around inf 68.6%
Final simplification84.5%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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+238)
(/ (/ 1.0 (/ (fma z z 1.0) (/ 1.0 x_m))) y_m)
(/ (/ 1.0 (* z x_m)) (* (hypot 1.0 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 * z) <= 5e+238) {
tmp = (1.0 / (fma(z, z, 1.0) / (1.0 / x_m))) / y_m;
} else {
tmp = (1.0 / (z * x_m)) / (hypot(1.0, 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 (Float64(z * z) <= 5e+238) tmp = Float64(Float64(1.0 / Float64(fma(z, z, 1.0) / Float64(1.0 / x_m))) / y_m); else tmp = Float64(Float64(1.0 / Float64(z * x_m)) / Float64(hypot(1.0, z) * 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], 5e+238], N[(N[(1.0 / N[(N[(z * z + 1.0), $MachinePrecision] / N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+238}:\\
\;\;\;\;\frac{\frac{1}{\frac{\mathsf{fma}\left(z, z, 1\right)}{\frac{1}{x_m}}}}{y_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z \cdot x_m}}{\mathsf{hypot}\left(1, z\right) \cdot y_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 4.99999999999999995e238Initial program 97.3%
associate-/l/97.6%
metadata-eval97.6%
associate-/r*97.6%
metadata-eval97.6%
neg-mul-197.6%
distribute-neg-frac97.6%
distribute-frac-neg97.6%
distribute-frac-neg97.6%
distribute-neg-frac97.6%
metadata-eval97.6%
neg-mul-197.6%
associate-/r*97.6%
metadata-eval97.6%
associate-/r*97.6%
sqr-neg97.6%
+-commutative97.6%
sqr-neg97.6%
fma-def97.6%
Simplified97.6%
/-rgt-identity97.6%
*-commutative97.6%
associate-/l*97.6%
Applied egg-rr97.6%
if 4.99999999999999995e238 < (*.f64 z z) Initial program 77.2%
associate-/l/77.2%
metadata-eval77.2%
associate-/r*77.2%
metadata-eval77.2%
neg-mul-177.2%
distribute-neg-frac77.2%
distribute-frac-neg77.2%
distribute-frac-neg77.2%
distribute-neg-frac77.2%
metadata-eval77.2%
neg-mul-177.2%
associate-/r*77.2%
metadata-eval77.2%
associate-/r*77.2%
sqr-neg77.2%
+-commutative77.2%
sqr-neg77.2%
fma-def77.2%
Simplified77.2%
associate-/r*77.2%
*-un-lft-identity77.2%
add-sqr-sqrt77.2%
times-frac77.2%
fma-udef77.2%
+-commutative77.2%
hypot-1-def77.2%
fma-udef77.2%
+-commutative77.2%
hypot-1-def89.4%
Applied egg-rr89.4%
Taylor expanded in z around inf 76.0%
expm1-log1p-u74.5%
expm1-udef73.0%
div-inv73.0%
associate-*l/73.0%
*-un-lft-identity73.0%
frac-times73.0%
associate-/r/73.0%
clear-num73.0%
associate-/r*73.0%
Applied egg-rr73.0%
expm1-def78.0%
expm1-log1p79.5%
associate-/r*79.5%
*-commutative79.5%
Simplified79.5%
Final simplification92.5%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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+238)
(/ (/ 1.0 (* x_m (fma z z 1.0))) y_m)
(/ (/ 1.0 (* z x_m)) (* (hypot 1.0 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 * z) <= 5e+238) {
tmp = (1.0 / (x_m * fma(z, z, 1.0))) / y_m;
} else {
tmp = (1.0 / (z * x_m)) / (hypot(1.0, 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 (Float64(z * z) <= 5e+238) tmp = Float64(Float64(1.0 / Float64(x_m * fma(z, z, 1.0))) / y_m); else tmp = Float64(Float64(1.0 / Float64(z * x_m)) / Float64(hypot(1.0, z) * 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], 5e+238], N[(N[(1.0 / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+238}:\\
\;\;\;\;\frac{\frac{1}{x_m \cdot \mathsf{fma}\left(z, z, 1\right)}}{y_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z \cdot x_m}}{\mathsf{hypot}\left(1, z\right) \cdot y_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 4.99999999999999995e238Initial program 97.3%
associate-/l/97.6%
metadata-eval97.6%
associate-/r*97.6%
metadata-eval97.6%
neg-mul-197.6%
distribute-neg-frac97.6%
distribute-frac-neg97.6%
distribute-frac-neg97.6%
distribute-neg-frac97.6%
metadata-eval97.6%
neg-mul-197.6%
associate-/r*97.6%
metadata-eval97.6%
associate-/r*97.6%
sqr-neg97.6%
+-commutative97.6%
sqr-neg97.6%
fma-def97.6%
Simplified97.6%
if 4.99999999999999995e238 < (*.f64 z z) Initial program 77.2%
associate-/l/77.2%
metadata-eval77.2%
associate-/r*77.2%
metadata-eval77.2%
neg-mul-177.2%
distribute-neg-frac77.2%
distribute-frac-neg77.2%
distribute-frac-neg77.2%
distribute-neg-frac77.2%
metadata-eval77.2%
neg-mul-177.2%
associate-/r*77.2%
metadata-eval77.2%
associate-/r*77.2%
sqr-neg77.2%
+-commutative77.2%
sqr-neg77.2%
fma-def77.2%
Simplified77.2%
associate-/r*77.2%
*-un-lft-identity77.2%
add-sqr-sqrt77.2%
times-frac77.2%
fma-udef77.2%
+-commutative77.2%
hypot-1-def77.2%
fma-udef77.2%
+-commutative77.2%
hypot-1-def89.4%
Applied egg-rr89.4%
Taylor expanded in z around inf 76.0%
expm1-log1p-u74.5%
expm1-udef73.0%
div-inv73.0%
associate-*l/73.0%
*-un-lft-identity73.0%
frac-times73.0%
associate-/r/73.0%
clear-num73.0%
associate-/r*73.0%
Applied egg-rr73.0%
expm1-def78.0%
expm1-log1p79.5%
associate-/r*79.5%
*-commutative79.5%
Simplified79.5%
Final simplification92.5%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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) 1000000000000.0)
(/ (/ (/ 1.0 y_m) x_m) (fma z z 1.0))
(/ (* (/ 1.0 z) (/ (/ 1.0 x_m) 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 * z) <= 1000000000000.0) {
tmp = ((1.0 / y_m) / x_m) / fma(z, z, 1.0);
} else {
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 (Float64(z * z) <= 1000000000000.0) tmp = Float64(Float64(Float64(1.0 / y_m) / x_m) / fma(z, z, 1.0)); else tmp = Float64(Float64(Float64(1.0 / z) * Float64(Float64(1.0 / x_m) / z)) / 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], 1000000000000.0], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / 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 \cdot z \leq 1000000000000:\\
\;\;\;\;\frac{\frac{\frac{1}{y_m}}{x_m}}{\mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z} \cdot \frac{\frac{1}{x_m}}{z}}{y_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e12Initial program 99.7%
associate-/r*99.0%
sqr-neg99.0%
+-commutative99.0%
sqr-neg99.0%
fma-def99.0%
Simplified99.0%
Taylor expanded in x around 0 99.0%
associate-/r*99.7%
*-commutative99.7%
+-commutative99.7%
unpow299.7%
fma-udef99.7%
associate-/l/99.7%
associate-/l/99.0%
associate-/r*99.7%
Simplified99.7%
if 1e12 < (*.f64 z z) Initial program 83.2%
associate-/l/83.7%
metadata-eval83.7%
associate-/r*83.7%
metadata-eval83.7%
neg-mul-183.7%
distribute-neg-frac83.7%
distribute-frac-neg83.7%
distribute-frac-neg83.7%
distribute-neg-frac83.7%
metadata-eval83.7%
neg-mul-183.7%
associate-/r*83.7%
metadata-eval83.7%
associate-/r*83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-def83.7%
Simplified83.7%
Taylor expanded in z around inf 83.7%
associate-/r*83.7%
*-un-lft-identity83.7%
unpow283.7%
times-frac90.7%
Applied egg-rr90.7%
Final simplification95.3%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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+33)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(/ (* (/ 1.0 z) (/ (/ 1.0 x_m) 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 * z) <= 2e+33) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 * z) <= 2d+33) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = ((1.0d0 / z) * ((1.0d0 / x_m) / 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 * z) <= 2e+33) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 * z) <= 2e+33: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = ((1.0 / z) * ((1.0 / x_m) / 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 (Float64(z * z) <= 2e+33) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(Float64(1.0 / z) * Float64(Float64(1.0 / x_m) / 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 * z) <= 2e+33)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = ((1.0 / z) * ((1.0 / x_m) / 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[N[(z * z), $MachinePrecision], 2e+33], 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[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / 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 \cdot z \leq 2 \cdot 10^{+33}:\\
\;\;\;\;\frac{\frac{1}{x_m}}{y_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z} \cdot \frac{\frac{1}{x_m}}{z}}{y_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.9999999999999999e33Initial program 99.7%
if 1.9999999999999999e33 < (*.f64 z z) Initial program 82.5%
associate-/l/83.1%
metadata-eval83.1%
associate-/r*83.1%
metadata-eval83.1%
neg-mul-183.1%
distribute-neg-frac83.1%
distribute-frac-neg83.1%
distribute-frac-neg83.1%
distribute-neg-frac83.1%
metadata-eval83.1%
neg-mul-183.1%
associate-/r*83.1%
metadata-eval83.1%
associate-/r*83.0%
sqr-neg83.0%
+-commutative83.0%
sqr-neg83.0%
fma-def83.0%
Simplified83.0%
Taylor expanded in z around inf 83.0%
associate-/r*83.1%
*-un-lft-identity83.1%
unpow283.1%
times-frac90.3%
Applied egg-rr90.3%
Final simplification95.3%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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 y_m) x_m)
(* (/ (/ 1.0 x_m) z) (/ (/ 1.0 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 / y_m) / x_m;
} else {
tmp = ((1.0 / x_m) / z) * ((1.0 / 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 / y_m) / x_m
else
tmp = ((1.0d0 / x_m) / z) * ((1.0d0 / 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 / y_m) / x_m;
} else {
tmp = ((1.0 / x_m) / z) * ((1.0 / 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 / y_m) / x_m else: tmp = ((1.0 / x_m) / z) * ((1.0 / 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 / y_m) / x_m); else tmp = Float64(Float64(Float64(1.0 / x_m) / z) * Float64(Float64(1.0 / 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 / y_m) / x_m;
else
tmp = ((1.0 / x_m) / z) * ((1.0 / 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 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / z), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x_m}}{z} \cdot \frac{\frac{1}{z}}{y_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.4%
associate-/r*93.0%
sqr-neg93.0%
+-commutative93.0%
sqr-neg93.0%
fma-def93.0%
Simplified93.0%
Taylor expanded in z around 0 71.9%
*-commutative71.9%
associate-/r*72.3%
Simplified72.3%
if 1 < z Initial program 85.4%
associate-/l/86.4%
metadata-eval86.4%
associate-/r*86.4%
metadata-eval86.4%
neg-mul-186.4%
distribute-neg-frac86.4%
distribute-frac-neg86.4%
distribute-frac-neg86.4%
distribute-neg-frac86.4%
metadata-eval86.4%
neg-mul-186.4%
associate-/r*86.4%
metadata-eval86.4%
associate-/r*86.4%
sqr-neg86.4%
+-commutative86.4%
sqr-neg86.4%
fma-def86.4%
Simplified86.4%
Taylor expanded in z around inf 85.5%
inv-pow85.5%
add-sqr-sqrt42.2%
unpow-prod-down42.3%
*-commutative42.3%
sqrt-prod42.3%
unpow242.3%
sqrt-prod42.3%
add-sqr-sqrt42.3%
*-commutative42.3%
sqrt-prod42.3%
unpow242.3%
sqrt-prod45.6%
add-sqr-sqrt45.6%
Applied egg-rr45.6%
pow-sqr45.5%
metadata-eval45.5%
Simplified45.5%
*-commutative45.5%
unpow-prod-down42.3%
sqrt-pow285.4%
metadata-eval85.4%
inv-pow85.4%
Applied egg-rr85.4%
associate-*l/85.5%
*-lft-identity85.5%
Simplified85.5%
associate-/l/88.7%
add-sqr-sqrt88.6%
times-frac86.9%
sqrt-pow186.9%
metadata-eval86.9%
unpow-186.9%
sqrt-pow196.8%
metadata-eval96.8%
unpow-196.8%
associate-/r*96.1%
associate-/l/96.8%
Applied egg-rr96.8%
Final simplification77.8%
x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x_m, y_m, and z 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 y_m) x_m)
(/ (* (/ 1.0 z) (/ (/ 1.0 x_m) 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 / y_m) / x_m;
} else {
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 / y_m) / x_m
else
tmp = ((1.0d0 / z) * ((1.0d0 / x_m) / 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 / y_m) / x_m;
} else {
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 / y_m) / x_m else: tmp = ((1.0 / z) * ((1.0 / x_m) / 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 / y_m) / x_m); else tmp = Float64(Float64(Float64(1.0 / z) * Float64(Float64(1.0 / x_m) / 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 / y_m) / x_m;
else
tmp = ((1.0 / z) * ((1.0 / x_m) / 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 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / 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}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z} \cdot \frac{\frac{1}{x_m}}{z}}{y_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.4%
associate-/r*93.0%
sqr-neg93.0%
+-commutative93.0%
sqr-neg93.0%
fma-def93.0%
Simplified93.0%
Taylor expanded in z around 0 71.9%
*-commutative71.9%
associate-/r*72.3%
Simplified72.3%
if 1 < z Initial program 85.4%
associate-/l/86.4%
metadata-eval86.4%
associate-/r*86.4%
metadata-eval86.4%
neg-mul-186.4%
distribute-neg-frac86.4%
distribute-frac-neg86.4%
distribute-frac-neg86.4%
distribute-neg-frac86.4%
metadata-eval86.4%
neg-mul-186.4%
associate-/r*86.4%
metadata-eval86.4%
associate-/r*86.4%
sqr-neg86.4%
+-commutative86.4%
sqr-neg86.4%
fma-def86.4%
Simplified86.4%
Taylor expanded in z around inf 85.5%
associate-/r*85.4%
*-un-lft-identity85.4%
unpow285.4%
times-frac90.8%
Applied egg-rr90.8%
Final simplification76.4%
x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x_m, y_m, and z 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 y_m) x_m) (/ 1.0 (* x_m (* 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 / y_m) / x_m;
} else {
tmp = 1.0 / (x_m * (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 / y_m) / x_m
else
tmp = 1.0d0 / (x_m * (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 / y_m) / x_m;
} else {
tmp = 1.0 / (x_m * (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 / y_m) / x_m else: tmp = 1.0 / (x_m * (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 / y_m) / x_m); else tmp = Float64(1.0 / Float64(x_m * Float64(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 / y_m) / x_m;
else
tmp = 1.0 / (x_m * (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 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y_m}}{x_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x_m \cdot \left(z \cdot y_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.4%
associate-/r*93.0%
sqr-neg93.0%
+-commutative93.0%
sqr-neg93.0%
fma-def93.0%
Simplified93.0%
Taylor expanded in z around 0 71.9%
*-commutative71.9%
associate-/r*72.3%
Simplified72.3%
if 1 < z Initial program 85.4%
associate-/l/86.4%
metadata-eval86.4%
associate-/r*86.4%
metadata-eval86.4%
neg-mul-186.4%
distribute-neg-frac86.4%
distribute-frac-neg86.4%
distribute-frac-neg86.4%
distribute-neg-frac86.4%
metadata-eval86.4%
neg-mul-186.4%
associate-/r*86.4%
metadata-eval86.4%
associate-/r*86.4%
sqr-neg86.4%
+-commutative86.4%
sqr-neg86.4%
fma-def86.4%
Simplified86.4%
associate-/r*86.4%
*-un-lft-identity86.4%
add-sqr-sqrt86.4%
times-frac86.4%
fma-udef86.4%
+-commutative86.4%
hypot-1-def86.4%
fma-udef86.4%
+-commutative86.4%
hypot-1-def91.8%
Applied egg-rr91.8%
Taylor expanded in z around inf 91.0%
Taylor expanded in z around 0 41.5%
Final simplification65.4%
x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
end function
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (1.0 / (x_m * y_m)))
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m)))) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \frac{1}{x_m \cdot y_m}\right)
\end{array}
Initial program 91.6%
associate-/r*91.3%
sqr-neg91.3%
+-commutative91.3%
sqr-neg91.3%
fma-def91.3%
Simplified91.3%
Taylor expanded in z around 0 59.9%
Final simplification59.9%
x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 x_m) y_m))))
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / x_m) / y_m));
}
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * ((1.0d0 / x_m) / y_m))
end function
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / x_m) / y_m));
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / x_m) / y_m))
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / x_m) / y_m))) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / x_m) / y_m));
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \frac{\frac{1}{x_m}}{y_m}\right)
\end{array}
Initial program 91.6%
associate-/l/91.9%
metadata-eval91.9%
associate-/r*91.9%
metadata-eval91.9%
neg-mul-191.9%
distribute-neg-frac91.9%
distribute-frac-neg91.9%
distribute-frac-neg91.9%
distribute-neg-frac91.9%
metadata-eval91.9%
neg-mul-191.9%
associate-/r*91.9%
metadata-eval91.9%
associate-/r*91.9%
sqr-neg91.9%
+-commutative91.9%
sqr-neg91.9%
fma-def91.9%
Simplified91.9%
Taylor expanded in z around 0 60.2%
Final simplification60.2%
x_m = (fabs.f64 x) x_s = (copysign.f64 1 x) y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 y_m) x_m))))
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * ((1.0d0 / y_m) / x_m))
end function
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / y_m) / x_m))
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / y_m) / x_m))) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / y_m) / x_m));
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y_s \cdot \left(x_s \cdot \frac{\frac{1}{y_m}}{x_m}\right)
\end{array}
Initial program 91.6%
associate-/r*91.3%
sqr-neg91.3%
+-commutative91.3%
sqr-neg91.3%
fma-def91.3%
Simplified91.3%
Taylor expanded in z around 0 59.9%
*-commutative59.9%
associate-/r*60.2%
Simplified60.2%
Final simplification60.2%
(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 2024010
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:herbie-target
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))