
(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 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.5e+44) (* (/ (/ PI a) (* (+ a b) b)) 0.5) (/ (/ (/ PI (- b a)) a) (+ b b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.5e+44) {
tmp = ((((double) M_PI) / a) / ((a + b) * b)) * 0.5;
} else {
tmp = ((((double) M_PI) / (b - a)) / a) / (b + b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.5e+44) {
tmp = ((Math.PI / a) / ((a + b) * b)) * 0.5;
} else {
tmp = ((Math.PI / (b - a)) / a) / (b + b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.5e+44: tmp = ((math.pi / a) / ((a + b) * b)) * 0.5 else: tmp = ((math.pi / (b - a)) / a) / (b + b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.5e+44) tmp = Float64(Float64(Float64(pi / a) / Float64(Float64(a + b) * b)) * 0.5); else tmp = Float64(Float64(Float64(pi / Float64(b - a)) / a) / Float64(b + b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.5e+44)
tmp = ((pi / a) / ((a + b) * b)) * 0.5;
else
tmp = ((pi / (b - a)) / 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[b, 1.5e+44], N[(N[(N[(Pi / a), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(Pi / N[(b - a), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / N[(b + b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.5 \cdot 10^{+44}:\\
\;\;\;\;\frac{\frac{\pi}{a}}{\left(a + b\right) \cdot b} \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\pi}{b - a}}{a}}{b + b}\\
\end{array}
\end{array}
if b < 1.49999999999999993e44Initial program 78.8%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
mult-flipN/A
lower-*.f64N/A
Applied rewrites87.9%
Taylor expanded in a around 0
Applied rewrites64.8%
Taylor expanded in a around 0
Applied rewrites93.7%
Taylor expanded in a around 0
lower-/.f64N/A
lower-PI.f6493.8
Applied rewrites93.8%
if 1.49999999999999993e44 < b Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6466.7
Applied rewrites66.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.08e+76) (* (/ (/ PI a) (* (+ a b) b)) 0.5) (/ (/ PI (* (+ b b) a)) (- b a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.08e+76) {
tmp = ((((double) M_PI) / a) / ((a + b) * b)) * 0.5;
} else {
tmp = (((double) M_PI) / ((b + b) * a)) / (b - a);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.08e+76) {
tmp = ((Math.PI / a) / ((a + b) * b)) * 0.5;
} else {
tmp = (Math.PI / ((b + b) * a)) / (b - a);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.08e+76: tmp = ((math.pi / a) / ((a + b) * b)) * 0.5 else: tmp = (math.pi / ((b + b) * a)) / (b - a) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.08e+76) tmp = Float64(Float64(Float64(pi / a) / Float64(Float64(a + b) * b)) * 0.5); else tmp = Float64(Float64(pi / Float64(Float64(b + b) * a)) / Float64(b - a)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.08e+76)
tmp = ((pi / a) / ((a + b) * b)) * 0.5;
else
tmp = (pi / ((b + b) * a)) / (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, 1.08e+76], N[(N[(N[(Pi / a), $MachinePrecision] / N[(N[(a + b), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(Pi / N[(N[(b + b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.08 \cdot 10^{+76}:\\
\;\;\;\;\frac{\frac{\pi}{a}}{\left(a + b\right) \cdot b} \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\pi}{\left(b + b\right) \cdot a}}{b - a}\\
\end{array}
\end{array}
if b < 1.07999999999999999e76Initial program 78.8%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*l/N/A
mult-flipN/A
lower-*.f64N/A
Applied rewrites87.9%
Taylor expanded in a around 0
Applied rewrites64.8%
Taylor expanded in a around 0
Applied rewrites93.7%
Taylor expanded in a around 0
lower-/.f64N/A
lower-PI.f6493.8
Applied rewrites93.8%
if 1.07999999999999999e76 < b Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6466.6
Applied rewrites66.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ (* (/ (- b a) (* a b)) (* 0.5 PI)) (+ a b)) (- b a)))
assert(a < b);
double code(double a, double b) {
return ((((b - a) / (a * b)) * (0.5 * ((double) M_PI))) / (a + b)) / (b - a);
}
assert a < b;
public static double code(double a, double b) {
return ((((b - a) / (a * b)) * (0.5 * Math.PI)) / (a + b)) / (b - a);
}
[a, b] = sort([a, b]) def code(a, b): return ((((b - a) / (a * b)) * (0.5 * math.pi)) / (a + b)) / (b - a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(Float64(b - a) / Float64(a * b)) * Float64(0.5 * pi)) / Float64(a + b)) / Float64(b - a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((((b - a) / (a * b)) * (0.5 * pi)) / (a + b)) / (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[(b - a), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision] * N[(0.5 * Pi), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\frac{b - a}{a \cdot b} \cdot \left(0.5 \cdot \pi\right)}{a + b}}{b - a}
\end{array}
Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ (/ (- b a) (* a b)) (- b a)) (* 0.5 (/ PI (+ a b)))))
assert(a < b);
double code(double a, double b) {
return (((b - a) / (a * b)) / (b - a)) * (0.5 * (((double) M_PI) / (a + b)));
}
assert a < b;
public static double code(double a, double b) {
return (((b - a) / (a * b)) / (b - a)) * (0.5 * (Math.PI / (a + b)));
}
[a, b] = sort([a, b]) def code(a, b): return (((b - a) / (a * b)) / (b - a)) * (0.5 * (math.pi / (a + b)))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(b - a) / Float64(a * b)) / Float64(b - a)) * Float64(0.5 * Float64(pi / Float64(a + b)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (((b - a) / (a * b)) / (b - a)) * (0.5 * (pi / (a + b)));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(N[(b - a), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision] * N[(0.5 * N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{b - a}{a \cdot b}}{b - a} \cdot \left(0.5 \cdot \frac{\pi}{a + b}\right)
\end{array}
Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
*-commutativeN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* (/ PI (+ a b)) (- b a)) (* (- b a) (* (+ b b) a))))
assert(a < b);
double code(double a, double b) {
return ((((double) M_PI) / (a + b)) * (b - a)) / ((b - a) * ((b + b) * a));
}
assert a < b;
public static double code(double a, double b) {
return ((Math.PI / (a + b)) * (b - a)) / ((b - a) * ((b + b) * a));
}
[a, b] = sort([a, b]) def code(a, b): return ((math.pi / (a + b)) * (b - a)) / ((b - a) * ((b + b) * a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(pi / Float64(a + b)) * Float64(b - a)) / Float64(Float64(b - a) * Float64(Float64(b + b) * a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((pi / (a + b)) * (b - a)) / ((b - a) * ((b + b) * a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision] / N[(N[(b - a), $MachinePrecision] * N[(N[(b + b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\pi}{a + b} \cdot \left(b - a\right)}{\left(b - a\right) \cdot \left(\left(b + b\right) \cdot a\right)}
\end{array}
Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -3.8e-165) (/ (* PI (/ -0.5 (* a b))) (- b a)) (/ PI (* (+ b b) (* (- b a) a)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -3.8e-165) {
tmp = (((double) M_PI) * (-0.5 / (a * b))) / (b - a);
} else {
tmp = ((double) M_PI) / ((b + b) * ((b - a) * a));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -3.8e-165) {
tmp = (Math.PI * (-0.5 / (a * b))) / (b - a);
} else {
tmp = Math.PI / ((b + b) * ((b - a) * a));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -3.8e-165: tmp = (math.pi * (-0.5 / (a * b))) / (b - a) else: tmp = math.pi / ((b + b) * ((b - a) * a)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -3.8e-165) tmp = Float64(Float64(pi * Float64(-0.5 / Float64(a * b))) / Float64(b - a)); else tmp = Float64(pi / Float64(Float64(b + b) * Float64(Float64(b - a) * a))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -3.8e-165)
tmp = (pi * (-0.5 / (a * b))) / (b - a);
else
tmp = pi / ((b + b) * ((b - a) * 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, -3.8e-165], N[(N[(Pi * N[(-0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(Pi / N[(N[(b + b), $MachinePrecision] * N[(N[(b - a), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -3.8 \cdot 10^{-165}:\\
\;\;\;\;\frac{\pi \cdot \frac{-0.5}{a \cdot b}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{\left(b + b\right) \cdot \left(\left(b - a\right) \cdot a\right)}\\
\end{array}
\end{array}
if a < -3.80000000000000018e-165Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
lower-*.f6467.1
Applied rewrites67.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6467.1
Applied rewrites67.1%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6467.1
Applied rewrites67.1%
if -3.80000000000000018e-165 < a Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.4
Applied rewrites66.4%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -3.8e-165) (/ (* -0.5 (/ PI (* a b))) (- b a)) (/ PI (* (+ b b) (* (- b a) a)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -3.8e-165) {
tmp = (-0.5 * (((double) M_PI) / (a * b))) / (b - a);
} else {
tmp = ((double) M_PI) / ((b + b) * ((b - a) * a));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -3.8e-165) {
tmp = (-0.5 * (Math.PI / (a * b))) / (b - a);
} else {
tmp = Math.PI / ((b + b) * ((b - a) * a));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -3.8e-165: tmp = (-0.5 * (math.pi / (a * b))) / (b - a) else: tmp = math.pi / ((b + b) * ((b - a) * a)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -3.8e-165) tmp = Float64(Float64(-0.5 * Float64(pi / Float64(a * b))) / Float64(b - a)); else tmp = Float64(pi / Float64(Float64(b + b) * Float64(Float64(b - a) * a))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -3.8e-165)
tmp = (-0.5 * (pi / (a * b))) / (b - a);
else
tmp = pi / ((b + b) * ((b - a) * 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, -3.8e-165], N[(N[(-0.5 * N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(Pi / N[(N[(b + b), $MachinePrecision] * N[(N[(b - a), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -3.8 \cdot 10^{-165}:\\
\;\;\;\;\frac{-0.5 \cdot \frac{\pi}{a \cdot b}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{\left(b + b\right) \cdot \left(\left(b - a\right) \cdot a\right)}\\
\end{array}
\end{array}
if a < -3.80000000000000018e-165Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
lower-*.f6467.1
Applied rewrites67.1%
if -3.80000000000000018e-165 < a Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.4
Applied rewrites66.4%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ PI (* (+ b b) (* (- b a) a))))
assert(a < b);
double code(double a, double b) {
return ((double) M_PI) / ((b + b) * ((b - a) * a));
}
assert a < b;
public static double code(double a, double b) {
return Math.PI / ((b + b) * ((b - a) * a));
}
[a, b] = sort([a, b]) def code(a, b): return math.pi / ((b + b) * ((b - a) * a))
a, b = sort([a, b]) function code(a, b) return Float64(pi / Float64(Float64(b + b) * Float64(Float64(b - a) * a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = pi / ((b + b) * ((b - a) * a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(Pi / N[(N[(b + b), $MachinePrecision] * N[(N[(b - a), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{\left(b + b\right) \cdot \left(\left(b - a\right) \cdot a\right)}
\end{array}
Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.4
Applied rewrites66.4%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ PI (* (* (+ b b) (- b a)) a)))
assert(a < b);
double code(double a, double b) {
return ((double) M_PI) / (((b + b) * (b - a)) * a);
}
assert a < b;
public static double code(double a, double b) {
return Math.PI / (((b + b) * (b - a)) * a);
}
[a, b] = sort([a, b]) def code(a, b): return math.pi / (((b + b) * (b - a)) * a)
a, b = sort([a, b]) function code(a, b) return Float64(pi / Float64(Float64(Float64(b + b) * Float64(b - a)) * a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = pi / (((b + b) * (b - a)) * a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(Pi / N[(N[(N[(b + b), $MachinePrecision] * N[(b - a), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{\left(\left(b + b\right) \cdot \left(b - a\right)\right) \cdot a}
\end{array}
Initial program 78.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
associate-*r/N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sub-negate-revN/A
*-lft-identityN/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
sub-negate-revN/A
Applied rewrites99.6%
lift-/.f64N/A
lift-/.f64N/A
Applied rewrites99.0%
Taylor expanded in a around 0
lower-PI.f6466.3
Applied rewrites66.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6460.7
Applied rewrites60.7%
herbie shell --seed 2025156
(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))))