
(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}
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 4e+187)))
(fma -4.5 (* z (/ t a)) (* 0.5 (* x (/ y a))))
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 4e+187)) {
tmp = fma(-4.5, (z * (t / a)), (0.5 * (x * (y / a))));
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if ((t_1 <= Float64(-Inf)) || !(t_1 <= 4e+187)) tmp = fma(-4.5, Float64(z * Float64(t / a)), Float64(0.5 * Float64(x * Float64(y / a)))); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 4e+187]], $MachinePrecision]], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 4 \cdot 10^{+187}\right):\\
\;\;\;\;\mathsf{fma}\left(-4.5, z \cdot \frac{t}{a}, 0.5 \cdot \left(x \cdot \frac{y}{a}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -inf.0 or 3.99999999999999963e187 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 71.7%
*-commutative71.7%
*-commutative71.7%
associate-*l*71.7%
Simplified71.7%
Taylor expanded in x around 0 69.0%
fma-def69.0%
associate-/l*79.0%
associate-/r/76.3%
associate-*r/90.3%
Simplified90.3%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 3.99999999999999963e187Initial program 99.3%
*-commutative99.3%
*-commutative99.3%
associate-*l*99.3%
Simplified99.3%
Final simplification96.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) -2e+284)
(* (/ x a) (* y 0.5))
(if (<= (* x y) 2e+255)
(/ 0.5 (/ a (- (* x y) (* 9.0 (* z t)))))
(* 0.5 (* x (/ y a))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+284) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+255) {
tmp = 0.5 / (a / ((x * y) - (9.0 * (z * t))));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
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 ((x * y) <= (-2d+284)) then
tmp = (x / a) * (y * 0.5d0)
else if ((x * y) <= 2d+255) then
tmp = 0.5d0 / (a / ((x * y) - (9.0d0 * (z * t))))
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+284) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+255) {
tmp = 0.5 / (a / ((x * y) - (9.0 * (z * t))));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e+284: tmp = (x / a) * (y * 0.5) elif (x * y) <= 2e+255: tmp = 0.5 / (a / ((x * y) - (9.0 * (z * t)))) else: tmp = 0.5 * (x * (y / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e+284) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (Float64(x * y) <= 2e+255) tmp = Float64(0.5 / Float64(a / Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))))); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e+284)
tmp = (x / a) * (y * 0.5);
elseif ((x * y) <= 2e+255)
tmp = 0.5 / (a / ((x * y) - (9.0 * (z * t))));
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+284], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+255], N[(0.5 / N[(a / N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+284}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+255}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y - 9 \cdot \left(z \cdot t\right)}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2.00000000000000016e284Initial program 66.6%
*-commutative66.6%
*-commutative66.6%
associate-*l*66.6%
Simplified66.6%
Taylor expanded in a around 0 66.6%
associate-*r/66.6%
cancel-sign-sub-inv66.6%
metadata-eval66.6%
+-commutative66.6%
associate-/l*66.6%
+-commutative66.6%
metadata-eval66.6%
cancel-sign-sub-inv66.6%
fma-neg66.8%
*-commutative66.8%
distribute-lft-neg-in66.8%
metadata-eval66.8%
*-commutative66.8%
associate-*l*66.8%
Simplified66.8%
Taylor expanded in x around inf 71.6%
associate-*r/71.6%
*-commutative71.6%
associate-*r*71.6%
associate-*l/94.6%
Simplified94.6%
if -2.00000000000000016e284 < (*.f64 x y) < 1.99999999999999998e255Initial program 95.9%
*-commutative95.9%
*-commutative95.9%
associate-*l*95.9%
Simplified95.9%
Taylor expanded in a around 0 95.9%
associate-*r/95.9%
cancel-sign-sub-inv95.9%
metadata-eval95.9%
+-commutative95.9%
associate-/l*95.8%
+-commutative95.8%
metadata-eval95.8%
cancel-sign-sub-inv95.8%
fma-neg95.8%
*-commutative95.8%
distribute-lft-neg-in95.8%
metadata-eval95.8%
*-commutative95.8%
associate-*l*95.8%
Simplified95.8%
*-commutative95.8%
metadata-eval95.8%
distribute-lft-neg-in95.8%
distribute-rgt-neg-in95.8%
fma-neg95.8%
associate-*r*95.7%
*-commutative95.7%
associate-*l*95.8%
Applied egg-rr95.8%
if 1.99999999999999998e255 < (*.f64 x y) Initial program 66.3%
*-commutative66.3%
*-commutative66.3%
associate-*l*66.3%
Simplified66.3%
Taylor expanded in x around inf 71.3%
associate-*r/94.8%
Simplified94.8%
Final simplification95.6%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) -2e+284)
(* (/ x a) (* y 0.5))
(if (<= (* x y) 2e+255)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* 0.5 (* x (/ y a))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+284) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+255) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
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 ((x * y) <= (-2d+284)) then
tmp = (x / a) * (y * 0.5d0)
else if ((x * y) <= 2d+255) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+284) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+255) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e+284: tmp = (x / a) * (y * 0.5) elif (x * y) <= 2e+255: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = 0.5 * (x * (y / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e+284) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (Float64(x * y) <= 2e+255) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e+284)
tmp = (x / a) * (y * 0.5);
elseif ((x * y) <= 2e+255)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+284], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+255], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+284}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+255}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2.00000000000000016e284Initial program 66.6%
*-commutative66.6%
*-commutative66.6%
associate-*l*66.6%
Simplified66.6%
Taylor expanded in a around 0 66.6%
associate-*r/66.6%
cancel-sign-sub-inv66.6%
metadata-eval66.6%
+-commutative66.6%
associate-/l*66.6%
+-commutative66.6%
metadata-eval66.6%
cancel-sign-sub-inv66.6%
fma-neg66.8%
*-commutative66.8%
distribute-lft-neg-in66.8%
metadata-eval66.8%
*-commutative66.8%
associate-*l*66.8%
Simplified66.8%
Taylor expanded in x around inf 71.6%
associate-*r/71.6%
*-commutative71.6%
associate-*r*71.6%
associate-*l/94.6%
Simplified94.6%
if -2.00000000000000016e284 < (*.f64 x y) < 1.99999999999999998e255Initial program 95.9%
*-commutative95.9%
*-commutative95.9%
associate-*l*95.9%
Simplified95.9%
if 1.99999999999999998e255 < (*.f64 x y) Initial program 66.3%
*-commutative66.3%
*-commutative66.3%
associate-*l*66.3%
Simplified66.3%
Taylor expanded in x around inf 71.3%
associate-*r/94.8%
Simplified94.8%
Final simplification95.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (/ x a) (* y 0.5))) (t_2 (* -4.5 (/ t (/ a z)))))
(if (<= z -5.2e+43)
t_2
(if (<= z -5e-12)
t_1
(if (<= z -3.05e-50)
(* -4.5 (* z (/ t a)))
(if (<= z -3.8e-298)
(* 0.5 (/ x (/ a y)))
(if (<= z 4e-107) t_1 t_2)))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x / a) * (y * 0.5);
double t_2 = -4.5 * (t / (a / z));
double tmp;
if (z <= -5.2e+43) {
tmp = t_2;
} else if (z <= -5e-12) {
tmp = t_1;
} else if (z <= -3.05e-50) {
tmp = -4.5 * (z * (t / a));
} else if (z <= -3.8e-298) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (x / a) * (y * 0.5d0)
t_2 = (-4.5d0) * (t / (a / z))
if (z <= (-5.2d+43)) then
tmp = t_2
else if (z <= (-5d-12)) then
tmp = t_1
else if (z <= (-3.05d-50)) then
tmp = (-4.5d0) * (z * (t / a))
else if (z <= (-3.8d-298)) then
tmp = 0.5d0 * (x / (a / y))
else if (z <= 4d-107) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x / a) * (y * 0.5);
double t_2 = -4.5 * (t / (a / z));
double tmp;
if (z <= -5.2e+43) {
tmp = t_2;
} else if (z <= -5e-12) {
tmp = t_1;
} else if (z <= -3.05e-50) {
tmp = -4.5 * (z * (t / a));
} else if (z <= -3.8e-298) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): t_1 = (x / a) * (y * 0.5) t_2 = -4.5 * (t / (a / z)) tmp = 0 if z <= -5.2e+43: tmp = t_2 elif z <= -5e-12: tmp = t_1 elif z <= -3.05e-50: tmp = -4.5 * (z * (t / a)) elif z <= -3.8e-298: tmp = 0.5 * (x / (a / y)) elif z <= 4e-107: tmp = t_1 else: tmp = t_2 return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = Float64(Float64(x / a) * Float64(y * 0.5)) t_2 = Float64(-4.5 * Float64(t / Float64(a / z))) tmp = 0.0 if (z <= -5.2e+43) tmp = t_2; elseif (z <= -5e-12) tmp = t_1; elseif (z <= -3.05e-50) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (z <= -3.8e-298) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (z <= 4e-107) tmp = t_1; else tmp = t_2; end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x / a) * (y * 0.5);
t_2 = -4.5 * (t / (a / z));
tmp = 0.0;
if (z <= -5.2e+43)
tmp = t_2;
elseif (z <= -5e-12)
tmp = t_1;
elseif (z <= -3.05e-50)
tmp = -4.5 * (z * (t / a));
elseif (z <= -3.8e-298)
tmp = 0.5 * (x / (a / y));
elseif (z <= 4e-107)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.2e+43], t$95$2, If[LessEqual[z, -5e-12], t$95$1, If[LessEqual[z, -3.05e-50], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3.8e-298], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-107], t$95$1, t$95$2]]]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
t_2 := -4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{if}\;z \leq -5.2 \cdot 10^{+43}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -5 \cdot 10^{-12}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -3.05 \cdot 10^{-50}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;z \leq -3.8 \cdot 10^{-298}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{-107}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -5.20000000000000042e43 or 4e-107 < z Initial program 88.5%
*-commutative88.5%
*-commutative88.5%
associate-*l*88.5%
Simplified88.5%
Taylor expanded in x around 0 66.0%
associate-/l*70.1%
Simplified70.1%
if -5.20000000000000042e43 < z < -4.9999999999999997e-12 or -3.8e-298 < z < 4e-107Initial program 93.4%
*-commutative93.4%
*-commutative93.4%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in a around 0 93.3%
associate-*r/93.3%
cancel-sign-sub-inv93.3%
metadata-eval93.3%
+-commutative93.3%
associate-/l*93.2%
+-commutative93.2%
metadata-eval93.2%
cancel-sign-sub-inv93.2%
fma-neg93.2%
*-commutative93.2%
distribute-lft-neg-in93.2%
metadata-eval93.2%
*-commutative93.2%
associate-*l*93.3%
Simplified93.3%
Taylor expanded in x around inf 76.3%
associate-*r/76.3%
*-commutative76.3%
associate-*r*76.3%
associate-*l/76.3%
Simplified76.3%
if -4.9999999999999997e-12 < z < -3.0499999999999998e-50Initial program 99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.8%
Simplified99.8%
Taylor expanded in x around 0 76.0%
associate-/l*76.0%
Simplified76.0%
associate-/r/76.2%
Applied egg-rr76.2%
if -3.0499999999999998e-50 < z < -3.8e-298Initial program 94.8%
*-commutative94.8%
*-commutative94.8%
associate-*l*94.7%
Simplified94.7%
Taylor expanded in x around inf 69.8%
associate-/l*66.6%
Simplified66.6%
Final simplification70.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (/ x a) (* y 0.5))))
(if (<= z -1.3e+43)
(* -4.5 (/ t (/ a z)))
(if (<= z -2.9e-13)
t_1
(if (<= z -3.1e-46)
(* -4.5 (* z (/ t a)))
(if (<= z -6.4e-298)
(* 0.5 (/ x (/ a y)))
(if (<= z 4e-107) t_1 (/ -4.5 (/ (/ a z) t)))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x / a) * (y * 0.5);
double tmp;
if (z <= -1.3e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -2.9e-13) {
tmp = t_1;
} else if (z <= -3.1e-46) {
tmp = -4.5 * (z * (t / a));
} else if (z <= -6.4e-298) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = t_1;
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: tmp
t_1 = (x / a) * (y * 0.5d0)
if (z <= (-1.3d+43)) then
tmp = (-4.5d0) * (t / (a / z))
else if (z <= (-2.9d-13)) then
tmp = t_1
else if (z <= (-3.1d-46)) then
tmp = (-4.5d0) * (z * (t / a))
else if (z <= (-6.4d-298)) then
tmp = 0.5d0 * (x / (a / y))
else if (z <= 4d-107) then
tmp = t_1
else
tmp = (-4.5d0) / ((a / z) / t)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x / a) * (y * 0.5);
double tmp;
if (z <= -1.3e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -2.9e-13) {
tmp = t_1;
} else if (z <= -3.1e-46) {
tmp = -4.5 * (z * (t / a));
} else if (z <= -6.4e-298) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = t_1;
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): t_1 = (x / a) * (y * 0.5) tmp = 0 if z <= -1.3e+43: tmp = -4.5 * (t / (a / z)) elif z <= -2.9e-13: tmp = t_1 elif z <= -3.1e-46: tmp = -4.5 * (z * (t / a)) elif z <= -6.4e-298: tmp = 0.5 * (x / (a / y)) elif z <= 4e-107: tmp = t_1 else: tmp = -4.5 / ((a / z) / t) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = Float64(Float64(x / a) * Float64(y * 0.5)) tmp = 0.0 if (z <= -1.3e+43) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (z <= -2.9e-13) tmp = t_1; elseif (z <= -3.1e-46) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (z <= -6.4e-298) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (z <= 4e-107) tmp = t_1; else tmp = Float64(-4.5 / Float64(Float64(a / z) / t)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x / a) * (y * 0.5);
tmp = 0.0;
if (z <= -1.3e+43)
tmp = -4.5 * (t / (a / z));
elseif (z <= -2.9e-13)
tmp = t_1;
elseif (z <= -3.1e-46)
tmp = -4.5 * (z * (t / a));
elseif (z <= -6.4e-298)
tmp = 0.5 * (x / (a / y));
elseif (z <= 4e-107)
tmp = t_1;
else
tmp = -4.5 / ((a / z) / t);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.3e+43], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.9e-13], t$95$1, If[LessEqual[z, -3.1e-46], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -6.4e-298], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-107], t$95$1, N[(-4.5 / N[(N[(a / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{if}\;z \leq -1.3 \cdot 10^{+43}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;z \leq -2.9 \cdot 10^{-13}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -3.1 \cdot 10^{-46}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;z \leq -6.4 \cdot 10^{-298}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{-107}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5}{\frac{\frac{a}{z}}{t}}\\
\end{array}
\end{array}
if z < -1.3000000000000001e43Initial program 84.7%
*-commutative84.7%
*-commutative84.7%
associate-*l*84.7%
Simplified84.7%
Taylor expanded in x around 0 66.1%
associate-/l*73.9%
Simplified73.9%
if -1.3000000000000001e43 < z < -2.8999999999999998e-13 or -6.39999999999999995e-298 < z < 4e-107Initial program 93.4%
*-commutative93.4%
*-commutative93.4%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in a around 0 93.3%
associate-*r/93.3%
cancel-sign-sub-inv93.3%
metadata-eval93.3%
+-commutative93.3%
associate-/l*93.2%
+-commutative93.2%
metadata-eval93.2%
cancel-sign-sub-inv93.2%
fma-neg93.2%
*-commutative93.2%
distribute-lft-neg-in93.2%
metadata-eval93.2%
*-commutative93.2%
associate-*l*93.3%
Simplified93.3%
Taylor expanded in x around inf 76.3%
associate-*r/76.3%
*-commutative76.3%
associate-*r*76.3%
associate-*l/76.3%
Simplified76.3%
if -2.8999999999999998e-13 < z < -3.1000000000000001e-46Initial program 99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.8%
Simplified99.8%
Taylor expanded in x around 0 76.0%
associate-/l*76.0%
Simplified76.0%
associate-/r/76.2%
Applied egg-rr76.2%
if -3.1000000000000001e-46 < z < -6.39999999999999995e-298Initial program 94.8%
*-commutative94.8%
*-commutative94.8%
associate-*l*94.7%
Simplified94.7%
Taylor expanded in x around inf 69.8%
associate-/l*66.6%
Simplified66.6%
if 4e-107 < z Initial program 91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*91.2%
Simplified91.2%
Taylor expanded in x around 0 65.8%
associate-/l*67.3%
Simplified67.3%
clear-num67.2%
un-div-inv67.2%
Applied egg-rr67.2%
Final simplification70.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= z -1.45e+43)
(* -4.5 (/ t (/ a z)))
(if (<= z -1.7e-13)
(* (/ x a) (* y 0.5))
(if (<= z -1.7e-46)
(* -4.5 (* z (/ t a)))
(if (<= z 1.8e-303)
(* 0.5 (/ x (/ a y)))
(if (<= z 4e-107) (/ y (* a (/ 2.0 x))) (/ -4.5 (/ (/ a z) t))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.45e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -1.7e-13) {
tmp = (x / a) * (y * 0.5);
} else if (z <= -1.7e-46) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 1.8e-303) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = y / (a * (2.0 / x));
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-1.45d+43)) then
tmp = (-4.5d0) * (t / (a / z))
else if (z <= (-1.7d-13)) then
tmp = (x / a) * (y * 0.5d0)
else if (z <= (-1.7d-46)) then
tmp = (-4.5d0) * (z * (t / a))
else if (z <= 1.8d-303) then
tmp = 0.5d0 * (x / (a / y))
else if (z <= 4d-107) then
tmp = y / (a * (2.0d0 / x))
else
tmp = (-4.5d0) / ((a / z) / t)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.45e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -1.7e-13) {
tmp = (x / a) * (y * 0.5);
} else if (z <= -1.7e-46) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 1.8e-303) {
tmp = 0.5 * (x / (a / y));
} else if (z <= 4e-107) {
tmp = y / (a * (2.0 / x));
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -1.45e+43: tmp = -4.5 * (t / (a / z)) elif z <= -1.7e-13: tmp = (x / a) * (y * 0.5) elif z <= -1.7e-46: tmp = -4.5 * (z * (t / a)) elif z <= 1.8e-303: tmp = 0.5 * (x / (a / y)) elif z <= 4e-107: tmp = y / (a * (2.0 / x)) else: tmp = -4.5 / ((a / z) / t) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -1.45e+43) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (z <= -1.7e-13) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (z <= -1.7e-46) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (z <= 1.8e-303) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (z <= 4e-107) tmp = Float64(y / Float64(a * Float64(2.0 / x))); else tmp = Float64(-4.5 / Float64(Float64(a / z) / t)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -1.45e+43)
tmp = -4.5 * (t / (a / z));
elseif (z <= -1.7e-13)
tmp = (x / a) * (y * 0.5);
elseif (z <= -1.7e-46)
tmp = -4.5 * (z * (t / a));
elseif (z <= 1.8e-303)
tmp = 0.5 * (x / (a / y));
elseif (z <= 4e-107)
tmp = y / (a * (2.0 / x));
else
tmp = -4.5 / ((a / z) / t);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.45e+43], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.7e-13], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.7e-46], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.8e-303], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-107], N[(y / N[(a * N[(2.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 / N[(N[(a / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.45 \cdot 10^{+43}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;z \leq -1.7 \cdot 10^{-13}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;z \leq -1.7 \cdot 10^{-46}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;z \leq 1.8 \cdot 10^{-303}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{-107}:\\
\;\;\;\;\frac{y}{a \cdot \frac{2}{x}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5}{\frac{\frac{a}{z}}{t}}\\
\end{array}
\end{array}
if z < -1.4500000000000001e43Initial program 84.7%
*-commutative84.7%
*-commutative84.7%
associate-*l*84.7%
Simplified84.7%
Taylor expanded in x around 0 66.1%
associate-/l*73.9%
Simplified73.9%
if -1.4500000000000001e43 < z < -1.70000000000000008e-13Initial program 90.5%
*-commutative90.5%
*-commutative90.5%
associate-*l*90.3%
Simplified90.3%
Taylor expanded in a around 0 90.3%
associate-*r/90.3%
cancel-sign-sub-inv90.3%
metadata-eval90.3%
+-commutative90.3%
associate-/l*90.5%
+-commutative90.5%
metadata-eval90.5%
cancel-sign-sub-inv90.5%
fma-neg90.5%
*-commutative90.5%
distribute-lft-neg-in90.5%
metadata-eval90.5%
*-commutative90.5%
associate-*l*90.5%
Simplified90.5%
Taylor expanded in x around inf 61.5%
associate-*r/61.5%
*-commutative61.5%
associate-*r*61.5%
associate-*l/70.5%
Simplified70.5%
if -1.70000000000000008e-13 < z < -1.69999999999999998e-46Initial program 99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.8%
Simplified99.8%
Taylor expanded in x around 0 76.0%
associate-/l*76.0%
Simplified76.0%
associate-/r/76.2%
Applied egg-rr76.2%
if -1.69999999999999998e-46 < z < 1.7999999999999999e-303Initial program 95.2%
*-commutative95.2%
*-commutative95.2%
associate-*l*95.1%
Simplified95.1%
Taylor expanded in x around inf 71.6%
associate-/l*68.6%
Simplified68.6%
if 1.7999999999999999e-303 < z < 4e-107Initial program 93.5%
*-commutative93.5%
*-commutative93.5%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in x around inf 77.8%
associate-/l*80.4%
Simplified80.4%
*-commutative80.4%
metadata-eval80.4%
div-inv80.4%
div-inv80.3%
clear-num80.3%
associate-*l/80.3%
clear-num80.3%
frac-times75.3%
*-un-lft-identity75.3%
Applied egg-rr75.3%
if 4e-107 < z Initial program 91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*91.2%
Simplified91.2%
Taylor expanded in x around 0 65.8%
associate-/l*67.3%
Simplified67.3%
clear-num67.2%
un-div-inv67.2%
Applied egg-rr67.2%
Final simplification70.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= z -1.06e+43)
(* -4.5 (/ t (/ a z)))
(if (<= z -1.05e-12)
(* (/ x a) (* y 0.5))
(if (<= z -4e-49)
(* -4.5 (* z (/ t a)))
(if (<= z 4e-107) (/ (* x (* y 0.5)) a) (/ -4.5 (/ (/ a z) t)))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.06e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -1.05e-12) {
tmp = (x / a) * (y * 0.5);
} else if (z <= -4e-49) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 4e-107) {
tmp = (x * (y * 0.5)) / a;
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-1.06d+43)) then
tmp = (-4.5d0) * (t / (a / z))
else if (z <= (-1.05d-12)) then
tmp = (x / a) * (y * 0.5d0)
else if (z <= (-4d-49)) then
tmp = (-4.5d0) * (z * (t / a))
else if (z <= 4d-107) then
tmp = (x * (y * 0.5d0)) / a
else
tmp = (-4.5d0) / ((a / z) / t)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.06e+43) {
tmp = -4.5 * (t / (a / z));
} else if (z <= -1.05e-12) {
tmp = (x / a) * (y * 0.5);
} else if (z <= -4e-49) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 4e-107) {
tmp = (x * (y * 0.5)) / a;
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -1.06e+43: tmp = -4.5 * (t / (a / z)) elif z <= -1.05e-12: tmp = (x / a) * (y * 0.5) elif z <= -4e-49: tmp = -4.5 * (z * (t / a)) elif z <= 4e-107: tmp = (x * (y * 0.5)) / a else: tmp = -4.5 / ((a / z) / t) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -1.06e+43) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (z <= -1.05e-12) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (z <= -4e-49) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (z <= 4e-107) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); else tmp = Float64(-4.5 / Float64(Float64(a / z) / t)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -1.06e+43)
tmp = -4.5 * (t / (a / z));
elseif (z <= -1.05e-12)
tmp = (x / a) * (y * 0.5);
elseif (z <= -4e-49)
tmp = -4.5 * (z * (t / a));
elseif (z <= 4e-107)
tmp = (x * (y * 0.5)) / a;
else
tmp = -4.5 / ((a / z) / t);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.06e+43], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.05e-12], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -4e-49], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-107], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(-4.5 / N[(N[(a / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.06 \cdot 10^{+43}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;z \leq -1.05 \cdot 10^{-12}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;z \leq -4 \cdot 10^{-49}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;z \leq 4 \cdot 10^{-107}:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5}{\frac{\frac{a}{z}}{t}}\\
\end{array}
\end{array}
if z < -1.06000000000000006e43Initial program 84.7%
*-commutative84.7%
*-commutative84.7%
associate-*l*84.7%
Simplified84.7%
Taylor expanded in x around 0 66.1%
associate-/l*73.9%
Simplified73.9%
if -1.06000000000000006e43 < z < -1.04999999999999997e-12Initial program 90.5%
*-commutative90.5%
*-commutative90.5%
associate-*l*90.3%
Simplified90.3%
Taylor expanded in a around 0 90.3%
associate-*r/90.3%
cancel-sign-sub-inv90.3%
metadata-eval90.3%
+-commutative90.3%
associate-/l*90.5%
+-commutative90.5%
metadata-eval90.5%
cancel-sign-sub-inv90.5%
fma-neg90.5%
*-commutative90.5%
distribute-lft-neg-in90.5%
metadata-eval90.5%
*-commutative90.5%
associate-*l*90.5%
Simplified90.5%
Taylor expanded in x around inf 61.5%
associate-*r/61.5%
*-commutative61.5%
associate-*r*61.5%
associate-*l/70.5%
Simplified70.5%
if -1.04999999999999997e-12 < z < -3.99999999999999975e-49Initial program 99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.8%
Simplified99.8%
Taylor expanded in x around 0 76.0%
associate-/l*76.0%
Simplified76.0%
associate-/r/76.2%
Applied egg-rr76.2%
if -3.99999999999999975e-49 < z < 4e-107Initial program 94.5%
*-commutative94.5%
*-commutative94.5%
associate-*l*94.4%
Simplified94.4%
Taylor expanded in x around inf 74.0%
associate-*r/74.0%
*-commutative74.0%
associate-*r*74.0%
Simplified74.0%
if 4e-107 < z Initial program 91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*91.2%
Simplified91.2%
Taylor expanded in x around 0 65.8%
associate-/l*67.3%
Simplified67.3%
clear-num67.2%
un-div-inv67.2%
Applied egg-rr67.2%
Final simplification71.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= z -2.1e+73) (not (<= z 4e-107))) (* -4.5 (/ t (/ a z))) (* 0.5 (* x (/ y a)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((z <= -2.1e+73) || !(z <= 4e-107)) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((z <= (-2.1d+73)) .or. (.not. (z <= 4d-107))) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((z <= -2.1e+73) || !(z <= 4e-107)) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (z <= -2.1e+73) or not (z <= 4e-107): tmp = -4.5 * (t / (a / z)) else: tmp = 0.5 * (x * (y / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((z <= -2.1e+73) || !(z <= 4e-107)) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((z <= -2.1e+73) || ~((z <= 4e-107)))
tmp = -4.5 * (t / (a / z));
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2.1e+73], N[Not[LessEqual[z, 4e-107]], $MachinePrecision]], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.1 \cdot 10^{+73} \lor \neg \left(z \leq 4 \cdot 10^{-107}\right):\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if z < -2.1000000000000001e73 or 4e-107 < z Initial program 89.0%
*-commutative89.0%
*-commutative89.0%
associate-*l*89.1%
Simplified89.1%
Taylor expanded in x around 0 67.9%
associate-/l*71.6%
Simplified71.6%
if -2.1000000000000001e73 < z < 4e-107Initial program 93.5%
*-commutative93.5%
*-commutative93.5%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in x around inf 67.5%
associate-*r/68.2%
Simplified68.2%
Final simplification69.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= z -2.1e+73) (not (<= z 4e-107))) (* -4.5 (/ t (/ a z))) (* 0.5 (/ x (/ a y)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((z <= -2.1e+73) || !(z <= 4e-107)) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((z <= (-2.1d+73)) .or. (.not. (z <= 4d-107))) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = 0.5d0 * (x / (a / y))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((z <= -2.1e+73) || !(z <= 4e-107)) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (z <= -2.1e+73) or not (z <= 4e-107): tmp = -4.5 * (t / (a / z)) else: tmp = 0.5 * (x / (a / y)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((z <= -2.1e+73) || !(z <= 4e-107)) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((z <= -2.1e+73) || ~((z <= 4e-107)))
tmp = -4.5 * (t / (a / z));
else
tmp = 0.5 * (x / (a / y));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2.1e+73], N[Not[LessEqual[z, 4e-107]], $MachinePrecision]], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.1 \cdot 10^{+73} \lor \neg \left(z \leq 4 \cdot 10^{-107}\right):\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if z < -2.1000000000000001e73 or 4e-107 < z Initial program 89.0%
*-commutative89.0%
*-commutative89.0%
associate-*l*89.1%
Simplified89.1%
Taylor expanded in x around 0 67.9%
associate-/l*71.6%
Simplified71.6%
if -2.1000000000000001e73 < z < 4e-107Initial program 93.5%
*-commutative93.5%
*-commutative93.5%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in x around inf 67.5%
associate-/l*67.8%
Simplified67.8%
Final simplification69.7%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -4.4e+81) (* -4.5 (/ t (/ a z))) (* -4.5 (* z (/ t a)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.4e+81) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-4.4d+81)) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.4e+81) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -4.4e+81: tmp = -4.5 * (t / (a / z)) else: tmp = -4.5 * (z * (t / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -4.4e+81) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -4.4e+81)
tmp = -4.5 * (t / (a / z));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -4.4e+81], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.4 \cdot 10^{+81}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if z < -4.39999999999999974e81Initial program 83.8%
*-commutative83.8%
*-commutative83.8%
associate-*l*83.9%
Simplified83.9%
Taylor expanded in x around 0 68.0%
associate-/l*77.0%
Simplified77.0%
if -4.39999999999999974e81 < z Initial program 92.8%
*-commutative92.8%
*-commutative92.8%
associate-*l*92.7%
Simplified92.7%
Taylor expanded in x around 0 51.0%
associate-/l*48.2%
Simplified48.2%
associate-/r/51.5%
Applied egg-rr51.5%
Final simplification55.7%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: z and t should be sorted in increasing order before calling this function.
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 = (-4.5d0) * (z * (t / a))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 91.3%
*-commutative91.3%
*-commutative91.3%
associate-*l*91.3%
Simplified91.3%
Taylor expanded in x around 0 53.8%
associate-/l*52.9%
Simplified52.9%
associate-/r/55.3%
Applied egg-rr55.3%
Final simplification55.3%
(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 2023307
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:herbie-target
(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)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))