
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (/ t (* a_m 2.0))))
(*
a_s
(if (<= (* a_m 2.0) 1e+195)
(/ (+ (* x y) (* z (* t -9.0))) (* a_m 2.0))
(+
(fma (/ y a_m) (/ x 2.0) (* t_1 (- 0.0 (* z 9.0))))
(fma (- 0.0 t_1) (* z 9.0) (* t_1 (* z 9.0))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = t / (a_m * 2.0);
double tmp;
if ((a_m * 2.0) <= 1e+195) {
tmp = ((x * y) + (z * (t * -9.0))) / (a_m * 2.0);
} else {
tmp = fma((y / a_m), (x / 2.0), (t_1 * (0.0 - (z * 9.0)))) + fma((0.0 - t_1), (z * 9.0), (t_1 * (z * 9.0)));
}
return a_s * tmp;
}
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(t / Float64(a_m * 2.0)) tmp = 0.0 if (Float64(a_m * 2.0) <= 1e+195) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a_m * 2.0)); else tmp = Float64(fma(Float64(y / a_m), Float64(x / 2.0), Float64(t_1 * Float64(0.0 - Float64(z * 9.0)))) + fma(Float64(0.0 - t_1), Float64(z * 9.0), Float64(t_1 * Float64(z * 9.0)))); end return Float64(a_s * tmp) end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(t / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(a$95$m * 2.0), $MachinePrecision], 1e+195], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a$95$m), $MachinePrecision] * N[(x / 2.0), $MachinePrecision] + N[(t$95$1 * N[(0.0 - N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(0.0 - t$95$1), $MachinePrecision] * N[(z * 9.0), $MachinePrecision] + N[(t$95$1 * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := \frac{t}{a\_m \cdot 2}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;a\_m \cdot 2 \leq 10^{+195}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a\_m}, \frac{x}{2}, t\_1 \cdot \left(0 - z \cdot 9\right)\right) + \mathsf{fma}\left(0 - t\_1, z \cdot 9, t\_1 \cdot \left(z \cdot 9\right)\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 9.99999999999999977e194Initial program 93.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6493.6%
Simplified93.6%
if 9.99999999999999977e194 < (*.f64 a #s(literal 2 binary64)) Initial program 82.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6482.5%
Simplified82.5%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
*-commutativeN/A
times-fracN/A
associate-/l*N/A
prod-diffN/A
+-lowering-+.f64N/A
Applied egg-rr95.5%
Final simplification93.8%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* (/ t a_m) (- 0.0 4.5))))
(*
a_s
(if (<= (* a_m 2.0) 1e+195)
(/ (+ (* x y) (* z (* t -9.0))) (* a_m 2.0))
(+
(fma (/ y a_m) (/ x 2.0) (* z t_1))
(fma t_1 z (* z (* (/ t a_m) 4.5))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = (t / a_m) * (0.0 - 4.5);
double tmp;
if ((a_m * 2.0) <= 1e+195) {
tmp = ((x * y) + (z * (t * -9.0))) / (a_m * 2.0);
} else {
tmp = fma((y / a_m), (x / 2.0), (z * t_1)) + fma(t_1, z, (z * ((t / a_m) * 4.5)));
}
return a_s * tmp;
}
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(Float64(t / a_m) * Float64(0.0 - 4.5)) tmp = 0.0 if (Float64(a_m * 2.0) <= 1e+195) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a_m * 2.0)); else tmp = Float64(fma(Float64(y / a_m), Float64(x / 2.0), Float64(z * t_1)) + fma(t_1, z, Float64(z * Float64(Float64(t / a_m) * 4.5)))); end return Float64(a_s * tmp) end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(t / a$95$m), $MachinePrecision] * N[(0.0 - 4.5), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(a$95$m * 2.0), $MachinePrecision], 1e+195], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a$95$m), $MachinePrecision] * N[(x / 2.0), $MachinePrecision] + N[(z * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * z + N[(z * N[(N[(t / a$95$m), $MachinePrecision] * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := \frac{t}{a\_m} \cdot \left(0 - 4.5\right)\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;a\_m \cdot 2 \leq 10^{+195}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a\_m}, \frac{x}{2}, z \cdot t\_1\right) + \mathsf{fma}\left(t\_1, z, z \cdot \left(\frac{t}{a\_m} \cdot 4.5\right)\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 9.99999999999999977e194Initial program 93.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6493.6%
Simplified93.6%
if 9.99999999999999977e194 < (*.f64 a #s(literal 2 binary64)) Initial program 82.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6482.5%
Simplified82.5%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
times-fracN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
associate-*l*N/A
associate-/l*N/A
prod-diffN/A
Applied egg-rr95.2%
Final simplification93.8%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* t (* z 9.0))))
(*
a_s
(if (<= t_1 (- INFINITY))
(* -4.5 (* z (/ t a_m)))
(/ (- (* x y) t_1) (* a_m 2.0))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -4.5 * (z * (t / a_m));
} else {
tmp = ((x * y) - t_1) / (a_m * 2.0);
}
return a_s * tmp;
}
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = -4.5 * (z * (t / a_m));
} else {
tmp = ((x * y) - t_1) / (a_m * 2.0);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): t_1 = t * (z * 9.0) tmp = 0 if t_1 <= -math.inf: tmp = -4.5 * (z * (t / a_m)) else: tmp = ((x * y) - t_1) / (a_m * 2.0) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(t * Float64(z * 9.0)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); else tmp = Float64(Float64(Float64(x * y) - t_1) / Float64(a_m * 2.0)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
t_1 = t * (z * 9.0);
tmp = 0.0;
if (t_1 <= -Inf)
tmp = -4.5 * (z * (t / a_m));
else
tmp = ((x * y) - t_1) / (a_m * 2.0);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - t$95$1), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(z \cdot 9\right)\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - t\_1}{a\_m \cdot 2}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0Initial program 44.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6444.9%
Simplified44.9%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6444.9%
Simplified44.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6499.6%
Applied egg-rr99.6%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 95.0%
Final simplification95.3%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= z -3.4e+107)
(* (* t -4.5) (/ z a_m))
(if (<= z 2.5e-165) (/ (* x y) (* a_m 2.0)) (* -4.5 (* z (/ t a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -3.4e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 2.5e-165) {
tmp = (x * y) / (a_m * 2.0);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
real(8) :: tmp
if (z <= (-3.4d+107)) then
tmp = (t * (-4.5d0)) * (z / a_m)
else if (z <= 2.5d-165) then
tmp = (x * y) / (a_m * 2.0d0)
else
tmp = (-4.5d0) * (z * (t / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -3.4e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 2.5e-165) {
tmp = (x * y) / (a_m * 2.0);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if z <= -3.4e+107: tmp = (t * -4.5) * (z / a_m) elif z <= 2.5e-165: tmp = (x * y) / (a_m * 2.0) else: tmp = -4.5 * (z * (t / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (z <= -3.4e+107) tmp = Float64(Float64(t * -4.5) * Float64(z / a_m)); elseif (z <= 2.5e-165) tmp = Float64(Float64(x * y) / Float64(a_m * 2.0)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (z <= -3.4e+107)
tmp = (t * -4.5) * (z / a_m);
elseif (z <= 2.5e-165)
tmp = (x * y) / (a_m * 2.0);
else
tmp = -4.5 * (z * (t / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[z, -3.4e+107], N[(N[(t * -4.5), $MachinePrecision] * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.5e-165], N[(N[(x * y), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3.4 \cdot 10^{+107}:\\
\;\;\;\;\left(t \cdot -4.5\right) \cdot \frac{z}{a\_m}\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{-165}:\\
\;\;\;\;\frac{x \cdot y}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\end{array}
\end{array}
if z < -3.3999999999999997e107Initial program 79.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.7%
Simplified79.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.7%
Simplified63.7%
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6479.3%
Applied egg-rr79.3%
if -3.3999999999999997e107 < z < 2.4999999999999999e-165Initial program 97.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6497.7%
Simplified97.7%
Taylor expanded in x around inf
*-lowering-*.f6472.2%
Simplified72.2%
if 2.4999999999999999e-165 < z Initial program 88.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6488.8%
Simplified88.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.1%
Simplified56.1%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6458.1%
Applied egg-rr58.1%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= z -1.65e+107)
(* (* t -4.5) (/ z a_m))
(if (<= z 1e-165) (* (/ y a_m) (* x 0.5)) (* -4.5 (* z (/ t a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -1.65e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 1e-165) {
tmp = (y / a_m) * (x * 0.5);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
real(8) :: tmp
if (z <= (-1.65d+107)) then
tmp = (t * (-4.5d0)) * (z / a_m)
else if (z <= 1d-165) then
tmp = (y / a_m) * (x * 0.5d0)
else
tmp = (-4.5d0) * (z * (t / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -1.65e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 1e-165) {
tmp = (y / a_m) * (x * 0.5);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if z <= -1.65e+107: tmp = (t * -4.5) * (z / a_m) elif z <= 1e-165: tmp = (y / a_m) * (x * 0.5) else: tmp = -4.5 * (z * (t / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (z <= -1.65e+107) tmp = Float64(Float64(t * -4.5) * Float64(z / a_m)); elseif (z <= 1e-165) tmp = Float64(Float64(y / a_m) * Float64(x * 0.5)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (z <= -1.65e+107)
tmp = (t * -4.5) * (z / a_m);
elseif (z <= 1e-165)
tmp = (y / a_m) * (x * 0.5);
else
tmp = -4.5 * (z * (t / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[z, -1.65e+107], N[(N[(t * -4.5), $MachinePrecision] * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1e-165], N[(N[(y / a$95$m), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.65 \cdot 10^{+107}:\\
\;\;\;\;\left(t \cdot -4.5\right) \cdot \frac{z}{a\_m}\\
\mathbf{elif}\;z \leq 10^{-165}:\\
\;\;\;\;\frac{y}{a\_m} \cdot \left(x \cdot 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\end{array}
\end{array}
if z < -1.65000000000000016e107Initial program 79.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.7%
Simplified79.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.7%
Simplified63.7%
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6479.3%
Applied egg-rr79.3%
if -1.65000000000000016e107 < z < 1e-165Initial program 97.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6497.7%
Simplified97.7%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
fma-defineN/A
associate-*l/N/A
times-fracN/A
*-inversesN/A
*-inversesN/A
times-fracN/A
associate-*l/N/A
fma-defineN/A
associate-*l*N/A
Simplified85.8%
Taylor expanded in t around 0
*-commutativeN/A
*-lowering-*.f6469.5%
Simplified69.5%
if 1e-165 < z Initial program 88.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6488.8%
Simplified88.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.1%
Simplified56.1%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6458.1%
Applied egg-rr58.1%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= z -2.75e+107)
(* (* t -4.5) (/ z a_m))
(if (<= z 1e-165) (* 0.5 (* y (/ x a_m))) (* -4.5 (* z (/ t a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -2.75e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 1e-165) {
tmp = 0.5 * (y * (x / a_m));
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
real(8) :: tmp
if (z <= (-2.75d+107)) then
tmp = (t * (-4.5d0)) * (z / a_m)
else if (z <= 1d-165) then
tmp = 0.5d0 * (y * (x / a_m))
else
tmp = (-4.5d0) * (z * (t / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -2.75e+107) {
tmp = (t * -4.5) * (z / a_m);
} else if (z <= 1e-165) {
tmp = 0.5 * (y * (x / a_m));
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if z <= -2.75e+107: tmp = (t * -4.5) * (z / a_m) elif z <= 1e-165: tmp = 0.5 * (y * (x / a_m)) else: tmp = -4.5 * (z * (t / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (z <= -2.75e+107) tmp = Float64(Float64(t * -4.5) * Float64(z / a_m)); elseif (z <= 1e-165) tmp = Float64(0.5 * Float64(y * Float64(x / a_m))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (z <= -2.75e+107)
tmp = (t * -4.5) * (z / a_m);
elseif (z <= 1e-165)
tmp = 0.5 * (y * (x / a_m));
else
tmp = -4.5 * (z * (t / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[z, -2.75e+107], N[(N[(t * -4.5), $MachinePrecision] * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1e-165], N[(0.5 * N[(y * N[(x / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2.75 \cdot 10^{+107}:\\
\;\;\;\;\left(t \cdot -4.5\right) \cdot \frac{z}{a\_m}\\
\mathbf{elif}\;z \leq 10^{-165}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\end{array}
\end{array}
if z < -2.7500000000000002e107Initial program 79.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.7%
Simplified79.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.7%
Simplified63.7%
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6479.3%
Applied egg-rr79.3%
if -2.7500000000000002e107 < z < 1e-165Initial program 97.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6497.7%
Simplified97.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.6%
Simplified67.6%
if 1e-165 < z Initial program 88.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6488.8%
Simplified88.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.1%
Simplified56.1%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6458.1%
Applied egg-rr58.1%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= z -6.5e+109)
(* -4.5 (/ (* z t) a_m))
(if (<= z 6.5e-167) (* 0.5 (* y (/ x a_m))) (* -4.5 (* z (/ t a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -6.5e+109) {
tmp = -4.5 * ((z * t) / a_m);
} else if (z <= 6.5e-167) {
tmp = 0.5 * (y * (x / a_m));
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
real(8) :: tmp
if (z <= (-6.5d+109)) then
tmp = (-4.5d0) * ((z * t) / a_m)
else if (z <= 6.5d-167) then
tmp = 0.5d0 * (y * (x / a_m))
else
tmp = (-4.5d0) * (z * (t / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (z <= -6.5e+109) {
tmp = -4.5 * ((z * t) / a_m);
} else if (z <= 6.5e-167) {
tmp = 0.5 * (y * (x / a_m));
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if z <= -6.5e+109: tmp = -4.5 * ((z * t) / a_m) elif z <= 6.5e-167: tmp = 0.5 * (y * (x / a_m)) else: tmp = -4.5 * (z * (t / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (z <= -6.5e+109) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); elseif (z <= 6.5e-167) tmp = Float64(0.5 * Float64(y * Float64(x / a_m))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (z <= -6.5e+109)
tmp = -4.5 * ((z * t) / a_m);
elseif (z <= 6.5e-167)
tmp = 0.5 * (y * (x / a_m));
else
tmp = -4.5 * (z * (t / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[z, -6.5e+109], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.5e-167], N[(0.5 * N[(y * N[(x / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -6.5 \cdot 10^{+109}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{elif}\;z \leq 6.5 \cdot 10^{-167}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\end{array}
\end{array}
if z < -6.5e109Initial program 79.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.7%
Simplified79.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6463.7%
Simplified63.7%
if -6.5e109 < z < 6.49999999999999973e-167Initial program 97.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6497.6%
Simplified97.6%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6467.4%
Simplified67.4%
if 6.49999999999999973e-167 < z Initial program 89.0%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6489.0%
Simplified89.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6455.6%
Simplified55.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6457.5%
Applied egg-rr57.5%
Final simplification63.3%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (/ (+ (* x y) (* z (* t -9.0))) (* a_m 2.0))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (((x * y) + (z * (t * -9.0))) / (a_m * 2.0));
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
code = a_s * (((x * y) + (z * (t * (-9.0d0)))) / (a_m * 2.0d0))
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (((x * y) + (z * (t * -9.0))) / (a_m * 2.0));
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): return a_s * (((x * y) + (z * (t * -9.0))) / (a_m * 2.0))
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) return Float64(a_s * Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a_m * 2.0))) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
tmp = a_s * (((x * y) + (z * (t * -9.0))) / (a_m * 2.0));
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a\_m \cdot 2}
\end{array}
Initial program 92.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.7%
Simplified92.7%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* (/ 0.5 a_m) (+ (* x y) (* -9.0 (* z t))))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * ((0.5 / a_m) * ((x * y) + (-9.0 * (z * t))));
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
code = a_s * ((0.5d0 / a_m) * ((x * y) + ((-9.0d0) * (z * t))))
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * ((0.5 / a_m) * ((x * y) + (-9.0 * (z * t))));
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): return a_s * ((0.5 / a_m) * ((x * y) + (-9.0 * (z * t))))
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) return Float64(a_s * Float64(Float64(0.5 / a_m) * Float64(Float64(x * y) + Float64(-9.0 * Float64(z * t))))) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
tmp = a_s * ((0.5 / a_m) * ((x * y) + (-9.0 * (z * t))));
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(N[(0.5 / a$95$m), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \left(\frac{0.5}{a\_m} \cdot \left(x \cdot y + -9 \cdot \left(z \cdot t\right)\right)\right)
\end{array}
Initial program 92.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.7%
Simplified92.7%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
Applied egg-rr92.6%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (if (<= t 8.2e+45) (* -4.5 (/ (* z t) a_m)) (* -4.5 (* z (/ t a_m))))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (t <= 8.2e+45) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
real(8) :: tmp
if (t <= 8.2d+45) then
tmp = (-4.5d0) * ((z * t) / a_m)
else
tmp = (-4.5d0) * (z * (t / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (t <= 8.2e+45) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = -4.5 * (z * (t / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if t <= 8.2e+45: tmp = -4.5 * ((z * t) / a_m) else: tmp = -4.5 * (z * (t / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (t <= 8.2e+45) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (t <= 8.2e+45)
tmp = -4.5 * ((z * t) / a_m);
else
tmp = -4.5 * (z * (t / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[t, 8.2e+45], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq 8.2 \cdot 10^{+45}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\\
\end{array}
\end{array}
if t < 8.20000000000000025e45Initial program 94.8%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.8%
Simplified94.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.5%
Simplified42.5%
if 8.20000000000000025e45 < t Initial program 86.3%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6462.3%
Simplified62.3%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6468.6%
Applied egg-rr68.6%
Final simplification48.9%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* -4.5 (* z (/ t a_m)))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (-4.5 * (z * (t / a_m)));
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_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_m
code = a_s * ((-4.5d0) * (z * (t / a_m)))
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (-4.5 * (z * (t / a_m)));
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): return a_s * (-4.5 * (z * (t / a_m)))
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) return Float64(a_s * Float64(-4.5 * Float64(z * Float64(t / a_m)))) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
tmp = a_s * (-4.5 * (z * (t / a_m)));
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(-4.5 * N[(z * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \left(-4.5 \cdot \left(z \cdot \frac{t}{a\_m}\right)\right)
\end{array}
Initial program 92.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.7%
Simplified92.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6447.4%
Simplified47.4%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6448.1%
Applied egg-rr48.1%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2024161
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))