
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 2e+302)
(/ (/ (/ 1.0 x_m) (fma z z 1.0)) y_m)
(/ (/ 1.0 (* y_m z)) (* z x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+302) {
tmp = ((1.0 / x_m) / fma(z, z, 1.0)) / y_m;
} else {
tmp = (1.0 / (y_m * z)) / (z * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+302) tmp = Float64(Float64(Float64(1.0 / x_m) / fma(z, z, 1.0)) / y_m); else tmp = Float64(Float64(1.0 / Float64(y_m * z)) / Float64(z * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+302], N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(y$95$m * z), $MachinePrecision]), $MachinePrecision] / N[(z * 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}\;z \cdot z \leq 2 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{\mathsf{fma}\left(z, z, 1\right)}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m \cdot z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.0000000000000002e302Initial program 97.1%
associate-/l/97.2%
associate-*l*97.1%
*-commutative97.1%
sqr-neg97.1%
+-commutative97.1%
sqr-neg97.1%
fma-define97.1%
Simplified97.1%
associate-*r*97.6%
*-commutative97.6%
*-commutative97.6%
add-sqr-sqrt50.3%
sqrt-div42.4%
metadata-eval42.4%
sqrt-prod42.4%
fma-undefine42.4%
+-commutative42.4%
hypot-1-def42.4%
sqrt-div42.4%
metadata-eval42.4%
sqrt-prod42.4%
fma-undefine42.4%
+-commutative42.4%
hypot-1-def42.4%
Applied egg-rr42.4%
unpow-142.4%
unpow-142.4%
pow-sqr42.4%
metadata-eval42.4%
Simplified42.4%
unpow-prod-down42.4%
hypot-undefine42.4%
sqrt-pow242.4%
metadata-eval42.4%
+-commutative42.4%
fma-undefine42.4%
metadata-eval42.4%
inv-pow42.4%
sqrt-pow297.6%
metadata-eval97.6%
inv-pow97.6%
associate-/r*97.6%
times-frac97.1%
*-un-lft-identity97.1%
associate-/r*97.3%
Applied egg-rr97.3%
if 2.0000000000000002e302 < (*.f64 z z) Initial program 78.4%
associate-/l/78.4%
associate-*l*79.8%
*-commutative79.8%
sqr-neg79.8%
+-commutative79.8%
sqr-neg79.8%
fma-define79.8%
Simplified79.8%
associate-*r*79.6%
*-commutative79.6%
associate-/r*79.6%
*-commutative79.6%
associate-/l/79.6%
fma-undefine79.6%
+-commutative79.6%
associate-/r*78.4%
*-un-lft-identity78.4%
add-sqr-sqrt35.4%
times-frac35.4%
+-commutative35.4%
fma-undefine35.4%
*-commutative35.4%
sqrt-prod35.4%
fma-undefine35.4%
+-commutative35.4%
hypot-1-def35.4%
+-commutative35.4%
Applied egg-rr42.4%
associate-/l/42.3%
associate-*r/42.4%
*-rgt-identity42.4%
*-commutative42.4%
associate-/r*42.4%
*-commutative42.4%
Simplified42.4%
Taylor expanded in z around inf 78.4%
associate-*r*79.6%
associate-/r*79.6%
Simplified79.6%
associate-/l/79.6%
div-inv79.6%
unpow279.6%
times-frac99.9%
Applied egg-rr99.9%
associate-/l/99.8%
un-div-inv99.8%
associate-/l/99.8%
*-commutative99.8%
Applied egg-rr99.8%
Final simplification97.9%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(/
(/ (/ 1.0 (sqrt y_m)) (hypot 1.0 z))
(* x_m (* (sqrt y_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 / sqrt(y_m)) / hypot(1.0, z)) / (x_m * (sqrt(y_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 / Math.sqrt(y_m)) / Math.hypot(1.0, z)) / (x_m * (Math.sqrt(y_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 / math.sqrt(y_m)) / math.hypot(1.0, z)) / (x_m * (math.sqrt(y_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(Float64(1.0 / sqrt(y_m)) / hypot(1.0, z)) / Float64(x_m * Float64(sqrt(y_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 / sqrt(y_m)) / hypot(1.0, z)) / (x_m * (sqrt(y_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[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(N[Sqrt[y$95$m], $MachinePrecision] * 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{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\right)}}{x\_m \cdot \left(\sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\right)\right)}\right)
\end{array}
Initial program 92.3%
associate-/l/92.3%
associate-*l*92.7%
*-commutative92.7%
sqr-neg92.7%
+-commutative92.7%
sqr-neg92.7%
fma-define92.7%
Simplified92.7%
associate-*r*93.0%
*-commutative93.0%
associate-/r*93.0%
*-commutative93.0%
associate-/l/93.0%
fma-undefine93.0%
+-commutative93.0%
associate-/r*92.3%
*-un-lft-identity92.3%
add-sqr-sqrt43.0%
times-frac42.9%
+-commutative42.9%
fma-undefine42.9%
*-commutative42.9%
sqrt-prod42.9%
fma-undefine42.9%
+-commutative42.9%
hypot-1-def42.9%
+-commutative42.9%
Applied egg-rr45.1%
associate-/l/45.1%
associate-*r/45.1%
*-rgt-identity45.1%
*-commutative45.1%
associate-/r*45.1%
*-commutative45.1%
Simplified45.1%
Final simplification45.1%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (pow (* (hypot 1.0 z) (* (sqrt y_m) (sqrt x_m))) -2.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 * pow((hypot(1.0, z) * (sqrt(y_m) * sqrt(x_m))), -2.0));
}
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((Math.hypot(1.0, z) * (Math.sqrt(y_m) * Math.sqrt(x_m))), -2.0));
}
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((math.hypot(1.0, z) * (math.sqrt(y_m) * math.sqrt(x_m))), -2.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(hypot(1.0, z) * Float64(sqrt(y_m) * sqrt(x_m))) ^ -2.0))) 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 * ((hypot(1.0, z) * (sqrt(y_m) * sqrt(x_m))) ^ -2.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[Power[N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(N[Sqrt[y$95$m], $MachinePrecision] * N[Sqrt[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2.0], $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 {\left(\mathsf{hypot}\left(1, z\right) \cdot \left(\sqrt{y\_m} \cdot \sqrt{x\_m}\right)\right)}^{-2}\right)
\end{array}
Initial program 92.3%
associate-/l/92.3%
associate-*l*92.7%
*-commutative92.7%
sqr-neg92.7%
+-commutative92.7%
sqr-neg92.7%
fma-define92.7%
Simplified92.7%
associate-*r*93.0%
*-commutative93.0%
*-commutative93.0%
add-sqr-sqrt57.5%
sqrt-div42.1%
metadata-eval42.1%
sqrt-prod42.1%
fma-undefine42.1%
+-commutative42.1%
hypot-1-def42.1%
sqrt-div42.1%
metadata-eval42.1%
sqrt-prod42.1%
fma-undefine42.1%
+-commutative42.1%
hypot-1-def43.2%
Applied egg-rr43.2%
unpow-143.2%
unpow-143.2%
pow-sqr43.2%
metadata-eval43.2%
Simplified43.2%
*-commutative43.2%
sqrt-prod20.6%
Applied egg-rr20.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 (pow (* (hypot 1.0 z) (sqrt x_m)) 2.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 * pow((hypot(1.0, z) * sqrt(x_m)), 2.0))));
}
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.pow((Math.hypot(1.0, z) * Math.sqrt(x_m)), 2.0))));
}
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.pow((math.hypot(1.0, z) * math.sqrt(x_m)), 2.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(hypot(1.0, z) * sqrt(x_m)) ^ 2.0))))) 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) * sqrt(x_m)) ^ 2.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[Power[N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[x$95$m], $MachinePrecision]), $MachinePrecision], 2.0], $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(\mathsf{hypot}\left(1, z\right) \cdot \sqrt{x\_m}\right)}^{2}}\right)
\end{array}
Initial program 92.3%
associate-/l/92.3%
associate-*l*92.7%
*-commutative92.7%
sqr-neg92.7%
+-commutative92.7%
sqr-neg92.7%
fma-define92.7%
Simplified92.7%
add-sqr-sqrt47.1%
pow247.1%
*-commutative47.1%
sqrt-prod47.1%
fma-undefine47.1%
+-commutative47.1%
hypot-1-def48.2%
Applied egg-rr48.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
(if (<= (* z z) 2e+302)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(/ (/ 1.0 (* y_m z)) (* z x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+302) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = (1.0 / (y_m * z)) / (z * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+302) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(1.0 / Float64(y_m * z)) / Float64(z * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+302], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(y$95$m * z), $MachinePrecision]), $MachinePrecision] / N[(z * 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}\;z \cdot z \leq 2 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m \cdot z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.0000000000000002e302Initial program 97.1%
associate-/l/97.2%
associate-*l*97.1%
*-commutative97.1%
sqr-neg97.1%
+-commutative97.1%
sqr-neg97.1%
fma-define97.1%
Simplified97.1%
associate-*r*97.6%
*-commutative97.6%
*-commutative97.6%
add-sqr-sqrt50.3%
sqrt-div42.4%
metadata-eval42.4%
sqrt-prod42.4%
fma-undefine42.4%
+-commutative42.4%
hypot-1-def42.4%
sqrt-div42.4%
metadata-eval42.4%
sqrt-prod42.4%
fma-undefine42.4%
+-commutative42.4%
hypot-1-def42.4%
Applied egg-rr42.4%
unpow-142.4%
unpow-142.4%
pow-sqr42.4%
metadata-eval42.4%
Simplified42.4%
unpow-prod-down42.4%
sqrt-pow297.7%
metadata-eval97.7%
inv-pow97.7%
*-commutative97.7%
hypot-undefine97.7%
sqrt-pow297.6%
metadata-eval97.6%
+-commutative97.6%
fma-undefine97.6%
metadata-eval97.6%
inv-pow97.6%
associate-*r/97.6%
*-commutative97.6%
*-un-lft-identity97.6%
associate-/l/97.7%
associate-/l/97.2%
Applied egg-rr97.2%
if 2.0000000000000002e302 < (*.f64 z z) Initial program 78.4%
associate-/l/78.4%
associate-*l*79.8%
*-commutative79.8%
sqr-neg79.8%
+-commutative79.8%
sqr-neg79.8%
fma-define79.8%
Simplified79.8%
associate-*r*79.6%
*-commutative79.6%
associate-/r*79.6%
*-commutative79.6%
associate-/l/79.6%
fma-undefine79.6%
+-commutative79.6%
associate-/r*78.4%
*-un-lft-identity78.4%
add-sqr-sqrt35.4%
times-frac35.4%
+-commutative35.4%
fma-undefine35.4%
*-commutative35.4%
sqrt-prod35.4%
fma-undefine35.4%
+-commutative35.4%
hypot-1-def35.4%
+-commutative35.4%
Applied egg-rr42.4%
associate-/l/42.3%
associate-*r/42.4%
*-rgt-identity42.4%
*-commutative42.4%
associate-/r*42.4%
*-commutative42.4%
Simplified42.4%
Taylor expanded in z around inf 78.4%
associate-*r*79.6%
associate-/r*79.6%
Simplified79.6%
associate-/l/79.6%
div-inv79.6%
unpow279.6%
times-frac99.9%
Applied egg-rr99.9%
associate-/l/99.8%
un-div-inv99.8%
associate-/l/99.8%
*-commutative99.8%
Applied egg-rr99.8%
Final simplification97.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 (<= (* z z) 2e+302)
(/ 1.0 (* y_m (* x_m (fma z z 1.0))))
(/ (/ 1.0 (* y_m z)) (* z x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+302) {
tmp = 1.0 / (y_m * (x_m * fma(z, z, 1.0)));
} else {
tmp = (1.0 / (y_m * z)) / (z * x_m);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+302) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.0)))); else tmp = Float64(Float64(1.0 / Float64(y_m * z)) / Float64(z * x_m)); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+302], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(y$95$m * z), $MachinePrecision]), $MachinePrecision] / N[(z * 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}\;z \cdot z \leq 2 \cdot 10^{+302}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{y\_m \cdot z}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.0000000000000002e302Initial program 97.1%
associate-/l/97.2%
associate-*l*97.1%
*-commutative97.1%
sqr-neg97.1%
+-commutative97.1%
sqr-neg97.1%
fma-define97.1%
Simplified97.1%
if 2.0000000000000002e302 < (*.f64 z z) Initial program 78.4%
associate-/l/78.4%
associate-*l*79.8%
*-commutative79.8%
sqr-neg79.8%
+-commutative79.8%
sqr-neg79.8%
fma-define79.8%
Simplified79.8%
associate-*r*79.6%
*-commutative79.6%
associate-/r*79.6%
*-commutative79.6%
associate-/l/79.6%
fma-undefine79.6%
+-commutative79.6%
associate-/r*78.4%
*-un-lft-identity78.4%
add-sqr-sqrt35.4%
times-frac35.4%
+-commutative35.4%
fma-undefine35.4%
*-commutative35.4%
sqrt-prod35.4%
fma-undefine35.4%
+-commutative35.4%
hypot-1-def35.4%
+-commutative35.4%
Applied egg-rr42.4%
associate-/l/42.3%
associate-*r/42.4%
*-rgt-identity42.4%
*-commutative42.4%
associate-/r*42.4%
*-commutative42.4%
Simplified42.4%
Taylor expanded in z around inf 78.4%
associate-*r*79.6%
associate-/r*79.6%
Simplified79.6%
associate-/l/79.6%
div-inv79.6%
unpow279.6%
times-frac99.9%
Applied egg-rr99.9%
associate-/l/99.8%
un-div-inv99.8%
associate-/l/99.8%
*-commutative99.8%
Applied egg-rr99.8%
Final simplification97.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 (<= (* z z) 1e+77)
(/ (/ 1.0 x_m) (* y_m (+ 1.0 (* z z))))
(/ (/ -1.0 y_m) (* (* z x_m) (- 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+77) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1d+77) then
tmp = (1.0d0 / x_m) / (y_m * (1.0d0 + (z * z)))
else
tmp = ((-1.0d0) / y_m) / ((z * x_m) * -z)
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 1e+77) {
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
} else {
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 1e+77: tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z))) else: tmp = (-1.0 / y_m) / ((z * x_m) * -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+77) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(-1.0 / y_m) / Float64(Float64(z * x_m) * Float64(-z))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 1e+77)
tmp = (1.0 / x_m) / (y_m * (1.0 + (z * z)));
else
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+77], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / y$95$m), $MachinePrecision] / N[(N[(z * x$95$m), $MachinePrecision] * (-z)), $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^{+77}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{y\_m}}{\left(z \cdot x\_m\right) \cdot \left(-z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 9.99999999999999983e76Initial program 99.6%
if 9.99999999999999983e76 < (*.f64 z z) Initial program 81.0%
associate-/l/81.0%
associate-*l*81.8%
*-commutative81.8%
sqr-neg81.8%
+-commutative81.8%
sqr-neg81.8%
fma-define81.8%
Simplified81.8%
associate-*r*83.6%
*-commutative83.6%
associate-/r*83.6%
*-commutative83.6%
associate-/l/83.6%
fma-undefine83.6%
+-commutative83.6%
associate-/r*81.0%
*-un-lft-identity81.0%
add-sqr-sqrt34.4%
times-frac34.4%
+-commutative34.4%
fma-undefine34.4%
*-commutative34.4%
sqrt-prod34.4%
fma-undefine34.4%
+-commutative34.4%
hypot-1-def34.4%
+-commutative34.4%
Applied egg-rr39.9%
associate-/l/39.9%
associate-*r/39.9%
*-rgt-identity39.9%
*-commutative39.9%
associate-/r*39.9%
*-commutative39.9%
Simplified39.9%
Taylor expanded in z around inf 81.0%
associate-*r*83.6%
associate-/r*83.6%
Simplified83.6%
associate-/l/83.6%
div-inv83.6%
unpow283.6%
times-frac96.5%
Applied egg-rr96.5%
*-commutative96.5%
clear-num96.4%
frac-2neg96.4%
frac-times89.4%
*-un-lft-identity89.4%
distribute-neg-frac89.4%
metadata-eval89.4%
div-inv89.4%
clear-num89.4%
/-rgt-identity89.4%
*-commutative89.4%
Applied egg-rr89.4%
Final simplification95.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
(if (<= (* z z) 0.005)
(/ (/ 1.0 y_m) x_m)
(/ (/ -1.0 y_m) (* (* z x_m) (- 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) <= 0.005) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.005d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = ((-1.0d0) / y_m) / ((z * x_m) * -z)
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 0.005) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 0.005: tmp = (1.0 / y_m) / x_m else: tmp = (-1.0 / y_m) / ((z * x_m) * -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) <= 0.005) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(Float64(-1.0 / y_m) / Float64(Float64(z * x_m) * Float64(-z))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 0.005)
tmp = (1.0 / y_m) / x_m;
else
tmp = (-1.0 / y_m) / ((z * x_m) * -z);
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 0.005], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(-1.0 / y$95$m), $MachinePrecision] / N[(N[(z * x$95$m), $MachinePrecision] * (-z)), $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 0.005:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{y\_m}}{\left(z \cdot x\_m\right) \cdot \left(-z\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 0.0050000000000000001Initial program 99.6%
associate-/l/99.6%
associate-*l*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
sqr-neg99.6%
fma-define99.6%
Simplified99.6%
Taylor expanded in z around 0 98.4%
inv-pow98.4%
*-commutative98.4%
metadata-eval98.4%
sqrt-pow243.3%
add-sqr-sqrt43.1%
unpow-prod-down43.1%
pow1/243.1%
sqrt-pow143.2%
metadata-eval43.2%
pow1/248.1%
sqrt-pow148.1%
metadata-eval48.1%
Applied egg-rr48.1%
pow-sqr48.1%
metadata-eval48.1%
Simplified48.1%
pow-pow98.4%
metadata-eval98.4%
inv-pow98.4%
associate-/l/98.5%
Applied egg-rr98.5%
if 0.0050000000000000001 < (*.f64 z z) Initial program 83.3%
associate-/l/83.4%
associate-*l*84.1%
*-commutative84.1%
sqr-neg84.1%
+-commutative84.1%
sqr-neg84.1%
fma-define84.1%
Simplified84.1%
associate-*r*84.8%
*-commutative84.8%
associate-/r*84.8%
*-commutative84.8%
associate-/l/84.9%
fma-undefine84.9%
+-commutative84.9%
associate-/r*83.3%
*-un-lft-identity83.3%
add-sqr-sqrt35.9%
times-frac36.0%
+-commutative36.0%
fma-undefine36.0%
*-commutative36.0%
sqrt-prod35.9%
fma-undefine35.9%
+-commutative35.9%
hypot-1-def35.9%
+-commutative35.9%
Applied egg-rr40.7%
associate-/l/40.7%
associate-*r/40.7%
*-rgt-identity40.7%
*-commutative40.7%
associate-/r*40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in z around inf 82.3%
associate-*r*83.8%
associate-/r*83.8%
Simplified83.8%
associate-/l/83.8%
div-inv83.8%
unpow283.8%
times-frac95.9%
Applied egg-rr95.9%
*-commutative95.9%
clear-num95.8%
frac-2neg95.8%
frac-times89.6%
*-un-lft-identity89.6%
distribute-neg-frac89.6%
metadata-eval89.6%
div-inv89.6%
clear-num89.7%
/-rgt-identity89.7%
*-commutative89.7%
Applied egg-rr89.7%
Final simplification94.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) 0.005)
(/ (/ 1.0 y_m) x_m)
(/ 1.0 (* (* y_m z) (* z x_m)))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 0.005) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / ((y_m * z) * (z * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.005d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = 1.0d0 / ((y_m * z) * (z * x_m))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 0.005) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / ((y_m * z) * (z * x_m));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 0.005: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / ((y_m * z) * (z * x_m)) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 0.005) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(Float64(y_m * z) * Float64(z * x_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 0.005)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / ((y_m * z) * (z * x_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 0.005], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(N[(y$95$m * z), $MachinePrecision] * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.005:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(y\_m \cdot z\right) \cdot \left(z \cdot x\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 0.0050000000000000001Initial program 99.6%
associate-/l/99.6%
associate-*l*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
sqr-neg99.6%
fma-define99.6%
Simplified99.6%
Taylor expanded in z around 0 98.4%
inv-pow98.4%
*-commutative98.4%
metadata-eval98.4%
sqrt-pow243.3%
add-sqr-sqrt43.1%
unpow-prod-down43.1%
pow1/243.1%
sqrt-pow143.2%
metadata-eval43.2%
pow1/248.1%
sqrt-pow148.1%
metadata-eval48.1%
Applied egg-rr48.1%
pow-sqr48.1%
metadata-eval48.1%
Simplified48.1%
pow-pow98.4%
metadata-eval98.4%
inv-pow98.4%
associate-/l/98.5%
Applied egg-rr98.5%
if 0.0050000000000000001 < (*.f64 z z) Initial program 83.3%
associate-/l/83.4%
associate-*l*84.1%
*-commutative84.1%
sqr-neg84.1%
+-commutative84.1%
sqr-neg84.1%
fma-define84.1%
Simplified84.1%
associate-*r*84.8%
*-commutative84.8%
associate-/r*84.8%
*-commutative84.8%
associate-/l/84.9%
fma-undefine84.9%
+-commutative84.9%
associate-/r*83.3%
*-un-lft-identity83.3%
add-sqr-sqrt35.9%
times-frac36.0%
+-commutative36.0%
fma-undefine36.0%
*-commutative36.0%
sqrt-prod35.9%
fma-undefine35.9%
+-commutative35.9%
hypot-1-def35.9%
+-commutative35.9%
Applied egg-rr40.7%
associate-/l/40.7%
associate-*r/40.7%
*-rgt-identity40.7%
*-commutative40.7%
associate-/r*40.8%
*-commutative40.8%
Simplified40.8%
Taylor expanded in z around inf 82.3%
associate-*r*83.8%
associate-/r*83.8%
Simplified83.8%
associate-/l/83.8%
div-inv83.8%
unpow283.8%
times-frac95.9%
Applied egg-rr95.9%
*-commutative95.9%
clear-num95.8%
clear-num95.3%
frac-times95.4%
metadata-eval95.4%
div-inv95.4%
clear-num95.4%
/-rgt-identity95.4%
*-commutative95.4%
div-inv95.4%
clear-num95.4%
/-rgt-identity95.4%
Applied egg-rr95.4%
Final simplification97.1%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 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 92.3%
associate-/l/92.3%
associate-*l*92.7%
*-commutative92.7%
sqr-neg92.7%
+-commutative92.7%
sqr-neg92.7%
fma-define92.7%
Simplified92.7%
Taylor expanded in z around 0 63.0%
(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 2024087
(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)))))