
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 22 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 1.15e-31)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) z) c_m)
(/
1.0
(/
1.0
(fma
t
(* a (/ -4.0 c_m))
(fma x (* 9.0 (/ y (* c_m z))) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 1.15e-31) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / z) / c_m;
} else {
tmp = 1.0 / (1.0 / fma(t, (a * (-4.0 / c_m)), fma(x, (9.0 * (y / (c_m * z))), (b / (c_m * z)))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 1.15e-31) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / z) / c_m); else tmp = Float64(1.0 / Float64(1.0 / fma(t, Float64(a * Float64(-4.0 / c_m)), fma(x, Float64(9.0 * Float64(y / Float64(c_m * z))), Float64(b / Float64(c_m * z)))))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 1.15e-31], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(1.0 / N[(1.0 / N[(t * N[(a * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(9.0 * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 1.15 \cdot 10^{-31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{1}{\mathsf{fma}\left(t, a \cdot \frac{-4}{c\_m}, \mathsf{fma}\left(x, 9 \cdot \frac{y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)}}\\
\end{array}
\end{array}
if c < 1.1499999999999999e-31Initial program 82.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr83.4%
if 1.1499999999999999e-31 < c Initial program 63.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified84.0%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
Applied egg-rr83.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -6.5e+220)
t_1
(if (<= t_2 -1e-110)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))
(if (<= t_2 2e-265)
(fma -4.0 (* a (/ t c_m)) (/ b (* c_m z)))
(if (<= t_2 2e+224)
(/ (fma (* x 9.0) y (fma (* t a) (* z -4.0) b)) (* c_m z))
t_1)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (x * (1.0 / c_m)) * ((9.0 * y) / z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -6.5e+220) {
tmp = t_1;
} else if (t_2 <= -1e-110) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
} else if (t_2 <= 2e-265) {
tmp = fma(-4.0, (a * (t / c_m)), (b / (c_m * z)));
} else if (t_2 <= 2e+224) {
tmp = fma((x * 9.0), y, fma((t * a), (z * -4.0), b)) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -6.5e+220) tmp = t_1; elseif (t_2 <= -1e-110) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); elseif (t_2 <= 2e-265) tmp = fma(-4.0, Float64(a * Float64(t / c_m)), Float64(b / Float64(c_m * z))); elseif (t_2 <= 2e+224) tmp = Float64(fma(Float64(x * 9.0), y, fma(Float64(t * a), Float64(z * -4.0), b)) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -6.5e+220], t$95$1, If[LessEqual[t$95$2, -1e-110], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e-265], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+224], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -6.5 \cdot 10^{+220}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-110}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-265}:\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot \frac{t}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+224}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -6.5000000000000001e220 or 1.99999999999999994e224 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 51.6%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr66.8%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.7
Simplified58.7%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6481.4
Applied egg-rr81.4%
if -6.5000000000000001e220 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.0000000000000001e-110Initial program 90.5%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6492.4
Applied egg-rr92.4%
if -1.0000000000000001e-110 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999997e-265Initial program 76.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6476.7
Simplified76.7%
Taylor expanded in a around 0
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6485.2
Simplified85.2%
if 1.99999999999999997e-265 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999994e224Initial program 87.1%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval89.3
Applied egg-rr89.3%
Final simplification87.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma (* x 9.0) y (fma (* t a) (* z -4.0) b)) (* c_m z))))
(*
c_s
(if (<= (* x 9.0) -5e+273)
(* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))
(if (<= (* x 9.0) -2e-125)
t_1
(if (<= (* x 9.0) 1e-230)
(fma -4.0 (* a (/ t c_m)) (/ b (* c_m z)))
(if (<= (* x 9.0) 200000000.0)
t_1
(* (/ (* x 9.0) c_m) (/ y z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((x * 9.0), y, fma((t * a), (z * -4.0), b)) / (c_m * z);
double tmp;
if ((x * 9.0) <= -5e+273) {
tmp = (x * (1.0 / c_m)) * ((9.0 * y) / z);
} else if ((x * 9.0) <= -2e-125) {
tmp = t_1;
} else if ((x * 9.0) <= 1e-230) {
tmp = fma(-4.0, (a * (t / c_m)), (b / (c_m * z)));
} else if ((x * 9.0) <= 200000000.0) {
tmp = t_1;
} else {
tmp = ((x * 9.0) / c_m) * (y / z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(Float64(x * 9.0), y, fma(Float64(t * a), Float64(z * -4.0), b)) / Float64(c_m * z)) tmp = 0.0 if (Float64(x * 9.0) <= -5e+273) tmp = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)); elseif (Float64(x * 9.0) <= -2e-125) tmp = t_1; elseif (Float64(x * 9.0) <= 1e-230) tmp = fma(-4.0, Float64(a * Float64(t / c_m)), Float64(b / Float64(c_m * z))); elseif (Float64(x * 9.0) <= 200000000.0) tmp = t_1; else tmp = Float64(Float64(Float64(x * 9.0) / c_m) * Float64(y / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[N[(x * 9.0), $MachinePrecision], -5e+273], N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], -2e-125], t$95$1, If[LessEqual[N[(x * 9.0), $MachinePrecision], 1e-230], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], 200000000.0], t$95$1, N[(N[(N[(x * 9.0), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot 9 \leq -5 \cdot 10^{+273}:\\
\;\;\;\;\left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
\mathbf{elif}\;x \cdot 9 \leq -2 \cdot 10^{-125}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot 9 \leq 10^{-230}:\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot \frac{t}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{elif}\;x \cdot 9 \leq 200000000:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot 9}{c\_m} \cdot \frac{y}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 x #s(literal 9 binary64)) < -4.99999999999999961e273Initial program 31.7%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr45.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6445.9
Simplified45.9%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
if -4.99999999999999961e273 < (*.f64 x #s(literal 9 binary64)) < -2.00000000000000002e-125 or 1.00000000000000005e-230 < (*.f64 x #s(literal 9 binary64)) < 2e8Initial program 87.7%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval88.6
Applied egg-rr88.6%
if -2.00000000000000002e-125 < (*.f64 x #s(literal 9 binary64)) < 1.00000000000000005e-230Initial program 72.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6465.2
Simplified65.2%
Taylor expanded in a around 0
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6478.5
Simplified78.5%
if 2e8 < (*.f64 x #s(literal 9 binary64)) Initial program 71.9%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr80.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6440.7
Simplified40.7%
associate-/l/N/A
associate-/r*N/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-rgt-identityN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6448.6
Applied egg-rr48.6%
Final simplification75.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -5e+84)
t_1
(if (<= t_2 2e-20)
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))
(if (<= t_2 2e+224) (/ (fma (* x 9.0) y b) (* c_m z)) t_1))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (x * (1.0 / c_m)) * ((9.0 * y) / z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -5e+84) {
tmp = t_1;
} else if (t_2 <= 2e-20) {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
} else if (t_2 <= 2e+224) {
tmp = fma((x * 9.0), y, b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -5e+84) tmp = t_1; elseif (t_2 <= 2e-20) tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); elseif (t_2 <= 2e+224) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+84], t$95$1, If[LessEqual[t$95$2, 2e-20], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+224], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+84}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-20}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+224}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.0000000000000001e84 or 1.99999999999999994e224 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.5%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr71.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6461.3
Simplified61.3%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.5
Applied egg-rr76.5%
if -5.0000000000000001e84 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999989e-20Initial program 82.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified84.8%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6480.2
Simplified80.2%
if 1.99999999999999989e-20 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999994e224Initial program 87.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6480.9
Simplified80.9%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6481.0
Applied egg-rr81.0%
Final simplification79.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -5e+84)
t_1
(if (<= t_2 2e-20)
(fma -4.0 (* a (/ t c_m)) (/ b (* c_m z)))
(if (<= t_2 2e+224) (/ (fma (* x 9.0) y b) (* c_m z)) t_1))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (x * (1.0 / c_m)) * ((9.0 * y) / z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -5e+84) {
tmp = t_1;
} else if (t_2 <= 2e-20) {
tmp = fma(-4.0, (a * (t / c_m)), (b / (c_m * z)));
} else if (t_2 <= 2e+224) {
tmp = fma((x * 9.0), y, b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -5e+84) tmp = t_1; elseif (t_2 <= 2e-20) tmp = fma(-4.0, Float64(a * Float64(t / c_m)), Float64(b / Float64(c_m * z))); elseif (t_2 <= 2e+224) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+84], t$95$1, If[LessEqual[t$95$2, 2e-20], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+224], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+84}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-20}:\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot \frac{t}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+224}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.0000000000000001e84 or 1.99999999999999994e224 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.5%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr71.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6461.3
Simplified61.3%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.5
Applied egg-rr76.5%
if -5.0000000000000001e84 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999989e-20Initial program 82.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6471.8
Simplified71.8%
Taylor expanded in a around 0
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6479.5
Simplified79.5%
if 1.99999999999999989e-20 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999994e224Initial program 87.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6480.9
Simplified80.9%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6481.0
Applied egg-rr81.0%
Final simplification79.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -5e+84)
t_1
(if (<= t_2 2e-20)
(/ (fma -4.0 (* t a) (/ b z)) c_m)
(if (<= t_2 2e+224) (/ (fma (* x 9.0) y b) (* c_m z)) t_1))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (x * (1.0 / c_m)) * ((9.0 * y) / z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -5e+84) {
tmp = t_1;
} else if (t_2 <= 2e-20) {
tmp = fma(-4.0, (t * a), (b / z)) / c_m;
} else if (t_2 <= 2e+224) {
tmp = fma((x * 9.0), y, b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -5e+84) tmp = t_1; elseif (t_2 <= 2e-20) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c_m); elseif (t_2 <= 2e+224) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+84], t$95$1, If[LessEqual[t$95$2, 2e-20], N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$2, 2e+224], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+84}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-20}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c\_m}\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+224}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.0000000000000001e84 or 1.99999999999999994e224 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.5%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr71.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6461.3
Simplified61.3%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.5
Applied egg-rr76.5%
if -5.0000000000000001e84 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999989e-20Initial program 82.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified84.8%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6480.2
Simplified80.2%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6476.3
Simplified76.3%
if 1.99999999999999989e-20 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999994e224Initial program 87.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6480.9
Simplified80.9%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6481.0
Applied egg-rr81.0%
Final simplification77.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b))))
(*
c_s
(if (<= (* x 9.0) -5e+273)
(* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))
(if (<= (* x 9.0) -2e-107)
(/ (/ 1.0 c_m) (/ z t_1))
(if (<= (* x 9.0) 4e-284)
(fma -4.0 (* a (/ t c_m)) (/ b (* c_m z)))
(/ (/ t_1 c_m) z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(x, (9.0 * y), fma((t * a), (z * -4.0), b));
double tmp;
if ((x * 9.0) <= -5e+273) {
tmp = (x * (1.0 / c_m)) * ((9.0 * y) / z);
} else if ((x * 9.0) <= -2e-107) {
tmp = (1.0 / c_m) / (z / t_1);
} else if ((x * 9.0) <= 4e-284) {
tmp = fma(-4.0, (a * (t / c_m)), (b / (c_m * z)));
} else {
tmp = (t_1 / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) tmp = 0.0 if (Float64(x * 9.0) <= -5e+273) tmp = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)); elseif (Float64(x * 9.0) <= -2e-107) tmp = Float64(Float64(1.0 / c_m) / Float64(z / t_1)); elseif (Float64(x * 9.0) <= 4e-284) tmp = fma(-4.0, Float64(a * Float64(t / c_m)), Float64(b / Float64(c_m * z))); else tmp = Float64(Float64(t_1 / c_m) / z); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[N[(x * 9.0), $MachinePrecision], -5e+273], N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], -2e-107], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(z / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], 4e-284], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot 9 \leq -5 \cdot 10^{+273}:\\
\;\;\;\;\left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
\mathbf{elif}\;x \cdot 9 \leq -2 \cdot 10^{-107}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{\frac{z}{t\_1}}\\
\mathbf{elif}\;x \cdot 9 \leq 4 \cdot 10^{-284}:\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot \frac{t}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{c\_m}}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 x #s(literal 9 binary64)) < -4.99999999999999961e273Initial program 31.7%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr45.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6445.9
Simplified45.9%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
if -4.99999999999999961e273 < (*.f64 x #s(literal 9 binary64)) < -2e-107Initial program 86.0%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr87.4%
if -2e-107 < (*.f64 x #s(literal 9 binary64)) < 4.00000000000000015e-284Initial program 78.5%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6466.2
Simplified66.2%
Taylor expanded in a around 0
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6480.9
Simplified80.9%
if 4.00000000000000015e-284 < (*.f64 x #s(literal 9 binary64)) Initial program 77.1%
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr85.6%
Final simplification85.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (fma (* t a) (* z -4.0) b)))
(*
c_s
(if (<= (* x 9.0) -5e+273)
(* (* x (/ 1.0 c_m)) (/ (* 9.0 y) z))
(if (<= (* x 9.0) -2e-125)
(/ (fma (* x 9.0) y t_1) (* c_m z))
(if (<= (* x 9.0) 4e-284)
(fma -4.0 (* a (/ t c_m)) (/ b (* c_m z)))
(/ (/ (fma x (* 9.0 y) t_1) c_m) z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((t * a), (z * -4.0), b);
double tmp;
if ((x * 9.0) <= -5e+273) {
tmp = (x * (1.0 / c_m)) * ((9.0 * y) / z);
} else if ((x * 9.0) <= -2e-125) {
tmp = fma((x * 9.0), y, t_1) / (c_m * z);
} else if ((x * 9.0) <= 4e-284) {
tmp = fma(-4.0, (a * (t / c_m)), (b / (c_m * z)));
} else {
tmp = (fma(x, (9.0 * y), t_1) / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = fma(Float64(t * a), Float64(z * -4.0), b) tmp = 0.0 if (Float64(x * 9.0) <= -5e+273) tmp = Float64(Float64(x * Float64(1.0 / c_m)) * Float64(Float64(9.0 * y) / z)); elseif (Float64(x * 9.0) <= -2e-125) tmp = Float64(fma(Float64(x * 9.0), y, t_1) / Float64(c_m * z)); elseif (Float64(x * 9.0) <= 4e-284) tmp = fma(-4.0, Float64(a * Float64(t / c_m)), Float64(b / Float64(c_m * z))); else tmp = Float64(Float64(fma(x, Float64(9.0 * y), t_1) / c_m) / z); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]}, N[(c$95$s * If[LessEqual[N[(x * 9.0), $MachinePrecision], -5e+273], N[(N[(x * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], -2e-125], N[(N[(N[(x * 9.0), $MachinePrecision] * y + t$95$1), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * 9.0), $MachinePrecision], 4e-284], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + t$95$1), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot 9 \leq -5 \cdot 10^{+273}:\\
\;\;\;\;\left(x \cdot \frac{1}{c\_m}\right) \cdot \frac{9 \cdot y}{z}\\
\mathbf{elif}\;x \cdot 9 \leq -2 \cdot 10^{-125}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, t\_1\right)}{c\_m \cdot z}\\
\mathbf{elif}\;x \cdot 9 \leq 4 \cdot 10^{-284}:\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot \frac{t}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, t\_1\right)}{c\_m}}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 x #s(literal 9 binary64)) < -4.99999999999999961e273Initial program 31.7%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr45.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6445.9
Simplified45.9%
div-invN/A
clear-numN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
if -4.99999999999999961e273 < (*.f64 x #s(literal 9 binary64)) < -2.00000000000000002e-125Initial program 86.9%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval86.9
Applied egg-rr86.9%
if -2.00000000000000002e-125 < (*.f64 x #s(literal 9 binary64)) < 4.00000000000000015e-284Initial program 76.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6466.8
Simplified66.8%
Taylor expanded in a around 0
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6483.3
Simplified83.3%
if 4.00000000000000015e-284 < (*.f64 x #s(literal 9 binary64)) Initial program 77.1%
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr85.6%
Final simplification86.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -6e+22)
(* t (fma -4.0 (/ a c_m) (/ b (* t (* c_m z)))))
(if (<= z 1.3e-174)
(/ (fma 9.0 (/ (* x y) c_m) (/ (fma a (* -4.0 (* t z)) b) c_m)) z)
(/ (/ 1.0 c_m) (/ z (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -6e+22) {
tmp = t * fma(-4.0, (a / c_m), (b / (t * (c_m * z))));
} else if (z <= 1.3e-174) {
tmp = fma(9.0, ((x * y) / c_m), (fma(a, (-4.0 * (t * z)), b) / c_m)) / z;
} else {
tmp = (1.0 / c_m) / (z / fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -6e+22) tmp = Float64(t * fma(-4.0, Float64(a / c_m), Float64(b / Float64(t * Float64(c_m * z))))); elseif (z <= 1.3e-174) tmp = Float64(fma(9.0, Float64(Float64(x * y) / c_m), Float64(fma(a, Float64(-4.0 * Float64(t * z)), b) / c_m)) / z); else tmp = Float64(Float64(1.0 / c_m) / Float64(z / fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -6e+22], N[(t * N[(-4.0 * N[(a / c$95$m), $MachinePrecision] + N[(b / N[(t * N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.3e-174], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(N[(a * N[(-4.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(z / N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -6 \cdot 10^{+22}:\\
\;\;\;\;t \cdot \mathsf{fma}\left(-4, \frac{a}{c\_m}, \frac{b}{t \cdot \left(c\_m \cdot z\right)}\right)\\
\mathbf{elif}\;z \leq 1.3 \cdot 10^{-174}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, \frac{x \cdot y}{c\_m}, \frac{\mathsf{fma}\left(a, -4 \cdot \left(t \cdot z\right), b\right)}{c\_m}\right)}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{\frac{z}{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}}\\
\end{array}
\end{array}
if z < -6e22Initial program 61.1%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6456.4
Simplified56.4%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.1
Simplified73.1%
if -6e22 < z < 1.3000000000000001e-174Initial program 94.5%
Taylor expanded in z around 0
/-lowering-/.f64N/A
Simplified95.1%
if 1.3000000000000001e-174 < z Initial program 71.1%
clear-numN/A
*-commutativeN/A
associate-/l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+l-N/A
sub-negN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied egg-rr84.6%
Final simplification86.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 1.35e-35)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) z) c_m)
(fma
a
(* t (/ -4.0 c_m))
(fma x (/ (* 9.0 y) (* c_m z)) (/ b (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 1.35e-35) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / z) / c_m;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), fma(x, ((9.0 * y) / (c_m * z)), (b / (c_m * z))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 1.35e-35) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / z) / c_m); else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), fma(x, Float64(Float64(9.0 * y) / Float64(c_m * z)), Float64(b / Float64(c_m * z)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 1.35e-35], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(9.0 * y), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 1.35 \cdot 10^{-35}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \mathsf{fma}\left(x, \frac{9 \cdot y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)\\
\end{array}
\end{array}
if c < 1.3499999999999999e-35Initial program 82.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr83.4%
if 1.3499999999999999e-35 < c Initial program 63.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified84.0%
Final simplification83.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(*
c_s
(if (<= t_1 -5e+105)
(* y (* 9.0 (/ x (* c_m z))))
(if (<= t_1 4e-118)
(/ (fma (* a (* z -4.0)) t b) (* c_m z))
(/ (fma (* x 9.0) y b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -5e+105) {
tmp = y * (9.0 * (x / (c_m * z)));
} else if (t_1 <= 4e-118) {
tmp = fma((a * (z * -4.0)), t, b) / (c_m * z);
} else {
tmp = fma((x * 9.0), y, b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -5e+105) tmp = Float64(y * Float64(9.0 * Float64(x / Float64(c_m * z)))); elseif (t_1 <= 4e-118) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, b) / Float64(c_m * z)); else tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -5e+105], N[(y * N[(9.0 * N[(x / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e-118], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+105}:\\
\;\;\;\;y \cdot \left(9 \cdot \frac{x}{c\_m \cdot z}\right)\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-118}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000046e105Initial program 68.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr66.4%
Taylor expanded in x around inf
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6470.1
Simplified70.1%
if -5.00000000000000046e105 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.99999999999999994e-118Initial program 82.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6473.7
Simplified73.7%
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.1
Applied egg-rr73.1%
if 3.99999999999999994e-118 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6470.2
Simplified70.2%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6470.3
Applied egg-rr70.3%
Final simplification71.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(*
c_s
(if (<= t_1 -4e-31)
(/ (fma x (* y -9.0) (- b)) (* c_m (- z)))
(if (<= t_1 4e-118)
(/ (fma a (* -4.0 (* t z)) b) (* c_m z))
(/ (fma (* x 9.0) y b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -4e-31) {
tmp = fma(x, (y * -9.0), -b) / (c_m * -z);
} else if (t_1 <= 4e-118) {
tmp = fma(a, (-4.0 * (t * z)), b) / (c_m * z);
} else {
tmp = fma((x * 9.0), y, b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -4e-31) tmp = Float64(fma(x, Float64(y * -9.0), Float64(-b)) / Float64(c_m * Float64(-z))); elseif (t_1 <= 4e-118) tmp = Float64(fma(a, Float64(-4.0 * Float64(t * z)), b) / Float64(c_m * z)); else tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -4e-31], N[(N[(x * N[(y * -9.0), $MachinePrecision] + (-b)), $MachinePrecision] / N[(c$95$m * (-z)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e-118], N[(N[(a * N[(-4.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{-31}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y \cdot -9, -b\right)}{c\_m \cdot \left(-z\right)}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-118}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(t \cdot z\right), b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4e-31Initial program 76.5%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified75.9%
Taylor expanded in z around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6464.4
Simplified64.4%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
+-commutativeN/A
mul-1-negN/A
neg-sub0N/A
associate-+l-N/A
sub-negN/A
distribute-lft-neg-inN/A
metadata-evalN/A
neg-sub0N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified66.0%
if -4e-31 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.99999999999999994e-118Initial program 81.5%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6478.6
Simplified78.6%
if 3.99999999999999994e-118 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6470.2
Simplified70.2%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6470.3
Applied egg-rr70.3%
Final simplification72.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 (/ x (* c_m z))))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -1e+36) t_1 (if (<= t_2 5e+65) (* b (/ 1.0 (* c_m z))) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * (x / (c_m * z)));
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -1e+36) {
tmp = t_1;
} else if (t_2 <= 5e+65) {
tmp = b * (1.0 / (c_m * z));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = y * (9.0d0 * (x / (c_m * z)))
t_2 = y * (x * 9.0d0)
if (t_2 <= (-1d+36)) then
tmp = t_1
else if (t_2 <= 5d+65) then
tmp = b * (1.0d0 / (c_m * z))
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * (x / (c_m * z)));
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -1e+36) {
tmp = t_1;
} else if (t_2 <= 5e+65) {
tmp = b * (1.0 / (c_m * z));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = y * (9.0 * (x / (c_m * z))) t_2 = y * (x * 9.0) tmp = 0 if t_2 <= -1e+36: tmp = t_1 elif t_2 <= 5e+65: tmp = b * (1.0 / (c_m * z)) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * Float64(x / Float64(c_m * z)))) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -1e+36) tmp = t_1; elseif (t_2 <= 5e+65) tmp = Float64(b * Float64(1.0 / Float64(c_m * z))); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = y * (9.0 * (x / (c_m * z)));
t_2 = y * (x * 9.0);
tmp = 0.0;
if (t_2 <= -1e+36)
tmp = t_1;
elseif (t_2 <= 5e+65)
tmp = b * (1.0 / (c_m * z));
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * N[(x / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -1e+36], t$95$1, If[LessEqual[t$95$2, 5e+65], N[(b * N[(1.0 / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot \frac{x}{c\_m \cdot z}\right)\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+36}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+65}:\\
\;\;\;\;b \cdot \frac{1}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.00000000000000004e36 or 4.99999999999999973e65 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 71.5%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr73.8%
Taylor expanded in x around inf
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6466.3
Simplified66.3%
if -1.00000000000000004e36 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999973e65Initial program 83.3%
Taylor expanded in b around inf
Simplified47.5%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6448.6
Applied egg-rr48.6%
Final simplification55.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma -4.0 (* t a) (/ b z)) c_m)))
(*
c_s
(if (<= z -1.8e+25)
t_1
(if (<= z 2.2e-69) (* (fma x (* 9.0 y) b) (/ 1.0 (* c_m z))) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(-4.0, (t * a), (b / z)) / c_m;
double tmp;
if (z <= -1.8e+25) {
tmp = t_1;
} else if (z <= 2.2e-69) {
tmp = fma(x, (9.0 * y), b) * (1.0 / (c_m * z));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c_m) tmp = 0.0 if (z <= -1.8e+25) tmp = t_1; elseif (z <= 2.2e-69) tmp = Float64(fma(x, Float64(9.0 * y), b) * Float64(1.0 / Float64(c_m * z))); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.8e+25], t$95$1, If[LessEqual[z, 2.2e-69], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] * N[(1.0 / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.8 \cdot 10^{+25}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{-69}:\\
\;\;\;\;\mathsf{fma}\left(x, 9 \cdot y, b\right) \cdot \frac{1}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.80000000000000008e25 or 2.2e-69 < z Initial program 62.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified82.7%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6465.5
Simplified65.5%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.6
Simplified67.6%
if -1.80000000000000008e25 < z < 2.2e-69Initial program 93.5%
div-invN/A
*-lowering-*.f64N/A
Applied egg-rr91.4%
Taylor expanded in t around 0
Simplified83.9%
Final simplification76.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.5e+29)
(* (/ a c_m) (* t -4.0))
(if (<= z 1.55e+208)
(/ (fma x (* y -9.0) (- b)) (* c_m (- z)))
(* -4.0 (/ (* t a) c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.5e+29) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 1.55e+208) {
tmp = fma(x, (y * -9.0), -b) / (c_m * -z);
} else {
tmp = -4.0 * ((t * a) / c_m);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.5e+29) tmp = Float64(Float64(a / c_m) * Float64(t * -4.0)); elseif (z <= 1.55e+208) tmp = Float64(fma(x, Float64(y * -9.0), Float64(-b)) / Float64(c_m * Float64(-z))); else tmp = Float64(-4.0 * Float64(Float64(t * a) / c_m)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.5e+29], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.55e+208], N[(N[(x * N[(y * -9.0), $MachinePrecision] + (-b)), $MachinePrecision] / N[(c$95$m * (-z)), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.5 \cdot 10^{+29}:\\
\;\;\;\;\frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
\mathbf{elif}\;z \leq 1.55 \cdot 10^{+208}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y \cdot -9, -b\right)}{c\_m \cdot \left(-z\right)}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c\_m}\\
\end{array}
\end{array}
if z < -1.5e29Initial program 60.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr76.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2
Simplified63.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8
Applied egg-rr66.8%
if -1.5e29 < z < 1.5499999999999999e208Initial program 90.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified77.8%
Taylor expanded in z around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.0
Simplified74.0%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
+-commutativeN/A
mul-1-negN/A
neg-sub0N/A
associate-+l-N/A
sub-negN/A
distribute-lft-neg-inN/A
metadata-evalN/A
neg-sub0N/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified75.8%
if 1.5499999999999999e208 < z Initial program 29.6%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr73.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.0
Simplified48.0%
Final simplification71.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (/ a c_m) (* t -4.0))))
(*
c_s
(if (<= z -4.8e+27)
t_1
(if (<= z 5.5e+188) (/ (fma (* x 9.0) y b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (a / c_m) * (t * -4.0);
double tmp;
if (z <= -4.8e+27) {
tmp = t_1;
} else if (z <= 5.5e+188) {
tmp = fma((x * 9.0), y, b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(a / c_m) * Float64(t * -4.0)) tmp = 0.0 if (z <= -4.8e+27) tmp = t_1; elseif (z <= 5.5e+188) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -4.8e+27], t$95$1, If[LessEqual[z, 5.5e+188], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -4.8 \cdot 10^{+27}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5.5 \cdot 10^{+188}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -4.79999999999999995e27 or 5.50000000000000013e188 < z Initial program 51.4%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr75.1%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6457.4
Simplified57.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6461.1
Applied egg-rr61.1%
if -4.79999999999999995e27 < z < 5.50000000000000013e188Initial program 90.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6476.0
Simplified76.0%
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6476.1
Applied egg-rr76.1%
Final simplification71.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -6e+29)
(* (/ a c_m) (* t -4.0))
(if (<= z 3.95e+210)
(/ (fma 9.0 (* x y) b) (* c_m z))
(* -4.0 (/ (* t a) c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -6e+29) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 3.95e+210) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = -4.0 * ((t * a) / c_m);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -6e+29) tmp = Float64(Float64(a / c_m) * Float64(t * -4.0)); elseif (z <= 3.95e+210) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = Float64(-4.0 * Float64(Float64(t * a) / c_m)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -6e+29], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.95e+210], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -6 \cdot 10^{+29}:\\
\;\;\;\;\frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
\mathbf{elif}\;z \leq 3.95 \cdot 10^{+210}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c\_m}\\
\end{array}
\end{array}
if z < -5.9999999999999998e29Initial program 60.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr76.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2
Simplified63.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8
Applied egg-rr66.8%
if -5.9999999999999998e29 < z < 3.95000000000000014e210Initial program 90.3%
Taylor expanded in z around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6475.7
Simplified75.7%
if 3.95000000000000014e210 < z Initial program 29.6%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr73.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.0
Simplified48.0%
Final simplification71.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -8.2e+24)
(* (/ a c_m) (* t -4.0))
(if (<= z 6.8e-71) (* b (/ 1.0 (* c_m z))) (* a (* -4.0 (/ t c_m)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -8.2e+24) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 6.8e-71) {
tmp = b * (1.0 / (c_m * z));
} else {
tmp = a * (-4.0 * (t / c_m));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-8.2d+24)) then
tmp = (a / c_m) * (t * (-4.0d0))
else if (z <= 6.8d-71) then
tmp = b * (1.0d0 / (c_m * z))
else
tmp = a * ((-4.0d0) * (t / c_m))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -8.2e+24) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 6.8e-71) {
tmp = b * (1.0 / (c_m * z));
} else {
tmp = a * (-4.0 * (t / c_m));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -8.2e+24: tmp = (a / c_m) * (t * -4.0) elif z <= 6.8e-71: tmp = b * (1.0 / (c_m * z)) else: tmp = a * (-4.0 * (t / c_m)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -8.2e+24) tmp = Float64(Float64(a / c_m) * Float64(t * -4.0)); elseif (z <= 6.8e-71) tmp = Float64(b * Float64(1.0 / Float64(c_m * z))); else tmp = Float64(a * Float64(-4.0 * Float64(t / c_m))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -8.2e+24)
tmp = (a / c_m) * (t * -4.0);
elseif (z <= 6.8e-71)
tmp = b * (1.0 / (c_m * z));
else
tmp = a * (-4.0 * (t / c_m));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -8.2e+24], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.8e-71], N[(b * N[(1.0 / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(-4.0 * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -8.2 \cdot 10^{+24}:\\
\;\;\;\;\frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
\mathbf{elif}\;z \leq 6.8 \cdot 10^{-71}:\\
\;\;\;\;b \cdot \frac{1}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c\_m}\right)\\
\end{array}
\end{array}
if z < -8.2000000000000002e24Initial program 60.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr76.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2
Simplified63.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8
Applied egg-rr66.8%
if -8.2000000000000002e24 < z < 6.80000000000000007e-71Initial program 93.5%
Taylor expanded in b around inf
Simplified47.7%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6449.8
Applied egg-rr49.8%
if 6.80000000000000007e-71 < z Initial program 64.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr81.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6438.9
Simplified38.9%
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6437.6
Applied egg-rr37.6%
Final simplification50.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1e+27)
(* (/ a c_m) (* t -4.0))
(if (<= z 4e-73) (/ b (* c_m z)) (* a (* -4.0 (/ t c_m)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1e+27) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 4e-73) {
tmp = b / (c_m * z);
} else {
tmp = a * (-4.0 * (t / c_m));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1d+27)) then
tmp = (a / c_m) * (t * (-4.0d0))
else if (z <= 4d-73) then
tmp = b / (c_m * z)
else
tmp = a * ((-4.0d0) * (t / c_m))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1e+27) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 4e-73) {
tmp = b / (c_m * z);
} else {
tmp = a * (-4.0 * (t / c_m));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1e+27: tmp = (a / c_m) * (t * -4.0) elif z <= 4e-73: tmp = b / (c_m * z) else: tmp = a * (-4.0 * (t / c_m)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1e+27) tmp = Float64(Float64(a / c_m) * Float64(t * -4.0)); elseif (z <= 4e-73) tmp = Float64(b / Float64(c_m * z)); else tmp = Float64(a * Float64(-4.0 * Float64(t / c_m))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1e+27)
tmp = (a / c_m) * (t * -4.0);
elseif (z <= 4e-73)
tmp = b / (c_m * z);
else
tmp = a * (-4.0 * (t / c_m));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1e+27], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-73], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(a * N[(-4.0 * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1 \cdot 10^{+27}:\\
\;\;\;\;\frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
\mathbf{elif}\;z \leq 4 \cdot 10^{-73}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c\_m}\right)\\
\end{array}
\end{array}
if z < -1e27Initial program 60.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr76.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2
Simplified63.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8
Applied egg-rr66.8%
if -1e27 < z < 3.99999999999999999e-73Initial program 93.4%
Taylor expanded in b around inf
Simplified48.1%
if 3.99999999999999999e-73 < z Initial program 64.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr81.8%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6438.4
Simplified38.4%
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6437.1
Applied egg-rr37.1%
Final simplification49.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.75e+25)
(* (/ a c_m) (* t -4.0))
(if (<= z 4.5e-70) (/ b (* c_m z)) (* -4.0 (/ (* t a) c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.75e+25) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 4.5e-70) {
tmp = b / (c_m * z);
} else {
tmp = -4.0 * ((t * a) / c_m);
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1.75d+25)) then
tmp = (a / c_m) * (t * (-4.0d0))
else if (z <= 4.5d-70) then
tmp = b / (c_m * z)
else
tmp = (-4.0d0) * ((t * a) / c_m)
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.75e+25) {
tmp = (a / c_m) * (t * -4.0);
} else if (z <= 4.5e-70) {
tmp = b / (c_m * z);
} else {
tmp = -4.0 * ((t * a) / c_m);
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1.75e+25: tmp = (a / c_m) * (t * -4.0) elif z <= 4.5e-70: tmp = b / (c_m * z) else: tmp = -4.0 * ((t * a) / c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.75e+25) tmp = Float64(Float64(a / c_m) * Float64(t * -4.0)); elseif (z <= 4.5e-70) tmp = Float64(b / Float64(c_m * z)); else tmp = Float64(-4.0 * Float64(Float64(t * a) / c_m)); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1.75e+25)
tmp = (a / c_m) * (t * -4.0);
elseif (z <= 4.5e-70)
tmp = b / (c_m * z);
else
tmp = -4.0 * ((t * a) / c_m);
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.75e+25], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.5e-70], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{+25}:\\
\;\;\;\;\frac{a}{c\_m} \cdot \left(t \cdot -4\right)\\
\mathbf{elif}\;z \leq 4.5 \cdot 10^{-70}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c\_m}\\
\end{array}
\end{array}
if z < -1.75e25Initial program 60.3%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr76.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.2
Simplified63.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8
Applied egg-rr66.8%
if -1.75e25 < z < 4.50000000000000022e-70Initial program 93.5%
Taylor expanded in b around inf
Simplified47.4%
if 4.50000000000000022e-70 < z Initial program 63.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr81.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6439.5
Simplified39.5%
Final simplification49.4%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* -4.0 (/ (* t a) c_m)))) (* c_s (if (<= z -1.45e+23) t_1 (if (<= z 2.7e-69) (/ b (* c_m z)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * ((t * a) / c_m);
double tmp;
if (z <= -1.45e+23) {
tmp = t_1;
} else if (z <= 2.7e-69) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * ((t * a) / c_m)
if (z <= (-1.45d+23)) then
tmp = t_1
else if (z <= 2.7d-69) then
tmp = b / (c_m * z)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * ((t * a) / c_m);
double tmp;
if (z <= -1.45e+23) {
tmp = t_1;
} else if (z <= 2.7e-69) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = -4.0 * ((t * a) / c_m) tmp = 0 if z <= -1.45e+23: tmp = t_1 elif z <= 2.7e-69: tmp = b / (c_m * z) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(-4.0 * Float64(Float64(t * a) / c_m)) tmp = 0.0 if (z <= -1.45e+23) tmp = t_1; elseif (z <= 2.7e-69) tmp = Float64(b / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = -4.0 * ((t * a) / c_m);
tmp = 0.0;
if (z <= -1.45e+23)
tmp = t_1;
elseif (z <= 2.7e-69)
tmp = b / (c_m * z);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.45e+23], t$95$1, If[LessEqual[z, 2.7e-69], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{t \cdot a}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.45 \cdot 10^{+23}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.7 \cdot 10^{-69}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.45000000000000006e23 or 2.6999999999999997e-69 < z Initial program 62.2%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr79.2%
Taylor expanded in t around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6450.1
Simplified50.1%
if -1.45000000000000006e23 < z < 2.6999999999999997e-69Initial program 93.5%
Taylor expanded in b around inf
Simplified47.4%
Final simplification48.7%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* c_m z))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (c_m * z))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (c_m * z))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(c_m * z))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (c_m * z));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{c\_m \cdot z}
\end{array}
Initial program 78.7%
Taylor expanded in b around inf
Simplified34.4%
Final simplification34.4%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024204
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))