
(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 and y should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) 1e+272) (* (fma x y (* z (* t -9.0))) (/ 0.5 a)) (* 0.5 (/ y (/ a x)))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+272) {
tmp = fma(x, y, (z * (t * -9.0))) * (0.5 / a);
} else {
tmp = 0.5 * (y / (a / x));
}
return tmp;
}
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 1e+272) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) * Float64(0.5 / a)); else tmp = Float64(0.5 * Float64(y / Float64(a / x))); 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], 1e+272], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq 10^{+272}:\\
\;\;\;\;\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\end{array}
\end{array}
if (*.f64 x y) < 1.0000000000000001e272Initial program 94.1%
sub-neg94.1%
+-commutative94.1%
neg-sub094.1%
associate-+l-94.1%
sub0-neg94.1%
neg-mul-194.1%
associate-/l*93.7%
associate-/r/94.0%
*-commutative94.0%
sub-neg94.0%
+-commutative94.0%
neg-sub094.0%
associate-+l-94.0%
sub0-neg94.0%
distribute-lft-neg-out94.0%
distribute-rgt-neg-in94.0%
Simplified94.4%
if 1.0000000000000001e272 < (*.f64 x y) Initial program 59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
neg-mul-159.7%
associate-/l*59.8%
associate-/r/59.7%
*-commutative59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
distribute-lft-neg-out59.7%
distribute-rgt-neg-in59.7%
Simplified59.7%
associate-*r/59.7%
clear-num59.8%
*-commutative59.8%
Applied egg-rr59.8%
Taylor expanded in x around inf 70.2%
associate-*r/99.8%
Simplified99.8%
clear-num99.6%
un-div-inv99.8%
Applied egg-rr99.8%
Final simplification94.8%
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) 1e+272) (/ (- (* x y) (* z (* t 9.0))) (* a 2.0)) (* 0.5 (/ y (/ a x)))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+272) {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (y / (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 ((x * y) <= 1d+272) then
tmp = ((x * y) - (z * (t * 9.0d0))) / (a * 2.0d0)
else
tmp = 0.5d0 * (y / (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 ((x * y) <= 1e+272) {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (y / (a / x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= 1e+272: tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0) else: tmp = 0.5 * (y / (a / x)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 1e+272) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(y / 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 ((x * y) <= 1e+272)
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
else
tmp = 0.5 * (y / (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[N[(x * y), $MachinePrecision], 1e+272], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq 10^{+272}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\end{array}
\end{array}
if (*.f64 x y) < 1.0000000000000001e272Initial program 94.1%
associate-*l*94.1%
Simplified94.1%
if 1.0000000000000001e272 < (*.f64 x y) Initial program 59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
neg-mul-159.7%
associate-/l*59.8%
associate-/r/59.7%
*-commutative59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
distribute-lft-neg-out59.7%
distribute-rgt-neg-in59.7%
Simplified59.7%
associate-*r/59.7%
clear-num59.8%
*-commutative59.8%
Applied egg-rr59.8%
Taylor expanded in x around inf 70.2%
associate-*r/99.8%
Simplified99.8%
clear-num99.6%
un-div-inv99.8%
Applied egg-rr99.8%
Final simplification94.5%
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) 1e+272) (/ (- (* x y) (* t (* z 9.0))) (* a 2.0)) (* 0.5 (/ y (/ a x)))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+272) {
tmp = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (y / (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 ((x * y) <= 1d+272) then
tmp = ((x * y) - (t * (z * 9.0d0))) / (a * 2.0d0)
else
tmp = 0.5d0 * (y / (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 ((x * y) <= 1e+272) {
tmp = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (y / (a / x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= 1e+272: tmp = ((x * y) - (t * (z * 9.0))) / (a * 2.0) else: tmp = 0.5 * (y / (a / x)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 1e+272) tmp = Float64(Float64(Float64(x * y) - Float64(t * Float64(z * 9.0))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(y / 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 ((x * y) <= 1e+272)
tmp = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
else
tmp = 0.5 * (y / (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[N[(x * y), $MachinePrecision], 1e+272], N[(N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq 10^{+272}:\\
\;\;\;\;\frac{x \cdot y - t \cdot \left(z \cdot 9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\end{array}
\end{array}
if (*.f64 x y) < 1.0000000000000001e272Initial program 94.1%
if 1.0000000000000001e272 < (*.f64 x y) Initial program 59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
neg-mul-159.7%
associate-/l*59.8%
associate-/r/59.7%
*-commutative59.7%
sub-neg59.7%
+-commutative59.7%
neg-sub059.7%
associate-+l-59.7%
sub0-neg59.7%
distribute-lft-neg-out59.7%
distribute-rgt-neg-in59.7%
Simplified59.7%
associate-*r/59.7%
clear-num59.8%
*-commutative59.8%
Applied egg-rr59.8%
Taylor expanded in x around inf 70.2%
associate-*r/99.8%
Simplified99.8%
clear-num99.6%
un-div-inv99.8%
Applied egg-rr99.8%
Final simplification94.5%
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 (* 0.5 (* y (/ x a)))))
(if (<= y -2.8e-57)
t_1
(if (<= y -1.1e-195)
(* -4.5 (* z (/ t a)))
(if (or (<= y -1e-198) (not (<= y 1.2e+46)))
t_1
(* -4.5 (* t (/ z a))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double t_1 = 0.5 * (y * (x / a));
double tmp;
if (y <= -2.8e-57) {
tmp = t_1;
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if ((y <= -1e-198) || !(y <= 1.2e+46)) {
tmp = t_1;
} else {
tmp = -4.5 * (t * (z / 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) :: t_1
real(8) :: tmp
t_1 = 0.5d0 * (y * (x / a))
if (y <= (-2.8d-57)) then
tmp = t_1
else if (y <= (-1.1d-195)) then
tmp = (-4.5d0) * (z * (t / a))
else if ((y <= (-1d-198)) .or. (.not. (y <= 1.2d+46))) then
tmp = t_1
else
tmp = (-4.5d0) * (t * (z / 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 t_1 = 0.5 * (y * (x / a));
double tmp;
if (y <= -2.8e-57) {
tmp = t_1;
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if ((y <= -1e-198) || !(y <= 1.2e+46)) {
tmp = t_1;
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): t_1 = 0.5 * (y * (x / a)) tmp = 0 if y <= -2.8e-57: tmp = t_1 elif y <= -1.1e-195: tmp = -4.5 * (z * (t / a)) elif (y <= -1e-198) or not (y <= 1.2e+46): tmp = t_1 else: tmp = -4.5 * (t * (z / a)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) t_1 = Float64(0.5 * Float64(y * Float64(x / a))) tmp = 0.0 if (y <= -2.8e-57) tmp = t_1; elseif (y <= -1.1e-195) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif ((y <= -1e-198) || !(y <= 1.2e+46)) tmp = t_1; else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = 0.5 * (y * (x / a));
tmp = 0.0;
if (y <= -2.8e-57)
tmp = t_1;
elseif (y <= -1.1e-195)
tmp = -4.5 * (z * (t / a));
elseif ((y <= -1e-198) || ~((y <= 1.2e+46)))
tmp = t_1;
else
tmp = -4.5 * (t * (z / 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_] := Block[{t$95$1 = N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.8e-57], t$95$1, If[LessEqual[y, -1.1e-195], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[y, -1e-198], N[Not[LessEqual[y, 1.2e+46]], $MachinePrecision]], t$95$1, N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := 0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{if}\;y \leq -2.8 \cdot 10^{-57}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-195}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;y \leq -1 \cdot 10^{-198} \lor \neg \left(y \leq 1.2 \cdot 10^{+46}\right):\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if y < -2.7999999999999999e-57 or -1.10000000000000003e-195 < y < -9.9999999999999991e-199 or 1.20000000000000004e46 < y Initial program 91.0%
sub-neg91.0%
+-commutative91.0%
neg-sub091.0%
associate-+l-91.0%
sub0-neg91.0%
neg-mul-191.0%
associate-/l*90.4%
associate-/r/90.8%
*-commutative90.8%
sub-neg90.8%
+-commutative90.8%
neg-sub090.8%
associate-+l-90.8%
sub0-neg90.8%
distribute-lft-neg-out90.8%
distribute-rgt-neg-in90.8%
Simplified90.7%
associate-*r/90.9%
clear-num90.4%
*-commutative90.4%
Applied egg-rr90.4%
Taylor expanded in x around inf 63.0%
associate-*r/68.4%
Simplified68.4%
if -2.7999999999999999e-57 < y < -1.10000000000000003e-195Initial program 87.5%
sub-neg87.5%
+-commutative87.5%
neg-sub087.5%
associate-+l-87.5%
sub0-neg87.5%
neg-mul-187.5%
associate-/l*86.3%
associate-/r/87.4%
*-commutative87.4%
sub-neg87.4%
+-commutative87.4%
neg-sub087.4%
associate-+l-87.4%
sub0-neg87.4%
distribute-lft-neg-out87.4%
distribute-rgt-neg-in87.4%
Simplified87.4%
Taylor expanded in x around 0 58.8%
associate-/l*62.8%
associate-/r/65.9%
Simplified65.9%
if -9.9999999999999991e-199 < y < 1.20000000000000004e46Initial program 93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
neg-mul-193.2%
associate-/l*93.2%
associate-/r/93.2%
*-commutative93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
distribute-lft-neg-out93.2%
distribute-rgt-neg-in93.2%
Simplified94.1%
Taylor expanded in x around 0 69.9%
associate-/l*71.6%
associate-/r/69.7%
Simplified69.7%
Taylor expanded in t around 0 69.9%
*-lft-identity69.9%
times-frac71.6%
/-rgt-identity71.6%
Simplified71.6%
Final simplification69.5%
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 (* 0.5 (* x (/ y a)))))
(if (<= y -4.2e-58)
t_1
(if (<= y -1.1e-195)
(* -4.5 (* z (/ t a)))
(if (<= y -5.5e-199)
(* 0.5 (* y (/ x a)))
(if (<= y 6.5e+45) (* -4.5 (* t (/ z a))) t_1))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double t_1 = 0.5 * (x * (y / a));
double tmp;
if (y <= -4.2e-58) {
tmp = t_1;
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -5.5e-199) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 6.5e+45) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = t_1;
}
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 = 0.5d0 * (x * (y / a))
if (y <= (-4.2d-58)) then
tmp = t_1
else if (y <= (-1.1d-195)) then
tmp = (-4.5d0) * (z * (t / a))
else if (y <= (-5.5d-199)) then
tmp = 0.5d0 * (y * (x / a))
else if (y <= 6.5d+45) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = t_1
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 = 0.5 * (x * (y / a));
double tmp;
if (y <= -4.2e-58) {
tmp = t_1;
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -5.5e-199) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 6.5e+45) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = t_1;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): t_1 = 0.5 * (x * (y / a)) tmp = 0 if y <= -4.2e-58: tmp = t_1 elif y <= -1.1e-195: tmp = -4.5 * (z * (t / a)) elif y <= -5.5e-199: tmp = 0.5 * (y * (x / a)) elif y <= 6.5e+45: tmp = -4.5 * (t * (z / a)) else: tmp = t_1 return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) t_1 = Float64(0.5 * Float64(x * Float64(y / a))) tmp = 0.0 if (y <= -4.2e-58) tmp = t_1; elseif (y <= -1.1e-195) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (y <= -5.5e-199) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (y <= 6.5e+45) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = t_1; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = 0.5 * (x * (y / a));
tmp = 0.0;
if (y <= -4.2e-58)
tmp = t_1;
elseif (y <= -1.1e-195)
tmp = -4.5 * (z * (t / a));
elseif (y <= -5.5e-199)
tmp = 0.5 * (y * (x / a));
elseif (y <= 6.5e+45)
tmp = -4.5 * (t * (z / a));
else
tmp = t_1;
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[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.2e-58], t$95$1, If[LessEqual[y, -1.1e-195], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -5.5e-199], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.5e+45], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := 0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{if}\;y \leq -4.2 \cdot 10^{-58}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-195}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;y \leq -5.5 \cdot 10^{-199}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;y \leq 6.5 \cdot 10^{+45}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if y < -4.19999999999999975e-58 or 6.50000000000000034e45 < y Initial program 90.8%
sub-neg90.8%
+-commutative90.8%
neg-sub090.8%
associate-+l-90.8%
sub0-neg90.8%
neg-mul-190.8%
associate-/l*90.7%
associate-/r/90.5%
*-commutative90.5%
sub-neg90.5%
+-commutative90.5%
neg-sub090.5%
associate-+l-90.5%
sub0-neg90.5%
distribute-lft-neg-out90.5%
distribute-rgt-neg-in90.5%
Simplified90.5%
Taylor expanded in x around inf 62.2%
associate-/l*67.3%
associate-/r/66.1%
Applied egg-rr66.1%
if -4.19999999999999975e-58 < y < -1.10000000000000003e-195Initial program 87.5%
sub-neg87.5%
+-commutative87.5%
neg-sub087.5%
associate-+l-87.5%
sub0-neg87.5%
neg-mul-187.5%
associate-/l*86.3%
associate-/r/87.4%
*-commutative87.4%
sub-neg87.4%
+-commutative87.4%
neg-sub087.4%
associate-+l-87.4%
sub0-neg87.4%
distribute-lft-neg-out87.4%
distribute-rgt-neg-in87.4%
Simplified87.4%
Taylor expanded in x around 0 58.8%
associate-/l*62.8%
associate-/r/65.9%
Simplified65.9%
if -1.10000000000000003e-195 < y < -5.5000000000000001e-199Initial program 99.5%
sub-neg99.5%
+-commutative99.5%
neg-sub099.5%
associate-+l-99.5%
sub0-neg99.5%
neg-mul-199.5%
associate-/l*78.8%
associate-/r/100.0%
*-commutative100.0%
sub-neg100.0%
+-commutative100.0%
neg-sub0100.0%
associate-+l-100.0%
sub0-neg100.0%
distribute-lft-neg-out100.0%
distribute-rgt-neg-in100.0%
Simplified100.0%
associate-*r/99.5%
clear-num78.8%
*-commutative78.8%
Applied egg-rr78.8%
Taylor expanded in x around inf 99.5%
associate-*r/100.0%
Simplified100.0%
if -5.5000000000000001e-199 < y < 6.50000000000000034e45Initial program 93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
neg-mul-193.2%
associate-/l*93.2%
associate-/r/93.2%
*-commutative93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
distribute-lft-neg-out93.2%
distribute-rgt-neg-in93.2%
Simplified94.1%
Taylor expanded in x around 0 69.9%
associate-/l*71.6%
associate-/r/69.7%
Simplified69.7%
Taylor expanded in t around 0 69.9%
*-lft-identity69.9%
times-frac71.6%
/-rgt-identity71.6%
Simplified71.6%
Final simplification68.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= y -3.9e-57)
(* 0.5 (* x (/ y a)))
(if (<= y -4.4e-195)
(* -4.5 (* z (/ t a)))
(if (<= y -1e-198)
(* 0.5 (* y (/ x a)))
(if (<= y 1.9e+46) (* -4.5 (* t (/ z a))) (* 0.5 (/ x (/ a y))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -3.9e-57) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -4.4e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 1.9e+46) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x / (a / y));
}
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 <= (-3.9d-57)) then
tmp = 0.5d0 * (x * (y / a))
else if (y <= (-4.4d-195)) then
tmp = (-4.5d0) * (z * (t / a))
else if (y <= (-1d-198)) then
tmp = 0.5d0 * (y * (x / a))
else if (y <= 1.9d+46) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = 0.5d0 * (x / (a / y))
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 <= -3.9e-57) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -4.4e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 1.9e+46) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x / (a / y));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -3.9e-57: tmp = 0.5 * (x * (y / a)) elif y <= -4.4e-195: tmp = -4.5 * (z * (t / a)) elif y <= -1e-198: tmp = 0.5 * (y * (x / a)) elif y <= 1.9e+46: tmp = -4.5 * (t * (z / a)) else: tmp = 0.5 * (x / (a / y)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -3.9e-57) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (y <= -4.4e-195) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (y <= -1e-198) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (y <= 1.9e+46) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (y <= -3.9e-57)
tmp = 0.5 * (x * (y / a));
elseif (y <= -4.4e-195)
tmp = -4.5 * (z * (t / a));
elseif (y <= -1e-198)
tmp = 0.5 * (y * (x / a));
elseif (y <= 1.9e+46)
tmp = -4.5 * (t * (z / a));
else
tmp = 0.5 * (x / (a / y));
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, -3.9e-57], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -4.4e-195], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1e-198], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.9e+46], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.9 \cdot 10^{-57}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;y \leq -4.4 \cdot 10^{-195}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;y \leq -1 \cdot 10^{-198}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;y \leq 1.9 \cdot 10^{+46}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if y < -3.90000000000000006e-57Initial 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.1%
associate-/r/92.0%
*-commutative92.0%
sub-neg92.0%
+-commutative92.0%
neg-sub092.0%
associate-+l-92.0%
sub0-neg92.0%
distribute-lft-neg-out92.0%
distribute-rgt-neg-in92.0%
Simplified92.0%
Taylor expanded in x around inf 58.0%
associate-/l*63.9%
associate-/r/60.0%
Applied egg-rr60.0%
if -3.90000000000000006e-57 < y < -4.40000000000000011e-195Initial program 87.5%
sub-neg87.5%
+-commutative87.5%
neg-sub087.5%
associate-+l-87.5%
sub0-neg87.5%
neg-mul-187.5%
associate-/l*86.3%
associate-/r/87.4%
*-commutative87.4%
sub-neg87.4%
+-commutative87.4%
neg-sub087.4%
associate-+l-87.4%
sub0-neg87.4%
distribute-lft-neg-out87.4%
distribute-rgt-neg-in87.4%
Simplified87.4%
Taylor expanded in x around 0 58.8%
associate-/l*62.8%
associate-/r/65.9%
Simplified65.9%
if -4.40000000000000011e-195 < y < -9.9999999999999991e-199Initial program 99.5%
sub-neg99.5%
+-commutative99.5%
neg-sub099.5%
associate-+l-99.5%
sub0-neg99.5%
neg-mul-199.5%
associate-/l*78.8%
associate-/r/100.0%
*-commutative100.0%
sub-neg100.0%
+-commutative100.0%
neg-sub0100.0%
associate-+l-100.0%
sub0-neg100.0%
distribute-lft-neg-out100.0%
distribute-rgt-neg-in100.0%
Simplified100.0%
associate-*r/99.5%
clear-num78.8%
*-commutative78.8%
Applied egg-rr78.8%
Taylor expanded in x around inf 99.5%
associate-*r/100.0%
Simplified100.0%
if -9.9999999999999991e-199 < y < 1.9e46Initial program 93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
neg-mul-193.2%
associate-/l*93.2%
associate-/r/93.2%
*-commutative93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
distribute-lft-neg-out93.2%
distribute-rgt-neg-in93.2%
Simplified94.1%
Taylor expanded in x around 0 69.9%
associate-/l*71.6%
associate-/r/69.7%
Simplified69.7%
Taylor expanded in t around 0 69.9%
*-lft-identity69.9%
times-frac71.6%
/-rgt-identity71.6%
Simplified71.6%
if 1.9e46 < y Initial program 89.3%
sub-neg89.3%
+-commutative89.3%
neg-sub089.3%
associate-+l-89.3%
sub0-neg89.3%
neg-mul-189.3%
associate-/l*89.3%
associate-/r/89.1%
*-commutative89.1%
sub-neg89.1%
+-commutative89.1%
neg-sub089.1%
associate-+l-89.1%
sub0-neg89.1%
distribute-lft-neg-out89.1%
distribute-rgt-neg-in89.1%
Simplified89.1%
Taylor expanded in x around inf 66.3%
associate-/l*70.6%
associate-/r/72.2%
Applied egg-rr72.2%
*-commutative72.2%
clear-num72.2%
un-div-inv72.2%
Applied egg-rr72.2%
Final simplification68.8%
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-61)
(* 0.5 (* x (/ y a)))
(if (<= y -1.1e-195)
(* -4.5 (* z (/ t a)))
(if (<= y -1e-198)
(* 0.5 (* y (/ x a)))
(if (<= y 2e+46) (* t (* z (/ -4.5 a))) (* 0.5 (/ x (/ a y))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -5.6e-61) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 2e+46) {
tmp = t * (z * (-4.5 / a));
} else {
tmp = 0.5 * (x / (a / y));
}
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-61)) then
tmp = 0.5d0 * (x * (y / a))
else if (y <= (-1.1d-195)) then
tmp = (-4.5d0) * (z * (t / a))
else if (y <= (-1d-198)) then
tmp = 0.5d0 * (y * (x / a))
else if (y <= 2d+46) then
tmp = t * (z * ((-4.5d0) / a))
else
tmp = 0.5d0 * (x / (a / y))
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-61) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 2e+46) {
tmp = t * (z * (-4.5 / a));
} else {
tmp = 0.5 * (x / (a / y));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -5.6e-61: tmp = 0.5 * (x * (y / a)) elif y <= -1.1e-195: tmp = -4.5 * (z * (t / a)) elif y <= -1e-198: tmp = 0.5 * (y * (x / a)) elif y <= 2e+46: tmp = t * (z * (-4.5 / a)) else: tmp = 0.5 * (x / (a / y)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -5.6e-61) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (y <= -1.1e-195) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (y <= -1e-198) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (y <= 2e+46) tmp = Float64(t * Float64(z * Float64(-4.5 / a))); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); 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-61)
tmp = 0.5 * (x * (y / a));
elseif (y <= -1.1e-195)
tmp = -4.5 * (z * (t / a));
elseif (y <= -1e-198)
tmp = 0.5 * (y * (x / a));
elseif (y <= 2e+46)
tmp = t * (z * (-4.5 / a));
else
tmp = 0.5 * (x / (a / y));
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-61], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.1e-195], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1e-198], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2e+46], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5.6 \cdot 10^{-61}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-195}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;y \leq -1 \cdot 10^{-198}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;y \leq 2 \cdot 10^{+46}:\\
\;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if y < -5.6000000000000002e-61Initial 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.1%
associate-/r/92.0%
*-commutative92.0%
sub-neg92.0%
+-commutative92.0%
neg-sub092.0%
associate-+l-92.0%
sub0-neg92.0%
distribute-lft-neg-out92.0%
distribute-rgt-neg-in92.0%
Simplified92.0%
Taylor expanded in x around inf 58.0%
associate-/l*63.9%
associate-/r/60.0%
Applied egg-rr60.0%
if -5.6000000000000002e-61 < y < -1.10000000000000003e-195Initial program 87.5%
sub-neg87.5%
+-commutative87.5%
neg-sub087.5%
associate-+l-87.5%
sub0-neg87.5%
neg-mul-187.5%
associate-/l*86.3%
associate-/r/87.4%
*-commutative87.4%
sub-neg87.4%
+-commutative87.4%
neg-sub087.4%
associate-+l-87.4%
sub0-neg87.4%
distribute-lft-neg-out87.4%
distribute-rgt-neg-in87.4%
Simplified87.4%
Taylor expanded in x around 0 58.8%
associate-/l*62.8%
associate-/r/65.9%
Simplified65.9%
if -1.10000000000000003e-195 < y < -9.9999999999999991e-199Initial program 99.5%
sub-neg99.5%
+-commutative99.5%
neg-sub099.5%
associate-+l-99.5%
sub0-neg99.5%
neg-mul-199.5%
associate-/l*78.8%
associate-/r/100.0%
*-commutative100.0%
sub-neg100.0%
+-commutative100.0%
neg-sub0100.0%
associate-+l-100.0%
sub0-neg100.0%
distribute-lft-neg-out100.0%
distribute-rgt-neg-in100.0%
Simplified100.0%
associate-*r/99.5%
clear-num78.8%
*-commutative78.8%
Applied egg-rr78.8%
Taylor expanded in x around inf 99.5%
associate-*r/100.0%
Simplified100.0%
if -9.9999999999999991e-199 < y < 2e46Initial program 93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
neg-mul-193.2%
associate-/l*93.2%
associate-/r/93.2%
*-commutative93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
distribute-lft-neg-out93.2%
distribute-rgt-neg-in93.2%
Simplified94.1%
Taylor expanded in x around 0 69.8%
*-commutative69.8%
associate-*l*69.8%
Simplified69.8%
expm1-log1p-u44.9%
expm1-udef31.4%
associate-*l*32.8%
Applied egg-rr32.8%
expm1-def43.7%
expm1-log1p71.6%
associate-*l*71.5%
associate-*r/71.6%
metadata-eval71.6%
Simplified71.6%
if 2e46 < y Initial program 89.3%
sub-neg89.3%
+-commutative89.3%
neg-sub089.3%
associate-+l-89.3%
sub0-neg89.3%
neg-mul-189.3%
associate-/l*89.3%
associate-/r/89.1%
*-commutative89.1%
sub-neg89.1%
+-commutative89.1%
neg-sub089.1%
associate-+l-89.1%
sub0-neg89.1%
distribute-lft-neg-out89.1%
distribute-rgt-neg-in89.1%
Simplified89.1%
Taylor expanded in x around inf 66.3%
associate-/l*70.6%
associate-/r/72.2%
Applied egg-rr72.2%
*-commutative72.2%
clear-num72.2%
un-div-inv72.2%
Applied egg-rr72.2%
Final simplification68.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= y -3.6e-57)
(* 0.5 (* x (/ y a)))
(if (<= y -1.1e-195)
(* -4.5 (* z (/ t a)))
(if (<= y -1e-198)
(* 0.5 (* y (/ x a)))
(if (<= y 9e+45) (* t (/ (* z -4.5) a)) (* 0.5 (/ x (/ a y))))))))assert(x < y);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -3.6e-57) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 9e+45) {
tmp = t * ((z * -4.5) / a);
} else {
tmp = 0.5 * (x / (a / y));
}
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 <= (-3.6d-57)) then
tmp = 0.5d0 * (x * (y / a))
else if (y <= (-1.1d-195)) then
tmp = (-4.5d0) * (z * (t / a))
else if (y <= (-1d-198)) then
tmp = 0.5d0 * (y * (x / a))
else if (y <= 9d+45) then
tmp = t * ((z * (-4.5d0)) / a)
else
tmp = 0.5d0 * (x / (a / y))
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 <= -3.6e-57) {
tmp = 0.5 * (x * (y / a));
} else if (y <= -1.1e-195) {
tmp = -4.5 * (z * (t / a));
} else if (y <= -1e-198) {
tmp = 0.5 * (y * (x / a));
} else if (y <= 9e+45) {
tmp = t * ((z * -4.5) / a);
} else {
tmp = 0.5 * (x / (a / y));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): tmp = 0 if y <= -3.6e-57: tmp = 0.5 * (x * (y / a)) elif y <= -1.1e-195: tmp = -4.5 * (z * (t / a)) elif y <= -1e-198: tmp = 0.5 * (y * (x / a)) elif y <= 9e+45: tmp = t * ((z * -4.5) / a) else: tmp = 0.5 * (x / (a / y)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -3.6e-57) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (y <= -1.1e-195) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (y <= -1e-198) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (y <= 9e+45) tmp = Float64(t * Float64(Float64(z * -4.5) / a)); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (y <= -3.6e-57)
tmp = 0.5 * (x * (y / a));
elseif (y <= -1.1e-195)
tmp = -4.5 * (z * (t / a));
elseif (y <= -1e-198)
tmp = 0.5 * (y * (x / a));
elseif (y <= 9e+45)
tmp = t * ((z * -4.5) / a);
else
tmp = 0.5 * (x / (a / y));
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, -3.6e-57], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.1e-195], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1e-198], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9e+45], N[(t * N[(N[(z * -4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.6 \cdot 10^{-57}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-195}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;y \leq -1 \cdot 10^{-198}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;y \leq 9 \cdot 10^{+45}:\\
\;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if y < -3.6000000000000002e-57Initial 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.1%
associate-/r/92.0%
*-commutative92.0%
sub-neg92.0%
+-commutative92.0%
neg-sub092.0%
associate-+l-92.0%
sub0-neg92.0%
distribute-lft-neg-out92.0%
distribute-rgt-neg-in92.0%
Simplified92.0%
Taylor expanded in x around inf 58.0%
associate-/l*63.9%
associate-/r/60.0%
Applied egg-rr60.0%
if -3.6000000000000002e-57 < y < -1.10000000000000003e-195Initial program 87.5%
sub-neg87.5%
+-commutative87.5%
neg-sub087.5%
associate-+l-87.5%
sub0-neg87.5%
neg-mul-187.5%
associate-/l*86.3%
associate-/r/87.4%
*-commutative87.4%
sub-neg87.4%
+-commutative87.4%
neg-sub087.4%
associate-+l-87.4%
sub0-neg87.4%
distribute-lft-neg-out87.4%
distribute-rgt-neg-in87.4%
Simplified87.4%
Taylor expanded in x around 0 58.8%
associate-/l*62.8%
associate-/r/65.9%
Simplified65.9%
if -1.10000000000000003e-195 < y < -9.9999999999999991e-199Initial program 99.5%
sub-neg99.5%
+-commutative99.5%
neg-sub099.5%
associate-+l-99.5%
sub0-neg99.5%
neg-mul-199.5%
associate-/l*78.8%
associate-/r/100.0%
*-commutative100.0%
sub-neg100.0%
+-commutative100.0%
neg-sub0100.0%
associate-+l-100.0%
sub0-neg100.0%
distribute-lft-neg-out100.0%
distribute-rgt-neg-in100.0%
Simplified100.0%
associate-*r/99.5%
clear-num78.8%
*-commutative78.8%
Applied egg-rr78.8%
Taylor expanded in x around inf 99.5%
associate-*r/100.0%
Simplified100.0%
if -9.9999999999999991e-199 < y < 8.9999999999999997e45Initial program 93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
neg-mul-193.2%
associate-/l*93.2%
associate-/r/93.2%
*-commutative93.2%
sub-neg93.2%
+-commutative93.2%
neg-sub093.2%
associate-+l-93.2%
sub0-neg93.2%
distribute-lft-neg-out93.2%
distribute-rgt-neg-in93.2%
Simplified94.1%
Taylor expanded in x around 0 69.8%
*-commutative69.8%
associate-*l*69.8%
Simplified69.8%
expm1-log1p-u44.9%
expm1-udef31.4%
associate-*l*32.8%
Applied egg-rr32.8%
expm1-def43.7%
expm1-log1p71.6%
associate-*l*71.5%
associate-*r/71.6%
metadata-eval71.6%
Simplified71.6%
associate-*r/71.6%
Applied egg-rr71.6%
if 8.9999999999999997e45 < y Initial program 89.3%
sub-neg89.3%
+-commutative89.3%
neg-sub089.3%
associate-+l-89.3%
sub0-neg89.3%
neg-mul-189.3%
associate-/l*89.3%
associate-/r/89.1%
*-commutative89.1%
sub-neg89.1%
+-commutative89.1%
neg-sub089.1%
associate-+l-89.1%
sub0-neg89.1%
distribute-lft-neg-out89.1%
distribute-rgt-neg-in89.1%
Simplified89.1%
Taylor expanded in x around inf 66.3%
associate-/l*70.6%
associate-/r/72.2%
Applied egg-rr72.2%
*-commutative72.2%
clear-num72.2%
un-div-inv72.2%
Applied egg-rr72.2%
Final simplification68.8%
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 91.6%
sub-neg91.6%
+-commutative91.6%
neg-sub091.6%
associate-+l-91.6%
sub0-neg91.6%
neg-mul-191.6%
associate-/l*91.2%
associate-/r/91.5%
*-commutative91.5%
sub-neg91.5%
+-commutative91.5%
neg-sub091.5%
associate-+l-91.5%
sub0-neg91.5%
distribute-lft-neg-out91.5%
distribute-rgt-neg-in91.5%
Simplified91.8%
Taylor expanded in x around 0 51.8%
associate-/l*51.8%
associate-/r/51.7%
Simplified51.7%
Taylor expanded in t around 0 51.8%
*-lft-identity51.8%
times-frac52.2%
/-rgt-identity52.2%
Simplified52.2%
Final simplification52.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(x < y);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / 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) * (z * (t / a))
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y] = sort([x, y]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y = sort([x, y]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / 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[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 91.6%
sub-neg91.6%
+-commutative91.6%
neg-sub091.6%
associate-+l-91.6%
sub0-neg91.6%
neg-mul-191.6%
associate-/l*91.2%
associate-/r/91.5%
*-commutative91.5%
sub-neg91.5%
+-commutative91.5%
neg-sub091.5%
associate-+l-91.5%
sub0-neg91.5%
distribute-lft-neg-out91.5%
distribute-rgt-neg-in91.5%
Simplified91.8%
Taylor expanded in x around 0 51.8%
associate-/l*51.8%
associate-/r/51.7%
Simplified51.7%
Final simplification51.7%
(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 2023217
(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)))