
(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 27 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 (+ 2.0 (+ alpha beta))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= alpha 86.0)
(/ (/ (/ (* (+ alpha 1.0) (+ 1.0 beta)) t_1) (+ beta (+ alpha 3.0))) t_1)
(/ (/ (/ alpha (/ t_0 (+ 1.0 beta))) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 86.0) {
tmp = ((((alpha + 1.0) * (1.0 + beta)) / t_1) / (beta + (alpha + 3.0))) / t_1;
} else {
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / 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 = 2.0d0 + (alpha + beta)
t_1 = alpha + (2.0d0 + beta)
if (alpha <= 86.0d0) then
tmp = ((((alpha + 1.0d0) * (1.0d0 + beta)) / t_1) / (beta + (alpha + 3.0d0))) / t_1
else
tmp = ((alpha / (t_0 / (1.0d0 + beta))) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 86.0) {
tmp = ((((alpha + 1.0) * (1.0 + beta)) / t_1) / (beta + (alpha + 3.0))) / t_1;
} else {
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) t_1 = alpha + (2.0 + beta) tmp = 0 if alpha <= 86.0: tmp = ((((alpha + 1.0) * (1.0 + beta)) / t_1) / (beta + (alpha + 3.0))) / t_1 else: tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (alpha <= 86.0) tmp = Float64(Float64(Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / t_1) / Float64(beta + Float64(alpha + 3.0))) / t_1); else tmp = Float64(Float64(Float64(alpha / Float64(t_0 / Float64(1.0 + beta))) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (alpha <= 86.0)
tmp = ((((alpha + 1.0) * (1.0 + beta)) / t_1) / (beta + (alpha + 3.0))) / t_1;
else
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 86.0], N[(N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[(alpha / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 86:\\
\;\;\;\;\frac{\frac{\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{t\_1}}{\beta + \left(\alpha + 3\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha}{\frac{t\_0}{1 + \beta}}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 86Initial program 99.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
Simplified97.1%
Applied egg-rr99.9%
if 86 < alpha Initial program 77.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in alpha around inf
Simplified99.3%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0)))
(t_1 (+ 2.0 (+ alpha beta)))
(t_2 (/ t_1 (+ 1.0 beta))))
(if (<= alpha 86.0)
(/ (/ (+ alpha 1.0) t_2) (* t_1 t_0))
(/ (/ (/ alpha t_2) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = 2.0 + (alpha + beta);
double t_2 = t_1 / (1.0 + beta);
double tmp;
if (alpha <= 86.0) {
tmp = ((alpha + 1.0) / t_2) / (t_1 * t_0);
} else {
tmp = ((alpha / t_2) / t_0) / t_1;
}
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) :: t_2
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = 2.0d0 + (alpha + beta)
t_2 = t_1 / (1.0d0 + beta)
if (alpha <= 86.0d0) then
tmp = ((alpha + 1.0d0) / t_2) / (t_1 * t_0)
else
tmp = ((alpha / t_2) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = 2.0 + (alpha + beta);
double t_2 = t_1 / (1.0 + beta);
double tmp;
if (alpha <= 86.0) {
tmp = ((alpha + 1.0) / t_2) / (t_1 * t_0);
} else {
tmp = ((alpha / t_2) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = 2.0 + (alpha + beta) t_2 = t_1 / (1.0 + beta) tmp = 0 if alpha <= 86.0: tmp = ((alpha + 1.0) / t_2) / (t_1 * t_0) else: tmp = ((alpha / t_2) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(2.0 + Float64(alpha + beta)) t_2 = Float64(t_1 / Float64(1.0 + beta)) tmp = 0.0 if (alpha <= 86.0) tmp = Float64(Float64(Float64(alpha + 1.0) / t_2) / Float64(t_1 * t_0)); else tmp = Float64(Float64(Float64(alpha / t_2) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = 2.0 + (alpha + beta);
t_2 = t_1 / (1.0 + beta);
tmp = 0.0;
if (alpha <= 86.0)
tmp = ((alpha + 1.0) / t_2) / (t_1 * t_0);
else
tmp = ((alpha / t_2) / t_0) / t_1;
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 + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 86.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha / t$95$2), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := 2 + \left(\alpha + \beta\right)\\
t_2 := \frac{t\_1}{1 + \beta}\\
\mathbf{if}\;\alpha \leq 86:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_2}}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha}{t\_2}}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if alpha < 86Initial program 99.9%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.9%
Applied egg-rr99.9%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
*-commutativeN/A
metadata-evalN/A
associate-+l+N/A
+-commutativeN/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
if 86 < alpha Initial program 77.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in alpha around inf
Simplified99.3%
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 1e+80)
(/ (* (+ alpha 1.0) (+ 1.0 beta)) (* t_0 (* t_0 (+ (+ alpha beta) 3.0))))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 1e+80) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_0 * (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 1d+80) then
tmp = ((alpha + 1.0d0) * (1.0d0 + beta)) / (t_0 * (t_0 * ((alpha + beta) + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 1e+80) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_0 * (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 1e+80: tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_0 * (t_0 * ((alpha + beta) + 3.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 1e+80) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / Float64(t_0 * Float64(t_0 * Float64(Float64(alpha + beta) + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 1e+80)
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_0 * (t_0 * ((alpha + beta) + 3.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+80], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+80}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\left(\alpha + \beta\right) + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 1e80Initial program 99.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
Simplified93.6%
if 1e80 < beta Initial program 67.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.9%
Applied egg-rr99.9%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
Taylor expanded in beta around inf
+-lowering-+.f6484.2%
Simplified84.2%
Final simplification91.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 2.05e+80)
(* (+ 1.0 beta) (/ (+ alpha 1.0) (* t_0 (* t_0 (+ beta (+ alpha 3.0))))))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.05e+80) {
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 2.05d+80) then
tmp = (1.0d0 + beta) * ((alpha + 1.0d0) / (t_0 * (t_0 * (beta + (alpha + 3.0d0)))))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.05e+80) {
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 2.05e+80: tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0))))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.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 <= 2.05e+80) tmp = Float64(Float64(1.0 + beta) * Float64(Float64(alpha + 1.0) / Float64(t_0 * Float64(t_0 * Float64(beta + Float64(alpha + 3.0)))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 2.05e+80)
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.05e+80], N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.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 2.05 \cdot 10^{+80}:\\
\;\;\;\;\left(1 + \beta\right) \cdot \frac{\alpha + 1}{t\_0 \cdot \left(t\_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.05000000000000001e80Initial program 99.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
Simplified93.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-+r+N/A
+-commutativeN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr94.0%
if 2.05000000000000001e80 < beta Initial program 67.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.9%
Applied egg-rr99.9%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
Taylor expanded in beta around inf
+-lowering-+.f6484.2%
Simplified84.2%
Final simplification91.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= alpha 2.1)
(/ (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 2.0 beta))) (+ 1.0 t_0))
(/ (/ (/ alpha (/ t_0 (+ 1.0 beta))) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (alpha <= 2.1) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + t_0);
} else {
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / 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 = 2.0d0 + (alpha + beta)
if (alpha <= 2.1d0) then
tmp = ((1.0d0 + beta) / ((2.0d0 + beta) * (2.0d0 + beta))) / (1.0d0 + t_0)
else
tmp = ((alpha / (t_0 / (1.0d0 + beta))) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (alpha <= 2.1) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + t_0);
} else {
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if alpha <= 2.1: tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + t_0) else: tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (alpha <= 2.1) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(2.0 + beta))) / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(alpha / Float64(t_0 / Float64(1.0 + beta))) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (alpha <= 2.1)
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + t_0);
else
tmp = ((alpha / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2.1], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\alpha \leq 2.1:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(2 + \beta\right)}}{1 + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha}{\frac{t\_0}{1 + \beta}}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 2.10000000000000009Initial program 99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.7%
Simplified98.7%
if 2.10000000000000009 < alpha Initial program 77.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in alpha around inf
Simplified99.3%
Final simplification98.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 (<= alpha 1.9)
(/
(/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 2.0 beta)))
(+ 1.0 (+ 2.0 (+ alpha beta))))
(/ (/ (/ alpha (+ beta (+ alpha 3.0))) (/ t_0 (+ 1.0 beta))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 1.9) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha / (beta + (alpha + 3.0))) / (t_0 / (1.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 = alpha + (2.0d0 + beta)
if (alpha <= 1.9d0) then
tmp = ((1.0d0 + beta) / ((2.0d0 + beta) * (2.0d0 + beta))) / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha / (beta + (alpha + 3.0d0))) / (t_0 / (1.0d0 + 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 (alpha <= 1.9) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha / (beta + (alpha + 3.0))) / (t_0 / (1.0 + beta))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if alpha <= 1.9: tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha / (beta + (alpha + 3.0))) / (t_0 / (1.0 + 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 (alpha <= 1.9) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(2.0 + beta))) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha / Float64(beta + Float64(alpha + 3.0))) / Float64(t_0 / Float64(1.0 + 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 (alpha <= 1.9)
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha / (beta + (alpha + 3.0))) / (t_0 / (1.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[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 1.9], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 1.9:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(2 + \beta\right)}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha}{\beta + \left(\alpha + 3\right)}}{\frac{t\_0}{1 + \beta}}}{t\_0}\\
\end{array}
\end{array}
if alpha < 1.8999999999999999Initial program 99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.7%
Simplified98.7%
if 1.8999999999999999 < alpha Initial program 77.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in alpha around inf
Simplified99.3%
Final simplification98.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (/ (/ (/ (+ alpha 1.0) (/ t_0 (+ 1.0 beta))) (+ alpha (+ beta 3.0))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = 2.0d0 + (alpha + beta)
code = (((alpha + 1.0d0) / (t_0 / (1.0d0 + beta))) / (alpha + (beta + 3.0d0))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(t_0 / Float64(1.0 + beta))) / Float64(alpha + Float64(beta + 3.0))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + (beta + 3.0))) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{\frac{\alpha + 1}{\frac{t\_0}{1 + \beta}}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 92.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.9%
Applied egg-rr99.9%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
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)))) (/ (/ (/ (+ alpha 1.0) (+ beta (+ alpha 3.0))) (/ t_0 (+ 1.0 beta))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((alpha + 1.0) / (beta + (alpha + 3.0))) / (t_0 / (1.0 + beta))) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (2.0d0 + beta)
code = (((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) / (t_0 / (1.0d0 + beta))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((alpha + 1.0) / (beta + (alpha + 3.0))) / (t_0 / (1.0 + beta))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((alpha + 1.0) / (beta + (alpha + 3.0))) / (t_0 / (1.0 + beta))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) / Float64(t_0 / Float64(1.0 + beta))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((alpha + 1.0) / (beta + (alpha + 3.0))) / (t_0 / (1.0 + beta))) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)}}{\frac{t\_0}{1 + \beta}}}{t\_0}
\end{array}
\end{array}
Initial program 92.2%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.9%
Applied egg-rr99.9%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
/-lowering-/.f64N/A
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))) (t_1 (+ 1.0 t_0)))
(if (<= beta 6.6e+15)
(/ (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 2.0 beta))) t_1)
(/ (/ (+ alpha 1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 6.6e+15) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / t_1;
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
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 = 2.0d0 + (alpha + beta)
t_1 = 1.0d0 + t_0
if (beta <= 6.6d+15) then
tmp = ((1.0d0 + beta) / ((2.0d0 + beta) * (2.0d0 + beta))) / t_1
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = 1.0 + t_0;
double tmp;
if (beta <= 6.6e+15) {
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / t_1;
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) t_1 = 1.0 + t_0 tmp = 0 if beta <= 6.6e+15: tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / t_1 else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) t_1 = Float64(1.0 + t_0) tmp = 0.0 if (beta <= 6.6e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(2.0 + beta))) / t_1); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
t_1 = 1.0 + t_0;
tmp = 0.0;
if (beta <= 6.6e+15)
tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / t_1;
else
tmp = ((alpha + 1.0) / t_0) / t_1;
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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + t$95$0), $MachinePrecision]}, If[LessEqual[beta, 6.6e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
t_1 := 1 + t\_0\\
\mathbf{if}\;\beta \leq 6.6 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(2 + \beta\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 6.6e15Initial program 99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6468.7%
Simplified68.7%
if 6.6e15 < beta Initial program 74.3%
Taylor expanded in beta around inf
+-lowering-+.f6482.6%
Simplified82.6%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 3.8e+15)
(/ (+ 1.0 beta) (+ 12.0 (* beta (+ 16.0 (* beta (+ beta 7.0))))))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.8e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + 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 = 2.0d0 + (alpha + beta)
if (beta <= 3.8d+15) then
tmp = (1.0d0 + beta) / (12.0d0 + (beta * (16.0d0 + (beta * (beta + 7.0d0)))))
else
tmp = ((alpha + 1.0d0) / t_0) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.8e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 3.8e+15: tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0))))) else: tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.8e+15) tmp = Float64(Float64(1.0 + beta) / Float64(12.0 + Float64(beta * Float64(16.0 + Float64(beta * Float64(beta + 7.0)))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 3.8e+15)
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
else
tmp = ((alpha + 1.0) / t_0) / (1.0 + 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.8e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(12.0 + N[(beta * N[(16.0 + N[(beta * N[(beta + 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{12 + \beta \cdot \left(16 + \beta \cdot \left(\beta + 7\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 3.8e15Initial program 99.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
Simplified94.4%
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.6%
Simplified66.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6466.6%
Simplified66.6%
if 3.8e15 < beta Initial program 74.3%
Taylor expanded in beta around inf
+-lowering-+.f6482.6%
Simplified82.6%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5e+15) (/ (+ 1.0 beta) (+ 12.0 (* beta (+ 16.0 (* beta (+ beta 7.0)))))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.5d+15) then
tmp = (1.0d0 + beta) / (12.0d0 + (beta * (16.0d0 + (beta * (beta + 7.0d0)))))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.5e+15: tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0))))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.5e+15) tmp = Float64(Float64(1.0 + beta) / Float64(12.0 + Float64(beta * Float64(16.0 + Float64(beta * Float64(beta + 7.0)))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.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 <= 5.5e+15)
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.5e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(12.0 + N[(beta * N[(16.0 + N[(beta * N[(beta + 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{12 + \beta \cdot \left(16 + \beta \cdot \left(\beta + 7\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 5.5e15Initial program 99.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
Simplified94.4%
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.6%
Simplified66.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6466.6%
Simplified66.6%
if 5.5e15 < beta Initial program 74.3%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6482.6%
Simplified82.6%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.9e+15) (/ (+ 1.0 beta) (+ 12.0 (* beta (+ 16.0 (* beta (+ beta 7.0)))))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.9e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.9d+15) then
tmp = (1.0d0 + beta) / (12.0d0 + (beta * (16.0d0 + (beta * (beta + 7.0d0)))))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.9e+15) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.9e+15: tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0))))) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.9e+15) tmp = Float64(Float64(1.0 + beta) / Float64(12.0 + Float64(beta * Float64(16.0 + Float64(beta * Float64(beta + 7.0)))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.9e+15)
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.9e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(12.0 + N[(beta * N[(16.0 + N[(beta * N[(beta + 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.9 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{12 + \beta \cdot \left(16 + \beta \cdot \left(\beta + 7\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 8.9e15Initial program 99.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
Simplified94.4%
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.6%
Simplified66.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6466.6%
Simplified66.6%
if 8.9e15 < beta Initial program 74.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.1%
Simplified82.1%
Final simplification71.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+16) (/ (+ 1.0 beta) (+ 12.0 (* beta (+ 16.0 (* beta (+ beta 7.0)))))) (/ (/ (+ alpha 1.0) beta) (+ 2.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+16) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3d+16) then
tmp = (1.0d0 + beta) / (12.0d0 + (beta * (16.0d0 + (beta * (beta + 7.0d0)))))
else
tmp = ((alpha + 1.0d0) / beta) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+16) {
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3e+16: tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0))))) else: tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+16) tmp = Float64(Float64(1.0 + beta) / Float64(12.0 + Float64(beta * Float64(16.0 + Float64(beta * Float64(beta + 7.0)))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(2.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 <= 3e+16)
tmp = (1.0 + beta) / (12.0 + (beta * (16.0 + (beta * (beta + 7.0)))));
else
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(12.0 + N[(beta * N[(16.0 + N[(beta * N[(beta + 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{12 + \beta \cdot \left(16 + \beta \cdot \left(\beta + 7\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 3e16Initial program 99.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
Simplified94.4%
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.6%
Simplified66.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6466.6%
Simplified66.6%
if 3e16 < beta Initial program 74.3%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.1%
Simplified82.1%
Final simplification71.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.65e+16) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ 2.0 beta) (+ 2.0 beta)))) (/ (/ (+ alpha 1.0) beta) (+ 2.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e+16) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (2.0 + beta)));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.65d+16) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((2.0d0 + beta) * (2.0d0 + beta)))
else
tmp = ((alpha + 1.0d0) / beta) / (2.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.65e+16) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (2.0 + beta)));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.65e+16: tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (2.0 + beta))) else: tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.65e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(Float64(2.0 + beta) * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(2.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.65e+16)
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (2.0 + beta)));
else
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.65e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.65 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\left(2 + \beta\right) \cdot \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.65e16Initial program 99.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
Simplified94.4%
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.6%
Simplified66.6%
if 2.65e16 < beta Initial program 74.3%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6482.1%
Simplified82.1%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7.8)
(/ 0.25 (+ alpha (+ beta 3.0)))
(if (<= beta 3.3e+162)
(/ (+ alpha 1.0) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else if (beta <= 3.3e+162) {
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 <= 7.8d0) then
tmp = 0.25d0 / (alpha + (beta + 3.0d0))
else if (beta <= 3.3d+162) 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 <= 7.8) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else if (beta <= 3.3e+162) {
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 <= 7.8: tmp = 0.25 / (alpha + (beta + 3.0)) elif beta <= 3.3e+162: 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 <= 7.8) tmp = Float64(0.25 / Float64(alpha + Float64(beta + 3.0))); elseif (beta <= 3.3e+162) 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 <= 7.8)
tmp = 0.25 / (alpha + (beta + 3.0));
elseif (beta <= 3.3e+162)
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, 7.8], N[(0.25 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.3e+162], 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 7.8:\\
\;\;\;\;\frac{0.25}{\alpha + \left(\beta + 3\right)}\\
\mathbf{elif}\;\beta \leq 3.3 \cdot 10^{+162}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999982Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.1%
Simplified99.1%
Taylor expanded in alpha around 0
Simplified67.9%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6467.9%
Applied egg-rr67.9%
if 7.79999999999999982 < beta < 3.29999999999999987e162Initial program 85.7%
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
Simplified63.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6474.2%
Simplified74.2%
if 3.29999999999999987e162 < beta Initial program 63.7%
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
Simplified63.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6488.0%
Simplified88.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6490.1%
Applied egg-rr90.1%
Taylor expanded in alpha around inf
Simplified90.1%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.4) (/ 0.25 (+ alpha (+ beta 3.0))) (/ (/ (+ alpha 1.0) beta) (+ 2.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.4d0) then
tmp = 0.25d0 / (alpha + (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.4: tmp = 0.25 / (alpha + (beta + 3.0)) else: tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.4) tmp = Float64(0.25 / Float64(alpha + Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(2.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 <= 5.4)
tmp = 0.25 / (alpha + (beta + 3.0));
else
tmp = ((alpha + 1.0) / beta) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.4], N[(0.25 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.4:\\
\;\;\;\;\frac{0.25}{\alpha + \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.1%
Simplified99.1%
Taylor expanded in alpha around 0
Simplified67.9%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6467.9%
Applied egg-rr67.9%
if 5.4000000000000004 < beta Initial program 75.3%
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
metadata-evalN/A
associate-+r+N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6481.9%
Simplified81.9%
Final simplification72.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.25 (+ alpha (+ beta 3.0))) (if (<= beta 1.05e+160) (/ (/ 1.0 beta) beta) (/ (/ alpha beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else if (beta <= 1.05e+160) {
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 <= 6.5d0) then
tmp = 0.25d0 / (alpha + (beta + 3.0d0))
else if (beta <= 1.05d+160) 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 <= 6.5) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else if (beta <= 1.05e+160) {
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 <= 6.5: tmp = 0.25 / (alpha + (beta + 3.0)) elif beta <= 1.05e+160: 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 <= 6.5) tmp = Float64(0.25 / Float64(alpha + Float64(beta + 3.0))); elseif (beta <= 1.05e+160) 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 <= 6.5)
tmp = 0.25 / (alpha + (beta + 3.0));
elseif (beta <= 1.05e+160)
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, 6.5], N[(0.25 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.05e+160], 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 6.5:\\
\;\;\;\;\frac{0.25}{\alpha + \left(\beta + 3\right)}\\
\mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.1%
Simplified99.1%
Taylor expanded in alpha around 0
Simplified67.9%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6467.9%
Applied egg-rr67.9%
if 6.5 < beta < 1.04999999999999998e160Initial program 85.7%
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
Simplified63.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6474.2%
Simplified74.2%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6474.0%
Applied egg-rr74.0%
Taylor expanded in alpha around 0
Simplified67.1%
if 1.04999999999999998e160 < beta Initial program 63.7%
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
Simplified63.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6488.0%
Simplified88.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6490.1%
Applied egg-rr90.1%
Taylor expanded in alpha around inf
Simplified90.1%
Final simplification71.0%
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 (* alpha -0.027777777777777776)) (if (<= beta 1.2e+160) (/ (/ 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 + (alpha * -0.027777777777777776);
} else if (beta <= 1.2e+160) {
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 + (alpha * (-0.027777777777777776d0))
else if (beta <= 1.2d+160) 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 + (alpha * -0.027777777777777776);
} else if (beta <= 1.2e+160) {
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 + (alpha * -0.027777777777777776) elif beta <= 1.2e+160: 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(alpha * -0.027777777777777776)); elseif (beta <= 1.2e+160) 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 + (alpha * -0.027777777777777776);
elseif (beta <= 1.2e+160)
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[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.2e+160], 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 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.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
Simplified94.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6493.3%
Simplified93.3%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
if 2.7999999999999998 < beta < 1.2000000000000001e160Initial program 85.7%
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
Simplified63.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6474.2%
Simplified74.2%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6474.0%
Applied egg-rr74.0%
Taylor expanded in alpha around 0
Simplified67.1%
if 1.2000000000000001e160 < beta Initial program 63.7%
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
Simplified63.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6488.0%
Simplified88.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6490.1%
Applied egg-rr90.1%
Taylor expanded in alpha around inf
Simplified90.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.25 (+ alpha (+ beta 3.0))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.25 / (alpha + (beta + 3.0));
} 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 <= 6.5d0) then
tmp = 0.25d0 / (alpha + (beta + 3.0d0))
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 <= 6.5) {
tmp = 0.25 / (alpha + (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = 0.25 / (alpha + (beta + 3.0)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(0.25 / Float64(alpha + Float64(beta + 3.0))); 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 <= 6.5)
tmp = 0.25 / (alpha + (beta + 3.0));
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, 6.5], N[(0.25 / N[(alpha + N[(beta + 3.0), $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 6.5:\\
\;\;\;\;\frac{0.25}{\alpha + \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.1%
Simplified99.1%
Taylor expanded in alpha around 0
Simplified67.9%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6467.9%
Applied egg-rr67.9%
if 6.5 < beta Initial program 75.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
Simplified63.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6480.7%
Simplified80.7%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6481.7%
Applied egg-rr81.7%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ 1.0 beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -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 <= 3.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-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 <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -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 <= 3.1)
tmp = 0.08333333333333333 + (alpha * -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, 3.1], N[(0.08333333333333333 + N[(alpha * -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 3.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.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
Simplified94.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6493.3%
Simplified93.3%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
if 3.10000000000000009 < beta Initial program 75.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
Simplified63.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6480.7%
Simplified80.7%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6481.7%
Applied egg-rr81.7%
Taylor expanded in alpha around 0
Simplified77.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -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 <= 3.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-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 <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -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 <= 3.1)
tmp = 0.08333333333333333 + (alpha * -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, 3.1], N[(0.08333333333333333 + N[(alpha * -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 3.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.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
Simplified94.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6493.3%
Simplified93.3%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
if 3.10000000000000009 < beta Initial program 75.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
Simplified63.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6480.7%
Simplified80.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6477.1%
Simplified77.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 7.6e+145) (/ 0.25 (+ beta 3.0)) (/ 1.0 (* alpha alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.6e+145) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (alpha * alpha);
}
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 (alpha <= 7.6d+145) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = 1.0d0 / (alpha * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.6e+145) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (alpha * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 7.6e+145: tmp = 0.25 / (beta + 3.0) else: tmp = 1.0 / (alpha * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7.6e+145) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(1.0 / Float64(alpha * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 7.6e+145)
tmp = 0.25 / (beta + 3.0);
else
tmp = 1.0 / (alpha * alpha);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 7.6e+145], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(alpha * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7.6 \cdot 10^{+145}:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \alpha}\\
\end{array}
\end{array}
if alpha < 7.60000000000000025e145Initial program 98.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6473.5%
Simplified73.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6457.4%
Simplified57.4%
if 7.60000000000000025e145 < alpha Initial program 63.1%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6477.3%
Simplified77.3%
Taylor expanded in alpha around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6477.3%
Simplified77.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.25 / 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.6d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.25 / 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.6], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.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
Simplified94.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6493.3%
Simplified93.3%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6465.7%
Simplified65.7%
if 2.60000000000000009 < beta Initial program 75.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6419.5%
Simplified19.5%
Taylor expanded in alpha around 0
Simplified7.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 3.0) 0.08333333333333333 (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / 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.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = 0.08333333333333333; else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333;
else
tmp = 0.25 / 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.0], 0.08333333333333333, N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.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
Simplified94.3%
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.0%
Simplified66.0%
Taylor expanded in beta around 0
Simplified65.2%
if 3 < beta Initial program 75.3%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6419.5%
Simplified19.5%
Taylor expanded in alpha around 0
Simplified7.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.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 92.2%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6474.2%
Simplified74.2%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6447.5%
Simplified47.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ alpha 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (alpha + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (alpha + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(alpha + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (alpha + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\alpha + 3}
\end{array}
Initial program 92.2%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6474.2%
Simplified74.2%
Taylor expanded in alpha around 0
Simplified49.1%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f6448.1%
Simplified48.1%
Final simplification48.1%
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 92.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
Simplified84.6%
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-+.f6468.1%
Simplified68.1%
Taylor expanded in beta around 0
Simplified46.1%
herbie shell --seed 2024141
(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)))