
(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}
Herbie found 8 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
(let* ((t_0 (* (* a b) 2.0)))
(if (<= a -1.95e+157)
(/ (/ (+ PI (* -1.0 (/ (* b PI) a))) a) t_0)
(if (<= a -4.7e-176)
(/ (* (- (* 1.0 b) (* a 1.0)) (* PI (/ 1.0 (* (+ b a) (- b a))))) t_0)
(/ (/ PI b) t_0)))))assert(a < b);
double code(double a, double b) {
double t_0 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((((double) M_PI) + (-1.0 * ((b * ((double) M_PI)) / a))) / a) / t_0;
} else if (a <= -4.7e-176) {
tmp = (((1.0 * b) - (a * 1.0)) * (((double) M_PI) * (1.0 / ((b + a) * (b - 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 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((Math.PI + (-1.0 * ((b * Math.PI) / a))) / a) / t_0;
} else if (a <= -4.7e-176) {
tmp = (((1.0 * b) - (a * 1.0)) * (Math.PI * (1.0 / ((b + a) * (b - a))))) / t_0;
} else {
tmp = (Math.PI / b) / t_0;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): t_0 = (a * b) * 2.0 tmp = 0 if a <= -1.95e+157: tmp = ((math.pi + (-1.0 * ((b * math.pi) / a))) / a) / t_0 elif a <= -4.7e-176: tmp = (((1.0 * b) - (a * 1.0)) * (math.pi * (1.0 / ((b + a) * (b - a))))) / t_0 else: tmp = (math.pi / b) / t_0 return tmp
a, b = sort([a, b]) function code(a, b) t_0 = Float64(Float64(a * b) * 2.0) tmp = 0.0 if (a <= -1.95e+157) tmp = Float64(Float64(Float64(pi + Float64(-1.0 * Float64(Float64(b * pi) / a))) / a) / t_0); elseif (a <= -4.7e-176) tmp = Float64(Float64(Float64(Float64(1.0 * b) - Float64(a * 1.0)) * Float64(pi * Float64(1.0 / Float64(Float64(b + a) * Float64(b - 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 = (a * b) * 2.0;
tmp = 0.0;
if (a <= -1.95e+157)
tmp = ((pi + (-1.0 * ((b * pi) / a))) / a) / t_0;
elseif (a <= -4.7e-176)
tmp = (((1.0 * b) - (a * 1.0)) * (pi * (1.0 / ((b + a) * (b - 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[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[a, -1.95e+157], N[(N[(N[(Pi + N[(-1.0 * N[(N[(b * Pi), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[a, -4.7e-176], N[(N[(N[(N[(1.0 * b), $MachinePrecision] - N[(a * 1.0), $MachinePrecision]), $MachinePrecision] * N[(Pi * N[(1.0 / N[(N[(b + a), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := \left(a \cdot b\right) \cdot 2\\
\mathbf{if}\;a \leq -1.95 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{\pi + -1 \cdot \frac{b \cdot \pi}{a}}{a}}{t\_0}\\
\mathbf{elif}\;a \leq -4.7 \cdot 10^{-176}:\\
\;\;\;\;\frac{\left(1 \cdot b - a \cdot 1\right) \cdot \left(\pi \cdot \frac{1}{\left(b + a\right) \cdot \left(b - a\right)}\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{t\_0}\\
\end{array}
\end{array}
if a < -1.94999999999999985e157Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around inf
lower-/.f64N/A
lower-+.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-PI.f6456.6
Applied rewrites56.6%
if -1.94999999999999985e157 < a < -4.69999999999999984e-176Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
if -4.69999999999999984e-176 < a Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(let* ((t_0 (* (* a b) 2.0)))
(if (<= a -1.95e+157)
(/ (/ (+ PI (* -1.0 (/ (* b PI) a))) a) t_0)
(if (<= a -5e-176)
(* (/ (* 0.5 PI) (* (+ b a) (- b a))) (- (/ 1.0 a) (/ 1.0 b)))
(/ (/ PI b) t_0)))))assert(a < b);
double code(double a, double b) {
double t_0 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((((double) M_PI) + (-1.0 * ((b * ((double) M_PI)) / a))) / a) / t_0;
} else if (a <= -5e-176) {
tmp = ((0.5 * ((double) M_PI)) / ((b + a) * (b - a))) * ((1.0 / a) - (1.0 / b));
} else {
tmp = (((double) M_PI) / b) / t_0;
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double t_0 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((Math.PI + (-1.0 * ((b * Math.PI) / a))) / a) / t_0;
} else if (a <= -5e-176) {
tmp = ((0.5 * Math.PI) / ((b + a) * (b - a))) * ((1.0 / a) - (1.0 / b));
} else {
tmp = (Math.PI / b) / t_0;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): t_0 = (a * b) * 2.0 tmp = 0 if a <= -1.95e+157: tmp = ((math.pi + (-1.0 * ((b * math.pi) / a))) / a) / t_0 elif a <= -5e-176: tmp = ((0.5 * math.pi) / ((b + a) * (b - a))) * ((1.0 / a) - (1.0 / b)) else: tmp = (math.pi / b) / t_0 return tmp
a, b = sort([a, b]) function code(a, b) t_0 = Float64(Float64(a * b) * 2.0) tmp = 0.0 if (a <= -1.95e+157) tmp = Float64(Float64(Float64(pi + Float64(-1.0 * Float64(Float64(b * pi) / a))) / a) / t_0); elseif (a <= -5e-176) tmp = Float64(Float64(Float64(0.5 * pi) / Float64(Float64(b + a) * Float64(b - a))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))); 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 = (a * b) * 2.0;
tmp = 0.0;
if (a <= -1.95e+157)
tmp = ((pi + (-1.0 * ((b * pi) / a))) / a) / t_0;
elseif (a <= -5e-176)
tmp = ((0.5 * pi) / ((b + a) * (b - a))) * ((1.0 / a) - (1.0 / b));
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[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[a, -1.95e+157], N[(N[(N[(Pi + N[(-1.0 * N[(N[(b * Pi), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[a, -5e-176], N[(N[(N[(0.5 * Pi), $MachinePrecision] / N[(N[(b + a), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
t_0 := \left(a \cdot b\right) \cdot 2\\
\mathbf{if}\;a \leq -1.95 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{\pi + -1 \cdot \frac{b \cdot \pi}{a}}{a}}{t\_0}\\
\mathbf{elif}\;a \leq -5 \cdot 10^{-176}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{\left(b + a\right) \cdot \left(b - a\right)} \cdot \left(\frac{1}{a} - \frac{1}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{t\_0}\\
\end{array}
\end{array}
if a < -1.94999999999999985e157Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around inf
lower-/.f64N/A
lower-+.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-PI.f6456.6
Applied rewrites56.6%
if -1.94999999999999985e157 < a < -5e-176Initial program 79.1%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
mult-flip-revN/A
lift-PI.f64N/A
lift-/.f64N/A
mult-flipN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
lift-PI.f64N/A
difference-of-squaresN/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f6487.7
Applied rewrites87.7%
if -5e-176 < a Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(let* ((t_0 (* (* a b) 2.0)))
(if (<= a -1.95e+157)
(/ (/ (+ PI (* -1.0 (/ (* b PI) a))) a) t_0)
(if (<= a -2.5e-106)
(* (/ (* PI 0.5) (* (+ b a) (- b a))) (/ -1.0 b))
(/ (/ PI b) t_0)))))assert(a < b);
double code(double a, double b) {
double t_0 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((((double) M_PI) + (-1.0 * ((b * ((double) M_PI)) / a))) / a) / t_0;
} else if (a <= -2.5e-106) {
tmp = ((((double) M_PI) * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
} else {
tmp = (((double) M_PI) / b) / t_0;
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double t_0 = (a * b) * 2.0;
double tmp;
if (a <= -1.95e+157) {
tmp = ((Math.PI + (-1.0 * ((b * Math.PI) / a))) / a) / t_0;
} else if (a <= -2.5e-106) {
tmp = ((Math.PI * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
} else {
tmp = (Math.PI / b) / t_0;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): t_0 = (a * b) * 2.0 tmp = 0 if a <= -1.95e+157: tmp = ((math.pi + (-1.0 * ((b * math.pi) / a))) / a) / t_0 elif a <= -2.5e-106: tmp = ((math.pi * 0.5) / ((b + a) * (b - a))) * (-1.0 / b) else: tmp = (math.pi / b) / t_0 return tmp
a, b = sort([a, b]) function code(a, b) t_0 = Float64(Float64(a * b) * 2.0) tmp = 0.0 if (a <= -1.95e+157) tmp = Float64(Float64(Float64(pi + Float64(-1.0 * Float64(Float64(b * pi) / a))) / a) / t_0); elseif (a <= -2.5e-106) tmp = Float64(Float64(Float64(pi * 0.5) / Float64(Float64(b + a) * Float64(b - a))) * Float64(-1.0 / b)); 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 = (a * b) * 2.0;
tmp = 0.0;
if (a <= -1.95e+157)
tmp = ((pi + (-1.0 * ((b * pi) / a))) / a) / t_0;
elseif (a <= -2.5e-106)
tmp = ((pi * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
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[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[a, -1.95e+157], N[(N[(N[(Pi + N[(-1.0 * N[(N[(b * Pi), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[a, -2.5e-106], N[(N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(b + a), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
t_0 := \left(a \cdot b\right) \cdot 2\\
\mathbf{if}\;a \leq -1.95 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{\pi + -1 \cdot \frac{b \cdot \pi}{a}}{a}}{t\_0}\\
\mathbf{elif}\;a \leq -2.5 \cdot 10^{-106}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(b + a\right) \cdot \left(b - a\right)} \cdot \frac{-1}{b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{t\_0}\\
\end{array}
\end{array}
if a < -1.94999999999999985e157Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around inf
lower-/.f64N/A
lower-+.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lift-PI.f6456.6
Applied rewrites56.6%
if -1.94999999999999985e157 < a < -2.49999999999999991e-106Initial program 79.1%
Taylor expanded in a around inf
lower-/.f6454.9
Applied rewrites54.9%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
difference-of-squares-revN/A
mult-flip-revN/A
lower-/.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
mult-flipN/A
metadata-evalN/A
lower-*.f64N/A
lift-PI.f64N/A
lift-+.f64N/A
lift--.f64N/A
lift-*.f6463.5
Applied rewrites63.5%
if -2.49999999999999991e-106 < a Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
:precision binary64
(if (<= b 1.15e-166)
(/ (* 0.5 (/ PI b)) (* a a))
(if (<= b 3.6e+60)
(* (/ (* 0.5 PI) (* (+ b a) (- b a))) (/ 1.0 a))
(/ (/ PI b) (* (* a b) 2.0)))))assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.15e-166) {
tmp = (0.5 * (((double) M_PI) / b)) / (a * a);
} else if (b <= 3.6e+60) {
tmp = ((0.5 * ((double) M_PI)) / ((b + a) * (b - a))) * (1.0 / a);
} else {
tmp = (((double) M_PI) / b) / ((a * b) * 2.0);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.15e-166) {
tmp = (0.5 * (Math.PI / b)) / (a * a);
} else if (b <= 3.6e+60) {
tmp = ((0.5 * Math.PI) / ((b + a) * (b - a))) * (1.0 / a);
} else {
tmp = (Math.PI / b) / ((a * b) * 2.0);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.15e-166: tmp = (0.5 * (math.pi / b)) / (a * a) elif b <= 3.6e+60: tmp = ((0.5 * math.pi) / ((b + a) * (b - a))) * (1.0 / a) else: tmp = (math.pi / b) / ((a * b) * 2.0) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.15e-166) tmp = Float64(Float64(0.5 * Float64(pi / b)) / Float64(a * a)); elseif (b <= 3.6e+60) tmp = Float64(Float64(Float64(0.5 * pi) / Float64(Float64(b + a) * Float64(b - a))) * Float64(1.0 / a)); else tmp = Float64(Float64(pi / b) / Float64(Float64(a * b) * 2.0)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.15e-166)
tmp = (0.5 * (pi / b)) / (a * a);
elseif (b <= 3.6e+60)
tmp = ((0.5 * pi) / ((b + a) * (b - a))) * (1.0 / a);
else
tmp = (pi / b) / ((a * b) * 2.0);
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.15e-166], N[(N[(0.5 * N[(Pi / b), $MachinePrecision]), $MachinePrecision] / N[(a * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.6e+60], N[(N[(N[(0.5 * Pi), $MachinePrecision] / N[(N[(b + a), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] / N[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.15 \cdot 10^{-166}:\\
\;\;\;\;\frac{0.5 \cdot \frac{\pi}{b}}{a \cdot a}\\
\mathbf{elif}\;b \leq 3.6 \cdot 10^{+60}:\\
\;\;\;\;\frac{0.5 \cdot \pi}{\left(b + a\right) \cdot \left(b - a\right)} \cdot \frac{1}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{\left(a \cdot b\right) \cdot 2}\\
\end{array}
\end{array}
if b < 1.14999999999999999e-166Initial program 79.1%
Taylor expanded in a around inf
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
pow2N/A
lift-*.f6449.2
Applied rewrites49.2%
Taylor expanded in a around inf
lower-*.f64N/A
lift-/.f64N/A
lift-PI.f6456.1
Applied rewrites56.1%
if 1.14999999999999999e-166 < b < 3.59999999999999968e60Initial program 79.1%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
mult-flip-revN/A
lift-PI.f64N/A
lift-/.f64N/A
mult-flipN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
lift-PI.f64N/A
difference-of-squaresN/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f6487.7
Applied rewrites87.7%
Taylor expanded in a around 0
lift-/.f6463.7
Applied rewrites63.7%
if 3.59999999999999968e60 < b Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2.5e-106) (* (/ (* PI 0.5) (* (+ b a) (- b a))) (/ -1.0 b)) (/ (/ PI b) (* (* a b) 2.0))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2.5e-106) {
tmp = ((((double) M_PI) * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
} else {
tmp = (((double) M_PI) / b) / ((a * b) * 2.0);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2.5e-106) {
tmp = ((Math.PI * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
} else {
tmp = (Math.PI / b) / ((a * b) * 2.0);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2.5e-106: tmp = ((math.pi * 0.5) / ((b + a) * (b - a))) * (-1.0 / b) else: tmp = (math.pi / b) / ((a * b) * 2.0) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2.5e-106) tmp = Float64(Float64(Float64(pi * 0.5) / Float64(Float64(b + a) * Float64(b - a))) * Float64(-1.0 / b)); else tmp = Float64(Float64(pi / b) / Float64(Float64(a * b) * 2.0)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2.5e-106)
tmp = ((pi * 0.5) / ((b + a) * (b - a))) * (-1.0 / b);
else
tmp = (pi / b) / ((a * b) * 2.0);
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-106], N[(N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(b + a), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] / N[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.5 \cdot 10^{-106}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(b + a\right) \cdot \left(b - a\right)} \cdot \frac{-1}{b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{\left(a \cdot b\right) \cdot 2}\\
\end{array}
\end{array}
if a < -2.49999999999999991e-106Initial program 79.1%
Taylor expanded in a around inf
lower-/.f6454.9
Applied rewrites54.9%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
difference-of-squares-revN/A
mult-flip-revN/A
lower-/.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
mult-flipN/A
metadata-evalN/A
lower-*.f64N/A
lift-PI.f64N/A
lift-+.f64N/A
lift--.f64N/A
lift-*.f6463.5
Applied rewrites63.5%
if -2.49999999999999991e-106 < a Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -1.6e-59) (* (/ PI (* (* a a) b)) 0.5) (/ (/ PI b) (* (* a b) 2.0))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -1.6e-59) {
tmp = (((double) M_PI) / ((a * a) * b)) * 0.5;
} else {
tmp = (((double) M_PI) / b) / ((a * b) * 2.0);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -1.6e-59) {
tmp = (Math.PI / ((a * a) * b)) * 0.5;
} else {
tmp = (Math.PI / b) / ((a * b) * 2.0);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -1.6e-59: tmp = (math.pi / ((a * a) * b)) * 0.5 else: tmp = (math.pi / b) / ((a * b) * 2.0) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -1.6e-59) tmp = Float64(Float64(pi / Float64(Float64(a * a) * b)) * 0.5); else tmp = Float64(Float64(pi / b) / Float64(Float64(a * b) * 2.0)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -1.6e-59)
tmp = (pi / ((a * a) * b)) * 0.5;
else
tmp = (pi / b) / ((a * b) * 2.0);
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-59], N[(N[(Pi / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] / N[(N[(a * b), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.6 \cdot 10^{-59}:\\
\;\;\;\;\frac{\pi}{\left(a \cdot a\right) \cdot b} \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{b}}{\left(a \cdot b\right) \cdot 2}\\
\end{array}
\end{array}
if a < -1.6e-59Initial program 79.1%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6456.2
Applied rewrites56.2%
if -1.6e-59 < a Initial program 79.1%
lift-*.f64N/A
lift-*.f64N/A
lift-PI.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
frac-subN/A
associate-*l/N/A
frac-timesN/A
Applied rewrites87.6%
Taylor expanded in a around 0
lift-/.f64N/A
lift-PI.f6462.6
Applied rewrites62.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -6.8e-60) (* (/ PI (* (* a a) b)) 0.5) (* (/ PI (* (* b b) a)) 0.5)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -6.8e-60) {
tmp = (((double) M_PI) / ((a * a) * b)) * 0.5;
} else {
tmp = (((double) M_PI) / ((b * b) * a)) * 0.5;
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -6.8e-60) {
tmp = (Math.PI / ((a * a) * b)) * 0.5;
} else {
tmp = (Math.PI / ((b * b) * a)) * 0.5;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -6.8e-60: tmp = (math.pi / ((a * a) * b)) * 0.5 else: tmp = (math.pi / ((b * b) * a)) * 0.5 return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -6.8e-60) tmp = Float64(Float64(pi / Float64(Float64(a * a) * b)) * 0.5); else tmp = Float64(Float64(pi / Float64(Float64(b * b) * a)) * 0.5); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -6.8e-60)
tmp = (pi / ((a * a) * b)) * 0.5;
else
tmp = (pi / ((b * b) * a)) * 0.5;
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.8e-60], N[(N[(Pi / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(Pi / N[(N[(b * b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -6.8 \cdot 10^{-60}:\\
\;\;\;\;\frac{\pi}{\left(a \cdot a\right) \cdot b} \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{\left(b \cdot b\right) \cdot a} \cdot 0.5\\
\end{array}
\end{array}
if a < -6.80000000000000013e-60Initial program 79.1%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6456.2
Applied rewrites56.2%
if -6.80000000000000013e-60 < a Initial program 79.1%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6456.8
Applied rewrites56.8%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ PI (* (* a a) b)) 0.5))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / ((a * a) * b)) * 0.5;
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / ((a * a) * b)) * 0.5;
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / ((a * a) * b)) * 0.5
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(Float64(a * a) * b)) * 0.5) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / ((a * a) * b)) * 0.5;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{\left(a \cdot a\right) \cdot b} \cdot 0.5
\end{array}
Initial program 79.1%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6456.2
Applied rewrites56.2%
herbie shell --seed 2025134
(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))))