
(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) 5e+296)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(* (/ 1.0 z) (/ (/ 1.0 y_m) (* 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) <= 5e+296) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = (1.0 / z) * ((1.0 / y_m) / (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) <= 5e+296) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(1.0 / z) * Float64(Float64(1.0 / y_m) / Float64(x_m * z))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+296], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+296}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{\frac{1}{y\_m}}{x\_m \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.0000000000000001e296Initial program 96.0%
associate-/l/95.3%
associate-*l*93.7%
*-commutative93.7%
sqr-neg93.7%
+-commutative93.7%
sqr-neg93.7%
fma-define93.7%
Simplified93.7%
*-commutative93.7%
associate-*r*95.3%
fma-undefine95.3%
+-commutative95.3%
associate-/l/96.0%
add-sqr-sqrt50.1%
sqrt-div22.0%
inv-pow22.0%
sqrt-pow122.0%
metadata-eval22.0%
+-commutative22.0%
fma-undefine22.0%
*-commutative22.0%
sqrt-prod22.0%
fma-undefine22.0%
+-commutative22.0%
hypot-1-def22.0%
sqrt-div21.9%
Applied egg-rr22.8%
unpow222.8%
Simplified22.8%
unpow222.8%
frac-times21.8%
pow-prod-up47.0%
metadata-eval47.0%
inv-pow47.0%
*-un-lft-identity47.0%
*-commutative47.0%
*-commutative47.0%
swap-sqr47.1%
add-sqr-sqrt96.0%
hypot-undefine96.0%
hypot-undefine96.0%
rem-square-sqrt96.0%
metadata-eval96.0%
unpow296.0%
+-commutative96.0%
unpow296.0%
fma-undefine96.0%
frac-times95.3%
Applied egg-rr95.4%
if 5.0000000000000001e296 < (*.f64 z z) Initial program 70.2%
associate-/l/70.2%
associate-*l*70.2%
*-commutative70.2%
sqr-neg70.2%
+-commutative70.2%
sqr-neg70.2%
fma-define70.2%
Simplified70.2%
*-commutative70.2%
associate-*r*70.2%
fma-undefine70.2%
+-commutative70.2%
associate-/l/70.2%
add-sqr-sqrt70.2%
sqrt-div20.1%
inv-pow20.1%
sqrt-pow120.1%
metadata-eval20.1%
+-commutative20.1%
fma-undefine20.1%
*-commutative20.1%
sqrt-prod20.1%
fma-undefine20.1%
+-commutative20.1%
hypot-1-def20.1%
sqrt-div20.1%
Applied egg-rr27.9%
unpow227.9%
Simplified27.9%
Taylor expanded in z around inf 27.9%
*-un-lft-identity27.9%
*-commutative27.9%
times-frac27.9%
unpow-127.9%
metadata-eval27.9%
sqrt-pow120.1%
metadata-eval20.1%
sqrt-pow120.1%
inv-pow20.1%
sqrt-div41.8%
sqrt-prod70.6%
pow270.6%
add-sqr-sqrt70.6%
sqr-pow70.6%
associate-*l*83.3%
metadata-eval83.3%
unpow-183.3%
metadata-eval83.3%
unpow-183.3%
associate-/r*83.2%
Applied egg-rr83.2%
associate-/l/83.3%
frac-times96.6%
*-un-lft-identity96.6%
Applied egg-rr96.6%
Final simplification95.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
(*
(/ (pow x_m -0.5) (hypot 1.0 z))
(/ (/ 1.0 y_m) (* (hypot 1.0 z) (sqrt 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 * ((pow(x_m, -0.5) / hypot(1.0, z)) * ((1.0 / y_m) / (hypot(1.0, z) * sqrt(x_m)))));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((Math.pow(x_m, -0.5) / Math.hypot(1.0, z)) * ((1.0 / y_m) / (Math.hypot(1.0, z) * Math.sqrt(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 * ((math.pow(x_m, -0.5) / math.hypot(1.0, z)) * ((1.0 / y_m) / (math.hypot(1.0, z) * math.sqrt(x_m)))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64((x_m ^ -0.5) / hypot(1.0, z)) * Float64(Float64(1.0 / y_m) / Float64(hypot(1.0, z) * sqrt(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 * (((x_m ^ -0.5) / hypot(1.0, z)) * ((1.0 / y_m) / (hypot(1.0, z) * sqrt(x_m)))));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[Power[x$95$m, -0.5], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \left(\frac{{x\_m}^{-0.5}}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{\frac{1}{y\_m}}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{x\_m}}\right)\right)
\end{array}
Initial program 87.7%
associate-/l/87.3%
associate-*l*86.2%
*-commutative86.2%
sqr-neg86.2%
+-commutative86.2%
sqr-neg86.2%
fma-define86.2%
Simplified86.2%
*-commutative86.2%
associate-*r*87.3%
fma-undefine87.3%
+-commutative87.3%
associate-/l/87.7%
add-sqr-sqrt56.5%
sqrt-div21.4%
inv-pow21.4%
sqrt-pow121.4%
metadata-eval21.4%
+-commutative21.4%
fma-undefine21.4%
*-commutative21.4%
sqrt-prod21.4%
fma-undefine21.4%
+-commutative21.4%
hypot-1-def21.4%
sqrt-div21.3%
Applied egg-rr24.4%
unpow224.4%
Simplified24.4%
Applied egg-rr54.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 (pow (/ (pow x_m -0.5) (* (hypot 1.0 z) (sqrt y_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((pow(x_m, -0.5) / (hypot(1.0, z) * sqrt(y_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.pow(x_m, -0.5) / (Math.hypot(1.0, z) * Math.sqrt(y_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.pow(x_m, -0.5) / (math.hypot(1.0, z) * math.sqrt(y_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((x_m ^ -0.5) / Float64(hypot(1.0, z) * sqrt(y_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 * (((x_m ^ -0.5) / (hypot(1.0, z) * sqrt(y_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[Power[x$95$m, -0.5], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$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(\frac{{x\_m}^{-0.5}}{\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}}\right)}^{2}\right)
\end{array}
Initial program 87.7%
associate-/l/87.3%
associate-*l*86.2%
*-commutative86.2%
sqr-neg86.2%
+-commutative86.2%
sqr-neg86.2%
fma-define86.2%
Simplified86.2%
*-commutative86.2%
associate-*r*87.3%
fma-undefine87.3%
+-commutative87.3%
associate-/l/87.7%
add-sqr-sqrt56.5%
sqrt-div21.4%
inv-pow21.4%
sqrt-pow121.4%
metadata-eval21.4%
+-commutative21.4%
fma-undefine21.4%
*-commutative21.4%
sqrt-prod21.4%
fma-undefine21.4%
+-commutative21.4%
hypot-1-def21.4%
sqrt-div21.3%
Applied egg-rr24.4%
unpow224.4%
Simplified24.4%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ (pow (/ (pow x_m -0.5) (hypot 1.0 z)) 2.0) y_m))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (pow((pow(x_m, -0.5) / hypot(1.0, z)), 2.0) / y_m));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (Math.pow((Math.pow(x_m, -0.5) / Math.hypot(1.0, z)), 2.0) / y_m));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (math.pow((math.pow(x_m, -0.5) / math.hypot(1.0, z)), 2.0) / y_m))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64((Float64((x_m ^ -0.5) / hypot(1.0, z)) ^ 2.0) / y_m))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((((x_m ^ -0.5) / hypot(1.0, z)) ^ 2.0) / y_m));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[Power[N[(N[Power[x$95$m, -0.5], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{{\left(\frac{{x\_m}^{-0.5}}{\mathsf{hypot}\left(1, z\right)}\right)}^{2}}{y\_m}\right)
\end{array}
Initial program 87.7%
associate-/l/87.3%
associate-*l*86.2%
*-commutative86.2%
sqr-neg86.2%
+-commutative86.2%
sqr-neg86.2%
fma-define86.2%
Simplified86.2%
*-commutative86.2%
associate-*r*87.3%
fma-undefine87.3%
+-commutative87.3%
associate-/l/87.7%
add-sqr-sqrt56.5%
sqrt-div21.4%
inv-pow21.4%
sqrt-pow121.4%
metadata-eval21.4%
+-commutative21.4%
fma-undefine21.4%
*-commutative21.4%
sqrt-prod21.4%
fma-undefine21.4%
+-commutative21.4%
hypot-1-def21.4%
sqrt-div21.3%
Applied egg-rr24.4%
unpow224.4%
Simplified24.4%
Applied egg-rr54.5%
*-commutative54.5%
clear-num54.4%
un-div-inv54.4%
clear-num54.4%
associate-/r/54.4%
*-commutative54.4%
associate-/r*54.4%
metadata-eval54.4%
sqrt-div54.4%
inv-pow54.4%
sqrt-pow154.4%
metadata-eval54.4%
frac-times53.9%
*-commutative53.9%
*-un-lft-identity53.9%
Applied egg-rr53.9%
associate-/r/53.0%
associate-*l/52.8%
associate-*r/53.9%
associate-/r*54.4%
associate-*l/49.0%
unpow149.0%
pow-plus49.0%
metadata-eval49.0%
Simplified49.0%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(let* ((t_0 (* y_m (+ 1.0 (* z z)))))
(*
y_s
(*
x_s
(if (<= t_0 1e+308)
(/ (/ 1.0 x_m) t_0)
(* (/ 1.0 z) (/ (/ 1.0 y_m) (* 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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 1e+308) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z) * ((1.0 / y_m) / (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) :: t_0
real(8) :: tmp
t_0 = y_m * (1.0d0 + (z * z))
if (t_0 <= 1d+308) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = (1.0d0 / z) * ((1.0d0 / y_m) / (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 t_0 = y_m * (1.0 + (z * z));
double tmp;
if (t_0 <= 1e+308) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / z) * ((1.0 / y_m) / (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): t_0 = y_m * (1.0 + (z * z)) tmp = 0 if t_0 <= 1e+308: tmp = (1.0 / x_m) / t_0 else: tmp = (1.0 / z) * ((1.0 / y_m) / (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) t_0 = Float64(y_m * Float64(1.0 + Float64(z * z))) tmp = 0.0 if (t_0 <= 1e+308) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(1.0 / z) * Float64(Float64(1.0 / y_m) / Float64(x_m * z))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = y_m * (1.0 + (z * z));
tmp = 0.0;
if (t_0 <= 1e+308)
tmp = (1.0 / x_m) / t_0;
else
tmp = (1.0 / z) * ((1.0 / y_m) / (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_] := Block[{t$95$0 = N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 1e+308], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(1 + z \cdot z\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 10^{+308}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{\frac{1}{y\_m}}{x\_m \cdot z}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 1e308Initial program 91.1%
if 1e308 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 72.8%
associate-/l/72.8%
associate-*l*78.8%
*-commutative78.8%
sqr-neg78.8%
+-commutative78.8%
sqr-neg78.8%
fma-define78.8%
Simplified78.8%
*-commutative78.8%
associate-*r*72.8%
fma-undefine72.8%
+-commutative72.8%
associate-/l/72.8%
add-sqr-sqrt72.8%
sqrt-div38.2%
inv-pow38.2%
sqrt-pow138.2%
metadata-eval38.2%
+-commutative38.2%
fma-undefine38.2%
*-commutative38.2%
sqrt-prod38.2%
fma-undefine38.2%
+-commutative38.2%
hypot-1-def38.2%
sqrt-div38.2%
Applied egg-rr55.1%
unpow255.1%
Simplified55.1%
Taylor expanded in z around inf 55.1%
*-un-lft-identity55.1%
*-commutative55.1%
times-frac55.1%
unpow-155.1%
metadata-eval55.1%
sqrt-pow141.4%
metadata-eval41.4%
sqrt-pow141.4%
inv-pow41.4%
sqrt-div45.4%
sqrt-prod75.6%
pow275.6%
add-sqr-sqrt79.8%
sqr-pow79.8%
associate-*l*91.5%
metadata-eval91.5%
unpow-191.5%
metadata-eval91.5%
unpow-191.5%
associate-/r*91.5%
Applied egg-rr91.5%
associate-/l/91.5%
frac-times94.2%
*-un-lft-identity94.2%
Applied egg-rr94.2%
Final simplification91.7%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 2e-23)
(/ (/ 1.0 x_m) y_m)
(* (/ 1.0 z) (/ (/ 1.0 y_m) (* 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) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) * ((1.0 / y_m) / (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) <= 2d-23) then
tmp = (1.0d0 / x_m) / y_m
else
tmp = (1.0d0 / z) * ((1.0d0 / y_m) / (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) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) * ((1.0 / y_m) / (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) <= 2e-23: tmp = (1.0 / x_m) / y_m else: tmp = (1.0 / z) * ((1.0 / y_m) / (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) <= 2e-23) tmp = Float64(Float64(1.0 / x_m) / y_m); else tmp = Float64(Float64(1.0 / z) * Float64(Float64(1.0 / y_m) / Float64(x_m * 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) <= 2e-23)
tmp = (1.0 / x_m) / y_m;
else
tmp = (1.0 / z) * ((1.0 / y_m) / (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], 2e-23], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{\frac{1}{y\_m}}{x\_m \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999992e-23Initial program 99.7%
associate-/l/99.2%
associate-*l*99.2%
*-commutative99.2%
sqr-neg99.2%
+-commutative99.2%
sqr-neg99.2%
fma-define99.2%
Simplified99.2%
Taylor expanded in z around 0 99.2%
associate-/r*99.7%
Simplified99.7%
if 1.99999999999999992e-23 < (*.f64 z z) Initial program 80.5%
associate-/l/80.2%
associate-*l*78.4%
*-commutative78.4%
sqr-neg78.4%
+-commutative78.4%
sqr-neg78.4%
fma-define78.4%
Simplified78.4%
*-commutative78.4%
associate-*r*80.2%
fma-undefine80.2%
+-commutative80.2%
associate-/l/80.5%
add-sqr-sqrt61.3%
sqrt-div22.4%
inv-pow22.4%
sqrt-pow122.4%
metadata-eval22.4%
+-commutative22.4%
fma-undefine22.4%
*-commutative22.4%
sqrt-prod22.4%
fma-undefine22.4%
+-commutative22.4%
hypot-1-def22.4%
sqrt-div22.4%
Applied egg-rr27.3%
unpow227.3%
Simplified27.3%
Taylor expanded in z around inf 27.3%
*-un-lft-identity27.3%
*-commutative27.3%
times-frac27.3%
unpow-127.3%
metadata-eval27.3%
sqrt-pow123.3%
metadata-eval23.3%
sqrt-pow123.3%
inv-pow23.3%
sqrt-div42.0%
sqrt-prod60.6%
pow260.6%
add-sqr-sqrt80.3%
sqr-pow80.2%
associate-*l*86.6%
metadata-eval86.6%
unpow-186.6%
metadata-eval86.6%
unpow-186.6%
associate-/r*86.6%
Applied egg-rr86.6%
associate-/l/86.6%
frac-times93.0%
*-un-lft-identity93.0%
Applied egg-rr93.0%
Final simplification95.5%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
:precision binary64
(*
y_s
(*
x_s
(if (<= (* z z) 2e-23)
(/ (/ 1.0 x_m) y_m)
(* (/ 1.0 z) (/ 1.0 (* x_m (* z y_m))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) * (1.0 / (x_m * (z * y_m)));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 2d-23) then
tmp = (1.0d0 / x_m) / y_m
else
tmp = (1.0d0 / z) * (1.0d0 / (x_m * (z * y_m)))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) * (1.0 / (x_m * (z * y_m)));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 2e-23: tmp = (1.0 / x_m) / y_m else: tmp = (1.0 / z) * (1.0 / (x_m * (z * y_m))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-23) tmp = Float64(Float64(1.0 / x_m) / y_m); else tmp = Float64(Float64(1.0 / z) * Float64(1.0 / Float64(x_m * Float64(z * y_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 2e-23)
tmp = (1.0 / x_m) / y_m;
else
tmp = (1.0 / z) * (1.0 / (x_m * (z * y_m)));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-23], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(1.0 / N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{1}{x\_m \cdot \left(z \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999992e-23Initial program 99.7%
associate-/l/99.2%
associate-*l*99.2%
*-commutative99.2%
sqr-neg99.2%
+-commutative99.2%
sqr-neg99.2%
fma-define99.2%
Simplified99.2%
Taylor expanded in z around 0 99.2%
associate-/r*99.7%
Simplified99.7%
if 1.99999999999999992e-23 < (*.f64 z z) Initial program 80.5%
associate-/l/80.2%
associate-*l*78.4%
*-commutative78.4%
sqr-neg78.4%
+-commutative78.4%
sqr-neg78.4%
fma-define78.4%
Simplified78.4%
*-commutative78.4%
associate-*r*80.2%
fma-undefine80.2%
+-commutative80.2%
associate-/l/80.5%
add-sqr-sqrt61.3%
sqrt-div22.4%
inv-pow22.4%
sqrt-pow122.4%
metadata-eval22.4%
+-commutative22.4%
fma-undefine22.4%
*-commutative22.4%
sqrt-prod22.4%
fma-undefine22.4%
+-commutative22.4%
hypot-1-def22.4%
sqrt-div22.4%
Applied egg-rr27.3%
unpow227.3%
Simplified27.3%
Taylor expanded in z around inf 27.3%
*-un-lft-identity27.3%
*-commutative27.3%
times-frac27.3%
unpow-127.3%
metadata-eval27.3%
sqrt-pow123.3%
metadata-eval23.3%
sqrt-pow123.3%
inv-pow23.3%
sqrt-div42.0%
sqrt-prod60.6%
pow260.6%
add-sqr-sqrt80.3%
sqr-pow80.2%
associate-*l*86.6%
metadata-eval86.6%
unpow-186.6%
metadata-eval86.6%
unpow-186.6%
associate-/r*86.6%
Applied egg-rr86.6%
Taylor expanded in z around 0 95.7%
Final simplification97.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-23)
(/ (/ 1.0 x_m) y_m)
(/ 1.0 (* z (* z (* x_m y_m))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = 1.0 / (z * (z * (x_m * y_m)));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 2d-23) then
tmp = (1.0d0 / x_m) / y_m
else
tmp = 1.0d0 / (z * (z * (x_m * y_m)))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-23) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = 1.0 / (z * (z * (x_m * y_m)));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 2e-23: tmp = (1.0 / x_m) / y_m else: tmp = 1.0 / (z * (z * (x_m * y_m))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-23) tmp = Float64(Float64(1.0 / x_m) / y_m); else tmp = Float64(1.0 / Float64(z * Float64(z * Float64(x_m * y_m)))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 2e-23)
tmp = (1.0 / x_m) / y_m;
else
tmp = 1.0 / (z * (z * (x_m * y_m)));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-23], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(1.0 / N[(z * N[(z * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(z \cdot \left(x\_m \cdot y\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999992e-23Initial program 99.7%
associate-/l/99.2%
associate-*l*99.2%
*-commutative99.2%
sqr-neg99.2%
+-commutative99.2%
sqr-neg99.2%
fma-define99.2%
Simplified99.2%
Taylor expanded in z around 0 99.2%
associate-/r*99.7%
Simplified99.7%
if 1.99999999999999992e-23 < (*.f64 z z) Initial program 80.5%
associate-/l/80.2%
associate-*l*78.4%
*-commutative78.4%
sqr-neg78.4%
+-commutative78.4%
sqr-neg78.4%
fma-define78.4%
Simplified78.4%
*-commutative78.4%
associate-*r*80.2%
fma-undefine80.2%
+-commutative80.2%
associate-/l/80.5%
add-sqr-sqrt61.3%
sqrt-div22.4%
inv-pow22.4%
sqrt-pow122.4%
metadata-eval22.4%
+-commutative22.4%
fma-undefine22.4%
*-commutative22.4%
sqrt-prod22.4%
fma-undefine22.4%
+-commutative22.4%
hypot-1-def22.4%
sqrt-div22.4%
Applied egg-rr27.3%
unpow227.3%
Simplified27.3%
Taylor expanded in z around inf 27.3%
*-un-lft-identity27.3%
*-commutative27.3%
times-frac27.3%
unpow-127.3%
metadata-eval27.3%
sqrt-pow123.3%
metadata-eval23.3%
sqrt-pow123.3%
inv-pow23.3%
sqrt-div42.0%
sqrt-prod60.6%
pow260.6%
add-sqr-sqrt80.3%
sqr-pow80.2%
associate-*l*86.6%
metadata-eval86.6%
unpow-186.6%
metadata-eval86.6%
unpow-186.6%
associate-/r*86.6%
Applied egg-rr86.6%
frac-times86.7%
metadata-eval86.7%
frac-times84.8%
metadata-eval84.8%
Applied egg-rr84.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 0.00015) (/ (/ 1.0 x_m) y_m) (/ (/ 1.0 z) (* z (* x_m y_m)))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 0.00015) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) / (z * (x_m * y_m));
}
return y_s * (x_s * tmp);
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (z <= 0.00015d0) then
tmp = (1.0d0 / x_m) / y_m
else
tmp = (1.0d0 / z) / (z * (x_m * y_m))
end if
code = y_s * (x_s * tmp)
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 0.00015) {
tmp = (1.0 / x_m) / y_m;
} else {
tmp = (1.0 / z) / (z * (x_m * y_m));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if z <= 0.00015: tmp = (1.0 / x_m) / y_m else: tmp = (1.0 / z) / (z * (x_m * y_m)) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (z <= 0.00015) tmp = Float64(Float64(1.0 / x_m) / y_m); else tmp = Float64(Float64(1.0 / z) / Float64(z * Float64(x_m * y_m))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (z <= 0.00015)
tmp = (1.0 / x_m) / y_m;
else
tmp = (1.0 / z) / (z * (x_m * y_m));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 0.00015], N[(N[(1.0 / x$95$m), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] / N[(z * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 0.00015:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z}}{z \cdot \left(x\_m \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if z < 1.49999999999999987e-4Initial program 88.4%
associate-/l/87.7%
associate-*l*86.7%
*-commutative86.7%
sqr-neg86.7%
+-commutative86.7%
sqr-neg86.7%
fma-define86.7%
Simplified86.7%
Taylor expanded in z around 0 59.5%
associate-/r*59.6%
Simplified59.6%
if 1.49999999999999987e-4 < z Initial program 86.2%
associate-/l/86.2%
associate-*l*84.9%
*-commutative84.9%
sqr-neg84.9%
+-commutative84.9%
sqr-neg84.9%
fma-define84.9%
Simplified84.9%
*-commutative84.9%
associate-*r*86.2%
fma-undefine86.2%
+-commutative86.2%
associate-/l/86.2%
add-sqr-sqrt72.3%
sqrt-div28.6%
inv-pow28.6%
sqrt-pow128.5%
metadata-eval28.5%
+-commutative28.5%
fma-undefine28.5%
*-commutative28.5%
sqrt-prod28.5%
fma-undefine28.5%
+-commutative28.5%
hypot-1-def28.5%
sqrt-div28.5%
Applied egg-rr33.1%
unpow233.1%
Simplified33.1%
Taylor expanded in z around inf 33.1%
*-un-lft-identity33.1%
*-commutative33.1%
times-frac33.1%
unpow-133.1%
metadata-eval33.1%
sqrt-pow129.3%
metadata-eval29.3%
sqrt-pow129.3%
inv-pow29.3%
sqrt-div46.0%
sqrt-prod69.7%
pow269.7%
add-sqr-sqrt84.0%
sqr-pow84.0%
associate-*l*86.6%
metadata-eval86.6%
unpow-186.6%
metadata-eval86.6%
unpow-186.6%
associate-/r*86.5%
Applied egg-rr86.5%
un-div-inv86.6%
frac-times86.7%
*-un-lft-identity86.7%
Applied egg-rr86.7%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* x_m y_m)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (1.0d0 / (x_m * y_m)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (x_m * y_m)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (1.0 / (x_m * y_m)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(x_m * y_m)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (1.0 / (x_m * y_m)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{x\_m \cdot y\_m}\right)
\end{array}
Initial program 87.7%
associate-/l/87.3%
associate-*l*86.2%
*-commutative86.2%
sqr-neg86.2%
+-commutative86.2%
sqr-neg86.2%
fma-define86.2%
Simplified86.2%
Taylor expanded in z around 0 47.5%
Final simplification47.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 2024150
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))