
(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 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ (/ 1.0 (* (hypot 1.0 z) 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) * 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) * 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) * 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 / Float64(hypot(1.0, z) * 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) * 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[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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{\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot x\_m}}{\mathsf{hypot}\left(1, z\right)}}{y\_m}\right)
\end{array}
Initial program 88.7%
associate-/l/88.5%
remove-double-neg88.5%
distribute-rgt-neg-out88.5%
distribute-rgt-neg-out88.5%
remove-double-neg88.5%
associate-*l*88.8%
*-commutative88.8%
sqr-neg88.8%
+-commutative88.8%
sqr-neg88.8%
fma-define88.8%
Simplified88.8%
*-commutative88.8%
associate-*r*88.5%
fma-undefine88.5%
+-commutative88.5%
associate-/l/88.7%
add-sqr-sqrt45.3%
*-un-lft-identity45.3%
times-frac45.2%
+-commutative45.2%
fma-undefine45.2%
*-commutative45.2%
sqrt-prod45.3%
fma-undefine45.3%
+-commutative45.3%
hypot-1-def45.3%
+-commutative45.3%
Applied egg-rr49.3%
associate-/r*49.2%
associate-/r*48.9%
frac-times47.6%
associate-/l/47.7%
add-sqr-sqrt95.8%
Applied egg-rr95.8%
associate-*l/95.9%
*-un-lft-identity95.9%
Applied egg-rr95.9%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* y_m (+ 1.0 (* z z))) 4e+303)
(/ 1.0 (* y_m (* x_m (fma z z 1.0))))
(* (/ 1.0 z) (/ 1.0 (* 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 ((y_m * (1.0 + (z * z))) <= 4e+303) {
tmp = 1.0 / (y_m * (x_m * fma(z, z, 1.0)));
} else {
tmp = (1.0 / z) * (1.0 / (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(y_m * Float64(1.0 + Float64(z * z))) <= 4e+303) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.0)))); else tmp = Float64(Float64(1.0 / z) * Float64(1.0 / Float64(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[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e+303], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(1 + z \cdot z\right) \leq 4 \cdot 10^{+303}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{1}{y\_m \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 4e303Initial program 91.6%
associate-/l/91.4%
remove-double-neg91.4%
distribute-rgt-neg-out91.4%
distribute-rgt-neg-out91.4%
remove-double-neg91.4%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
if 4e303 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 71.0%
associate-/l/71.0%
remove-double-neg71.0%
distribute-rgt-neg-out71.0%
distribute-rgt-neg-out71.0%
remove-double-neg71.0%
associate-*l*76.0%
*-commutative76.0%
sqr-neg76.0%
+-commutative76.0%
sqr-neg76.0%
fma-define76.0%
Simplified76.0%
Taylor expanded in z around inf 71.0%
associate-/r*71.0%
associate-/r*75.7%
Simplified75.7%
unpow275.7%
Applied egg-rr75.7%
frac-2neg75.7%
distribute-frac-neg75.7%
distribute-neg-frac275.7%
associate-/l/75.7%
distribute-neg-frac75.7%
metadata-eval75.7%
*-commutative75.7%
Applied egg-rr75.7%
div-inv75.7%
distribute-neg-frac75.7%
metadata-eval75.7%
pow275.7%
pow-flip75.7%
metadata-eval75.7%
associate-*l/75.7%
*-un-lft-identity75.7%
sqr-pow75.7%
associate-/l*91.6%
metadata-eval91.6%
inv-pow91.6%
*-commutative91.6%
associate-/l/99.6%
metadata-eval99.6%
inv-pow99.6%
associate-/r*99.8%
associate-/l/99.7%
Applied egg-rr99.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 4e+90)
(/ 1.0 (* (fma z z 1.0) (* x_m y_m)))
(/ (/ (/ (/ 1.0 x_m) (hypot 1.0 z)) z) y_m)))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 4e+90) {
tmp = 1.0 / (fma(z, z, 1.0) * (x_m * y_m));
} else {
tmp = (((1.0 / x_m) / hypot(1.0, z)) / z) / y_m;
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 4e+90) tmp = Float64(1.0 / Float64(fma(z, z, 1.0) * Float64(x_m * y_m))); else tmp = Float64(Float64(Float64(Float64(1.0 / x_m) / hypot(1.0, z)) / 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], 4e+90], N[(1.0 / N[(N[(z * z + 1.0), $MachinePrecision] * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / z), $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 4 \cdot 10^{+90}:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(z, z, 1\right) \cdot \left(x\_m \cdot y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{x\_m}}{\mathsf{hypot}\left(1, z\right)}}{z}}{y\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 3.99999999999999987e90Initial program 98.9%
remove-double-neg98.9%
distribute-lft-neg-out98.9%
distribute-rgt-neg-in98.9%
associate-/r*99.6%
associate-/l/99.7%
associate-/l/99.7%
distribute-lft-neg-out99.7%
distribute-rgt-neg-in99.7%
distribute-lft-neg-in99.7%
remove-double-neg99.7%
sqr-neg99.7%
+-commutative99.7%
sqr-neg99.7%
fma-define99.7%
*-commutative99.7%
Simplified99.7%
if 3.99999999999999987e90 < (*.f64 z z) Initial program 76.7%
associate-/l/76.2%
remove-double-neg76.2%
distribute-rgt-neg-out76.2%
distribute-rgt-neg-out76.2%
remove-double-neg76.2%
associate-*l*76.1%
*-commutative76.1%
sqr-neg76.1%
+-commutative76.1%
sqr-neg76.1%
fma-define76.1%
Simplified76.1%
*-commutative76.1%
associate-*r*76.2%
fma-undefine76.2%
+-commutative76.2%
associate-/l/76.7%
add-sqr-sqrt33.4%
*-un-lft-identity33.4%
times-frac33.4%
+-commutative33.4%
fma-undefine33.4%
*-commutative33.4%
sqrt-prod33.5%
fma-undefine33.5%
+-commutative33.5%
hypot-1-def33.5%
+-commutative33.5%
Applied egg-rr42.1%
associate-/r*42.1%
associate-/r*41.3%
frac-times38.6%
associate-/l/38.6%
add-sqr-sqrt91.3%
Applied egg-rr91.3%
Taylor expanded in z around inf 70.3%
un-div-inv70.4%
*-commutative70.4%
associate-/r*70.4%
associate-/l/70.4%
associate-/r*70.4%
Applied egg-rr70.4%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 5e+233)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(* (/ 1.0 z) (/ 1.0 (* 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) <= 5e+233) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = (1.0 / z) * (1.0 / (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) <= 5e+233) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(1.0 / z) * Float64(1.0 / Float64(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], 5e+233], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+233}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{1}{y\_m \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.00000000000000009e233Initial program 98.0%
associate-/l/97.7%
remove-double-neg97.7%
distribute-rgt-neg-out97.7%
distribute-rgt-neg-out97.7%
remove-double-neg97.7%
associate-*l*97.7%
*-commutative97.7%
sqr-neg97.7%
+-commutative97.7%
sqr-neg97.7%
fma-define97.7%
Simplified97.7%
*-commutative97.7%
associate-*r*97.7%
fma-undefine97.7%
+-commutative97.7%
associate-/l/98.0%
add-sqr-sqrt51.6%
*-un-lft-identity51.6%
times-frac51.6%
+-commutative51.6%
fma-undefine51.6%
*-commutative51.6%
sqrt-prod51.6%
fma-undefine51.6%
+-commutative51.6%
hypot-1-def51.6%
+-commutative51.6%
Applied egg-rr51.6%
Taylor expanded in y around 0 97.7%
*-commutative97.7%
+-commutative97.7%
unpow297.7%
fma-undefine97.7%
associate-*r*97.7%
associate-/r*98.1%
*-commutative98.1%
Simplified98.1%
if 5.00000000000000009e233 < (*.f64 z z) Initial program 67.9%
associate-/l/67.9%
remove-double-neg67.9%
distribute-rgt-neg-out67.9%
distribute-rgt-neg-out67.9%
remove-double-neg67.9%
associate-*l*69.0%
*-commutative69.0%
sqr-neg69.0%
+-commutative69.0%
sqr-neg69.0%
fma-define69.0%
Simplified69.0%
Taylor expanded in z around inf 67.9%
associate-/r*67.9%
associate-/r*71.0%
Simplified71.0%
unpow271.0%
Applied egg-rr71.0%
frac-2neg71.0%
distribute-frac-neg71.0%
distribute-neg-frac271.0%
associate-/l/71.0%
distribute-neg-frac71.0%
metadata-eval71.0%
*-commutative71.0%
Applied egg-rr71.0%
div-inv70.9%
distribute-neg-frac70.9%
metadata-eval70.9%
pow270.9%
pow-flip71.6%
metadata-eval71.6%
associate-*l/71.7%
*-un-lft-identity71.7%
sqr-pow71.6%
associate-/l*89.8%
metadata-eval89.8%
inv-pow89.8%
*-commutative89.8%
associate-/l/99.6%
metadata-eval99.6%
inv-pow99.6%
associate-/r*99.7%
associate-/l/99.7%
Applied egg-rr99.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* y_m (+ 1.0 (* z z)))))
(*
y_s
(*
x_s
(if (<= t_0 4e+303)
(/ (/ 1.0 x_m) t_0)
(* (/ 1.0 z) (/ 1.0 (* 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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 4e+303) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z) * (1.0 / (y_m * (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) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z * z))
if (t_0 <= 4d+303) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = (1.0d0 / z) * (1.0d0 / (y_m * (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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 4e+303) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z) * (1.0 / (y_m * (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): t_0 = y_m * (1.0 + (z * z)) tmp = 0 if t_0 <= 4e+303: tmp = (1.0 / x_m) / t_0 else: tmp = (1.0 / z) * (1.0 / (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) t_0 = Float64(y_m * Float64(1.0 + Float64(z * z))) tmp = 0.0 if (t_0 <= 4e+303) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(1.0 / z) * Float64(1.0 / Float64(y_m * 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)
t_0 = y_m * (1.0 + (z * z));
tmp = 0.0;
if (t_0 <= 4e+303)
tmp = (1.0 / x_m) / t_0;
else
tmp = (1.0 / z) * (1.0 / (y_m * (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_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 4e+303], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z \cdot z\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{+303}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{1}{y\_m \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 4e303Initial program 91.6%
if 4e303 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 71.0%
associate-/l/71.0%
remove-double-neg71.0%
distribute-rgt-neg-out71.0%
distribute-rgt-neg-out71.0%
remove-double-neg71.0%
associate-*l*76.0%
*-commutative76.0%
sqr-neg76.0%
+-commutative76.0%
sqr-neg76.0%
fma-define76.0%
Simplified76.0%
Taylor expanded in z around inf 71.0%
associate-/r*71.0%
associate-/r*75.7%
Simplified75.7%
unpow275.7%
Applied egg-rr75.7%
frac-2neg75.7%
distribute-frac-neg75.7%
distribute-neg-frac275.7%
associate-/l/75.7%
distribute-neg-frac75.7%
metadata-eval75.7%
*-commutative75.7%
Applied egg-rr75.7%
div-inv75.7%
distribute-neg-frac75.7%
metadata-eval75.7%
pow275.7%
pow-flip75.7%
metadata-eval75.7%
associate-*l/75.7%
*-un-lft-identity75.7%
sqr-pow75.7%
associate-/l*91.6%
metadata-eval91.6%
inv-pow91.6%
*-commutative91.6%
associate-/l/99.6%
metadata-eval99.6%
inv-pow99.6%
associate-/r*99.8%
associate-/l/99.7%
Applied egg-rr99.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 2e-9)
(/ 1.0 (* x_m y_m))
(/ (* (/ 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) <= 2e-9) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = ((1.0 / z) * (1.0 / (z * x_m))) / y_m;
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 2d-9) then
tmp = 1.0d0 / (x_m * y_m)
else
tmp = ((1.0d0 / z) * (1.0d0 / (z * x_m))) / y_m
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-9) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = ((1.0 / z) * (1.0 / (z * x_m))) / y_m;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 2e-9: tmp = 1.0 / (x_m * y_m) else: tmp = ((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) <= 2e-9) tmp = Float64(1.0 / Float64(x_m * y_m)); else tmp = Float64(Float64(Float64(1.0 / z) * Float64(1.0 / Float64(z * x_m))) / y_m); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 2e-9)
tmp = 1.0 / (x_m * y_m);
else
tmp = ((1.0 / z) * (1.0 / (z * x_m))) / y_m;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-9], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / z), $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 2 \cdot 10^{-9}:\\
\;\;\;\;\frac{1}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z} \cdot \frac{1}{z \cdot x\_m}}{y\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000012e-9Initial program 99.7%
associate-/l/99.7%
remove-double-neg99.7%
distribute-rgt-neg-out99.7%
distribute-rgt-neg-out99.7%
remove-double-neg99.7%
associate-*l*99.7%
*-commutative99.7%
sqr-neg99.7%
+-commutative99.7%
sqr-neg99.7%
fma-define99.7%
Simplified99.7%
Taylor expanded in z around 0 99.4%
if 2.00000000000000012e-9 < (*.f64 z z) Initial program 78.9%
associate-/l/78.4%
remove-double-neg78.4%
distribute-rgt-neg-out78.4%
distribute-rgt-neg-out78.4%
remove-double-neg78.4%
associate-*l*79.1%
*-commutative79.1%
sqr-neg79.1%
+-commutative79.1%
sqr-neg79.1%
fma-define79.1%
Simplified79.1%
*-commutative79.1%
associate-*r*78.4%
fma-undefine78.4%
+-commutative78.4%
associate-/l/78.9%
add-sqr-sqrt35.8%
*-un-lft-identity35.8%
times-frac35.8%
+-commutative35.8%
fma-undefine35.8%
*-commutative35.8%
sqrt-prod35.8%
fma-undefine35.8%
+-commutative35.8%
hypot-1-def35.8%
+-commutative35.8%
Applied egg-rr43.4%
associate-/r*43.4%
associate-/r*42.7%
frac-times40.3%
associate-/l/40.3%
add-sqr-sqrt92.3%
Applied egg-rr92.3%
Taylor expanded in z around inf 66.0%
Taylor expanded in z around inf 91.9%
Final simplification95.5%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 2e-9)
(/ 1.0 (* x_m y_m))
(* (/ 1.0 z) (/ 1.0 (* 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) <= 2e-9) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = (1.0 / z) * (1.0 / (y_m * (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) <= 2d-9) then
tmp = 1.0d0 / (x_m * y_m)
else
tmp = (1.0d0 / z) * (1.0d0 / (y_m * (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) <= 2e-9) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = (1.0 / z) * (1.0 / (y_m * (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) <= 2e-9: tmp = 1.0 / (x_m * y_m) else: tmp = (1.0 / z) * (1.0 / (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) <= 2e-9) tmp = Float64(1.0 / Float64(x_m * y_m)); else tmp = Float64(Float64(1.0 / z) * Float64(1.0 / Float64(y_m * 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) <= 2e-9)
tmp = 1.0 / (x_m * y_m);
else
tmp = (1.0 / z) * (1.0 / (y_m * (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], 2e-9], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(1.0 / N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-9}:\\
\;\;\;\;\frac{1}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{1}{y\_m \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000012e-9Initial program 99.7%
associate-/l/99.7%
remove-double-neg99.7%
distribute-rgt-neg-out99.7%
distribute-rgt-neg-out99.7%
remove-double-neg99.7%
associate-*l*99.7%
*-commutative99.7%
sqr-neg99.7%
+-commutative99.7%
sqr-neg99.7%
fma-define99.7%
Simplified99.7%
Taylor expanded in z around 0 99.4%
if 2.00000000000000012e-9 < (*.f64 z z) Initial program 78.9%
associate-/l/78.4%
remove-double-neg78.4%
distribute-rgt-neg-out78.4%
distribute-rgt-neg-out78.4%
remove-double-neg78.4%
associate-*l*79.1%
*-commutative79.1%
sqr-neg79.1%
+-commutative79.1%
sqr-neg79.1%
fma-define79.1%
Simplified79.1%
Taylor expanded in z around inf 78.0%
associate-/r*78.5%
associate-/r*79.0%
Simplified79.0%
unpow279.0%
Applied egg-rr79.0%
frac-2neg79.0%
distribute-frac-neg79.0%
distribute-neg-frac279.0%
associate-/l/78.9%
distribute-neg-frac78.9%
metadata-eval78.9%
*-commutative78.9%
Applied egg-rr78.9%
div-inv79.0%
distribute-neg-frac79.0%
metadata-eval79.0%
pow279.0%
pow-flip79.4%
metadata-eval79.4%
associate-*l/80.3%
*-un-lft-identity80.3%
sqr-pow80.2%
associate-/l*90.9%
metadata-eval90.9%
inv-pow90.9%
*-commutative90.9%
associate-/l/96.4%
metadata-eval96.4%
inv-pow96.4%
associate-/r*96.5%
associate-/l/96.6%
Applied egg-rr96.6%
Final simplification97.9%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (if (<= z 1.0) (/ 1.0 (* x_m y_m)) (/ 1.0 (* y_m (* x_m (* z z))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = 1.0 / (y_m * (x_m * (z * z)));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (z <= 1.0d0) then
tmp = 1.0d0 / (x_m * y_m)
else
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = 1.0 / (x_m * y_m);
} else {
tmp = 1.0 / (y_m * (x_m * (z * z)));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if z <= 1.0: tmp = 1.0 / (x_m * y_m) else: tmp = 1.0 / (y_m * (x_m * (z * z))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(1.0 / Float64(x_m * y_m)); else tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (z <= 1.0)
tmp = 1.0 / (x_m * y_m);
else
tmp = 1.0 / (y_m * (x_m * (z * z)));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{1}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 91.3%
associate-/l/91.4%
remove-double-neg91.4%
distribute-rgt-neg-out91.4%
distribute-rgt-neg-out91.4%
remove-double-neg91.4%
associate-*l*91.8%
*-commutative91.8%
sqr-neg91.8%
+-commutative91.8%
sqr-neg91.8%
fma-define91.8%
Simplified91.8%
Taylor expanded in z around 0 68.0%
if 1 < z Initial program 79.1%
associate-/l/77.9%
remove-double-neg77.9%
distribute-rgt-neg-out77.9%
distribute-rgt-neg-out77.9%
remove-double-neg77.9%
associate-*l*77.9%
*-commutative77.9%
sqr-neg77.9%
+-commutative77.9%
sqr-neg77.9%
fma-define77.9%
Simplified77.9%
Taylor expanded in z around inf 77.9%
*-commutative77.9%
associate-*r*77.9%
*-commutative77.9%
Simplified77.9%
unpow278.8%
Applied egg-rr77.9%
Final simplification70.1%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (if (<= z 1.0) (/ 1.0 (* x_m y_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 / (x_m * y_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 / (x_m * y_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 / (x_m * y_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 / (x_m * y_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(1.0 / Float64(x_m * y_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 / (x_m * y_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[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $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{1}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(z \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 91.3%
associate-/l/91.4%
remove-double-neg91.4%
distribute-rgt-neg-out91.4%
distribute-rgt-neg-out91.4%
remove-double-neg91.4%
associate-*l*91.8%
*-commutative91.8%
sqr-neg91.8%
+-commutative91.8%
sqr-neg91.8%
fma-define91.8%
Simplified91.8%
Taylor expanded in z around 0 68.0%
if 1 < z Initial program 79.1%
associate-/l/77.9%
remove-double-neg77.9%
distribute-rgt-neg-out77.9%
distribute-rgt-neg-out77.9%
remove-double-neg77.9%
associate-*l*77.9%
*-commutative77.9%
sqr-neg77.9%
+-commutative77.9%
sqr-neg77.9%
fma-define77.9%
Simplified77.9%
*-commutative77.9%
associate-*r*77.9%
fma-undefine77.9%
+-commutative77.9%
associate-/l/79.1%
add-sqr-sqrt38.5%
*-un-lft-identity38.5%
times-frac38.5%
+-commutative38.5%
fma-undefine38.5%
*-commutative38.5%
sqrt-prod38.6%
fma-undefine38.6%
+-commutative38.6%
hypot-1-def38.6%
+-commutative38.6%
Applied egg-rr48.8%
associate-/r*48.7%
associate-/r*47.1%
frac-times44.6%
associate-/l/44.7%
add-sqr-sqrt92.1%
Applied egg-rr92.1%
Taylor expanded in z around inf 92.1%
Taylor expanded in z around 0 37.1%
Final simplification61.3%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
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 88.7%
associate-/l/88.5%
remove-double-neg88.5%
distribute-rgt-neg-out88.5%
distribute-rgt-neg-out88.5%
remove-double-neg88.5%
associate-*l*88.8%
*-commutative88.8%
sqr-neg88.8%
+-commutative88.8%
sqr-neg88.8%
fma-define88.8%
Simplified88.8%
Taylor expanded in z around 0 55.9%
Final simplification55.9%
(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 2024125
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))