
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* x_m (* s_m c_m))))
(if (<= x_m 2.5e-5)
(/ (+ 1.0 (* -2.0 (* x_m x_m))) (* t_0 t_0))
(/ (/ (/ (/ (/ (cos (* x_m 2.0)) x_m) c_m) s_m) (* x_m c_m)) s_m))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = ((((cos((x_m * 2.0)) / x_m) / c_m) / s_m) / (x_m * c_m)) / s_m;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 2.5d-5) then
tmp = (1.0d0 + ((-2.0d0) * (x_m * x_m))) / (t_0 * t_0)
else
tmp = ((((cos((x_m * 2.0d0)) / x_m) / c_m) / s_m) / (x_m * c_m)) / s_m
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = ((((Math.cos((x_m * 2.0)) / x_m) / c_m) / s_m) / (x_m * c_m)) / s_m;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 2.5e-5: tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0) else: tmp = ((((math.cos((x_m * 2.0)) / x_m) / c_m) / s_m) / (x_m * c_m)) / s_m return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 2.5e-5) tmp = Float64(Float64(1.0 + Float64(-2.0 * Float64(x_m * x_m))) / Float64(t_0 * t_0)); else tmp = Float64(Float64(Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / x_m) / c_m) / s_m) / Float64(x_m * c_m)) / s_m); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 2.5e-5)
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
else
tmp = ((((cos((x_m * 2.0)) / x_m) / c_m) / s_m) / (x_m * c_m)) / s_m;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.5e-5], N[(N[(1.0 + N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;\frac{1 + -2 \cdot \left(x\_m \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m}}{c\_m}}{s\_m}}{x\_m \cdot c\_m}}{s\_m}\\
\end{array}
\end{array}
if x < 2.50000000000000012e-5Initial program 68.9%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.1%
Simplified86.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.8%
associate-/l*N/A
div-invN/A
frac-timesN/A
metadata-evalN/A
swap-sqrN/A
*-commutativeN/A
associate-*r*N/A
associate-/l/N/A
associate-*r*N/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied egg-rr76.6%
if 2.50000000000000012e-5 < x Initial program 55.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.8%
Simplified81.8%
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6494.2%
Applied egg-rr94.2%
associate-/l/N/A
associate-/r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr88.1%
associate-/r*N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f6490.9%
Applied egg-rr90.9%
Final simplification80.0%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* x_m (* s_m c_m))))
(if (<= x_m 2.5e-5)
(/ (+ 1.0 (* -2.0 (* x_m x_m))) (* t_0 t_0))
(/ (/ (/ (cos (* x_m 2.0)) t_0) (* x_m c_m)) s_m))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = ((cos((x_m * 2.0)) / t_0) / (x_m * c_m)) / s_m;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 2.5d-5) then
tmp = (1.0d0 + ((-2.0d0) * (x_m * x_m))) / (t_0 * t_0)
else
tmp = ((cos((x_m * 2.0d0)) / t_0) / (x_m * c_m)) / s_m
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = ((Math.cos((x_m * 2.0)) / t_0) / (x_m * c_m)) / s_m;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 2.5e-5: tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0) else: tmp = ((math.cos((x_m * 2.0)) / t_0) / (x_m * c_m)) / s_m return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 2.5e-5) tmp = Float64(Float64(1.0 + Float64(-2.0 * Float64(x_m * x_m))) / Float64(t_0 * t_0)); else tmp = Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / Float64(x_m * c_m)) / s_m); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 2.5e-5)
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
else
tmp = ((cos((x_m * 2.0)) / t_0) / (x_m * c_m)) / s_m;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.5e-5], N[(N[(1.0 + N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;\frac{1 + -2 \cdot \left(x\_m \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{x\_m \cdot c\_m}}{s\_m}\\
\end{array}
\end{array}
if x < 2.50000000000000012e-5Initial program 68.9%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.1%
Simplified86.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.8%
associate-/l*N/A
div-invN/A
frac-timesN/A
metadata-evalN/A
swap-sqrN/A
*-commutativeN/A
associate-*r*N/A
associate-/l/N/A
associate-*r*N/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied egg-rr76.6%
if 2.50000000000000012e-5 < x Initial program 55.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.8%
Simplified81.8%
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6494.2%
Applied egg-rr94.2%
associate-/l/N/A
associate-/r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr88.1%
Final simplification79.3%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (/ (cos (* x_m 2.0)) x_m)))
(if (<= c_m 1e-94)
(/ t_0 (* (* s_m c_m) (* x_m (* s_m c_m))))
(/ (/ t_0 s_m) (* (* s_m c_m) (* x_m c_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0)) / x_m;
double tmp;
if (c_m <= 1e-94) {
tmp = t_0 / ((s_m * c_m) * (x_m * (s_m * c_m)));
} else {
tmp = (t_0 / s_m) / ((s_m * c_m) * (x_m * c_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0)) / x_m
if (c_m <= 1d-94) then
tmp = t_0 / ((s_m * c_m) * (x_m * (s_m * c_m)))
else
tmp = (t_0 / s_m) / ((s_m * c_m) * (x_m * c_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0)) / x_m;
double tmp;
if (c_m <= 1e-94) {
tmp = t_0 / ((s_m * c_m) * (x_m * (s_m * c_m)));
} else {
tmp = (t_0 / s_m) / ((s_m * c_m) * (x_m * c_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) / x_m tmp = 0 if c_m <= 1e-94: tmp = t_0 / ((s_m * c_m) * (x_m * (s_m * c_m))) else: tmp = (t_0 / s_m) / ((s_m * c_m) * (x_m * c_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(cos(Float64(x_m * 2.0)) / x_m) tmp = 0.0 if (c_m <= 1e-94) tmp = Float64(t_0 / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(s_m * c_m)))); else tmp = Float64(Float64(t_0 / s_m) / Float64(Float64(s_m * c_m) * Float64(x_m * c_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0)) / x_m;
tmp = 0.0;
if (c_m <= 1e-94)
tmp = t_0 / ((s_m * c_m) * (x_m * (s_m * c_m)));
else
tmp = (t_0 / s_m) / ((s_m * c_m) * (x_m * c_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / x$95$m), $MachinePrecision]}, If[LessEqual[c$95$m, 1e-94], N[(t$95$0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(x\_m \cdot 2\right)}{x\_m}\\
\mathbf{if}\;c\_m \leq 10^{-94}:\\
\;\;\;\;\frac{t\_0}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if c < 9.9999999999999996e-95Initial program 65.1%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.2%
Simplified85.2%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6496.0%
Applied egg-rr96.0%
if 9.9999999999999996e-95 < c Initial program 66.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.8%
Simplified84.8%
associate-/r*N/A
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6495.1%
Applied egg-rr95.1%
Final simplification95.6%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* x_m (* s_m c_m))))
(if (<= x_m 5.2e-22)
(/ 1.0 (* t_0 t_0))
(/ (/ (cos (* x_m 2.0)) x_m) (* (* s_m c_m) t_0)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 5.2e-22) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = (cos((x_m * 2.0)) / x_m) / ((s_m * c_m) * t_0);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 5.2d-22) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = (cos((x_m * 2.0d0)) / x_m) / ((s_m * c_m) * t_0)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 5.2e-22) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = (Math.cos((x_m * 2.0)) / x_m) / ((s_m * c_m) * t_0);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 5.2e-22: tmp = 1.0 / (t_0 * t_0) else: tmp = (math.cos((x_m * 2.0)) / x_m) / ((s_m * c_m) * t_0) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 5.2e-22) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / x_m) / Float64(Float64(s_m * c_m) * t_0)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 5.2e-22)
tmp = 1.0 / (t_0 * t_0);
else
tmp = (cos((x_m * 2.0)) / x_m) / ((s_m * c_m) * t_0);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 5.2e-22], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / x$95$m), $MachinePrecision] / N[(N[(s$95$m * c$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 5.2 \cdot 10^{-22}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m}}{\left(s\_m \cdot c\_m\right) \cdot t\_0}\\
\end{array}
\end{array}
if x < 5.2e-22Initial program 67.5%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.5%
Simplified85.5%
Taylor expanded in x around 0
Simplified76.9%
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unswap-sqrN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.8%
Applied egg-rr86.8%
if 5.2e-22 < x Initial program 60.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.9%
Simplified83.9%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6495.6%
Applied egg-rr95.6%
Final simplification89.2%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* x_m (* s_m c_m))))
(if (<= x_m 2.5e-5)
(/ (+ 1.0 (* -2.0 (* x_m x_m))) (* t_0 t_0))
(/ (cos (* x_m 2.0)) (* x_m (* (* x_m c_m) (* s_m (* s_m c_m))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = cos((x_m * 2.0)) / (x_m * ((x_m * c_m) * (s_m * (s_m * c_m))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 2.5d-5) then
tmp = (1.0d0 + ((-2.0d0) * (x_m * x_m))) / (t_0 * t_0)
else
tmp = cos((x_m * 2.0d0)) / (x_m * ((x_m * c_m) * (s_m * (s_m * c_m))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = Math.cos((x_m * 2.0)) / (x_m * ((x_m * c_m) * (s_m * (s_m * c_m))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 2.5e-5: tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0) else: tmp = math.cos((x_m * 2.0)) / (x_m * ((x_m * c_m) * (s_m * (s_m * c_m)))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 2.5e-5) tmp = Float64(Float64(1.0 + Float64(-2.0 * Float64(x_m * x_m))) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(Float64(x_m * c_m) * Float64(s_m * Float64(s_m * c_m))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 2.5e-5)
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
else
tmp = cos((x_m * 2.0)) / (x_m * ((x_m * c_m) * (s_m * (s_m * c_m))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.5e-5], N[(N[(1.0 + N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;\frac{1 + -2 \cdot \left(x\_m \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot \left(\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.50000000000000012e-5Initial program 68.9%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.1%
Simplified86.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.8%
associate-/l*N/A
div-invN/A
frac-timesN/A
metadata-evalN/A
swap-sqrN/A
*-commutativeN/A
associate-*r*N/A
associate-/l/N/A
associate-*r*N/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied egg-rr76.6%
if 2.50000000000000012e-5 < x Initial program 55.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.8%
Simplified81.8%
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.9%
Applied egg-rr84.9%
Final simplification78.5%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* x_m (* s_m c_m))))
(if (<= x_m 2.5e-5)
(/ (+ 1.0 (* -2.0 (* x_m x_m))) (* t_0 t_0))
(/ (cos (* x_m 2.0)) (* s_m (* x_m (* (* s_m c_m) (* x_m c_m))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = cos((x_m * 2.0)) / (s_m * (x_m * ((s_m * c_m) * (x_m * c_m))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 2.5d-5) then
tmp = (1.0d0 + ((-2.0d0) * (x_m * x_m))) / (t_0 * t_0)
else
tmp = cos((x_m * 2.0d0)) / (s_m * (x_m * ((s_m * c_m) * (x_m * c_m))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 2.5e-5) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
} else {
tmp = Math.cos((x_m * 2.0)) / (s_m * (x_m * ((s_m * c_m) * (x_m * c_m))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 2.5e-5: tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0) else: tmp = math.cos((x_m * 2.0)) / (s_m * (x_m * ((s_m * c_m) * (x_m * c_m)))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 2.5e-5) tmp = Float64(Float64(1.0 + Float64(-2.0 * Float64(x_m * x_m))) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(s_m * Float64(x_m * Float64(Float64(s_m * c_m) * Float64(x_m * c_m))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 2.5e-5)
tmp = (1.0 + (-2.0 * (x_m * x_m))) / (t_0 * t_0);
else
tmp = cos((x_m * 2.0)) / (s_m * (x_m * ((s_m * c_m) * (x_m * c_m))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.5e-5], N[(N[(1.0 + N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(x$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 2.5 \cdot 10^{-5}:\\
\;\;\;\;\frac{1 + -2 \cdot \left(x\_m \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{s\_m \cdot \left(x\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.50000000000000012e-5Initial program 68.9%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.1%
Simplified86.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.8%
associate-/l*N/A
div-invN/A
frac-timesN/A
metadata-evalN/A
swap-sqrN/A
*-commutativeN/A
associate-*r*N/A
associate-/l/N/A
associate-*r*N/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied egg-rr76.6%
if 2.50000000000000012e-5 < x Initial program 55.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.8%
Simplified81.8%
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6484.9%
Applied egg-rr84.9%
Final simplification78.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* x_m (* s_m c_m))) (t_1 (* t_0 t_0))) (if (<= x_m 8.5e+67) (/ (+ 1.0 (* -2.0 (* x_m x_m))) t_1) (/ 1.0 t_1))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double t_1 = t_0 * t_0;
double tmp;
if (x_m <= 8.5e+67) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / t_1;
} else {
tmp = 1.0 / t_1;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
t_1 = t_0 * t_0
if (x_m <= 8.5d+67) then
tmp = (1.0d0 + ((-2.0d0) * (x_m * x_m))) / t_1
else
tmp = 1.0d0 / t_1
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double t_1 = t_0 * t_0;
double tmp;
if (x_m <= 8.5e+67) {
tmp = (1.0 + (-2.0 * (x_m * x_m))) / t_1;
} else {
tmp = 1.0 / t_1;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) t_1 = t_0 * t_0 tmp = 0 if x_m <= 8.5e+67: tmp = (1.0 + (-2.0 * (x_m * x_m))) / t_1 else: tmp = 1.0 / t_1 return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) t_1 = Float64(t_0 * t_0) tmp = 0.0 if (x_m <= 8.5e+67) tmp = Float64(Float64(1.0 + Float64(-2.0 * Float64(x_m * x_m))) / t_1); else tmp = Float64(1.0 / t_1); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
t_1 = t_0 * t_0;
tmp = 0.0;
if (x_m <= 8.5e+67)
tmp = (1.0 + (-2.0 * (x_m * x_m))) / t_1;
else
tmp = 1.0 / t_1;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, If[LessEqual[x$95$m, 8.5e+67], N[(N[(1.0 + N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(1.0 / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
t_1 := t\_0 \cdot t\_0\\
\mathbf{if}\;x\_m \leq 8.5 \cdot 10^{+67}:\\
\;\;\;\;\frac{1 + -2 \cdot \left(x\_m \cdot x\_m\right)}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_1}\\
\end{array}
\end{array}
if x < 8.50000000000000038e67Initial program 69.2%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.6%
Simplified86.6%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.2%
associate-/l*N/A
div-invN/A
frac-timesN/A
metadata-evalN/A
swap-sqrN/A
*-commutativeN/A
associate-*r*N/A
associate-/l/N/A
associate-*r*N/A
un-div-invN/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
Applied egg-rr74.1%
if 8.50000000000000038e67 < x Initial program 49.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.1%
Simplified78.1%
Taylor expanded in x around 0
Simplified65.4%
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unswap-sqrN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.5%
Applied egg-rr67.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= c_m 2.2e-94) (/ 1.0 (* x_m (* x_m (* s_m (* c_m (* s_m c_m)))))) (/ 1.0 (* x_m (* s_m (* s_m (* x_m (* c_m c_m))))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 2.2e-94) {
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
} else {
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (c_m <= 2.2d-94) then
tmp = 1.0d0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))))
else
tmp = 1.0d0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 2.2e-94) {
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
} else {
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if c_m <= 2.2e-94: tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m))))) else: tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (c_m <= 2.2e-94) tmp = Float64(1.0 / Float64(x_m * Float64(x_m * Float64(s_m * Float64(c_m * Float64(s_m * c_m)))))); else tmp = Float64(1.0 / Float64(x_m * Float64(s_m * Float64(s_m * Float64(x_m * Float64(c_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (c_m <= 2.2e-94)
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
else
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[c$95$m, 2.2e-94], N[(1.0 / N[(x$95$m * N[(x$95$m * N[(s$95$m * N[(c$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(s$95$m * N[(s$95$m * N[(x$95$m * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 2.2 \cdot 10^{-94}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(x\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if c < 2.20000000000000001e-94Initial program 65.1%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.2%
Simplified85.2%
Taylor expanded in x around 0
Simplified72.7%
if 2.20000000000000001e-94 < c Initial program 66.6%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.8%
Simplified84.8%
Taylor expanded in x around 0
Simplified71.1%
Taylor expanded in x around 0
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.0%
Simplified69.0%
Final simplification71.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= c_m 3.4e-149) (/ 1.0 (* c_m (* c_m (* s_m (* (* x_m x_m) s_m))))) (/ 1.0 (* x_m (* s_m (* s_m (* x_m (* c_m c_m))))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 3.4e-149) {
tmp = 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
} else {
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (c_m <= 3.4d-149) then
tmp = 1.0d0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))))
else
tmp = 1.0d0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 3.4e-149) {
tmp = 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
} else {
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if c_m <= 3.4e-149: tmp = 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m)))) else: tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (c_m <= 3.4e-149) tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(s_m * Float64(Float64(x_m * x_m) * s_m))))); else tmp = Float64(1.0 / Float64(x_m * Float64(s_m * Float64(s_m * Float64(x_m * Float64(c_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (c_m <= 3.4e-149)
tmp = 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
else
tmp = 1.0 / (x_m * (s_m * (s_m * (x_m * (c_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[c$95$m, 3.4e-149], N[(1.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * N[(N[(x$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(s$95$m * N[(s$95$m * N[(x$95$m * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 3.4 \cdot 10^{-149}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(\left(x\_m \cdot x\_m\right) \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if c < 3.3999999999999999e-149Initial program 65.0%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.3%
Simplified85.3%
Taylor expanded in x around 0
Simplified72.8%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6464.0%
Simplified64.0%
if 3.3999999999999999e-149 < c Initial program 66.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.8%
Simplified84.8%
Taylor expanded in x around 0
Simplified70.9%
Taylor expanded in x around 0
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6468.2%
Simplified68.2%
Final simplification65.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 1.45e+20) (/ (/ 2.0 s_m) (* s_m (* c_m (- 0.0 c_m)))) (/ -2.0 (* c_m (* c_m (* s_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.45e+20) {
tmp = (2.0 / s_m) / (s_m * (c_m * (0.0 - c_m)));
} else {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 1.45d+20) then
tmp = (2.0d0 / s_m) / (s_m * (c_m * (0.0d0 - c_m)))
else
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.45e+20) {
tmp = (2.0 / s_m) / (s_m * (c_m * (0.0 - c_m)));
} else {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 1.45e+20: tmp = (2.0 / s_m) / (s_m * (c_m * (0.0 - c_m))) else: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 1.45e+20) tmp = Float64(Float64(2.0 / s_m) / Float64(s_m * Float64(c_m * Float64(0.0 - c_m)))); else tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 1.45e+20)
tmp = (2.0 / s_m) / (s_m * (c_m * (0.0 - c_m)));
else
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 1.45e+20], N[(N[(2.0 / s$95$m), $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(0.0 - c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 1.45 \cdot 10^{+20}:\\
\;\;\;\;\frac{\frac{2}{s\_m}}{s\_m \cdot \left(c\_m \cdot \left(0 - c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.45e20Initial program 68.8%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.3%
Simplified86.3%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.1%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6422.7%
Simplified22.7%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.2%
Applied egg-rr25.2%
associate-/r*N/A
associate-*r*N/A
associate-/l/N/A
div-invN/A
*-commutativeN/A
associate-*r/N/A
associate-/l/N/A
frac-2negN/A
distribute-rgt-neg-outN/A
/-lowering-/.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6436.9%
Applied egg-rr36.9%
if 1.45e20 < x Initial program 55.0%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.9%
Simplified80.9%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified17.8%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6433.2%
Simplified33.2%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.0%
Applied egg-rr38.0%
Final simplification26.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* s_m s_m)))) (if (<= x_m 1.45e+20) (/ 2.0 (* t_0 (- 0.0 c_m))) (/ -2.0 (* c_m t_0)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * s_m);
double tmp;
if (x_m <= 1.45e+20) {
tmp = 2.0 / (t_0 * (0.0 - c_m));
} else {
tmp = -2.0 / (c_m * t_0);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (s_m * s_m)
if (x_m <= 1.45d+20) then
tmp = 2.0d0 / (t_0 * (0.0d0 - c_m))
else
tmp = (-2.0d0) / (c_m * t_0)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * s_m);
double tmp;
if (x_m <= 1.45e+20) {
tmp = 2.0 / (t_0 * (0.0 - c_m));
} else {
tmp = -2.0 / (c_m * t_0);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (s_m * s_m) tmp = 0 if x_m <= 1.45e+20: tmp = 2.0 / (t_0 * (0.0 - c_m)) else: tmp = -2.0 / (c_m * t_0) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(s_m * s_m)) tmp = 0.0 if (x_m <= 1.45e+20) tmp = Float64(2.0 / Float64(t_0 * Float64(0.0 - c_m))); else tmp = Float64(-2.0 / Float64(c_m * t_0)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (s_m * s_m);
tmp = 0.0;
if (x_m <= 1.45e+20)
tmp = 2.0 / (t_0 * (0.0 - c_m));
else
tmp = -2.0 / (c_m * t_0);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.45e+20], N[(2.0 / N[(t$95$0 * N[(0.0 - c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[(c$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(s\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.45 \cdot 10^{+20}:\\
\;\;\;\;\frac{2}{t\_0 \cdot \left(0 - c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{c\_m \cdot t\_0}\\
\end{array}
\end{array}
if x < 1.45e20Initial program 68.8%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.3%
Simplified86.3%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified49.1%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6422.7%
Simplified22.7%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
frac-2negN/A
metadata-evalN/A
sub0-negN/A
metadata-evalN/A
/-lowering-/.f64N/A
metadata-evalN/A
--lowering--.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6447.9%
Applied egg-rr47.9%
if 1.45e20 < x Initial program 55.0%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.9%
Simplified80.9%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified17.8%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6433.2%
Simplified33.2%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6438.0%
Applied egg-rr38.0%
Final simplification28.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 4.8e-18) (/ 2.0 (* (* s_m c_m) (* s_m (- 0.0 c_m)))) (/ -2.0 (* c_m (* c_m (* s_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 4.8e-18) {
tmp = 2.0 / ((s_m * c_m) * (s_m * (0.0 - c_m)));
} else {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 4.8d-18) then
tmp = 2.0d0 / ((s_m * c_m) * (s_m * (0.0d0 - c_m)))
else
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 4.8e-18) {
tmp = 2.0 / ((s_m * c_m) * (s_m * (0.0 - c_m)));
} else {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 4.8e-18: tmp = 2.0 / ((s_m * c_m) * (s_m * (0.0 - c_m))) else: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 4.8e-18) tmp = Float64(2.0 / Float64(Float64(s_m * c_m) * Float64(s_m * Float64(0.0 - c_m)))); else tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 4.8e-18)
tmp = 2.0 / ((s_m * c_m) * (s_m * (0.0 - c_m)));
else
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 4.8e-18], N[(2.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(0.0 - c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 4.8 \cdot 10^{-18}:\\
\;\;\;\;\frac{2}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(0 - c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\end{array}
\end{array}
if x < 4.79999999999999988e-18Initial program 67.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.6%
Simplified85.6%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified47.9%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6423.3%
Simplified23.3%
div-invN/A
frac-2negN/A
metadata-evalN/A
*-commutativeN/A
*-commutativeN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sub0-negN/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6426.4%
Applied egg-rr26.4%
if 4.79999999999999988e-18 < x Initial program 60.1%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.6%
Simplified83.6%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified25.5%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6430.1%
Simplified30.1%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.1%
Applied egg-rr34.1%
Final simplification26.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* x_m (* s_m c_m)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = x_m * (s_m * c_m)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 65.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.1%
Simplified85.1%
Taylor expanded in x around 0
Simplified72.0%
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unswap-sqrN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.7%
Applied egg-rr79.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* x_m (* c_m (* (* s_m c_m) (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (c_m * ((s_m * c_m) * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (x_m * (c_m * ((s_m * c_m) * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (c_m * ((s_m * c_m) * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (x_m * (c_m * ((s_m * c_m) * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(x_m * Float64(c_m * Float64(Float64(s_m * c_m) * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (x_m * (c_m * ((s_m * c_m) * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(x$95$m * N[(c$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{x\_m \cdot \left(c\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 65.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.1%
Simplified85.1%
Taylor expanded in x around 0
Simplified72.0%
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.1%
Applied egg-rr75.1%
Final simplification75.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* c_m (* c_m (* s_m (* (* x_m x_m) s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(c_m * Float64(s_m * Float64(Float64(x_m * x_m) * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * (c_m * (s_m * ((x_m * x_m) * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * N[(N[(x$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(\left(x\_m \cdot x\_m\right) \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 65.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.1%
Simplified85.1%
Taylor expanded in x around 0
Simplified72.0%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6464.9%
Simplified64.9%
Final simplification64.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ -2.0 (* c_m (* c_m (* s_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / (c_m * (c_m * (s_m * s_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 65.7%
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.1%
Simplified85.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified42.0%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.1%
Simplified25.1%
associate-/l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.1%
Applied egg-rr28.1%
herbie shell --seed 2024158
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))