
(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: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* a 2.0) -5000.0) (fma -4.5 (/ t (/ a z)) (* (* (/ 0.5 a) x) y)) (/ (- (* x y) (* (* t z) 9.0)) (* a 2.0))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((a * 2.0) <= -5000.0) {
tmp = fma(-4.5, (t / (a / z)), (((0.5 / a) * x) * y));
} else {
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(a * 2.0) <= -5000.0) tmp = fma(-4.5, Float64(t / Float64(a / z)), Float64(Float64(Float64(0.5 / a) * x) * y)); else tmp = Float64(Float64(Float64(x * y) - Float64(Float64(t * z) * 9.0)) / 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_] := If[LessEqual[N[(a * 2.0), $MachinePrecision], -5000.0], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(0.5 / a), $MachinePrecision] * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(t * z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;a \cdot 2 \leq -5000:\\
\;\;\;\;\mathsf{fma}\left(-4.5, \frac{t}{\frac{a}{z}}, \left(\frac{0.5}{a} \cdot x\right) \cdot y\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - \left(t \cdot z\right) \cdot 9}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 a 2) < -5e3Initial program 87.1%
sub-neg87.1%
+-commutative87.1%
neg-sub087.1%
associate-+l-87.1%
sub0-neg87.1%
neg-mul-187.1%
associate-/l*87.1%
associate-/r/87.0%
*-commutative87.0%
sub-neg87.0%
+-commutative87.0%
neg-sub087.0%
associate-+l-87.0%
sub0-neg87.0%
distribute-lft-neg-out87.0%
distribute-rgt-neg-in87.0%
Simplified87.0%
Taylor expanded in x around 0 87.2%
fma-def87.2%
associate-/l*87.2%
associate-*r/87.2%
*-commutative87.2%
associate-*l/87.1%
associate-*r*95.5%
Simplified95.5%
if -5e3 < (*.f64 a 2) Initial program 96.3%
associate-*l*96.8%
Simplified96.8%
Taylor expanded in z around 0 96.8%
*-commutative96.8%
Simplified96.8%
Final simplification96.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* t (* z 9.0)) 1e+263) (/ (- (* x y) (* (* t z) 9.0)) (* a 2.0)) (* -4.5 (* z (/ t a)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t * (z * 9.0)) <= 1e+263) {
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((t * (z * 9.0d0)) <= 1d+263) then
tmp = ((x * y) - ((t * z) * 9.0d0)) / (a * 2.0d0)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t * (z * 9.0)) <= 1e+263) {
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (t * (z * 9.0)) <= 1e+263: tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0) else: tmp = -4.5 * (z * (t / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(t * Float64(z * 9.0)) <= 1e+263) tmp = Float64(Float64(Float64(x * y) - Float64(Float64(t * z) * 9.0)) / Float64(a * 2.0)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((t * (z * 9.0)) <= 1e+263)
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision], 1e+263], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(t * z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq 10^{+263}:\\
\;\;\;\;\frac{x \cdot y - \left(t \cdot z\right) \cdot 9}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < 1.00000000000000002e263Initial program 95.6%
associate-*l*96.0%
Simplified96.0%
Taylor expanded in z around 0 96.1%
*-commutative96.1%
Simplified96.1%
if 1.00000000000000002e263 < (*.f64 (*.f64 z 9) t) Initial program 76.2%
sub-neg76.2%
+-commutative76.2%
neg-sub076.2%
associate-+l-76.2%
sub0-neg76.2%
neg-mul-176.2%
associate-/l*76.2%
associate-/r/76.2%
*-commutative76.2%
sub-neg76.2%
+-commutative76.2%
neg-sub076.2%
associate-+l-76.2%
sub0-neg76.2%
distribute-lft-neg-out76.2%
distribute-rgt-neg-in76.2%
Simplified76.2%
Taylor expanded in x around 0 76.2%
associate-/l*99.8%
Simplified99.8%
associate-/r/99.9%
Applied egg-rr99.9%
Final simplification96.4%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* a 2.0) -1e-47) (+ (* -4.5 (/ (* t z) a)) (* 0.5 (* y (/ x a)))) (/ (- (* x y) (* (* t z) 9.0)) (* a 2.0))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((a * 2.0) <= -1e-47) {
tmp = (-4.5 * ((t * z) / a)) + (0.5 * (y * (x / a)));
} else {
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
}
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 ((a * 2.0d0) <= (-1d-47)) then
tmp = ((-4.5d0) * ((t * z) / a)) + (0.5d0 * (y * (x / a)))
else
tmp = ((x * y) - ((t * z) * 9.0d0)) / (a * 2.0d0)
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 ((a * 2.0) <= -1e-47) {
tmp = (-4.5 * ((t * z) / a)) + (0.5 * (y * (x / a)));
} else {
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (a * 2.0) <= -1e-47: tmp = (-4.5 * ((t * z) / a)) + (0.5 * (y * (x / a))) else: tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(a * 2.0) <= -1e-47) tmp = Float64(Float64(-4.5 * Float64(Float64(t * z) / a)) + Float64(0.5 * Float64(y * Float64(x / a)))); else tmp = Float64(Float64(Float64(x * y) - Float64(Float64(t * z) * 9.0)) / Float64(a * 2.0)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((a * 2.0) <= -1e-47)
tmp = (-4.5 * ((t * z) / a)) + (0.5 * (y * (x / a)));
else
tmp = ((x * y) - ((t * z) * 9.0)) / (a * 2.0);
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[(a * 2.0), $MachinePrecision], -1e-47], N[(N[(-4.5 * N[(N[(t * z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(t * z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;a \cdot 2 \leq -1 \cdot 10^{-47}:\\
\;\;\;\;-4.5 \cdot \frac{t \cdot z}{a} + 0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - \left(t \cdot z\right) \cdot 9}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 a 2) < -9.9999999999999997e-48Initial program 88.1%
sub-neg88.1%
+-commutative88.1%
neg-sub088.1%
associate-+l-88.1%
sub0-neg88.1%
neg-mul-188.1%
associate-/l*88.1%
associate-/r/88.0%
*-commutative88.0%
sub-neg88.0%
+-commutative88.0%
neg-sub088.0%
associate-+l-88.0%
sub0-neg88.0%
distribute-lft-neg-out88.0%
distribute-rgt-neg-in88.0%
Simplified88.0%
Taylor expanded in x around 0 88.2%
expm1-log1p-u70.9%
expm1-udef54.8%
associate-/l*58.2%
Applied egg-rr58.2%
expm1-def74.3%
expm1-log1p95.8%
associate-/l*88.2%
associate-*r/95.9%
Simplified95.9%
if -9.9999999999999997e-48 < (*.f64 a 2) Initial program 96.2%
associate-*l*96.7%
Simplified96.7%
Taylor expanded in z around 0 96.7%
*-commutative96.7%
Simplified96.7%
Final simplification96.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* z (* t 9.0))) (* a 2.0)))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
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 = ((x * y) - (z * (t * 9.0d0))) / (a * 2.0d0)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return ((x * y) - (z * (t * 9.0))) / (a * 2.0)
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}
\end{array}
Initial program 93.9%
associate-*l*94.2%
Simplified94.2%
Final simplification94.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -2.75e+26) (* -4.5 (/ (* t z) a)) (if (<= z 1.32e-92) (* 0.5 (/ (* x y) a)) (* -4.5 (/ t (/ a z))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.75e+26) {
tmp = -4.5 * ((t * z) / a);
} else if (z <= 1.32e-92) {
tmp = 0.5 * ((x * y) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-2.75d+26)) then
tmp = (-4.5d0) * ((t * z) / a)
else if (z <= 1.32d-92) then
tmp = 0.5d0 * ((x * y) / a)
else
tmp = (-4.5d0) * (t / (a / z))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.75e+26) {
tmp = -4.5 * ((t * z) / a);
} else if (z <= 1.32e-92) {
tmp = 0.5 * ((x * y) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -2.75e+26: tmp = -4.5 * ((t * z) / a) elif z <= 1.32e-92: tmp = 0.5 * ((x * y) / a) else: tmp = -4.5 * (t / (a / z)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -2.75e+26) tmp = Float64(-4.5 * Float64(Float64(t * z) / a)); elseif (z <= 1.32e-92) tmp = Float64(0.5 * Float64(Float64(x * y) / a)); else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -2.75e+26)
tmp = -4.5 * ((t * z) / a);
elseif (z <= 1.32e-92)
tmp = 0.5 * ((x * y) / a);
else
tmp = -4.5 * (t / (a / z));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.75e+26], N[(-4.5 * N[(N[(t * z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.32e-92], N[(0.5 * N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.75 \cdot 10^{+26}:\\
\;\;\;\;-4.5 \cdot \frac{t \cdot z}{a}\\
\mathbf{elif}\;z \leq 1.32 \cdot 10^{-92}:\\
\;\;\;\;0.5 \cdot \frac{x \cdot y}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if z < -2.7499999999999998e26Initial program 93.4%
sub-neg93.4%
+-commutative93.4%
neg-sub093.4%
associate-+l-93.4%
sub0-neg93.4%
neg-mul-193.4%
associate-/l*93.5%
associate-/r/93.3%
*-commutative93.3%
sub-neg93.3%
+-commutative93.3%
neg-sub093.3%
associate-+l-93.3%
sub0-neg93.3%
distribute-lft-neg-out93.3%
distribute-rgt-neg-in93.3%
Simplified94.9%
Taylor expanded in x around 0 72.4%
if -2.7499999999999998e26 < z < 1.3200000000000001e-92Initial program 96.9%
sub-neg96.9%
+-commutative96.9%
neg-sub096.9%
associate-+l-96.9%
sub0-neg96.9%
neg-mul-196.9%
associate-/l*96.8%
associate-/r/96.8%
*-commutative96.8%
sub-neg96.8%
+-commutative96.8%
neg-sub096.8%
associate-+l-96.8%
sub0-neg96.8%
distribute-lft-neg-out96.8%
distribute-rgt-neg-in96.8%
Simplified96.8%
Taylor expanded in x around inf 73.8%
if 1.3200000000000001e-92 < z Initial program 90.6%
sub-neg90.6%
+-commutative90.6%
neg-sub090.6%
associate-+l-90.6%
sub0-neg90.6%
neg-mul-190.6%
associate-/l*90.5%
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 0 63.6%
associate-/l*65.6%
Simplified65.6%
Final simplification70.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -1.48e+26) (* -4.5 (/ (* t z) a)) (if (<= z 2.4e-129) (* y (/ (* 0.5 x) a)) (* -4.5 (/ t (/ a z))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.48e+26) {
tmp = -4.5 * ((t * z) / a);
} else if (z <= 2.4e-129) {
tmp = y * ((0.5 * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-1.48d+26)) then
tmp = (-4.5d0) * ((t * z) / a)
else if (z <= 2.4d-129) then
tmp = y * ((0.5d0 * x) / a)
else
tmp = (-4.5d0) * (t / (a / z))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.48e+26) {
tmp = -4.5 * ((t * z) / a);
} else if (z <= 2.4e-129) {
tmp = y * ((0.5 * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -1.48e+26: tmp = -4.5 * ((t * z) / a) elif z <= 2.4e-129: tmp = y * ((0.5 * x) / a) else: tmp = -4.5 * (t / (a / z)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -1.48e+26) tmp = Float64(-4.5 * Float64(Float64(t * z) / a)); elseif (z <= 2.4e-129) tmp = Float64(y * Float64(Float64(0.5 * x) / a)); else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -1.48e+26)
tmp = -4.5 * ((t * z) / a);
elseif (z <= 2.4e-129)
tmp = y * ((0.5 * x) / a);
else
tmp = -4.5 * (t / (a / z));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.48e+26], N[(-4.5 * N[(N[(t * z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.4e-129], N[(y * N[(N[(0.5 * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.48 \cdot 10^{+26}:\\
\;\;\;\;-4.5 \cdot \frac{t \cdot z}{a}\\
\mathbf{elif}\;z \leq 2.4 \cdot 10^{-129}:\\
\;\;\;\;y \cdot \frac{0.5 \cdot x}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if z < -1.48e26Initial program 93.4%
sub-neg93.4%
+-commutative93.4%
neg-sub093.4%
associate-+l-93.4%
sub0-neg93.4%
neg-mul-193.4%
associate-/l*93.5%
associate-/r/93.3%
*-commutative93.3%
sub-neg93.3%
+-commutative93.3%
neg-sub093.3%
associate-+l-93.3%
sub0-neg93.3%
distribute-lft-neg-out93.3%
distribute-rgt-neg-in93.3%
Simplified94.9%
Taylor expanded in x around 0 72.4%
if -1.48e26 < z < 2.39999999999999989e-129Initial program 96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
neg-mul-196.7%
associate-/l*96.5%
associate-/r/96.6%
*-commutative96.6%
sub-neg96.6%
+-commutative96.6%
neg-sub096.6%
associate-+l-96.6%
sub0-neg96.6%
distribute-lft-neg-out96.6%
distribute-rgt-neg-in96.6%
Simplified96.5%
Taylor expanded in x around inf 74.4%
associate-*r/74.4%
*-commutative74.4%
associate-*l/74.3%
associate-*r*72.4%
*-commutative72.4%
associate-*l/72.5%
Simplified72.5%
if 2.39999999999999989e-129 < z Initial program 91.4%
sub-neg91.4%
+-commutative91.4%
neg-sub091.4%
associate-+l-91.4%
sub0-neg91.4%
neg-mul-191.4%
associate-/l*91.3%
associate-/r/91.3%
*-commutative91.3%
sub-neg91.3%
+-commutative91.3%
neg-sub091.3%
associate-+l-91.3%
sub0-neg91.3%
distribute-lft-neg-out91.3%
distribute-rgt-neg-in91.3%
Simplified91.3%
Taylor expanded in x around 0 60.5%
associate-/l*61.4%
Simplified61.4%
Final simplification68.1%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -4.4e+26) (/ 1.0 (/ a (* -4.5 (* t z)))) (if (<= z 4.2e-127) (* y (/ (* 0.5 x) a)) (* -4.5 (/ t (/ a z))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.4e+26) {
tmp = 1.0 / (a / (-4.5 * (t * z)));
} else if (z <= 4.2e-127) {
tmp = y * ((0.5 * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z <= (-4.4d+26)) then
tmp = 1.0d0 / (a / ((-4.5d0) * (t * z)))
else if (z <= 4.2d-127) then
tmp = y * ((0.5d0 * x) / a)
else
tmp = (-4.5d0) * (t / (a / z))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.4e+26) {
tmp = 1.0 / (a / (-4.5 * (t * z)));
} else if (z <= 4.2e-127) {
tmp = y * ((0.5 * x) / a);
} else {
tmp = -4.5 * (t / (a / z));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if z <= -4.4e+26: tmp = 1.0 / (a / (-4.5 * (t * z))) elif z <= 4.2e-127: tmp = y * ((0.5 * x) / a) else: tmp = -4.5 * (t / (a / z)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -4.4e+26) tmp = Float64(1.0 / Float64(a / Float64(-4.5 * Float64(t * z)))); elseif (z <= 4.2e-127) tmp = Float64(y * Float64(Float64(0.5 * x) / a)); else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -4.4e+26)
tmp = 1.0 / (a / (-4.5 * (t * z)));
elseif (z <= 4.2e-127)
tmp = y * ((0.5 * x) / a);
else
tmp = -4.5 * (t / (a / z));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -4.4e+26], N[(1.0 / N[(a / N[(-4.5 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.2e-127], N[(y * N[(N[(0.5 * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.4 \cdot 10^{+26}:\\
\;\;\;\;\frac{1}{\frac{a}{-4.5 \cdot \left(t \cdot z\right)}}\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-127}:\\
\;\;\;\;y \cdot \frac{0.5 \cdot x}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if z < -4.40000000000000014e26Initial program 93.4%
sub-neg93.4%
+-commutative93.4%
neg-sub093.4%
associate-+l-93.4%
sub0-neg93.4%
neg-mul-193.4%
associate-/l*93.5%
associate-/r/93.3%
*-commutative93.3%
sub-neg93.3%
+-commutative93.3%
neg-sub093.3%
associate-+l-93.3%
sub0-neg93.3%
distribute-lft-neg-out93.3%
distribute-rgt-neg-in93.3%
Simplified94.9%
Taylor expanded in x around 0 72.4%
associate-/l*70.4%
Simplified70.4%
associate-/r/66.6%
Applied egg-rr66.6%
associate-*l/72.4%
associate-*r/72.5%
clear-num72.6%
*-commutative72.6%
Applied egg-rr72.6%
if -4.40000000000000014e26 < z < 4.2000000000000002e-127Initial program 96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
neg-mul-196.7%
associate-/l*96.5%
associate-/r/96.6%
*-commutative96.6%
sub-neg96.6%
+-commutative96.6%
neg-sub096.6%
associate-+l-96.6%
sub0-neg96.6%
distribute-lft-neg-out96.6%
distribute-rgt-neg-in96.6%
Simplified96.5%
Taylor expanded in x around inf 74.4%
associate-*r/74.4%
*-commutative74.4%
associate-*l/74.3%
associate-*r*72.4%
*-commutative72.4%
associate-*l/72.5%
Simplified72.5%
if 4.2000000000000002e-127 < z Initial program 91.4%
sub-neg91.4%
+-commutative91.4%
neg-sub091.4%
associate-+l-91.4%
sub0-neg91.4%
neg-mul-191.4%
associate-/l*91.3%
associate-/r/91.3%
*-commutative91.3%
sub-neg91.3%
+-commutative91.3%
neg-sub091.3%
associate-+l-91.3%
sub0-neg91.3%
distribute-lft-neg-out91.3%
distribute-rgt-neg-in91.3%
Simplified91.3%
Taylor expanded in x around 0 60.5%
associate-/l*61.4%
Simplified61.4%
Final simplification68.2%
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 93.9%
sub-neg93.9%
+-commutative93.9%
neg-sub093.9%
associate-+l-93.9%
sub0-neg93.9%
neg-mul-193.9%
associate-/l*93.8%
associate-/r/93.8%
*-commutative93.8%
sub-neg93.8%
+-commutative93.8%
neg-sub093.8%
associate-+l-93.8%
sub0-neg93.8%
distribute-lft-neg-out93.8%
distribute-rgt-neg-in93.8%
Simplified94.1%
Taylor expanded in x around 0 52.5%
associate-/l*50.9%
Simplified50.9%
associate-/r/51.0%
Applied egg-rr51.0%
Final simplification51.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 93.9%
sub-neg93.9%
+-commutative93.9%
neg-sub093.9%
associate-+l-93.9%
sub0-neg93.9%
neg-mul-193.9%
associate-/l*93.8%
associate-/r/93.8%
*-commutative93.8%
sub-neg93.8%
+-commutative93.8%
neg-sub093.8%
associate-+l-93.8%
sub0-neg93.8%
distribute-lft-neg-out93.8%
distribute-rgt-neg-in93.8%
Simplified94.1%
Taylor expanded in x around 0 52.5%
associate-/l*50.9%
Simplified50.9%
Final simplification50.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 (/ (* t z) a)))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * ((t * z) / 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) * ((t * z) / a)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * ((t * z) / a);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * ((t * z) / a)
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(Float64(t * z) / a)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * ((t * z) / 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[(N[(t * z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \frac{t \cdot z}{a}
\end{array}
Initial program 93.9%
sub-neg93.9%
+-commutative93.9%
neg-sub093.9%
associate-+l-93.9%
sub0-neg93.9%
neg-mul-193.9%
associate-/l*93.8%
associate-/r/93.8%
*-commutative93.8%
sub-neg93.8%
+-commutative93.8%
neg-sub093.8%
associate-+l-93.8%
sub0-neg93.8%
distribute-lft-neg-out93.8%
distribute-rgt-neg-in93.8%
Simplified94.1%
Taylor expanded in x around 0 52.5%
Final simplification52.5%
(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 2023230
(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)))