
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
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) 1e+86)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(/ (/ (pow y_m -0.5) z) (* (sqrt y_m) (* z x_m)))))))x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+86) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = (pow(y_m, -0.5) / z) / (sqrt(y_m) * (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+86) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64((y_m ^ -0.5) / z) / Float64(sqrt(y_m) * Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+86], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[y$95$m, -0.5], $MachinePrecision] / z), $MachinePrecision] / N[(N[Sqrt[y$95$m], $MachinePrecision] * N[(z * 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}\;z \cdot z \leq 10^{+86}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{y\_m}^{-0.5}}{z}}{\sqrt{y\_m} \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e86Initial program 99.7%
+-commutative99.7%
distribute-lft-in99.6%
associate-*r*99.6%
*-rgt-identity99.6%
fma-define99.7%
Applied egg-rr99.7%
if 1e86 < (*.f64 z z) Initial program 79.1%
associate-/l/79.1%
associate-*l*77.4%
*-commutative77.4%
sqr-neg77.4%
+-commutative77.4%
sqr-neg77.4%
fma-define77.4%
Simplified77.4%
associate-*r*75.9%
*-commutative75.9%
associate-/r*75.0%
*-commutative75.0%
associate-/l/75.0%
fma-undefine75.0%
+-commutative75.0%
associate-/r*79.1%
*-un-lft-identity79.1%
add-sqr-sqrt32.9%
times-frac33.0%
+-commutative33.0%
fma-undefine33.0%
*-commutative33.0%
sqrt-prod33.0%
fma-undefine33.0%
+-commutative33.0%
hypot-1-def33.0%
+-commutative33.0%
Applied egg-rr40.2%
associate-/l/40.2%
associate-*r/40.3%
*-rgt-identity40.3%
*-commutative40.3%
Simplified40.3%
Taylor expanded in z around inf 30.9%
associate-*r/31.0%
*-rgt-identity31.0%
Simplified31.0%
Taylor expanded in z around inf 38.5%
Taylor expanded in z around 0 38.4%
associate-*r/38.5%
*-rgt-identity38.5%
unpow1/238.5%
exp-to-pow37.6%
log-rec37.6%
distribute-lft-neg-out37.6%
distribute-rgt-neg-in37.6%
metadata-eval37.6%
exp-to-pow38.5%
Simplified38.5%
Final simplification74.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
(/
(/ (/ (/ 1.0 (* (hypot 1.0 z) (sqrt y_m))) x_m) (hypot 1.0 z))
(sqrt 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) * sqrt(y_m))) / x_m) / hypot(1.0, z)) / sqrt(y_m)));
}
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((((1.0 / (Math.hypot(1.0, z) * Math.sqrt(y_m))) / x_m) / Math.hypot(1.0, z)) / Math.sqrt(y_m)));
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((((1.0 / (math.hypot(1.0, z) * math.sqrt(y_m))) / x_m) / math.hypot(1.0, z)) / math.sqrt(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(Float64(1.0 / Float64(hypot(1.0, z) * sqrt(y_m))) / x_m) / hypot(1.0, z)) / sqrt(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) * sqrt(y_m))) / x_m) / hypot(1.0, z)) / sqrt(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[(N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[Sqrt[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{\frac{\frac{\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}}}{x\_m}}{\mathsf{hypot}\left(1, z\right)}}{\sqrt{y\_m}}\right)
\end{array}
Initial program 91.3%
associate-/l/91.2%
associate-*l*90.5%
*-commutative90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-define90.5%
Simplified90.5%
associate-*r*89.2%
*-commutative89.2%
*-commutative89.2%
add-sqr-sqrt63.0%
sqrt-div47.4%
metadata-eval47.4%
sqrt-prod47.4%
fma-undefine47.4%
+-commutative47.4%
hypot-1-def47.4%
sqrt-div47.3%
metadata-eval47.3%
sqrt-prod47.3%
fma-undefine47.3%
+-commutative47.3%
hypot-1-def49.1%
Applied egg-rr49.1%
unpow-149.1%
unpow-149.1%
pow-sqr49.1%
metadata-eval49.1%
Simplified49.1%
metadata-eval49.1%
pow-prod-up49.1%
pow-prod-down48.9%
Applied egg-rr47.5%
Final simplification47.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 (let* ((t_0 (* (hypot 1.0 z) (sqrt y_m)))) (* y_s (* x_s (/ (/ 1.0 t_0) (* t_0 x_m))))))
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = hypot(1.0, z) * sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) / (t_0 * x_m)));
}
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
return y_s * (x_s * ((1.0 / t_0) / (t_0 * x_m)));
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = math.hypot(1.0, z) * math.sqrt(y_m) return y_s * (x_s * ((1.0 / t_0) / (t_0 * x_m)))
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(hypot(1.0, z) * sqrt(y_m)) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / t_0) / Float64(t_0 * x_m)))) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
t_0 = hypot(1.0, z) * sqrt(y_m);
tmp = y_s * (x_s * ((1.0 / t_0) / (t_0 * x_m)));
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * N[(N[(1.0 / t$95$0), $MachinePrecision] / N[(t$95$0 * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
x_s = \mathsf{copysign}\left(1, x\right)
\\
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{t\_0}}{t\_0 \cdot x\_m}\right)
\end{array}
\end{array}
Initial program 91.3%
associate-/l/91.2%
associate-*l*90.5%
*-commutative90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-define90.5%
Simplified90.5%
associate-*r*89.2%
*-commutative89.2%
associate-/r*88.9%
*-commutative88.9%
associate-/l/88.9%
fma-undefine88.9%
+-commutative88.9%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt45.2%
times-frac45.2%
+-commutative45.2%
fma-undefine45.2%
*-commutative45.2%
sqrt-prod45.2%
fma-undefine45.2%
+-commutative45.2%
hypot-1-def45.2%
+-commutative45.2%
Applied egg-rr48.1%
associate-/l/48.1%
associate-*r/48.1%
*-rgt-identity48.1%
*-commutative48.1%
Simplified48.1%
Final simplification48.1%
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) (* (hypot 1.0 z) (* (hypot 1.0 z) x_m))))))
x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / (hypot(1.0, z) * (hypot(1.0, z) * x_m))));
}
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / (Math.hypot(1.0, z) * (Math.hypot(1.0, z) * 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) / (math.hypot(1.0, z) * (math.hypot(1.0, z) * 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) / Float64(hypot(1.0, z) * Float64(hypot(1.0, z) * 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) / (hypot(1.0, z) * (hypot(1.0, z) * 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] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * 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 \frac{\frac{1}{y\_m}}{\mathsf{hypot}\left(1, z\right) \cdot \left(\mathsf{hypot}\left(1, z\right) \cdot x\_m\right)}\right)
\end{array}
Initial program 91.3%
associate-/l/91.2%
associate-*l*90.5%
*-commutative90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-define90.5%
Simplified90.5%
associate-*r*89.2%
*-commutative89.2%
*-commutative89.2%
add-sqr-sqrt63.0%
sqrt-div47.4%
metadata-eval47.4%
sqrt-prod47.4%
fma-undefine47.4%
+-commutative47.4%
hypot-1-def47.4%
sqrt-div47.3%
metadata-eval47.3%
sqrt-prod47.3%
fma-undefine47.3%
+-commutative47.3%
hypot-1-def49.1%
Applied egg-rr49.1%
unpow-149.1%
unpow-149.1%
pow-sqr49.1%
metadata-eval49.1%
Simplified49.1%
metadata-eval49.1%
pow-prod-up49.1%
pow-prod-down48.9%
Applied egg-rr47.5%
associate-/r*48.2%
div-inv48.1%
*-commutative48.1%
associate-/r*48.1%
pow1/248.1%
pow-flip48.2%
metadata-eval48.2%
*-commutative48.2%
associate-/r*48.2%
pow1/248.2%
pow-flip48.1%
metadata-eval48.1%
Applied egg-rr48.1%
times-frac47.3%
*-commutative47.3%
associate-*l/47.4%
associate-/l/47.4%
associate-*l/47.4%
pow-sqr95.8%
metadata-eval95.8%
unpow-195.8%
*-commutative95.8%
Simplified95.8%
Final simplification95.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 (<= (* y_m (+ 1.0 (* z z))) 1e+308)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(/ (/ 1.0 y_m) (* (hypot 1.0 z) (* z x_m)))))))x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * (1.0 + (z * z))) <= 1e+308) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = (1.0 / y_m) / (hypot(1.0, z) * (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= 1e+308) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64(1.0 / y_m) / Float64(hypot(1.0, z) * Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+308], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(z * 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 \cdot \left(1 + z \cdot z\right) \leq 10^{+308}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{\mathsf{hypot}\left(1, z\right) \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 1e308Initial program 93.5%
+-commutative93.5%
distribute-lft-in93.5%
associate-*r*96.3%
*-rgt-identity96.3%
fma-define96.3%
Applied egg-rr96.3%
if 1e308 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 75.4%
associate-/l/75.4%
associate-*l*75.4%
*-commutative75.4%
sqr-neg75.4%
+-commutative75.4%
sqr-neg75.4%
fma-define75.4%
Simplified75.4%
associate-*r*75.1%
*-commutative75.1%
*-commutative75.1%
add-sqr-sqrt75.1%
sqrt-div35.8%
metadata-eval35.8%
sqrt-prod35.8%
fma-undefine35.8%
+-commutative35.8%
hypot-1-def35.8%
sqrt-div35.8%
metadata-eval35.8%
sqrt-prod35.8%
fma-undefine35.8%
+-commutative35.8%
hypot-1-def42.1%
Applied egg-rr42.1%
unpow-142.1%
unpow-142.1%
pow-sqr42.0%
metadata-eval42.0%
Simplified42.0%
metadata-eval42.0%
pow-prod-up42.1%
pow-prod-down42.0%
Applied egg-rr99.8%
associate-/r*99.8%
div-inv99.7%
*-commutative99.7%
associate-/r*99.7%
pow1/299.7%
pow-flip99.7%
metadata-eval99.7%
*-commutative99.7%
associate-/r*99.8%
pow1/299.8%
pow-flip99.7%
metadata-eval99.7%
Applied egg-rr99.7%
times-frac98.4%
*-commutative98.4%
associate-*l/99.8%
associate-/l/99.7%
associate-*l/99.8%
pow-sqr99.8%
metadata-eval99.8%
unpow-199.8%
*-commutative99.8%
Simplified99.8%
Taylor expanded in z around inf 87.4%
Final simplification95.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
(if (<= (* z z) 1e+86)
(/ (/ 1.0 x_m) (fma (* z y_m) z y_m))
(* (/ 1.0 y_m) (/ (/ 1.0 z) (* z x_m)))))))x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+86) {
tmp = (1.0 / x_m) / fma((z * y_m), z, y_m);
} else {
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+86) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / z) / Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+86], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(z * 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}\;z \cdot z \leq 10^{+86}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1e86Initial program 99.7%
+-commutative99.7%
distribute-lft-in99.6%
associate-*r*99.6%
*-rgt-identity99.6%
fma-define99.7%
Applied egg-rr99.7%
if 1e86 < (*.f64 z z) Initial program 79.1%
associate-/l/79.1%
associate-*l*77.4%
*-commutative77.4%
sqr-neg77.4%
+-commutative77.4%
sqr-neg77.4%
fma-define77.4%
Simplified77.4%
associate-*r*75.9%
*-commutative75.9%
associate-/r*75.0%
*-commutative75.0%
associate-/l/75.0%
fma-undefine75.0%
+-commutative75.0%
associate-/r*79.1%
*-un-lft-identity79.1%
add-sqr-sqrt32.9%
times-frac33.0%
+-commutative33.0%
fma-undefine33.0%
*-commutative33.0%
sqrt-prod33.0%
fma-undefine33.0%
+-commutative33.0%
hypot-1-def33.0%
+-commutative33.0%
Applied egg-rr40.2%
associate-/l/40.2%
associate-*r/40.3%
*-rgt-identity40.3%
*-commutative40.3%
Simplified40.3%
Taylor expanded in z around inf 30.9%
associate-*r/31.0%
*-rgt-identity31.0%
Simplified31.0%
Taylor expanded in z around inf 38.5%
div-inv38.4%
*-commutative38.4%
times-frac38.4%
un-div-inv38.4%
metadata-eval38.4%
sqrt-div38.4%
add-sqr-sqrt90.0%
Applied egg-rr90.0%
Final simplification95.7%
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+83)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(* (/ 1.0 y_m) (/ (/ 1.0 z) (* z x_m)))))))x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+83) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d+83) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = (1.0d0 / y_m) * ((1.0d0 / z) / (z * x_m))
end if
code = y_s * (x_s * tmp)
end function
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+83) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 5e+83: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m)) return y_s * (x_s * tmp)
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 5e+83) 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(Float64(1.0 / z) / Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 5e+83)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+83], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(z * 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}\;z \cdot z \leq 5 \cdot 10^{+83}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.00000000000000029e83Initial program 99.7%
if 5.00000000000000029e83 < (*.f64 z z) Initial program 79.3%
associate-/l/79.3%
associate-*l*77.6%
*-commutative77.6%
sqr-neg77.6%
+-commutative77.6%
sqr-neg77.6%
fma-define77.6%
Simplified77.6%
associate-*r*76.1%
*-commutative76.1%
associate-/r*75.2%
*-commutative75.2%
associate-/l/75.2%
fma-undefine75.2%
+-commutative75.2%
associate-/r*79.3%
*-un-lft-identity79.3%
add-sqr-sqrt33.6%
times-frac33.6%
+-commutative33.6%
fma-undefine33.6%
*-commutative33.6%
sqrt-prod33.6%
fma-undefine33.6%
+-commutative33.6%
hypot-1-def33.6%
+-commutative33.6%
Applied egg-rr40.8%
associate-/l/40.8%
associate-*r/40.8%
*-rgt-identity40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in z around inf 31.6%
associate-*r/31.6%
*-rgt-identity31.6%
Simplified31.6%
Taylor expanded in z around inf 39.0%
div-inv39.0%
*-commutative39.0%
times-frac39.0%
un-div-inv39.0%
metadata-eval39.0%
sqrt-div39.0%
add-sqr-sqrt90.1%
Applied egg-rr90.1%
Final simplification95.7%
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 y_m) (/ (/ 1.0 z) (* z x_m)))))))x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (z <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = (1.0d0 / y_m) * ((1.0d0 / z) / (z * x_m))
end if
code = y_s * (x_s * tmp)
end function
x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
}
return y_s * (x_s * tmp);
}
x_m = math.fabs(x) x_s = math.copysign(1.0, x) y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if z <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m)) return y_s * (x_s * tmp)
x_m = abs(x) x_s = copysign(1.0, x) y_m = abs(y) y_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / z) / Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (z <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = (1.0 / y_m) * ((1.0 / z) / (z * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / z), $MachinePrecision] / N[(z * 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}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 93.3%
associate-/l/93.2%
associate-*l*92.3%
*-commutative92.3%
sqr-neg92.3%
+-commutative92.3%
sqr-neg92.3%
fma-define92.3%
Simplified92.3%
Taylor expanded in z around 0 70.3%
add-sqr-sqrt47.2%
pow247.2%
inv-pow47.2%
sqrt-pow147.2%
*-commutative47.2%
metadata-eval47.2%
Applied egg-rr47.2%
pow-pow70.3%
metadata-eval70.3%
inv-pow70.3%
*-commutative70.3%
associate-/r*70.1%
Applied egg-rr70.1%
if 1 < z Initial program 83.5%
associate-/l/83.6%
associate-*l*83.7%
*-commutative83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-define83.7%
Simplified83.7%
associate-*r*79.4%
*-commutative79.4%
associate-/r*77.9%
*-commutative77.9%
associate-/l/77.9%
fma-undefine77.9%
+-commutative77.9%
associate-/r*83.5%
*-un-lft-identity83.5%
add-sqr-sqrt34.1%
times-frac34.2%
+-commutative34.2%
fma-undefine34.2%
*-commutative34.2%
sqrt-prod34.3%
fma-undefine34.3%
+-commutative34.3%
hypot-1-def34.3%
+-commutative34.3%
Applied egg-rr41.3%
associate-/l/41.3%
associate-*r/41.4%
*-rgt-identity41.4%
*-commutative41.4%
Simplified41.4%
Taylor expanded in z around inf 41.3%
associate-*r/41.4%
*-rgt-identity41.4%
Simplified41.4%
Taylor expanded in z around inf 41.3%
div-inv41.3%
*-commutative41.3%
times-frac41.3%
un-div-inv41.3%
metadata-eval41.3%
sqrt-div41.3%
add-sqr-sqrt94.3%
Applied egg-rr94.3%
Final simplification75.1%
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.3%
associate-/l/93.2%
associate-*l*92.3%
*-commutative92.3%
sqr-neg92.3%
+-commutative92.3%
sqr-neg92.3%
fma-define92.3%
Simplified92.3%
Taylor expanded in z around 0 70.3%
add-sqr-sqrt47.2%
pow247.2%
inv-pow47.2%
sqrt-pow147.2%
*-commutative47.2%
metadata-eval47.2%
Applied egg-rr47.2%
pow-pow70.3%
metadata-eval70.3%
inv-pow70.3%
*-commutative70.3%
associate-/r*70.1%
Applied egg-rr70.1%
if 1 < z Initial program 83.5%
associate-/l/83.6%
associate-*l*83.7%
*-commutative83.7%
sqr-neg83.7%
+-commutative83.7%
sqr-neg83.7%
fma-define83.7%
Simplified83.7%
associate-*r*79.4%
*-commutative79.4%
associate-/r*77.9%
*-commutative77.9%
associate-/l/77.9%
fma-undefine77.9%
+-commutative77.9%
associate-/r*83.5%
*-un-lft-identity83.5%
add-sqr-sqrt34.1%
times-frac34.2%
+-commutative34.2%
fma-undefine34.2%
*-commutative34.2%
sqrt-prod34.3%
fma-undefine34.3%
+-commutative34.3%
hypot-1-def34.3%
+-commutative34.3%
Applied egg-rr41.3%
associate-/l/41.3%
associate-*r/41.4%
*-rgt-identity41.4%
*-commutative41.4%
Simplified41.4%
Taylor expanded in z around inf 41.3%
associate-*r/41.4%
*-rgt-identity41.4%
Simplified41.4%
Taylor expanded in z around 0 32.3%
Final simplification62.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 (/ 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 91.3%
associate-/l/91.2%
associate-*l*90.5%
*-commutative90.5%
sqr-neg90.5%
+-commutative90.5%
sqr-neg90.5%
fma-define90.5%
Simplified90.5%
Taylor expanded in z around 0 58.5%
Final simplification58.5%
(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 2024039
(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)))))