
(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 12 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
(/
(/ (/ (/ 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(Float64(1.0 / sqrt(y_m)) / hypot(1.0, z)) / 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[(N[(1.0 / N[Sqrt[y$95$m], $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] / N[(N[Sqrt[y$95$m], $MachinePrecision] * N[Sqrt[1.0 ^ 2 + z ^ 2], $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{\frac{1}{\sqrt{y\_m}}}{\mathsf{hypot}\left(1, z\right)}}{x\_m}}{\sqrt{y\_m} \cdot \mathsf{hypot}\left(1, z\right)}\right)
\end{array}
Initial program 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*91.4%
*-commutative91.4%
associate-/r*91.5%
*-commutative91.5%
associate-/l/91.5%
fma-undefine91.5%
+-commutative91.5%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt43.0%
times-frac43.0%
+-commutative43.0%
fma-undefine43.0%
*-commutative43.0%
sqrt-prod43.0%
fma-undefine43.0%
+-commutative43.0%
hypot-1-def43.0%
+-commutative43.0%
Applied egg-rr47.0%
associate-*r/47.0%
associate-*r/47.0%
*-rgt-identity47.0%
*-commutative47.0%
associate-/r*47.0%
Simplified47.0%
Final simplification47.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
(*
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 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*91.4%
*-commutative91.4%
associate-/r*91.5%
*-commutative91.5%
associate-/l/91.5%
fma-undefine91.5%
+-commutative91.5%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt43.0%
times-frac43.0%
+-commutative43.0%
fma-undefine43.0%
*-commutative43.0%
sqrt-prod43.0%
fma-undefine43.0%
+-commutative43.0%
hypot-1-def43.0%
+-commutative43.0%
Applied egg-rr47.0%
associate-/l/47.0%
associate-*r/47.0%
*-rgt-identity47.0%
*-commutative47.0%
associate-/r*47.0%
*-commutative47.0%
Simplified47.0%
Final simplification47.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 (* y_s (* x_s (/ (/ (pow y_m -1.0) (* (hypot 1.0 z) x_m)) (hypot 1.0 z)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((pow(y_m, -1.0) / (hypot(1.0, z) * x_m)) / hypot(1.0, z)));
}
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * ((Math.pow(y_m, -1.0) / (Math.hypot(1.0, z) * x_m)) / Math.hypot(1.0, z)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * ((math.pow(y_m, -1.0) / (math.hypot(1.0, z) * x_m)) / math.hypot(1.0, z)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(Float64((y_m ^ -1.0) / Float64(hypot(1.0, z) * x_m)) / hypot(1.0, z)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (((y_m ^ -1.0) / (hypot(1.0, z) * x_m)) / hypot(1.0, z)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[Power[y$95$m, -1.0], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{{y\_m}^{-1}}{\mathsf{hypot}\left(1, z\right) \cdot x\_m}}{\mathsf{hypot}\left(1, z\right)}\right)
\end{array}
Initial program 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*91.4%
*-commutative91.4%
associate-/r*91.5%
*-commutative91.5%
associate-/l/91.5%
fma-undefine91.5%
+-commutative91.5%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt43.0%
times-frac43.0%
+-commutative43.0%
fma-undefine43.0%
*-commutative43.0%
sqrt-prod43.0%
fma-undefine43.0%
+-commutative43.0%
hypot-1-def43.0%
+-commutative43.0%
Applied egg-rr47.0%
associate-*r/47.0%
associate-*r/47.0%
*-rgt-identity47.0%
*-commutative47.0%
associate-/r*47.0%
Simplified47.0%
frac-2neg47.0%
div-inv47.0%
associate-/l/46.6%
distribute-neg-frac246.6%
inv-pow46.6%
sqrt-pow246.6%
metadata-eval46.6%
distribute-neg-frac246.6%
associate-/l/46.6%
distribute-neg-frac246.6%
inv-pow46.6%
sqrt-pow246.6%
metadata-eval46.6%
Applied egg-rr46.6%
associate-*r/46.6%
associate-*l/46.6%
pow-sqr98.2%
metadata-eval98.2%
distribute-rgt-neg-in98.2%
Simplified98.2%
Final simplification98.2%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* (hypot 1.0 z) (* y_m (* (hypot 1.0 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) {
return y_s * (x_s * (1.0 / (hypot(1.0, z) * (y_m * (hypot(1.0, z) * 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 * (1.0 / (Math.hypot(1.0, z) * (y_m * (Math.hypot(1.0, z) * 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 / (math.hypot(1.0, z) * (y_m * (math.hypot(1.0, z) * 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(hypot(1.0, z) * Float64(y_m * Float64(hypot(1.0, z) * 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 / (hypot(1.0, z) * (y_m * (hypot(1.0, z) * 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[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * N[(y$95$m * N[(N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision] * 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 \frac{1}{\mathsf{hypot}\left(1, z\right) \cdot \left(y\_m \cdot \left(\mathsf{hypot}\left(1, z\right) \cdot x\_m\right)\right)}\right)
\end{array}
Initial program 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*91.4%
*-commutative91.4%
associate-/r*91.5%
*-commutative91.5%
associate-/l/91.5%
fma-undefine91.5%
+-commutative91.5%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt43.0%
times-frac43.0%
+-commutative43.0%
fma-undefine43.0%
*-commutative43.0%
sqrt-prod43.0%
fma-undefine43.0%
+-commutative43.0%
hypot-1-def43.0%
+-commutative43.0%
Applied egg-rr47.0%
associate-*r/47.0%
associate-*r/47.0%
*-rgt-identity47.0%
*-commutative47.0%
associate-/r*47.0%
Simplified47.0%
*-un-lft-identity47.0%
div-inv47.0%
associate-/l/46.6%
associate-/l/46.6%
frac-times45.1%
frac-times45.2%
metadata-eval45.2%
add-sqr-sqrt94.6%
Applied egg-rr94.6%
*-un-lft-identity94.6%
associate-/r*98.2%
frac-2neg98.2%
distribute-frac-neg298.2%
inv-pow98.2%
distribute-rgt-neg-out98.2%
div-inv98.1%
inv-pow98.1%
clear-num97.8%
frac-times97.7%
metadata-eval97.7%
Applied egg-rr97.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) 5e+293)
(/ 1.0 (* y_m (* x_m (fma z z 1.0))))
(/ (/ 1.0 (* x_m (* y_m z))) z)))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+293) {
tmp = 1.0 / (y_m * (x_m * fma(z, z, 1.0)));
} else {
tmp = (1.0 / (x_m * (y_m * z))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 5e+293) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * fma(z, z, 1.0)))); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(y_m * z))) / 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+293], 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[(x$95$m * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $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^{+293}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5.00000000000000033e293Initial program 96.8%
associate-/l/96.7%
associate-*l*95.2%
*-commutative95.2%
sqr-neg95.2%
+-commutative95.2%
sqr-neg95.2%
fma-define95.2%
Simplified95.2%
if 5.00000000000000033e293 < (*.f64 z z) Initial program 75.2%
associate-/l/75.2%
associate-*l*75.2%
*-commutative75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-define75.2%
Simplified75.2%
associate-*r*73.1%
*-commutative73.1%
associate-/r*73.0%
*-commutative73.0%
associate-/l/73.0%
fma-undefine73.0%
+-commutative73.0%
associate-/r*75.2%
*-un-lft-identity75.2%
add-sqr-sqrt42.2%
times-frac42.2%
+-commutative42.2%
fma-undefine42.2%
*-commutative42.2%
sqrt-prod42.2%
fma-undefine42.2%
+-commutative42.2%
hypot-1-def42.2%
+-commutative42.2%
Applied egg-rr55.3%
associate-*r/55.2%
associate-*r/55.2%
*-rgt-identity55.2%
*-commutative55.2%
associate-/r*55.3%
Simplified55.3%
frac-2neg55.3%
div-inv55.3%
associate-/l/55.2%
distribute-neg-frac255.2%
inv-pow55.2%
sqrt-pow255.2%
metadata-eval55.2%
distribute-neg-frac255.2%
associate-/l/55.2%
distribute-neg-frac255.2%
inv-pow55.2%
sqrt-pow255.2%
metadata-eval55.2%
Applied egg-rr55.2%
associate-*r/55.1%
associate-*l/55.1%
pow-sqr99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
Simplified99.7%
Taylor expanded in z around inf 89.6%
Taylor expanded in z around inf 97.0%
neg-mul-197.0%
Simplified97.0%
Final simplification95.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-14)
(/ (/ 1.0 y_m) x_m)
(if (<= (* z z) 5e+293)
(/ 1.0 (* y_m (* x_m (* z z))))
(/ (/ 1.0 (* x_m (* y_m z))) z))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-14) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 5e+293) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = (1.0 / (x_m * (y_m * z))) / 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-14) then
tmp = (1.0d0 / y_m) / x_m
else if ((z * z) <= 5d+293) then
tmp = 1.0d0 / (y_m * (x_m * (z * z)))
else
tmp = (1.0d0 / (x_m * (y_m * z))) / 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-14) {
tmp = (1.0 / y_m) / x_m;
} else if ((z * z) <= 5e+293) {
tmp = 1.0 / (y_m * (x_m * (z * z)));
} else {
tmp = (1.0 / (x_m * (y_m * z))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (z * z) <= 2e-14: tmp = (1.0 / y_m) / x_m elif (z * z) <= 5e+293: tmp = 1.0 / (y_m * (x_m * (z * z))) else: tmp = (1.0 / (x_m * (y_m * z))) / z return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-14) tmp = Float64(Float64(1.0 / y_m) / x_m); elseif (Float64(z * z) <= 5e+293) tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(y_m * z))) / z); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((z * z) <= 2e-14)
tmp = (1.0 / y_m) / x_m;
elseif ((z * z) <= 5e+293)
tmp = 1.0 / (y_m * (x_m * (z * z)));
else
tmp = (1.0 / (x_m * (y_m * z))) / z;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-14], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 5e+293], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $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^{-14}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{elif}\;z \cdot z \leq 5 \cdot 10^{+293}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2e-14Initial program 98.9%
associate-/l/99.0%
associate-*l*99.0%
*-commutative99.0%
sqr-neg99.0%
+-commutative99.0%
sqr-neg99.0%
fma-define99.0%
Simplified99.0%
associate-*r*99.0%
*-commutative99.0%
associate-/r*99.0%
*-commutative99.0%
associate-/l/98.9%
fma-undefine98.9%
+-commutative98.9%
associate-/r*98.9%
*-un-lft-identity98.9%
add-sqr-sqrt46.8%
times-frac46.7%
+-commutative46.7%
fma-undefine46.7%
*-commutative46.7%
sqrt-prod46.7%
fma-undefine46.7%
+-commutative46.7%
hypot-1-def46.7%
+-commutative46.7%
Applied egg-rr46.7%
associate-*r/46.7%
associate-*r/46.7%
*-rgt-identity46.7%
*-commutative46.7%
associate-/r*46.7%
Simplified46.7%
frac-2neg46.7%
div-inv46.6%
associate-/l/46.6%
distribute-neg-frac246.6%
inv-pow46.6%
sqrt-pow246.7%
metadata-eval46.7%
distribute-neg-frac246.7%
associate-/l/46.7%
distribute-neg-frac246.7%
inv-pow46.7%
sqrt-pow246.7%
metadata-eval46.7%
Applied egg-rr46.7%
associate-*r/46.7%
associate-*l/46.6%
pow-sqr99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
Simplified99.7%
Taylor expanded in z around 0 98.9%
associate-/l/99.6%
Simplified99.6%
if 2e-14 < (*.f64 z z) < 5.00000000000000033e293Initial program 93.3%
associate-/l/93.2%
associate-*l*89.3%
*-commutative89.3%
sqr-neg89.3%
+-commutative89.3%
sqr-neg89.3%
fma-define89.3%
Simplified89.3%
Taylor expanded in z around inf 87.2%
unpow287.2%
Applied egg-rr87.2%
if 5.00000000000000033e293 < (*.f64 z z) Initial program 75.2%
associate-/l/75.2%
associate-*l*75.2%
*-commutative75.2%
sqr-neg75.2%
+-commutative75.2%
sqr-neg75.2%
fma-define75.2%
Simplified75.2%
associate-*r*73.1%
*-commutative73.1%
associate-/r*73.0%
*-commutative73.0%
associate-/l/73.0%
fma-undefine73.0%
+-commutative73.0%
associate-/r*75.2%
*-un-lft-identity75.2%
add-sqr-sqrt42.2%
times-frac42.2%
+-commutative42.2%
fma-undefine42.2%
*-commutative42.2%
sqrt-prod42.2%
fma-undefine42.2%
+-commutative42.2%
hypot-1-def42.2%
+-commutative42.2%
Applied egg-rr55.3%
associate-*r/55.2%
associate-*r/55.2%
*-rgt-identity55.2%
*-commutative55.2%
associate-/r*55.3%
Simplified55.3%
frac-2neg55.3%
div-inv55.3%
associate-/l/55.2%
distribute-neg-frac255.2%
inv-pow55.2%
sqrt-pow255.2%
metadata-eval55.2%
distribute-neg-frac255.2%
associate-/l/55.2%
distribute-neg-frac255.2%
inv-pow55.2%
sqrt-pow255.2%
metadata-eval55.2%
Applied egg-rr55.2%
associate-*r/55.1%
associate-*l/55.1%
pow-sqr99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
Simplified99.7%
Taylor expanded in z around inf 89.6%
Taylor expanded in z around inf 97.0%
neg-mul-197.0%
Simplified97.0%
Final simplification95.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
(if (<= (* y_m (+ (* z z) 1.0)) 5e+307)
(/ (/ 1.0 x_m) (+ y_m (* z (* y_m z))))
(/ (/ 1.0 (* x_m (* y_m z))) z)))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * ((z * z) + 1.0)) <= 5e+307) {
tmp = (1.0 / x_m) / (y_m + (z * (y_m * z)));
} else {
tmp = (1.0 / (x_m * (y_m * z))) / 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 ((y_m * ((z * z) + 1.0d0)) <= 5d+307) then
tmp = (1.0d0 / x_m) / (y_m + (z * (y_m * z)))
else
tmp = (1.0d0 / (x_m * (y_m * z))) / 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 ((y_m * ((z * z) + 1.0)) <= 5e+307) {
tmp = (1.0 / x_m) / (y_m + (z * (y_m * z)));
} else {
tmp = (1.0 / (x_m * (y_m * z))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if (y_m * ((z * z) + 1.0)) <= 5e+307: tmp = (1.0 / x_m) / (y_m + (z * (y_m * z))) else: tmp = (1.0 / (x_m * (y_m * z))) / z return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * Float64(Float64(z * z) + 1.0)) <= 5e+307) tmp = Float64(Float64(1.0 / x_m) / Float64(y_m + Float64(z * Float64(y_m * z)))); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(y_m * z))) / z); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if ((y_m * ((z * z) + 1.0)) <= 5e+307)
tmp = (1.0 / x_m) / (y_m + (z * (y_m * z)));
else
tmp = (1.0 / (x_m * (y_m * z))) / z;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], 5e+307], N[(N[(1.0 / x$95$m), $MachinePrecision] / N[(y$95$m + N[(z * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(z \cdot z + 1\right) \leq 5 \cdot 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{y\_m + z \cdot \left(y\_m \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 5e307Initial program 94.5%
+-commutative94.5%
distribute-lft-in94.5%
associate-*r*95.8%
*-rgt-identity95.8%
fma-define95.8%
Applied egg-rr95.8%
fma-undefine95.8%
Applied egg-rr95.8%
if 5e307 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 74.6%
associate-/l/74.6%
associate-*l*79.1%
*-commutative79.1%
sqr-neg79.1%
+-commutative79.1%
sqr-neg79.1%
fma-define79.1%
Simplified79.1%
associate-*r*78.5%
*-commutative78.5%
associate-/r*78.5%
*-commutative78.5%
associate-/l/78.5%
fma-undefine78.5%
+-commutative78.5%
associate-/r*74.6%
*-un-lft-identity74.6%
add-sqr-sqrt74.6%
times-frac74.6%
+-commutative74.6%
fma-undefine74.6%
*-commutative74.6%
sqrt-prod74.6%
fma-undefine74.6%
+-commutative74.6%
hypot-1-def74.6%
+-commutative74.6%
Applied egg-rr99.8%
associate-*r/99.7%
associate-*r/99.7%
*-rgt-identity99.7%
*-commutative99.7%
associate-/r*99.8%
Simplified99.8%
frac-2neg99.8%
div-inv99.8%
associate-/l/99.7%
distribute-neg-frac299.7%
inv-pow99.7%
sqrt-pow299.7%
metadata-eval99.7%
distribute-neg-frac299.7%
associate-/l/99.7%
distribute-neg-frac299.7%
inv-pow99.7%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
associate-*r/99.6%
associate-*l/99.6%
pow-sqr99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
Simplified99.7%
Taylor expanded in z around inf 88.2%
Taylor expanded in z around inf 97.5%
neg-mul-197.5%
Simplified97.5%
Final simplification96.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
(let* ((t_0 (* y_m (+ (* z z) 1.0))))
(*
y_s
(*
x_s
(if (<= t_0 5e+307)
(/ (/ 1.0 x_m) t_0)
(/ (/ 1.0 (* x_m (* y_m z))) z))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double t_0 = y_m * ((z * z) + 1.0);
double tmp;
if (t_0 <= 5e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / (x_m * (y_m * z))) / 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 * ((z * z) + 1.0d0)
if (t_0 <= 5d+307) then
tmp = (1.0d0 / x_m) / t_0
else
tmp = (1.0d0 / (x_m * (y_m * z))) / 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 * ((z * z) + 1.0);
double tmp;
if (t_0 <= 5e+307) {
tmp = (1.0 / x_m) / t_0;
} else {
tmp = (1.0 / (x_m * (y_m * z))) / z;
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): t_0 = y_m * ((z * z) + 1.0) tmp = 0 if t_0 <= 5e+307: tmp = (1.0 / x_m) / t_0 else: tmp = (1.0 / (x_m * (y_m * z))) / z return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) t_0 = Float64(y_m * Float64(Float64(z * z) + 1.0)) tmp = 0.0 if (t_0 <= 5e+307) tmp = Float64(Float64(1.0 / x_m) / t_0); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(y_m * z))) / z); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
t_0 = y_m * ((z * z) + 1.0);
tmp = 0.0;
if (t_0 <= 5e+307)
tmp = (1.0 / x_m) / t_0;
else
tmp = (1.0 / (x_m * (y_m * z))) / z;
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 5e+307], N[(N[(1.0 / x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(y$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := y\_m \cdot \left(z \cdot z + 1\right)\\
y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 5 \cdot 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{x\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}}{z}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 5e307Initial program 94.5%
if 5e307 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 74.6%
associate-/l/74.6%
associate-*l*79.1%
*-commutative79.1%
sqr-neg79.1%
+-commutative79.1%
sqr-neg79.1%
fma-define79.1%
Simplified79.1%
associate-*r*78.5%
*-commutative78.5%
associate-/r*78.5%
*-commutative78.5%
associate-/l/78.5%
fma-undefine78.5%
+-commutative78.5%
associate-/r*74.6%
*-un-lft-identity74.6%
add-sqr-sqrt74.6%
times-frac74.6%
+-commutative74.6%
fma-undefine74.6%
*-commutative74.6%
sqrt-prod74.6%
fma-undefine74.6%
+-commutative74.6%
hypot-1-def74.6%
+-commutative74.6%
Applied egg-rr99.8%
associate-*r/99.7%
associate-*r/99.7%
*-rgt-identity99.7%
*-commutative99.7%
associate-/r*99.8%
Simplified99.8%
frac-2neg99.8%
div-inv99.8%
associate-/l/99.7%
distribute-neg-frac299.7%
inv-pow99.7%
sqrt-pow299.7%
metadata-eval99.7%
distribute-neg-frac299.7%
associate-/l/99.7%
distribute-neg-frac299.7%
inv-pow99.7%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
associate-*r/99.6%
associate-*l/99.6%
pow-sqr99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
Simplified99.7%
Taylor expanded in z around inf 88.2%
Taylor expanded in z around inf 97.5%
neg-mul-197.5%
Simplified97.5%
Final simplification95.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 (* y_s (* x_s (if (<= z 0.0033) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* y_m (* x_m (* z z))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
double tmp;
if (z <= 0.0033) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (y_m * (x_m * (z * 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 <= 0.0033d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = 1.0d0 / (y_m * (x_m * (z * 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 <= 0.0033) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (y_m * (x_m * (z * z)));
}
return y_s * (x_s * tmp);
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): tmp = 0 if z <= 0.0033: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / (y_m * (x_m * (z * z))) return y_s * (x_s * tmp)
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) tmp = 0.0 if (z <= 0.0033) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(y_m * Float64(x_m * Float64(z * z)))); end return Float64(y_s * Float64(x_s * tmp)) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
tmp = 0.0;
if (z <= 0.0033)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / (y_m * (x_m * (z * z)));
end
tmp_2 = y_s * (x_s * tmp);
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 0.0033], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $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 \leq 0.0033:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(x\_m \cdot \left(z \cdot z\right)\right)}\\
\end{array}\right)
\end{array}
if z < 0.0033Initial program 94.0%
associate-/l/94.1%
associate-*l*94.0%
*-commutative94.0%
sqr-neg94.0%
+-commutative94.0%
sqr-neg94.0%
fma-define94.0%
Simplified94.0%
associate-*r*94.4%
*-commutative94.4%
associate-/r*94.5%
*-commutative94.5%
associate-/l/94.4%
fma-undefine94.4%
+-commutative94.4%
associate-/r*94.0%
*-un-lft-identity94.0%
add-sqr-sqrt46.1%
times-frac46.0%
+-commutative46.0%
fma-undefine46.0%
*-commutative46.0%
sqrt-prod46.0%
fma-undefine46.0%
+-commutative46.0%
hypot-1-def46.0%
+-commutative46.0%
Applied egg-rr48.6%
associate-*r/48.6%
associate-*r/48.6%
*-rgt-identity48.6%
*-commutative48.6%
associate-/r*48.6%
Simplified48.6%
frac-2neg48.6%
div-inv48.6%
associate-/l/48.6%
distribute-neg-frac248.6%
inv-pow48.6%
sqrt-pow248.6%
metadata-eval48.6%
distribute-neg-frac248.6%
associate-/l/48.6%
distribute-neg-frac248.6%
inv-pow48.6%
sqrt-pow248.6%
metadata-eval48.6%
Applied egg-rr48.6%
associate-*r/48.6%
associate-*l/48.6%
pow-sqr98.6%
metadata-eval98.6%
distribute-rgt-neg-in98.6%
Simplified98.6%
Taylor expanded in z around 0 71.8%
associate-/l/72.2%
Simplified72.2%
if 0.0033 < z Initial program 84.9%
associate-/l/84.7%
associate-*l*81.0%
*-commutative81.0%
sqr-neg81.0%
+-commutative81.0%
sqr-neg81.0%
fma-define81.0%
Simplified81.0%
Taylor expanded in z around inf 80.3%
unpow280.3%
Applied egg-rr80.3%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (if (<= z 0.0033) (/ (/ 1.0 y_m) x_m) (/ 1.0 (* x_m (* y_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 <= 0.0033) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (x_m * (y_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 <= 0.0033d0) then
tmp = (1.0d0 / y_m) / x_m
else
tmp = 1.0d0 / (x_m * (y_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 <= 0.0033) {
tmp = (1.0 / y_m) / x_m;
} else {
tmp = 1.0 / (x_m * (y_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 <= 0.0033: tmp = (1.0 / y_m) / x_m else: tmp = 1.0 / (x_m * (y_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 (z <= 0.0033) tmp = Float64(Float64(1.0 / y_m) / x_m); else tmp = Float64(1.0 / Float64(x_m * Float64(y_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 <= 0.0033)
tmp = (1.0 / y_m) / x_m;
else
tmp = 1.0 / (x_m * (y_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[z, 0.0033], N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(y$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 \leq 0.0033:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(y\_m \cdot z\right)}\\
\end{array}\right)
\end{array}
if z < 0.0033Initial program 94.0%
associate-/l/94.1%
associate-*l*94.0%
*-commutative94.0%
sqr-neg94.0%
+-commutative94.0%
sqr-neg94.0%
fma-define94.0%
Simplified94.0%
associate-*r*94.4%
*-commutative94.4%
associate-/r*94.5%
*-commutative94.5%
associate-/l/94.4%
fma-undefine94.4%
+-commutative94.4%
associate-/r*94.0%
*-un-lft-identity94.0%
add-sqr-sqrt46.1%
times-frac46.0%
+-commutative46.0%
fma-undefine46.0%
*-commutative46.0%
sqrt-prod46.0%
fma-undefine46.0%
+-commutative46.0%
hypot-1-def46.0%
+-commutative46.0%
Applied egg-rr48.6%
associate-*r/48.6%
associate-*r/48.6%
*-rgt-identity48.6%
*-commutative48.6%
associate-/r*48.6%
Simplified48.6%
frac-2neg48.6%
div-inv48.6%
associate-/l/48.6%
distribute-neg-frac248.6%
inv-pow48.6%
sqrt-pow248.6%
metadata-eval48.6%
distribute-neg-frac248.6%
associate-/l/48.6%
distribute-neg-frac248.6%
inv-pow48.6%
sqrt-pow248.6%
metadata-eval48.6%
Applied egg-rr48.6%
associate-*r/48.6%
associate-*l/48.6%
pow-sqr98.6%
metadata-eval98.6%
distribute-rgt-neg-in98.6%
Simplified98.6%
Taylor expanded in z around 0 71.8%
associate-/l/72.2%
Simplified72.2%
if 0.0033 < z Initial program 84.9%
associate-/l/84.7%
associate-*l*81.0%
*-commutative81.0%
sqr-neg81.0%
+-commutative81.0%
sqr-neg81.0%
fma-define81.0%
Simplified81.0%
associate-*r*84.4%
*-commutative84.4%
associate-/r*84.5%
*-commutative84.5%
associate-/l/84.5%
fma-undefine84.5%
+-commutative84.5%
associate-/r*84.9%
*-un-lft-identity84.9%
add-sqr-sqrt35.8%
times-frac35.8%
+-commutative35.8%
fma-undefine35.8%
*-commutative35.8%
sqrt-prod35.8%
fma-undefine35.8%
+-commutative35.8%
hypot-1-def35.8%
+-commutative35.8%
Applied egg-rr43.2%
associate-*r/43.2%
associate-*r/43.1%
*-rgt-identity43.1%
*-commutative43.1%
associate-/r*43.2%
Simplified43.2%
frac-2neg43.2%
div-inv43.2%
associate-/l/41.9%
distribute-neg-frac241.9%
inv-pow41.9%
sqrt-pow241.9%
metadata-eval41.9%
distribute-neg-frac241.9%
associate-/l/41.9%
distribute-neg-frac241.9%
inv-pow41.9%
sqrt-pow241.9%
metadata-eval41.9%
Applied egg-rr41.9%
associate-*r/41.8%
associate-*l/41.9%
pow-sqr97.1%
metadata-eval97.1%
distribute-rgt-neg-in97.1%
Simplified97.1%
Taylor expanded in z around inf 99.1%
Taylor expanded in z around 0 53.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(Float64(1.0 / y_m) / x_m))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * ((1.0 / y_m) / x_m));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(1.0 / y$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{\frac{1}{y\_m}}{x\_m}\right)
\end{array}
Initial program 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
associate-*r*91.4%
*-commutative91.4%
associate-/r*91.5%
*-commutative91.5%
associate-/l/91.5%
fma-undefine91.5%
+-commutative91.5%
associate-/r*91.3%
*-un-lft-identity91.3%
add-sqr-sqrt43.0%
times-frac43.0%
+-commutative43.0%
fma-undefine43.0%
*-commutative43.0%
sqrt-prod43.0%
fma-undefine43.0%
+-commutative43.0%
hypot-1-def43.0%
+-commutative43.0%
Applied egg-rr47.0%
associate-*r/47.0%
associate-*r/47.0%
*-rgt-identity47.0%
*-commutative47.0%
associate-/r*47.0%
Simplified47.0%
frac-2neg47.0%
div-inv47.0%
associate-/l/46.6%
distribute-neg-frac246.6%
inv-pow46.6%
sqrt-pow246.6%
metadata-eval46.6%
distribute-neg-frac246.6%
associate-/l/46.6%
distribute-neg-frac246.6%
inv-pow46.6%
sqrt-pow246.6%
metadata-eval46.6%
Applied egg-rr46.6%
associate-*r/46.6%
associate-*l/46.6%
pow-sqr98.2%
metadata-eval98.2%
distribute-rgt-neg-in98.2%
Simplified98.2%
Taylor expanded in z around 0 57.5%
associate-/l/57.5%
Simplified57.5%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (y_s x_s x_m y_m z) :precision binary64 (* y_s (* x_s (/ 1.0 (* y_m x_m)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(y_s, x_s, x_m, y_m, z)
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = y_s * (x_s * (1.0d0 / (y_m * x_m)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
return y_s * (x_s * (1.0 / (y_m * x_m)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(y_s, x_s, x_m, y_m, z): return y_s * (x_s * (1.0 / (y_m * x_m)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) x_m, y_m, z = sort([x_m, y_m, z]) function code(y_s, x_s, x_m, y_m, z) return Float64(y_s * Float64(x_s * Float64(1.0 / Float64(y_m * x_m)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
tmp = y_s * (x_s * (1.0 / (y_m * x_m)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(1.0 / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
y\_s \cdot \left(x\_s \cdot \frac{1}{y\_m \cdot x\_m}\right)
\end{array}
Initial program 91.3%
associate-/l/91.3%
associate-*l*90.2%
*-commutative90.2%
sqr-neg90.2%
+-commutative90.2%
sqr-neg90.2%
fma-define90.2%
Simplified90.2%
Taylor expanded in z around 0 57.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 2024137
(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)))))