
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 22 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1e+78)
(/
1.0
(*
t_0
(/ (+ alpha (+ beta 3.0)) (/ (* (+ beta 1.0) (+ alpha 1.0)) t_0))))
(/
(/
(+
(+ 1.0 (+ (+ alpha (/ 1.0 beta)) (/ alpha beta)))
(* (/ (+ 4.0 (* alpha 2.0)) beta) (- -1.0 alpha)))
beta)
(+ 1.0 (+ 2.0 (+ alpha beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+78) {
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
} else {
tmp = (((1.0 + ((alpha + (1.0 / beta)) + (alpha / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+78) then
tmp = 1.0d0 / (t_0 * ((alpha + (beta + 3.0d0)) / (((beta + 1.0d0) * (alpha + 1.0d0)) / t_0)))
else
tmp = (((1.0d0 + ((alpha + (1.0d0 / beta)) + (alpha / beta))) + (((4.0d0 + (alpha * 2.0d0)) / beta) * ((-1.0d0) - alpha))) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+78) {
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
} else {
tmp = (((1.0 + ((alpha + (1.0 / beta)) + (alpha / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+78: tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0))) else: tmp = (((1.0 + ((alpha + (1.0 / beta)) + (alpha / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1e+78) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(Float64(beta + 1.0) * Float64(alpha + 1.0)) / t_0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(alpha + Float64(1.0 / beta)) + Float64(alpha / beta))) + Float64(Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta) * Float64(-1.0 - alpha))) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1e+78)
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
else
tmp = (((1.0 + ((alpha + (1.0 / beta)) + (alpha / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+78], N[(1.0 / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(N[(alpha + N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+78}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\alpha + \left(\beta + 3\right)}{\frac{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \left(\left(\alpha + \frac{1}{\beta}\right) + \frac{\alpha}{\beta}\right)\right) + \frac{4 + \alpha \cdot 2}{\beta} \cdot \left(-1 - \alpha\right)}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 1.00000000000000001e78Initial program 99.3%
associate-/l/98.3%
+-commutative98.3%
associate-+l+98.3%
*-commutative98.3%
metadata-eval98.3%
associate-+l+98.3%
metadata-eval98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
metadata-eval98.3%
metadata-eval98.3%
associate-+l+98.3%
Simplified98.3%
clear-num98.3%
inv-pow98.3%
*-commutative98.3%
associate-+r+98.3%
+-commutative98.3%
distribute-rgt1-in98.3%
fma-define98.3%
Applied egg-rr98.3%
unpow-198.3%
associate-/l*98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
fma-undefine98.7%
+-commutative98.7%
*-commutative98.7%
+-commutative98.7%
associate-+r+98.7%
distribute-lft1-in98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
if 1.00000000000000001e78 < beta Initial program 76.5%
Taylor expanded in beta around inf 78.0%
associate-+r+78.0%
associate-/l*85.9%
Simplified85.9%
Final simplification95.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(pow
(sqrt
(* (/ t_0 (+ beta 1.0)) (/ (+ alpha (+ beta 3.0)) (/ (+ alpha 1.0) t_0))))
-2.0)))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return pow(sqrt(((t_0 / (beta + 1.0)) * ((alpha + (beta + 3.0)) / ((alpha + 1.0) / t_0)))), -2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = sqrt(((t_0 / (beta + 1.0d0)) * ((alpha + (beta + 3.0d0)) / ((alpha + 1.0d0) / t_0)))) ** (-2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return Math.pow(Math.sqrt(((t_0 / (beta + 1.0)) * ((alpha + (beta + 3.0)) / ((alpha + 1.0) / t_0)))), -2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return math.pow(math.sqrt(((t_0 / (beta + 1.0)) * ((alpha + (beta + 3.0)) / ((alpha + 1.0) / t_0)))), -2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return sqrt(Float64(Float64(t_0 / Float64(beta + 1.0)) * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(alpha + 1.0) / t_0)))) ^ -2.0 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = sqrt(((t_0 / (beta + 1.0)) * ((alpha + (beta + 3.0)) / ((alpha + 1.0) / t_0)))) ^ -2.0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[Power[N[Sqrt[N[(N[(t$95$0 / N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], -2.0], $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
{\left(\sqrt{\frac{t\_0}{\beta + 1} \cdot \frac{\alpha + \left(\beta + 3\right)}{\frac{\alpha + 1}{t\_0}}}\right)}^{-2}
\end{array}
\end{array}
Initial program 93.6%
associate-/l/92.0%
+-commutative92.0%
associate-+l+92.0%
*-commutative92.0%
metadata-eval92.0%
associate-+l+92.0%
metadata-eval92.0%
+-commutative92.0%
+-commutative92.0%
+-commutative92.0%
metadata-eval92.0%
metadata-eval92.0%
associate-+l+92.0%
Simplified92.0%
clear-num92.0%
inv-pow92.0%
*-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
distribute-rgt1-in92.0%
fma-define92.0%
Applied egg-rr92.0%
unpow-192.0%
associate-/l*92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
fma-undefine92.8%
+-commutative92.8%
*-commutative92.8%
+-commutative92.8%
associate-+r+92.8%
distribute-lft1-in92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
Simplified92.8%
inv-pow92.8%
add-sqr-sqrt92.2%
unpow-prod-down91.8%
Applied egg-rr95.1%
pow-sqr95.6%
times-frac98.4%
metadata-eval98.4%
Simplified98.4%
Final simplification98.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5.8e+97)
(/
1.0
(*
t_0
(/ (+ alpha (+ beta 3.0)) (/ (* (+ beta 1.0) (+ alpha 1.0)) t_0))))
(*
(/ (+ alpha 1.0) t_0)
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.8e+97) {
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5.8d+97) then
tmp = 1.0d0 / (t_0 * ((alpha + (beta + 3.0d0)) / (((beta + 1.0d0) * (alpha + 1.0d0)) / t_0)))
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.8e+97) {
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5.8e+97: tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5.8e+97) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(Float64(beta + 1.0) * Float64(alpha + 1.0)) / t_0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5.8e+97)
tmp = 1.0 / (t_0 * ((alpha + (beta + 3.0)) / (((beta + 1.0) * (alpha + 1.0)) / t_0)));
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.8e+97], N[(1.0 / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+97}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\alpha + \left(\beta + 3\right)}{\frac{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.79999999999999974e97Initial program 97.8%
associate-/l/96.9%
+-commutative96.9%
associate-+l+96.9%
*-commutative96.9%
metadata-eval96.9%
associate-+l+96.9%
metadata-eval96.9%
+-commutative96.9%
+-commutative96.9%
+-commutative96.9%
metadata-eval96.9%
metadata-eval96.9%
associate-+l+96.9%
Simplified96.9%
clear-num96.9%
inv-pow96.9%
*-commutative96.9%
associate-+r+96.9%
+-commutative96.9%
distribute-rgt1-in96.9%
fma-define96.9%
Applied egg-rr96.9%
unpow-196.9%
associate-/l*97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
fma-undefine97.3%
+-commutative97.3%
*-commutative97.3%
+-commutative97.3%
associate-+r+97.3%
distribute-lft1-in97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
+-commutative97.3%
Simplified97.3%
if 5.79999999999999974e97 < beta Initial program 78.4%
Simplified57.7%
times-frac86.1%
+-commutative86.1%
Applied egg-rr86.1%
Taylor expanded in beta around inf 91.2%
mul-1-neg91.2%
Simplified91.2%
Final simplification96.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2.3e+86)
(/ (* (+ beta 1.0) (+ alpha 1.0)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(*
(/ (+ alpha 1.0) t_0)
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.3e+86) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2.3d+86) then
tmp = ((beta + 1.0d0) * (alpha + 1.0d0)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.3e+86) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.3e+86: tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2.3e+86) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(alpha + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.3e+86)
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.3e+86], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.3 \cdot 10^{+86}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.2999999999999999e86Initial program 98.3%
Simplified92.2%
if 2.2999999999999999e86 < beta Initial program 77.8%
Simplified58.1%
times-frac86.8%
+-commutative86.8%
Applied egg-rr86.8%
Taylor expanded in beta around inf 89.9%
mul-1-neg89.9%
Simplified89.9%
Final simplification91.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))) (t_1 (/ (+ alpha 1.0) t_0)))
(if (<= beta 2e+73)
(* t_1 (/ (+ beta 1.0) (* t_0 (+ alpha (+ beta 3.0)))))
(* t_1 (/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2e+73) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
t_1 = (alpha + 1.0d0) / t_0
if (beta <= 2d+73) then
tmp = t_1 * ((beta + 1.0d0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = t_1 * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2e+73) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = (alpha + 1.0) / t_0 tmp = 0 if beta <= 2e+73: tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) t_1 = Float64(Float64(alpha + 1.0) / t_0) tmp = 0.0 if (beta <= 2e+73) tmp = Float64(t_1 * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
t_1 = (alpha + 1.0) / t_0;
tmp = 0.0;
if (beta <= 2e+73)
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 2e+73], N[(t$95$1 * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := \frac{\alpha + 1}{t\_0}\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+73}:\\
\;\;\;\;t\_1 \cdot \frac{\beta + 1}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.99999999999999997e73Initial program 99.8%
Simplified94.0%
times-frac98.8%
+-commutative98.8%
Applied egg-rr98.8%
if 1.99999999999999997e73 < beta Initial program 75.3%
Simplified55.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 84.7%
mul-1-neg84.7%
Simplified84.7%
Final simplification95.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2100000000.0)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta))))
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2100000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2100000000.0d0) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2100000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2100000000.0: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2100000000.0) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2100000000.0)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2100000000.0], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2100000000:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.1e9Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 81.0%
+-commutative81.0%
Simplified81.0%
Taylor expanded in alpha around 0 66.0%
if 2.1e9 < beta Initial program 80.8%
Simplified63.7%
times-frac89.5%
+-commutative89.5%
Applied egg-rr89.5%
Taylor expanded in beta around inf 81.8%
mul-1-neg81.8%
Simplified81.8%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.6e+15) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ 3.0 (+ alpha beta))))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (3.0 + (alpha + beta))));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.6d+15) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * (3.0d0 + (alpha + beta))))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (3.0 + (alpha + beta))));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6e+15: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (3.0 + (alpha + beta)))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6e+15) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6e+15)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (3.0 + (alpha + beta))));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.6e+15], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+15}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.6e15Initial program 99.8%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 80.6%
+-commutative80.6%
Simplified80.6%
Taylor expanded in alpha around 0 65.6%
*-un-lft-identity65.6%
associate-+r+65.6%
+-commutative65.6%
+-commutative65.6%
*-commutative65.6%
Applied egg-rr65.6%
*-lft-identity65.6%
associate-/l/65.6%
+-commutative65.6%
+-commutative65.6%
*-commutative65.6%
+-commutative65.6%
associate-+r+65.6%
+-commutative65.6%
+-commutative65.6%
Simplified65.6%
if 1.6e15 < beta Initial program 80.5%
Taylor expanded in beta around inf 82.0%
Taylor expanded in alpha around 0 82.0%
+-commutative82.0%
associate-+r+82.0%
+-commutative82.0%
+-commutative82.0%
+-commutative82.0%
Simplified82.0%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6e+16) (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ 6.0 (* beta (+ beta 5.0)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+16) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.6d+16) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / (6.0d0 + (beta * (beta + 5.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+16) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6e+16: tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6e+16) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(6.0 + Float64(beta * Float64(beta + 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6e+16)
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.6e+16], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{6 + \beta \cdot \left(\beta + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.6e16Initial program 99.8%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 80.6%
+-commutative80.6%
Simplified80.6%
Taylor expanded in alpha around 0 64.4%
Taylor expanded in beta around 0 64.4%
+-commutative64.4%
Simplified64.4%
if 3.6e16 < beta Initial program 80.5%
Taylor expanded in beta around inf 82.0%
Taylor expanded in alpha around 0 82.0%
+-commutative82.0%
associate-+r+82.0%
+-commutative82.0%
+-commutative82.0%
+-commutative82.0%
Simplified82.0%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4e+16) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4d+16) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+16: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4e+16)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4e16Initial program 99.8%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 80.6%
+-commutative80.6%
Simplified80.6%
Taylor expanded in alpha around 0 64.4%
*-un-lft-identity64.4%
associate-/l/64.4%
+-commutative64.4%
+-commutative64.4%
Applied egg-rr64.4%
*-lft-identity64.4%
+-commutative64.4%
*-commutative64.4%
+-commutative64.4%
Simplified64.4%
if 4e16 < beta Initial program 80.5%
Taylor expanded in beta around inf 82.0%
Taylor expanded in alpha around 0 82.0%
+-commutative82.0%
associate-+r+82.0%
+-commutative82.0%
+-commutative82.0%
+-commutative82.0%
Simplified82.0%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.4d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.4], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 65.0%
Taylor expanded in beta around 0 64.6%
if 4.4000000000000004 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Final simplification69.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.7)
(+
0.08333333333333333
(*
beta
(-
(* beta (- (* beta 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.7d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * ((beta * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.7: tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * Float64(Float64(beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.7)
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.7], N[(0.08333333333333333 + N[(beta * N[(N[(beta * N[(N[(beta * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot \left(\beta \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.4%
if 1.69999999999999996 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Final simplification68.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.5)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 7.6e+158)
(/ (/ 1.0 beta) (+ beta 3.0))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 7.6e+158) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 7.6d+158) then
tmp = (1.0d0 / beta) / (beta + 3.0d0)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 7.6e+158) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 7.6e+158: tmp = (1.0 / beta) / (beta + 3.0) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 7.6e+158) tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 7.6e+158)
tmp = (1.0 / beta) / (beta + 3.0);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 7.6e+158], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 7.6 \cdot 10^{+158}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.5 < beta < 7.5999999999999997e158Initial program 86.9%
Taylor expanded in beta around inf 63.7%
Taylor expanded in alpha around 0 55.9%
associate-/r*57.3%
Simplified57.3%
if 7.5999999999999997e158 < beta Initial program 76.0%
Taylor expanded in beta around inf 94.5%
Taylor expanded in alpha around 0 94.5%
+-commutative94.5%
associate-+r+94.5%
+-commutative94.5%
+-commutative94.5%
+-commutative94.5%
Simplified94.5%
Taylor expanded in alpha around inf 93.5%
Taylor expanded in beta around inf 93.5%
Final simplification67.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.5)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 1e+154)
(/ 1.0 (* beta (+ beta 3.0)))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1d+154) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 1e+154: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 1e+154) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1e+154)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1e+154], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 10^{+154}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.5 < beta < 1.00000000000000004e154Initial program 86.7%
Taylor expanded in beta around inf 62.9%
Taylor expanded in alpha around 0 56.3%
if 1.00000000000000004e154 < beta Initial program 76.6%
Taylor expanded in beta around inf 94.6%
Taylor expanded in alpha around 0 94.6%
+-commutative94.6%
associate-+r+94.6%
+-commutative94.6%
+-commutative94.6%
+-commutative94.6%
Simplified94.6%
Taylor expanded in alpha around inf 92.1%
Taylor expanded in beta around inf 92.1%
Final simplification66.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.5)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.5) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.5d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.5) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.5: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.5) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.5)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.5], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.5Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.4%
if 1.5 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Final simplification68.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.4%
if 1.55000000000000004 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 77.8%
+-commutative77.8%
Simplified77.8%
Final simplification68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.65)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.65d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.65: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.65) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.65)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.65], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.65:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.6499999999999999Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.4%
if 1.6499999999999999 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Taylor expanded in beta around inf 77.7%
Final simplification68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.7999999999999998 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around 0 78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Taylor expanded in beta around inf 77.7%
Final simplification68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.9e+24) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ alpha beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9e+24) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.9d+24) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9e+24) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.9e+24: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.9e+24) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.9e+24)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.9e+24], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.9 \cdot 10^{+24}:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.90000000000000008e24Initial program 99.8%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 80.9%
+-commutative80.9%
Simplified80.9%
Taylor expanded in alpha around 0 65.7%
Taylor expanded in beta around 0 61.1%
Taylor expanded in alpha around 0 59.3%
*-commutative59.3%
Simplified59.3%
if 1.90000000000000008e24 < beta Initial program 79.8%
Taylor expanded in beta around inf 82.5%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
associate-+r+82.5%
+-commutative82.5%
+-commutative82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in alpha around inf 54.3%
Taylor expanded in beta around inf 54.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 63.7%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.89999999999999991 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around inf 7.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 10.0) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 10.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 10.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 10.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 10.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 10.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 10.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 10.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 10Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 65.0%
Taylor expanded in beta around 0 63.9%
Taylor expanded in alpha around 0 62.0%
*-commutative62.0%
Simplified62.0%
if 10 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around inf 7.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 80.4%
+-commutative80.4%
Simplified80.4%
Taylor expanded in alpha around 0 65.0%
Taylor expanded in beta around 0 63.9%
Taylor expanded in alpha around 0 62.6%
if 12 < beta Initial program 81.9%
Taylor expanded in beta around inf 78.1%
Taylor expanded in alpha around inf 7.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 93.6%
associate-/l/92.0%
+-commutative92.0%
associate-+l+92.0%
*-commutative92.0%
metadata-eval92.0%
associate-+l+92.0%
metadata-eval92.0%
+-commutative92.0%
+-commutative92.0%
+-commutative92.0%
metadata-eval92.0%
metadata-eval92.0%
associate-+l+92.0%
Simplified92.0%
Taylor expanded in alpha around 0 81.1%
+-commutative81.1%
Simplified81.1%
Taylor expanded in alpha around 0 70.2%
Taylor expanded in beta around 0 43.9%
Taylor expanded in alpha around 0 42.6%
herbie shell --seed 2024146
(FPCore (alpha beta)
:name "Octave 3.8, jcobi/3"
:precision binary64
:pre (and (> alpha -1.0) (> beta -1.0))
(/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0)))