
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ (* 0.5 (/ PI a)) b) (+ a b)))
assert(a < b);
double code(double a, double b) {
return ((0.5 * (((double) M_PI) / a)) / b) / (a + b);
}
assert a < b;
public static double code(double a, double b) {
return ((0.5 * (Math.PI / a)) / b) / (a + b);
}
[a, b] = sort([a, b]) def code(a, b): return ((0.5 * (math.pi / a)) / b) / (a + b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(0.5 * Float64(pi / a)) / b) / Float64(a + b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((0.5 * (pi / a)) / b) / (a + b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(0.5 * N[(Pi / a), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{0.5 \cdot \frac{\pi}{a}}{b}}{a + b}
\end{array}
Initial program 78.1%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
associate-/l/N/A
associate-/r*N/A
div-invN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.7%
Simplified99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -6.5e-27) (/ (/ (* -0.5 (/ PI b)) a) (- b a)) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -6.5e-27) {
tmp = ((-0.5 * (((double) M_PI) / b)) / a) / (b - a);
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -6.5e-27) {
tmp = ((-0.5 * (Math.PI / b)) / a) / (b - a);
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -6.5e-27: tmp = ((-0.5 * (math.pi / b)) / a) / (b - a) else: tmp = (math.pi / b) * (0.5 / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -6.5e-27) tmp = Float64(Float64(Float64(-0.5 * Float64(pi / b)) / a) / Float64(b - a)); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -6.5e-27)
tmp = ((-0.5 * (pi / b)) / a) / (b - a);
else
tmp = (pi / b) * (0.5 / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -6.5e-27], N[(N[(N[(-0.5 * N[(Pi / b), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -6.5 \cdot 10^{-27}:\\
\;\;\;\;\frac{\frac{-0.5 \cdot \frac{\pi}{b}}{a}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if a < -6.50000000000000025e-27Initial program 76.3%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in a around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6494.1%
Simplified94.1%
if -6.50000000000000025e-27 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
frac-timesN/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -4.6e-26) (/ (/ (/ (/ PI a) 2.0) b) a) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -4.6e-26) {
tmp = (((((double) M_PI) / a) / 2.0) / b) / a;
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -4.6e-26) {
tmp = (((Math.PI / a) / 2.0) / b) / a;
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -4.6e-26: tmp = (((math.pi / a) / 2.0) / b) / a else: tmp = (math.pi / b) * (0.5 / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -4.6e-26) tmp = Float64(Float64(Float64(Float64(pi / a) / 2.0) / b) / a); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -4.6e-26)
tmp = (((pi / a) / 2.0) / b) / a;
else
tmp = (pi / b) * (0.5 / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -4.6e-26], N[(N[(N[(N[(Pi / a), $MachinePrecision] / 2.0), $MachinePrecision] / b), $MachinePrecision] / a), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.6 \cdot 10^{-26}:\\
\;\;\;\;\frac{\frac{\frac{\frac{\pi}{a}}{2}}{b}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if a < -4.60000000000000018e-26Initial program 76.3%
Taylor expanded in b around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6483.0%
Applied egg-rr83.0%
associate-*l/N/A
metadata-evalN/A
div-invN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6483.1%
Applied egg-rr83.1%
if -4.60000000000000018e-26 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
frac-timesN/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2.5e-25) (* 0.5 (/ (/ PI a) (* a b))) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2.5e-25) {
tmp = 0.5 * ((((double) M_PI) / a) / (a * b));
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2.5e-25) {
tmp = 0.5 * ((Math.PI / a) / (a * b));
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2.5e-25: tmp = 0.5 * ((math.pi / a) / (a * b)) else: tmp = (math.pi / b) * (0.5 / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2.5e-25) tmp = Float64(0.5 * Float64(Float64(pi / a) / Float64(a * b))); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2.5e-25)
tmp = 0.5 * ((pi / a) / (a * b));
else
tmp = (pi / b) * (0.5 / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -2.5e-25], N[(0.5 * N[(N[(Pi / a), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.5 \cdot 10^{-25}:\\
\;\;\;\;0.5 \cdot \frac{\frac{\pi}{a}}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if a < -2.49999999999999981e-25Initial program 76.3%
Taylor expanded in b around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6483.0%
Applied egg-rr83.0%
if -2.49999999999999981e-25 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
frac-timesN/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
Final simplification78.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -4.6e-26) (* (/ PI a) (/ (/ 0.5 b) a)) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -4.6e-26) {
tmp = (((double) M_PI) / a) * ((0.5 / b) / a);
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -4.6e-26) {
tmp = (Math.PI / a) * ((0.5 / b) / a);
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -4.6e-26: tmp = (math.pi / a) * ((0.5 / b) / a) else: tmp = (math.pi / b) * (0.5 / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -4.6e-26) tmp = Float64(Float64(pi / a) * Float64(Float64(0.5 / b) / a)); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -4.6e-26)
tmp = (pi / a) * ((0.5 / b) / a);
else
tmp = (pi / b) * (0.5 / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -4.6e-26], N[(N[(Pi / a), $MachinePrecision] * N[(N[(0.5 / b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.6 \cdot 10^{-26}:\\
\;\;\;\;\frac{\pi}{a} \cdot \frac{\frac{0.5}{b}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if a < -4.60000000000000018e-26Initial program 76.3%
Taylor expanded in a around inf
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-outN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6467.7%
Simplified67.7%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6479.6%
Applied egg-rr79.6%
Taylor expanded in a around inf
associate-/l/N/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6483.0%
Simplified83.0%
if -4.60000000000000018e-26 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
frac-timesN/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
Final simplification78.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (let* ((t_0 (/ 0.5 (* a b)))) (if (<= a -7.2e-26) (* (/ PI a) t_0) (* (/ PI b) t_0))))
assert(a < b);
double code(double a, double b) {
double t_0 = 0.5 / (a * b);
double tmp;
if (a <= -7.2e-26) {
tmp = (((double) M_PI) / a) * t_0;
} else {
tmp = (((double) M_PI) / b) * t_0;
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double t_0 = 0.5 / (a * b);
double tmp;
if (a <= -7.2e-26) {
tmp = (Math.PI / a) * t_0;
} else {
tmp = (Math.PI / b) * t_0;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): t_0 = 0.5 / (a * b) tmp = 0 if a <= -7.2e-26: tmp = (math.pi / a) * t_0 else: tmp = (math.pi / b) * t_0 return tmp
a, b = sort([a, b]) function code(a, b) t_0 = Float64(0.5 / Float64(a * b)) tmp = 0.0 if (a <= -7.2e-26) tmp = Float64(Float64(pi / a) * t_0); else tmp = Float64(Float64(pi / b) * t_0); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
t_0 = 0.5 / (a * b);
tmp = 0.0;
if (a <= -7.2e-26)
tmp = (pi / a) * t_0;
else
tmp = (pi / b) * t_0;
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := Block[{t$95$0 = N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -7.2e-26], N[(N[(Pi / a), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * t$95$0), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
t_0 := \frac{0.5}{a \cdot b}\\
\mathbf{if}\;a \leq -7.2 \cdot 10^{-26}:\\
\;\;\;\;\frac{\pi}{a} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot t\_0\\
\end{array}
\end{array}
if a < -7.2000000000000003e-26Initial program 76.3%
Taylor expanded in b around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6483.0%
Applied egg-rr83.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6483.1%
Applied egg-rr83.1%
if -7.2000000000000003e-26 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
frac-timesN/A
*-commutativeN/A
times-fracN/A
associate-/l/N/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.6e-25) (* (/ PI a) (/ 0.5 (* a b))) (* 0.5 (/ (/ PI b) (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.6e-25) {
tmp = (((double) M_PI) / a) * (0.5 / (a * b));
} else {
tmp = 0.5 * ((((double) M_PI) / b) / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.6e-25) {
tmp = (Math.PI / a) * (0.5 / (a * b));
} else {
tmp = 0.5 * ((Math.PI / b) / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.6e-25: tmp = (math.pi / a) * (0.5 / (a * b)) else: tmp = 0.5 * ((math.pi / b) / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.6e-25) tmp = Float64(Float64(pi / a) * Float64(0.5 / Float64(a * b))); else tmp = Float64(0.5 * Float64(Float64(pi / b) / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.6e-25)
tmp = (pi / a) * (0.5 / (a * b));
else
tmp = 0.5 * ((pi / b) / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -1.6e-25], N[(N[(Pi / a), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(Pi / b), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.6 \cdot 10^{-25}:\\
\;\;\;\;\frac{\pi}{a} \cdot \frac{0.5}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{\frac{\pi}{b}}{a \cdot b}\\
\end{array}
\end{array}
if a < -1.6000000000000001e-25Initial program 76.3%
Taylor expanded in b around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6483.0%
Applied egg-rr83.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6483.1%
Applied egg-rr83.1%
if -1.6000000000000001e-25 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
*-commutativeN/A
associate-/r*N/A
frac-timesN/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2.3e-25) (* PI (/ 0.5 (* a (* a b)))) (* 0.5 (/ (/ PI b) (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2.3e-25) {
tmp = ((double) M_PI) * (0.5 / (a * (a * b)));
} else {
tmp = 0.5 * ((((double) M_PI) / b) / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2.3e-25) {
tmp = Math.PI * (0.5 / (a * (a * b)));
} else {
tmp = 0.5 * ((Math.PI / b) / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2.3e-25: tmp = math.pi * (0.5 / (a * (a * b))) else: tmp = 0.5 * ((math.pi / b) / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2.3e-25) tmp = Float64(pi * Float64(0.5 / Float64(a * Float64(a * b)))); else tmp = Float64(0.5 * Float64(Float64(pi / b) / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2.3e-25)
tmp = pi * (0.5 / (a * (a * b)));
else
tmp = 0.5 * ((pi / b) / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -2.3e-25], N[(Pi * N[(0.5 / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(Pi / b), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.3 \cdot 10^{-25}:\\
\;\;\;\;\pi \cdot \frac{0.5}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{\frac{\pi}{b}}{a \cdot b}\\
\end{array}
\end{array}
if a < -2.2999999999999999e-25Initial program 76.3%
Taylor expanded in b around 0
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
unpow2N/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/r*N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6483.0%
Applied egg-rr83.0%
associate-/l/N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6484.3%
Applied egg-rr84.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6484.2%
Applied egg-rr84.2%
if -2.2999999999999999e-25 < a Initial program 78.6%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6468.7%
Applied egg-rr68.7%
*-commutativeN/A
associate-/r*N/A
frac-timesN/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6476.7%
Applied egg-rr76.7%
Final simplification78.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* 0.5 (/ (/ PI b) (* a b))))
assert(a < b);
double code(double a, double b) {
return 0.5 * ((((double) M_PI) / b) / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return 0.5 * ((Math.PI / b) / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return 0.5 * ((math.pi / b) / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(0.5 * Float64(Float64(pi / b) / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = 0.5 * ((pi / b) / (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(0.5 * N[(N[(Pi / b), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
0.5 \cdot \frac{\frac{\pi}{b}}{a \cdot b}
\end{array}
Initial program 78.1%
un-div-invN/A
associate-/r*N/A
associate-*l/N/A
distribute-lft-out--N/A
div-invN/A
div-invN/A
*-commutativeN/A
associate-/l/N/A
difference-of-squaresN/A
associate-/r*N/A
*-rgt-identityN/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr99.7%
Taylor expanded in a around 0
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6463.1%
Simplified63.1%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6463.1%
Applied egg-rr63.1%
*-commutativeN/A
associate-/r*N/A
frac-timesN/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6469.2%
Applied egg-rr69.2%
herbie shell --seed 2024144
(FPCore (a b)
:name "NMSE Section 6.1 mentioned, B"
:precision binary64
(* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))