
(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 19 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 (+ 2.0 beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ 3.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
}
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 + (2.0d0 + beta)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (3.0d0 + (alpha + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(3.0 + Float64(alpha + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \frac{1 + \beta}{3 + \left(\alpha + \beta\right)}
\end{array}
\end{array}
Initial program 95.6%
associate-/l/94.0%
associate-/r*87.5%
+-commutative87.5%
associate-+r+87.5%
+-commutative87.5%
associate-+r+87.5%
associate-+r+87.5%
distribute-rgt1-in87.5%
+-commutative87.5%
*-commutative87.5%
distribute-rgt1-in87.5%
+-commutative87.5%
times-frac97.4%
Simplified97.4%
expm1-log1p-u97.4%
expm1-udef76.2%
*-commutative76.2%
+-commutative76.2%
Applied egg-rr76.2%
expm1-def97.4%
expm1-log1p97.4%
*-commutative97.4%
associate-*r/97.3%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 360000000000.0)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_1 (+ beta (+ alpha 3.0)))))
(/ (* (/ (+ 1.0 alpha) t_0) (- 1.0 (/ (+ alpha 2.0) beta))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 360000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * (beta + (alpha + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 360000000000.0d0) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_1 * (beta + (alpha + 3.0d0))))
else
tmp = (((1.0d0 + alpha) / t_0) * (1.0d0 - ((alpha + 2.0d0) / beta))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 360000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * (beta + (alpha + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 360000000000.0: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * (beta + (alpha + 3.0)))) else: tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 360000000000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_1 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / beta))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 360000000000.0)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * (beta + (alpha + 3.0))));
else
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
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[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 360000000000.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$1 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 360000000000:\\
\;\;\;\;\frac{1 + \alpha}{t_1} \cdot \frac{1 + \beta}{t_1 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)}{t_0}\\
\end{array}
\end{array}
if beta < 3.6e11Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
times-frac99.8%
Simplified99.8%
if 3.6e11 < beta Initial program 85.4%
associate-/l/79.9%
associate-/r*68.8%
+-commutative68.8%
associate-+r+68.8%
+-commutative68.8%
associate-+r+68.8%
associate-+r+68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
*-commutative68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
times-frac91.5%
Simplified91.5%
expm1-log1p-u91.5%
expm1-udef56.2%
*-commutative56.2%
+-commutative56.2%
Applied egg-rr56.2%
expm1-def91.5%
expm1-log1p91.5%
*-commutative91.5%
associate-*r/91.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
mul-1-neg85.0%
unsub-neg85.0%
Simplified85.0%
associate-*l/85.0%
associate-+r+85.0%
+-commutative85.0%
associate-+r+85.0%
Applied egg-rr85.0%
Final simplification95.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 190000000.0)
(/ (+ 1.0 beta) (* t_0 (* (+ 2.0 beta) (+ beta 3.0))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (- 1.0 (/ (+ alpha 2.0) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 190000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.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) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 190000000.0d0) then
tmp = (1.0d0 + beta) / (t_0 * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 - ((alpha + 2.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 190000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 190000000.0: tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 190000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 190000000.0)
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / 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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 190000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 190000000:\\
\;\;\;\;\frac{1 + \beta}{t_0 \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.9e8Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.6%
Taylor expanded in alpha around 0 69.1%
if 1.9e8 < beta Initial program 85.4%
associate-/l/79.9%
associate-/r*68.8%
+-commutative68.8%
associate-+r+68.8%
+-commutative68.8%
associate-+r+68.8%
associate-+r+68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
*-commutative68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
times-frac91.5%
Simplified91.5%
expm1-log1p-u91.5%
expm1-udef56.2%
*-commutative56.2%
+-commutative56.2%
Applied egg-rr56.2%
expm1-def91.5%
expm1-log1p91.5%
*-commutative91.5%
associate-*r/91.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
mul-1-neg85.0%
unsub-neg85.0%
Simplified85.0%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 100000000.0)
(/ (+ 1.0 beta) (* (+ alpha (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0))))
(/ (* (/ (+ 1.0 alpha) t_0) (- 1.0 (/ (+ alpha 2.0) beta))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 100000000.0) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_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) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 100000000.0d0) then
tmp = (1.0d0 + beta) / ((alpha + (2.0d0 + beta)) * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) * (1.0d0 - ((alpha + 2.0d0) / beta))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 100000000.0) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 100000000.0: tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 100000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / beta))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 100000000.0)
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
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[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 100000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 100000000:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)}{t_0}\\
\end{array}
\end{array}
if beta < 1e8Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.6%
Taylor expanded in alpha around 0 69.1%
if 1e8 < beta Initial program 85.4%
associate-/l/79.9%
associate-/r*68.8%
+-commutative68.8%
associate-+r+68.8%
+-commutative68.8%
associate-+r+68.8%
associate-+r+68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
*-commutative68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
times-frac91.5%
Simplified91.5%
expm1-log1p-u91.5%
expm1-udef56.2%
*-commutative56.2%
+-commutative56.2%
Applied egg-rr56.2%
expm1-def91.5%
expm1-log1p91.5%
*-commutative91.5%
associate-*r/91.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
mul-1-neg85.0%
unsub-neg85.0%
Simplified85.0%
associate-*l/85.0%
associate-+r+85.0%
+-commutative85.0%
associate-+r+85.0%
Applied egg-rr85.0%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 6800000000.0)
(/ (/ (+ 1.0 (+ alpha beta)) t_1) (* t_1 (+ alpha (+ beta 3.0))))
(/ (* (/ (+ 1.0 alpha) t_0) (- 1.0 (/ (+ alpha 2.0) beta))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 6800000000.0) {
tmp = ((1.0 + (alpha + beta)) / t_1) / (t_1 * (alpha + (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 6800000000.0d0) then
tmp = ((1.0d0 + (alpha + beta)) / t_1) / (t_1 * (alpha + (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) * (1.0d0 - ((alpha + 2.0d0) / beta))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 6800000000.0) {
tmp = ((1.0 + (alpha + beta)) / t_1) / (t_1 * (alpha + (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 6800000000.0: tmp = ((1.0 + (alpha + beta)) / t_1) / (t_1 * (alpha + (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 6800000000.0) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + beta)) / t_1) / Float64(t_1 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / beta))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 6800000000.0)
tmp = ((1.0 + (alpha + beta)) / t_1) / (t_1 * (alpha + (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) * (1.0 - ((alpha + 2.0) / beta))) / t_0;
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[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6800000000.0], N[(N[(N[(1.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 6800000000:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \beta\right)}{t_1}}{t_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)}{t_0}\\
\end{array}
\end{array}
if beta < 6.8e9Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
*-commutative99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around 0 99.4%
distribute-lft-in99.4%
associate-+l+99.4%
associate-+l+99.4%
Applied egg-rr99.4%
distribute-lft-out99.4%
*-commutative99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
if 6.8e9 < beta Initial program 85.4%
associate-/l/79.9%
associate-/r*68.8%
+-commutative68.8%
associate-+r+68.8%
+-commutative68.8%
associate-+r+68.8%
associate-+r+68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
*-commutative68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
times-frac91.5%
Simplified91.5%
expm1-log1p-u91.5%
expm1-udef56.2%
*-commutative56.2%
+-commutative56.2%
Applied egg-rr56.2%
expm1-def91.5%
expm1-log1p91.5%
*-commutative91.5%
associate-*r/91.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
mul-1-neg85.0%
unsub-neg85.0%
Simplified85.0%
associate-*l/85.0%
associate-+r+85.0%
+-commutative85.0%
associate-+r+85.0%
Applied egg-rr85.0%
Final simplification95.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 85000000.0)
(/ (+ 1.0 beta) (* t_0 (* (+ 2.0 beta) (+ beta 3.0))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (- 1.0 (/ 2.0 beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 85000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (2.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) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 85000000.0d0) then
tmp = (1.0d0 + beta) / (t_0 * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 - (2.0d0 / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 85000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (2.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 85000000.0: tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (2.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 85000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 - Float64(2.0 / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 85000000.0)
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (2.0 / 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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 85000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 85000000:\\
\;\;\;\;\frac{1 + \beta}{t_0 \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \left(1 - \frac{2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 8.5e7Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.6%
Taylor expanded in alpha around 0 69.1%
if 8.5e7 < beta Initial program 85.4%
associate-/l/79.9%
associate-/r*68.8%
+-commutative68.8%
associate-+r+68.8%
+-commutative68.8%
associate-+r+68.8%
associate-+r+68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
*-commutative68.8%
distribute-rgt1-in68.8%
+-commutative68.8%
times-frac91.5%
Simplified91.5%
expm1-log1p-u91.5%
expm1-udef56.2%
*-commutative56.2%
+-commutative56.2%
Applied egg-rr56.2%
expm1-def91.5%
expm1-log1p91.5%
*-commutative91.5%
associate-*r/91.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
mul-1-neg85.0%
unsub-neg85.0%
Simplified85.0%
Taylor expanded in alpha around 0 85.3%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 76000000000000.0)
(/ (+ 1.0 beta) (* t_0 (* (+ 2.0 beta) (+ beta 3.0))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (- 1.0 (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.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 + (2.0d0 + beta)
if (beta <= 76000000000000.0d0) then
tmp = (1.0d0 + beta) / (t_0 * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 - (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 76000000000000.0: tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 76000000000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 - Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 76000000000000.0)
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 76000000000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 76000000000000:\\
\;\;\;\;\frac{1 + \beta}{t_0 \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \left(1 - \frac{\alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 7.6e13Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.7%
Taylor expanded in alpha around 0 69.3%
if 7.6e13 < beta Initial program 85.2%
associate-/l/79.6%
associate-/r*68.4%
+-commutative68.4%
associate-+r+68.4%
+-commutative68.4%
associate-+r+68.4%
associate-+r+68.4%
distribute-rgt1-in68.4%
+-commutative68.4%
*-commutative68.4%
distribute-rgt1-in68.4%
+-commutative68.4%
times-frac91.4%
Simplified91.4%
expm1-log1p-u91.4%
expm1-udef57.0%
*-commutative57.0%
+-commutative57.0%
Applied egg-rr57.0%
expm1-def91.4%
expm1-log1p91.4%
*-commutative91.4%
associate-*r/91.3%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 84.8%
mul-1-neg84.8%
unsub-neg84.8%
Simplified84.8%
Taylor expanded in alpha around inf 84.7%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 76000000000000.0)
(/ (+ 1.0 beta) (* t_0 (* (+ 2.0 beta) (+ beta 3.0))))
(* (- 1.0 (/ (+ alpha 2.0) beta)) (/ (/ (+ 1.0 alpha) beta) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (1.0 - ((alpha + 2.0) / beta)) * (((1.0 + alpha) / beta) / t_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) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 76000000000000.0d0) then
tmp = (1.0d0 + beta) / (t_0 * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (1.0d0 - ((alpha + 2.0d0) / beta)) * (((1.0d0 + alpha) / beta) / t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (1.0 - ((alpha + 2.0) / beta)) * (((1.0 + alpha) / beta) / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 76000000000000.0: tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0))) else: tmp = (1.0 - ((alpha + 2.0) / beta)) * (((1.0 + alpha) / beta) / t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 76000000000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 - Float64(Float64(alpha + 2.0) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 76000000000000.0)
tmp = (1.0 + beta) / (t_0 * ((2.0 + beta) * (beta + 3.0)));
else
tmp = (1.0 - ((alpha + 2.0) / beta)) * (((1.0 + alpha) / beta) / t_0);
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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 76000000000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 76000000000000:\\
\;\;\;\;\frac{1 + \beta}{t_0 \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \frac{\alpha + 2}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 7.6e13Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.7%
Taylor expanded in alpha around 0 69.3%
if 7.6e13 < beta Initial program 85.2%
associate-/l/79.6%
associate-/r*68.4%
+-commutative68.4%
associate-+r+68.4%
+-commutative68.4%
associate-+r+68.4%
associate-+r+68.4%
distribute-rgt1-in68.4%
+-commutative68.4%
*-commutative68.4%
distribute-rgt1-in68.4%
+-commutative68.4%
times-frac91.4%
Simplified91.4%
expm1-log1p-u91.4%
expm1-udef57.0%
*-commutative57.0%
+-commutative57.0%
Applied egg-rr57.0%
expm1-def91.4%
expm1-log1p91.4%
*-commutative91.4%
associate-*r/91.3%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 84.8%
mul-1-neg84.8%
unsub-neg84.8%
Simplified84.8%
Taylor expanded in beta around inf 84.4%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 76000000000000.0) (/ (+ 1.0 beta) (* (+ alpha (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0)))) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.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) :: tmp
if (beta <= 76000000000000.0d0) then
tmp = (1.0d0 + beta) / ((alpha + (2.0d0 + beta)) * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 76000000000000.0: tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0))) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 76000000000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 76000000000000.0)
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
else
tmp = ((alpha - -1.0) / beta) / (3.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_] := If[LessEqual[beta, 76000000000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 76000000000000:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 7.6e13Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in alpha around 0 86.7%
Taylor expanded in alpha around 0 69.3%
if 7.6e13 < beta Initial program 85.2%
Taylor expanded in beta around -inf 84.6%
associate-*r/84.6%
mul-1-neg84.6%
sub-neg84.6%
mul-1-neg84.6%
distribute-neg-in84.6%
+-commutative84.6%
mul-1-neg84.6%
distribute-lft-in84.6%
metadata-eval84.6%
mul-1-neg84.6%
unsub-neg84.6%
Simplified84.6%
Taylor expanded in alpha around 0 84.6%
+-commutative84.6%
associate-+r+84.6%
+-commutative84.6%
Simplified84.6%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (/ (+ 1.0 alpha) (* (+ alpha 2.0) (* (+ alpha 2.0) (+ alpha 3.0)))) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.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) :: tmp
if (beta <= 3.3d0) then
tmp = (1.0d0 + alpha) / ((alpha + 2.0d0) * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = ((alpha - -1.0) / beta) / (3.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_] := If[LessEqual[beta, 3.3], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
times-frac99.8%
Simplified99.8%
*-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
distribute-lft-in99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 93.8%
*-commutative93.8%
distribute-rgt-out93.8%
+-commutative93.8%
+-commutative93.8%
Simplified93.8%
if 3.2999999999999998 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in alpha around 0 81.4%
+-commutative81.4%
associate-+r+81.4%
+-commutative81.4%
Simplified81.4%
Final simplification89.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 76000000000000.0) (/ (+ 1.0 beta) (* (+ 2.0 beta) (* (+ 2.0 beta) (+ beta 3.0)))) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.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) :: tmp
if (beta <= 76000000000000.0d0) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 76000000000000.0) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 76000000000000.0: tmp = (1.0 + beta) / ((2.0 + beta) * ((2.0 + beta) * (beta + 3.0))) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 76000000000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 76000000000000.0)
tmp = (1.0 + beta) / ((2.0 + beta) * ((2.0 + beta) * (beta + 3.0)));
else
tmp = ((alpha - -1.0) / beta) / (3.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_] := If[LessEqual[beta, 76000000000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 76000000000000:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 7.6e13Initial program 99.8%
associate-/l/99.8%
associate-/r*95.2%
+-commutative95.2%
associate-+r+95.2%
+-commutative95.2%
associate-+r+95.2%
associate-+r+95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
metadata-eval95.2%
Simplified95.2%
distribute-lft-in95.2%
Applied egg-rr95.2%
Taylor expanded in alpha around 0 68.4%
+-commutative68.4%
distribute-rgt-out68.4%
Simplified68.4%
if 7.6e13 < beta Initial program 85.2%
Taylor expanded in beta around -inf 84.6%
associate-*r/84.6%
mul-1-neg84.6%
sub-neg84.6%
mul-1-neg84.6%
distribute-neg-in84.6%
+-commutative84.6%
mul-1-neg84.6%
distribute-lft-in84.6%
metadata-eval84.6%
mul-1-neg84.6%
unsub-neg84.6%
Simplified84.6%
Taylor expanded in alpha around 0 84.6%
+-commutative84.6%
associate-+r+84.6%
+-commutative84.6%
Simplified84.6%
Final simplification73.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)) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha - -1.0) / beta) / (3.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) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (alpha + 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 {
tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (alpha + 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)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(alpha + 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);
else
tmp = ((alpha - -1.0) / beta) / (3.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_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $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{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.5 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in alpha around 0 81.4%
+-commutative81.4%
associate-+r+81.4%
+-commutative81.4%
Simplified81.4%
Final simplification71.9%
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)) (/ (/ (- alpha -1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-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 <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5: tmp = 0.08333333333333333 + (beta * -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 <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -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 <= 2.5)
tmp = 0.08333333333333333 + (beta * -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, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $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 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.5 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in alpha around 0 81.2%
Final simplification71.8%
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)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 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 <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) 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)); else tmp = Float64(1.0 / Float64(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 <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 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, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $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{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.5 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in alpha around 0 74.4%
Final simplification69.7%
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)) (/ (+ 1.0 alpha) (* 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 = (1.0 + 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.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 + 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.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (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 = (1.0 + alpha) / (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(1.0 + alpha) / Float64(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 = (1.0 + 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.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $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{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.7999999999999998 < beta Initial program 86.3%
associate-/l/81.1%
associate-/r*70.8%
+-commutative70.8%
associate-+r+70.8%
+-commutative70.8%
associate-+r+70.8%
associate-+r+70.8%
distribute-rgt1-in70.8%
+-commutative70.8%
*-commutative70.8%
distribute-rgt1-in70.7%
+-commutative70.7%
times-frac92.0%
Simplified92.0%
Taylor expanded in beta around inf 78.8%
unpow278.8%
Simplified78.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 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.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.7999999999999998 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in beta around inf 81.1%
Final simplification71.8%
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.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.89999999999999991 < beta Initial program 86.3%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Taylor expanded in alpha around inf 7.2%
Final simplification48.7%
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)) (/ 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 = 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 = 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 = 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 = 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(1.0 / Float64(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 = 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[(1.0 / N[(beta * beta), $MachinePrecision]), $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{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.8%
associate-/r*95.1%
+-commutative95.1%
associate-+r+95.1%
+-commutative95.1%
associate-+r+95.1%
associate-+r+95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
*-commutative95.1%
distribute-rgt1-in95.1%
+-commutative95.1%
metadata-eval95.1%
associate-+l+95.1%
*-commutative95.1%
metadata-eval95.1%
Simplified95.1%
distribute-lft-in95.1%
Applied egg-rr95.1%
Taylor expanded in alpha around 0 67.9%
Taylor expanded in beta around 0 67.6%
*-commutative67.6%
Simplified67.6%
if 2.7999999999999998 < beta Initial program 86.3%
associate-/l/81.1%
associate-/r*70.8%
+-commutative70.8%
associate-+r+70.8%
+-commutative70.8%
associate-+r+70.8%
associate-+r+70.8%
distribute-rgt1-in70.8%
+-commutative70.8%
*-commutative70.8%
distribute-rgt1-in70.7%
+-commutative70.7%
times-frac92.0%
Simplified92.0%
Taylor expanded in beta around inf 78.8%
unpow278.8%
Simplified78.8%
Taylor expanded in alpha around 0 74.3%
unpow274.3%
Simplified74.3%
Final simplification69.7%
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 95.6%
associate-/l/94.0%
associate-/r*87.5%
+-commutative87.5%
associate-+r+87.5%
+-commutative87.5%
associate-+r+87.5%
associate-+r+87.5%
distribute-rgt1-in87.5%
+-commutative87.5%
*-commutative87.5%
distribute-rgt1-in87.5%
+-commutative87.5%
metadata-eval87.5%
associate-+l+87.5%
*-commutative87.5%
metadata-eval87.5%
Simplified87.5%
distribute-lft-in87.5%
Applied egg-rr87.5%
Taylor expanded in alpha around 0 69.3%
Taylor expanded in beta around 0 47.4%
Final simplification47.4%
herbie shell --seed 2023279
(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)))