
(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 24 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.04e+15)
(* (+ 1.0 beta) (/ (+ alpha 1.0) (* t_0 (* t_0 (+ beta (+ alpha 3.0))))))
(/ (/ (/ (+ alpha 1.0) (/ t_0 (+ 1.0 beta))) (+ alpha beta)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.04e+15) {
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
} else {
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.04d+15) then
tmp = (1.0d0 + beta) * ((alpha + 1.0d0) / (t_0 * (t_0 * (beta + (alpha + 3.0d0)))))
else
tmp = (((alpha + 1.0d0) / (t_0 / (1.0d0 + beta))) / (alpha + beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.04e+15) {
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
} else {
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.04e+15: tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0))))) else: tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.04e+15) 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(Float64(alpha + 1.0) / Float64(t_0 / Float64(1.0 + beta))) / Float64(alpha + beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.04e+15)
tmp = (1.0 + beta) * ((alpha + 1.0) / (t_0 * (t_0 * (beta + (alpha + 3.0)))));
else
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.04e+15], 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[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.04 \cdot 10^{+15}:\\
\;\;\;\;\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{\frac{\alpha + 1}{\frac{t\_0}{1 + \beta}}}{\alpha + \beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.04e15Initial 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
Simplified93.4%
*-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-rr93.4%
if 1.04e15 < beta Initial program 76.8%
+-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.7%
Applied egg-rr99.7%
associate-/l/N/A
div-invN/A
associate-*r*N/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in beta around inf
Simplified99.6%
Final simplification95.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 88000000000000.0)
(/
(/ 1.0 (+ beta (+ alpha 3.0)))
(/ (* (+ beta 2.0) (+ beta 2.0)) (+ 1.0 beta)))
(/ (/ (/ (+ alpha 1.0) (/ t_0 (+ 1.0 beta))) (+ alpha beta)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 88000000000000.0) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
} else {
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 88000000000000.0d0) then
tmp = (1.0d0 / (beta + (alpha + 3.0d0))) / (((beta + 2.0d0) * (beta + 2.0d0)) / (1.0d0 + beta))
else
tmp = (((alpha + 1.0d0) / (t_0 / (1.0d0 + beta))) / (alpha + beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 88000000000000.0) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
} else {
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 88000000000000.0: tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta)) else: tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 88000000000000.0) tmp = Float64(Float64(1.0 / Float64(beta + Float64(alpha + 3.0))) / Float64(Float64(Float64(beta + 2.0) * Float64(beta + 2.0)) / Float64(1.0 + beta))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(t_0 / Float64(1.0 + beta))) / Float64(alpha + beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 88000000000000.0)
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
else
tmp = (((alpha + 1.0) / (t_0 / (1.0 + beta))) / (alpha + beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 88000000000000.0], N[(N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 88000000000000:\\
\;\;\;\;\frac{\frac{1}{\beta + \left(\alpha + 3\right)}}{\frac{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha + 1}{\frac{t\_0}{1 + \beta}}}{\alpha + \beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 8.8e13Initial 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
Simplified93.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6469.7%
Simplified69.7%
if 8.8e13 < beta Initial program 77.1%
+-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.7%
Applied egg-rr99.7%
associate-/l/N/A
div-invN/A
associate-*r*N/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in beta around inf
Simplified99.6%
Final simplification78.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= alpha 53.0)
(/ (/ 1.0 (+ beta (+ alpha 3.0))) (/ t_0 (/ (+ 1.0 beta) (+ beta 2.0))))
(/ (* beta (/ (/ alpha t_0) (+ alpha (+ beta 3.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 53.0) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (t_0 / ((1.0 + beta) / (beta + 2.0)));
} else {
tmp = (beta * ((alpha / t_0) / (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 = alpha + (beta + 2.0d0)
if (alpha <= 53.0d0) then
tmp = (1.0d0 / (beta + (alpha + 3.0d0))) / (t_0 / ((1.0d0 + beta) / (beta + 2.0d0)))
else
tmp = (beta * ((alpha / t_0) / (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 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 53.0) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (t_0 / ((1.0 + beta) / (beta + 2.0)));
} else {
tmp = (beta * ((alpha / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if alpha <= 53.0: tmp = (1.0 / (beta + (alpha + 3.0))) / (t_0 / ((1.0 + beta) / (beta + 2.0))) else: tmp = (beta * ((alpha / t_0) / (alpha + (beta + 3.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= 53.0) tmp = Float64(Float64(1.0 / Float64(beta + Float64(alpha + 3.0))) / Float64(t_0 / Float64(Float64(1.0 + beta) / Float64(beta + 2.0)))); else tmp = Float64(Float64(beta * Float64(Float64(alpha / t_0) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (alpha <= 53.0)
tmp = (1.0 / (beta + (alpha + 3.0))) / (t_0 / ((1.0 + beta) / (beta + 2.0)));
else
tmp = (beta * ((alpha / t_0) / (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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 53.0], N[(N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(beta * N[(N[(alpha / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq 53:\\
\;\;\;\;\frac{\frac{1}{\beta + \left(\alpha + 3\right)}}{\frac{t\_0}{\frac{1 + \beta}{\beta + 2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta \cdot \frac{\frac{\alpha}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 53Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Applied egg-rr99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.3%
Simplified98.3%
if 53 < alpha Initial program 79.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
Simplified59.0%
Taylor expanded in beta around inf
Simplified43.4%
Taylor expanded in alpha around inf
*-commutativeN/A
*-lowering-*.f6443.4%
Simplified43.4%
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-+r+N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-+r+N/A
+-commutativeN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-commutativeN/A
Applied egg-rr72.5%
Final simplification89.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (/ (+ 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 = alpha + (beta + 2.0);
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 = alpha + (beta + 2.0d0)
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 = alpha + (beta + 2.0);
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 = alpha + (beta + 2.0) 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(alpha + Float64(beta + 2.0)) 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 = alpha + (beta + 2.0);
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[(alpha + N[(beta + 2.0), $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 := \alpha + \left(\beta + 2\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.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.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
div-invN/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 (+ beta 2.0)))) (/ (* (+ alpha 1.0) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (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 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) * (((1.0 + beta) / t_0) / (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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\left(\alpha + 1\right) \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 92.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.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
associate-+r+N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-/l/N/A
+-commutativeN/A
associate-/l/N/A
div-invN/A
clear-numN/A
remove-double-divN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/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 (+ beta 2.0)))) (* (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))) (/ (+ alpha 1.0) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((alpha + 1.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 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) * ((alpha + 1.0d0) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(alpha + 1.0) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((alpha + 1.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{\alpha + 1}{t\_0}
\end{array}
\end{array}
Initial program 92.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.8%
Applied egg-rr99.8%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
+-commutativeN/A
metadata-evalN/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
(if (<= beta 8.8e+15)
(/
(/ 1.0 (+ beta (+ alpha 3.0)))
(/ (* (+ beta 2.0) (+ beta 2.0)) (+ 1.0 beta)))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.8e+15) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.8d+15) then
tmp = (1.0d0 / (beta + (alpha + 3.0d0))) / (((beta + 2.0d0) * (beta + 2.0d0)) / (1.0d0 + beta))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.8e+15) {
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.8e+15: tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta)) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.8e+15) tmp = Float64(Float64(1.0 / Float64(beta + Float64(alpha + 3.0))) / Float64(Float64(Float64(beta + 2.0) * Float64(beta + 2.0)) / Float64(1.0 + beta))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.8e+15)
tmp = (1.0 / (beta + (alpha + 3.0))) / (((beta + 2.0) * (beta + 2.0)) / (1.0 + beta));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.8e+15], N[(N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1}{\beta + \left(\alpha + 3\right)}}{\frac{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 8.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
Simplified93.4%
Applied egg-rr99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6469.3%
Simplified69.3%
if 8.8e15 < beta Initial program 76.8%
Taylor expanded in beta around inf
+-lowering-+.f6477.3%
Simplified77.3%
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f6477.3%
Applied egg-rr77.3%
Final simplification71.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 2.0))))
(if (<= beta 9e+15)
(/ (/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 3.0))) t_0)
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 9e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (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 = alpha + (beta + 2.0d0)
if (beta <= 9d+15) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 3.0d0))) / t_0
else
tmp = ((alpha + 1.0d0) / (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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 9e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 9e+15: tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0 else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 9e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 9e+15)
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
else
tmp = ((alpha + 1.0) / (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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 9e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 9 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 9e15Initial 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.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6468.8%
Simplified68.8%
if 9e15 < beta Initial program 76.8%
Taylor expanded in beta around inf
+-lowering-+.f6477.3%
Simplified77.3%
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f6477.3%
Applied egg-rr77.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2e+42) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0)))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+42) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2d+42) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+42) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+42: tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+42) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+42)
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2e+42], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+42}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.00000000000000009e42Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified92.7%
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.3%
Simplified68.3%
if 2.00000000000000009e42 < beta Initial program 73.8%
Taylor expanded in beta around inf
+-lowering-+.f6477.1%
Simplified77.1%
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f6477.1%
Applied egg-rr77.1%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2e+42) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0)))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+42) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.2d+42) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+42) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2e+42: tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2e+42) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2e+42)
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.2e+42], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+42}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.1999999999999999e42Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified92.7%
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.3%
Simplified68.3%
if 1.1999999999999999e42 < beta Initial program 73.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6476.5%
Simplified76.5%
associate-/l/N/A
+-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6476.5%
Applied egg-rr76.5%
Final simplification70.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (/ (+ alpha 1.0) (* (+ alpha 3.0) (* (+ alpha 2.0) (+ alpha 2.0)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = (alpha + 1.0) / ((alpha + 3.0) * ((alpha + 2.0) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.0d0) then
tmp = (alpha + 1.0d0) / ((alpha + 3.0d0) * ((alpha + 2.0d0) * (alpha + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = (alpha + 1.0) / ((alpha + 3.0) * ((alpha + 2.0) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = (alpha + 1.0) / ((alpha + 3.0) * ((alpha + 2.0) * (alpha + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 3.0) * Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.0)
tmp = (alpha + 1.0) / ((alpha + 3.0) * ((alpha + 2.0) * (alpha + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.0], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 3\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 8Initial 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.2%
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.5%
Simplified93.5%
if 8 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6470.4%
Applied egg-rr70.4%
Final simplification85.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(*
alpha
(+
(* alpha (+ (* alpha 0.024691358024691357) -0.011574074074074073))
-0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) + (-0.011574074074074073d0))) + (-0.027777777777777776d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] + -0.011574074074074073), $MachinePrecision]), $MachinePrecision] + -0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 + -0.011574074074074073\right) + -0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6469.0%
Simplified69.0%
if 2.2000000000000002 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6470.4%
Applied egg-rr70.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 (* alpha -0.027777777777777776))
(if (<= beta 1.35e+154)
(/ (+ alpha 1.0) (* beta beta))
(/ 1.0 (* beta (/ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = 1.0 / (beta * (beta / 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 (beta <= 3.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 1.35d+154) then
tmp = (alpha + 1.0d0) / (beta * beta)
else
tmp = 1.0d0 / (beta * (beta / alpha))
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 + (alpha * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = 1.0 / (beta * (beta / alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 1.35e+154: tmp = (alpha + 1.0) / (beta * beta) else: tmp = 1.0 / (beta * (beta / alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 1.35e+154) tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); else tmp = Float64(1.0 / Float64(beta * Float64(beta / alpha))); 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 + (alpha * -0.027777777777777776);
elseif (beta <= 1.35e+154)
tmp = (alpha + 1.0) / (beta * beta);
else
tmp = 1.0 / (beta * (beta / 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[beta, 3.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \frac{\beta}{\alpha}}\\
\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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 3 < beta < 1.35000000000000003e154Initial program 91.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
Simplified63.4%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6462.1%
Simplified62.1%
if 1.35000000000000003e154 < beta Initial program 64.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
Simplified56.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6471.0%
Simplified71.0%
clear-numN/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-/l*N/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6476.6%
Applied egg-rr76.6%
Taylor expanded in alpha around inf
/-lowering-/.f6476.6%
Simplified76.6%
Final simplification68.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+ 0.08333333333333333 (* alpha -0.027777777777777776))
(if (<= beta 5e+152)
(/ 1.0 (* beta (+ beta 3.0)))
(/ 1.0 (* beta (/ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 5e+152) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = 1.0 / (beta * (beta / 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 (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 5d+152) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = 1.0d0 / (beta * (beta / alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 5e+152) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = 1.0 / (beta * (beta / alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 5e+152: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = 1.0 / (beta * (beta / alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 5e+152) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(1.0 / Float64(beta * Float64(beta / alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
elseif (beta <= 5e+152)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = 1.0 / (beta * (beta / 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[beta, 2.2], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5e+152], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+152}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \frac{\beta}{\alpha}}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 2.2000000000000002 < beta < 5e152Initial program 91.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6462.5%
Simplified62.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6460.6%
Simplified60.6%
if 5e152 < beta Initial program 64.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
Simplified56.3%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6471.0%
Simplified71.0%
clear-numN/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-/l*N/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6476.6%
Applied egg-rr76.6%
Taylor expanded in alpha around inf
/-lowering-/.f6476.6%
Simplified76.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(* alpha (+ -0.027777777777777776 (* alpha -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((-0.027777777777777776d0) + (alpha * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(-0.027777777777777776 + Float64(alpha * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.08333333333333333 + N[(alpha * N[(-0.027777777777777776 + N[(alpha * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(-0.027777777777777776 + \alpha \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 2.2000000000000002 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6470.4%
Applied egg-rr70.4%
Final simplification69.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.75)
(+
0.08333333333333333
(* alpha (+ -0.027777777777777776 (* alpha -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.75) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.75d0) then
tmp = 0.08333333333333333d0 + (alpha * ((-0.027777777777777776d0) + (alpha * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.75) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.75: tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.75) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(-0.027777777777777776 + Float64(alpha * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.75)
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.75], N[(0.08333333333333333 + N[(alpha * N[(-0.027777777777777776 + N[(alpha * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.75:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(-0.027777777777777776 + \alpha \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.75Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 1.75 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
Taylor expanded in alpha around 0
+-commutativeN/A
+-lowering-+.f6470.1%
Simplified70.1%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(+
0.08333333333333333
(* alpha (+ -0.027777777777777776 (* alpha -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d0) then
tmp = 0.08333333333333333d0 + (alpha * ((-0.027777777777777776d0) + (alpha * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(-0.027777777777777776 + Float64(alpha * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = 0.08333333333333333 + (alpha * (-0.027777777777777776 + (alpha * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(0.08333333333333333 + N[(alpha * N[(-0.027777777777777776 + N[(alpha * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(-0.027777777777777776 + \alpha \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 3.2999999999999998 < beta Initial program 79.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
Simplified60.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6466.1%
Simplified66.1%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6470.0%
Applied egg-rr70.0%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.4) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.4d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 3.39999999999999991 < beta Initial program 79.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
Simplified60.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6466.1%
Simplified66.1%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-lowering-+.f6470.0%
Applied egg-rr70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.05) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.05d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.05: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.05) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.05)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.05], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.05:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.0499999999999998Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 2.0499999999999998 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6465.3%
Simplified65.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
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 <= 2.7d0) 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 <= 2.7) {
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 <= 2.7: 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 <= 2.7) 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 <= 2.7)
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, 2.7], 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 2.7:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 2.7000000000000002 < beta Initial program 79.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
Simplified60.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6466.1%
Simplified66.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6465.2%
Simplified65.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 2.8) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* alpha alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 2.8) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 2.8d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 2.8) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (alpha * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 2.8: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (alpha * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 2.8) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 2.8)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 2.8], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 2.8:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \alpha}\\
\end{array}
\end{array}
if alpha < 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.7%
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-+.f6470.0%
Simplified70.0%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6469.9%
Simplified69.9%
if 2.7999999999999998 < alpha Initial program 79.4%
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
Simplified59.5%
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-+.f6464.5%
Simplified64.5%
Taylor expanded in alpha around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6472.9%
Simplified72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 11.0) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 11.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 11.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 11.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 11.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 11.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 11.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 11.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 11:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 11Initial 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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6468.6%
Simplified68.6%
if 11 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
Taylor expanded in alpha around inf
/-lowering-/.f646.9%
Simplified6.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.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.2%
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.5%
Simplified93.5%
Taylor expanded in alpha around 0
Simplified68.8%
if 12 < beta Initial program 79.2%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6470.4%
Simplified70.4%
Taylor expanded in alpha around inf
/-lowering-/.f646.9%
Simplified6.9%
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.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
Simplified82.7%
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-+.f6468.1%
Simplified68.1%
Taylor expanded in alpha around 0
Simplified47.1%
herbie shell --seed 2024145
(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)))