
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* y_m (+ 1.0 (* z_m z_m))) 4e+307)
(/ (/ 1.0 (* y_m (fma z_m z_m 1.0))) x_m)
(/ (/ (pow y_m -1.0) (* z_m x_m)) (hypot 1.0 z_m))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((y_m * (1.0 + (z_m * z_m))) <= 4e+307) {
tmp = (1.0 / (y_m * fma(z_m, z_m, 1.0))) / x_m;
} else {
tmp = (pow(y_m, -1.0) / (z_m * x_m)) / hypot(1.0, z_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) <= 4e+307) tmp = Float64(Float64(1.0 / Float64(y_m * fma(z_m, z_m, 1.0))) / x_m); else tmp = Float64(Float64((y_m ^ -1.0) / Float64(z_m * x_m)) / hypot(1.0, z_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e+307], N[(N[(1.0 / N[(y$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(1 + z\_m \cdot z\_m\right) \leq 4 \cdot 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{y\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{y\_m}^{-1}}{z\_m \cdot x\_m}}{\mathsf{hypot}\left(1, z\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 3.99999999999999994e307Initial program 91.5%
associate-/l/91.3%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
*-commutative90.9%
metadata-eval90.9%
associate-*l*91.3%
*-commutative91.3%
fma-undefine91.3%
+-commutative91.3%
frac-times91.4%
*-commutative91.4%
+-commutative91.4%
fma-undefine91.4%
*-commutative91.4%
Applied egg-rr91.4%
un-div-inv91.5%
*-commutative91.5%
Applied egg-rr91.5%
if 3.99999999999999994e307 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 72.9%
associate-/l/72.9%
associate-*l*78.8%
*-commutative78.8%
sqr-neg78.8%
+-commutative78.8%
sqr-neg78.8%
fma-define78.8%
Simplified78.8%
associate-*r*78.5%
*-commutative78.5%
associate-/r*78.4%
*-commutative78.4%
associate-/l/78.4%
fma-undefine78.4%
+-commutative78.4%
associate-/r*72.9%
*-un-lft-identity72.9%
add-sqr-sqrt72.9%
times-frac72.9%
+-commutative72.9%
fma-undefine72.9%
*-commutative72.9%
sqrt-prod72.9%
fma-undefine72.9%
+-commutative72.9%
hypot-1-def72.9%
+-commutative72.9%
Applied egg-rr99.8%
associate-/l/99.8%
associate-*r/99.8%
*-rgt-identity99.8%
*-commutative99.8%
associate-/r*99.8%
*-commutative99.8%
Simplified99.8%
*-un-lft-identity99.8%
*-commutative99.8%
times-frac99.8%
associate-/l/99.8%
inv-pow99.8%
sqrt-pow299.8%
metadata-eval99.8%
inv-pow99.8%
sqrt-pow299.8%
metadata-eval99.8%
Applied egg-rr99.8%
associate-*l/99.8%
associate-/l/97.0%
associate-*r/97.1%
pow-sqr97.0%
metadata-eval97.0%
Simplified97.0%
Taylor expanded in z around inf 81.7%
Final simplification90.3%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(/
(/ (/ 1.0 (sqrt y_m)) (hypot 1.0 z_m))
(* x_m (* (sqrt y_m) (hypot 1.0 z_m)))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (((1.0 / sqrt(y_m)) / hypot(1.0, z_m)) / (x_m * (sqrt(y_m) * hypot(1.0, z_m)))));
}
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (((1.0 / Math.sqrt(y_m)) / Math.hypot(1.0, z_m)) / (x_m * (Math.sqrt(y_m) * Math.hypot(1.0, z_m)))));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * (((1.0 / math.sqrt(y_m)) / math.hypot(1.0, z_m)) / (x_m * (math.sqrt(y_m) * math.hypot(1.0, z_m)))))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64(Float64(1.0 / sqrt(y_m)) / hypot(1.0, z_m)) / Float64(x_m * Float64(sqrt(y_m) * hypot(1.0, z_m)))))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (((1.0 / sqrt(y_m)) / hypot(1.0, z_m)) / (x_m * (sqrt(y_m) * hypot(1.0, z_m)))));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(N[Sqrt[y$95$m], $MachinePrecision] * N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\_m\right)}}{x\_m \cdot \left(\sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\_m\right)\right)}\right)
\end{array}
Initial program 89.2%
associate-/l/89.1%
associate-*l*89.4%
*-commutative89.4%
sqr-neg89.4%
+-commutative89.4%
sqr-neg89.4%
fma-define89.4%
Simplified89.4%
associate-*r*89.7%
*-commutative89.7%
associate-/r*88.6%
*-commutative88.6%
associate-/l/88.6%
fma-undefine88.6%
+-commutative88.6%
associate-/r*89.2%
*-un-lft-identity89.2%
add-sqr-sqrt40.6%
times-frac40.7%
+-commutative40.7%
fma-undefine40.7%
*-commutative40.7%
sqrt-prod40.6%
fma-undefine40.6%
+-commutative40.6%
hypot-1-def40.6%
+-commutative40.6%
Applied egg-rr43.9%
associate-/l/43.9%
associate-*r/43.9%
*-rgt-identity43.9%
*-commutative43.9%
associate-/r*43.9%
*-commutative43.9%
Simplified43.9%
Final simplification43.9%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (/ (/ (pow y_m -1.0) (* (hypot 1.0 z_m) x_m)) (hypot 1.0 z_m)))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((pow(y_m, -1.0) / (hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)));
}
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((Math.pow(y_m, -1.0) / (Math.hypot(1.0, z_m) * x_m)) / Math.hypot(1.0, z_m)));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * ((math.pow(y_m, -1.0) / (math.hypot(1.0, z_m) * x_m)) / math.hypot(1.0, z_m)))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64((y_m ^ -1.0) / Float64(hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (((y_m ^ -1.0) / (hypot(1.0, z_m) * x_m)) / hypot(1.0, z_m)));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{{y\_m}^{-1}}{\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m}}{\mathsf{hypot}\left(1, z\_m\right)}\right)
\end{array}
Initial program 89.2%
associate-/l/89.1%
associate-*l*89.4%
*-commutative89.4%
sqr-neg89.4%
+-commutative89.4%
sqr-neg89.4%
fma-define89.4%
Simplified89.4%
associate-*r*89.7%
*-commutative89.7%
associate-/r*88.6%
*-commutative88.6%
associate-/l/88.6%
fma-undefine88.6%
+-commutative88.6%
associate-/r*89.2%
*-un-lft-identity89.2%
add-sqr-sqrt40.6%
times-frac40.7%
+-commutative40.7%
fma-undefine40.7%
*-commutative40.7%
sqrt-prod40.6%
fma-undefine40.6%
+-commutative40.6%
hypot-1-def40.6%
+-commutative40.6%
Applied egg-rr43.9%
associate-/l/43.9%
associate-*r/43.9%
*-rgt-identity43.9%
*-commutative43.9%
associate-/r*43.9%
*-commutative43.9%
Simplified43.9%
*-un-lft-identity43.9%
*-commutative43.9%
times-frac43.9%
associate-/l/43.9%
inv-pow43.9%
sqrt-pow243.9%
metadata-eval43.9%
inv-pow43.9%
sqrt-pow243.9%
metadata-eval43.9%
Applied egg-rr43.9%
associate-*l/43.6%
associate-/l/42.5%
associate-*r/42.4%
pow-sqr97.5%
metadata-eval97.5%
Simplified97.5%
Final simplification97.5%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (/ (/ 1.0 (* y_m (* (hypot 1.0 z_m) x_m))) (hypot 1.0 z_m)))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / (y_m * (hypot(1.0, z_m) * x_m))) / hypot(1.0, z_m)));
}
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / (y_m * (Math.hypot(1.0, z_m) * x_m))) / Math.hypot(1.0, z_m)));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * ((1.0 / (y_m * (math.hypot(1.0, z_m) * x_m))) / math.hypot(1.0, z_m)))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / Float64(y_m * Float64(hypot(1.0, z_m) * x_m))) / hypot(1.0, z_m)))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * ((1.0 / (y_m * (hypot(1.0, z_m) * x_m))) / hypot(1.0, z_m)));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / N[(y$95$m * N[(N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{y\_m \cdot \left(\mathsf{hypot}\left(1, z\_m\right) \cdot x\_m\right)}}{\mathsf{hypot}\left(1, z\_m\right)}\right)
\end{array}
Initial program 89.2%
associate-/l/89.1%
associate-*l*89.4%
*-commutative89.4%
sqr-neg89.4%
+-commutative89.4%
sqr-neg89.4%
fma-define89.4%
Simplified89.4%
associate-*r*89.7%
*-commutative89.7%
associate-/r*88.6%
*-commutative88.6%
associate-/l/88.6%
fma-undefine88.6%
+-commutative88.6%
associate-/r*89.2%
*-un-lft-identity89.2%
add-sqr-sqrt40.6%
times-frac40.7%
+-commutative40.7%
fma-undefine40.7%
*-commutative40.7%
sqrt-prod40.6%
fma-undefine40.6%
+-commutative40.6%
hypot-1-def40.6%
+-commutative40.6%
Applied egg-rr43.9%
associate-/l/43.9%
associate-*r/43.9%
*-rgt-identity43.9%
*-commutative43.9%
associate-/r*43.9%
*-commutative43.9%
Simplified43.9%
*-un-lft-identity43.9%
*-commutative43.9%
times-frac43.9%
associate-/l/43.9%
inv-pow43.9%
sqrt-pow243.9%
metadata-eval43.9%
inv-pow43.9%
sqrt-pow243.9%
metadata-eval43.9%
Applied egg-rr43.9%
associate-*l/43.6%
associate-/l/42.5%
associate-*r/42.4%
pow-sqr97.5%
metadata-eval97.5%
Simplified97.5%
*-un-lft-identity97.5%
times-frac98.6%
unpow-198.6%
Applied egg-rr98.6%
frac-times97.5%
*-un-lft-identity97.5%
associate-/l/97.4%
Applied egg-rr97.4%
Final simplification97.4%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z_m z_m) 2e+254)
(* (/ 1.0 y_m) (/ (/ 1.0 x_m) (fma z_m z_m 1.0)))
(* (/ (/ 1.0 y_m) z_m) (/ (/ 1.0 x_m) z_m))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 2e+254) {
tmp = (1.0 / y_m) * ((1.0 / x_m) / fma(z_m, z_m, 1.0));
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 2e+254) tmp = Float64(Float64(1.0 / y_m) * Float64(Float64(1.0 / x_m) / fma(z_m, z_m, 1.0))); else tmp = Float64(Float64(Float64(1.0 / y_m) / z_m) * Float64(Float64(1.0 / x_m) / z_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 2e+254], N[(N[(1.0 / y$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \cdot z\_m \leq 2 \cdot 10^{+254}:\\
\;\;\;\;\frac{1}{y\_m} \cdot \frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z\_m, z\_m, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{z\_m} \cdot \frac{\frac{1}{x\_m}}{z\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.9999999999999999e254Initial program 97.6%
associate-/l/97.3%
associate-*l*97.3%
*-commutative97.3%
sqr-neg97.3%
+-commutative97.3%
sqr-neg97.3%
fma-define97.3%
Simplified97.3%
associate-*r*97.9%
*-commutative97.9%
associate-/r*96.4%
*-commutative96.4%
associate-/l/96.5%
associate-/r*97.6%
*-un-lft-identity97.6%
times-frac97.5%
Applied egg-rr97.5%
if 1.9999999999999999e254 < (*.f64 z z) Initial program 68.0%
associate-/l/68.0%
associate-*l*69.2%
*-commutative69.2%
sqr-neg69.2%
+-commutative69.2%
sqr-neg69.2%
fma-define69.2%
Simplified69.2%
associate-*r*68.7%
*-commutative68.7%
associate-/r*68.5%
*-commutative68.5%
associate-/l/68.5%
fma-undefine68.5%
+-commutative68.5%
associate-/r*68.0%
*-un-lft-identity68.0%
add-sqr-sqrt31.2%
times-frac31.2%
+-commutative31.2%
fma-undefine31.2%
*-commutative31.2%
sqrt-prod31.2%
fma-undefine31.2%
+-commutative31.2%
hypot-1-def31.2%
+-commutative31.2%
Applied egg-rr40.2%
associate-/l/40.1%
associate-*r/40.1%
*-rgt-identity40.1%
*-commutative40.1%
associate-/r*40.2%
*-commutative40.2%
Simplified40.2%
*-un-lft-identity40.2%
*-commutative40.2%
times-frac40.2%
associate-/l/40.2%
inv-pow40.2%
sqrt-pow240.2%
metadata-eval40.2%
inv-pow40.2%
sqrt-pow240.2%
metadata-eval40.2%
Applied egg-rr40.2%
associate-*l/40.3%
associate-/l/39.0%
associate-*r/39.0%
pow-sqr96.3%
metadata-eval96.3%
Simplified96.3%
Taylor expanded in z around inf 68.0%
associate-/r*68.0%
associate-/r*68.5%
associate-/r*68.5%
Simplified68.5%
associate-/l/68.5%
div-inv68.5%
unpow268.5%
times-frac96.2%
Applied egg-rr96.2%
Final simplification97.2%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z_m z_m) 1e+219)
(/ 1.0 (* y_m (* x_m (fma z_m z_m 1.0))))
(* (/ (/ 1.0 y_m) z_m) (/ (/ 1.0 x_m) z_m))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if ((z_m * z_m) <= 1e+219) {
tmp = 1.0 / (y_m * (x_m * fma(z_m, z_m, 1.0)));
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (Float64(z_m * z_m) <= 1e+219) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z_m, z_m, 1.0)))); else tmp = Float64(Float64(Float64(1.0 / y_m) / z_m) * Float64(Float64(1.0 / x_m) / z_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z$95$m * z$95$m), $MachinePrecision], 1e+219], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z$95$m * z$95$m + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \cdot z\_m \leq 10^{+219}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z\_m, z\_m, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{z\_m} \cdot \frac{\frac{1}{x\_m}}{z\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 9.99999999999999965e218Initial program 98.6%
associate-/l/98.3%
associate-*l*97.3%
*-commutative97.3%
sqr-neg97.3%
+-commutative97.3%
sqr-neg97.3%
fma-define97.3%
Simplified97.3%
if 9.99999999999999965e218 < (*.f64 z z) Initial program 67.1%
associate-/l/67.1%
associate-*l*70.8%
*-commutative70.8%
sqr-neg70.8%
+-commutative70.8%
sqr-neg70.8%
fma-define70.8%
Simplified70.8%
associate-*r*69.1%
*-commutative69.1%
associate-/r*68.9%
*-commutative68.9%
associate-/l/68.9%
fma-undefine68.9%
+-commutative68.9%
associate-/r*67.1%
*-un-lft-identity67.1%
add-sqr-sqrt30.9%
times-frac30.9%
+-commutative30.9%
fma-undefine30.9%
*-commutative30.9%
sqrt-prod30.9%
fma-undefine30.9%
+-commutative30.9%
hypot-1-def30.9%
+-commutative30.9%
Applied egg-rr40.7%
associate-/l/40.6%
associate-*r/40.7%
*-rgt-identity40.7%
*-commutative40.7%
associate-/r*40.7%
*-commutative40.7%
Simplified40.7%
*-un-lft-identity40.7%
*-commutative40.7%
times-frac40.7%
associate-/l/40.7%
inv-pow40.7%
sqrt-pow240.7%
metadata-eval40.7%
inv-pow40.7%
sqrt-pow240.7%
metadata-eval40.7%
Applied egg-rr40.7%
associate-*l/39.5%
associate-/l/38.4%
associate-*r/38.4%
pow-sqr95.3%
metadata-eval95.3%
Simplified95.3%
Taylor expanded in z around inf 67.1%
associate-/r*67.1%
associate-/r*68.9%
associate-/r*68.9%
Simplified68.9%
associate-/l/68.9%
div-inv68.9%
unpow268.9%
times-frac96.4%
Applied egg-rr96.4%
Final simplification97.0%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(let* ((t_0 (* y_m (+ 1.0 (* z_m z_m)))))
(*
y_s
(*
x_s
(if (<= t_0 4e+307)
(/ (/ 1.0 x_m) t_0)
(* (/ (/ 1.0 y_m) z_m) (/ (/ 1.0 x_m) z_m)))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= 4e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
real(8) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z_m * z_m))
if (t_0 <= 4d+307) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = ((1.0d0 / y_m) / z_m) * ((1.0d0 / x_m) / z_m)
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double t_0 = y_m * (1.0 + (z_m * z_m));
double tmp;
if (t_0 <= 4e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): t_0 = y_m * (1.0 + (z_m * z_m)) tmp = 0 if t_0 <= 4e+307: tmp = (1.0 / x_m) / t_0 else: tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) t_0 = Float64(y_m * Float64(1.0 + Float64(z_m * z_m))) tmp = 0.0 if (t_0 <= 4e+307) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(Float64(1.0 / y_m) / z_m) * Float64(Float64(1.0 / x_m) / z_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
t_0 = y_m * (1.0 + (z_m * z_m));
tmp = 0.0;
if (t_0 <= 4e+307)
tmp = (1.0 / x_m) / t_0;
else
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 4e+307], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z\_m \cdot z\_m\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{z\_m} \cdot \frac{\frac{1}{x\_m}}{z\_m}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 3.99999999999999994e307Initial program 91.5%
if 3.99999999999999994e307 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 72.9%
associate-/l/72.9%
associate-*l*78.8%
*-commutative78.8%
sqr-neg78.8%
+-commutative78.8%
sqr-neg78.8%
fma-define78.8%
Simplified78.8%
associate-*r*78.5%
*-commutative78.5%
associate-/r*78.4%
*-commutative78.4%
associate-/l/78.4%
fma-undefine78.4%
+-commutative78.4%
associate-/r*72.9%
*-un-lft-identity72.9%
add-sqr-sqrt72.9%
times-frac72.9%
+-commutative72.9%
fma-undefine72.9%
*-commutative72.9%
sqrt-prod72.9%
fma-undefine72.9%
+-commutative72.9%
hypot-1-def72.9%
+-commutative72.9%
Applied egg-rr99.8%
associate-/l/99.8%
associate-*r/99.8%
*-rgt-identity99.8%
*-commutative99.8%
associate-/r*99.8%
*-commutative99.8%
Simplified99.8%
*-un-lft-identity99.8%
*-commutative99.8%
times-frac99.8%
associate-/l/99.8%
inv-pow99.8%
sqrt-pow299.8%
metadata-eval99.8%
inv-pow99.8%
sqrt-pow299.8%
metadata-eval99.8%
Applied egg-rr99.8%
associate-*l/99.8%
associate-/l/97.0%
associate-*r/97.1%
pow-sqr97.0%
metadata-eval97.0%
Simplified97.0%
Taylor expanded in z around inf 72.9%
associate-/r*72.9%
associate-/r*78.4%
associate-/r*78.4%
Simplified78.4%
associate-/l/78.4%
div-inv78.4%
unpow278.4%
times-frac94.0%
Applied egg-rr94.0%
Final simplification91.8%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= z_m 1.0)
(/ (/ 1.0 y_m) x_m)
(* (/ 1.0 z_m) (/ 1.0 (* x_m (* y_m z_m))))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / z_m) * (1.0 / (x_m * (y_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
real(8) :: tmp
if (z_m <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = (1.0d0 / z_m) * (1.0d0 / (x_m * (y_m * z_m)))
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (1.0 / z_m) * (1.0 / (x_m * (y_m * z_m)));
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if z_m <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = (1.0 / z_m) * (1.0 / (x_m * (y_m * z_m))) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(1.0 / z_m) * Float64(1.0 / Float64(x_m * Float64(y_m * z_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if (z_m <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = (1.0 / z_m) * (1.0 / (x_m * (y_m * z_m)));
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * N[(y$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z\_m} \cdot \frac{1}{x\_m \cdot \left(y\_m \cdot z\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1Initial program 91.7%
associate-/l/91.5%
associate-*l*92.0%
*-commutative92.0%
sqr-neg92.0%
+-commutative92.0%
sqr-neg92.0%
fma-define92.0%
Simplified92.0%
Taylor expanded in z around 0 71.7%
add-sqr-sqrt44.9%
pow244.9%
inv-pow44.9%
*-commutative44.9%
sqrt-pow144.9%
metadata-eval44.9%
Applied egg-rr44.9%
pow-pow71.7%
metadata-eval71.7%
inv-pow71.7%
associate-/l/71.7%
Applied egg-rr71.7%
if 1 < z Initial program 80.5%
associate-/l/80.4%
associate-*l*80.3%
*-commutative80.3%
sqr-neg80.3%
+-commutative80.3%
sqr-neg80.3%
fma-define80.3%
Simplified80.3%
associate-*r*79.4%
*-commutative79.4%
associate-/r*78.3%
*-commutative78.3%
associate-/l/78.2%
fma-undefine78.2%
+-commutative78.2%
associate-/r*80.5%
*-un-lft-identity80.5%
add-sqr-sqrt42.2%
times-frac42.3%
+-commutative42.3%
fma-undefine42.3%
*-commutative42.3%
sqrt-prod42.3%
fma-undefine42.3%
+-commutative42.3%
hypot-1-def42.3%
+-commutative42.3%
Applied egg-rr47.2%
associate-/l/47.2%
associate-*r/47.2%
*-rgt-identity47.2%
*-commutative47.2%
associate-/r*47.2%
*-commutative47.2%
Simplified47.2%
*-un-lft-identity47.2%
*-commutative47.2%
times-frac47.1%
associate-/l/47.1%
inv-pow47.1%
sqrt-pow247.1%
metadata-eval47.1%
inv-pow47.1%
sqrt-pow247.2%
metadata-eval47.2%
Applied egg-rr47.2%
associate-*l/45.6%
associate-/l/43.9%
associate-*r/43.9%
pow-sqr96.3%
metadata-eval96.3%
Simplified96.3%
Taylor expanded in z around inf 75.7%
associate-/r*75.7%
associate-/r*73.5%
associate-/r*73.6%
Simplified73.6%
associate-/l/73.5%
*-un-lft-identity73.5%
associate-*r/73.5%
unpow273.5%
times-frac81.4%
clear-num81.4%
associate-/r*83.3%
associate-/l/83.2%
associate-/r/83.2%
/-rgt-identity83.2%
associate-/r*83.3%
*-commutative83.3%
associate-*l*92.0%
Applied egg-rr92.0%
Final simplification76.2%
z_m = (fabs.f64 z)
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_m should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z_m)
:precision binary64
(*
y_s
(*
x_s
(if (<= z_m 1.0)
(/ (/ 1.0 y_m) x_m)
(* (/ (/ 1.0 y_m) z_m) (/ (/ 1.0 x_m) z_m))))))z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
real(8) :: tmp
if (z_m <= 1.0d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = ((1.0d0 / y_m) / z_m) * ((1.0d0 / x_m) / z_m)
end if
code = y_s * (x_s * tmp)
end function
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
double tmp;
if (z_m <= 1.0) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
}
return y_s * (x_s * tmp);
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): tmp = 0 if z_m <= 1.0: tmp = (1.0 / y_m) / x_m else: tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m) return y_s * (x_s * tmp)
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) tmp = 0.0 if (z_m <= 1.0) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(Float64(1.0 / y_m) / z_m) * Float64(Float64(1.0 / x_m) / z_m)); end return Float64(y_s * Float64(x_s * tmp)) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z_m)
tmp = 0.0;
if (z_m <= 1.0)
tmp = (1.0 / y_m) / x_m;
else
tmp = ((1.0 / y_m) / z_m) * ((1.0 / x_m) / z_m);
end
tmp_2 = y_s * (x_s * tmp);
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.0], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(1.0 / y$95$m), $MachinePrecision] / z$95$m), $MachinePrecision] * N[(N[(1.0 / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{z\_m} \cdot \frac{\frac{1}{x\_m}}{z\_m}\\
\end{array}\right)
\end{array}
if z < 1Initial program 91.7%
associate-/l/91.5%
associate-*l*92.0%
*-commutative92.0%
sqr-neg92.0%
+-commutative92.0%
sqr-neg92.0%
fma-define92.0%
Simplified92.0%
Taylor expanded in z around 0 71.7%
add-sqr-sqrt44.9%
pow244.9%
inv-pow44.9%
*-commutative44.9%
sqrt-pow144.9%
metadata-eval44.9%
Applied egg-rr44.9%
pow-pow71.7%
metadata-eval71.7%
inv-pow71.7%
associate-/l/71.7%
Applied egg-rr71.7%
if 1 < z Initial program 80.5%
associate-/l/80.4%
associate-*l*80.3%
*-commutative80.3%
sqr-neg80.3%
+-commutative80.3%
sqr-neg80.3%
fma-define80.3%
Simplified80.3%
associate-*r*79.4%
*-commutative79.4%
associate-/r*78.3%
*-commutative78.3%
associate-/l/78.2%
fma-undefine78.2%
+-commutative78.2%
associate-/r*80.5%
*-un-lft-identity80.5%
add-sqr-sqrt42.2%
times-frac42.3%
+-commutative42.3%
fma-undefine42.3%
*-commutative42.3%
sqrt-prod42.3%
fma-undefine42.3%
+-commutative42.3%
hypot-1-def42.3%
+-commutative42.3%
Applied egg-rr47.2%
associate-/l/47.2%
associate-*r/47.2%
*-rgt-identity47.2%
*-commutative47.2%
associate-/r*47.2%
*-commutative47.2%
Simplified47.2%
*-un-lft-identity47.2%
*-commutative47.2%
times-frac47.1%
associate-/l/47.1%
inv-pow47.1%
sqrt-pow247.1%
metadata-eval47.1%
inv-pow47.1%
sqrt-pow247.2%
metadata-eval47.2%
Applied egg-rr47.2%
associate-*l/45.6%
associate-/l/43.9%
associate-*r/43.9%
pow-sqr96.3%
metadata-eval96.3%
Simplified96.3%
Taylor expanded in z around inf 75.7%
associate-/r*75.7%
associate-/r*73.5%
associate-/r*73.6%
Simplified73.6%
associate-/l/73.5%
div-inv73.5%
unpow273.5%
times-frac92.9%
Applied egg-rr92.9%
Final simplification76.4%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (/ 1.0 (* y_m x_m)))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
code = y_s * (x_s * (1.0d0 / (y_m * x_m)))
end function
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * (1.0 / (y_m * x_m)))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * x_m)))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * (1.0 / (y_m * x_m)));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := 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}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{y\_m \cdot x\_m}\right)
\end{array}
Initial program 89.2%
associate-/l/89.1%
associate-*l*89.4%
*-commutative89.4%
sqr-neg89.4%
+-commutative89.4%
sqr-neg89.4%
fma-define89.4%
Simplified89.4%
Taylor expanded in z around 0 59.5%
Final simplification59.5%
z_m = (fabs.f64 z) 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_m should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z_m) :precision binary64 (* y_s (* x_s (/ (/ 1.0 y_m) x_m))))
z_m = fabs(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_m);
double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
z_m = abs(z)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z_m should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z_m)
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_m
code = y_s * (x_s * ((1.0d0 / y_m) / x_m))
end function
z_m = Math.abs(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_m;
public static double code(double y_s, double x_s, double x_m, double y_m, double z_m) {
return y_s * (x_s * ((1.0 / y_m) / x_m));
}
z_m = math.fabs(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_m] = sort([x_m, y_m, z_m]) def code(y_s, x_s, x_m, y_m, z_m): return y_s * (x_s * ((1.0 / y_m) / x_m))
z_m = abs(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_m = sort([x_m, y_m, z_m]) function code(y_s, x_s, x_m, y_m, z_m) return Float64(y_s * Float64(x_s * Float64(Float64(1.0 / y_m) / x_m))) end
z_m = abs(z);
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_m = num2cell(sort([x_m, y_m, z_m])){:}
function tmp = code(y_s, x_s, x_m, y_m, z_m)
tmp = y_s * (x_s * ((1.0 / y_m) / x_m));
end
z_m = N[Abs[z], $MachinePrecision]
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_m should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := 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}
z_m = \left|z\right|
\\
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_m] = \mathsf{sort}([x_m, y_m, z_m])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{y\_m}}{x\_m}\right)
\end{array}
Initial program 89.2%
associate-/l/89.1%
associate-*l*89.4%
*-commutative89.4%
sqr-neg89.4%
+-commutative89.4%
sqr-neg89.4%
fma-define89.4%
Simplified89.4%
Taylor expanded in z around 0 59.5%
add-sqr-sqrt38.3%
pow238.3%
inv-pow38.3%
*-commutative38.3%
sqrt-pow138.4%
metadata-eval38.4%
Applied egg-rr38.4%
pow-pow59.5%
metadata-eval59.5%
inv-pow59.5%
associate-/l/59.5%
Applied egg-rr59.5%
Final simplification59.5%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
(if (< t_1 (- INFINITY))
t_2
(if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))
double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z): t_0 = 1.0 + (z * z) t_1 = y * t_0 t_2 = (1.0 / y) / (t_0 * x) tmp = 0 if t_1 < -math.inf: tmp = t_2 elif t_1 < 8.680743250567252e+305: tmp = (1.0 / x) / (t_0 * y) else: tmp = t_2 return tmp
function code(x, y, z) t_0 = Float64(1.0 + Float64(z * z)) t_1 = Float64(y * t_0) t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x)) tmp = 0.0 if (t_1 < Float64(-Inf)) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z) t_0 = 1.0 + (z * z); t_1 = y * t_0; t_2 = (1.0 / y) / (t_0 * x); tmp = 0.0; if (t_1 < -Inf) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = (1.0 / x) / (t_0 * y); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + z \cdot z\\
t_1 := y \cdot t\_0\\
t_2 := \frac{\frac{1}{y}}{t\_0 \cdot x}\\
\mathbf{if}\;t\_1 < -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 < 8.680743250567252 \cdot 10^{+305}:\\
\;\;\;\;\frac{\frac{1}{x}}{t\_0 \cdot y}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024081
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))