
(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}
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (let* ((t_0 (* (hypot 1.0 z) (sqrt y_m)))) (* y_s (* (/ 1.0 t_0) (/ (/ 1.0 x) t_0)))))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
double t_0 = hypot(1.0, z) * sqrt(y_m);
return y_s * ((1.0 / t_0) * ((1.0 / x) / t_0));
}
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
double t_0 = Math.hypot(1.0, z) * Math.sqrt(y_m);
return y_s * ((1.0 / t_0) * ((1.0 / x) / t_0));
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): t_0 = math.hypot(1.0, z) * math.sqrt(y_m) return y_s * ((1.0 / t_0) * ((1.0 / x) / t_0))
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) t_0 = Float64(hypot(1.0, z) * sqrt(y_m)) return Float64(y_s * Float64(Float64(1.0 / t_0) * Float64(Float64(1.0 / x) / t_0))) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
t_0 = hypot(1.0, z) * sqrt(y_m);
tmp = y_s * ((1.0 / t_0) * ((1.0 / x) / t_0));
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := Block[{t$95$0 = N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[(1.0 / x), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
\begin{array}{l}
t_0 := \mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\\
y\_s \cdot \left(\frac{1}{t\_0} \cdot \frac{\frac{1}{x}}{t\_0}\right)
\end{array}
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
associate-*r*90.5%
*-commutative90.5%
associate-/r*90.5%
*-commutative90.5%
associate-/l/90.9%
fma-undefine90.9%
+-commutative90.9%
associate-/r*91.4%
*-un-lft-identity91.4%
add-sqr-sqrt42.6%
times-frac42.6%
+-commutative42.6%
fma-undefine42.6%
*-commutative42.6%
sqrt-prod42.6%
fma-undefine42.6%
+-commutative42.6%
hypot-1-def42.6%
+-commutative42.6%
Applied egg-rr46.6%
Final simplification46.6%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (/ (/ (/ 1.0 (sqrt y_m)) (hypot 1.0 z)) (* (* (hypot 1.0 z) (sqrt y_m)) x))))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
return y_s * (((1.0 / sqrt(y_m)) / hypot(1.0, z)) / ((hypot(1.0, z) * sqrt(y_m)) * x));
}
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
return y_s * (((1.0 / Math.sqrt(y_m)) / Math.hypot(1.0, z)) / ((Math.hypot(1.0, z) * Math.sqrt(y_m)) * x));
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): return y_s * (((1.0 / math.sqrt(y_m)) / math.hypot(1.0, z)) / ((math.hypot(1.0, z) * math.sqrt(y_m)) * x))
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) return Float64(y_s * Float64(Float64(Float64(1.0 / sqrt(y_m)) / hypot(1.0, z)) / Float64(Float64(hypot(1.0, z) * sqrt(y_m)) * x))) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
tmp = y_s * (((1.0 / sqrt(y_m)) / hypot(1.0, z)) / ((hypot(1.0, z) * sqrt(y_m)) * x));
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(N[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \frac{\frac{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\right)}}{\left(\mathsf{hypot}\left(1, z\right) \cdot \sqrt{y\_m}\right) \cdot x}
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
associate-*r*90.5%
*-commutative90.5%
associate-/r*90.5%
*-commutative90.5%
associate-/l/90.9%
fma-undefine90.9%
+-commutative90.9%
associate-/r*91.4%
*-un-lft-identity91.4%
add-sqr-sqrt42.6%
times-frac42.6%
+-commutative42.6%
fma-undefine42.6%
*-commutative42.6%
sqrt-prod42.6%
fma-undefine42.6%
+-commutative42.6%
hypot-1-def42.6%
+-commutative42.6%
Applied egg-rr46.6%
associate-/l/46.6%
associate-*r/46.6%
*-rgt-identity46.6%
*-commutative46.6%
associate-/r*46.6%
*-commutative46.6%
Simplified46.6%
Final simplification46.6%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (* (/ 1.0 (* (hypot 1.0 z) y_m)) (/ 1.0 (* (hypot 1.0 z) x)))))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
return y_s * ((1.0 / (hypot(1.0, z) * y_m)) * (1.0 / (hypot(1.0, z) * x)));
}
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
return y_s * ((1.0 / (Math.hypot(1.0, z) * y_m)) * (1.0 / (Math.hypot(1.0, z) * x)));
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): return y_s * ((1.0 / (math.hypot(1.0, z) * y_m)) * (1.0 / (math.hypot(1.0, z) * x)))
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) return Float64(y_s * Float64(Float64(1.0 / Float64(hypot(1.0, z) * y_m)) * Float64(1.0 / Float64(hypot(1.0, z) * x)))) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
tmp = y_s * ((1.0 / (hypot(1.0, z) * y_m)) * (1.0 / (hypot(1.0, z) * x)));
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \left(\frac{1}{\mathsf{hypot}\left(1, z\right) \cdot y\_m} \cdot \frac{1}{\mathsf{hypot}\left(1, z\right) \cdot x}\right)
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
associate-*r*90.5%
*-commutative90.5%
associate-/r*90.5%
*-commutative90.5%
associate-/l/90.9%
fma-undefine90.9%
+-commutative90.9%
associate-/r*91.4%
*-un-lft-identity91.4%
add-sqr-sqrt42.6%
times-frac42.6%
+-commutative42.6%
fma-undefine42.6%
*-commutative42.6%
sqrt-prod42.6%
fma-undefine42.6%
+-commutative42.6%
hypot-1-def42.6%
+-commutative42.6%
Applied egg-rr46.6%
*-commutative46.6%
associate-/r*46.3%
associate-/r*46.2%
frac-times44.7%
add-sqr-sqrt95.2%
Applied egg-rr95.2%
associate-/l*98.5%
*-commutative98.5%
associate-/l/98.1%
associate-/l/97.9%
*-commutative97.9%
Applied egg-rr97.9%
Final simplification97.9%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (/ (* (/ (/ 1.0 x) (hypot 1.0 z)) (/ 1.0 (hypot 1.0 z))) y_m)))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
return y_s * ((((1.0 / x) / hypot(1.0, z)) * (1.0 / hypot(1.0, z))) / y_m);
}
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
return y_s * ((((1.0 / x) / Math.hypot(1.0, z)) * (1.0 / Math.hypot(1.0, z))) / y_m);
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): return y_s * ((((1.0 / x) / math.hypot(1.0, z)) * (1.0 / math.hypot(1.0, z))) / y_m)
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) return Float64(y_s * Float64(Float64(Float64(Float64(1.0 / x) / hypot(1.0, z)) * Float64(1.0 / hypot(1.0, z))) / y_m)) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
tmp = y_s * ((((1.0 / x) / hypot(1.0, z)) * (1.0 / hypot(1.0, z))) / y_m);
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(N[(N[(N[(1.0 / x), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \frac{\frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{1}{\mathsf{hypot}\left(1, z\right)}}{y\_m}
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
associate-*r*90.5%
*-commutative90.5%
associate-/r*90.5%
*-commutative90.5%
associate-/l/90.9%
fma-undefine90.9%
+-commutative90.9%
associate-/r*91.4%
*-un-lft-identity91.4%
add-sqr-sqrt42.6%
times-frac42.6%
+-commutative42.6%
fma-undefine42.6%
*-commutative42.6%
sqrt-prod42.6%
fma-undefine42.6%
+-commutative42.6%
hypot-1-def42.6%
+-commutative42.6%
Applied egg-rr46.6%
*-commutative46.6%
associate-/r*46.3%
associate-/r*46.2%
frac-times44.7%
add-sqr-sqrt95.2%
Applied egg-rr95.2%
Final simplification95.2%
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
:precision binary64
(*
y_s
(if (<= (* z z) 4e+21)
(/ (/ 1.0 x) (fma (* z y_m) z y_m))
(/ (* (/ (/ 1.0 x) (hypot 1.0 z)) (/ 1.0 z)) y_m))))y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
double tmp;
if ((z * z) <= 4e+21) {
tmp = (1.0 / x) / fma((z * y_m), z, y_m);
} else {
tmp = (((1.0 / x) / hypot(1.0, z)) * (1.0 / z)) / y_m;
}
return y_s * tmp;
}
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) tmp = 0.0 if (Float64(z * z) <= 4e+21) tmp = Float64(Float64(1.0 / x) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(Float64(Float64(Float64(1.0 / x) / hypot(1.0, z)) * Float64(1.0 / z)) / y_m); end return Float64(y_s * tmp) end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 4e+21], N[(N[(1.0 / x), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 / x), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 4 \cdot 10^{+21}:\\
\;\;\;\;\frac{\frac{1}{x}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{x}}{\mathsf{hypot}\left(1, z\right)} \cdot \frac{1}{z}}{y\_m}\\
\end{array}
\end{array}
if (*.f64 z z) < 4e21Initial program 99.7%
+-commutative99.7%
distribute-lft-in99.7%
associate-*r*99.7%
*-rgt-identity99.7%
fma-define99.7%
Applied egg-rr99.7%
if 4e21 < (*.f64 z z) Initial program 80.3%
associate-/l/80.4%
associate-*l*80.3%
*-commutative80.3%
sqr-neg80.3%
+-commutative80.3%
sqr-neg80.3%
fma-define80.3%
Simplified80.3%
associate-*r*79.3%
*-commutative79.3%
associate-/r*79.3%
*-commutative79.3%
associate-/l/79.3%
fma-undefine79.3%
+-commutative79.3%
associate-/r*80.3%
*-un-lft-identity80.3%
add-sqr-sqrt36.8%
times-frac36.9%
+-commutative36.9%
fma-undefine36.9%
*-commutative36.9%
sqrt-prod36.9%
fma-undefine36.9%
+-commutative36.9%
hypot-1-def36.9%
+-commutative36.9%
Applied egg-rr46.2%
*-commutative46.2%
associate-/r*45.3%
associate-/r*45.3%
frac-times41.8%
add-sqr-sqrt89.2%
Applied egg-rr89.2%
Taylor expanded in z around inf 73.5%
Final simplification88.4%
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
:precision binary64
(*
y_s
(if (<= (* z z) 50000000000.0)
(/ (/ 1.0 x) (fma (* z y_m) z y_m))
(/ 1.0 (* y_m (* z (* z x)))))))y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
double tmp;
if ((z * z) <= 50000000000.0) {
tmp = (1.0 / x) / fma((z * y_m), z, y_m);
} else {
tmp = 1.0 / (y_m * (z * (z * x)));
}
return y_s * tmp;
}
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) tmp = 0.0 if (Float64(z * z) <= 50000000000.0) tmp = Float64(Float64(1.0 / x) / fma(Float64(z * y_m), z, y_m)); else tmp = Float64(1.0 / Float64(y_m * Float64(z * Float64(z * x)))); end return Float64(y_s * tmp) end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 50000000000.0], N[(N[(1.0 / x), $MachinePrecision] / N[(N[(z * y$95$m), $MachinePrecision] * z + y$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 50000000000:\\
\;\;\;\;\frac{\frac{1}{x}}{\mathsf{fma}\left(z \cdot y\_m, z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 5e10Initial program 99.7%
+-commutative99.7%
distribute-lft-in99.7%
associate-*r*99.7%
*-rgt-identity99.7%
fma-define99.7%
Applied egg-rr99.7%
if 5e10 < (*.f64 z z) Initial program 80.8%
associate-/l/80.9%
associate-*l*80.8%
*-commutative80.8%
sqr-neg80.8%
+-commutative80.8%
sqr-neg80.8%
fma-define80.8%
Simplified80.8%
Taylor expanded in z around inf 80.8%
add-sqr-sqrt41.3%
pow241.3%
*-commutative41.3%
sqrt-prod41.2%
unpow241.2%
sqrt-prod22.2%
add-sqr-sqrt45.4%
Applied egg-rr45.4%
unpow245.4%
swap-sqr41.2%
add-sqr-sqrt80.8%
associate-*l*89.1%
Applied egg-rr89.1%
Final simplification95.0%
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
:precision binary64
(*
y_s
(if (<= (* z z) 50000000000.0)
(/ (/ 1.0 x) (* y_m (+ 1.0 (* z z))))
(/ 1.0 (* y_m (* z (* z x)))))))y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
double tmp;
if ((z * z) <= 50000000000.0) {
tmp = (1.0 / x) / (y_m * (1.0 + (z * z)));
} else {
tmp = 1.0 / (y_m * (z * (z * x)));
}
return y_s * tmp;
}
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 50000000000.0d0) then
tmp = (1.0d0 / x) / (y_m * (1.0d0 + (z * z)))
else
tmp = 1.0d0 / (y_m * (z * (z * x)))
end if
code = y_s * tmp
end function
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
double tmp;
if ((z * z) <= 50000000000.0) {
tmp = (1.0 / x) / (y_m * (1.0 + (z * z)));
} else {
tmp = 1.0 / (y_m * (z * (z * x)));
}
return y_s * tmp;
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): tmp = 0 if (z * z) <= 50000000000.0: tmp = (1.0 / x) / (y_m * (1.0 + (z * z))) else: tmp = 1.0 / (y_m * (z * (z * x))) return y_s * tmp
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) tmp = 0.0 if (Float64(z * z) <= 50000000000.0) tmp = Float64(Float64(1.0 / x) / Float64(y_m * Float64(1.0 + Float64(z * z)))); else tmp = Float64(1.0 / Float64(y_m * Float64(z * Float64(z * x)))); end return Float64(y_s * tmp) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp_2 = code(y_s, x, y_m, z)
tmp = 0.0;
if ((z * z) <= 50000000000.0)
tmp = (1.0 / x) / (y_m * (1.0 + (z * z)));
else
tmp = 1.0 / (y_m * (z * (z * x)));
end
tmp_2 = y_s * tmp;
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 50000000000.0], N[(N[(1.0 / x), $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 50000000000:\\
\;\;\;\;\frac{\frac{1}{x}}{y\_m \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 5e10Initial program 99.7%
if 5e10 < (*.f64 z z) Initial program 80.8%
associate-/l/80.9%
associate-*l*80.8%
*-commutative80.8%
sqr-neg80.8%
+-commutative80.8%
sqr-neg80.8%
fma-define80.8%
Simplified80.8%
Taylor expanded in z around inf 80.8%
add-sqr-sqrt41.3%
pow241.3%
*-commutative41.3%
sqrt-prod41.2%
unpow241.2%
sqrt-prod22.2%
add-sqr-sqrt45.4%
Applied egg-rr45.4%
unpow245.4%
swap-sqr41.2%
add-sqr-sqrt80.8%
associate-*l*89.1%
Applied egg-rr89.1%
Final simplification95.0%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (if (<= z 1.0) (/ (/ 1.0 x) y_m) (/ 1.0 (* y_m (* z (* z x)))))))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / x) / y_m;
} else {
tmp = 1.0 / (y_m * (z * (z * x)));
}
return y_s * tmp;
}
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (z <= 1.0d0) then
tmp = (1.0d0 / x) / y_m
else
tmp = 1.0d0 / (y_m * (z * (z * x)))
end if
code = y_s * tmp
end function
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
double tmp;
if (z <= 1.0) {
tmp = (1.0 / x) / y_m;
} else {
tmp = 1.0 / (y_m * (z * (z * x)));
}
return y_s * tmp;
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): tmp = 0 if z <= 1.0: tmp = (1.0 / x) / y_m else: tmp = 1.0 / (y_m * (z * (z * x))) return y_s * tmp
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) tmp = 0.0 if (z <= 1.0) tmp = Float64(Float64(1.0 / x) / y_m); else tmp = Float64(1.0 / Float64(y_m * Float64(z * Float64(z * x)))); end return Float64(y_s * tmp) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp_2 = code(y_s, x, y_m, z)
tmp = 0.0;
if (z <= 1.0)
tmp = (1.0 / x) / y_m;
else
tmp = 1.0 / (y_m * (z * (z * x)));
end
tmp_2 = y_s * tmp;
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[z, 1.0], N[(N[(1.0 / x), $MachinePrecision] / y$95$m), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq 1:\\
\;\;\;\;\frac{\frac{1}{x}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if z < 1Initial program 93.7%
associate-/l/93.2%
associate-*l*94.1%
*-commutative94.1%
sqr-neg94.1%
+-commutative94.1%
sqr-neg94.1%
fma-define94.1%
Simplified94.1%
Taylor expanded in z around 0 74.5%
associate-/r*75.1%
Simplified75.1%
if 1 < z Initial program 83.1%
associate-/l/83.1%
associate-*l*79.6%
*-commutative79.6%
sqr-neg79.6%
+-commutative79.6%
sqr-neg79.6%
fma-define79.6%
Simplified79.6%
Taylor expanded in z around inf 79.2%
add-sqr-sqrt39.9%
pow239.9%
*-commutative39.9%
sqrt-prod39.8%
unpow239.8%
sqrt-prod44.8%
add-sqr-sqrt44.9%
Applied egg-rr44.9%
unpow244.9%
swap-sqr39.8%
add-sqr-sqrt79.2%
associate-*l*85.9%
Applied egg-rr85.9%
Final simplification77.4%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (/ 1.0 (* y_m x))))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
return y_s * (1.0 / (y_m * x));
}
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (1.0d0 / (y_m * x))
end function
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
return y_s * (1.0 / (y_m * x));
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): return y_s * (1.0 / (y_m * x))
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) return Float64(y_s * Float64(1.0 / Float64(y_m * x))) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
tmp = y_s * (1.0 / (y_m * x));
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(1.0 / N[(y$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \frac{1}{y\_m \cdot x}
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
Taylor expanded in z around 0 61.8%
Final simplification61.8%
y_m = (fabs.f64 y) y_s = (copysign.f64 1 y) NOTE: x, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x y_m z) :precision binary64 (* y_s (/ (/ 1.0 x) y_m)))
y_m = fabs(y);
y_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
return y_s * ((1.0 / x) / y_m);
}
y_m = abs(y)
y_s = copysign(1.0d0, y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * ((1.0d0 / x) / y_m)
end function
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
return y_s * ((1.0 / x) / y_m);
}
y_m = math.fabs(y) y_s = math.copysign(1.0, y) [x, y_m, z] = sort([x, y_m, z]) def code(y_s, x, y_m, z): return y_s * ((1.0 / x) / y_m)
y_m = abs(y) y_s = copysign(1.0, y) x, y_m, z = sort([x, y_m, z]) function code(y_s, x, y_m, z) return Float64(y_s * Float64(Float64(1.0 / x) / y_m)) end
y_m = abs(y);
y_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
tmp = y_s * ((1.0 / x) / y_m);
end
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, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(N[(1.0 / x), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y_m = \left|y\right|
\\
y_s = \mathsf{copysign}\left(1, y\right)
\\
[x, y_m, z] = \mathsf{sort}([x, y_m, z])\\
\\
y\_s \cdot \frac{\frac{1}{x}}{y\_m}
\end{array}
Initial program 91.4%
associate-/l/91.0%
associate-*l*90.9%
*-commutative90.9%
sqr-neg90.9%
+-commutative90.9%
sqr-neg90.9%
fma-define90.9%
Simplified90.9%
Taylor expanded in z around 0 61.8%
associate-/r*62.0%
Simplified62.0%
Final simplification62.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 2024046
(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)))))