
(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 13 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}
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))))
(if (<= (pow c_m 2.0) 4e+26)
(/ t_0 (pow (* x (* c_m s_m)) 2.0))
(/ (/ t_0 (* c_m (* c_m x))) (* s_m (* x s_m))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double tmp;
if (pow(c_m, 2.0) <= 4e+26) {
tmp = t_0 / pow((x * (c_m * s_m)), 2.0);
} else {
tmp = (t_0 / (c_m * (c_m * x))) / (s_m * (x * s_m));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((2.0d0 * x))
if ((c_m ** 2.0d0) <= 4d+26) then
tmp = t_0 / ((x * (c_m * s_m)) ** 2.0d0)
else
tmp = (t_0 / (c_m * (c_m * x))) / (s_m * (x * s_m))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((2.0 * x));
double tmp;
if (Math.pow(c_m, 2.0) <= 4e+26) {
tmp = t_0 / Math.pow((x * (c_m * s_m)), 2.0);
} else {
tmp = (t_0 / (c_m * (c_m * x))) / (s_m * (x * s_m));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) tmp = 0 if math.pow(c_m, 2.0) <= 4e+26: tmp = t_0 / math.pow((x * (c_m * s_m)), 2.0) else: tmp = (t_0 / (c_m * (c_m * x))) / (s_m * (x * s_m)) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) tmp = 0.0 if ((c_m ^ 2.0) <= 4e+26) tmp = Float64(t_0 / (Float64(x * Float64(c_m * s_m)) ^ 2.0)); else tmp = Float64(Float64(t_0 / Float64(c_m * Float64(c_m * x))) / Float64(s_m * Float64(x * s_m))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
tmp = 0.0;
if ((c_m ^ 2.0) <= 4e+26)
tmp = t_0 / ((x * (c_m * s_m)) ^ 2.0);
else
tmp = (t_0 / (c_m * (c_m * x))) / (s_m * (x * s_m));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Power[c$95$m, 2.0], $MachinePrecision], 4e+26], N[(t$95$0 / N[Power[N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / N[(c$95$m * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
\mathbf{if}\;{c\_m}^{2} \leq 4 \cdot 10^{+26}:\\
\;\;\;\;\frac{t\_0}{{\left(x \cdot \left(c\_m \cdot s\_m\right)\right)}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m \cdot \left(c\_m \cdot x\right)}}{s\_m \cdot \left(x \cdot s\_m\right)}\\
\end{array}
\end{array}
if (pow.f64 c #s(literal 2 binary64)) < 4.00000000000000019e26Initial program 67.9%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.9%
Applied egg-rr97.9%
if 4.00000000000000019e26 < (pow.f64 c #s(literal 2 binary64)) Initial program 62.2%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.4%
Applied egg-rr94.4%
*-rgt-identityN/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
times-fracN/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
associate-*l*N/A
times-fracN/A
div-invN/A
/-lowering-/.f64N/A
Applied egg-rr80.5%
Final simplification90.4%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))) (t_1 (/ (/ (/ 1.0 s_m) c_m) x)))
(if (<= x 5.8e-13)
(* t_1 t_1)
(if (<= x 7e+170)
(/ t_0 (* s_m (* c_m (* x (* x (* c_m s_m))))))
(/ (/ t_0 s_m) (* s_m (* (* c_m x) (* c_m x))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 7e+170) {
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))));
} else {
tmp = (t_0 / s_m) / (s_m * ((c_m * x) * (c_m * x)));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
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 = cos((2.0d0 * x))
t_1 = ((1.0d0 / s_m) / c_m) / x
if (x <= 5.8d-13) then
tmp = t_1 * t_1
else if (x <= 7d+170) then
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))))
else
tmp = (t_0 / s_m) / (s_m * ((c_m * x) * (c_m * x)))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 7e+170) {
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))));
} else {
tmp = (t_0 / s_m) / (s_m * ((c_m * x) * (c_m * x)));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) t_1 = ((1.0 / s_m) / c_m) / x tmp = 0 if x <= 5.8e-13: tmp = t_1 * t_1 elif x <= 7e+170: tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m))))) else: tmp = (t_0 / s_m) / (s_m * ((c_m * x) * (c_m * x))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) tmp = 0.0 if (x <= 5.8e-13) tmp = Float64(t_1 * t_1); elseif (x <= 7e+170) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); else tmp = Float64(Float64(t_0 / s_m) / Float64(s_m * Float64(Float64(c_m * x) * Float64(c_m * x)))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
t_1 = ((1.0 / s_m) / c_m) / x;
tmp = 0.0;
if (x <= 5.8e-13)
tmp = t_1 * t_1;
elseif (x <= 7e+170)
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))));
else
tmp = (t_0 / s_m) / (s_m * ((c_m * x) * (c_m * x)));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, 5.8e-13], N[(t$95$1 * t$95$1), $MachinePrecision], If[LessEqual[x, 7e+170], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(s$95$m * N[(N[(c$95$m * x), $MachinePrecision] * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
\mathbf{if}\;x \leq 5.8 \cdot 10^{-13}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{elif}\;x \leq 7 \cdot 10^{+170}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{s\_m \cdot \left(\left(c\_m \cdot x\right) \cdot \left(c\_m \cdot x\right)\right)}\\
\end{array}
\end{array}
if x < 5.7999999999999995e-13Initial program 68.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5%
Simplified71.5%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.9%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.7%
if 5.7999999999999995e-13 < x < 7.00000000000000011e170Initial program 63.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6480.9%
Simplified80.9%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.0%
Applied egg-rr81.0%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr92.9%
if 7.00000000000000011e170 < x Initial program 52.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.4%
Applied egg-rr96.4%
*-rgt-identityN/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
times-fracN/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
associate-*l*N/A
associate-*l*N/A
times-fracN/A
div-invN/A
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr84.0%
associate-*r*N/A
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
*-lowering-*.f6477.0%
Applied egg-rr77.0%
Final simplification83.7%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x)))
(t_1 (/ (/ (/ 1.0 s_m) c_m) x))
(t_2 (* x (* c_m s_m))))
(if (<= x 5.8e-13)
(* t_1 t_1)
(if (<= x 5e+167)
(/ t_0 (* s_m (* c_m (* x t_2))))
(/ (/ t_0 s_m) (* x (* c_m t_2)))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double t_2 = x * (c_m * s_m);
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 5e+167) {
tmp = t_0 / (s_m * (c_m * (x * t_2)));
} else {
tmp = (t_0 / s_m) / (x * (c_m * t_2));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = cos((2.0d0 * x))
t_1 = ((1.0d0 / s_m) / c_m) / x
t_2 = x * (c_m * s_m)
if (x <= 5.8d-13) then
tmp = t_1 * t_1
else if (x <= 5d+167) then
tmp = t_0 / (s_m * (c_m * (x * t_2)))
else
tmp = (t_0 / s_m) / (x * (c_m * t_2))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double t_2 = x * (c_m * s_m);
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 5e+167) {
tmp = t_0 / (s_m * (c_m * (x * t_2)));
} else {
tmp = (t_0 / s_m) / (x * (c_m * t_2));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) t_1 = ((1.0 / s_m) / c_m) / x t_2 = x * (c_m * s_m) tmp = 0 if x <= 5.8e-13: tmp = t_1 * t_1 elif x <= 5e+167: tmp = t_0 / (s_m * (c_m * (x * t_2))) else: tmp = (t_0 / s_m) / (x * (c_m * t_2)) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) t_2 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (x <= 5.8e-13) tmp = Float64(t_1 * t_1); elseif (x <= 5e+167) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(x * t_2)))); else tmp = Float64(Float64(t_0 / s_m) / Float64(x * Float64(c_m * t_2))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
t_1 = ((1.0 / s_m) / c_m) / x;
t_2 = x * (c_m * s_m);
tmp = 0.0;
if (x <= 5.8e-13)
tmp = t_1 * t_1;
elseif (x <= 5e+167)
tmp = t_0 / (s_m * (c_m * (x * t_2)));
else
tmp = (t_0 / s_m) / (x * (c_m * t_2));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 5.8e-13], N[(t$95$1 * t$95$1), $MachinePrecision], If[LessEqual[x, 5e+167], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(x * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(x * N[(c$95$m * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
t_2 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;x \leq 5.8 \cdot 10^{-13}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{elif}\;x \leq 5 \cdot 10^{+167}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(x \cdot t\_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{x \cdot \left(c\_m \cdot t\_2\right)}\\
\end{array}
\end{array}
if x < 5.7999999999999995e-13Initial program 68.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5%
Simplified71.5%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.9%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.7%
if 5.7999999999999995e-13 < x < 4.9999999999999997e167Initial program 66.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6482.4%
Simplified82.4%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.9%
Applied egg-rr84.9%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr95.0%
if 4.9999999999999997e167 < x Initial program 49.3%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.6%
Applied egg-rr96.6%
*-rgt-identityN/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
times-fracN/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
associate-*l*N/A
associate-*l*N/A
times-fracN/A
div-invN/A
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr81.8%
Final simplification84.5%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x)))
(t_1 (/ (/ (/ 1.0 s_m) c_m) x))
(t_2 (* x (* c_m s_m))))
(if (<= x 5.8e-13)
(* t_1 t_1)
(if (<= x 1.05e+169)
(/ t_0 (* s_m (* c_m (* x t_2))))
(/ t_0 (* s_m (* x (* c_m t_2))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double t_2 = x * (c_m * s_m);
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 1.05e+169) {
tmp = t_0 / (s_m * (c_m * (x * t_2)));
} else {
tmp = t_0 / (s_m * (x * (c_m * t_2)));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = cos((2.0d0 * x))
t_1 = ((1.0d0 / s_m) / c_m) / x
t_2 = x * (c_m * s_m)
if (x <= 5.8d-13) then
tmp = t_1 * t_1
else if (x <= 1.05d+169) then
tmp = t_0 / (s_m * (c_m * (x * t_2)))
else
tmp = t_0 / (s_m * (x * (c_m * t_2)))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double t_2 = x * (c_m * s_m);
double tmp;
if (x <= 5.8e-13) {
tmp = t_1 * t_1;
} else if (x <= 1.05e+169) {
tmp = t_0 / (s_m * (c_m * (x * t_2)));
} else {
tmp = t_0 / (s_m * (x * (c_m * t_2)));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) t_1 = ((1.0 / s_m) / c_m) / x t_2 = x * (c_m * s_m) tmp = 0 if x <= 5.8e-13: tmp = t_1 * t_1 elif x <= 1.05e+169: tmp = t_0 / (s_m * (c_m * (x * t_2))) else: tmp = t_0 / (s_m * (x * (c_m * t_2))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) t_2 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (x <= 5.8e-13) tmp = Float64(t_1 * t_1); elseif (x <= 1.05e+169) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(x * t_2)))); else tmp = Float64(t_0 / Float64(s_m * Float64(x * Float64(c_m * t_2)))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
t_1 = ((1.0 / s_m) / c_m) / x;
t_2 = x * (c_m * s_m);
tmp = 0.0;
if (x <= 5.8e-13)
tmp = t_1 * t_1;
elseif (x <= 1.05e+169)
tmp = t_0 / (s_m * (c_m * (x * t_2)));
else
tmp = t_0 / (s_m * (x * (c_m * t_2)));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 5.8e-13], N[(t$95$1 * t$95$1), $MachinePrecision], If[LessEqual[x, 1.05e+169], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(x * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(x * N[(c$95$m * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
t_2 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;x \leq 5.8 \cdot 10^{-13}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{elif}\;x \leq 1.05 \cdot 10^{+169}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(x \cdot t\_2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(x \cdot \left(c\_m \cdot t\_2\right)\right)}\\
\end{array}
\end{array}
if x < 5.7999999999999995e-13Initial program 68.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5%
Simplified71.5%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.9%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.7%
if 5.7999999999999995e-13 < x < 1.0500000000000001e169Initial program 66.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6482.4%
Simplified82.4%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.9%
Applied egg-rr84.9%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr95.0%
if 1.0500000000000001e169 < x Initial program 49.3%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.6%
Applied egg-rr96.6%
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.9%
Applied egg-rr81.9%
Final simplification84.5%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))) (t_1 (/ (/ (/ 1.0 s_m) c_m) x)))
(if (<= x 2.85e-34)
(* t_1 t_1)
(if (<= x 3.2e+197)
(/ t_0 (* x (* x (* c_m (* s_m (* c_m s_m))))))
(/ t_0 (* (* c_m x) (* c_m (* s_m (* x s_m)))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 2.85e-34) {
tmp = t_1 * t_1;
} else if (x <= 3.2e+197) {
tmp = t_0 / (x * (x * (c_m * (s_m * (c_m * s_m)))));
} else {
tmp = t_0 / ((c_m * x) * (c_m * (s_m * (x * s_m))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
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 = cos((2.0d0 * x))
t_1 = ((1.0d0 / s_m) / c_m) / x
if (x <= 2.85d-34) then
tmp = t_1 * t_1
else if (x <= 3.2d+197) then
tmp = t_0 / (x * (x * (c_m * (s_m * (c_m * s_m)))))
else
tmp = t_0 / ((c_m * x) * (c_m * (s_m * (x * s_m))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((2.0 * x));
double t_1 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 2.85e-34) {
tmp = t_1 * t_1;
} else if (x <= 3.2e+197) {
tmp = t_0 / (x * (x * (c_m * (s_m * (c_m * s_m)))));
} else {
tmp = t_0 / ((c_m * x) * (c_m * (s_m * (x * s_m))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) t_1 = ((1.0 / s_m) / c_m) / x tmp = 0 if x <= 2.85e-34: tmp = t_1 * t_1 elif x <= 3.2e+197: tmp = t_0 / (x * (x * (c_m * (s_m * (c_m * s_m))))) else: tmp = t_0 / ((c_m * x) * (c_m * (s_m * (x * s_m)))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) tmp = 0.0 if (x <= 2.85e-34) tmp = Float64(t_1 * t_1); elseif (x <= 3.2e+197) tmp = Float64(t_0 / Float64(x * Float64(x * Float64(c_m * Float64(s_m * Float64(c_m * s_m)))))); else tmp = Float64(t_0 / Float64(Float64(c_m * x) * Float64(c_m * Float64(s_m * Float64(x * s_m))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
t_1 = ((1.0 / s_m) / c_m) / x;
tmp = 0.0;
if (x <= 2.85e-34)
tmp = t_1 * t_1;
elseif (x <= 3.2e+197)
tmp = t_0 / (x * (x * (c_m * (s_m * (c_m * s_m)))));
else
tmp = t_0 / ((c_m * x) * (c_m * (s_m * (x * s_m))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, 2.85e-34], N[(t$95$1 * t$95$1), $MachinePrecision], If[LessEqual[x, 3.2e+197], N[(t$95$0 / N[(x * N[(x * N[(c$95$m * N[(s$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(c$95$m * x), $MachinePrecision] * N[(c$95$m * N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
\mathbf{if}\;x \leq 2.85 \cdot 10^{-34}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{elif}\;x \leq 3.2 \cdot 10^{+197}:\\
\;\;\;\;\frac{t\_0}{x \cdot \left(x \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(c\_m \cdot x\right) \cdot \left(c\_m \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.84999999999999987e-34Initial program 67.5%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.6%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.4%
if 2.84999999999999987e-34 < x < 3.1999999999999998e197Initial program 64.9%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.0%
Simplified84.0%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.1%
Applied egg-rr84.1%
if 3.1999999999999998e197 < x Initial program 50.9%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6495.9%
Applied egg-rr95.9%
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6488.1%
Applied egg-rr88.1%
Final simplification83.3%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (/ (/ (/ 1.0 s_m) c_m) x)))
(if (<= x 4.2e-13)
(* t_0 t_0)
(/ (cos (* 2.0 x)) (* s_m (* c_m (* x (* x (* c_m s_m)))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 4.2e-13) {
tmp = t_0 * t_0;
} else {
tmp = cos((2.0 * x)) / (s_m * (c_m * (x * (x * (c_m * s_m)))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = ((1.0d0 / s_m) / c_m) / x
if (x <= 4.2d-13) then
tmp = t_0 * t_0
else
tmp = cos((2.0d0 * x)) / (s_m * (c_m * (x * (x * (c_m * s_m)))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 4.2e-13) {
tmp = t_0 * t_0;
} else {
tmp = Math.cos((2.0 * x)) / (s_m * (c_m * (x * (x * (c_m * s_m)))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = ((1.0 / s_m) / c_m) / x tmp = 0 if x <= 4.2e-13: tmp = t_0 * t_0 else: tmp = math.cos((2.0 * x)) / (s_m * (c_m * (x * (x * (c_m * s_m))))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) tmp = 0.0 if (x <= 4.2e-13) tmp = Float64(t_0 * t_0); else tmp = Float64(cos(Float64(2.0 * x)) / Float64(s_m * Float64(c_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = ((1.0 / s_m) / c_m) / x;
tmp = 0.0;
if (x <= 4.2e-13)
tmp = t_0 * t_0;
else
tmp = cos((2.0 * x)) / (s_m * (c_m * (x * (x * (c_m * s_m)))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, 4.2e-13], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
\mathbf{if}\;x \leq 4.2 \cdot 10^{-13}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 4.19999999999999977e-13Initial program 68.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5%
Simplified71.5%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.9%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.7%
if 4.19999999999999977e-13 < x Initial program 58.7%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6478.8%
Simplified78.8%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.8%
Applied egg-rr78.8%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr87.9%
Final simplification84.1%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (/ (/ (/ 1.0 s_m) c_m) x)))
(if (<= x 5.2e-34)
(* t_0 t_0)
(/ (cos (* 2.0 x)) (* x (* x (* c_m (* s_m (* c_m s_m)))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 5.2e-34) {
tmp = t_0 * t_0;
} else {
tmp = cos((2.0 * x)) / (x * (x * (c_m * (s_m * (c_m * s_m)))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = ((1.0d0 / s_m) / c_m) / x
if (x <= 5.2d-34) then
tmp = t_0 * t_0
else
tmp = cos((2.0d0 * x)) / (x * (x * (c_m * (s_m * (c_m * s_m)))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 5.2e-34) {
tmp = t_0 * t_0;
} else {
tmp = Math.cos((2.0 * x)) / (x * (x * (c_m * (s_m * (c_m * s_m)))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = ((1.0 / s_m) / c_m) / x tmp = 0 if x <= 5.2e-34: tmp = t_0 * t_0 else: tmp = math.cos((2.0 * x)) / (x * (x * (c_m * (s_m * (c_m * s_m))))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) tmp = 0.0 if (x <= 5.2e-34) tmp = Float64(t_0 * t_0); else tmp = Float64(cos(Float64(2.0 * x)) / Float64(x * Float64(x * Float64(c_m * Float64(s_m * Float64(c_m * s_m)))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = ((1.0 / s_m) / c_m) / x;
tmp = 0.0;
if (x <= 5.2e-34)
tmp = t_0 * t_0;
else
tmp = cos((2.0 * x)) / (x * (x * (c_m * (s_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, 5.2e-34], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(x * N[(x * N[(c$95$m * N[(s$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
\mathbf{if}\;x \leq 5.2 \cdot 10^{-34}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{x \cdot \left(x \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 5.1999999999999999e-34Initial program 67.5%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.1%
Simplified71.1%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.6%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.4%
if 5.1999999999999999e-34 < x Initial program 60.3%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6479.6%
Simplified79.6%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.6%
Applied egg-rr79.6%
Final simplification81.6%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (/ (/ (/ 1.0 s_m) c_m) x)))
(if (<= x 2.1e-13)
(* t_0 t_0)
(/ (cos (* 2.0 x)) (* x (* x (* s_m (* c_m (* c_m s_m)))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 2.1e-13) {
tmp = t_0 * t_0;
} else {
tmp = cos((2.0 * x)) / (x * (x * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = ((1.0d0 / s_m) / c_m) / x
if (x <= 2.1d-13) then
tmp = t_0 * t_0
else
tmp = cos((2.0d0 * x)) / (x * (x * (s_m * (c_m * (c_m * s_m)))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = ((1.0 / s_m) / c_m) / x;
double tmp;
if (x <= 2.1e-13) {
tmp = t_0 * t_0;
} else {
tmp = Math.cos((2.0 * x)) / (x * (x * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = ((1.0 / s_m) / c_m) / x tmp = 0 if x <= 2.1e-13: tmp = t_0 * t_0 else: tmp = math.cos((2.0 * x)) / (x * (x * (s_m * (c_m * (c_m * s_m))))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(Float64(Float64(1.0 / s_m) / c_m) / x) tmp = 0.0 if (x <= 2.1e-13) tmp = Float64(t_0 * t_0); else tmp = Float64(cos(Float64(2.0 * x)) / Float64(x * Float64(x * Float64(s_m * Float64(c_m * Float64(c_m * s_m)))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = ((1.0 / s_m) / c_m) / x;
tmp = 0.0;
if (x <= 2.1e-13)
tmp = t_0 * t_0;
else
tmp = cos((2.0 * x)) / (x * (x * (s_m * (c_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / x), $MachinePrecision]}, If[LessEqual[x, 2.1e-13], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(x * N[(x * N[(s$95$m * N[(c$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{\frac{1}{s\_m}}{c\_m}}{x}\\
\mathbf{if}\;x \leq 2.1 \cdot 10^{-13}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{x \cdot \left(x \cdot \left(s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.09999999999999989e-13Initial program 68.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5%
Simplified71.5%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr78.9%
associate-*r*N/A
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
*-lowering-*.f6473.5%
Applied egg-rr73.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-/l/N/A
associate-/l/N/A
div-invN/A
frac-timesN/A
associate-*l/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr82.7%
if 2.09999999999999989e-13 < x Initial program 58.7%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6478.8%
Simplified78.8%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* x (* c_m s_m))))
(if (<= c_m 5e+21)
(/ (/ 1.0 t_0) t_0)
(/ (/ (/ 1.0 (* c_m (* c_m x))) (* x s_m)) s_m))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if (c_m <= 5e+21) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = ((1.0 / (c_m * (c_m * x))) / (x * s_m)) / s_m;
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x * (c_m * s_m)
if (c_m <= 5d+21) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = ((1.0d0 / (c_m * (c_m * x))) / (x * s_m)) / s_m
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if (c_m <= 5e+21) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = ((1.0 / (c_m * (c_m * x))) / (x * s_m)) / s_m;
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) tmp = 0 if c_m <= 5e+21: tmp = (1.0 / t_0) / t_0 else: tmp = ((1.0 / (c_m * (c_m * x))) / (x * s_m)) / s_m return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (c_m <= 5e+21) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(Float64(Float64(1.0 / Float64(c_m * Float64(c_m * x))) / Float64(x * s_m)) / s_m); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = 0.0;
if (c_m <= 5e+21)
tmp = (1.0 / t_0) / t_0;
else
tmp = ((1.0 / (c_m * (c_m * x))) / (x * s_m)) / s_m;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 5e+21], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 / N[(c$95$m * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 5 \cdot 10^{+21}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{c\_m \cdot \left(c\_m \cdot x\right)}}{x \cdot s\_m}}{s\_m}\\
\end{array}
\end{array}
if c < 5e21Initial program 66.4%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6464.0%
Simplified64.0%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.3%
Applied egg-rr72.3%
if 5e21 < c Initial program 61.7%
associate-/r*N/A
associate-/l/N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr73.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6478.0%
Simplified78.0%
Final simplification73.4%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* x (* c_m s_m))))
(if (<= c_m 2e+22)
(/ (/ 1.0 t_0) t_0)
(/ (/ 1.0 (* x (* c_m (* c_m (* x s_m))))) s_m))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if (c_m <= 2e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x * (c_m * s_m)
if (c_m <= 2d+22) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = (1.0d0 / (x * (c_m * (c_m * (x * s_m))))) / s_m
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if (c_m <= 2e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) tmp = 0 if c_m <= 2e+22: tmp = (1.0 / t_0) / t_0 else: tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (c_m <= 2e+22) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(Float64(1.0 / Float64(x * Float64(c_m * Float64(c_m * Float64(x * s_m))))) / s_m); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = 0.0;
if (c_m <= 2e+22)
tmp = (1.0 / t_0) / t_0;
else
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 2e+22], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / N[(x * N[(c$95$m * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 2 \cdot 10^{+22}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)\right)}}{s\_m}\\
\end{array}
\end{array}
if c < 2e22Initial program 66.4%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6464.0%
Simplified64.0%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.3%
Applied egg-rr72.3%
if 2e22 < c Initial program 61.7%
associate-/r*N/A
associate-/l/N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr73.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6477.8%
Simplified77.8%
Final simplification73.4%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (if (<= c_m 0.055) (/ 1.0 (* c_m (* (* x (* c_m s_m)) (* x s_m)))) (/ (/ 1.0 (* x (* c_m (* c_m (* x s_m))))) s_m)))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (c_m <= 0.055) {
tmp = 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
} else {
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (c_m <= 0.055d0) then
tmp = 1.0d0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)))
else
tmp = (1.0d0 / (x * (c_m * (c_m * (x * s_m))))) / s_m
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (c_m <= 0.055) {
tmp = 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
} else {
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if c_m <= 0.055: tmp = 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m))) else: tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (c_m <= 0.055) tmp = Float64(1.0 / Float64(c_m * Float64(Float64(x * Float64(c_m * s_m)) * Float64(x * s_m)))); else tmp = Float64(Float64(1.0 / Float64(x * Float64(c_m * Float64(c_m * Float64(x * s_m))))) / s_m); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if (c_m <= 0.055)
tmp = 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
else
tmp = (1.0 / (x * (c_m * (c_m * (x * s_m))))) / s_m;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[c$95$m, 0.055], N[(1.0 / N[(c$95$m * N[(N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x * N[(c$95$m * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 0.055:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(\left(x \cdot \left(c\_m \cdot s\_m\right)\right) \cdot \left(x \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)\right)}}{s\_m}\\
\end{array}
\end{array}
if c < 0.0550000000000000003Initial program 66.1%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6464.0%
Simplified64.0%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr69.8%
associate-*r*N/A
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
*-lowering-*.f6464.5%
Applied egg-rr64.5%
*-commutativeN/A
associate-*l*N/A
swap-sqrN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6470.7%
Applied egg-rr70.7%
if 0.0550000000000000003 < c Initial program 63.1%
associate-/r*N/A
associate-/l/N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr74.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6477.1%
Simplified77.1%
Final simplification72.0%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* c_m (* (* x (* c_m s_m)) (* x s_m)))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x * Float64(c_m * s_m)) * Float64(x * s_m)))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / (c_m * ((x * (c_m * s_m)) * (x * s_m)));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(\left(x \cdot \left(c\_m \cdot s\_m\right)\right) \cdot \left(x \cdot s\_m\right)\right)}
\end{array}
Initial program 65.4%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6465.8%
Simplified65.8%
associate-/l/N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
unpow2N/A
/-lowering-/.f64N/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
Applied egg-rr71.4%
associate-*r*N/A
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
*-lowering-*.f6467.0%
Applied egg-rr67.0%
*-commutativeN/A
associate-*l*N/A
swap-sqrN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6471.9%
Applied egg-rr71.9%
Final simplification71.9%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ -2.0 (* s_m (* c_m (* c_m s_m)))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return -2.0 / (s_m * (c_m * (c_m * s_m)));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (-2.0d0) / (s_m * (c_m * (c_m * s_m)))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return -2.0 / (s_m * (c_m * (c_m * s_m)));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return -2.0 / (s_m * (c_m * (c_m * s_m)))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(-2.0 / Float64(s_m * Float64(c_m * Float64(c_m * s_m)))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = -2.0 / (s_m * (c_m * (c_m * s_m)));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(-2.0 / N[(s$95$m * N[(c$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{-2}{s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 65.4%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6481.4%
Simplified81.4%
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.6%
Applied egg-rr80.6%
Taylor expanded in x around 0
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6450.6%
Simplified50.6%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6423.0%
Simplified23.0%
herbie shell --seed 2024192
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))