
(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 8 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 (cbrt (/ (* -4.5 t) (/ a z)))))
(if (or (<= (* a 2.0) -1e+125) (not (<= (* a 2.0) 1e+111)))
(fma (pow t_1 2.0) t_1 (* 0.5 (/ y (/ a x))))
(/ (fma z (* t -9.0) (* y x)) (* a 2.0)))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = cbrt(((-4.5 * t) / (a / z)));
double tmp;
if (((a * 2.0) <= -1e+125) || !((a * 2.0) <= 1e+111)) {
tmp = fma(pow(t_1, 2.0), t_1, (0.5 * (y / (a / x))));
} else {
tmp = fma(z, (t * -9.0), (y * x)) / (a * 2.0);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = cbrt(Float64(Float64(-4.5 * t) / Float64(a / z))) tmp = 0.0 if ((Float64(a * 2.0) <= -1e+125) || !(Float64(a * 2.0) <= 1e+111)) tmp = fma((t_1 ^ 2.0), t_1, Float64(0.5 * Float64(y / Float64(a / x)))); else tmp = Float64(fma(z, Float64(t * -9.0), Float64(y * x)) / 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[Power[N[(N[(-4.5 * t), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]}, If[Or[LessEqual[N[(a * 2.0), $MachinePrecision], -1e+125], N[Not[LessEqual[N[(a * 2.0), $MachinePrecision], 1e+111]], $MachinePrecision]], N[(N[Power[t$95$1, 2.0], $MachinePrecision] * t$95$1 + N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt[3]{\frac{-4.5 \cdot t}{\frac{a}{z}}}\\
\mathbf{if}\;a \cdot 2 \leq -1 \cdot 10^{+125} \lor \neg \left(a \cdot 2 \leq 10^{+111}\right):\\
\;\;\;\;\mathsf{fma}\left({t_1}^{2}, t_1, 0.5 \cdot \frac{y}{\frac{a}{x}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, y \cdot x\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 a 2) < -9.9999999999999992e124 or 9.99999999999999957e110 < (*.f64 a 2) Initial program 77.0%
sub-neg77.0%
+-commutative77.0%
neg-sub077.0%
associate-+l-77.0%
sub0-neg77.0%
neg-mul-177.0%
associate-/l*76.0%
associate-/r/76.9%
*-commutative76.9%
sub-neg76.9%
+-commutative76.9%
neg-sub076.9%
associate-+l-76.9%
sub0-neg76.9%
distribute-lft-neg-out76.9%
distribute-rgt-neg-in76.9%
Simplified76.9%
Taylor expanded in x around 0 76.9%
add-cube-cbrt76.5%
fma-def76.5%
pow276.5%
associate-/l*73.3%
associate-*r/73.3%
associate-/l*84.5%
associate-*r/84.4%
associate-/l*94.4%
Applied egg-rr94.4%
if -9.9999999999999992e124 < (*.f64 a 2) < 9.99999999999999957e110Initial program 97.3%
sub-neg97.3%
+-commutative97.3%
associate-*l*97.3%
distribute-rgt-neg-in97.3%
fma-def97.8%
*-commutative97.8%
distribute-rgt-neg-in97.8%
metadata-eval97.8%
Simplified97.8%
Final simplification96.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* t (* z 9.0)) 1e+225) (* (fma x y (* z (* t -9.0))) (/ 0.5 a)) (* (* -4.5 t) (/ z a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t * (z * 9.0)) <= 1e+225) {
tmp = fma(x, y, (z * (t * -9.0))) * (0.5 / a);
} else {
tmp = (-4.5 * t) * (z / a);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(t * Float64(z * 9.0)) <= 1e+225) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) * Float64(0.5 / a)); else tmp = Float64(Float64(-4.5 * t) * Float64(z / a)); end return 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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision], 1e+225], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq 10^{+225}:\\
\;\;\;\;\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < 9.99999999999999928e224Initial program 94.0%
sub-neg94.0%
+-commutative94.0%
neg-sub094.0%
associate-+l-94.0%
sub0-neg94.0%
neg-mul-194.0%
associate-/l*93.6%
associate-/r/93.9%
*-commutative93.9%
sub-neg93.9%
+-commutative93.9%
neg-sub093.9%
associate-+l-93.9%
sub0-neg93.9%
distribute-lft-neg-out93.9%
distribute-rgt-neg-in93.9%
Simplified94.3%
if 9.99999999999999928e224 < (*.f64 (*.f64 z 9) t) Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
neg-mul-171.1%
associate-/l*71.1%
associate-/r/71.1%
*-commutative71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
distribute-lft-neg-out71.1%
distribute-rgt-neg-in71.1%
Simplified71.3%
associate-*r/71.3%
clear-num71.3%
*-commutative71.3%
Applied egg-rr71.3%
Taylor expanded in x around 0 71.3%
associate-/l*99.8%
Simplified99.8%
associate-*r/99.9%
Applied egg-rr99.9%
div-inv99.9%
*-commutative99.9%
clear-num99.9%
Applied egg-rr99.9%
Final simplification94.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* t (* z 9.0)) 1e+225) (/ (fma z (* t -9.0) (* y x)) (* a 2.0)) (* (* -4.5 t) (/ z a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t * (z * 9.0)) <= 1e+225) {
tmp = fma(z, (t * -9.0), (y * x)) / (a * 2.0);
} else {
tmp = (-4.5 * t) * (z / a);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(t * Float64(z * 9.0)) <= 1e+225) tmp = Float64(fma(z, Float64(t * -9.0), Float64(y * x)) / Float64(a * 2.0)); else tmp = Float64(Float64(-4.5 * t) * Float64(z / a)); end return 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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision], 1e+225], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq 10^{+225}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, y \cdot x\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < 9.99999999999999928e224Initial program 94.0%
sub-neg94.0%
+-commutative94.0%
associate-*l*94.0%
distribute-rgt-neg-in94.0%
fma-def94.5%
*-commutative94.5%
distribute-rgt-neg-in94.5%
metadata-eval94.5%
Simplified94.5%
if 9.99999999999999928e224 < (*.f64 (*.f64 z 9) t) Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
neg-mul-171.1%
associate-/l*71.1%
associate-/r/71.1%
*-commutative71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
distribute-lft-neg-out71.1%
distribute-rgt-neg-in71.1%
Simplified71.3%
associate-*r/71.3%
clear-num71.3%
*-commutative71.3%
Applied egg-rr71.3%
Taylor expanded in x around 0 71.3%
associate-/l*99.8%
Simplified99.8%
associate-*r/99.9%
Applied egg-rr99.9%
div-inv99.9%
*-commutative99.9%
clear-num99.9%
Applied egg-rr99.9%
Final simplification95.0%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* t (* z 9.0)) 1e+225) (/ (- (* y x) (* z (* t 9.0))) (* a 2.0)) (* (* -4.5 t) (/ z a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t * (z * 9.0)) <= 1e+225) {
tmp = ((y * x) - (z * (t * 9.0))) / (a * 2.0);
} else {
tmp = (-4.5 * t) * (z / 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 ((t * (z * 9.0d0)) <= 1d+225) then
tmp = ((y * x) - (z * (t * 9.0d0))) / (a * 2.0d0)
else
tmp = ((-4.5d0) * t) * (z / 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 ((t * (z * 9.0)) <= 1e+225) {
tmp = ((y * x) - (z * (t * 9.0))) / (a * 2.0);
} else {
tmp = (-4.5 * t) * (z / a);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (t * (z * 9.0)) <= 1e+225: tmp = ((y * x) - (z * (t * 9.0))) / (a * 2.0) else: tmp = (-4.5 * t) * (z / a) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(t * Float64(z * 9.0)) <= 1e+225) tmp = Float64(Float64(Float64(y * x) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(-4.5 * t) * Float64(z / a)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((t * (z * 9.0)) <= 1e+225)
tmp = ((y * x) - (z * (t * 9.0))) / (a * 2.0);
else
tmp = (-4.5 * t) * (z / 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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision], 1e+225], N[(N[(N[(y * x), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(-4.5 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq 10^{+225}:\\
\;\;\;\;\frac{y \cdot x - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\left(-4.5 \cdot t\right) \cdot \frac{z}{a}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < 9.99999999999999928e224Initial program 94.0%
associate-*l*94.0%
Simplified94.0%
if 9.99999999999999928e224 < (*.f64 (*.f64 z 9) t) Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
neg-mul-171.1%
associate-/l*71.1%
associate-/r/71.1%
*-commutative71.1%
sub-neg71.1%
+-commutative71.1%
neg-sub071.1%
associate-+l-71.1%
sub0-neg71.1%
distribute-lft-neg-out71.1%
distribute-rgt-neg-in71.1%
Simplified71.3%
associate-*r/71.3%
clear-num71.3%
*-commutative71.3%
Applied egg-rr71.3%
Taylor expanded in x around 0 71.3%
associate-/l*99.8%
Simplified99.8%
associate-*r/99.9%
Applied egg-rr99.9%
div-inv99.9%
*-commutative99.9%
clear-num99.9%
Applied egg-rr99.9%
Final simplification94.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* y x) -2e+294) (/ y (/ (/ a x) 0.5)) (* (/ 0.5 a) (+ (* y x) (* -9.0 (* t z))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y * x) <= -2e+294) {
tmp = y / ((a / x) / 0.5);
} else {
tmp = (0.5 / a) * ((y * x) + (-9.0 * (t * z)));
}
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 ((y * x) <= (-2d+294)) then
tmp = y / ((a / x) / 0.5d0)
else
tmp = (0.5d0 / a) * ((y * x) + ((-9.0d0) * (t * z)))
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 ((y * x) <= -2e+294) {
tmp = y / ((a / x) / 0.5);
} else {
tmp = (0.5 / a) * ((y * x) + (-9.0 * (t * z)));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (y * x) <= -2e+294: tmp = y / ((a / x) / 0.5) else: tmp = (0.5 / a) * ((y * x) + (-9.0 * (t * z))) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(y * x) <= -2e+294) tmp = Float64(y / Float64(Float64(a / x) / 0.5)); else tmp = Float64(Float64(0.5 / a) * Float64(Float64(y * x) + Float64(-9.0 * Float64(t * z)))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((y * x) <= -2e+294)
tmp = y / ((a / x) / 0.5);
else
tmp = (0.5 / a) * ((y * x) + (-9.0 * (t * z)));
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[(y * x), $MachinePrecision], -2e+294], N[(y / N[(N[(a / x), $MachinePrecision] / 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(y * x), $MachinePrecision] + N[(-9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot x \leq -2 \cdot 10^{+294}:\\
\;\;\;\;\frac{y}{\frac{\frac{a}{x}}{0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(y \cdot x + -9 \cdot \left(t \cdot z\right)\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2.00000000000000013e294Initial program 67.3%
sub-neg67.3%
+-commutative67.3%
neg-sub067.3%
associate-+l-67.3%
sub0-neg67.3%
neg-mul-167.3%
associate-/l*67.3%
associate-/r/67.2%
*-commutative67.2%
sub-neg67.2%
+-commutative67.2%
neg-sub067.2%
associate-+l-67.2%
sub0-neg67.2%
distribute-lft-neg-out67.2%
distribute-rgt-neg-in67.2%
Simplified72.8%
Taylor expanded in x around inf 73.8%
associate-*r/73.8%
*-commutative73.8%
associate-*l/73.7%
*-commutative73.7%
*-commutative73.7%
Simplified73.7%
associate-*r/73.8%
*-commutative73.8%
Applied egg-rr73.8%
Taylor expanded in x around 0 73.8%
associate-/l*94.4%
*-commutative94.4%
associate-*l/94.4%
associate-/l*94.4%
Simplified94.4%
if -2.00000000000000013e294 < (*.f64 x y) Initial program 93.8%
sub-neg93.8%
+-commutative93.8%
neg-sub093.8%
associate-+l-93.8%
sub0-neg93.8%
neg-mul-193.8%
associate-/l*93.5%
associate-/r/93.7%
*-commutative93.7%
sub-neg93.7%
+-commutative93.7%
neg-sub093.7%
associate-+l-93.7%
sub0-neg93.7%
distribute-lft-neg-out93.7%
distribute-rgt-neg-in93.7%
Simplified93.7%
Taylor expanded in x around 0 93.7%
Final simplification93.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -9e+112) (* -4.5 (* z (/ t a))) (if (<= z 3.4e-150) (* 0.5 (/ (* y x) a)) (* -4.5 (/ t (/ a z))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -9e+112) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 3.4e-150) {
tmp = 0.5 * ((y * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
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 <= (-9d+112)) then
tmp = (-4.5d0) * (z * (t / a))
else if (z <= 3.4d-150) then
tmp = 0.5d0 * ((y * x) / a)
else
tmp = (-4.5d0) * (t / (a / z))
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 <= -9e+112) {
tmp = -4.5 * (z * (t / a));
} else if (z <= 3.4e-150) {
tmp = 0.5 * ((y * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -9e+112: tmp = -4.5 * (z * (t / a)) elif z <= 3.4e-150: tmp = 0.5 * ((y * x) / a) else: tmp = -4.5 * (t / (a / z)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -9e+112) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (z <= 3.4e-150) tmp = Float64(0.5 * Float64(Float64(y * x) / a)); else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -9e+112)
tmp = -4.5 * (z * (t / a));
elseif (z <= 3.4e-150)
tmp = 0.5 * ((y * x) / a);
else
tmp = -4.5 * (t / (a / z));
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, -9e+112], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.4e-150], N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -9 \cdot 10^{+112}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{-150}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if z < -8.9999999999999998e112Initial program 85.9%
sub-neg85.9%
+-commutative85.9%
neg-sub085.9%
associate-+l-85.9%
sub0-neg85.9%
neg-mul-185.9%
associate-/l*85.8%
associate-/r/85.8%
*-commutative85.8%
sub-neg85.8%
+-commutative85.8%
neg-sub085.8%
associate-+l-85.8%
sub0-neg85.8%
distribute-lft-neg-out85.8%
distribute-rgt-neg-in85.8%
Simplified85.7%
Taylor expanded in x around 0 76.2%
associate-/l*85.4%
associate-/r/83.3%
Simplified83.3%
if -8.9999999999999998e112 < z < 3.39999999999999999e-150Initial program 95.1%
sub-neg95.1%
+-commutative95.1%
neg-sub095.1%
associate-+l-95.1%
sub0-neg95.1%
neg-mul-195.1%
associate-/l*94.5%
associate-/r/95.0%
*-commutative95.0%
sub-neg95.0%
+-commutative95.0%
neg-sub095.0%
associate-+l-95.0%
sub0-neg95.0%
distribute-lft-neg-out95.0%
distribute-rgt-neg-in95.0%
Simplified95.0%
Taylor expanded in x around inf 70.7%
if 3.39999999999999999e-150 < z Initial program 90.3%
sub-neg90.3%
+-commutative90.3%
neg-sub090.3%
associate-+l-90.3%
sub0-neg90.3%
neg-mul-190.3%
associate-/l*90.2%
associate-/r/90.3%
*-commutative90.3%
sub-neg90.3%
+-commutative90.3%
neg-sub090.3%
associate-+l-90.3%
sub0-neg90.3%
distribute-lft-neg-out90.3%
distribute-rgt-neg-in90.3%
Simplified91.4%
associate-*r/91.5%
clear-num91.4%
*-commutative91.4%
Applied egg-rr91.4%
Taylor expanded in x around 0 54.5%
associate-/l*56.1%
Simplified56.1%
Final simplification67.6%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= y -2.6e-247) (* -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 (y <= -2.6e-247) {
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 (y <= (-2.6d-247)) 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 (y <= -2.6e-247) {
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 y <= -2.6e-247: 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 (y <= -2.6e-247) 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 (y <= -2.6e-247)
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[y, -2.6e-247], 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}\;y \leq -2.6 \cdot 10^{-247}:\\
\;\;\;\;-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 y < -2.6e-247Initial program 91.7%
sub-neg91.7%
+-commutative91.7%
neg-sub091.7%
associate-+l-91.7%
sub0-neg91.7%
neg-mul-191.7%
associate-/l*91.1%
associate-/r/91.6%
*-commutative91.6%
sub-neg91.6%
+-commutative91.6%
neg-sub091.6%
associate-+l-91.6%
sub0-neg91.6%
distribute-lft-neg-out91.6%
distribute-rgt-neg-in91.6%
Simplified91.6%
associate-*r/91.5%
clear-num91.0%
*-commutative91.0%
Applied egg-rr91.0%
Taylor expanded in x around 0 42.7%
associate-/l*45.7%
Simplified45.7%
if -2.6e-247 < y Initial program 92.2%
sub-neg92.2%
+-commutative92.2%
neg-sub092.2%
associate-+l-92.2%
sub0-neg92.2%
neg-mul-192.2%
associate-/l*92.0%
associate-/r/92.1%
*-commutative92.1%
sub-neg92.1%
+-commutative92.1%
neg-sub092.1%
associate-+l-92.1%
sub0-neg92.1%
distribute-lft-neg-out92.1%
distribute-rgt-neg-in92.1%
Simplified92.8%
Taylor expanded in x around 0 51.5%
associate-/l*54.0%
associate-/r/50.9%
Simplified50.9%
Final simplification48.5%
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 92.0%
sub-neg92.0%
+-commutative92.0%
neg-sub092.0%
associate-+l-92.0%
sub0-neg92.0%
neg-mul-192.0%
associate-/l*91.6%
associate-/r/91.9%
*-commutative91.9%
sub-neg91.9%
+-commutative91.9%
neg-sub091.9%
associate-+l-91.9%
sub0-neg91.9%
distribute-lft-neg-out91.9%
distribute-rgt-neg-in91.9%
Simplified92.3%
Taylor expanded in x around 0 47.5%
associate-/l*50.2%
associate-/r/49.0%
Simplified49.0%
Final simplification49.0%
(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 2023199
(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)))