
(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 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 -1e+264) (not (<= t_1 2e+301)))
(fma (* z (/ 0.5 a)) (* t -9.0) (* 0.5 (/ y (/ a x))))
(/ t_1 (* a 2.0)))))assert(z < t);
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 <= -1e+264) || !(t_1 <= 2e+301)) {
tmp = fma((z * (0.5 / a)), (t * -9.0), (0.5 * (y / (a / x))));
} else {
tmp = t_1 / (a * 2.0);
}
return tmp;
}
z, t = sort([z, t]) 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 <= -1e+264) || !(t_1 <= 2e+301)) tmp = fma(Float64(z * Float64(0.5 / a)), Float64(t * -9.0), Float64(0.5 * Float64(y / Float64(a / x)))); else tmp = Float64(t_1 / Float64(a * 2.0)); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+264], N[Not[LessEqual[t$95$1, 2e+301]], $MachinePrecision]], N[(N[(z * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] * N[(t * -9.0), $MachinePrecision] + N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -1 \cdot 10^{+264} \lor \neg \left(t_1 \leq 2 \cdot 10^{+301}\right):\\
\;\;\;\;\mathsf{fma}\left(z \cdot \frac{0.5}{a}, t \cdot -9, 0.5 \cdot \frac{y}{\frac{a}{x}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -1.00000000000000004e264 or 2.00000000000000011e301 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 67.2%
associate-*l*68.5%
Simplified68.5%
sub-neg68.5%
+-commutative68.5%
distribute-rgt-neg-in68.5%
distribute-lft-neg-in68.5%
metadata-eval68.5%
*-commutative68.5%
associate-*r*68.4%
fma-def68.4%
Applied egg-rr68.4%
div-inv68.4%
metadata-eval68.4%
div-inv68.4%
clear-num68.4%
*-commutative68.4%
*-commutative68.4%
fma-def68.4%
*-commutative68.4%
+-commutative68.4%
*-commutative68.4%
+-commutative68.4%
distribute-lft-in64.2%
*-commutative64.2%
associate-*r*64.3%
*-commutative64.3%
*-commutative64.3%
associate-*r*75.9%
fma-def75.9%
associate-*l/75.9%
Applied egg-rr92.9%
if -1.00000000000000004e264 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 2.00000000000000011e301Initial program 98.8%
Final simplification97.1%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) (- INFINITY))
(* 0.5 (* y (/ x a)))
(if (<= (* x y) 5e+260)
(/ (fma (* z t) -9.0 (* x y)) (* a 2.0))
(/ (* y 0.5) (/ a x)))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e+260) {
tmp = fma((z * t), -9.0, (x * y)) / (a * 2.0);
} else {
tmp = (y * 0.5) / (a / x);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (Float64(x * y) <= 5e+260) tmp = Float64(fma(Float64(z * t), -9.0, Float64(x * y)) / Float64(a * 2.0)); else tmp = Float64(Float64(y * 0.5) / Float64(a / x)); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+260], N[(N[(N[(z * t), $MachinePrecision] * -9.0 + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+260}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot t, -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 68.4%
sub-neg68.4%
+-commutative68.4%
neg-sub068.4%
associate-+l-68.4%
sub0-neg68.4%
neg-mul-168.4%
associate-/l*68.4%
associate-/r/68.4%
*-commutative68.4%
sub-neg68.4%
+-commutative68.4%
neg-sub068.4%
associate-+l-68.4%
sub0-neg68.4%
distribute-lft-neg-out68.4%
distribute-rgt-neg-in68.4%
Simplified68.4%
Taylor expanded in x around inf 68.4%
expm1-log1p-u28.4%
expm1-udef28.4%
associate-/l*37.6%
Applied egg-rr37.6%
expm1-def37.6%
expm1-log1p99.8%
associate-/l*68.4%
associate-*r/99.9%
Simplified99.9%
if -inf.0 < (*.f64 x y) < 4.9999999999999996e260Initial program 93.8%
associate-*l*93.9%
Simplified93.9%
sub-neg93.9%
+-commutative93.9%
distribute-rgt-neg-in93.9%
distribute-lft-neg-in93.9%
metadata-eval93.9%
*-commutative93.9%
associate-*r*94.3%
fma-def94.3%
Applied egg-rr94.3%
if 4.9999999999999996e260 < (*.f64 x y) Initial program 63.0%
associate-*l*63.0%
Simplified63.0%
sub-neg63.0%
+-commutative63.0%
distribute-rgt-neg-in63.0%
distribute-lft-neg-in63.0%
metadata-eval63.0%
*-commutative63.0%
associate-*r*63.0%
fma-def63.0%
Applied egg-rr63.0%
Taylor expanded in z around 0 63.0%
associate-/l*99.8%
associate-*r/99.8%
Simplified99.8%
Final simplification95.1%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= (* x y) (- INFINITY)) (not (<= (* x y) 1e+214))) (* 0.5 (* y (/ x a))) (* (/ 0.5 a) (+ (* x y) (* -9.0 (* z t))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) <= -((double) INFINITY)) || !((x * y) <= 1e+214)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
}
return tmp;
}
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) <= -Double.POSITIVE_INFINITY) || !((x * y) <= 1e+214)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if ((x * y) <= -math.inf) or not ((x * y) <= 1e+214): tmp = 0.5 * (y * (x / a)) else: tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t))) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((Float64(x * y) <= Float64(-Inf)) || !(Float64(x * y) <= 1e+214)) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(-9.0 * Float64(z * t)))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (((x * y) <= -Inf) || ~(((x * y) <= 1e+214)))
tmp = 0.5 * (y * (x / a));
else
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[Not[LessEqual[N[(x * y), $MachinePrecision], 1e+214]], $MachinePrecision]], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty \lor \neg \left(x \cdot y \leq 10^{+214}\right):\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + -9 \cdot \left(z \cdot t\right)\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0 or 9.9999999999999995e213 < (*.f64 x y) Initial program 72.0%
sub-neg72.0%
+-commutative72.0%
neg-sub072.0%
associate-+l-72.0%
sub0-neg72.0%
neg-mul-172.0%
associate-/l*71.9%
associate-/r/71.9%
*-commutative71.9%
sub-neg71.9%
+-commutative71.9%
neg-sub071.9%
associate-+l-71.9%
sub0-neg71.9%
distribute-lft-neg-out71.9%
distribute-rgt-neg-in71.9%
Simplified71.9%
Taylor expanded in x around inf 72.0%
expm1-log1p-u34.0%
expm1-udef31.9%
associate-/l*41.5%
Applied egg-rr41.5%
expm1-def43.7%
expm1-log1p99.8%
associate-/l*72.0%
associate-*r/99.8%
Simplified99.8%
if -inf.0 < (*.f64 x y) < 9.9999999999999995e213Initial program 93.6%
sub-neg93.6%
+-commutative93.6%
neg-sub093.6%
associate-+l-93.6%
sub0-neg93.6%
neg-mul-193.6%
associate-/l*93.6%
associate-/r/93.5%
*-commutative93.5%
sub-neg93.5%
+-commutative93.5%
neg-sub093.5%
associate-+l-93.5%
sub0-neg93.5%
distribute-lft-neg-out93.5%
distribute-rgt-neg-in93.5%
Simplified93.5%
Taylor expanded in x around 0 93.9%
Final simplification94.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) -4e+123) (* 0.5 (* y (/ x a))) (if (<= (* x y) 5e+29) (* -4.5 (/ t (/ a z))) (* (/ y a) (* x 0.5)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -4e+123) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e+29) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = (y / a) * (x * 0.5);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-4d+123)) then
tmp = 0.5d0 * (y * (x / a))
else if ((x * y) <= 5d+29) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = (y / a) * (x * 0.5d0)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -4e+123) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e+29) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = (y / a) * (x * 0.5);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -4e+123: tmp = 0.5 * (y * (x / a)) elif (x * y) <= 5e+29: tmp = -4.5 * (t / (a / z)) else: tmp = (y / a) * (x * 0.5) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -4e+123) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (Float64(x * y) <= 5e+29) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(Float64(y / a) * Float64(x * 0.5)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -4e+123)
tmp = 0.5 * (y * (x / a));
elseif ((x * y) <= 5e+29)
tmp = -4.5 * (t / (a / z));
else
tmp = (y / a) * (x * 0.5);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -4e+123], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+29], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+123}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+29}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -3.99999999999999991e123Initial program 85.2%
sub-neg85.2%
+-commutative85.2%
neg-sub085.2%
associate-+l-85.2%
sub0-neg85.2%
neg-mul-185.2%
associate-/l*85.2%
associate-/r/85.1%
*-commutative85.1%
sub-neg85.1%
+-commutative85.1%
neg-sub085.1%
associate-+l-85.1%
sub0-neg85.1%
distribute-lft-neg-out85.1%
distribute-rgt-neg-in85.1%
Simplified85.1%
Taylor expanded in x around inf 78.7%
expm1-log1p-u28.9%
expm1-udef22.5%
associate-/l*26.2%
Applied egg-rr26.2%
expm1-def30.5%
expm1-log1p88.2%
associate-/l*78.7%
associate-*r/87.1%
Simplified87.1%
if -3.99999999999999991e123 < (*.f64 x y) < 5.0000000000000001e29Initial program 92.8%
associate-*l*92.8%
Simplified92.8%
sub-neg92.8%
+-commutative92.8%
distribute-rgt-neg-in92.8%
distribute-lft-neg-in92.8%
metadata-eval92.8%
*-commutative92.8%
associate-*r*93.3%
fma-def93.3%
Applied egg-rr93.3%
Taylor expanded in z around inf 74.3%
associate-/l*71.9%
Simplified71.9%
if 5.0000000000000001e29 < (*.f64 x y) Initial program 85.0%
associate-*l*85.0%
Simplified85.0%
sub-neg85.0%
+-commutative85.0%
distribute-rgt-neg-in85.0%
distribute-lft-neg-in85.0%
metadata-eval85.0%
*-commutative85.0%
associate-*r*85.0%
fma-def85.0%
Applied egg-rr85.0%
Taylor expanded in z around 0 77.7%
associate-/l*85.1%
associate-*r/85.1%
Simplified85.1%
*-commutative85.1%
associate-*l/85.1%
associate-/r/82.1%
associate-*l*82.1%
Applied egg-rr82.1%
Final simplification76.6%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= y -2.2e-42) (not (<= y 2.6e+69))) (* 0.5 (* y (/ x a))) (* -4.5 (/ t (/ a z)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y <= -2.2e-42) || !(y <= 2.6e+69)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((y <= (-2.2d-42)) .or. (.not. (y <= 2.6d+69))) then
tmp = 0.5d0 * (y * (x / a))
else
tmp = (-4.5d0) * (t / (a / z))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y <= -2.2e-42) || !(y <= 2.6e+69)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (y <= -2.2e-42) or not (y <= 2.6e+69): tmp = 0.5 * (y * (x / a)) else: tmp = -4.5 * (t / (a / z)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((y <= -2.2e-42) || !(y <= 2.6e+69)) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((y <= -2.2e-42) || ~((y <= 2.6e+69)))
tmp = 0.5 * (y * (x / a));
else
tmp = -4.5 * (t / (a / z));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -2.2e-42], N[Not[LessEqual[y, 2.6e+69]], $MachinePrecision]], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.2 \cdot 10^{-42} \lor \neg \left(y \leq 2.6 \cdot 10^{+69}\right):\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if y < -2.20000000000000005e-42 or 2.6000000000000002e69 < y Initial program 86.0%
sub-neg86.0%
+-commutative86.0%
neg-sub086.0%
associate-+l-86.0%
sub0-neg86.0%
neg-mul-186.0%
associate-/l*86.0%
associate-/r/85.9%
*-commutative85.9%
sub-neg85.9%
+-commutative85.9%
neg-sub085.9%
associate-+l-85.9%
sub0-neg85.9%
distribute-lft-neg-out85.9%
distribute-rgt-neg-in85.9%
Simplified85.1%
Taylor expanded in x around inf 62.5%
expm1-log1p-u34.5%
expm1-udef26.1%
associate-/l*29.7%
Applied egg-rr29.7%
expm1-def35.6%
expm1-log1p69.7%
associate-/l*62.5%
associate-*r/70.4%
Simplified70.4%
if -2.20000000000000005e-42 < y < 2.6000000000000002e69Initial program 93.2%
associate-*l*93.9%
Simplified93.9%
sub-neg93.9%
+-commutative93.9%
distribute-rgt-neg-in93.9%
distribute-lft-neg-in93.9%
metadata-eval93.9%
*-commutative93.9%
associate-*r*93.8%
fma-def93.8%
Applied egg-rr93.8%
Taylor expanded in z around inf 70.7%
associate-/l*69.4%
Simplified69.4%
Final simplification69.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (z * (t / a))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 89.9%
sub-neg89.9%
+-commutative89.9%
neg-sub089.9%
associate-+l-89.9%
sub0-neg89.9%
neg-mul-189.9%
associate-/l*89.8%
associate-/r/89.8%
*-commutative89.8%
sub-neg89.8%
+-commutative89.8%
neg-sub089.8%
associate-+l-89.8%
sub0-neg89.8%
distribute-lft-neg-out89.8%
distribute-rgt-neg-in89.8%
Simplified89.8%
Taylor expanded in x around 0 52.4%
associate-/l*52.0%
associate-/r/54.0%
Simplified54.0%
Final simplification54.0%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (/ t (/ a z))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (t / (a / z))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (t / (a / z))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t / Float64(a / z))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t / (a / z));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \frac{t}{\frac{a}{z}}
\end{array}
Initial program 89.9%
associate-*l*89.9%
Simplified89.9%
sub-neg89.9%
+-commutative89.9%
distribute-rgt-neg-in89.9%
distribute-lft-neg-in89.9%
metadata-eval89.9%
*-commutative89.9%
associate-*r*90.3%
fma-def90.3%
Applied egg-rr90.3%
Taylor expanded in z around inf 52.4%
associate-/l*52.0%
Simplified52.0%
Final simplification52.0%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2023196
(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)))