
(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 11 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 (if (<= b 5e+128) (/ (/ PI a) (* (+ a b) (* b 2.0))) (/ (/ (/ PI (* a b)) 2.0) (- b a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 5e+128) {
tmp = (((double) M_PI) / a) / ((a + b) * (b * 2.0));
} else {
tmp = ((((double) M_PI) / (a * b)) / 2.0) / (b - a);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 5e+128) {
tmp = (Math.PI / a) / ((a + b) * (b * 2.0));
} else {
tmp = ((Math.PI / (a * b)) / 2.0) / (b - a);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 5e+128: tmp = (math.pi / a) / ((a + b) * (b * 2.0)) else: tmp = ((math.pi / (a * b)) / 2.0) / (b - a) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 5e+128) tmp = Float64(Float64(pi / a) / Float64(Float64(a + b) * Float64(b * 2.0))); else tmp = Float64(Float64(Float64(pi / Float64(a * b)) / 2.0) / Float64(b - a)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 5e+128)
tmp = (pi / a) / ((a + b) * (b * 2.0));
else
tmp = ((pi / (a * b)) / 2.0) / (b - a);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 5e+128], N[(N[(Pi / a), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] * N[(b * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 5 \cdot 10^{+128}:\\
\;\;\;\;\frac{\frac{\pi}{a}}{\left(a + b\right) \cdot \left(b \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\pi}{a \cdot b}}{2}}{b - a}\\
\end{array}
\end{array}
if b < 5e128Initial program 79.7%
associate-*r/N/A
*-rgt-identityN/A
associate-*l/N/A
*-commutativeN/A
associate-*r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified84.8%
Taylor expanded in a around 0
/-lowering-/.f64N/A
PI-lowering-PI.f6459.0%
Simplified59.0%
Taylor expanded in b around inf
Simplified95.2%
if 5e128 < b Initial program 49.2%
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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.9%
Taylor expanded in a around 0
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.9%
Simplified99.9%
Final simplification95.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ (/ (- (/ PI a) (/ PI b)) (+ a b)) 2.0) (- b a)))
assert(a < b);
double code(double a, double b) {
return ((((((double) M_PI) / a) - (((double) M_PI) / b)) / (a + b)) / 2.0) / (b - a);
}
assert a < b;
public static double code(double a, double b) {
return ((((Math.PI / a) - (Math.PI / b)) / (a + b)) / 2.0) / (b - a);
}
[a, b] = sort([a, b]) def code(a, b): return ((((math.pi / a) - (math.pi / b)) / (a + b)) / 2.0) / (b - a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(Float64(pi / a) - Float64(pi / b)) / Float64(a + b)) / 2.0) / Float64(b - a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((((pi / a) - (pi / b)) / (a + b)) / 2.0) / (b - a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(N[(N[(Pi / a), $MachinePrecision] - N[(Pi / b), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\frac{\frac{\pi}{a} - \frac{\pi}{b}}{a + b}}{2}}{b - a}
\end{array}
Initial program 75.5%
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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Final simplification99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ 0.5 (- b a)) (/ (+ a b) (- (/ PI a) (/ PI b)))))
assert(a < b);
double code(double a, double b) {
return (0.5 / (b - a)) / ((a + b) / ((((double) M_PI) / a) - (((double) M_PI) / b)));
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / (b - a)) / ((a + b) / ((Math.PI / a) - (Math.PI / b)));
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / (b - a)) / ((a + b) / ((math.pi / a) - (math.pi / b)))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / Float64(b - a)) / Float64(Float64(a + b) / Float64(Float64(pi / a) - Float64(pi / b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / (b - a)) / ((a + b) / ((pi / a) - (pi / b)));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 / N[(b - a), $MachinePrecision]), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] / N[(N[(Pi / a), $MachinePrecision] - N[(Pi / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{0.5}{b - a}}{\frac{a + b}{\frac{\pi}{a} - \frac{\pi}{b}}}
\end{array}
Initial program 75.5%
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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
metadata-evalN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.6%
Applied egg-rr99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 5e+122) (/ (/ PI a) (* (+ a b) (* b 2.0))) (/ (/ 0.5 (/ b (/ PI a))) b)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 5e+122) {
tmp = (((double) M_PI) / a) / ((a + b) * (b * 2.0));
} else {
tmp = (0.5 / (b / (((double) M_PI) / a))) / b;
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 5e+122) {
tmp = (Math.PI / a) / ((a + b) * (b * 2.0));
} else {
tmp = (0.5 / (b / (Math.PI / a))) / b;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 5e+122: tmp = (math.pi / a) / ((a + b) * (b * 2.0)) else: tmp = (0.5 / (b / (math.pi / a))) / b return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 5e+122) tmp = Float64(Float64(pi / a) / Float64(Float64(a + b) * Float64(b * 2.0))); else tmp = Float64(Float64(0.5 / Float64(b / Float64(pi / a))) / b); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 5e+122)
tmp = (pi / a) / ((a + b) * (b * 2.0));
else
tmp = (0.5 / (b / (pi / 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[b, 5e+122], N[(N[(Pi / a), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] * N[(b * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / N[(b / N[(Pi / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 5 \cdot 10^{+122}:\\
\;\;\;\;\frac{\frac{\pi}{a}}{\left(a + b\right) \cdot \left(b \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{0.5}{\frac{b}{\frac{\pi}{a}}}}{b}\\
\end{array}
\end{array}
if b < 4.99999999999999989e122Initial program 79.5%
associate-*r/N/A
*-rgt-identityN/A
associate-*l/N/A
*-commutativeN/A
associate-*r/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Simplified84.7%
Taylor expanded in a around 0
/-lowering-/.f64N/A
PI-lowering-PI.f6458.6%
Simplified58.6%
Taylor expanded in b around inf
Simplified95.2%
if 4.99999999999999989e122 < b Initial program 51.9%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6473.6%
Simplified73.6%
associate-/l/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6499.7%
Applied egg-rr99.7%
associate-*l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.8%
Applied egg-rr99.8%
Final simplification95.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.7e-64) (/ (/ 0.5 (/ b (/ PI a))) a) (/ (/ 0.5 (- b a)) (* a (/ b PI)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.7e-64) {
tmp = (0.5 / (b / (((double) M_PI) / a))) / a;
} else {
tmp = (0.5 / (b - a)) / (a * (b / ((double) M_PI)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.7e-64) {
tmp = (0.5 / (b / (Math.PI / a))) / a;
} else {
tmp = (0.5 / (b - a)) / (a * (b / Math.PI));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.7e-64: tmp = (0.5 / (b / (math.pi / a))) / a else: tmp = (0.5 / (b - a)) / (a * (b / math.pi)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.7e-64) tmp = Float64(Float64(0.5 / Float64(b / Float64(pi / a))) / a); else tmp = Float64(Float64(0.5 / Float64(b - a)) / Float64(a * Float64(b / pi))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.7e-64)
tmp = (0.5 / (b / (pi / a))) / a;
else
tmp = (0.5 / (b - a)) / (a * (b / pi));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 1.7e-64], N[(N[(0.5 / N[(b / N[(Pi / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(0.5 / N[(b - a), $MachinePrecision]), $MachinePrecision] / N[(a * N[(b / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.7 \cdot 10^{-64}:\\
\;\;\;\;\frac{\frac{0.5}{\frac{b}{\frac{\pi}{a}}}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{0.5}{b - a}}{a \cdot \frac{b}{\pi}}\\
\end{array}
\end{array}
if b < 1.70000000000000006e-64Initial program 75.0%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1%
Simplified57.1%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6469.9%
Applied egg-rr69.9%
*-commutativeN/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.7%
Applied egg-rr69.7%
associate-/r*N/A
associate-*r/N/A
associate-/r/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.9%
Applied egg-rr69.9%
if 1.70000000000000006e-64 < b Initial program 76.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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
metadata-evalN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.6%
Applied egg-rr99.6%
Taylor expanded in a around 0
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6490.7%
Simplified90.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.8e-87) (/ (* (/ PI (* a b)) -0.5) (- b a)) (/ (/ PI (/ b 0.5)) (* a b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.8e-87) {
tmp = ((((double) M_PI) / (a * b)) * -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 <= -1.8e-87) {
tmp = ((Math.PI / (a * b)) * -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 <= -1.8e-87: tmp = ((math.pi / (a * b)) * -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 <= -1.8e-87) tmp = Float64(Float64(Float64(pi / Float64(a * b)) * -0.5) / Float64(b - a)); else tmp = Float64(Float64(pi / Float64(b / 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 <= -1.8e-87)
tmp = ((pi / (a * b)) * -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, -1.8e-87], N[(N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / N[(b / 0.5), $MachinePrecision]), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.8 \cdot 10^{-87}:\\
\;\;\;\;\frac{\frac{\pi}{a \cdot b} \cdot -0.5}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{\frac{b}{0.5}}}{a \cdot b}\\
\end{array}
\end{array}
if a < -1.79999999999999996e-87Initial program 74.8%
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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.6%
Taylor expanded in a around inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6482.9%
Simplified82.9%
if -1.79999999999999996e-87 < a Initial program 75.9%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6455.1%
Simplified55.1%
associate-/l/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
associate-*r/N/A
/-lowering-/.f64N/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
div-invN/A
metadata-evalN/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6466.0%
Applied egg-rr66.0%
Final simplification71.4%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 3.7e-63) (/ (/ 0.5 (/ b (/ PI a))) a) (/ (/ PI (/ b 0.5)) (* a b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 3.7e-63) {
tmp = (0.5 / (b / (((double) M_PI) / a))) / 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 (b <= 3.7e-63) {
tmp = (0.5 / (b / (Math.PI / a))) / a;
} else {
tmp = (Math.PI / (b / 0.5)) / (a * b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 3.7e-63: tmp = (0.5 / (b / (math.pi / a))) / 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 (b <= 3.7e-63) tmp = Float64(Float64(0.5 / Float64(b / Float64(pi / a))) / a); else tmp = Float64(Float64(pi / Float64(b / 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 (b <= 3.7e-63)
tmp = (0.5 / (b / (pi / a))) / 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[b, 3.7e-63], N[(N[(0.5 / N[(b / N[(Pi / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(Pi / N[(b / 0.5), $MachinePrecision]), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 3.7 \cdot 10^{-63}:\\
\;\;\;\;\frac{\frac{0.5}{\frac{b}{\frac{\pi}{a}}}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{\frac{b}{0.5}}}{a \cdot b}\\
\end{array}
\end{array}
if b < 3.70000000000000012e-63Initial program 75.0%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1%
Simplified57.1%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6469.9%
Applied egg-rr69.9%
*-commutativeN/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.7%
Applied egg-rr69.7%
associate-/r*N/A
associate-*r/N/A
associate-/r/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.9%
Applied egg-rr69.9%
if 3.70000000000000012e-63 < b Initial program 76.6%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6471.5%
Simplified71.5%
associate-/l/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6483.9%
Applied egg-rr83.9%
associate-*r/N/A
/-lowering-/.f64N/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
div-invN/A
metadata-evalN/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6484.0%
Applied egg-rr84.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.26e-62) (/ (/ 0.5 (/ b (/ PI a))) a) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.26e-62) {
tmp = (0.5 / (b / (((double) M_PI) / a))) / 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 (b <= 1.26e-62) {
tmp = (0.5 / (b / (Math.PI / a))) / a;
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.26e-62: tmp = (0.5 / (b / (math.pi / a))) / 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 (b <= 1.26e-62) tmp = Float64(Float64(0.5 / Float64(b / Float64(pi / a))) / 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 (b <= 1.26e-62)
tmp = (0.5 / (b / (pi / a))) / 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[b, 1.26e-62], N[(N[(0.5 / N[(b / N[(Pi / a), $MachinePrecision]), $MachinePrecision]), $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}\;b \leq 1.26 \cdot 10^{-62}:\\
\;\;\;\;\frac{\frac{0.5}{\frac{b}{\frac{\pi}{a}}}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if b < 1.26e-62Initial program 75.0%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1%
Simplified57.1%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6469.9%
Applied egg-rr69.9%
*-commutativeN/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.7%
Applied egg-rr69.7%
associate-/r*N/A
associate-*r/N/A
associate-/r/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/r/N/A
associate-*r/N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.9%
Applied egg-rr69.9%
if 1.26e-62 < b Initial program 76.6%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6471.5%
Simplified71.5%
associate-/l/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6483.9%
Applied egg-rr83.9%
Final simplification74.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 4.3e-64) (* (/ PI (* a b)) (/ 0.5 a)) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 4.3e-64) {
tmp = (((double) M_PI) / (a * b)) * (0.5 / 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 (b <= 4.3e-64) {
tmp = (Math.PI / (a * b)) * (0.5 / a);
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 4.3e-64: tmp = (math.pi / (a * b)) * (0.5 / 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 (b <= 4.3e-64) tmp = Float64(Float64(pi / Float64(a * b)) * Float64(0.5 / 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 (b <= 4.3e-64)
tmp = (pi / (a * b)) * (0.5 / 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[b, 4.3e-64], N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] * N[(0.5 / 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}\;b \leq 4.3 \cdot 10^{-64}:\\
\;\;\;\;\frac{\pi}{a \cdot b} \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if b < 4.29999999999999973e-64Initial program 75.0%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1%
Simplified57.1%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6469.9%
Applied egg-rr69.9%
if 4.29999999999999973e-64 < b Initial program 76.6%
Taylor expanded in b around inf
associate-*r/N/A
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
unpow2N/A
associate-/r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6471.5%
Simplified71.5%
associate-/l/N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6483.9%
Applied egg-rr83.9%
Final simplification74.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ 1.0 (+ a b)) (/ (* PI 0.5) (* a b))))
assert(a < b);
double code(double a, double b) {
return (1.0 / (a + b)) * ((((double) M_PI) * 0.5) / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (1.0 / (a + b)) * ((Math.PI * 0.5) / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (1.0 / (a + b)) * ((math.pi * 0.5) / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(1.0 / Float64(a + b)) * Float64(Float64(pi * 0.5) / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (1.0 / (a + b)) * ((pi * 0.5) / (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(1.0 / N[(a + b), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi * 0.5), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{1}{a + b} \cdot \frac{\pi \cdot 0.5}{a \cdot b}
\end{array}
Initial program 75.5%
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
difference-of-squaresN/A
associate-*r*N/A
*-commutativeN/A
clear-numN/A
inv-powN/A
associate-/l*N/A
unpow-prod-downN/A
Applied egg-rr99.5%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.6%
Simplified99.6%
Final simplification99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ PI (* a b)) (/ 0.5 a)))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / (a * b)) * (0.5 / a);
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / (a * b)) * (0.5 / a);
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / (a * b)) * (0.5 / a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(a * b)) * Float64(0.5 / a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / (a * b)) * (0.5 / a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{a \cdot b} \cdot \frac{0.5}{a}
\end{array}
Initial program 75.5%
Taylor expanded in b around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6454.2%
Simplified54.2%
associate-*l*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6463.2%
Applied egg-rr63.2%
Final simplification63.2%
herbie shell --seed 2024152
(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))))