
(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 10 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: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) (- INFINITY)) (/ (* x 0.5) (/ a y)) (/ (fma x y (* z (* t -9.0))) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x * 0.5) / (a / y);
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x * 0.5) / Float64(a / y)); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 70.6%
div-sub64.4%
*-commutative64.4%
div-sub70.6%
cancel-sign-sub-inv70.6%
*-commutative70.6%
fma-define70.6%
distribute-rgt-neg-in70.6%
associate-*r*70.6%
distribute-lft-neg-in70.6%
*-commutative70.6%
distribute-rgt-neg-in70.6%
metadata-eval70.6%
Simplified70.6%
Taylor expanded in x around inf 70.6%
associate-/l*99.9%
Simplified99.9%
associate-*r*99.9%
clear-num99.9%
un-div-inv100.0%
Applied egg-rr100.0%
if -inf.0 < (*.f64 x y) Initial program 95.9%
div-sub93.8%
*-commutative93.8%
div-sub95.9%
cancel-sign-sub-inv95.9%
*-commutative95.9%
fma-define96.3%
distribute-rgt-neg-in96.3%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
distribute-rgt-neg-in96.3%
metadata-eval96.3%
Simplified96.3%
Final simplification96.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) -1e+106) (* y (* x (/ 0.5 a))) (if (<= (* x y) 2e-22) (/ (* z (* t -4.5)) a) (/ (* x 0.5) (/ a y)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+106) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 2e-22) {
tmp = (z * (t * -4.5)) / a;
} else {
tmp = (x * 0.5) / (a / y);
}
return tmp;
}
NOTE: x, y, z, t, and a 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) <= (-1d+106)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= 2d-22) then
tmp = (z * (t * (-4.5d0))) / a
else
tmp = (x * 0.5d0) / (a / y)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+106) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 2e-22) {
tmp = (z * (t * -4.5)) / a;
} else {
tmp = (x * 0.5) / (a / y);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -1e+106: tmp = y * (x * (0.5 / a)) elif (x * y) <= 2e-22: tmp = (z * (t * -4.5)) / a else: tmp = (x * 0.5) / (a / y) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -1e+106) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= 2e-22) tmp = Float64(Float64(z * Float64(t * -4.5)) / a); else tmp = Float64(Float64(x * 0.5) / Float64(a / y)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -1e+106)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= 2e-22)
tmp = (z * (t * -4.5)) / a;
else
tmp = (x * 0.5) / (a / y);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+106], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e-22], N[(N[(z * N[(t * -4.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+106}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-22}:\\
\;\;\;\;\frac{z \cdot \left(t \cdot -4.5\right)}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.00000000000000009e106Initial program 85.7%
div-sub81.5%
*-commutative81.5%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define85.7%
distribute-rgt-neg-in85.7%
associate-*r*85.8%
distribute-lft-neg-in85.8%
*-commutative85.8%
distribute-rgt-neg-in85.8%
metadata-eval85.8%
Simplified85.8%
Taylor expanded in x around inf 74.0%
div-inv73.9%
*-commutative73.9%
associate-*l*85.1%
*-commutative85.1%
associate-/r*85.1%
metadata-eval85.1%
Applied egg-rr85.1%
if -1.00000000000000009e106 < (*.f64 x y) < 2.0000000000000001e-22Initial program 97.2%
div-sub97.2%
*-commutative97.2%
div-sub97.2%
cancel-sign-sub-inv97.2%
*-commutative97.2%
fma-define97.2%
distribute-rgt-neg-in97.2%
associate-*r*97.1%
distribute-lft-neg-in97.1%
*-commutative97.1%
distribute-rgt-neg-in97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in x around 0 74.8%
associate-/l*72.2%
Simplified72.2%
associate-*r*72.2%
*-commutative72.2%
associate-*r/74.8%
Applied egg-rr74.8%
if 2.0000000000000001e-22 < (*.f64 x y) Initial program 94.4%
div-sub88.6%
*-commutative88.6%
div-sub94.4%
cancel-sign-sub-inv94.4%
*-commutative94.4%
fma-define95.8%
distribute-rgt-neg-in95.8%
associate-*r*95.7%
distribute-lft-neg-in95.7%
*-commutative95.7%
distribute-rgt-neg-in95.7%
metadata-eval95.7%
Simplified95.7%
Taylor expanded in x around inf 72.3%
associate-/l*76.6%
Simplified76.6%
associate-*r*76.6%
clear-num76.3%
un-div-inv76.4%
Applied egg-rr76.4%
Final simplification77.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) -1e+106) (* y (* x (/ 0.5 a))) (if (<= (* x y) 2e-22) (* -4.5 (/ (* z t) a)) (/ (* x 0.5) (/ a y)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+106) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 2e-22) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = (x * 0.5) / (a / y);
}
return tmp;
}
NOTE: x, y, z, t, and a 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) <= (-1d+106)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= 2d-22) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (x * 0.5d0) / (a / y)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+106) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 2e-22) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = (x * 0.5) / (a / y);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -1e+106: tmp = y * (x * (0.5 / a)) elif (x * y) <= 2e-22: tmp = -4.5 * ((z * t) / a) else: tmp = (x * 0.5) / (a / y) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -1e+106) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= 2e-22) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(Float64(x * 0.5) / Float64(a / y)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -1e+106)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= 2e-22)
tmp = -4.5 * ((z * t) / a);
else
tmp = (x * 0.5) / (a / y);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+106], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e-22], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+106}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-22}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.00000000000000009e106Initial program 85.7%
div-sub81.5%
*-commutative81.5%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define85.7%
distribute-rgt-neg-in85.7%
associate-*r*85.8%
distribute-lft-neg-in85.8%
*-commutative85.8%
distribute-rgt-neg-in85.8%
metadata-eval85.8%
Simplified85.8%
Taylor expanded in x around inf 74.0%
div-inv73.9%
*-commutative73.9%
associate-*l*85.1%
*-commutative85.1%
associate-/r*85.1%
metadata-eval85.1%
Applied egg-rr85.1%
if -1.00000000000000009e106 < (*.f64 x y) < 2.0000000000000001e-22Initial program 97.2%
div-sub97.2%
*-commutative97.2%
div-sub97.2%
cancel-sign-sub-inv97.2%
*-commutative97.2%
fma-define97.2%
distribute-rgt-neg-in97.2%
associate-*r*97.1%
distribute-lft-neg-in97.1%
*-commutative97.1%
distribute-rgt-neg-in97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in x around 0 74.8%
if 2.0000000000000001e-22 < (*.f64 x y) Initial program 94.4%
div-sub88.6%
*-commutative88.6%
div-sub94.4%
cancel-sign-sub-inv94.4%
*-commutative94.4%
fma-define95.8%
distribute-rgt-neg-in95.8%
associate-*r*95.7%
distribute-lft-neg-in95.7%
*-commutative95.7%
distribute-rgt-neg-in95.7%
metadata-eval95.7%
Simplified95.7%
Taylor expanded in x around inf 72.3%
associate-/l*76.6%
Simplified76.6%
associate-*r*76.6%
clear-num76.3%
un-div-inv76.4%
Applied egg-rr76.4%
Final simplification77.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) (- INFINITY)) (/ (* x 0.5) (/ a y)) (/ (- (* x y) (* z (* t 9.0))) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x * 0.5) / (a / y);
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = (x * 0.5) / (a / y);
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = (x * 0.5) / (a / y) else: tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x * 0.5) / Float64(a / y)); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = (x * 0.5) / (a / y);
else
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 70.6%
div-sub64.4%
*-commutative64.4%
div-sub70.6%
cancel-sign-sub-inv70.6%
*-commutative70.6%
fma-define70.6%
distribute-rgt-neg-in70.6%
associate-*r*70.6%
distribute-lft-neg-in70.6%
*-commutative70.6%
distribute-rgt-neg-in70.6%
metadata-eval70.6%
Simplified70.6%
Taylor expanded in x around inf 70.6%
associate-/l*99.9%
Simplified99.9%
associate-*r*99.9%
clear-num99.9%
un-div-inv100.0%
Applied egg-rr100.0%
if -inf.0 < (*.f64 x y) Initial program 95.9%
div-sub93.8%
*-commutative93.8%
div-sub95.9%
cancel-sign-sub-inv95.9%
*-commutative95.9%
fma-define96.3%
distribute-rgt-neg-in96.3%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
distribute-rgt-neg-in96.3%
metadata-eval96.3%
Simplified96.3%
*-commutative96.3%
associate-*r*96.3%
metadata-eval96.3%
distribute-rgt-neg-in96.3%
distribute-lft-neg-in96.3%
fmm-def95.9%
associate-*l*95.8%
Applied egg-rr95.8%
Final simplification96.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -2.7e-150) (/ -4.5 (/ a (* z t))) (if (<= t 9e-24) (* 0.5 (* x (/ y a))) (* t (/ -4.5 (/ a z))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 / (a / (z * t));
} else if (t <= 9e-24) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 / (a / z));
}
return tmp;
}
NOTE: x, y, z, t, and a 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 (t <= (-2.7d-150)) then
tmp = (-4.5d0) / (a / (z * t))
else if (t <= 9d-24) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = t * ((-4.5d0) / (a / z))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 / (a / (z * t));
} else if (t <= 9e-24) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 / (a / z));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -2.7e-150: tmp = -4.5 / (a / (z * t)) elif t <= 9e-24: tmp = 0.5 * (x * (y / a)) else: tmp = t * (-4.5 / (a / z)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.7e-150) tmp = Float64(-4.5 / Float64(a / Float64(z * t))); elseif (t <= 9e-24) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(t * Float64(-4.5 / Float64(a / z))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.7e-150)
tmp = -4.5 / (a / (z * t));
elseif (t <= 9e-24)
tmp = 0.5 * (x * (y / a));
else
tmp = t * (-4.5 / (a / z));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.7e-150], N[(-4.5 / N[(a / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 9e-24], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.7 \cdot 10^{-150}:\\
\;\;\;\;\frac{-4.5}{\frac{a}{z \cdot t}}\\
\mathbf{elif}\;t \leq 9 \cdot 10^{-24}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{-4.5}{\frac{a}{z}}\\
\end{array}
\end{array}
if t < -2.7000000000000001e-150Initial program 97.8%
div-sub93.7%
*-commutative93.7%
div-sub97.8%
cancel-sign-sub-inv97.8%
*-commutative97.8%
fma-define97.8%
distribute-rgt-neg-in97.8%
associate-*r*97.7%
distribute-lft-neg-in97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
Simplified97.7%
Taylor expanded in x around 0 61.0%
associate-/l*59.5%
Simplified59.5%
associate-*r/61.0%
clear-num61.0%
un-div-inv61.0%
*-commutative61.0%
Applied egg-rr61.0%
if -2.7000000000000001e-150 < t < 8.9999999999999995e-24Initial program 93.8%
div-sub92.7%
*-commutative92.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in x around inf 73.5%
associate-/l*75.7%
Simplified75.7%
if 8.9999999999999995e-24 < t Initial program 89.8%
div-sub88.3%
*-commutative88.3%
div-sub89.8%
cancel-sign-sub-inv89.8%
*-commutative89.8%
fma-define91.4%
distribute-rgt-neg-in91.4%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 73.4%
*-commutative73.4%
times-frac73.3%
metadata-eval73.3%
associate-*r/75.8%
*-commutative75.8%
associate-*r*75.8%
clear-num75.8%
un-div-inv75.9%
Applied egg-rr75.9%
Final simplification70.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -2.7e-150) (* -4.5 (/ (* z t) a)) (if (<= t 3.9e-25) (* 0.5 (* x (/ y a))) (* t (/ -4.5 (/ a z))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 3.9e-25) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 / (a / z));
}
return tmp;
}
NOTE: x, y, z, t, and a 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 (t <= (-2.7d-150)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 3.9d-25) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = t * ((-4.5d0) / (a / z))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 3.9e-25) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 / (a / z));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -2.7e-150: tmp = -4.5 * ((z * t) / a) elif t <= 3.9e-25: tmp = 0.5 * (x * (y / a)) else: tmp = t * (-4.5 / (a / z)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.7e-150) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 3.9e-25) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(t * Float64(-4.5 / Float64(a / z))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.7e-150)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 3.9e-25)
tmp = 0.5 * (x * (y / a));
else
tmp = t * (-4.5 / (a / z));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.7e-150], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.9e-25], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.7 \cdot 10^{-150}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 3.9 \cdot 10^{-25}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{-4.5}{\frac{a}{z}}\\
\end{array}
\end{array}
if t < -2.7000000000000001e-150Initial program 97.8%
div-sub93.7%
*-commutative93.7%
div-sub97.8%
cancel-sign-sub-inv97.8%
*-commutative97.8%
fma-define97.8%
distribute-rgt-neg-in97.8%
associate-*r*97.7%
distribute-lft-neg-in97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
Simplified97.7%
Taylor expanded in x around 0 61.0%
if -2.7000000000000001e-150 < t < 3.9e-25Initial program 93.8%
div-sub92.7%
*-commutative92.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in x around inf 73.5%
associate-/l*75.7%
Simplified75.7%
if 3.9e-25 < t Initial program 89.8%
div-sub88.3%
*-commutative88.3%
div-sub89.8%
cancel-sign-sub-inv89.8%
*-commutative89.8%
fma-define91.4%
distribute-rgt-neg-in91.4%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 73.4%
*-commutative73.4%
times-frac73.3%
metadata-eval73.3%
associate-*r/75.8%
*-commutative75.8%
associate-*r*75.8%
clear-num75.8%
un-div-inv75.9%
Applied egg-rr75.9%
Final simplification70.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -2.7e-150) (* -4.5 (/ (* z t) a)) (if (<= t 5.3e-27) (* 0.5 (* x (/ y a))) (* t (* z (/ -4.5 a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 5.3e-27) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (z * (-4.5 / a));
}
return tmp;
}
NOTE: x, y, z, t, and a 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 (t <= (-2.7d-150)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 5.3d-27) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = t * (z * ((-4.5d0) / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 5.3e-27) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (z * (-4.5 / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -2.7e-150: tmp = -4.5 * ((z * t) / a) elif t <= 5.3e-27: tmp = 0.5 * (x * (y / a)) else: tmp = t * (z * (-4.5 / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.7e-150) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 5.3e-27) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(t * Float64(z * Float64(-4.5 / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.7e-150)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 5.3e-27)
tmp = 0.5 * (x * (y / a));
else
tmp = t * (z * (-4.5 / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.7e-150], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5.3e-27], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.7 \cdot 10^{-150}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 5.3 \cdot 10^{-27}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\end{array}
\end{array}
if t < -2.7000000000000001e-150Initial program 97.8%
div-sub93.7%
*-commutative93.7%
div-sub97.8%
cancel-sign-sub-inv97.8%
*-commutative97.8%
fma-define97.8%
distribute-rgt-neg-in97.8%
associate-*r*97.7%
distribute-lft-neg-in97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
Simplified97.7%
Taylor expanded in x around 0 61.0%
if -2.7000000000000001e-150 < t < 5.30000000000000006e-27Initial program 93.8%
div-sub92.7%
*-commutative92.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in x around inf 73.5%
associate-/l*75.7%
Simplified75.7%
if 5.30000000000000006e-27 < t Initial program 89.8%
div-sub88.3%
*-commutative88.3%
div-sub89.8%
cancel-sign-sub-inv89.8%
*-commutative89.8%
fma-define91.4%
distribute-rgt-neg-in91.4%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 73.3%
associate-/l*75.8%
Simplified75.8%
associate-*r/73.3%
clear-num73.2%
un-div-inv73.3%
*-commutative73.3%
Applied egg-rr73.3%
associate-/r/73.3%
metadata-eval73.3%
associate-*l/73.3%
associate-*r*75.8%
associate-*l/75.9%
metadata-eval75.9%
Applied egg-rr75.9%
Final simplification70.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -2.7e-150) (* -4.5 (/ (* z t) a)) (if (<= t 3e-25) (* 0.5 (* x (/ y a))) (* t (* -4.5 (/ z a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 3e-25) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a 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 (t <= (-2.7d-150)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 3d-25) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = t * ((-4.5d0) * (z / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 3e-25) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (-4.5 * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -2.7e-150: tmp = -4.5 * ((z * t) / a) elif t <= 3e-25: tmp = 0.5 * (x * (y / a)) else: tmp = t * (-4.5 * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.7e-150) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 3e-25) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(t * Float64(-4.5 * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.7e-150)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 3e-25)
tmp = 0.5 * (x * (y / a));
else
tmp = t * (-4.5 * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.7e-150], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3e-25], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.7 \cdot 10^{-150}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 3 \cdot 10^{-25}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < -2.7000000000000001e-150Initial program 97.8%
div-sub93.7%
*-commutative93.7%
div-sub97.8%
cancel-sign-sub-inv97.8%
*-commutative97.8%
fma-define97.8%
distribute-rgt-neg-in97.8%
associate-*r*97.7%
distribute-lft-neg-in97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
Simplified97.7%
Taylor expanded in x around 0 61.0%
if -2.7000000000000001e-150 < t < 2.9999999999999998e-25Initial program 93.8%
div-sub92.7%
*-commutative92.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in x around inf 73.5%
associate-/l*75.7%
Simplified75.7%
if 2.9999999999999998e-25 < t Initial program 89.8%
div-sub88.3%
*-commutative88.3%
div-sub89.8%
cancel-sign-sub-inv89.8%
*-commutative89.8%
fma-define91.4%
distribute-rgt-neg-in91.4%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 73.3%
*-commutative73.3%
associate-/l*75.8%
associate-*r*75.8%
*-commutative75.8%
Simplified75.8%
Final simplification70.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -2.7e-150) (* -4.5 (/ (* z t) a)) (if (<= t 8.5e-28) (* 0.5 (* x (/ y a))) (* -4.5 (* t (/ z a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 8.5e-28) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a 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 (t <= (-2.7d-150)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 8.5d-28) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * (t * (z / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 8.5e-28) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -2.7e-150: tmp = -4.5 * ((z * t) / a) elif t <= 8.5e-28: tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * (t * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.7e-150) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 8.5e-28) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.7e-150)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 8.5e-28)
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * (t * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.7e-150], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 8.5e-28], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.7 \cdot 10^{-150}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 8.5 \cdot 10^{-28}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < -2.7000000000000001e-150Initial program 97.8%
div-sub93.7%
*-commutative93.7%
div-sub97.8%
cancel-sign-sub-inv97.8%
*-commutative97.8%
fma-define97.8%
distribute-rgt-neg-in97.8%
associate-*r*97.7%
distribute-lft-neg-in97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
Simplified97.7%
Taylor expanded in x around 0 61.0%
if -2.7000000000000001e-150 < t < 8.49999999999999925e-28Initial program 93.8%
div-sub92.7%
*-commutative92.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in x around inf 73.5%
associate-/l*75.7%
Simplified75.7%
if 8.49999999999999925e-28 < t Initial program 89.8%
div-sub88.3%
*-commutative88.3%
div-sub89.8%
cancel-sign-sub-inv89.8%
*-commutative89.8%
fma-define91.4%
distribute-rgt-neg-in91.4%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 73.3%
associate-/l*75.8%
Simplified75.8%
Final simplification70.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* t (/ z a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x, y, z, t, and a 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) * (t * (z / a))
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 94.3%
div-sub92.0%
*-commutative92.0%
div-sub94.3%
cancel-sign-sub-inv94.3%
*-commutative94.3%
fma-define94.7%
distribute-rgt-neg-in94.7%
associate-*r*94.7%
distribute-lft-neg-in94.7%
*-commutative94.7%
distribute-rgt-neg-in94.7%
metadata-eval94.7%
Simplified94.7%
Taylor expanded in x around 0 52.8%
associate-/l*53.2%
Simplified53.2%
(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 2024160
(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)))