
(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 13 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 (/ (/ (* (/ PI a) 0.5) b) (+ a b)))
assert(a < b);
double code(double a, double b) {
return (((((double) M_PI) / a) * 0.5) / b) / (a + b);
}
assert a < b;
public static double code(double a, double b) {
return (((Math.PI / a) * 0.5) / b) / (a + b);
}
[a, b] = sort([a, b]) def code(a, b): return (((math.pi / a) * 0.5) / b) / (a + b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(pi / a) * 0.5) / b) / Float64(a + b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (((pi / a) * 0.5) / b) / (a + b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(N[(Pi / a), $MachinePrecision] * 0.5), $MachinePrecision] / b), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\frac{\pi}{a} \cdot 0.5}{b}}{a + b}
\end{array}
Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ (* 0.5 PI) (+ b a)) (* a b)))
assert(a < b);
double code(double a, double b) {
return ((0.5 * ((double) M_PI)) / (b + a)) / (a * b);
}
assert a < b;
public static double code(double a, double b) {
return ((0.5 * Math.PI) / (b + a)) / (a * b);
}
[a, b] = sort([a, b]) def code(a, b): return ((0.5 * math.pi) / (b + a)) / (a * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(0.5 * pi) / Float64(b + a)) / Float64(a * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((0.5 * pi) / (b + a)) / (a * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(0.5 * Pi), $MachinePrecision] / N[(b + a), $MachinePrecision]), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{0.5 \cdot \pi}{b + a}}{a \cdot b}
\end{array}
Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
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 b))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / (a + b)) * (0.5 / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / (a + b)) * (0.5 / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / (a + b)) * (0.5 / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(a + b)) * Float64(0.5 / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / (a + b)) * (0.5 / (a * b));
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 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{a + b} \cdot \frac{0.5}{a \cdot b}
\end{array}
Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lift-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.6
Applied rewrites99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 2.05e+104) (/ (* PI 0.5) (* (* (+ b a) b) a)) (/ (/ (* (/ PI a) 0.5) b) b)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 2.05e+104) {
tmp = (((double) M_PI) * 0.5) / (((b + a) * b) * a);
} 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 (b <= 2.05e+104) {
tmp = (Math.PI * 0.5) / (((b + a) * b) * a);
} else {
tmp = (((Math.PI / a) * 0.5) / b) / b;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 2.05e+104: tmp = (math.pi * 0.5) / (((b + a) * b) * a) else: tmp = (((math.pi / a) * 0.5) / b) / b return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 2.05e+104) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(Float64(b + a) * b) * a)); else tmp = Float64(Float64(Float64(Float64(pi / a) * 0.5) / b) / b); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 2.05e+104)
tmp = (pi * 0.5) / (((b + a) * b) * a);
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[b, 2.05e+104], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(N[(b + a), $MachinePrecision] * b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(Pi / a), $MachinePrecision] * 0.5), $MachinePrecision] / b), $MachinePrecision] / b), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 2.05 \cdot 10^{+104}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(\left(b + a\right) \cdot b\right) \cdot a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\pi}{a} \cdot 0.5}{b}}{b}\\
\end{array}
\end{array}
if b < 2.04999999999999992e104Initial program 78.1%
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lift-/.f64N/A
mult-flipN/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-lft-identityN/A
/-rgt-identityN/A
mult-flipN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
*-lft-identityN/A
*-rgt-identityN/A
lower--.f6488.0
Applied rewrites88.0%
Applied rewrites93.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
associate-*l/N/A
lower-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-PI.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
if 2.04999999999999992e104 < b Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
Applied rewrites62.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 8.5e+77) (* (/ 0.5 (* (* (+ a b) b) a)) PI) (/ (/ (* (/ PI a) 0.5) b) b)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 8.5e+77) {
tmp = (0.5 / (((a + b) * b) * a)) * ((double) M_PI);
} 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 (b <= 8.5e+77) {
tmp = (0.5 / (((a + b) * b) * a)) * Math.PI;
} else {
tmp = (((Math.PI / a) * 0.5) / b) / b;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 8.5e+77: tmp = (0.5 / (((a + b) * b) * a)) * math.pi else: tmp = (((math.pi / a) * 0.5) / b) / b return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 8.5e+77) tmp = Float64(Float64(0.5 / Float64(Float64(Float64(a + b) * b) * a)) * pi); else tmp = Float64(Float64(Float64(Float64(pi / a) * 0.5) / b) / b); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 8.5e+77)
tmp = (0.5 / (((a + b) * b) * a)) * pi;
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[b, 8.5e+77], N[(N[(0.5 / N[(N[(N[(a + b), $MachinePrecision] * b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] * Pi), $MachinePrecision], N[(N[(N[(N[(Pi / a), $MachinePrecision] * 0.5), $MachinePrecision] / b), $MachinePrecision] / b), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 8.5 \cdot 10^{+77}:\\
\;\;\;\;\frac{0.5}{\left(\left(a + b\right) \cdot b\right) \cdot a} \cdot \pi\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\pi}{a} \cdot 0.5}{b}}{b}\\
\end{array}
\end{array}
if b < 8.50000000000000018e77Initial program 78.1%
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lift-/.f64N/A
mult-flipN/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-lft-identityN/A
/-rgt-identityN/A
mult-flipN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
*-lft-identityN/A
*-rgt-identityN/A
lower--.f6488.0
Applied rewrites88.0%
Applied rewrites93.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
if 8.50000000000000018e77 < b Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
Applied rewrites62.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ 0.5 (* b (* a (+ b a)))) PI))
assert(a < b);
double code(double a, double b) {
return (0.5 / (b * (a * (b + a)))) * ((double) M_PI);
}
assert a < b;
public static double code(double a, double b) {
return (0.5 / (b * (a * (b + a)))) * Math.PI;
}
[a, b] = sort([a, b]) def code(a, b): return (0.5 / (b * (a * (b + a)))) * math.pi
a, b = sort([a, b]) function code(a, b) return Float64(Float64(0.5 / Float64(b * Float64(a * Float64(b + a)))) * pi) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (0.5 / (b * (a * (b + a)))) * pi;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(0.5 / N[(b * N[(a * N[(b + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * Pi), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{b \cdot \left(a \cdot \left(b + a\right)\right)} \cdot \pi
\end{array}
Initial program 78.1%
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lift-/.f64N/A
mult-flipN/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-lft-identityN/A
/-rgt-identityN/A
mult-flipN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
*-lft-identityN/A
*-rgt-identityN/A
lower--.f6488.0
Applied rewrites88.0%
Applied rewrites93.0%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (/ (* PI 0.5) (* (* a a) b)) (/ (/ (* (/ PI a) 0.5) b) b)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (((double) M_PI) * 0.5) / ((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 <= -2e-23) {
tmp = (Math.PI * 0.5) / ((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 <= -2e-23: tmp = (math.pi * 0.5) / ((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 <= -2e-23) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(a * a) * b)); else tmp = Float64(Float64(Float64(Float64(pi / a) * 0.5) / b) / b); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e-23)
tmp = (pi * 0.5) / ((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, -2e-23], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(Pi / a), $MachinePrecision] * 0.5), $MachinePrecision] / b), $MachinePrecision] / b), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(a \cdot a\right) \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\pi}{a} \cdot 0.5}{b}}{b}\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
Applied rewrites62.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (/ (* PI 0.5) (* (* a a) b)) (/ (* (/ 0.5 b) PI) (* b a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (((double) M_PI) * 0.5) / ((a * a) * b);
} else {
tmp = ((0.5 / b) * ((double) M_PI)) / (b * a);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (Math.PI * 0.5) / ((a * a) * b);
} else {
tmp = ((0.5 / b) * Math.PI) / (b * a);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e-23: tmp = (math.pi * 0.5) / ((a * a) * b) else: tmp = ((0.5 / b) * math.pi) / (b * a) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e-23) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(a * a) * b)); else tmp = Float64(Float64(Float64(0.5 / b) * pi) / 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-23)
tmp = (pi * 0.5) / ((a * a) * b);
else
tmp = ((0.5 / b) * pi) / (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-23], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.5 / b), $MachinePrecision] * Pi), $MachinePrecision] / N[(b * a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(a \cdot a\right) \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{0.5}{b} \cdot \pi}{b \cdot a}\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l/N/A
lift-*.f64N/A
associate-/r*N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6493.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.5
Applied rewrites93.5%
Taylor expanded in a around 0
Applied rewrites62.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (/ (* PI 0.5) (* (* a a) b)) (* (/ PI b) (/ 0.5 (* a b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (((double) M_PI) * 0.5) / ((a * a) * b);
} else {
tmp = (((double) M_PI) / b) * (0.5 / (a * b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (Math.PI * 0.5) / ((a * a) * b);
} else {
tmp = (Math.PI / b) * (0.5 / (a * b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e-23: tmp = (math.pi * 0.5) / ((a * a) * b) else: tmp = (math.pi / b) * (0.5 / (a * b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e-23) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(a * a) * b)); else tmp = Float64(Float64(pi / b) * Float64(0.5 / Float64(a * b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e-23)
tmp = (pi * 0.5) / ((a * a) * b);
else
tmp = (pi / b) * (0.5 / (a * b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -2e-23], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(N[(Pi / b), $MachinePrecision] * N[(0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(a \cdot a\right) \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{b} \cdot \frac{0.5}{a \cdot b}\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lift-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.6
Applied rewrites99.6%
Taylor expanded in a around 0
Applied rewrites62.5%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (/ (* PI 0.5) (* (* a a) b)) (/ (* PI 0.5) (* (* b a) b))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (((double) M_PI) * 0.5) / ((a * a) * b);
} else {
tmp = (((double) M_PI) * 0.5) / ((b * a) * b);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (Math.PI * 0.5) / ((a * a) * b);
} else {
tmp = (Math.PI * 0.5) / ((b * a) * b);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e-23: tmp = (math.pi * 0.5) / ((a * a) * b) else: tmp = (math.pi * 0.5) / ((b * a) * b) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -2e-23) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(a * a) * b)); else tmp = Float64(Float64(pi * 0.5) / Float64(Float64(b * a) * b)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -2e-23)
tmp = (pi * 0.5) / ((a * a) * b);
else
tmp = (pi * 0.5) / ((b * a) * b);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -2e-23], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(b * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(a \cdot a\right) \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(b \cdot a\right) \cdot b}\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around 0
Applied rewrites62.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (/ (* PI 0.5) (* (* a a) b)) (* (/ PI (* (* b b) a)) 0.5)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (((double) M_PI) * 0.5) / ((a * a) * b);
} 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 <= -2e-23) {
tmp = (Math.PI * 0.5) / ((a * a) * b);
} else {
tmp = (Math.PI / ((b * b) * a)) * 0.5;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e-23: tmp = (math.pi * 0.5) / ((a * a) * b) 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 <= -2e-23) tmp = Float64(Float64(pi * 0.5) / Float64(Float64(a * a) * b)); 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 <= -2e-23)
tmp = (pi * 0.5) / ((a * a) * b);
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, -2e-23], N[(N[(Pi * 0.5), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $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 -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{\left(a \cdot a\right) \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{\left(b \cdot b\right) \cdot a} \cdot 0.5\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-/.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6456.3
Applied rewrites56.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -2e-23) (* (/ 0.5 (* (* a a) b)) PI) (* (/ PI (* (* b b) a)) 0.5)))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -2e-23) {
tmp = (0.5 / ((a * a) * b)) * ((double) M_PI);
} 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 <= -2e-23) {
tmp = (0.5 / ((a * a) * b)) * Math.PI;
} else {
tmp = (Math.PI / ((b * b) * a)) * 0.5;
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -2e-23: tmp = (0.5 / ((a * a) * b)) * math.pi 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 <= -2e-23) tmp = Float64(Float64(0.5 / Float64(Float64(a * a) * b)) * pi); 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 <= -2e-23)
tmp = (0.5 / ((a * a) * b)) * pi;
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, -2e-23], N[(N[(0.5 / N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] * Pi), $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 -2 \cdot 10^{-23}:\\
\;\;\;\;\frac{0.5}{\left(a \cdot a\right) \cdot b} \cdot \pi\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi}{\left(b \cdot b\right) \cdot a} \cdot 0.5\\
\end{array}
\end{array}
if a < -1.99999999999999992e-23Initial program 78.1%
lift-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lift-/.f64N/A
mult-flipN/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-lft-identityN/A
/-rgt-identityN/A
mult-flipN/A
metadata-evalN/A
lower-/.f64N/A
metadata-evalN/A
*-lft-identityN/A
*-rgt-identityN/A
lower--.f6488.0
Applied rewrites88.0%
Applied rewrites93.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.1
Applied rewrites93.1%
Taylor expanded in a around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
if -1.99999999999999992e-23 < a Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6456.3
Applied rewrites56.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ PI (* (* b b) a)) 0.5))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / ((b * b) * a)) * 0.5;
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / ((b * b) * a)) * 0.5;
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / ((b * b) * a)) * 0.5
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(Float64(b * b) * a)) * 0.5) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / ((b * b) * a)) * 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[(b * b), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{\left(b \cdot b\right) \cdot a} \cdot 0.5
\end{array}
Initial program 78.1%
lift-*.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-subN/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
frac-2neg-revN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift--.f64N/A
sub-negate-revN/A
lift--.f64N/A
lift-*.f64N/A
div-flip-revN/A
lift-*.f64N/A
lift-+.f64N/A
lift--.f64N/A
difference-of-squares-revN/A
lift--.f64N/A
flip-+N/A
lift-+.f64N/A
Applied rewrites99.7%
lift-/.f64N/A
mult-flipN/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
inv-powN/A
frac-timesN/A
lift-+.f64N/A
+-commutativeN/A
sum-to-multN/A
*-inversesN/A
div-addN/A
+-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
frac-timesN/A
Applied rewrites99.7%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lift-PI.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6456.3
Applied rewrites56.3%
herbie shell --seed 2025140
(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))))