
(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: x and y 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 1e+226)))
(fma -4.5 (* z (/ t a)) (* 0.5 (* x (/ y a))))
(/ (fma x y (* z (* t -9.0))) (* a 2.0)))))assert(x < y);
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 <= 1e+226)) {
tmp = fma(-4.5, (z * (t / a)), (0.5 * (x * (y / a))));
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
x, y = sort([x, y]) 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 <= 1e+226)) tmp = fma(-4.5, Float64(z * Float64(t / a)), Float64(0.5 * Float64(x * Float64(y / a)))); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
NOTE: x and y 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, 1e+226]], $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[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\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 10^{+226}\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{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -inf.0 or 9.99999999999999961e225 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 67.1%
*-commutative67.1%
*-commutative67.1%
associate-*l*65.8%
Simplified65.8%
Taylor expanded in x around 0 63.3%
fma-def63.3%
associate-/l*71.6%
associate-/r/71.5%
associate-*r/90.9%
Simplified90.9%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 9.99999999999999961e225Initial program 99.7%
fma-neg99.7%
associate-*l*99.7%
distribute-rgt-neg-in99.7%
*-commutative99.7%
distribute-rgt-neg-in99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification97.0%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) (- INFINITY))
(* (/ x a) (* y 0.5))
(if (<= (* x y) 2e+250)
(/ (fma x y (* z (* t -9.0))) (* a 2.0))
(* 0.5 (* x (/ y a))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+250) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (Float64(x * y) <= 2e+250) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
NOTE: x and y 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 / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+250], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+250}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 58.3%
*-commutative58.3%
*-commutative58.3%
associate-*l*58.3%
Simplified58.3%
Taylor expanded in x around inf 63.9%
associate-*r/63.9%
*-commutative63.9%
associate-*r*63.9%
Simplified63.9%
*-commutative63.9%
*-commutative63.9%
associate-*r*63.9%
associate-*l/63.9%
associate-*l/94.6%
associate-*l*94.6%
Applied egg-rr94.6%
if -inf.0 < (*.f64 x y) < 1.9999999999999998e250Initial program 96.7%
fma-neg96.7%
associate-*l*96.7%
distribute-rgt-neg-in96.7%
*-commutative96.7%
distribute-rgt-neg-in96.7%
metadata-eval96.7%
Simplified96.7%
if 1.9999999999999998e250 < (*.f64 x y) Initial program 49.6%
*-commutative49.6%
*-commutative49.6%
associate-*l*45.2%
Simplified45.2%
Taylor expanded in x around inf 54.1%
associate-*r/87.2%
Simplified87.2%
Final simplification95.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) (- INFINITY))
(* (/ x a) (* y 0.5))
(if (<= (* x y) 2e+250)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* 0.5 (* x (/ y a))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+250) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = (x / a) * (y * 0.5);
} else if ((x * y) <= 2e+250) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = (x / a) * (y * 0.5) elif (x * y) <= 2e+250: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x / a) * Float64(y * 0.5)); elseif (Float64(x * y) <= 2e+250) 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
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = (x / a) * (y * 0.5);
elseif ((x * y) <= 2e+250)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y 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 / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+250], 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}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+250}:\\
\;\;\;\;\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) < -inf.0Initial program 58.3%
*-commutative58.3%
*-commutative58.3%
associate-*l*58.3%
Simplified58.3%
Taylor expanded in x around inf 63.9%
associate-*r/63.9%
*-commutative63.9%
associate-*r*63.9%
Simplified63.9%
*-commutative63.9%
*-commutative63.9%
associate-*r*63.9%
associate-*l/63.9%
associate-*l/94.6%
associate-*l*94.6%
Applied egg-rr94.6%
if -inf.0 < (*.f64 x y) < 1.9999999999999998e250Initial program 96.7%
*-commutative96.7%
*-commutative96.7%
associate-*l*96.7%
Simplified96.7%
if 1.9999999999999998e250 < (*.f64 x y) Initial program 49.6%
*-commutative49.6%
*-commutative49.6%
associate-*l*45.2%
Simplified45.2%
Taylor expanded in x around inf 54.1%
associate-*r/87.2%
Simplified87.2%
Final simplification95.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* -4.5 (/ (* z t) a))))
(if (<= y -1.46e-49)
(* 0.5 (/ x (/ a y)))
(if (<= y -1.6e-231)
t_1
(if (<= y -1.2e-286)
(/ (* x (* y 0.5)) a)
(if (<= y 1.15e-26)
t_1
(if (<= y 6.5e+195)
(* 0.5 (* x (/ y a)))
(/ (* y 0.5) (/ a x)))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * ((z * t) / a);
double tmp;
if (y <= -1.46e-49) {
tmp = 0.5 * (x / (a / y));
} else if (y <= -1.6e-231) {
tmp = t_1;
} else if (y <= -1.2e-286) {
tmp = (x * (y * 0.5)) / a;
} else if (y <= 1.15e-26) {
tmp = t_1;
} else if (y <= 6.5e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
NOTE: x and y 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 = (-4.5d0) * ((z * t) / a)
if (y <= (-1.46d-49)) then
tmp = 0.5d0 * (x / (a / y))
else if (y <= (-1.6d-231)) then
tmp = t_1
else if (y <= (-1.2d-286)) then
tmp = (x * (y * 0.5d0)) / a
else if (y <= 1.15d-26) then
tmp = t_1
else if (y <= 6.5d+195) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (y * 0.5d0) / (a / x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * ((z * t) / a);
double tmp;
if (y <= -1.46e-49) {
tmp = 0.5 * (x / (a / y));
} else if (y <= -1.6e-231) {
tmp = t_1;
} else if (y <= -1.2e-286) {
tmp = (x * (y * 0.5)) / a;
} else if (y <= 1.15e-26) {
tmp = t_1;
} else if (y <= 6.5e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): t_1 = -4.5 * ((z * t) / a) tmp = 0 if y <= -1.46e-49: tmp = 0.5 * (x / (a / y)) elif y <= -1.6e-231: tmp = t_1 elif y <= -1.2e-286: tmp = (x * (y * 0.5)) / a elif y <= 1.15e-26: tmp = t_1 elif y <= 6.5e+195: tmp = 0.5 * (x * (y / a)) else: tmp = (y * 0.5) / (a / x) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) t_1 = Float64(-4.5 * Float64(Float64(z * t) / a)) tmp = 0.0 if (y <= -1.46e-49) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (y <= -1.6e-231) tmp = t_1; elseif (y <= -1.2e-286) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); elseif (y <= 1.15e-26) tmp = t_1; elseif (y <= 6.5e+195) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(Float64(y * 0.5) / Float64(a / x)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = -4.5 * ((z * t) / a);
tmp = 0.0;
if (y <= -1.46e-49)
tmp = 0.5 * (x / (a / y));
elseif (y <= -1.6e-231)
tmp = t_1;
elseif (y <= -1.2e-286)
tmp = (x * (y * 0.5)) / a;
elseif (y <= 1.15e-26)
tmp = t_1;
elseif (y <= 6.5e+195)
tmp = 0.5 * (x * (y / a));
else
tmp = (y * 0.5) / (a / x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.46e-49], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.6e-231], t$95$1, If[LessEqual[y, -1.2e-286], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[y, 1.15e-26], t$95$1, If[LessEqual[y, 6.5e+195], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := -4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{if}\;y \leq -1.46 \cdot 10^{-49}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;y \leq -1.6 \cdot 10^{-231}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq -1.2 \cdot 10^{-286}:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{elif}\;y \leq 1.15 \cdot 10^{-26}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 6.5 \cdot 10^{+195}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\end{array}
\end{array}
if y < -1.46000000000000007e-49Initial program 84.9%
*-commutative84.9%
*-commutative84.9%
associate-*l*83.6%
Simplified83.6%
Taylor expanded in x around inf 59.6%
associate-/l*61.9%
Simplified61.9%
if -1.46000000000000007e-49 < y < -1.60000000000000004e-231 or -1.19999999999999997e-286 < y < 1.15000000000000004e-26Initial program 97.6%
*-commutative97.6%
*-commutative97.6%
associate-*l*97.7%
Simplified97.7%
Taylor expanded in x around 0 69.4%
if -1.60000000000000004e-231 < y < -1.19999999999999997e-286Initial program 88.0%
*-commutative88.0%
*-commutative88.0%
associate-*l*88.0%
Simplified88.0%
Taylor expanded in x around inf 39.7%
associate-*r/39.7%
*-commutative39.7%
associate-*r*39.7%
Simplified39.7%
if 1.15000000000000004e-26 < y < 6.5000000000000003e195Initial program 94.0%
*-commutative94.0%
*-commutative94.0%
associate-*l*94.0%
Simplified94.0%
Taylor expanded in x around inf 61.2%
associate-*r/68.9%
Simplified68.9%
if 6.5000000000000003e195 < y Initial program 67.9%
*-commutative67.9%
*-commutative67.9%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around inf 49.7%
associate-*r/49.7%
*-commutative49.7%
associate-*r*49.7%
Simplified49.7%
*-commutative49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*l/49.7%
associate-*r/50.1%
*-commutative50.1%
associate-*l*50.1%
Applied egg-rr50.1%
associate-*l/49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*r/71.9%
clear-num71.8%
un-div-inv72.0%
Applied egg-rr72.0%
Final simplification65.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (/ (* -4.5 (* z t)) a)))
(if (<= y -1.15e-50)
(* 0.5 (/ x (/ a y)))
(if (<= y -1.1e-223)
t_1
(if (<= y -1.5e-286)
(/ (* x (* y 0.5)) a)
(if (<= y 1.6e-28)
t_1
(if (<= y 1.06e+195)
(* 0.5 (* x (/ y a)))
(/ (* y 0.5) (/ a x)))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double t_1 = (-4.5 * (z * t)) / a;
double tmp;
if (y <= -1.15e-50) {
tmp = 0.5 * (x / (a / y));
} else if (y <= -1.1e-223) {
tmp = t_1;
} else if (y <= -1.5e-286) {
tmp = (x * (y * 0.5)) / a;
} else if (y <= 1.6e-28) {
tmp = t_1;
} else if (y <= 1.06e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
NOTE: x and y 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 = ((-4.5d0) * (z * t)) / a
if (y <= (-1.15d-50)) then
tmp = 0.5d0 * (x / (a / y))
else if (y <= (-1.1d-223)) then
tmp = t_1
else if (y <= (-1.5d-286)) then
tmp = (x * (y * 0.5d0)) / a
else if (y <= 1.6d-28) then
tmp = t_1
else if (y <= 1.06d+195) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (y * 0.5d0) / (a / x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (-4.5 * (z * t)) / a;
double tmp;
if (y <= -1.15e-50) {
tmp = 0.5 * (x / (a / y));
} else if (y <= -1.1e-223) {
tmp = t_1;
} else if (y <= -1.5e-286) {
tmp = (x * (y * 0.5)) / a;
} else if (y <= 1.6e-28) {
tmp = t_1;
} else if (y <= 1.06e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): t_1 = (-4.5 * (z * t)) / a tmp = 0 if y <= -1.15e-50: tmp = 0.5 * (x / (a / y)) elif y <= -1.1e-223: tmp = t_1 elif y <= -1.5e-286: tmp = (x * (y * 0.5)) / a elif y <= 1.6e-28: tmp = t_1 elif y <= 1.06e+195: tmp = 0.5 * (x * (y / a)) else: tmp = (y * 0.5) / (a / x) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) t_1 = Float64(Float64(-4.5 * Float64(z * t)) / a) tmp = 0.0 if (y <= -1.15e-50) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (y <= -1.1e-223) tmp = t_1; elseif (y <= -1.5e-286) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); elseif (y <= 1.6e-28) tmp = t_1; elseif (y <= 1.06e+195) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(Float64(y * 0.5) / Float64(a / x)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (-4.5 * (z * t)) / a;
tmp = 0.0;
if (y <= -1.15e-50)
tmp = 0.5 * (x / (a / y));
elseif (y <= -1.1e-223)
tmp = t_1;
elseif (y <= -1.5e-286)
tmp = (x * (y * 0.5)) / a;
elseif (y <= 1.6e-28)
tmp = t_1;
elseif (y <= 1.06e+195)
tmp = 0.5 * (x * (y / a));
else
tmp = (y * 0.5) / (a / x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(-4.5 * N[(z * t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[y, -1.15e-50], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.1e-223], t$95$1, If[LessEqual[y, -1.5e-286], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[y, 1.6e-28], t$95$1, If[LessEqual[y, 1.06e+195], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := \frac{-4.5 \cdot \left(z \cdot t\right)}{a}\\
\mathbf{if}\;y \leq -1.15 \cdot 10^{-50}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-223}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq -1.5 \cdot 10^{-286}:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{elif}\;y \leq 1.6 \cdot 10^{-28}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 1.06 \cdot 10^{+195}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\end{array}
\end{array}
if y < -1.1500000000000001e-50Initial program 84.9%
*-commutative84.9%
*-commutative84.9%
associate-*l*83.6%
Simplified83.6%
Taylor expanded in x around inf 59.6%
associate-/l*61.9%
Simplified61.9%
if -1.1500000000000001e-50 < y < -1.10000000000000004e-223 or -1.5e-286 < y < 1.59999999999999991e-28Initial program 97.6%
*-commutative97.6%
*-commutative97.6%
associate-*l*97.7%
Simplified97.7%
Taylor expanded in x around 0 70.2%
associate-/l*66.7%
Simplified66.7%
associate-/r/65.9%
*-commutative65.9%
associate-*l/70.2%
associate-*l/70.2%
Applied egg-rr70.2%
if -1.10000000000000004e-223 < y < -1.5e-286Initial program 88.7%
*-commutative88.7%
*-commutative88.7%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around inf 43.2%
associate-*r/43.2%
*-commutative43.2%
associate-*r*43.2%
Simplified43.2%
if 1.59999999999999991e-28 < y < 1.06000000000000001e195Initial program 94.0%
*-commutative94.0%
*-commutative94.0%
associate-*l*94.0%
Simplified94.0%
Taylor expanded in x around inf 61.2%
associate-*r/68.9%
Simplified68.9%
if 1.06000000000000001e195 < y Initial program 67.9%
*-commutative67.9%
*-commutative67.9%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around inf 49.7%
associate-*r/49.7%
*-commutative49.7%
associate-*r*49.7%
Simplified49.7%
*-commutative49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*l/49.7%
associate-*r/50.1%
*-commutative50.1%
associate-*l*50.1%
Applied egg-rr50.1%
associate-*l/49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*r/71.9%
clear-num71.8%
un-div-inv72.0%
Applied egg-rr72.0%
Final simplification65.6%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= y -5.6e-52)
(* 0.5 (/ x (/ a y)))
(if (<= y 3.4e-28)
(* -4.5 (/ (* z t) a))
(if (<= y 7.1e+195) (* 0.5 (* x (/ y a))) (* (/ x a) (* y 0.5))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -5.6e-52) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 3.4e-28) {
tmp = -4.5 * ((z * t) / a);
} else if (y <= 7.1e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (x / a) * (y * 0.5);
}
return tmp;
}
NOTE: x and y 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 <= (-5.6d-52)) then
tmp = 0.5d0 * (x / (a / y))
else if (y <= 3.4d-28) then
tmp = (-4.5d0) * ((z * t) / a)
else if (y <= 7.1d+195) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (x / a) * (y * 0.5d0)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -5.6e-52) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 3.4e-28) {
tmp = -4.5 * ((z * t) / a);
} else if (y <= 7.1e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (x / a) * (y * 0.5);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -5.6e-52: tmp = 0.5 * (x / (a / y)) elif y <= 3.4e-28: tmp = -4.5 * ((z * t) / a) elif y <= 7.1e+195: tmp = 0.5 * (x * (y / a)) else: tmp = (x / a) * (y * 0.5) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -5.6e-52) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (y <= 3.4e-28) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (y <= 7.1e+195) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(Float64(x / a) * Float64(y * 0.5)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (y <= -5.6e-52)
tmp = 0.5 * (x / (a / y));
elseif (y <= 3.4e-28)
tmp = -4.5 * ((z * t) / a);
elseif (y <= 7.1e+195)
tmp = 0.5 * (x * (y / a));
else
tmp = (x / a) * (y * 0.5);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[y, -5.6e-52], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.4e-28], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.1e+195], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5.6 \cdot 10^{-52}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;y \leq 3.4 \cdot 10^{-28}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;y \leq 7.1 \cdot 10^{+195}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\end{array}
\end{array}
if y < -5.59999999999999989e-52Initial program 84.9%
*-commutative84.9%
*-commutative84.9%
associate-*l*83.6%
Simplified83.6%
Taylor expanded in x around inf 59.6%
associate-/l*61.9%
Simplified61.9%
if -5.59999999999999989e-52 < y < 3.4000000000000001e-28Initial program 96.1%
*-commutative96.1%
*-commutative96.1%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in x around 0 67.5%
if 3.4000000000000001e-28 < y < 7.10000000000000011e195Initial program 94.0%
*-commutative94.0%
*-commutative94.0%
associate-*l*94.0%
Simplified94.0%
Taylor expanded in x around inf 61.2%
associate-*r/68.9%
Simplified68.9%
if 7.10000000000000011e195 < y Initial program 67.9%
*-commutative67.9%
*-commutative67.9%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around inf 49.7%
associate-*r/49.7%
*-commutative49.7%
associate-*r*49.7%
Simplified49.7%
*-commutative49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*l/49.7%
associate-*l/71.9%
associate-*l*71.9%
Applied egg-rr71.9%
Final simplification66.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= y -1.55e-49)
(* 0.5 (/ x (/ a y)))
(if (<= y 2.9e-27)
(* -4.5 (/ (* z t) a))
(if (<= y 6.7e+195) (* 0.5 (* x (/ y a))) (/ (* y 0.5) (/ a x))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -1.55e-49) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 2.9e-27) {
tmp = -4.5 * ((z * t) / a);
} else if (y <= 6.7e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
NOTE: x and y 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 <= (-1.55d-49)) then
tmp = 0.5d0 * (x / (a / y))
else if (y <= 2.9d-27) then
tmp = (-4.5d0) * ((z * t) / a)
else if (y <= 6.7d+195) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (y * 0.5d0) / (a / x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -1.55e-49) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 2.9e-27) {
tmp = -4.5 * ((z * t) / a);
} else if (y <= 6.7e+195) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -1.55e-49: tmp = 0.5 * (x / (a / y)) elif y <= 2.9e-27: tmp = -4.5 * ((z * t) / a) elif y <= 6.7e+195: tmp = 0.5 * (x * (y / a)) else: tmp = (y * 0.5) / (a / x) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -1.55e-49) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (y <= 2.9e-27) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (y <= 6.7e+195) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(Float64(y * 0.5) / Float64(a / x)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (y <= -1.55e-49)
tmp = 0.5 * (x / (a / y));
elseif (y <= 2.9e-27)
tmp = -4.5 * ((z * t) / a);
elseif (y <= 6.7e+195)
tmp = 0.5 * (x * (y / a));
else
tmp = (y * 0.5) / (a / x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[y, -1.55e-49], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.9e-27], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.7e+195], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.55 \cdot 10^{-49}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;y \leq 2.9 \cdot 10^{-27}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;y \leq 6.7 \cdot 10^{+195}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\end{array}
\end{array}
if y < -1.55e-49Initial program 84.9%
*-commutative84.9%
*-commutative84.9%
associate-*l*83.6%
Simplified83.6%
Taylor expanded in x around inf 59.6%
associate-/l*61.9%
Simplified61.9%
if -1.55e-49 < y < 2.90000000000000004e-27Initial program 96.1%
*-commutative96.1%
*-commutative96.1%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in x around 0 67.5%
if 2.90000000000000004e-27 < y < 6.69999999999999955e195Initial program 94.0%
*-commutative94.0%
*-commutative94.0%
associate-*l*94.0%
Simplified94.0%
Taylor expanded in x around inf 61.2%
associate-*r/68.9%
Simplified68.9%
if 6.69999999999999955e195 < y Initial program 67.9%
*-commutative67.9%
*-commutative67.9%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around inf 49.7%
associate-*r/49.7%
*-commutative49.7%
associate-*r*49.7%
Simplified49.7%
*-commutative49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*l/49.7%
associate-*r/50.1%
*-commutative50.1%
associate-*l*50.1%
Applied egg-rr50.1%
associate-*l/49.7%
*-commutative49.7%
associate-*r*49.7%
associate-*r/71.9%
clear-num71.8%
un-div-inv72.0%
Applied egg-rr72.0%
Final simplification66.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= y -1.25e-49) (not (<= y 4.8e-29))) (* 0.5 (* x (/ y a))) (* -4.5 (/ (* z t) a))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y <= -1.25e-49) || !(y <= 4.8e-29)) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
NOTE: x and y 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 <= (-1.25d-49)) .or. (.not. (y <= 4.8d-29))) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * ((z * t) / a)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y <= -1.25e-49) || !(y <= 4.8e-29)) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if (y <= -1.25e-49) or not (y <= 4.8e-29): tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * ((z * t) / a) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if ((y <= -1.25e-49) || !(y <= 4.8e-29)) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((y <= -1.25e-49) || ~((y <= 4.8e-29)))
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * ((z * t) / a);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -1.25e-49], N[Not[LessEqual[y, 4.8e-29]], $MachinePrecision]], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.25 \cdot 10^{-49} \lor \neg \left(y \leq 4.8 \cdot 10^{-29}\right):\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if y < -1.25e-49 or 4.79999999999999984e-29 < y Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
associate-*l*84.7%
Simplified84.7%
Taylor expanded in x around inf 58.7%
associate-*r/62.4%
Simplified62.4%
if -1.25e-49 < y < 4.79999999999999984e-29Initial program 96.1%
*-commutative96.1%
*-commutative96.1%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in x around 0 67.5%
Final simplification64.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= y -2.4e-52) (* 0.5 (/ x (/ a y))) (if (<= y 5.5e-28) (* -4.5 (/ (* z t) a)) (* 0.5 (* x (/ y a))))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -2.4e-52) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 5.5e-28) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: x and y 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.4d-52)) then
tmp = 0.5d0 * (x / (a / y))
else if (y <= 5.5d-28) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -2.4e-52) {
tmp = 0.5 * (x / (a / y));
} else if (y <= 5.5e-28) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -2.4e-52: tmp = 0.5 * (x / (a / y)) elif y <= 5.5e-28: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -2.4e-52) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (y <= 5.5e-28) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (y <= -2.4e-52)
tmp = 0.5 * (x / (a / y));
elseif (y <= 5.5e-28)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[y, -2.4e-52], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.5e-28], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.4 \cdot 10^{-52}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;y \leq 5.5 \cdot 10^{-28}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if y < -2.4000000000000002e-52Initial program 84.9%
*-commutative84.9%
*-commutative84.9%
associate-*l*83.6%
Simplified83.6%
Taylor expanded in x around inf 59.6%
associate-/l*61.9%
Simplified61.9%
if -2.4000000000000002e-52 < y < 5.49999999999999967e-28Initial program 96.1%
*-commutative96.1%
*-commutative96.1%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in x around 0 67.5%
if 5.49999999999999967e-28 < y Initial program 86.0%
*-commutative86.0%
*-commutative86.0%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around inf 57.7%
associate-*r/63.2%
Simplified63.2%
Final simplification64.5%
NOTE: x and y 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);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x and y 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;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y = sort([x, y]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x and y 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] = \mathsf{sort}([x, y])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 89.8%
*-commutative89.8%
*-commutative89.8%
associate-*l*89.4%
Simplified89.4%
Taylor expanded in x around 0 47.0%
associate-/l*47.8%
Simplified47.8%
Taylor expanded in t around 0 47.0%
associate-*r/47.6%
Simplified47.6%
Final simplification47.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (/ t (/ a z))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
NOTE: x and y 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 / (a / z))
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): return -4.5 * (t / (a / z))
x, y = sort([x, y]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t / Float64(a / z))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t / (a / z));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
-4.5 \cdot \frac{t}{\frac{a}{z}}
\end{array}
Initial program 89.8%
*-commutative89.8%
*-commutative89.8%
associate-*l*89.4%
Simplified89.4%
Taylor expanded in x around 0 47.0%
associate-/l*47.8%
Simplified47.8%
Final simplification47.8%
(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 2023309
(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)))