
(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 (<= a -3.9e+133) (* 0.5 (/ PI (* a (* a b)))) (* (* (/ PI 2.0) (/ (/ 1.0 (+ a b)) (- b a))) (+ (/ 1.0 a) (/ -1.0 b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -3.9e+133) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = ((((double) M_PI) / 2.0) * ((1.0 / (a + b)) / (b - a))) * ((1.0 / a) + (-1.0 / b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -3.9e+133) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = ((Math.PI / 2.0) * ((1.0 / (a + b)) / (b - a))) * ((1.0 / a) + (-1.0 / b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -3.9e+133: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = ((math.pi / 2.0) * ((1.0 / (a + b)) / (b - a))) * ((1.0 / a) + (-1.0 / b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -3.9e+133) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(Float64(Float64(pi / 2.0) * Float64(Float64(1.0 / Float64(a + b)) / Float64(b - a))) * Float64(Float64(1.0 / a) + Float64(-1.0 / b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -3.9e+133)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = ((pi / 2.0) * ((1.0 / (a + b)) / (b - a))) * ((1.0 / a) + (-1.0 / 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, -3.9e+133], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(N[(1.0 / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -3.9 \cdot 10^{+133}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\pi}{2} \cdot \frac{\frac{1}{a + b}}{b - a}\right) \cdot \left(\frac{1}{a} + \frac{-1}{b}\right)\\
\end{array}
\end{array}
if a < -3.90000000000000014e133Initial program 61.1%
inv-pow61.1%
difference-of-squares73.3%
unpow-prod-down76.5%
inv-pow76.5%
inv-pow76.5%
Applied egg-rr76.5%
associate-*r/76.5%
*-rgt-identity76.5%
+-commutative76.5%
Simplified76.5%
add-cube-cbrt76.4%
inv-pow76.4%
inv-pow76.4%
inv-pow76.4%
inv-pow76.4%
inv-pow76.4%
inv-pow76.4%
Applied egg-rr76.4%
Taylor expanded in a around inf 73.4%
unpow273.4%
associate-*l*98.4%
Simplified98.4%
if -3.90000000000000014e133 < a Initial program 81.7%
inv-pow81.7%
difference-of-squares89.2%
unpow-prod-down89.7%
inv-pow89.7%
inv-pow89.7%
Applied egg-rr89.7%
associate-*r/89.8%
*-rgt-identity89.8%
+-commutative89.8%
Simplified89.8%
Final simplification91.2%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(if (<= a -2e+147)
(* 0.5 (/ PI (* a (* a b))))
(if (<= a -6e-159)
(* (+ (/ 1.0 a) (/ -1.0 b)) (/ (/ PI 2.0) (- (* b b) (* a a))))
(/ (* 0.5 PI) (* a (* b b))))))assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e+147) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else if (a <= -6e-159) {
tmp = ((1.0 / a) + (-1.0 / b)) * ((((double) M_PI) / 2.0) / ((b * b) - (a * a)));
} else {
tmp = (0.5 * ((double) M_PI)) / (a * (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e+147) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else if (a <= -6e-159) {
tmp = ((1.0 / a) + (-1.0 / b)) * ((Math.PI / 2.0) / ((b * b) - (a * a)));
} else {
tmp = (0.5 * Math.PI) / (a * (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e+147: tmp = 0.5 * (math.pi / (a * (a * b))) elif a <= -6e-159: tmp = ((1.0 / a) + (-1.0 / b)) * ((math.pi / 2.0) / ((b * b) - (a * a))) else: tmp = (0.5 * math.pi) / (a * (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e+147) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); elseif (a <= -6e-159) tmp = Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) * Float64(Float64(pi / 2.0) / Float64(Float64(b * b) - Float64(a * a)))); else tmp = Float64(Float64(0.5 * pi) / Float64(a * Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e+147)
tmp = 0.5 * (pi / (a * (a * b)));
elseif (a <= -6e-159)
tmp = ((1.0 / a) + (-1.0 / b)) * ((pi / 2.0) / ((b * b) - (a * a)));
else
tmp = (0.5 * pi) / (a * (b * 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, -2e+147], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -6e-159], N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi / 2.0), $MachinePrecision] / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * Pi), $MachinePrecision] / N[(a * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{+147}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{elif}\;a \leq -6 \cdot 10^{-159}:\\
\;\;\;\;\left(\frac{1}{a} + \frac{-1}{b}\right) \cdot \frac{\frac{\pi}{2}}{b \cdot b - a \cdot a}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{a \cdot \left(b \cdot b\right)}\\
\end{array}
\end{array}
if a < -2e147Initial program 58.1%
inv-pow58.1%
difference-of-squares71.3%
unpow-prod-down74.7%
inv-pow74.7%
inv-pow74.7%
Applied egg-rr74.7%
associate-*r/74.7%
*-rgt-identity74.7%
+-commutative74.7%
Simplified74.7%
add-cube-cbrt74.7%
inv-pow74.7%
inv-pow74.7%
inv-pow74.7%
inv-pow74.7%
inv-pow74.7%
inv-pow74.7%
Applied egg-rr74.7%
Taylor expanded in a around inf 71.3%
unpow271.3%
associate-*l*98.3%
Simplified98.3%
if -2e147 < a < -6.00000000000000018e-159Initial program 93.6%
associate-*r/93.8%
*-rgt-identity93.8%
sub-neg93.8%
distribute-neg-frac93.8%
metadata-eval93.8%
Simplified93.8%
if -6.00000000000000018e-159 < a Initial program 77.1%
Taylor expanded in b around inf 62.1%
associate-*r/62.1%
unpow262.1%
Simplified62.1%
Final simplification75.4%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(if (<= a -1.65e+79)
(* 0.5 (/ PI (* a (* a b))))
(if (<= a -3.8e-116)
(/ (/ -1.0 b) (/ 2.0 (* (/ PI (+ a b)) (/ 1.0 (- b a)))))
(/ (* 0.5 PI) (* a (* b b))))))assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.65e+79) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else if (a <= -3.8e-116) {
tmp = (-1.0 / b) / (2.0 / ((((double) M_PI) / (a + b)) * (1.0 / (b - a))));
} else {
tmp = (0.5 * ((double) M_PI)) / (a * (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.65e+79) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else if (a <= -3.8e-116) {
tmp = (-1.0 / b) / (2.0 / ((Math.PI / (a + b)) * (1.0 / (b - a))));
} else {
tmp = (0.5 * Math.PI) / (a * (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.65e+79: tmp = 0.5 * (math.pi / (a * (a * b))) elif a <= -3.8e-116: tmp = (-1.0 / b) / (2.0 / ((math.pi / (a + b)) * (1.0 / (b - a)))) else: tmp = (0.5 * math.pi) / (a * (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.65e+79) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); elseif (a <= -3.8e-116) tmp = Float64(Float64(-1.0 / b) / Float64(2.0 / Float64(Float64(pi / Float64(a + b)) * Float64(1.0 / Float64(b - a))))); else tmp = Float64(Float64(0.5 * pi) / Float64(a * Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.65e+79)
tmp = 0.5 * (pi / (a * (a * b)));
elseif (a <= -3.8e-116)
tmp = (-1.0 / b) / (2.0 / ((pi / (a + b)) * (1.0 / (b - a))));
else
tmp = (0.5 * pi) / (a * (b * 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.65e+79], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -3.8e-116], N[(N[(-1.0 / b), $MachinePrecision] / N[(2.0 / N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * Pi), $MachinePrecision] / N[(a * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.65 \cdot 10^{+79}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{elif}\;a \leq -3.8 \cdot 10^{-116}:\\
\;\;\;\;\frac{\frac{-1}{b}}{\frac{2}{\frac{\pi}{a + b} \cdot \frac{1}{b - a}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{a \cdot \left(b \cdot b\right)}\\
\end{array}
\end{array}
if a < -1.6500000000000001e79Initial program 69.8%
inv-pow69.8%
difference-of-squares79.2%
unpow-prod-down81.7%
inv-pow81.7%
inv-pow81.7%
Applied egg-rr81.7%
associate-*r/81.6%
*-rgt-identity81.6%
+-commutative81.6%
Simplified81.6%
add-cube-cbrt81.6%
inv-pow81.6%
inv-pow81.6%
inv-pow81.6%
inv-pow81.6%
inv-pow81.6%
inv-pow81.6%
Applied egg-rr81.6%
Taylor expanded in a around inf 79.1%
unpow279.1%
associate-*l*98.4%
Simplified98.4%
if -1.6500000000000001e79 < a < -3.8000000000000001e-116Initial program 92.3%
*-commutative92.3%
associate-*l/92.3%
associate-*r/92.3%
associate-/l*92.4%
sub-neg92.4%
distribute-neg-frac92.4%
metadata-eval92.4%
associate-*r/92.5%
*-rgt-identity92.5%
difference-of-squares92.5%
associate-/r*92.4%
Simplified92.4%
Taylor expanded in a around inf 58.3%
div-inv58.3%
Applied egg-rr58.3%
if -3.8000000000000001e-116 < a Initial program 77.9%
Taylor expanded in b around inf 62.6%
associate-*r/62.6%
unpow262.6%
Simplified62.6%
Final simplification69.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.35e+152) (* 0.5 (/ PI (* a (* a b)))) (/ (+ (/ 1.0 a) (/ -1.0 b)) (* (- b a) (/ 2.0 (/ PI (+ a b)))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.35e+152) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = ((1.0 / a) + (-1.0 / b)) / ((b - a) * (2.0 / (((double) M_PI) / (a + b))));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.35e+152) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = ((1.0 / a) + (-1.0 / b)) / ((b - a) * (2.0 / (Math.PI / (a + b))));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.35e+152: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = ((1.0 / a) + (-1.0 / b)) / ((b - a) * (2.0 / (math.pi / (a + b)))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.35e+152) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(Float64(b - a) * Float64(2.0 / Float64(pi / 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.35e+152)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = ((1.0 / a) + (-1.0 / b)) / ((b - a) * (2.0 / (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[a, -1.35e+152], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(N[(b - a), $MachinePrecision] * N[(2.0 / N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.35 \cdot 10^{+152}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{a} + \frac{-1}{b}}{\left(b - a\right) \cdot \frac{2}{\frac{\pi}{a + b}}}\\
\end{array}
\end{array}
if a < -1.35000000000000007e152Initial program 55.8%
inv-pow55.8%
difference-of-squares69.7%
unpow-prod-down73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
associate-*r/73.3%
*-rgt-identity73.3%
+-commutative73.3%
Simplified73.3%
add-cube-cbrt73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
Taylor expanded in a around inf 69.7%
unpow269.7%
associate-*l*98.2%
Simplified98.2%
if -1.35000000000000007e152 < a Initial program 82.1%
*-commutative82.1%
associate-*l/82.1%
associate-*r/82.1%
associate-/l*82.1%
sub-neg82.1%
distribute-neg-frac82.1%
metadata-eval82.1%
associate-*r/82.1%
*-rgt-identity82.1%
difference-of-squares89.4%
associate-/r*89.4%
Simplified89.4%
associate-/r/89.4%
Applied egg-rr89.4%
Final simplification90.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e+154) (* 0.5 (/ PI (* a (* a b)))) (/ (+ (/ 1.0 a) (/ -1.0 b)) (/ 2.0 (/ (/ PI (+ a b)) (- b a))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e+154) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = ((1.0 / a) + (-1.0 / b)) / (2.0 / ((((double) M_PI) / (a + b)) / (b - a)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e+154) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = ((1.0 / a) + (-1.0 / b)) / (2.0 / ((Math.PI / (a + b)) / (b - a)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e+154: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = ((1.0 / a) + (-1.0 / b)) / (2.0 / ((math.pi / (a + b)) / (b - a))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e+154) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(2.0 / Float64(Float64(pi / Float64(a + b)) / Float64(b - a)))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e+154)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = ((1.0 / a) + (-1.0 / b)) / (2.0 / ((pi / (a + b)) / (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[a, -2e+154], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(2.0 / N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{+154}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{a} + \frac{-1}{b}}{\frac{2}{\frac{\frac{\pi}{a + b}}{b - a}}}\\
\end{array}
\end{array}
if a < -2.00000000000000007e154Initial program 55.8%
inv-pow55.8%
difference-of-squares69.7%
unpow-prod-down73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
associate-*r/73.3%
*-rgt-identity73.3%
+-commutative73.3%
Simplified73.3%
add-cube-cbrt73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
Taylor expanded in a around inf 69.7%
unpow269.7%
associate-*l*98.2%
Simplified98.2%
if -2.00000000000000007e154 < a Initial program 82.1%
*-commutative82.1%
associate-*l/82.1%
associate-*r/82.1%
associate-/l*82.1%
sub-neg82.1%
distribute-neg-frac82.1%
metadata-eval82.1%
associate-*r/82.1%
*-rgt-identity82.1%
difference-of-squares89.4%
associate-/r*89.4%
Simplified89.4%
Final simplification90.6%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(if (<= a -1e+153)
(* 0.5 (/ PI (* a (* a b))))
(if (<= a -3.7e-115)
(* (/ (/ -1.0 b) 2.0) (/ (/ PI (+ a b)) (- b a)))
(/ (* 0.5 PI) (* a (* b b))))))assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1e+153) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else if (a <= -3.7e-115) {
tmp = ((-1.0 / b) / 2.0) * ((((double) M_PI) / (a + b)) / (b - a));
} else {
tmp = (0.5 * ((double) M_PI)) / (a * (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1e+153) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else if (a <= -3.7e-115) {
tmp = ((-1.0 / b) / 2.0) * ((Math.PI / (a + b)) / (b - a));
} else {
tmp = (0.5 * Math.PI) / (a * (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1e+153: tmp = 0.5 * (math.pi / (a * (a * b))) elif a <= -3.7e-115: tmp = ((-1.0 / b) / 2.0) * ((math.pi / (a + b)) / (b - a)) else: tmp = (0.5 * math.pi) / (a * (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1e+153) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); elseif (a <= -3.7e-115) tmp = Float64(Float64(Float64(-1.0 / b) / 2.0) * Float64(Float64(pi / Float64(a + b)) / Float64(b - a))); else tmp = Float64(Float64(0.5 * pi) / Float64(a * Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1e+153)
tmp = 0.5 * (pi / (a * (a * b)));
elseif (a <= -3.7e-115)
tmp = ((-1.0 / b) / 2.0) * ((pi / (a + b)) / (b - a));
else
tmp = (0.5 * pi) / (a * (b * 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, -1e+153], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -3.7e-115], N[(N[(N[(-1.0 / b), $MachinePrecision] / 2.0), $MachinePrecision] * N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * Pi), $MachinePrecision] / N[(a * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1 \cdot 10^{+153}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{elif}\;a \leq -3.7 \cdot 10^{-115}:\\
\;\;\;\;\frac{\frac{-1}{b}}{2} \cdot \frac{\frac{\pi}{a + b}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{a \cdot \left(b \cdot b\right)}\\
\end{array}
\end{array}
if a < -1e153Initial program 55.8%
inv-pow55.8%
difference-of-squares69.7%
unpow-prod-down73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
associate-*r/73.3%
*-rgt-identity73.3%
+-commutative73.3%
Simplified73.3%
add-cube-cbrt73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
Taylor expanded in a around inf 69.7%
unpow269.7%
associate-*l*98.2%
Simplified98.2%
if -1e153 < a < -3.7e-115Initial program 94.4%
*-commutative94.4%
associate-*l/94.4%
associate-*r/94.4%
associate-/l*94.5%
sub-neg94.5%
distribute-neg-frac94.5%
metadata-eval94.5%
associate-*r/94.7%
*-rgt-identity94.7%
difference-of-squares94.7%
associate-/r*94.7%
Simplified94.7%
Taylor expanded in a around inf 70.6%
associate-/r/70.6%
+-commutative70.6%
Applied egg-rr70.6%
if -3.7e-115 < a Initial program 77.9%
Taylor expanded in b around inf 62.6%
associate-*r/62.6%
unpow262.6%
Simplified62.6%
Final simplification69.3%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(if (<= a -2e+154)
(* 0.5 (/ PI (* a (* a b))))
(if (<= a -2.9e-115)
(/ (/ -1.0 b) (/ 2.0 (/ (/ PI (+ a b)) (- b a))))
(/ (* 0.5 PI) (* a (* b b))))))assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e+154) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else if (a <= -2.9e-115) {
tmp = (-1.0 / b) / (2.0 / ((((double) M_PI) / (a + b)) / (b - a)));
} else {
tmp = (0.5 * ((double) M_PI)) / (a * (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e+154) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else if (a <= -2.9e-115) {
tmp = (-1.0 / b) / (2.0 / ((Math.PI / (a + b)) / (b - a)));
} else {
tmp = (0.5 * Math.PI) / (a * (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e+154: tmp = 0.5 * (math.pi / (a * (a * b))) elif a <= -2.9e-115: tmp = (-1.0 / b) / (2.0 / ((math.pi / (a + b)) / (b - a))) else: tmp = (0.5 * math.pi) / (a * (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e+154) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); elseif (a <= -2.9e-115) tmp = Float64(Float64(-1.0 / b) / Float64(2.0 / Float64(Float64(pi / Float64(a + b)) / Float64(b - a)))); else tmp = Float64(Float64(0.5 * pi) / Float64(a * Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e+154)
tmp = 0.5 * (pi / (a * (a * b)));
elseif (a <= -2.9e-115)
tmp = (-1.0 / b) / (2.0 / ((pi / (a + b)) / (b - a)));
else
tmp = (0.5 * pi) / (a * (b * 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, -2e+154], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -2.9e-115], N[(N[(-1.0 / b), $MachinePrecision] / N[(2.0 / N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * Pi), $MachinePrecision] / N[(a * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{+154}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{elif}\;a \leq -2.9 \cdot 10^{-115}:\\
\;\;\;\;\frac{\frac{-1}{b}}{\frac{2}{\frac{\frac{\pi}{a + b}}{b - a}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{a \cdot \left(b \cdot b\right)}\\
\end{array}
\end{array}
if a < -2.00000000000000007e154Initial program 55.8%
inv-pow55.8%
difference-of-squares69.7%
unpow-prod-down73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
associate-*r/73.3%
*-rgt-identity73.3%
+-commutative73.3%
Simplified73.3%
add-cube-cbrt73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
inv-pow73.3%
Applied egg-rr73.3%
Taylor expanded in a around inf 69.7%
unpow269.7%
associate-*l*98.2%
Simplified98.2%
if -2.00000000000000007e154 < a < -2.8999999999999998e-115Initial program 94.4%
*-commutative94.4%
associate-*l/94.4%
associate-*r/94.4%
associate-/l*94.5%
sub-neg94.5%
distribute-neg-frac94.5%
metadata-eval94.5%
associate-*r/94.7%
*-rgt-identity94.7%
difference-of-squares94.7%
associate-/r*94.7%
Simplified94.7%
Taylor expanded in a around inf 70.6%
if -2.8999999999999998e-115 < a Initial program 77.9%
Taylor expanded in b around inf 62.6%
associate-*r/62.6%
unpow262.6%
Simplified62.6%
Final simplification69.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.48e-89) (* 0.5 (/ PI (* a (* a b)))) (* 0.5 (/ (/ PI a) (* b b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.48e-89) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = 0.5 * ((((double) M_PI) / a) / (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.48e-89) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = 0.5 * ((Math.PI / a) / (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.48e-89: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = 0.5 * ((math.pi / a) / (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.48e-89) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(0.5 * Float64(Float64(pi / a) / Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.48e-89)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = 0.5 * ((pi / a) / (b * 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.48e-89], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(Pi / a), $MachinePrecision] / N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.48 \cdot 10^{-89}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{\frac{\pi}{a}}{b \cdot b}\\
\end{array}
\end{array}
if a < -1.48000000000000007e-89Initial program 77.8%
inv-pow77.8%
difference-of-squares84.3%
unpow-prod-down86.9%
inv-pow86.9%
inv-pow86.9%
Applied egg-rr86.9%
associate-*r/86.9%
*-rgt-identity86.9%
+-commutative86.9%
Simplified86.9%
add-cube-cbrt86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
Applied egg-rr86.5%
Taylor expanded in a around inf 69.6%
unpow269.6%
associate-*l*82.8%
Simplified82.8%
if -1.48000000000000007e-89 < a Initial program 78.7%
inv-pow78.7%
difference-of-squares87.6%
unpow-prod-down87.9%
inv-pow87.9%
inv-pow87.9%
Applied egg-rr87.9%
associate-*r/88.0%
*-rgt-identity88.0%
+-commutative88.0%
Simplified88.0%
Taylor expanded in a around 0 64.1%
associate-/r*64.1%
unpow264.1%
Simplified64.1%
Final simplification69.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.55e-89) (* 0.5 (/ PI (* a (* a b)))) (* (/ PI a) (/ 0.5 (* b b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.55e-89) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = (((double) M_PI) / a) * (0.5 / (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.55e-89) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = (Math.PI / a) * (0.5 / (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.55e-89: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = (math.pi / a) * (0.5 / (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.55e-89) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(Float64(pi / a) * Float64(0.5 / Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.55e-89)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = (pi / a) * (0.5 / (b * 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.55e-89], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / a), $MachinePrecision] * N[(0.5 / N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.55 \cdot 10^{-89}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{a} \cdot \frac{0.5}{b \cdot b}\\
\end{array}
\end{array}
if a < -1.54999999999999998e-89Initial program 77.8%
inv-pow77.8%
difference-of-squares84.3%
unpow-prod-down86.9%
inv-pow86.9%
inv-pow86.9%
Applied egg-rr86.9%
associate-*r/86.9%
*-rgt-identity86.9%
+-commutative86.9%
Simplified86.9%
add-cube-cbrt86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
Applied egg-rr86.5%
Taylor expanded in a around inf 69.6%
unpow269.6%
associate-*l*82.8%
Simplified82.8%
if -1.54999999999999998e-89 < a Initial program 78.7%
inv-pow78.7%
difference-of-squares87.6%
unpow-prod-down87.9%
inv-pow87.9%
inv-pow87.9%
Applied egg-rr87.9%
associate-*r/88.0%
*-rgt-identity88.0%
+-commutative88.0%
Simplified88.0%
add-cube-cbrt87.5%
inv-pow87.5%
inv-pow87.5%
inv-pow87.5%
inv-pow87.5%
inv-pow87.5%
inv-pow87.5%
Applied egg-rr87.5%
Taylor expanded in a around 0 64.1%
associate-*r/64.1%
*-commutative64.1%
times-frac64.1%
unpow264.1%
Simplified64.1%
Final simplification69.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.55e-89) (* 0.5 (/ PI (* a (* a b)))) (/ (* 0.5 PI) (* a (* b b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.55e-89) {
tmp = 0.5 * (((double) M_PI) / (a * (a * b)));
} else {
tmp = (0.5 * ((double) M_PI)) / (a * (b * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.55e-89) {
tmp = 0.5 * (Math.PI / (a * (a * b)));
} else {
tmp = (0.5 * Math.PI) / (a * (b * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.55e-89: tmp = 0.5 * (math.pi / (a * (a * b))) else: tmp = (0.5 * math.pi) / (a * (b * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.55e-89) tmp = Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))); else tmp = Float64(Float64(0.5 * pi) / Float64(a * Float64(b * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.55e-89)
tmp = 0.5 * (pi / (a * (a * b)));
else
tmp = (0.5 * pi) / (a * (b * 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.55e-89], N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * Pi), $MachinePrecision] / N[(a * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.55 \cdot 10^{-89}:\\
\;\;\;\;0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{a \cdot \left(b \cdot b\right)}\\
\end{array}
\end{array}
if a < -1.54999999999999998e-89Initial program 77.8%
inv-pow77.8%
difference-of-squares84.3%
unpow-prod-down86.9%
inv-pow86.9%
inv-pow86.9%
Applied egg-rr86.9%
associate-*r/86.9%
*-rgt-identity86.9%
+-commutative86.9%
Simplified86.9%
add-cube-cbrt86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
inv-pow86.5%
Applied egg-rr86.5%
Taylor expanded in a around inf 69.6%
unpow269.6%
associate-*l*82.8%
Simplified82.8%
if -1.54999999999999998e-89 < a Initial program 78.7%
Taylor expanded in b around inf 64.1%
associate-*r/64.1%
unpow264.1%
Simplified64.1%
Final simplification69.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* 0.5 (/ PI (* a (* a b)))))
assert(a < b);
double code(double a, double b) {
return 0.5 * (((double) M_PI) / (a * (a * b)));
}
assert a < b;
public static double code(double a, double b) {
return 0.5 * (Math.PI / (a * (a * b)));
}
[a, b] = sort([a, b]) def code(a, b): return 0.5 * (math.pi / (a * (a * b)))
a, b = sort([a, b]) function code(a, b) return Float64(0.5 * Float64(pi / Float64(a * Float64(a * b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = 0.5 * (pi / (a * (a * b)));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(0.5 * N[(Pi / N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
0.5 \cdot \frac{\pi}{a \cdot \left(a \cdot b\right)}
\end{array}
Initial program 78.4%
inv-pow78.4%
difference-of-squares86.6%
unpow-prod-down87.6%
inv-pow87.6%
inv-pow87.6%
Applied egg-rr87.6%
associate-*r/87.6%
*-rgt-identity87.6%
+-commutative87.6%
Simplified87.6%
add-cube-cbrt87.2%
inv-pow87.2%
inv-pow87.2%
inv-pow87.2%
inv-pow87.2%
inv-pow87.2%
inv-pow87.2%
Applied egg-rr87.2%
Taylor expanded in a around inf 55.7%
unpow255.7%
associate-*l*61.9%
Simplified61.9%
Final simplification61.9%
herbie shell --seed 2023293
(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))))