
(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 21 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 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+143)
(* (+ alpha 1.0) (/ (/ (+ 1.0 beta) t_1) (* t_1 t_0)))
(/ (/ (/ (+ alpha 1.0) (/ t_1 beta)) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+143) {
tmp = (alpha + 1.0) * (((1.0 + beta) / t_1) / (t_1 * t_0));
} else {
tmp = (((alpha + 1.0) / (t_1 / beta)) / t_0) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 5d+143) then
tmp = (alpha + 1.0d0) * (((1.0d0 + beta) / t_1) / (t_1 * t_0))
else
tmp = (((alpha + 1.0d0) / (t_1 / beta)) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+143) {
tmp = (alpha + 1.0) * (((1.0 + beta) / t_1) / (t_1 * t_0));
} else {
tmp = (((alpha + 1.0) / (t_1 / beta)) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+143: tmp = (alpha + 1.0) * (((1.0 + beta) / t_1) / (t_1 * t_0)) else: tmp = (((alpha + 1.0) / (t_1 / beta)) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+143) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(1.0 + beta) / t_1) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(t_1 / beta)) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5e+143)
tmp = (alpha + 1.0) * (((1.0 + beta) / t_1) / (t_1 * t_0));
else
tmp = (((alpha + 1.0) / (t_1 / beta)) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+143], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$1 / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+143}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{1 + \beta}{t\_1}}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha + 1}{\frac{t\_1}{\beta}}}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 5.00000000000000012e143Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.9%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr93.9%
if 5.00000000000000012e143 < beta Initial program 73.5%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified88.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
Taylor expanded in beta around inf
Simplified99.9%
Final simplification94.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 (<= beta 2.8e+15)
(/
(/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 2.0)))
(+ 1.0 (+ 2.0 (+ alpha beta))))
(/ (/ (/ (+ alpha 1.0) (/ t_0 beta)) (+ 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 <= 2.8e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (t_0 / beta)) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2.8d+15) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 2.0d0))) / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = (((alpha + 1.0d0) / (t_0 / beta)) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.8e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (t_0 / beta)) / (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 <= 2.8e+15: tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta))) else: tmp = (((alpha + 1.0) / (t_0 / beta)) / (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 <= 2.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(t_0 / beta)) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.8e+15)
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
else
tmp = (((alpha + 1.0) / (t_0 / beta)) / (alpha + (beta + 3.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 / beta), $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)\\
\mathbf{if}\;\beta \leq 2.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\alpha + 1}{\frac{t\_0}{\beta}}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.8e15Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6465.0%
Simplified65.0%
if 2.8e15 < beta Initial program 84.1%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.1%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
Simplified99.8%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (/ (+ 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 95.6%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified97.2%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/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) t_0) t_0) (/ (+ 1.0 beta) (+ 3.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((alpha + 1.0d0) / t_0) / t_0) * ((1.0d0 + beta) / (3.0d0 + (alpha + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((alpha + 1.0) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(3.0 + Float64(alpha + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((alpha + 1.0) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{3 + \left(\alpha + \beta\right)}
\end{array}
\end{array}
Initial program 95.6%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified97.2%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
associate-/l/N/A
associate-/r/N/A
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7e+15)
(/
(/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 2.0)))
(+ 1.0 (+ 2.0 (+ alpha beta))))
(/
(/ (* (+ -1.0 (/ (+ alpha 2.0) beta)) (- -1.0 alpha)) beta)
(+ 3.0 (+ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7d+15) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 2.0d0))) / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((((-1.0d0) + ((alpha + 2.0d0) / beta)) * ((-1.0d0) - alpha)) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7e+15: tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta))) else: tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(Float64(-1.0 + Float64(Float64(alpha + 2.0) / beta)) * Float64(-1.0 - alpha)) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7e+15)
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + (2.0 + (alpha + beta)));
else
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / (3.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(-1.0 + N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 + \frac{\alpha + 2}{\beta}\right) \cdot \left(-1 - \alpha\right)}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 7e15Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6465.0%
Simplified65.0%
if 7e15 < beta Initial program 84.1%
Taylor expanded in beta around inf
+-lowering-+.f6491.3%
Simplified91.3%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6491.3%
Applied egg-rr91.3%
Taylor expanded in beta around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
mul-1-negN/A
neg-lowering-neg.f6490.8%
Simplified90.8%
Final simplification72.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ alpha beta))))
(if (<= beta 1.75e+15)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 2.0))))
(/ (/ (* (+ -1.0 (/ (+ alpha 2.0) beta)) (- -1.0 alpha)) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 1.75e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 3.0d0 + (alpha + beta)
if (beta <= 1.75d+15) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((((-1.0d0) + ((alpha + 2.0d0) / beta)) * ((-1.0d0) - alpha)) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 1.75e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (alpha + beta) tmp = 0 if beta <= 1.75e+15: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0))) else: tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 1.75e+15) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(Float64(-1.0 + Float64(Float64(alpha + 2.0) / beta)) * Float64(-1.0 - alpha)) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 1.75e+15)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
else
tmp = (((-1.0 + ((alpha + 2.0) / beta)) * (-1.0 - alpha)) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.75e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(-1.0 + N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 1.75 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{t\_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(-1 + \frac{\alpha + 2}{\beta}\right) \cdot \left(-1 - \alpha\right)}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.75e15Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
associate-/l/N/A
associate-/r/N/A
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6465.0%
Simplified65.0%
if 1.75e15 < beta Initial program 84.1%
Taylor expanded in beta around inf
+-lowering-+.f6491.3%
Simplified91.3%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6491.3%
Applied egg-rr91.3%
Taylor expanded in beta around -inf
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
mul-1-negN/A
neg-lowering-neg.f6490.8%
Simplified90.8%
Final simplification72.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ alpha beta))))
(if (<= beta 8.2e+15)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 8.2e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.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 = 3.0d0 + (alpha + beta)
if (beta <= 8.2d+15) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 8.2e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (alpha + beta) tmp = 0 if beta <= 8.2e+15: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 8.2e+15) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 8.2e+15)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.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[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.2e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / 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 + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 8.2 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{t\_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 8.2e15Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
associate-/l/N/A
associate-/r/N/A
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr99.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6465.0%
Simplified65.0%
if 8.2e15 < beta Initial program 84.1%
Taylor expanded in beta around inf
+-lowering-+.f6491.3%
Simplified91.3%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6491.3%
Applied egg-rr91.3%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (3.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.8d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (3.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.8e15Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
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-+.f6463.5%
Simplified63.5%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6463.5%
Applied egg-rr63.5%
if 4.8e15 < beta Initial program 84.1%
Taylor expanded in beta around inf
+-lowering-+.f6491.3%
Simplified91.3%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
metadata-evalN/A
associate-+r+N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6491.3%
Applied egg-rr91.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4e+16) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4d+16) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+16: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4e+16)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 4e16Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
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-+.f6463.5%
Simplified63.5%
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6463.5%
Applied egg-rr63.5%
if 4e16 < beta Initial program 84.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6491.2%
Simplified91.2%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.15e+17) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0)))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+17) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.15d+17) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+17) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.15e+17: tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.15e+17) 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) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.15e+17)
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.15e+17], 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] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+17}:\\
\;\;\;\;\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}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 1.15e17Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
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-+.f6463.5%
Simplified63.5%
if 1.15e17 < beta Initial program 84.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6491.2%
Simplified91.2%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.6e+16) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ beta 2.0) (+ beta 2.0)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6e+16) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.6d+16) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((beta + 2.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6e+16) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.6e+16: tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.6e+16) 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) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.6e+16)
tmp = (1.0 + beta) / ((beta + 3.0) * ((beta + 2.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.6e+16], 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] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.6 \cdot 10^{+16}:\\
\;\;\;\;\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}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 5.6e16Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.8%
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-+.f6463.5%
Simplified63.5%
if 5.6e16 < beta Initial program 84.1%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.1%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6491.2%
Simplified91.2%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.85)
(+
0.08333333333333333
(*
beta
(+
(* beta (+ (* beta 0.024691358024691357) -0.011574074074074073))
-0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.85d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * ((beta * 0.024691358024691357d0) + (-0.011574074074074073d0))) + (-0.027777777777777776d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.85: tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.85) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * Float64(Float64(beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.85)
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) + -0.011574074074074073)) + -0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.85], N[(0.08333333333333333 + N[(beta * N[(N[(beta * N[(N[(beta * 0.024691358024691357), $MachinePrecision] + -0.011574074074074073), $MachinePrecision]), $MachinePrecision] + -0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot \left(\beta \cdot 0.024691358024691357 + -0.011574074074074073\right) + -0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.8500000000000001Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.2%
Simplified63.2%
if 1.8500000000000001 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.7%
Simplified86.7%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.56)
(+
0.08333333333333333
(* beta (+ -0.027777777777777776 (* beta -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.56) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.56d0) then
tmp = 0.08333333333333333d0 + (beta * ((-0.027777777777777776d0) + (beta * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.56) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.56: tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.56) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(-0.027777777777777776 + Float64(beta * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.56)
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.56], N[(0.08333333333333333 + N[(beta * N[(-0.027777777777777776 + N[(beta * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.56:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(-0.027777777777777776 + \beta \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.5600000000000001Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.1%
Simplified63.1%
if 1.5600000000000001 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.7%
Simplified86.7%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.65)
(+
0.08333333333333333
(* beta (+ -0.027777777777777776 (* beta -0.011574074074074073))))
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.65d0) then
tmp = 0.08333333333333333d0 + (beta * ((-0.027777777777777776d0) + (beta * (-0.011574074074074073d0))))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.65: tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073))) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.65) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(-0.027777777777777776 + Float64(beta * -0.011574074074074073)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.65)
tmp = 0.08333333333333333 + (beta * (-0.027777777777777776 + (beta * -0.011574074074074073)));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.65], N[(0.08333333333333333 + N[(beta * N[(-0.027777777777777776 + N[(beta * -0.011574074074074073), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.65:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(-0.027777777777777776 + \beta \cdot -0.011574074074074073\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.6499999999999999Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.1%
Simplified63.1%
if 1.6499999999999999 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6484.7%
Simplified84.7%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6486.6%
Applied egg-rr86.6%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.0%
Simplified63.0%
if 2.7999999999999998 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6484.7%
Simplified84.7%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6486.6%
Applied egg-rr86.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (+ alpha 1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (alpha + 1.0d0) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (alpha + 1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = (alpha + 1.0) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.0%
Simplified63.0%
if 2.7999999999999998 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6484.7%
Simplified84.7%
Final simplification69.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (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 <= 2.6d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * 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 <= 2.6)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (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, 2.6], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.0%
Simplified63.0%
if 2.60000000000000009 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.7%
Simplified86.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6484.8%
Simplified84.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.0%
Simplified63.0%
if 2.7999999999999998 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6484.7%
Simplified84.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6484.8%
Simplified84.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.95d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.95)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.95], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.9500000000000002Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6463.0%
Simplified63.0%
if 2.9500000000000002 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.7%
Simplified86.7%
Taylor expanded in alpha around inf
/-lowering-/.f647.6%
Simplified7.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.8%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified98.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-+.f6463.6%
Simplified63.6%
Taylor expanded in beta around 0
Simplified62.7%
if 12 < beta Initial program 85.2%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified93.6%
associate-+r+N/A
metadata-evalN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6486.7%
Simplified86.7%
Taylor expanded in alpha around inf
/-lowering-/.f647.6%
Simplified7.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 95.6%
associate-/l/N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
associate-+r+N/A
+-commutativeN/A
*-rgt-identityN/A
distribute-rgt1-inN/A
distribute-lft-outN/A
associate-*l/N/A
/-lowering-/.f64N/A
Simplified97.2%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6466.1%
Simplified66.1%
Taylor expanded in beta around 0
Simplified45.8%
herbie shell --seed 2024191
(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)))