
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1.5e+152)
(* (/ y_m (/ (sqrt (- (* z_m z_m) (* t a))) z_m)) x_m)
(* y_m (/ x_m (+ 1.0 (/ a (/ z_m (/ -0.5 (/ z_m t))))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.5e+152) {
tmp = (y_m / (sqrt(((z_m * z_m) - (t * a))) / z_m)) * x_m;
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.5d+152) then
tmp = (y_m / (sqrt(((z_m * z_m) - (t * a))) / z_m)) * x_m
else
tmp = y_m * (x_m / (1.0d0 + (a / (z_m / ((-0.5d0) / (z_m / t))))))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.5e+152) {
tmp = (y_m / (Math.sqrt(((z_m * z_m) - (t * a))) / z_m)) * x_m;
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.5e+152: tmp = (y_m / (math.sqrt(((z_m * z_m) - (t * a))) / z_m)) * x_m else: tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.5e+152) tmp = Float64(Float64(y_m / Float64(sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))) / z_m)) * x_m); else tmp = Float64(y_m * Float64(x_m / Float64(1.0 + Float64(a / Float64(z_m / Float64(-0.5 / Float64(z_m / t))))))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.5e+152)
tmp = (y_m / (sqrt(((z_m * z_m) - (t * a))) / z_m)) * x_m;
else
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.5e+152], N[(N[(y$95$m / N[(N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(1.0 + N[(a / N[(z$95$m / N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.5 \cdot 10^{+152}:\\
\;\;\;\;\frac{y\_m}{\frac{\sqrt{z\_m \cdot z\_m - t \cdot a}}{z\_m}} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot \frac{x\_m}{1 + \frac{a}{\frac{z\_m}{\frac{-0.5}{\frac{z\_m}{t}}}}}\\
\end{array}\right)\right)
\end{array}
if z < 1.49999999999999995e152Initial program 69.5%
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.7%
Applied egg-rr72.7%
if 1.49999999999999995e152 < z Initial program 11.5%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6471.6%
Simplified71.6%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
frac-timesN/A
associate-/l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/r/N/A
+-lowering-+.f64N/A
clear-numN/A
associate-/r*N/A
associate-/r/N/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
Applied egg-rr100.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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1.6e-158)
(* x_m (/ (* z_m y_m) (pow (- 0.0 (* t a)) 0.5)))
(if (<= z_m 1.6e+152)
(* (* z_m x_m) (/ y_m (sqrt (- (* z_m z_m) (* t a)))))
(* y_m (/ x_m (+ 1.0 (/ a (/ z_m (/ -0.5 (/ z_m t)))))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.6e-158) {
tmp = x_m * ((z_m * y_m) / pow((0.0 - (t * a)), 0.5));
} else if (z_m <= 1.6e+152) {
tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.6d-158) then
tmp = x_m * ((z_m * y_m) / ((0.0d0 - (t * a)) ** 0.5d0))
else if (z_m <= 1.6d+152) then
tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))))
else
tmp = y_m * (x_m / (1.0d0 + (a / (z_m / ((-0.5d0) / (z_m / t))))))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.6e-158) {
tmp = x_m * ((z_m * y_m) / Math.pow((0.0 - (t * a)), 0.5));
} else if (z_m <= 1.6e+152) {
tmp = (z_m * x_m) * (y_m / Math.sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.6e-158: tmp = x_m * ((z_m * y_m) / math.pow((0.0 - (t * a)), 0.5)) elif z_m <= 1.6e+152: tmp = (z_m * x_m) * (y_m / math.sqrt(((z_m * z_m) - (t * a)))) else: tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.6e-158) tmp = Float64(x_m * Float64(Float64(z_m * y_m) / (Float64(0.0 - Float64(t * a)) ^ 0.5))); elseif (z_m <= 1.6e+152) tmp = Float64(Float64(z_m * x_m) * Float64(y_m / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))))); else tmp = Float64(y_m * Float64(x_m / Float64(1.0 + Float64(a / Float64(z_m / Float64(-0.5 / Float64(z_m / t))))))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.6e-158)
tmp = x_m * ((z_m * y_m) / ((0.0 - (t * a)) ^ 0.5));
elseif (z_m <= 1.6e+152)
tmp = (z_m * x_m) * (y_m / sqrt(((z_m * z_m) - (t * a))));
else
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.6e-158], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Power[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z$95$m, 1.6e+152], N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(y$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(1.0 + N[(a / N[(z$95$m / N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.6 \cdot 10^{-158}:\\
\;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{{\left(0 - t \cdot a\right)}^{0.5}}\\
\mathbf{elif}\;z\_m \leq 1.6 \cdot 10^{+152}:\\
\;\;\;\;\left(z\_m \cdot x\_m\right) \cdot \frac{y\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot \frac{x\_m}{1 + \frac{a}{\frac{z\_m}{\frac{-0.5}{\frac{z\_m}{t}}}}}\\
\end{array}\right)\right)
\end{array}
if z < 1.59999999999999998e-158Initial program 61.4%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6435.4%
Simplified35.4%
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
--lowering--.f64N/A
*-lowering-*.f6435.8%
Applied egg-rr35.8%
if 1.59999999999999998e-158 < z < 1.60000000000000003e152Initial program 89.3%
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.6%
Applied egg-rr80.6%
if 1.60000000000000003e152 < z Initial program 11.5%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6471.6%
Simplified71.6%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
frac-timesN/A
associate-/l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/r/N/A
+-lowering-+.f64N/A
clear-numN/A
associate-/r*N/A
associate-/r/N/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
Applied egg-rr100.0%
Final simplification57.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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 4.1e+36)
(* (* z_m y_m) (/ x_m (sqrt (- (* z_m z_m) (* t a)))))
(* y_m (/ x_m (+ 1.0 (/ a (/ z_m (/ -0.5 (/ z_m t))))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.1e+36) {
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 4.1d+36) then
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))))
else
tmp = y_m * (x_m / (1.0d0 + (a / (z_m / ((-0.5d0) / (z_m / t))))))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.1e+36) {
tmp = (z_m * y_m) * (x_m / Math.sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 4.1e+36: tmp = (z_m * y_m) * (x_m / math.sqrt(((z_m * z_m) - (t * a)))) else: tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 4.1e+36) tmp = Float64(Float64(z_m * y_m) * Float64(x_m / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))))); else tmp = Float64(y_m * Float64(x_m / Float64(1.0 + Float64(a / Float64(z_m / Float64(-0.5 / Float64(z_m / t))))))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 4.1e+36)
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))));
else
tmp = y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t))))));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 4.1e+36], N[(N[(z$95$m * y$95$m), $MachinePrecision] * N[(x$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(1.0 + N[(a / N[(z$95$m / N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 4.1 \cdot 10^{+36}:\\
\;\;\;\;\left(z\_m \cdot y\_m\right) \cdot \frac{x\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot \frac{x\_m}{1 + \frac{a}{\frac{z\_m}{\frac{-0.5}{\frac{z\_m}{t}}}}}\\
\end{array}\right)\right)
\end{array}
if z < 4.10000000000000013e36Initial program 66.8%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.0%
Applied egg-rr64.0%
if 4.10000000000000013e36 < z Initial program 42.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.4%
Simplified76.4%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6496.4%
Applied egg-rr96.4%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6496.4%
Applied egg-rr96.4%
frac-timesN/A
associate-/l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/r/N/A
+-lowering-+.f64N/A
clear-numN/A
associate-/r*N/A
associate-/r/N/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
Applied egg-rr96.4%
Final simplification73.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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 2.9e-83)
(* x_m (/ (* z_m y_m) (pow (- 0.0 (* t a)) 0.5)))
(/ (* y_m x_m) (+ 1.0 (* (/ -0.5 (/ z_m t)) (/ a z_m)))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.9e-83) {
tmp = x_m * ((z_m * y_m) / pow((0.0 - (t * a)), 0.5));
} else {
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 2.9d-83) then
tmp = x_m * ((z_m * y_m) / ((0.0d0 - (t * a)) ** 0.5d0))
else
tmp = (y_m * x_m) / (1.0d0 + (((-0.5d0) / (z_m / t)) * (a / z_m)))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.9e-83) {
tmp = x_m * ((z_m * y_m) / Math.pow((0.0 - (t * a)), 0.5));
} else {
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 2.9e-83: tmp = x_m * ((z_m * y_m) / math.pow((0.0 - (t * a)), 0.5)) else: tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 2.9e-83) tmp = Float64(x_m * Float64(Float64(z_m * y_m) / (Float64(0.0 - Float64(t * a)) ^ 0.5))); else tmp = Float64(Float64(y_m * x_m) / Float64(1.0 + Float64(Float64(-0.5 / Float64(z_m / t)) * Float64(a / z_m)))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 2.9e-83)
tmp = x_m * ((z_m * y_m) / ((0.0 - (t * a)) ^ 0.5));
else
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 2.9e-83], N[(x$95$m * N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[Power[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(1.0 + N[(N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision] * N[(a / z$95$m), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 2.9 \cdot 10^{-83}:\\
\;\;\;\;x\_m \cdot \frac{z\_m \cdot y\_m}{{\left(0 - t \cdot a\right)}^{0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{1 + \frac{-0.5}{\frac{z\_m}{t}} \cdot \frac{a}{z\_m}}\\
\end{array}\right)\right)
\end{array}
if z < 2.8999999999999999e-83Initial program 63.8%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6437.2%
Simplified37.2%
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
--lowering--.f64N/A
*-lowering-*.f6437.0%
Applied egg-rr37.0%
if 2.8999999999999999e-83 < z Initial program 52.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6478.2%
Simplified78.2%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
Final simplification57.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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 4.5e-82)
(/ (* x_m (* z_m y_m)) (sqrt (- 0.0 (* t a))))
(/ (* y_m x_m) (+ 1.0 (* (/ -0.5 (/ z_m t)) (/ a z_m)))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.5e-82) {
tmp = (x_m * (z_m * y_m)) / sqrt((0.0 - (t * a)));
} else {
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 4.5d-82) then
tmp = (x_m * (z_m * y_m)) / sqrt((0.0d0 - (t * a)))
else
tmp = (y_m * x_m) / (1.0d0 + (((-0.5d0) / (z_m / t)) * (a / z_m)))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.5e-82) {
tmp = (x_m * (z_m * y_m)) / Math.sqrt((0.0 - (t * a)));
} else {
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 4.5e-82: tmp = (x_m * (z_m * y_m)) / math.sqrt((0.0 - (t * a))) else: tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 4.5e-82) tmp = Float64(Float64(x_m * Float64(z_m * y_m)) / sqrt(Float64(0.0 - Float64(t * a)))); else tmp = Float64(Float64(y_m * x_m) / Float64(1.0 + Float64(Float64(-0.5 / Float64(z_m / t)) * Float64(a / z_m)))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 4.5e-82)
tmp = (x_m * (z_m * y_m)) / sqrt((0.0 - (t * a)));
else
tmp = (y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m)));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 4.5e-82], N[(N[(x$95$m * N[(z$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(1.0 + N[(N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision] * N[(a / z$95$m), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 4.5 \cdot 10^{-82}:\\
\;\;\;\;\frac{x\_m \cdot \left(z\_m \cdot y\_m\right)}{\sqrt{0 - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{1 + \frac{-0.5}{\frac{z\_m}{t}} \cdot \frac{a}{z\_m}}\\
\end{array}\right)\right)
\end{array}
if z < 4.4999999999999998e-82Initial program 63.8%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6437.2%
Simplified37.2%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6436.5%
Applied egg-rr36.5%
if 4.4999999999999998e-82 < z Initial program 52.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6478.2%
Simplified78.2%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
Final simplification57.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)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 2.75e-117)
(/ (* z_m (* y_m x_m)) (sqrt (- 0.0 (* t a))))
(/ (* y_m x_m) (+ 1.0 (/ -0.5 (/ (/ z_m (/ t z_m)) a)))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.75e-117) {
tmp = (z_m * (y_m * x_m)) / sqrt((0.0 - (t * a)));
} else {
tmp = (y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)));
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 2.75d-117) then
tmp = (z_m * (y_m * x_m)) / sqrt((0.0d0 - (t * a)))
else
tmp = (y_m * x_m) / (1.0d0 + ((-0.5d0) / ((z_m / (t / z_m)) / a)))
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.75e-117) {
tmp = (z_m * (y_m * x_m)) / Math.sqrt((0.0 - (t * a)));
} else {
tmp = (y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)));
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 2.75e-117: tmp = (z_m * (y_m * x_m)) / math.sqrt((0.0 - (t * a))) else: tmp = (y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a))) return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 2.75e-117) tmp = Float64(Float64(z_m * Float64(y_m * x_m)) / sqrt(Float64(0.0 - Float64(t * a)))); else tmp = Float64(Float64(y_m * x_m) / Float64(1.0 + Float64(-0.5 / Float64(Float64(z_m / Float64(t / z_m)) / a)))); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 2.75e-117)
tmp = (z_m * (y_m * x_m)) / sqrt((0.0 - (t * a)));
else
tmp = (y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)));
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 2.75e-117], N[(N[(z$95$m * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(1.0 + N[(-0.5 / N[(N[(z$95$m / N[(t / z$95$m), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 2.75 \cdot 10^{-117}:\\
\;\;\;\;\frac{z\_m \cdot \left(y\_m \cdot x\_m\right)}{\sqrt{0 - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{1 + \frac{-0.5}{\frac{\frac{z\_m}{\frac{t}{z\_m}}}{a}}}\\
\end{array}\right)\right)
\end{array}
if z < 2.75000000000000013e-117Initial program 62.5%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6436.4%
Simplified36.4%
if 2.75000000000000013e-117 < z Initial program 55.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6475.3%
Simplified75.3%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6490.7%
Applied egg-rr90.7%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6490.7%
Applied egg-rr90.7%
*-commutativeN/A
frac-timesN/A
associate-/r/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6490.7%
Applied egg-rr90.7%
Final simplification57.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) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (/ (* y_m x_m) (+ 1.0 (/ -0.5 (/ (/ z_m (/ t z_m)) a))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a))))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * ((y_m * x_m) / (1.0d0 + ((-0.5d0) / ((z_m / (t / z_m)) / a))))))
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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a))))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a))))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(Float64(y_m * x_m) / Float64(1.0 + Float64(-0.5 / Float64(Float64(z_m / Float64(t / z_m)) / a))))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a))))));
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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(1.0 + N[(-0.5 / N[(N[(z$95$m / N[(t / z$95$m), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \frac{y\_m \cdot x\_m}{1 + \frac{-0.5}{\frac{\frac{z\_m}{\frac{t}{z\_m}}}{a}}}\right)\right)
\end{array}
Initial program 59.8%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6442.8%
Simplified42.8%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
*-commutativeN/A
frac-timesN/A
associate-/r/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
Final simplification49.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) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (/ (* y_m x_m) (+ 1.0 (* (/ -0.5 (/ z_m t)) (/ a z_m))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m))))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * ((y_m * x_m) / (1.0d0 + (((-0.5d0) / (z_m / t)) * (a / z_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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_m))))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(Float64(y_m * x_m) / Float64(1.0 + Float64(Float64(-0.5 / Float64(z_m / t)) * Float64(a / z_m))))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * ((y_m * x_m) / (1.0 + ((-0.5 / (z_m / t)) * (a / z_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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(1.0 + N[(N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision] * N[(a / z$95$m), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \frac{y\_m \cdot x\_m}{1 + \frac{-0.5}{\frac{z\_m}{t}} \cdot \frac{a}{z\_m}}\right)\right)
\end{array}
Initial program 59.8%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6442.8%
Simplified42.8%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
Final simplification49.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) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (* y_m (/ x_m (+ 1.0 (/ a (/ z_m (/ -0.5 (/ z_m t)))))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * (y_m * (x_m / (1.0d0 + (a / (z_m / ((-0.5d0) / (z_m / t)))))))))
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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * (y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(y_m * Float64(x_m / Float64(1.0 + Float64(a / Float64(z_m / Float64(-0.5 / Float64(z_m / t)))))))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * (y_m * (x_m / (1.0 + (a / (z_m / (-0.5 / (z_m / t)))))))));
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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(y$95$m * N[(x$95$m / N[(1.0 + N[(a / N[(z$95$m / N[(-0.5 / N[(z$95$m / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot \frac{x\_m}{1 + \frac{a}{\frac{z\_m}{\frac{-0.5}{\frac{z\_m}{t}}}}}\right)\right)\right)
\end{array}
Initial program 59.8%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6442.8%
Simplified42.8%
associate-/l*N/A
associate-/r*N/A
*-inversesN/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
*-commutativeN/A
div-invN/A
times-fracN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6449.5%
Applied egg-rr49.5%
frac-timesN/A
associate-/l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/r/N/A
+-lowering-+.f64N/A
clear-numN/A
associate-/r*N/A
associate-/r/N/A
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
Applied egg-rr49.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) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (if (<= z_m 2.4e-105) (/ (* y_m (* z_m x_m)) z_m) (* y_m x_m))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.4e-105) {
tmp = (y_m * (z_m * x_m)) / z_m;
} else {
tmp = y_m * x_m;
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 2.4d-105) then
tmp = (y_m * (z_m * x_m)) / z_m
else
tmp = y_m * x_m
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2.4e-105) {
tmp = (y_m * (z_m * x_m)) / z_m;
} else {
tmp = y_m * x_m;
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 2.4e-105: tmp = (y_m * (z_m * x_m)) / z_m else: tmp = y_m * x_m return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 2.4e-105) tmp = Float64(Float64(y_m * Float64(z_m * x_m)) / z_m); else tmp = Float64(y_m * x_m); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 2.4e-105)
tmp = (y_m * (z_m * x_m)) / z_m;
else
tmp = y_m * x_m;
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 2.4e-105], N[(N[(y$95$m * N[(z$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision], 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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 2.4 \cdot 10^{-105}:\\
\;\;\;\;\frac{y\_m \cdot \left(z\_m \cdot x\_m\right)}{z\_m}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 2.40000000000000015e-105Initial program 62.4%
Taylor expanded in z around inf
Simplified19.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6419.8%
Applied egg-rr19.8%
if 2.40000000000000015e-105 < z Initial program 55.4%
Taylor expanded in z around inf
*-lowering-*.f6487.4%
Simplified87.4%
Final simplification45.1%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (if (<= z_m 2e-64) (/ (* z_m (* y_m x_m)) z_m) (* y_m x_m))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2e-64) {
tmp = (z_m * (y_m * x_m)) / z_m;
} else {
tmp = y_m * x_m;
}
return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 2d-64) then
tmp = (z_m * (y_m * x_m)) / z_m
else
tmp = y_m * x_m
end if
code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 2e-64) {
tmp = (z_m * (y_m * x_m)) / z_m;
} else {
tmp = y_m * x_m;
}
return z_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 2e-64: tmp = (z_m * (y_m * x_m)) / z_m else: tmp = y_m * x_m return z_s * (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) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 2e-64) tmp = Float64(Float64(z_m * Float64(y_m * x_m)) / z_m); else tmp = Float64(y_m * x_m); end return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 2e-64)
tmp = (z_m * (y_m * x_m)) / z_m;
else
tmp = y_m * x_m;
end
tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 2e-64], N[(N[(z$95$m * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision], 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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 2 \cdot 10^{-64}:\\
\;\;\;\;\frac{z\_m \cdot \left(y\_m \cdot x\_m\right)}{z\_m}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 1.99999999999999993e-64Initial program 64.2%
Taylor expanded in z around inf
Simplified21.4%
if 1.99999999999999993e-64 < z Initial program 51.3%
Taylor expanded in z around inf
*-lowering-*.f6491.6%
Simplified91.6%
Final simplification45.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) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (* y_m x_m)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (y_m * x_m)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (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) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * (y_m * x_m)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * 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)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot x\_m\right)\right)\right)
\end{array}
Initial program 59.8%
Taylor expanded in z around inf
*-lowering-*.f6442.7%
Simplified42.7%
Final simplification42.7%
(FPCore (x y z t a)
:precision binary64
(if (< z -3.1921305903852764e+46)
(- (* y x))
(if (< z 5.976268120920894e+90)
(/ (* x z) (/ (sqrt (- (* z z) (* a t))) y))
(* y x))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z < (-3.1921305903852764d+46)) then
tmp = -(y * x)
else if (z < 5.976268120920894d+90) then
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y)
else
tmp = y * x
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (Math.sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if z < -3.1921305903852764e+46: tmp = -(y * x) elif z < 5.976268120920894e+90: tmp = (x * z) / (math.sqrt(((z * z) - (a * t))) / y) else: tmp = y * x return tmp
function code(x, y, z, t, a) tmp = 0.0 if (z < -3.1921305903852764e+46) tmp = Float64(-Float64(y * x)); elseif (z < 5.976268120920894e+90) tmp = Float64(Float64(x * z) / Float64(sqrt(Float64(Float64(z * z) - Float64(a * t))) / y)); else tmp = Float64(y * x); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (z < -3.1921305903852764e+46) tmp = -(y * x); elseif (z < 5.976268120920894e+90) tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y); else tmp = y * x; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[z, -3.1921305903852764e+46], (-N[(y * x), $MachinePrecision]), If[Less[z, 5.976268120920894e+90], N[(N[(x * z), $MachinePrecision] / N[(N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y * x), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < -3.1921305903852764 \cdot 10^{+46}:\\
\;\;\;\;-y \cdot x\\
\mathbf{elif}\;z < 5.976268120920894 \cdot 10^{+90}:\\
\;\;\;\;\frac{x \cdot z}{\frac{\sqrt{z \cdot z - a \cdot t}}{y}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot x\\
\end{array}
\end{array}
herbie shell --seed 2024160
(FPCore (x y z t a)
:name "Statistics.Math.RootFinding:ridders from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< z -31921305903852764000000000000000000000000000000) (- (* y x)) (if (< z 5976268120920894000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (* x z) (/ (sqrt (- (* z z) (* a t))) y)) (* y x))))
(/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))