
(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}
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (let* ((t_0 (* (* x c) s_m))) (/ (cos (* x 2.0)) (* t_0 t_0))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
return cos((x * 2.0)) / (t_0 * t_0);
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (x * c) * s_m
code = cos((x * 2.0d0)) / (t_0 * t_0)
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
return Math.cos((x * 2.0)) / (t_0 * t_0);
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = (x * c) * s_m return math.cos((x * 2.0)) / (t_0 * t_0)
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(Float64(x * c) * s_m) return Float64(cos(Float64(x * 2.0)) / Float64(t_0 * t_0)) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
t_0 = (x * c) * s_m;
tmp = cos((x * 2.0)) / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]}, N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot c\right) \cdot s_m\\
\frac{\cos \left(x \cdot 2\right)}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.7%
times-frac72.7%
Applied egg-rr98.1%
*-commutative98.1%
frac-2neg98.1%
frac-2neg98.1%
metadata-eval98.1%
frac-times97.9%
*-commutative97.9%
associate-*r*97.2%
distribute-rgt-neg-in97.2%
associate-*r*98.7%
distribute-rgt-neg-in98.7%
Applied egg-rr98.7%
Final simplification98.7%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (/ (/ (cos (* x 2.0)) c) (* (* x s_m) (* c (* x s_m)))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
return (cos((x * 2.0)) / c) / ((x * s_m) * (c * (x * s_m)));
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
code = (cos((x * 2.0d0)) / c) / ((x * s_m) * (c * (x * s_m)))
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
return (Math.cos((x * 2.0)) / c) / ((x * s_m) * (c * (x * s_m)));
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): return (math.cos((x * 2.0)) / c) / ((x * s_m) * (c * (x * s_m)))
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) return Float64(Float64(cos(Float64(x * 2.0)) / c) / Float64(Float64(x * s_m) * Float64(c * Float64(x * s_m)))) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
tmp = (cos((x * 2.0)) / c) / ((x * s_m) * (c * (x * s_m)));
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := N[(N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / c), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\frac{\frac{\cos \left(x \cdot 2\right)}{c}}{\left(x \cdot s_m\right) \cdot \left(c \cdot \left(x \cdot s_m\right)\right)}
\end{array}
Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.7%
times-frac72.7%
Applied egg-rr98.1%
*-commutative98.1%
associate-/r*98.1%
frac-times95.4%
div-inv95.4%
*-commutative95.4%
Applied egg-rr95.4%
Final simplification95.4%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (let* ((t_0 (* c (* x s_m)))) (/ (/ (cos (* x 2.0)) t_0) t_0)))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
return (cos((x * 2.0)) / t_0) / t_0;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c * (x * s_m)
code = (cos((x * 2.0d0)) / t_0) / t_0
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
return (Math.cos((x * 2.0)) / t_0) / t_0;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = c * (x * s_m) return (math.cos((x * 2.0)) / t_0) / t_0
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(c * Float64(x * s_m)) return Float64(Float64(cos(Float64(x * 2.0)) / t_0) / t_0) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
t_0 = c * (x * s_m);
tmp = (cos((x * 2.0)) / t_0) / t_0;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(x \cdot s_m\right)\\
\frac{\frac{\cos \left(x \cdot 2\right)}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.7%
times-frac72.7%
Applied egg-rr98.1%
associate-*l/98.0%
*-un-lft-identity98.0%
*-commutative98.0%
Applied egg-rr98.0%
Final simplification98.0%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* c (* x s_m))))
(if (<= x 2.65e+14)
(/ 1.0 (* t_0 t_0))
(if (<= x 1.05e+185)
(/ (/ -1.0 (* c s_m)) (* x (* (* x c) s_m)))
(/ 1.0 (* s_m (* (* x c) t_0)))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = 1.0 / (t_0 * t_0);
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
} else {
tmp = 1.0 / (s_m * ((x * c) * t_0));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c * (x * s_m)
if (x <= 2.65d+14) then
tmp = 1.0d0 / (t_0 * t_0)
else if (x <= 1.05d+185) then
tmp = ((-1.0d0) / (c * s_m)) / (x * ((x * c) * s_m))
else
tmp = 1.0d0 / (s_m * ((x * c) * t_0))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = 1.0 / (t_0 * t_0);
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
} else {
tmp = 1.0 / (s_m * ((x * c) * t_0));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = c * (x * s_m) tmp = 0 if x <= 2.65e+14: tmp = 1.0 / (t_0 * t_0) elif x <= 1.05e+185: tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m)) else: tmp = 1.0 / (s_m * ((x * c) * t_0)) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(c * Float64(x * s_m)) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(1.0 / Float64(t_0 * t_0)); elseif (x <= 1.05e+185) tmp = Float64(Float64(-1.0 / Float64(c * s_m)) / Float64(x * Float64(Float64(x * c) * s_m))); else tmp = Float64(1.0 / Float64(s_m * Float64(Float64(x * c) * t_0))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = c * (x * s_m);
tmp = 0.0;
if (x <= 2.65e+14)
tmp = 1.0 / (t_0 * t_0);
elseif (x <= 1.05e+185)
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
else
tmp = 1.0 / (s_m * ((x * c) * t_0));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.05e+185], N[(N[(-1.0 / N[(c * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x * N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(N[(x * c), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(x \cdot s_m\right)\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{1}{t_0 \cdot t_0}\\
\mathbf{elif}\;x \leq 1.05 \cdot 10^{+185}:\\
\;\;\;\;\frac{\frac{-1}{c \cdot s_m}}{x \cdot \left(\left(x \cdot c\right) \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s_m \cdot \left(\left(x \cdot c\right) \cdot t_0\right)}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
Taylor expanded in x around 0 58.4%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr68.3%
unpow268.3%
associate-/r*68.3%
unpow268.3%
unpow268.3%
swap-sqr81.7%
unpow281.7%
*-commutative81.7%
Simplified81.7%
*-commutative81.7%
pow281.7%
Applied egg-rr81.7%
if 2.65e14 < x < 1.05e185Initial program 77.1%
Taylor expanded in x around 0 46.7%
associate-/r*46.6%
*-commutative46.6%
unpow246.6%
unpow246.6%
swap-sqr49.3%
unpow249.3%
associate-/r*49.4%
unpow249.4%
unpow249.4%
swap-sqr51.6%
unpow251.6%
*-commutative51.6%
Simplified51.6%
unpow251.6%
associate-*r*51.6%
*-commutative51.6%
associate-*l*51.6%
Applied egg-rr51.6%
Applied egg-rr51.6%
Applied egg-rr61.9%
if 1.05e185 < x Initial program 66.2%
Taylor expanded in x around 0 62.4%
associate-/r*62.4%
*-commutative62.4%
unpow262.4%
unpow262.4%
swap-sqr65.9%
unpow265.9%
associate-/r*65.9%
unpow265.9%
unpow265.9%
swap-sqr75.7%
unpow275.7%
*-commutative75.7%
Simplified75.7%
*-commutative75.7%
pow275.7%
associate-*r*75.7%
associate-*r*75.7%
Applied egg-rr75.7%
Final simplification77.7%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* c (* x s_m))))
(if (<= x 2.65e+14)
(/ (/ 1.0 t_0) t_0)
(if (<= x 1.05e+185)
(/ (/ -1.0 (* c s_m)) (* x (* (* x c) s_m)))
(/ 1.0 (* s_m (* (* x c) t_0)))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = (1.0 / t_0) / t_0;
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
} else {
tmp = 1.0 / (s_m * ((x * c) * t_0));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c * (x * s_m)
if (x <= 2.65d+14) then
tmp = (1.0d0 / t_0) / t_0
else if (x <= 1.05d+185) then
tmp = ((-1.0d0) / (c * s_m)) / (x * ((x * c) * s_m))
else
tmp = 1.0d0 / (s_m * ((x * c) * t_0))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = (1.0 / t_0) / t_0;
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
} else {
tmp = 1.0 / (s_m * ((x * c) * t_0));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = c * (x * s_m) tmp = 0 if x <= 2.65e+14: tmp = (1.0 / t_0) / t_0 elif x <= 1.05e+185: tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m)) else: tmp = 1.0 / (s_m * ((x * c) * t_0)) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(c * Float64(x * s_m)) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(1.0 / t_0) / t_0); elseif (x <= 1.05e+185) tmp = Float64(Float64(-1.0 / Float64(c * s_m)) / Float64(x * Float64(Float64(x * c) * s_m))); else tmp = Float64(1.0 / Float64(s_m * Float64(Float64(x * c) * t_0))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = c * (x * s_m);
tmp = 0.0;
if (x <= 2.65e+14)
tmp = (1.0 / t_0) / t_0;
elseif (x <= 1.05e+185)
tmp = (-1.0 / (c * s_m)) / (x * ((x * c) * s_m));
else
tmp = 1.0 / (s_m * ((x * c) * t_0));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[x, 1.05e+185], N[(N[(-1.0 / N[(c * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x * N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(N[(x * c), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(x \cdot s_m\right)\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{1}{t_0}}{t_0}\\
\mathbf{elif}\;x \leq 1.05 \cdot 10^{+185}:\\
\;\;\;\;\frac{\frac{-1}{c \cdot s_m}}{x \cdot \left(\left(x \cdot c\right) \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s_m \cdot \left(\left(x \cdot c\right) \cdot t_0\right)}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
if 2.65e14 < x < 1.05e185Initial program 77.1%
Taylor expanded in x around 0 46.7%
associate-/r*46.6%
*-commutative46.6%
unpow246.6%
unpow246.6%
swap-sqr49.3%
unpow249.3%
associate-/r*49.4%
unpow249.4%
unpow249.4%
swap-sqr51.6%
unpow251.6%
*-commutative51.6%
Simplified51.6%
unpow251.6%
associate-*r*51.6%
*-commutative51.6%
associate-*l*51.6%
Applied egg-rr51.6%
Applied egg-rr51.6%
Applied egg-rr61.9%
if 1.05e185 < x Initial program 66.2%
Taylor expanded in x around 0 62.4%
associate-/r*62.4%
*-commutative62.4%
unpow262.4%
unpow262.4%
swap-sqr65.9%
unpow265.9%
associate-/r*65.9%
unpow265.9%
unpow265.9%
swap-sqr75.7%
unpow275.7%
*-commutative75.7%
Simplified75.7%
*-commutative75.7%
pow275.7%
associate-*r*75.7%
associate-*r*75.7%
Applied egg-rr75.7%
Final simplification77.8%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* (* x c) s_m)) (t_1 (* c (* x s_m))))
(if (<= x 2.65e+14)
(/ (/ 1.0 t_1) t_1)
(if (<= x 1.05e+185)
(/ (/ -1.0 (* c s_m)) (* x t_0))
(/ (/ 1.0 t_0) t_0)))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double t_1 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = (1.0 / t_1) / t_1;
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (x * c) * s_m
t_1 = c * (x * s_m)
if (x <= 2.65d+14) then
tmp = (1.0d0 / t_1) / t_1
else if (x <= 1.05d+185) then
tmp = ((-1.0d0) / (c * s_m)) / (x * t_0)
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double t_1 = c * (x * s_m);
double tmp;
if (x <= 2.65e+14) {
tmp = (1.0 / t_1) / t_1;
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = (x * c) * s_m t_1 = c * (x * s_m) tmp = 0 if x <= 2.65e+14: tmp = (1.0 / t_1) / t_1 elif x <= 1.05e+185: tmp = (-1.0 / (c * s_m)) / (x * t_0) else: tmp = (1.0 / t_0) / t_0 return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(Float64(x * c) * s_m) t_1 = Float64(c * Float64(x * s_m)) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x <= 1.05e+185) tmp = Float64(Float64(-1.0 / Float64(c * s_m)) / Float64(x * t_0)); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = (x * c) * s_m;
t_1 = c * (x * s_m);
tmp = 0.0;
if (x <= 2.65e+14)
tmp = (1.0 / t_1) / t_1;
elseif (x <= 1.05e+185)
tmp = (-1.0 / (c * s_m)) / (x * t_0);
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x, 1.05e+185], N[(N[(-1.0 / N[(c * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot c\right) \cdot s_m\\
t_1 := c \cdot \left(x \cdot s_m\right)\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{1}{t_1}}{t_1}\\
\mathbf{elif}\;x \leq 1.05 \cdot 10^{+185}:\\
\;\;\;\;\frac{\frac{-1}{c \cdot s_m}}{x \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t_0}}{t_0}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
if 2.65e14 < x < 1.05e185Initial program 77.1%
Taylor expanded in x around 0 46.7%
associate-/r*46.6%
*-commutative46.6%
unpow246.6%
unpow246.6%
swap-sqr49.3%
unpow249.3%
associate-/r*49.4%
unpow249.4%
unpow249.4%
swap-sqr51.6%
unpow251.6%
*-commutative51.6%
Simplified51.6%
unpow251.6%
associate-*r*51.6%
*-commutative51.6%
associate-*l*51.6%
Applied egg-rr51.6%
Applied egg-rr51.6%
Applied egg-rr61.9%
if 1.05e185 < x Initial program 66.2%
Taylor expanded in x around 0 62.4%
associate-/r*62.4%
*-commutative62.4%
unpow262.4%
unpow262.4%
swap-sqr65.9%
unpow265.9%
associate-/r*65.9%
unpow265.9%
unpow265.9%
swap-sqr75.7%
unpow275.7%
*-commutative75.7%
Simplified75.7%
unpow275.7%
associate-*r*74.9%
*-commutative74.9%
associate-*l*74.4%
Applied egg-rr74.4%
Applied egg-rr74.9%
add-sqr-sqrt70.0%
sqrt-prod74.7%
frac-times74.7%
metadata-eval74.7%
associate-*l*74.7%
*-commutative74.7%
associate-*l*74.7%
*-commutative74.7%
associate-*r*74.7%
associate-*r*74.7%
sqrt-div74.7%
metadata-eval74.7%
associate-*r*74.7%
associate-*r*74.7%
sqrt-prod28.9%
add-sqr-sqrt77.3%
Applied egg-rr75.7%
Final simplification77.8%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* (* x c) s_m)))
(if (<= x 2.65e+14)
(/ (/ (/ 1.0 c) (* x s_m)) (* c (* x s_m)))
(if (<= x 1.05e+185)
(/ (/ -1.0 (* c s_m)) (* x t_0))
(/ (/ 1.0 t_0) t_0)))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x * c) * s_m
if (x <= 2.65d+14) then
tmp = ((1.0d0 / c) / (x * s_m)) / (c * (x * s_m))
else if (x <= 1.05d+185) then
tmp = ((-1.0d0) / (c * s_m)) / (x * t_0)
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else if (x <= 1.05e+185) {
tmp = (-1.0 / (c * s_m)) / (x * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = (x * c) * s_m tmp = 0 if x <= 2.65e+14: tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m)) elif x <= 1.05e+185: tmp = (-1.0 / (c * s_m)) / (x * t_0) else: tmp = (1.0 / t_0) / t_0 return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(Float64(x * c) * s_m) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s_m)) / Float64(c * Float64(x * s_m))); elseif (x <= 1.05e+185) tmp = Float64(Float64(-1.0 / Float64(c * s_m)) / Float64(x * t_0)); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = (x * c) * s_m;
tmp = 0.0;
if (x <= 2.65e+14)
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
elseif (x <= 1.05e+185)
tmp = (-1.0 / (c * s_m)) / (x * t_0);
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.05e+185], N[(N[(-1.0 / N[(c * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot c\right) \cdot s_m\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1}{c}}{x \cdot s_m}}{c \cdot \left(x \cdot s_m\right)}\\
\mathbf{elif}\;x \leq 1.05 \cdot 10^{+185}:\\
\;\;\;\;\frac{\frac{-1}{c \cdot s_m}}{x \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t_0}}{t_0}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
associate-/r*81.9%
Simplified81.9%
if 2.65e14 < x < 1.05e185Initial program 77.1%
Taylor expanded in x around 0 46.7%
associate-/r*46.6%
*-commutative46.6%
unpow246.6%
unpow246.6%
swap-sqr49.3%
unpow249.3%
associate-/r*49.4%
unpow249.4%
unpow249.4%
swap-sqr51.6%
unpow251.6%
*-commutative51.6%
Simplified51.6%
unpow251.6%
associate-*r*51.6%
*-commutative51.6%
associate-*l*51.6%
Applied egg-rr51.6%
Applied egg-rr51.6%
Applied egg-rr61.9%
if 1.05e185 < x Initial program 66.2%
Taylor expanded in x around 0 62.4%
associate-/r*62.4%
*-commutative62.4%
unpow262.4%
unpow262.4%
swap-sqr65.9%
unpow265.9%
associate-/r*65.9%
unpow265.9%
unpow265.9%
swap-sqr75.7%
unpow275.7%
*-commutative75.7%
Simplified75.7%
unpow275.7%
associate-*r*74.9%
*-commutative74.9%
associate-*l*74.4%
Applied egg-rr74.4%
Applied egg-rr74.9%
add-sqr-sqrt70.0%
sqrt-prod74.7%
frac-times74.7%
metadata-eval74.7%
associate-*l*74.7%
*-commutative74.7%
associate-*l*74.7%
*-commutative74.7%
associate-*r*74.7%
associate-*r*74.7%
sqrt-div74.7%
metadata-eval74.7%
associate-*r*74.7%
associate-*r*74.7%
sqrt-prod28.9%
add-sqr-sqrt77.3%
Applied egg-rr75.7%
Final simplification77.8%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (if (<= x 2.65e+14) (/ (/ (/ 1.0 c) (* x s_m)) (* c (* x s_m))) (* (/ (/ 1.0 (* (* x c) s_m)) (* x c)) (/ -1.0 s_m))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = ((1.0 / ((x * c) * s_m)) / (x * c)) * (-1.0 / s_m);
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 2.65d+14) then
tmp = ((1.0d0 / c) / (x * s_m)) / (c * (x * s_m))
else
tmp = ((1.0d0 / ((x * c) * s_m)) / (x * c)) * ((-1.0d0) / s_m)
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = ((1.0 / ((x * c) * s_m)) / (x * c)) * (-1.0 / s_m);
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if x <= 2.65e+14: tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m)) else: tmp = ((1.0 / ((x * c) * s_m)) / (x * c)) * (-1.0 / s_m) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s_m)) / Float64(c * Float64(x * s_m))); else tmp = Float64(Float64(Float64(1.0 / Float64(Float64(x * c) * s_m)) / Float64(x * c)) * Float64(-1.0 / s_m)); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if (x <= 2.65e+14)
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
else
tmp = ((1.0 / ((x * c) * s_m)) / (x * c)) * (-1.0 / s_m);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[x, 2.65e+14], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x * c), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / s$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1}{c}}{x \cdot s_m}}{c \cdot \left(x \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\left(x \cdot c\right) \cdot s_m}}{x \cdot c} \cdot \frac{-1}{s_m}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
associate-/r*81.9%
Simplified81.9%
if 2.65e14 < x Initial program 72.7%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr56.0%
unpow256.0%
associate-/r*56.0%
unpow256.0%
unpow256.0%
swap-sqr61.3%
unpow261.3%
*-commutative61.3%
Simplified61.3%
*-commutative61.3%
pow261.3%
associate-*r*61.3%
associate-*l*61.1%
Applied egg-rr61.1%
metadata-eval61.1%
associate-*r*61.3%
associate-*r*61.3%
frac-times61.3%
*-commutative61.3%
associate-*l*61.0%
/-rgt-identity61.0%
times-frac61.0%
*-un-lft-identity61.0%
associate-*r*61.0%
times-frac60.7%
Applied egg-rr68.6%
Final simplification78.1%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* (* x c) s_m)))
(if (<= x 2.65e+14)
(/ (/ (/ 1.0 c) (* x s_m)) (* c (* x s_m)))
(* (/ 1.0 t_0) (/ -1.0 t_0)))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = (1.0 / t_0) * (-1.0 / t_0);
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x * c) * s_m
if (x <= 2.65d+14) then
tmp = ((1.0d0 / c) / (x * s_m)) / (c * (x * s_m))
else
tmp = (1.0d0 / t_0) * ((-1.0d0) / t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = (1.0 / t_0) * (-1.0 / t_0);
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = (x * c) * s_m tmp = 0 if x <= 2.65e+14: tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m)) else: tmp = (1.0 / t_0) * (-1.0 / t_0) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(Float64(x * c) * s_m) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s_m)) / Float64(c * Float64(x * s_m))); else tmp = Float64(Float64(1.0 / t_0) * Float64(-1.0 / t_0)); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = (x * c) * s_m;
tmp = 0.0;
if (x <= 2.65e+14)
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
else
tmp = (1.0 / t_0) * (-1.0 / t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot c\right) \cdot s_m\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1}{c}}{x \cdot s_m}}{c \cdot \left(x \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t_0} \cdot \frac{-1}{t_0}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
associate-/r*81.9%
Simplified81.9%
if 2.65e14 < x Initial program 72.7%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr56.0%
unpow256.0%
associate-/r*56.0%
unpow256.0%
unpow256.0%
swap-sqr61.3%
unpow261.3%
*-commutative61.3%
Simplified61.3%
*-commutative61.3%
pow261.3%
associate-*r*61.3%
associate-*l*61.1%
Applied egg-rr61.1%
metadata-eval61.1%
associate-*r*61.3%
associate-*r*61.3%
frac-times61.3%
*-commutative61.3%
associate-*l*61.0%
/-rgt-identity61.0%
times-frac61.0%
*-un-lft-identity61.0%
div-inv61.0%
Applied egg-rr68.5%
Final simplification78.1%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* (* x c) s_m)))
(if (<= x 2.65e+14)
(/ (/ (/ 1.0 c) (* x s_m)) (* c (* x s_m)))
(/ 1.0 (/ t_0 (/ -1.0 t_0))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = 1.0 / (t_0 / (-1.0 / t_0));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x * c) * s_m
if (x <= 2.65d+14) then
tmp = ((1.0d0 / c) / (x * s_m)) / (c * (x * s_m))
else
tmp = 1.0d0 / (t_0 / ((-1.0d0) / t_0))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = (x * c) * s_m;
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = 1.0 / (t_0 / (-1.0 / t_0));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = (x * c) * s_m tmp = 0 if x <= 2.65e+14: tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m)) else: tmp = 1.0 / (t_0 / (-1.0 / t_0)) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(Float64(x * c) * s_m) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s_m)) / Float64(c * Float64(x * s_m))); else tmp = Float64(1.0 / Float64(t_0 / Float64(-1.0 / t_0))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = (x * c) * s_m;
tmp = 0.0;
if (x <= 2.65e+14)
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
else
tmp = 1.0 / (t_0 / (-1.0 / t_0));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(N[(x * c), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[x, 2.65e+14], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 / N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot c\right) \cdot s_m\\
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1}{c}}{x \cdot s_m}}{c \cdot \left(x \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t_0}{\frac{-1}{t_0}}}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
associate-/r*81.9%
Simplified81.9%
if 2.65e14 < x Initial program 72.7%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr56.0%
unpow256.0%
associate-/r*56.0%
unpow256.0%
unpow256.0%
swap-sqr61.3%
unpow261.3%
*-commutative61.3%
Simplified61.3%
unpow261.3%
associate-*r*61.0%
*-commutative61.0%
associate-*l*60.8%
Applied egg-rr60.8%
Applied egg-rr61.0%
associate-*r/61.0%
associate-*l*61.0%
*-commutative61.0%
clear-num61.0%
*-commutative61.0%
*-commutative61.0%
associate-*l*61.0%
Applied egg-rr68.5%
Final simplification78.1%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (if (<= x 2.65e+14) (/ (/ (/ 1.0 c) (* x s_m)) (* c (* x s_m))) (/ 1.0 (* c (* (* x s_m) (* c (* x (- s_m))))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = 1.0 / (c * ((x * s_m) * (c * (x * -s_m))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 2.65d+14) then
tmp = ((1.0d0 / c) / (x * s_m)) / (c * (x * s_m))
else
tmp = 1.0d0 / (c * ((x * s_m) * (c * (x * -s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.65e+14) {
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
} else {
tmp = 1.0 / (c * ((x * s_m) * (c * (x * -s_m))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if x <= 2.65e+14: tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m)) else: tmp = 1.0 / (c * ((x * s_m) * (c * (x * -s_m)))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (x <= 2.65e+14) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s_m)) / Float64(c * Float64(x * s_m))); else tmp = Float64(1.0 / Float64(c * Float64(Float64(x * s_m) * Float64(c * Float64(x * Float64(-s_m)))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if (x <= 2.65e+14)
tmp = ((1.0 / c) / (x * s_m)) / (c * (x * s_m));
else
tmp = 1.0 / (c * ((x * s_m) * (c * (x * -s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[x, 2.65e+14], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c * N[(N[(x * s$95$m), $MachinePrecision] * N[(c * N[(x * (-s$95$m)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.65 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1}{c}}{x \cdot s_m}}{c \cdot \left(x \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c \cdot \left(\left(x \cdot s_m\right) \cdot \left(c \cdot \left(x \cdot \left(-s_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.65e14Initial program 72.7%
*-un-lft-identity72.7%
add-sqr-sqrt72.6%
times-frac72.7%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
*-commutative97.9%
Applied egg-rr97.9%
Taylor expanded in x around 0 81.9%
associate-/r*81.9%
Simplified81.9%
if 2.65e14 < x Initial program 72.7%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr56.0%
unpow256.0%
associate-/r*56.0%
unpow256.0%
unpow256.0%
swap-sqr61.3%
unpow261.3%
*-commutative61.3%
Simplified61.3%
*-commutative61.3%
pow261.3%
*-commutative61.3%
associate-*r*60.9%
Applied egg-rr60.9%
/-rgt-identity60.9%
clear-num60.9%
associate-/r*60.9%
Applied egg-rr60.9%
frac-2neg60.9%
metadata-eval60.9%
div-inv60.9%
associate-/l/60.9%
*-commutative60.9%
distribute-neg-frac60.9%
metadata-eval60.9%
*-commutative60.9%
associate-*l*60.6%
add-sqr-sqrt47.8%
sqrt-prod65.8%
frac-times65.8%
metadata-eval65.8%
associate-*l*65.8%
*-commutative65.8%
associate-*l*66.3%
*-commutative66.3%
associate-*r*66.3%
associate-*r*65.8%
Applied egg-rr68.4%
Final simplification78.1%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (/ 1.0 (* (* c s_m) (* x (* c (* x s_m))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
return 1.0 / ((c * s_m) * (x * (c * (x * s_m))));
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
code = 1.0d0 / ((c * s_m) * (x * (c * (x * s_m))))
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
return 1.0 / ((c * s_m) * (x * (c * (x * s_m))));
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): return 1.0 / ((c * s_m) * (x * (c * (x * s_m))))
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) return Float64(1.0 / Float64(Float64(c * s_m) * Float64(x * Float64(c * Float64(x * s_m))))) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
tmp = 1.0 / ((c * s_m) * (x * (c * (x * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := N[(1.0 / N[(N[(c * s$95$m), $MachinePrecision] * N[(x * N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\frac{1}{\left(c \cdot s_m\right) \cdot \left(x \cdot \left(c \cdot \left(x \cdot s_m\right)\right)\right)}
\end{array}
Initial program 72.7%
Taylor expanded in x around 0 56.9%
associate-/r*56.9%
*-commutative56.9%
unpow256.9%
unpow256.9%
swap-sqr64.9%
unpow264.9%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr76.0%
unpow276.0%
*-commutative76.0%
Simplified76.0%
unpow276.0%
associate-*r*75.2%
*-commutative75.2%
associate-*l*74.3%
Applied egg-rr74.3%
Final simplification74.3%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (let* ((t_0 (* c (* x s_m)))) (/ 1.0 (* t_0 t_0))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
return 1.0 / (t_0 * t_0);
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c * (x * s_m)
code = 1.0d0 / (t_0 * t_0)
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = c * (x * s_m);
return 1.0 / (t_0 * t_0);
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = c * (x * s_m) return 1.0 / (t_0 * t_0)
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(c * Float64(x * s_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
t_0 = c * (x * s_m);
tmp = 1.0 / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(c * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(x \cdot s_m\right)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 72.7%
Taylor expanded in x around 0 56.9%
associate-/r*56.9%
*-commutative56.9%
unpow256.9%
unpow256.9%
swap-sqr64.9%
unpow264.9%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr76.0%
unpow276.0%
*-commutative76.0%
Simplified76.0%
*-commutative76.0%
pow276.0%
Applied egg-rr76.0%
Final simplification76.0%
herbie shell --seed 2023315
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))