
(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 20 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))) (t_1 (+ (+ alpha beta) 2.0)))
(if (<=
(/
(/ (/ (+ (+ (+ alpha beta) (* alpha beta)) 1.0) t_1) t_1)
(+ 1.0 t_1))
0.1)
(/
(/ 1.0 (+ (+ alpha beta) 3.0))
(/ t_0 (/ (* (+ alpha 1.0) (+ beta 1.0)) t_0)))
(* (/ alpha beta) (/ 1.0 beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + beta) + 2.0;
double tmp;
if (((((((alpha + beta) + (alpha * beta)) + 1.0) / t_1) / t_1) / (1.0 + t_1)) <= 0.1) {
tmp = (1.0 / ((alpha + beta) + 3.0)) / (t_0 / (((alpha + 1.0) * (beta + 1.0)) / t_0));
} else {
tmp = (alpha / beta) * (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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
t_1 = (alpha + beta) + 2.0d0
if (((((((alpha + beta) + (alpha * beta)) + 1.0d0) / t_1) / t_1) / (1.0d0 + t_1)) <= 0.1d0) then
tmp = (1.0d0 / ((alpha + beta) + 3.0d0)) / (t_0 / (((alpha + 1.0d0) * (beta + 1.0d0)) / t_0))
else
tmp = (alpha / beta) * (1.0d0 / 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 + beta) + 2.0;
double tmp;
if (((((((alpha + beta) + (alpha * beta)) + 1.0) / t_1) / t_1) / (1.0 + t_1)) <= 0.1) {
tmp = (1.0 / ((alpha + beta) + 3.0)) / (t_0 / (((alpha + 1.0) * (beta + 1.0)) / t_0));
} else {
tmp = (alpha / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = (alpha + beta) + 2.0 tmp = 0 if ((((((alpha + beta) + (alpha * beta)) + 1.0) / t_1) / t_1) / (1.0 + t_1)) <= 0.1: tmp = (1.0 / ((alpha + beta) + 3.0)) / (t_0 / (((alpha + 1.0) * (beta + 1.0)) / t_0)) else: tmp = (alpha / beta) * (1.0 / 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 + beta) + 2.0) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(alpha * beta)) + 1.0) / t_1) / t_1) / Float64(1.0 + t_1)) <= 0.1) tmp = Float64(Float64(1.0 / Float64(Float64(alpha + beta) + 3.0)) / Float64(t_0 / Float64(Float64(Float64(alpha + 1.0) * Float64(beta + 1.0)) / t_0))); else tmp = Float64(Float64(alpha / beta) * Float64(1.0 / 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 + beta) + 2.0;
tmp = 0.0;
if (((((((alpha + beta) + (alpha * beta)) + 1.0) / t_1) / t_1) / (1.0 + t_1)) <= 0.1)
tmp = (1.0 / ((alpha + beta) + 3.0)) / (t_0 / (((alpha + 1.0) * (beta + 1.0)) / t_0));
else
tmp = (alpha / beta) * (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(1.0 + t$95$1), $MachinePrecision]), $MachinePrecision], 0.1], N[(N[(1.0 / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \alpha \cdot \beta\right) + 1}{t\_1}}{t\_1}}{1 + t\_1} \leq 0.1:\\
\;\;\;\;\frac{\frac{1}{\left(\alpha + \beta\right) + 3}}{\frac{t\_0}{\frac{\left(\alpha + 1\right) \cdot \left(\beta + 1\right)}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) < 0.10000000000000001Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified90.8%
Applied egg-rr99.8%
if 0.10000000000000001 < (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) Initial program 1.6%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified0.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6449.4%
Simplified49.4%
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f6442.5%
Applied egg-rr42.5%
Taylor expanded in alpha around inf
/-lowering-/.f6442.5%
Simplified42.5%
Final simplification96.5%
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 5e+94)
(/ (* (+ alpha 1.0) (/ (+ beta 1.0) (* (+ (+ alpha beta) 3.0) t_0))) t_0)
(/ (/ (+ alpha 1.0) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+94) {
tmp = ((alpha + 1.0) * ((beta + 1.0) / (((alpha + beta) + 3.0) * t_0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5d+94) then
tmp = ((alpha + 1.0d0) * ((beta + 1.0d0) / (((alpha + beta) + 3.0d0) * t_0))) / t_0
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0))
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 <= 5e+94) {
tmp = ((alpha + 1.0) * ((beta + 1.0) / (((alpha + beta) + 3.0) * t_0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+94: tmp = ((alpha + 1.0) * ((beta + 1.0) / (((alpha + beta) + 3.0) * t_0))) / t_0 else: tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+94) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(beta + 1.0) / Float64(Float64(Float64(alpha + beta) + 3.0) * t_0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0))); 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 <= 5e+94)
tmp = ((alpha + 1.0) * ((beta + 1.0) / (((alpha + beta) + 3.0) * t_0))) / t_0;
else
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+94], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $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 5 \cdot 10^{+94}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \frac{\beta + 1}{\left(\left(\alpha + \beta\right) + 3\right) \cdot t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.0000000000000001e94Initial program 98.9%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.3%
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr99.2%
if 5.0000000000000001e94 < beta Initial program 73.7%
Taylor expanded in beta around inf
+-lowering-+.f6484.9%
Simplified84.9%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6484.9%
Applied egg-rr84.9%
Final simplification96.5%
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 5e+94)
(/ (* (+ alpha 1.0) (+ beta 1.0)) (* t_0 (* (+ (+ alpha beta) 3.0) t_0)))
(/ (/ (+ alpha 1.0) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 5e+94) {
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (((alpha + beta) + 3.0) * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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) :: t_0
real(8) :: tmp
t_0 = (alpha + beta) + 2.0d0
if (beta <= 5d+94) then
tmp = ((alpha + 1.0d0) * (beta + 1.0d0)) / (t_0 * (((alpha + beta) + 3.0d0) * t_0))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0))
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 <= 5e+94) {
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (((alpha + beta) + 3.0) * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 tmp = 0 if beta <= 5e+94: tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (((alpha + beta) + 3.0) * t_0)) else: tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) tmp = 0.0 if (beta <= 5e+94) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(beta + 1.0)) / Float64(t_0 * Float64(Float64(Float64(alpha + beta) + 3.0) * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0))); 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 <= 5e+94)
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (((alpha + beta) + 3.0) * t_0));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 5e+94], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+94}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(\beta + 1\right)}{t\_0 \cdot \left(\left(\left(\alpha + \beta\right) + 3\right) \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.0000000000000001e94Initial program 98.9%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.3%
if 5.0000000000000001e94 < beta Initial program 73.7%
Taylor expanded in beta around inf
+-lowering-+.f6484.9%
Simplified84.9%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6484.9%
Applied egg-rr84.9%
Final simplification91.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 170000000.0)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/
(* (+ alpha 1.0) (/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))
(+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 170000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 2.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 <= 170000000.0d0) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 170000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 170000000.0: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 170000000.0) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 170000000.0)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 2.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, 170000000.0], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 170000000:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.7e8Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.0%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.2%
Simplified67.2%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6467.2%
Applied egg-rr67.2%
if 1.7e8 < beta Initial program 80.6%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified65.6%
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr91.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f6479.7%
Simplified79.7%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1e+18)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/
(/ 1.0 (+ alpha (+ beta 3.0)))
(/ (+ beta (+ alpha 2.0)) (+ alpha 1.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+18) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((beta + (alpha + 2.0)) / (alpha + 1.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 <= 1d+18) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) / ((beta + (alpha + 2.0d0)) / (alpha + 1.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+18) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((beta + (alpha + 2.0)) / (alpha + 1.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+18: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = (1.0 / (alpha + (beta + 3.0))) / ((beta + (alpha + 2.0)) / (alpha + 1.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+18) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(Float64(beta + Float64(alpha + 2.0)) / Float64(alpha + 1.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+18)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = (1.0 / (alpha + (beta + 3.0))) / ((beta + (alpha + 2.0)) / (alpha + 1.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, 1e+18], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+18}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\alpha + \left(\beta + 3\right)}}{\frac{\beta + \left(\alpha + 2\right)}{\alpha + 1}}\\
\end{array}
\end{array}
if beta < 1e18Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.6%
Simplified67.6%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
if 1e18 < beta Initial program 79.3%
Taylor expanded in beta around inf
+-lowering-+.f6480.5%
Simplified80.5%
div-invN/A
clear-numN/A
associate-*l/N/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr80.5%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.6e+14) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.6e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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 <= 9.6d+14) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 2.0d0))) / (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 <= 9.6e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.6e+14: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.6e+14) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 2.0))) / 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 <= 9.6e+14)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 2.0))) / (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, 9.6e+14], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $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 9.6 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 9.6e14Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.6%
Simplified67.6%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
if 9.6e14 < beta Initial program 79.3%
Taylor expanded in beta around inf
+-lowering-+.f6480.5%
Simplified80.5%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6480.5%
Applied egg-rr80.5%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.9e+15) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ 1.0 (+ alpha (+ beta 3.0))) (/ beta (+ alpha 1.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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.9d+15) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) / (beta / (alpha + 1.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.9e+15: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.9e+15) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(beta / Float64(alpha + 1.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.9e+15)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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.9e+15], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta / N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.9 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\alpha + \left(\beta + 3\right)}}{\frac{\beta}{\alpha + 1}}\\
\end{array}
\end{array}
if beta < 3.9e15Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.6%
Simplified67.6%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6467.6%
Applied egg-rr67.6%
if 3.9e15 < beta Initial program 79.3%
Taylor expanded in beta around inf
+-lowering-+.f6480.5%
Simplified80.5%
div-invN/A
clear-numN/A
associate-*l/N/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr80.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6480.0%
Simplified80.0%
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.2e+17) (/ (+ beta 1.0) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0)))) (/ (/ 1.0 (+ alpha (+ beta 3.0))) (/ beta (+ alpha 1.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+17) {
tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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.2d+17) then
tmp = (beta + 1.0d0) / ((beta + 3.0d0) * ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) / (beta / (alpha + 1.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+17) {
tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2e+17: tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0))) else: tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2e+17) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(beta / Float64(alpha + 1.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2e+17)
tmp = (beta + 1.0) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
else
tmp = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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.2e+17], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta / N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+17}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 3\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\alpha + \left(\beta + 3\right)}}{\frac{\beta}{\alpha + 1}}\\
\end{array}
\end{array}
if beta < 1.2e17Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.6%
Simplified67.6%
if 1.2e17 < beta Initial program 79.3%
Taylor expanded in beta around inf
+-lowering-+.f6480.5%
Simplified80.5%
div-invN/A
clear-numN/A
associate-*l/N/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr80.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6480.0%
Simplified80.0%
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.7)
(+
0.08333333333333333
(*
beta
(+
(* beta (+ (* beta 0.024691358024691357) -0.011574074074074073))
-0.027777777777777776)))
(/ (/ 1.0 (+ alpha (+ beta 3.0))) (/ beta (+ alpha 1.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 = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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 = (1.0d0 / (alpha + (beta + 3.0d0))) / (beta / (alpha + 1.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 = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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 = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(beta / Float64(alpha + 1.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 = (1.0 / (alpha + (beta + 3.0))) / (beta / (alpha + 1.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[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta / N[(alpha + 1.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{1}{\alpha + \left(\beta + 3\right)}}{\frac{\beta}{\alpha + 1}}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.6%
Simplified66.6%
if 1.69999999999999996 < beta Initial program 81.3%
Taylor expanded in beta around inf
+-lowering-+.f6477.4%
Simplified77.4%
div-invN/A
clear-numN/A
associate-*l/N/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr77.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6476.7%
Simplified76.7%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.8)
(+
0.08333333333333333
(*
beta
(+
(* beta (+ (* beta 0.024691358024691357) -0.011574074074074073))
-0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.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.8d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * ((beta * 0.024691358024691357d0) + (-0.011574074074074073d0))) + (-0.027777777777777776d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.8: tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.8) 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 + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.8)
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.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.8], 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 + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8:\\
\;\;\;\;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 + 2\right)}\\
\end{array}
\end{array}
if beta < 1.80000000000000004Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.6%
Simplified66.6%
if 1.80000000000000004 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr91.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6476.6%
Simplified76.6%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.85)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 5e+158)
(/ (+ alpha 1.0) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.85) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 5e+158) {
tmp = (alpha + 1.0) / (beta * beta);
} 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.85d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 5d+158) then
tmp = (alpha + 1.0d0) / (beta * beta)
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.85) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 5e+158) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.85: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 5e+158: tmp = (alpha + 1.0) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.85) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 5e+158) tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); 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.85)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 5e+158)
tmp = (alpha + 1.0) / (beta * beta);
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.85], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5e+158], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $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.85:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+158}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.85000000000000009Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.85000000000000009 < beta < 4.9999999999999996e158Initial program 88.6%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified65.7%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6466.4%
Simplified66.4%
if 4.9999999999999996e158 < beta Initial program 71.9%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified68.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6489.1%
Simplified89.1%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6489.2%
Applied egg-rr89.2%
Taylor expanded in alpha around inf
/-lowering-/.f6488.8%
Simplified88.8%
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.6)
(+
0.08333333333333333
(* beta (+ -0.027777777777777776 (* beta -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.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.6d0) then
tmp = 0.08333333333333333d0 + (beta * ((-0.027777777777777776d0) + (beta * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6: tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(-0.027777777777777776 + Float64(beta * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6)
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.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.6], N[(0.08333333333333333 + N[(beta * N[(-0.027777777777777776 + N[(beta * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(-0.027777777777777776 + \beta \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.6000000000000001Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.4%
Simplified66.4%
if 1.6000000000000001 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr91.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6476.6%
Simplified76.6%
Final simplification69.6%
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)) (if (<= beta 1.46e+161) (/ (/ 1.0 beta) beta) (/ (/ 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 if (beta <= 1.46e+161) {
tmp = (1.0 / beta) / beta;
} 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.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1.46d+161) then
tmp = (1.0d0 / beta) / beta
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.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.46e+161) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (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) elif beta <= 1.46e+161: tmp = (1.0 / beta) / beta else: tmp = (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)); elseif (beta <= 1.46e+161) tmp = Float64(Float64(1.0 / beta) / beta); 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.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1.46e+161)
tmp = (1.0 / beta) / beta;
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.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.46e+161], N[(N[(1.0 / beta), $MachinePrecision] / beta), $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.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.46 \cdot 10^{+161}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.7999999999999998 < beta < 1.46000000000000008e161Initial program 87.0%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified64.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6465.5%
Simplified65.5%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6465.7%
Applied egg-rr65.7%
Taylor expanded in alpha around 0
/-lowering-/.f6451.2%
Simplified51.2%
if 1.46000000000000008e161 < beta Initial program 73.2%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified70.0%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6491.7%
Simplified91.7%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6491.4%
Applied egg-rr91.4%
Taylor expanded in alpha around inf
/-lowering-/.f6491.4%
Simplified91.4%
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 (+ -0.027777777777777776 (* beta -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} 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 * ((-0.027777777777777776d0) + (beta * (-0.011574074074074073d0))))
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 * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} 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 * (-0.027777777777777776 + (beta * -0.011574074074074073))) 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(-0.027777777777777776 + Float64(beta * -0.011574074074074073)))); 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 * (-0.027777777777777776 + (beta * -0.011574074074074073)));
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[(-0.027777777777777776 + N[(beta * -0.011574074074074073), $MachinePrecision]), $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(-0.027777777777777776 + \beta \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.6499999999999999Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.4%
Simplified66.4%
if 1.6499999999999999 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6476.3%
Simplified76.3%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6476.3%
Applied egg-rr76.3%
Final simplification69.5%
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/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.7999999999999998 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6476.3%
Simplified76.3%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6476.3%
Applied egg-rr76.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)) (/ (/ 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(Float64(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 = (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[(1.0 / 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{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.7999999999999998 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6476.3%
Simplified76.3%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6476.3%
Applied egg-rr76.3%
Taylor expanded in alpha around 0
/-lowering-/.f6467.9%
Simplified67.9%
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/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.7999999999999998 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6476.3%
Simplified76.3%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6467.7%
Simplified67.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.14285714285714285 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.14285714285714285 / 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.3d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.14285714285714285d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.14285714285714285 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.14285714285714285 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.14285714285714285 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.3)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.14285714285714285 / 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.3], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.14285714285714285 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.14285714285714285}{\beta}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Simplified66.0%
if 2.2999999999999998 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6464.7%
Simplified64.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6442.9%
Simplified42.9%
Taylor expanded in beta around inf
/-lowering-/.f647.4%
Simplified7.4%
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 (/ 0.14285714285714285 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333;
} else {
tmp = 0.14285714285714285 / 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.7d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.14285714285714285d0 / beta
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;
} else {
tmp = 0.14285714285714285 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.7: tmp = 0.08333333333333333 else: tmp = 0.14285714285714285 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = 0.08333333333333333; else tmp = Float64(0.14285714285714285 / beta); 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;
else
tmp = 0.14285714285714285 / 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.7], 0.08333333333333333, N[(0.14285714285714285 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.14285714285714285}{\beta}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified93.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.7%
Simplified67.7%
Taylor expanded in beta around 0
Simplified65.3%
if 1.69999999999999996 < beta Initial program 81.3%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified66.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6464.7%
Simplified64.7%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6442.9%
Simplified42.9%
Taylor expanded in beta around inf
/-lowering-/.f647.4%
Simplified7.4%
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 94.0%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified85.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6466.8%
Simplified66.8%
Taylor expanded in beta around 0
Simplified46.2%
herbie shell --seed 2024158
(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)))