Math FPCore C Java Python Julia MATLAB Wolfram TeX \[x + \frac{\left(y - z\right) \cdot t}{a - z}
\]
↓
\[\begin{array}{l}
t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 2 \cdot 10^{+269}\right):\\
\;\;\;\;x + t \cdot \frac{y - z}{a - z}\\
\mathbf{else}:\\
\;\;\;\;t_1 + x\\
\end{array}
\]
(FPCore (x y z t a) :precision binary64 (+ x (/ (* (- y z) t) (- a z)))) ↓
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (/ (* (- y z) t) (- a z))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 2e+269)))
(+ x (* t (/ (- y z) (- a z))))
(+ t_1 x)))) double code(double x, double y, double z, double t, double a) {
return x + (((y - z) * t) / (a - z));
}
↓
double code(double x, double y, double z, double t, double a) {
double t_1 = ((y - z) * t) / (a - z);
double tmp;
if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 2e+269)) {
tmp = x + (t * ((y - z) / (a - z)));
} else {
tmp = t_1 + x;
}
return tmp;
}
public static double code(double x, double y, double z, double t, double a) {
return x + (((y - z) * t) / (a - z));
}
↓
public static double code(double x, double y, double z, double t, double a) {
double t_1 = ((y - z) * t) / (a - z);
double tmp;
if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 2e+269)) {
tmp = x + (t * ((y - z) / (a - z)));
} else {
tmp = t_1 + x;
}
return tmp;
}
def code(x, y, z, t, a):
return x + (((y - z) * t) / (a - z))
↓
def code(x, y, z, t, a):
t_1 = ((y - z) * t) / (a - z)
tmp = 0
if (t_1 <= -math.inf) or not (t_1 <= 2e+269):
tmp = x + (t * ((y - z) / (a - z)))
else:
tmp = t_1 + x
return tmp
function code(x, y, z, t, a)
return Float64(x + Float64(Float64(Float64(y - z) * t) / Float64(a - z)))
end
↓
function code(x, y, z, t, a)
t_1 = Float64(Float64(Float64(y - z) * t) / Float64(a - z))
tmp = 0.0
if ((t_1 <= Float64(-Inf)) || !(t_1 <= 2e+269))
tmp = Float64(x + Float64(t * Float64(Float64(y - z) / Float64(a - z))));
else
tmp = Float64(t_1 + x);
end
return tmp
end
function tmp = code(x, y, z, t, a)
tmp = x + (((y - z) * t) / (a - z));
end
↓
function tmp_2 = code(x, y, z, t, a)
t_1 = ((y - z) * t) / (a - z);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 2e+269)))
tmp = x + (t * ((y - z) / (a - z)));
else
tmp = t_1 + x;
end
tmp_2 = tmp;
end
code[x_, y_, z_, t_, a_] := N[(x + N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 2e+269]], $MachinePrecision]], N[(x + N[(t * N[(N[(y - z), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + x), $MachinePrecision]]]
x + \frac{\left(y - z\right) \cdot t}{a - z}
↓
\begin{array}{l}
t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 2 \cdot 10^{+269}\right):\\
\;\;\;\;x + t \cdot \frac{y - z}{a - z}\\
\mathbf{else}:\\
\;\;\;\;t_1 + x\\
\end{array}
Alternatives Alternative 1 Error 23.0 Cost 1240
\[\begin{array}{l}
t_1 := y \cdot \frac{t}{a - z}\\
\mathbf{if}\;z \leq -9.5 \cdot 10^{-68}:\\
\;\;\;\;t + x\\
\mathbf{elif}\;z \leq -3.8 \cdot 10^{-115}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -1.75 \cdot 10^{-161}:\\
\;\;\;\;x\\
\mathbf{elif}\;z \leq -2.35 \cdot 10^{-196}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 5.2 \cdot 10^{-213}:\\
\;\;\;\;x\\
\mathbf{elif}\;z \leq 3.9 \cdot 10^{-31}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t + x\\
\end{array}
\]
Alternative 2 Error 15.6 Cost 1108
\[\begin{array}{l}
t_1 := x - \frac{y}{\frac{z}{t}}\\
\mathbf{if}\;z \leq -8.4 \cdot 10^{-51}:\\
\;\;\;\;t + x\\
\mathbf{elif}\;z \leq -3.5 \cdot 10^{-100}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{-50}:\\
\;\;\;\;x + \frac{t}{\frac{a}{y}}\\
\mathbf{elif}\;z \leq 42000:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 3.2 \cdot 10^{+55}:\\
\;\;\;\;x - z \cdot \frac{t}{a}\\
\mathbf{else}:\\
\;\;\;\;t + x\\
\end{array}
\]
Alternative 3 Error 15.1 Cost 976
\[\begin{array}{l}
t_1 := x - \frac{y}{\frac{z}{t}}\\
\mathbf{if}\;z \leq -3.8 \cdot 10^{-49}:\\
\;\;\;\;t + x\\
\mathbf{elif}\;z \leq -2 \cdot 10^{-99}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 10^{-50}:\\
\;\;\;\;x + \frac{t}{\frac{a}{y}}\\
\mathbf{elif}\;z \leq 6200:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 900000000:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;t + x\\
\end{array}
\]
Alternative 4 Error 11.7 Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -4.2 \cdot 10^{-48} \lor \neg \left(z \leq 2.9 \cdot 10^{+16}\right):\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x + y \cdot \frac{t}{a - z}\\
\end{array}
\]
Alternative 5 Error 9.2 Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -3.8 \cdot 10^{-48} \lor \neg \left(z \leq 1.56 \cdot 10^{+16}\right):\\
\;\;\;\;x - \frac{t}{\frac{z}{y - z}}\\
\mathbf{else}:\\
\;\;\;\;x + y \cdot \frac{t}{a - z}\\
\end{array}
\]
Alternative 6 Error 20.6 Cost 720
\[\begin{array}{l}
\mathbf{if}\;z \leq -4 \cdot 10^{-96}:\\
\;\;\;\;t + x\\
\mathbf{elif}\;z \leq 6.3 \cdot 10^{-121}:\\
\;\;\;\;x\\
\mathbf{elif}\;z \leq 2.1 \cdot 10^{-101}:\\
\;\;\;\;y \cdot \frac{t}{a}\\
\mathbf{elif}\;z \leq 900000000:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;t + x\\
\end{array}
\]
Alternative 7 Error 14.7 Cost 713
\[\begin{array}{l}
\mathbf{if}\;z \leq -2.35 \cdot 10^{-91} \lor \neg \left(z \leq 6200000000000\right):\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x + \frac{t}{\frac{a}{y}}\\
\end{array}
\]
Alternative 8 Error 1.4 Cost 704
\[x + t \cdot \frac{y - z}{a - z}
\]
Alternative 9 Error 20.2 Cost 456
\[\begin{array}{l}
\mathbf{if}\;z \leq -5.7 \cdot 10^{-89}:\\
\;\;\;\;t + x\\
\mathbf{elif}\;z \leq 900000000:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;t + x\\
\end{array}
\]
Alternative 10 Error 28.6 Cost 64
\[x
\]