
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ (pow y_m -1.0) (* x_m (hypot 1.0 z))) (hypot 1.0 z)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((pow(y_m, -1.0) / (x_m * hypot(1.0, z))) / hypot(1.0, z)));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((Math.pow(y_m, -1.0) / (x_m * Math.hypot(1.0, z))) / Math.hypot(1.0, z)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((math.pow(y_m, -1.0) / (x_m * math.hypot(1.0, z))) / math.hypot(1.0, z)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64((y_m ^ -1.0) / Float64(x_m * hypot(1.0, z))) / hypot(1.0, z)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (((y_m ^ -1.0) / (x_m * hypot(1.0, z))) / hypot(1.0, z)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[(x$95$m * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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{{y\_m}^{-1}}{x\_m \cdot \mathsf{hypot}\left(1, z\right)}}{\mathsf{hypot}\left(1, z\right)}\right)
\end{array}
Initial program 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
associate-*r*87.5%
*-commutative87.5%
associate-/r*87.6%
*-commutative87.6%
associate-/l/87.8%
fma-undefine87.8%
+-commutative87.8%
associate-/r*87.3%
*-un-lft-identity87.3%
add-sqr-sqrt46.3%
times-frac46.3%
+-commutative46.3%
fma-undefine46.3%
*-commutative46.3%
sqrt-prod46.3%
fma-undefine46.3%
+-commutative46.3%
hypot-1-def46.3%
+-commutative46.3%
Applied egg-rr52.7%
associate-*r/52.7%
associate-*r/52.7%
*-rgt-identity52.7%
*-commutative52.7%
associate-/r*52.8%
Simplified52.8%
frac-2neg52.8%
div-inv52.7%
associate-/l/52.7%
distribute-neg-frac252.7%
inv-pow52.7%
sqrt-pow252.8%
metadata-eval52.8%
distribute-neg-frac252.8%
associate-/l/52.8%
distribute-neg-frac252.8%
inv-pow52.8%
sqrt-pow252.8%
metadata-eval52.8%
Applied egg-rr52.8%
associate-*r/52.8%
associate-*l/52.7%
pow-sqr98.9%
metadata-eval98.9%
distribute-rgt-neg-in98.9%
Simplified98.9%
Final simplification98.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 z) 1e+134)
(* (/ (/ 1.0 (fma z z 1.0)) x_m) (/ 1.0 y_m))
(/ (/ (pow y_m -1.0) (* x_m z)) (hypot 1.0 z))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+134) {
tmp = ((1.0 / fma(z, z, 1.0)) / x_m) * (1.0 / y_m);
} else {
tmp = (pow(y_m, -1.0) / (x_m * z)) / hypot(1.0, z);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 1e+134) tmp = Float64(Float64(Float64(1.0 / fma(z, z, 1.0)) / x_m) * Float64(1.0 / y_m)); else tmp = Float64(Float64((y_m ^ -1.0) / Float64(x_m * z)) / hypot(1.0, z)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+134], N[(N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] * N[(1.0 / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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^{+134}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{x\_m} \cdot \frac{1}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{y\_m}^{-1}}{x\_m \cdot z}}{\mathsf{hypot}\left(1, z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 9.99999999999999921e133Initial program 98.4%
associate-/l/98.1%
remove-double-neg98.1%
distribute-rgt-neg-out98.1%
distribute-rgt-neg-out98.1%
remove-double-neg98.1%
associate-*l*98.2%
*-commutative98.2%
sqr-neg98.2%
+-commutative98.2%
sqr-neg98.2%
fma-define98.2%
Simplified98.2%
Taylor expanded in y around 0 98.1%
associate-*r*99.3%
+-commutative99.3%
unpow299.3%
fma-undefine99.3%
associate-/l/99.3%
Simplified99.3%
associate-/r*98.4%
div-inv98.4%
Applied egg-rr98.4%
if 9.99999999999999921e133 < (*.f64 z z) Initial program 70.4%
associate-/l/69.9%
remove-double-neg69.9%
distribute-rgt-neg-out69.9%
distribute-rgt-neg-out69.9%
remove-double-neg69.9%
associate-*l*70.0%
*-commutative70.0%
sqr-neg70.0%
+-commutative70.0%
sqr-neg70.0%
fma-define70.0%
Simplified70.0%
associate-*r*69.6%
*-commutative69.6%
associate-/r*69.9%
*-commutative69.9%
associate-/l/69.9%
fma-undefine69.9%
+-commutative69.9%
associate-/r*70.4%
*-un-lft-identity70.4%
add-sqr-sqrt29.4%
times-frac29.4%
+-commutative29.4%
fma-undefine29.4%
*-commutative29.4%
sqrt-prod29.4%
fma-undefine29.4%
+-commutative29.4%
hypot-1-def29.4%
+-commutative29.4%
Applied egg-rr43.8%
associate-*r/43.8%
associate-*r/43.8%
*-rgt-identity43.8%
*-commutative43.8%
associate-/r*43.8%
Simplified43.8%
frac-2neg43.8%
div-inv43.8%
associate-/l/43.9%
distribute-neg-frac243.9%
inv-pow43.9%
sqrt-pow243.9%
metadata-eval43.9%
distribute-neg-frac243.9%
associate-/l/43.9%
distribute-neg-frac243.9%
inv-pow43.9%
sqrt-pow244.0%
metadata-eval44.0%
Applied egg-rr44.0%
associate-*r/43.9%
associate-*l/43.9%
pow-sqr98.9%
metadata-eval98.9%
distribute-rgt-neg-in98.9%
Simplified98.9%
Taylor expanded in z around inf 71.3%
associate-*r*71.3%
neg-mul-171.3%
Simplified71.3%
Final simplification87.6%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 y_m) (* (hypot 1.0 z) (* x_m (hypot 1.0 z)))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / (hypot(1.0, z) * (x_m * hypot(1.0, z)))));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / (Math.hypot(1.0, z) * (x_m * Math.hypot(1.0, z)))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / y_m) / (math.hypot(1.0, z) * (x_m * math.hypot(1.0, z)))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / y_m) / Float64(hypot(1.0, z) * Float64(x_m * hypot(1.0, z)))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / y_m) / (hypot(1.0, z) * (x_m * hypot(1.0, z)))));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(x$95$m * N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{y\_m}}{\mathsf{hypot}\left(1, z\right) \cdot \left(x\_m \cdot \mathsf{hypot}\left(1, z\right)\right)}\right)
\end{array}
Initial program 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
associate-*r*87.5%
*-commutative87.5%
associate-/r*87.6%
*-commutative87.6%
associate-/l/87.8%
fma-undefine87.8%
+-commutative87.8%
associate-/r*87.3%
*-un-lft-identity87.3%
add-sqr-sqrt46.3%
times-frac46.3%
+-commutative46.3%
fma-undefine46.3%
*-commutative46.3%
sqrt-prod46.3%
fma-undefine46.3%
+-commutative46.3%
hypot-1-def46.3%
+-commutative46.3%
Applied egg-rr52.7%
associate-*r/52.7%
associate-*r/52.7%
*-rgt-identity52.7%
*-commutative52.7%
associate-/r*52.8%
Simplified52.8%
*-un-lft-identity52.8%
div-inv52.7%
associate-/l/52.7%
associate-/l/52.7%
frac-times50.0%
frac-times50.0%
metadata-eval50.0%
add-sqr-sqrt93.7%
Applied egg-rr93.7%
Final simplification93.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+258)
(* (/ (/ 1.0 (fma z z 1.0)) x_m) (/ 1.0 y_m))
(/ (/ (/ 1.0 x_m) (* y_m z)) (hypot 1.0 z))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+258) {
tmp = ((1.0 / fma(z, z, 1.0)) / x_m) * (1.0 / y_m);
} else {
tmp = ((1.0 / x_m) / (y_m * z)) / hypot(1.0, z);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+258) tmp = Float64(Float64(Float64(1.0 / fma(z, z, 1.0)) / x_m) * Float64(1.0 / y_m)); else tmp = Float64(Float64(Float64(1.0 / x_m) / Float64(y_m * z)) / hypot(1.0, z)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+258], N[(N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] * N[(1.0 / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * z), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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^{+258}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{x\_m} \cdot \frac{1}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{y\_m \cdot z}}{\mathsf{hypot}\left(1, z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000011e258Initial program 98.1%
associate-/l/97.5%
remove-double-neg97.5%
distribute-rgt-neg-out97.5%
distribute-rgt-neg-out97.5%
remove-double-neg97.5%
associate-*l*96.5%
*-commutative96.5%
sqr-neg96.5%
+-commutative96.5%
sqr-neg96.5%
fma-define96.5%
Simplified96.5%
Taylor expanded in y around 0 97.5%
associate-*r*96.9%
+-commutative96.9%
unpow296.9%
fma-undefine96.9%
associate-/l/97.2%
Simplified97.2%
associate-/r*97.6%
div-inv97.5%
Applied egg-rr97.5%
if 2.00000000000000011e258 < (*.f64 z z) Initial program 63.1%
associate-/l/63.1%
remove-double-neg63.1%
distribute-rgt-neg-out63.1%
distribute-rgt-neg-out63.1%
remove-double-neg63.1%
associate-*l*65.6%
*-commutative65.6%
sqr-neg65.6%
+-commutative65.6%
sqr-neg65.6%
fma-define65.6%
Simplified65.6%
associate-*r*66.3%
*-commutative66.3%
associate-/r*66.1%
*-commutative66.1%
associate-/l/66.1%
fma-undefine66.1%
+-commutative66.1%
associate-/r*63.1%
*-un-lft-identity63.1%
add-sqr-sqrt24.0%
times-frac24.0%
+-commutative24.0%
fma-undefine24.0%
*-commutative24.0%
sqrt-prod24.0%
fma-undefine24.0%
+-commutative24.0%
hypot-1-def24.0%
+-commutative24.0%
Applied egg-rr41.6%
associate-*r/41.6%
associate-*r/41.6%
*-rgt-identity41.6%
*-commutative41.6%
associate-/r*41.6%
Simplified41.6%
frac-2neg41.6%
div-inv41.5%
associate-/l/41.6%
distribute-neg-frac241.6%
inv-pow41.6%
sqrt-pow241.6%
metadata-eval41.6%
distribute-neg-frac241.6%
associate-/l/41.7%
distribute-neg-frac241.7%
inv-pow41.7%
sqrt-pow241.7%
metadata-eval41.7%
Applied egg-rr41.7%
associate-*r/41.6%
associate-*l/41.6%
pow-sqr99.8%
metadata-eval99.8%
distribute-rgt-neg-in99.8%
Simplified99.8%
Taylor expanded in z around inf 74.7%
associate-/r*74.6%
Simplified74.6%
Final simplification90.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+258)
(* (/ (/ 1.0 (fma z z 1.0)) x_m) (/ 1.0 y_m))
(/ (/ 1.0 (* x_m (* y_m z))) (hypot 1.0 z))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+258) {
tmp = ((1.0 / fma(z, z, 1.0)) / x_m) * (1.0 / y_m);
} else {
tmp = (1.0 / (x_m * (y_m * z))) / hypot(1.0, z);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+258) tmp = Float64(Float64(Float64(1.0 / fma(z, z, 1.0)) / x_m) * Float64(1.0 / y_m)); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(y_m * z))) / hypot(1.0, z)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+258], N[(N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] * N[(1.0 / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $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^{+258}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{x\_m} \cdot \frac{1}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}}{\mathsf{hypot}\left(1, z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000011e258Initial program 98.1%
associate-/l/97.5%
remove-double-neg97.5%
distribute-rgt-neg-out97.5%
distribute-rgt-neg-out97.5%
remove-double-neg97.5%
associate-*l*96.5%
*-commutative96.5%
sqr-neg96.5%
+-commutative96.5%
sqr-neg96.5%
fma-define96.5%
Simplified96.5%
Taylor expanded in y around 0 97.5%
associate-*r*96.9%
+-commutative96.9%
unpow296.9%
fma-undefine96.9%
associate-/l/97.2%
Simplified97.2%
associate-/r*97.6%
div-inv97.5%
Applied egg-rr97.5%
if 2.00000000000000011e258 < (*.f64 z z) Initial program 63.1%
associate-/l/63.1%
remove-double-neg63.1%
distribute-rgt-neg-out63.1%
distribute-rgt-neg-out63.1%
remove-double-neg63.1%
associate-*l*65.6%
*-commutative65.6%
sqr-neg65.6%
+-commutative65.6%
sqr-neg65.6%
fma-define65.6%
Simplified65.6%
associate-*r*66.3%
*-commutative66.3%
associate-/r*66.1%
*-commutative66.1%
associate-/l/66.1%
fma-undefine66.1%
+-commutative66.1%
associate-/r*63.1%
*-un-lft-identity63.1%
add-sqr-sqrt24.0%
times-frac24.0%
+-commutative24.0%
fma-undefine24.0%
*-commutative24.0%
sqrt-prod24.0%
fma-undefine24.0%
+-commutative24.0%
hypot-1-def24.0%
+-commutative24.0%
Applied egg-rr41.6%
associate-*r/41.6%
associate-*r/41.6%
*-rgt-identity41.6%
*-commutative41.6%
associate-/r*41.6%
Simplified41.6%
frac-2neg41.6%
div-inv41.5%
associate-/l/41.6%
distribute-neg-frac241.6%
inv-pow41.6%
sqrt-pow241.6%
metadata-eval41.6%
distribute-neg-frac241.6%
associate-/l/41.7%
distribute-neg-frac241.7%
inv-pow41.7%
sqrt-pow241.7%
metadata-eval41.7%
Applied egg-rr41.7%
associate-*r/41.6%
associate-*l/41.6%
pow-sqr99.8%
metadata-eval99.8%
distribute-rgt-neg-in99.8%
Simplified99.8%
Taylor expanded in z around inf 74.7%
Final simplification90.5%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* y_m (+ (* z z) 1.0))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(/ (pow z -2.0) (* y_m x_m)))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = pow(z, -2.0) / (y_m * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = Math.pow(z, -2.0) / (y_m * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = y_m * ((z * z) + 1.0) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = math.pow(z, -2.0) / (y_m * x_m) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(y_m * Float64(Float64(z * z) + 1.0)) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64((z ^ -2.0) / Float64(y_m * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = y_m * ((z * z) + 1.0);
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = (z ^ -2.0) / (y_m * x_m);
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Power[z, -2.0], $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(z \cdot z + 1\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{{z}^{-2}}{y\_m \cdot x\_m}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 87.3%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 87.3%
remove-double-neg87.3%
distribute-lft-neg-out87.3%
distribute-rgt-neg-in87.3%
associate-/r*87.8%
associate-/l/87.6%
associate-/l/87.5%
distribute-lft-neg-out87.5%
distribute-rgt-neg-in87.5%
distribute-lft-neg-in87.5%
remove-double-neg87.5%
sqr-neg87.5%
+-commutative87.5%
sqr-neg87.5%
fma-define87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around inf 47.9%
*-un-lft-identity47.9%
pow247.9%
associate-/r*48.1%
pow248.1%
pow-flip48.3%
metadata-eval48.3%
*-commutative48.3%
Applied egg-rr48.3%
*-lft-identity48.3%
*-commutative48.3%
Simplified48.3%
Final simplification87.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
(if (<= y_m 5e-54)
(/ (/ 1.0 x_m) (fma (* y_m z) z y_m))
(* (/ 1.0 y_m) (/ (/ 1.0 (fma z z 1.0)) x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (y_m <= 5e-54) {
tmp = (1.0 / x_m) / fma((y_m * z), z, y_m);
} else {
tmp = (1.0 / y_m) * ((1.0 / fma(z, z, 1.0)) / x_m);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (y_m <= 5e-54) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(y_m * z), z, y_m)); else tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / fma(z, z, 1.0)) / x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 5e-54], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(y$95$m * z), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \leq 5 \cdot 10^{-54}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(y\_m \cdot z, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{x\_m}\\
\end{array}\right)
\end{array}
if y < 5.00000000000000015e-54Initial program 86.4%
+-commutative86.4%
distribute-lft-in86.4%
associate-*r*93.5%
*-rgt-identity93.5%
fma-define93.5%
Applied egg-rr93.5%
if 5.00000000000000015e-54 < y Initial program 89.5%
associate-/l/89.3%
remove-double-neg89.3%
distribute-rgt-neg-out89.3%
distribute-rgt-neg-out89.3%
remove-double-neg89.3%
associate-*l*94.5%
*-commutative94.5%
sqr-neg94.5%
+-commutative94.5%
sqr-neg94.5%
fma-define94.5%
Simplified94.5%
Taylor expanded in y around 0 89.3%
associate-*r*94.5%
+-commutative94.5%
unpow294.5%
fma-undefine94.5%
associate-/l/94.5%
Simplified94.5%
associate-/r*94.6%
div-inv94.5%
Applied egg-rr94.5%
Final simplification93.8%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= y_m 10000000000000.0)
(/ (/ 1.0 x_m) (fma (* y_m z) z y_m))
(/ (/ 1.0 (fma z z 1.0)) (* y_m x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (y_m <= 10000000000000.0) {
tmp = (1.0 / x_m) / fma((y_m * z), z, y_m);
} else {
tmp = (1.0 / fma(z, z, 1.0)) / (y_m * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (y_m <= 10000000000000.0) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(y_m * z), z, y_m)); else tmp = Float64(Float64(1.0 / fma(z, z, 1.0)) / Float64(y_m * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 10000000000000.0], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(y$95$m * z), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \leq 10000000000000:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(y\_m \cdot z, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m \cdot x\_m}\\
\end{array}\right)
\end{array}
if y < 1e13Initial program 86.2%
+-commutative86.2%
distribute-lft-in86.2%
associate-*r*92.7%
*-rgt-identity92.7%
fma-define92.7%
Applied egg-rr92.7%
if 1e13 < y Initial program 91.2%
associate-/l/91.1%
remove-double-neg91.1%
distribute-rgt-neg-out91.1%
distribute-rgt-neg-out91.1%
remove-double-neg91.1%
associate-*l*98.0%
*-commutative98.0%
sqr-neg98.0%
+-commutative98.0%
sqr-neg98.0%
fma-define98.0%
Simplified98.0%
Taylor expanded in y around 0 91.1%
associate-*r*98.0%
+-commutative98.0%
unpow298.0%
fma-undefine98.0%
associate-/l/98.0%
Simplified98.0%
Final simplification93.8%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= y_m 0.019)
(/ (/ 1.0 x_m) (fma (* y_m z) z y_m))
(/ 1.0 (* (fma z z 1.0) (* y_m x_m)))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (y_m <= 0.019) {
tmp = (1.0 / x_m) / fma((y_m * z), z, y_m);
} else {
tmp = 1.0 / (fma(z, z, 1.0) * (y_m * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (y_m <= 0.019) tmp = Float64(Float64(1.0 / x_m) / fma(Float64(y_m * z), z, y_m)); else tmp = Float64(1.0 / Float64(fma(z, z, 1.0) * Float64(y_m * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 0.019], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(N[(y$95$m * z), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(z * z + 1.0), $MachinePrecision] * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \leq 0.019:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(y\_m \cdot z, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(z, z, 1\right) \cdot \left(y\_m \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if y < 0.0189999999999999995Initial program 86.1%
+-commutative86.1%
distribute-lft-in86.1%
associate-*r*92.7%
*-rgt-identity92.7%
fma-define92.7%
Applied egg-rr92.7%
if 0.0189999999999999995 < y Initial program 91.4%
remove-double-neg91.4%
distribute-lft-neg-out91.4%
distribute-rgt-neg-in91.4%
associate-/r*98.2%
associate-/l/98.0%
associate-/l/98.0%
distribute-lft-neg-out98.0%
distribute-rgt-neg-in98.0%
distribute-lft-neg-in98.0%
remove-double-neg98.0%
sqr-neg98.0%
+-commutative98.0%
sqr-neg98.0%
fma-define98.0%
*-commutative98.0%
Simplified98.0%
Final simplification93.8%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* y_m (* x_m (fma z z 1.0)))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (y_m * (x_m * fma(z, z, 1.0)))));
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.0)))))) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\right)
\end{array}
Initial program 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* y_m (+ (* z z) 1.0))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(/ 1.0 (* (* z z) (* x_m (+ y_m (/ y_m (* z z)))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / ((z * z) * (x_m * (y_m + (y_m / (z * z)))));
}
return y_s * (x_s * tmp);
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / ((z * z) * (x_m * (y_m + (y_m / (z * z)))));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = y_m * ((z * z) + 1.0) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = 1.0 / ((z * z) * (x_m * (y_m + (y_m / (z * z))))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(y_m * Float64(Float64(z * z) + 1.0)) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(1.0 / Float64(Float64(z * z) * Float64(x_m * Float64(y_m + Float64(y_m / Float64(z * z)))))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = y_m * ((z * z) + 1.0);
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = 1.0 / ((z * z) * (x_m * (y_m + (y_m / (z * z)))));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(N[(z * z), $MachinePrecision] * N[(x$95$m * N[(y$95$m + N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $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(z \cdot z + 1\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(z \cdot z\right) \cdot \left(x\_m \cdot \left(y\_m + \frac{y\_m}{z \cdot z}\right)\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 87.3%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
Taylor expanded in z around inf 57.9%
associate-/l*59.2%
distribute-lft-out59.2%
Simplified59.2%
unpow259.2%
Applied egg-rr59.2%
unpow259.2%
Applied egg-rr59.2%
Final simplification87.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
(let* ((t_0 (* y_m (+ (* z z) 1.0))))
(*
y_s
(*
x_s
(if (<= t_0 INFINITY)
(/ (/ 1.0 x_m) t_0)
(/ 1.0 (* (* z z) (* y_m x_m))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / ((z * z) * (y_m * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = 1.0 / ((z * z) * (y_m * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = y_m * ((z * z) + 1.0) tmp = 0 if t_0 <= math.inf: tmp = (1.0 / x_m) / t_0 else: tmp = 1.0 / ((z * z) * (y_m * x_m)) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(y_m * Float64(Float64(z * z) + 1.0)) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(1.0 / Float64(Float64(z * z) * Float64(y_m * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = y_m * ((z * z) + 1.0);
tmp = 0.0;
if (t_0 <= Inf)
tmp = (1.0 / x_m) / t_0;
else
tmp = 1.0 / ((z * z) * (y_m * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(N[(z * z), $MachinePrecision] * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(z \cdot z + 1\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(z \cdot z\right) \cdot \left(y\_m \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < +inf.0Initial program 87.3%
if +inf.0 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 87.3%
remove-double-neg87.3%
distribute-lft-neg-out87.3%
distribute-rgt-neg-in87.3%
associate-/r*87.8%
associate-/l/87.6%
associate-/l/87.5%
distribute-lft-neg-out87.5%
distribute-rgt-neg-in87.5%
distribute-lft-neg-in87.5%
remove-double-neg87.5%
sqr-neg87.5%
+-commutative87.5%
sqr-neg87.5%
fma-define87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around inf 47.9%
unpow259.2%
Applied egg-rr47.9%
Final simplification87.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 (if (<= z 1.0) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* (* z z) (* y_m x_m)))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / ((z * z) * (y_m * 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 / ((z * z) * (y_m * 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 / ((z * z) * (y_m * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if z <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / ((z * z) * (y_m * x_m)) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(Float64(z * z) * Float64(y_m * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (z <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / ((z * z) * (y_m * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(N[(z * z), $MachinePrecision] * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(z \cdot z\right) \cdot \left(y\_m \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 89.1%
associate-/l/88.5%
remove-double-neg88.5%
distribute-rgt-neg-out88.5%
distribute-rgt-neg-out88.5%
remove-double-neg88.5%
associate-*l*87.6%
*-commutative87.6%
sqr-neg87.6%
+-commutative87.6%
sqr-neg87.6%
fma-define87.6%
Simplified87.6%
Taylor expanded in z around 0 69.5%
*-un-lft-identity69.5%
associate-/r*69.7%
Applied egg-rr69.7%
*-un-lft-identity69.7%
frac-2neg69.7%
distribute-neg-frac69.7%
metadata-eval69.7%
Applied egg-rr69.7%
if 1 < z Initial program 81.8%
remove-double-neg81.8%
distribute-lft-neg-out81.8%
distribute-rgt-neg-in81.8%
associate-/r*84.5%
associate-/l/84.4%
associate-/l/84.6%
distribute-lft-neg-out84.6%
distribute-rgt-neg-in84.6%
distribute-lft-neg-in84.6%
remove-double-neg84.6%
sqr-neg84.6%
+-commutative84.6%
sqr-neg84.6%
fma-define84.6%
*-commutative84.6%
Simplified84.6%
Taylor expanded in z around inf 83.6%
unpow284.6%
Applied egg-rr83.6%
Final simplification73.2%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (/ 1.0 y_m) x_m))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * ((1.0d0 / y_m) / x_m))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((1.0 / y_m) / x_m))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(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 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
Taylor expanded in z around 0 58.3%
*-un-lft-identity58.3%
associate-/r*58.5%
Applied egg-rr58.5%
*-un-lft-identity58.5%
frac-2neg58.5%
distribute-neg-frac58.5%
metadata-eval58.5%
Applied egg-rr58.5%
Final simplification58.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 (/ (/ 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 87.3%
Taylor expanded in z around 0 58.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 (/ 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 87.3%
associate-/l/86.9%
remove-double-neg86.9%
distribute-rgt-neg-out86.9%
distribute-rgt-neg-out86.9%
remove-double-neg86.9%
associate-*l*87.0%
*-commutative87.0%
sqr-neg87.0%
+-commutative87.0%
sqr-neg87.0%
fma-define87.0%
Simplified87.0%
Taylor expanded in z around 0 58.3%
(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 2024113
(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)))))