
(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));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, c, s)
use fmin_fmax_functions
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 14 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));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, c, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* (* s_m x_m) c_m)))
(if (<= x_m 62000.0)
(pow t_1 -2.0)
(if (<= x_m 1.85e+176)
(/ t_0 (* (* t_1 s_m) (* c_m x_m)))
(/ t_0 (* (* s_m (* (* (* s_m c_m) x_m) c_m)) x_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m + x_m));
double t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 62000.0) {
tmp = pow(t_1, -2.0);
} else if (x_m <= 1.85e+176) {
tmp = t_0 / ((t_1 * s_m) * (c_m * x_m));
} else {
tmp = t_0 / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = (s_m * x_m) * c_m
if (x_m <= 62000.0d0) then
tmp = t_1 ** (-2.0d0)
else if (x_m <= 1.85d+176) then
tmp = t_0 / ((t_1 * s_m) * (c_m * x_m))
else
tmp = t_0 / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m + x_m));
double t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 62000.0) {
tmp = Math.pow(t_1, -2.0);
} else if (x_m <= 1.85e+176) {
tmp = t_0 / ((t_1 * s_m) * (c_m * x_m));
} else {
tmp = t_0 / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m + x_m)) t_1 = (s_m * x_m) * c_m tmp = 0 if x_m <= 62000.0: tmp = math.pow(t_1, -2.0) elif x_m <= 1.85e+176: tmp = t_0 / ((t_1 * s_m) * (c_m * x_m)) else: tmp = t_0 / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m + x_m)) t_1 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 62000.0) tmp = t_1 ^ -2.0; elseif (x_m <= 1.85e+176) tmp = Float64(t_0 / Float64(Float64(t_1 * s_m) * Float64(c_m * x_m))); else tmp = Float64(t_0 / Float64(Float64(s_m * Float64(Float64(Float64(s_m * c_m) * x_m) * c_m)) * x_m)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m + x_m));
t_1 = (s_m * x_m) * c_m;
tmp = 0.0;
if (x_m <= 62000.0)
tmp = t_1 ^ -2.0;
elseif (x_m <= 1.85e+176)
tmp = t_0 / ((t_1 * s_m) * (c_m * x_m));
else
tmp = t_0 / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 62000.0], N[Power[t$95$1, -2.0], $MachinePrecision], If[LessEqual[x$95$m, 1.85e+176], N[(t$95$0 / N[(N[(t$95$1 * s$95$m), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(s$95$m * N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 62000:\\
\;\;\;\;{t\_1}^{-2}\\
\mathbf{elif}\;x\_m \leq 1.85 \cdot 10^{+176}:\\
\;\;\;\;\frac{t\_0}{\left(t\_1 \cdot s\_m\right) \cdot \left(c\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(s\_m \cdot \left(\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot c\_m\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 62000Initial program 66.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.3
Applied rewrites96.3%
Taylor expanded in x around 0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow-prod-downN/A
unpow-prod-downN/A
*-commutativeN/A
metadata-evalN/A
pow-unpowN/A
pow-negN/A
metadata-evalN/A
pow-powN/A
metadata-evalN/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f6486.2
Applied rewrites86.2%
if 62000 < x < 1.8499999999999999e176Initial program 69.9%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.1
Applied rewrites98.1%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6494.4
Applied rewrites94.4%
lift-*.f64N/A
count-2-revN/A
lower-+.f6494.4
Applied rewrites94.4%
if 1.8499999999999999e176 < x Initial program 60.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6488.1
Applied rewrites88.1%
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
pow-prod-downN/A
pow2N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
Applied rewrites95.8%
lift-*.f64N/A
count-2-revN/A
lower-+.f6495.8
Applied rewrites95.8%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m x_m) c_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-178)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* t_0 s_m) (* c_m x_m)))
(pow t_0 -2.0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-178) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((t_0 * s_m) * (c_m * x_m));
} else {
tmp = pow(t_0, -2.0);
}
return tmp;
}
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-178) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(t_0 * s_m) * Float64(c_m * x_m))); else tmp = t_0 ^ -2.0; end return tmp end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-178], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(t$95$0 * s$95$m), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[t$95$0, -2.0], $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-178}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(t\_0 \cdot s\_m\right) \cdot \left(c\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;{t\_0}^{-2}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -9.9999999999999995e-179Initial program 71.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.9
Applied rewrites98.9%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
pow2N/A
lift-*.f6443.2
Applied rewrites43.2%
if -9.9999999999999995e-179 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 65.8%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.3
Applied rewrites96.3%
Taylor expanded in x around 0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow-prod-downN/A
unpow-prod-downN/A
*-commutativeN/A
metadata-evalN/A
pow-unpowN/A
pow-negN/A
metadata-evalN/A
pow-powN/A
metadata-evalN/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f6487.1
Applied rewrites87.1%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* c_m x_m) s_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-178)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* (* s_m x_m) c_m) s_m) (* c_m x_m)))
(/ (/ 1.0 t_0) t_0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-178) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((((s_m * x_m) * c_m) * s_m) * (c_m * x_m));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * x_m) * s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-178) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(Float64(s_m * x_m) * c_m) * s_m) * Float64(c_m * x_m))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-178], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-178}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot \left(c\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -9.9999999999999995e-179Initial program 71.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.9
Applied rewrites98.9%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
pow2N/A
lift-*.f6443.2
Applied rewrites43.2%
if -9.9999999999999995e-179 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 65.8%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6458.2
Applied rewrites58.2%
Taylor expanded in x around 0
Applied rewrites57.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.9%
Final simplification83.5%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* c_m x_m) s_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-1e-178)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* c_m c_m) (* x_m x_m)) (* s_m s_m)))
(/ (/ 1.0 t_0) t_0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -1e-178) {
tmp = fma((x_m * x_m), -2.0, 1.0) / (((c_m * c_m) * (x_m * x_m)) * (s_m * s_m));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * x_m) * s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -1e-178) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(c_m * c_m) * Float64(x_m * x_m)) * Float64(s_m * s_m))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-178], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -1 \cdot 10^{-178}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(c\_m \cdot c\_m\right) \cdot \left(x\_m \cdot x\_m\right)\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -9.9999999999999995e-179Initial program 71.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6455.8
Applied rewrites55.8%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
pow2N/A
lift-*.f6432.3
Applied rewrites32.3%
if -9.9999999999999995e-179 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 65.8%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6458.2
Applied rewrites58.2%
Taylor expanded in x around 0
Applied rewrites57.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.9%
Final simplification82.6%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 2.7e-31) (pow (* (* s_m x_m) c_m) -2.0) (/ (cos (* 2.0 x_m)) (* s_m (* (* (* s_m c_m) x_m) (* c_m x_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.7e-31) {
tmp = pow(((s_m * x_m) * c_m), -2.0);
} else {
tmp = cos((2.0 * x_m)) / (s_m * (((s_m * c_m) * x_m) * (c_m * x_m)));
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 2.7d-31) then
tmp = ((s_m * x_m) * c_m) ** (-2.0d0)
else
tmp = cos((2.0d0 * x_m)) / (s_m * (((s_m * c_m) * x_m) * (c_m * x_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.7e-31) {
tmp = Math.pow(((s_m * x_m) * c_m), -2.0);
} else {
tmp = Math.cos((2.0 * x_m)) / (s_m * (((s_m * c_m) * x_m) * (c_m * x_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 2.7e-31: tmp = math.pow(((s_m * x_m) * c_m), -2.0) else: tmp = math.cos((2.0 * x_m)) / (s_m * (((s_m * c_m) * x_m) * (c_m * x_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 2.7e-31) tmp = Float64(Float64(s_m * x_m) * c_m) ^ -2.0; else tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(s_m * Float64(Float64(Float64(s_m * c_m) * x_m) * Float64(c_m * x_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 2.7e-31)
tmp = ((s_m * x_m) * c_m) ^ -2.0;
else
tmp = cos((2.0 * x_m)) / (s_m * (((s_m * c_m) * x_m) * (c_m * x_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 2.7e-31], N[Power[N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision], -2.0], $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 2.7 \cdot 10^{-31}:\\
\;\;\;\;{\left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{s\_m \cdot \left(\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(c\_m \cdot x\_m\right)\right)}\\
\end{array}
\end{array}
if x < 2.70000000000000014e-31Initial program 66.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.1
Applied rewrites96.1%
Taylor expanded in x around 0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow-prod-downN/A
unpow-prod-downN/A
*-commutativeN/A
metadata-evalN/A
pow-unpowN/A
pow-negN/A
metadata-evalN/A
pow-powN/A
metadata-evalN/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f6485.6
Applied rewrites85.6%
if 2.70000000000000014e-31 < x Initial program 66.0%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
*-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unswap-sqrN/A
sqr-neg-revN/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-neg.f6496.8
Applied rewrites96.8%
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
swap-sqrN/A
sqr-neg-revN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
remove-double-negN/A
distribute-rgt-neg-outN/A
lift-*.f64N/A
lift-neg.f64N/A
associate-*l*N/A
Applied rewrites90.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 6e-27) (pow (* (* s_m x_m) c_m) -2.0) (/ (cos (+ x_m x_m)) (* (* s_m (* (* (* s_m c_m) x_m) c_m)) x_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 6e-27) {
tmp = pow(((s_m * x_m) * c_m), -2.0);
} else {
tmp = cos((x_m + x_m)) / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 6d-27) then
tmp = ((s_m * x_m) * c_m) ** (-2.0d0)
else
tmp = cos((x_m + x_m)) / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 6e-27) {
tmp = Math.pow(((s_m * x_m) * c_m), -2.0);
} else {
tmp = Math.cos((x_m + x_m)) / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 6e-27: tmp = math.pow(((s_m * x_m) * c_m), -2.0) else: tmp = math.cos((x_m + x_m)) / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 6e-27) tmp = Float64(Float64(s_m * x_m) * c_m) ^ -2.0; else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(s_m * Float64(Float64(Float64(s_m * c_m) * x_m) * c_m)) * x_m)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 6e-27)
tmp = ((s_m * x_m) * c_m) ^ -2.0;
else
tmp = cos((x_m + x_m)) / ((s_m * (((s_m * c_m) * x_m) * c_m)) * x_m);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 6e-27], N[Power[N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision], -2.0], $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(s$95$m * N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 6 \cdot 10^{-27}:\\
\;\;\;\;{\left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(s\_m \cdot \left(\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot c\_m\right)\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 6.0000000000000002e-27Initial program 66.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
Applied rewrites96.2%
Taylor expanded in x around 0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow-prod-downN/A
unpow-prod-downN/A
*-commutativeN/A
metadata-evalN/A
pow-unpowN/A
pow-negN/A
metadata-evalN/A
pow-powN/A
metadata-evalN/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f6485.8
Applied rewrites85.8%
if 6.0000000000000002e-27 < x Initial program 66.0%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6485.4
Applied rewrites85.4%
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
pow-prod-downN/A
pow2N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*r*N/A
Applied rewrites90.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6490.2
Applied rewrites90.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* (* c_m x_m) s_m))) (/ (cos (* 2.0 x_m)) (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return cos((2.0 * x_m)) / (t_0 * t_0);
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (c_m * x_m) * s_m
code = cos((2.0d0 * x_m)) / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return Math.cos((2.0 * x_m)) / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (c_m * x_m) * s_m return math.cos((2.0 * x_m)) / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * x_m) * s_m) return Float64(cos(Float64(2.0 * x_m)) / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (c_m * x_m) * s_m;
tmp = cos((2.0 * x_m)) / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\frac{\cos \left(2 \cdot x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
Applied rewrites96.5%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
*-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
unswap-sqrN/A
sqr-neg-revN/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-neg.f6497.0
Applied rewrites97.0%
Final simplification97.0%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* s_m c_m) x_m)))
(if (<= c_m 4.5e-53)
(/ (/ 1.0 t_0) t_0)
(/ 1.0 (* (* (* (* c_m x_m) s_m) c_m) (* s_m x_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * c_m) * x_m;
double tmp;
if (c_m <= 4.5e-53) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (s_m * c_m) * x_m
if (c_m <= 4.5d-53) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = 1.0d0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * c_m) * x_m;
double tmp;
if (c_m <= 4.5e-53) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (s_m * c_m) * x_m tmp = 0 if c_m <= 4.5e-53: tmp = (1.0 / t_0) / t_0 else: tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * c_m) * x_m) tmp = 0.0 if (c_m <= 4.5e-53) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(c_m * x_m) * s_m) * c_m) * Float64(s_m * x_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = (s_m * c_m) * x_m;
tmp = 0.0;
if (c_m <= 4.5e-53)
tmp = (1.0 / t_0) / t_0;
else
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, If[LessEqual[c$95$m, 4.5e-53], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot c\_m\right) \cdot x\_m\\
\mathbf{if}\;c\_m \leq 4.5 \cdot 10^{-53}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\end{array}
\end{array}
if c < 4.49999999999999985e-53Initial program 64.5%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6457.4
Applied rewrites57.4%
Taylor expanded in x around 0
Applied rewrites51.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
sqr-neg-revN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites76.8%
if 4.49999999999999985e-53 < c Initial program 70.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6459.2
Applied rewrites59.2%
Taylor expanded in x around 0
Applied rewrites57.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6468.8
Applied rewrites68.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites83.5%
Final simplification78.8%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* c_m s_m) x_m)))
(if (<= c_m 2e-75)
(/ 1.0 (* t_0 t_0))
(/ 1.0 (* (* (* (* c_m x_m) s_m) c_m) (* s_m x_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * s_m) * x_m;
double tmp;
if (c_m <= 2e-75) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (c_m * s_m) * x_m
if (c_m <= 2d-75) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = 1.0d0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * s_m) * x_m;
double tmp;
if (c_m <= 2e-75) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (c_m * s_m) * x_m tmp = 0 if c_m <= 2e-75: tmp = 1.0 / (t_0 * t_0) else: tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * s_m) * x_m) tmp = 0.0 if (c_m <= 2e-75) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(c_m * x_m) * s_m) * c_m) * Float64(s_m * x_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = (c_m * s_m) * x_m;
tmp = 0.0;
if (c_m <= 2e-75)
tmp = 1.0 / (t_0 * t_0);
else
tmp = 1.0 / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, If[LessEqual[c$95$m, 2e-75], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\_m\right) \cdot x\_m\\
\mathbf{if}\;c\_m \leq 2 \cdot 10^{-75}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\end{array}
\end{array}
if c < 1.9999999999999999e-75Initial program 63.9%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6456.6
Applied rewrites56.6%
Taylor expanded in x around 0
Applied rewrites51.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6465.7
Applied rewrites65.7%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
unpow2N/A
pow2N/A
associate-*l*N/A
unpow-prod-downN/A
lift-*.f64N/A
pow-prod-downN/A
lift-*.f64N/A
pow2N/A
lower-*.f6476.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.3
Applied rewrites76.3%
if 1.9999999999999999e-75 < c Initial program 70.9%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6460.8
Applied rewrites60.8%
Taylor expanded in x around 0
Applied rewrites57.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6468.2
Applied rewrites68.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites83.9%
Final simplification78.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 1.6e-155) (/ 1.0 (* (* x_m (* (* (* s_m x_m) s_m) c_m)) c_m)) (/ 1.0 (* (* c_m s_m) (* (* c_m s_m) (* x_m x_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.6e-155) {
tmp = 1.0 / ((x_m * (((s_m * x_m) * s_m) * c_m)) * c_m);
} else {
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 1.6d-155) then
tmp = 1.0d0 / ((x_m * (((s_m * x_m) * s_m) * c_m)) * c_m)
else
tmp = 1.0d0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.6e-155) {
tmp = 1.0 / ((x_m * (((s_m * x_m) * s_m) * c_m)) * c_m);
} else {
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 1.6e-155: tmp = 1.0 / ((x_m * (((s_m * x_m) * s_m) * c_m)) * c_m) else: tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 1.6e-155) tmp = Float64(1.0 / Float64(Float64(x_m * Float64(Float64(Float64(s_m * x_m) * s_m) * c_m)) * c_m)); else tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(Float64(c_m * s_m) * Float64(x_m * x_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 1.6e-155)
tmp = 1.0 / ((x_m * (((s_m * x_m) * s_m) * c_m)) * c_m);
else
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 1.6e-155], N[(1.0 / N[(N[(x$95$m * N[(N[(N[(s$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 1.6 \cdot 10^{-155}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot \left(\left(\left(s\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right)\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot x\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.60000000000000006e-155Initial program 66.8%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6456.8
Applied rewrites56.8%
Taylor expanded in x around 0
Applied rewrites52.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites76.5%
if 1.60000000000000006e-155 < x Initial program 65.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6459.9
Applied rewrites59.9%
Taylor expanded in x around 0
Applied rewrites54.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6464.9
Applied rewrites64.9%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
unpow2N/A
pow2N/A
associate-*l*N/A
unpow-prod-downN/A
lift-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6474.2
Applied rewrites74.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= c_m 1.55e+35) (/ 1.0 (* (* c_m s_m) (* (* c_m s_m) (* x_m x_m)))) (/ 1.0 (* (* c_m (* x_m (* c_m x_m))) (* s_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 1.55e+35) {
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
} else {
tmp = 1.0 / ((c_m * (x_m * (c_m * x_m))) * (s_m * s_m));
}
return tmp;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (c_m <= 1.55d+35) then
tmp = 1.0d0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)))
else
tmp = 1.0d0 / ((c_m * (x_m * (c_m * x_m))) * (s_m * s_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 1.55e+35) {
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
} else {
tmp = 1.0 / ((c_m * (x_m * (c_m * x_m))) * (s_m * s_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if c_m <= 1.55e+35: tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m))) else: tmp = 1.0 / ((c_m * (x_m * (c_m * x_m))) * (s_m * s_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (c_m <= 1.55e+35) tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(Float64(c_m * s_m) * Float64(x_m * x_m)))); else tmp = Float64(1.0 / Float64(Float64(c_m * Float64(x_m * Float64(c_m * x_m))) * Float64(s_m * s_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (c_m <= 1.55e+35)
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
else
tmp = 1.0 / ((c_m * (x_m * (c_m * x_m))) * (s_m * s_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[c$95$m, 1.55e+35], N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * N[(x$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 1.55 \cdot 10^{+35}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot x\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot \left(x\_m \cdot \left(c\_m \cdot x\_m\right)\right)\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\end{array}
\end{array}
if c < 1.54999999999999993e35Initial program 66.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6459.2
Applied rewrites59.2%
Taylor expanded in x around 0
Applied rewrites53.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6466.4
Applied rewrites66.4%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
unpow2N/A
pow2N/A
associate-*l*N/A
unpow-prod-downN/A
lift-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6467.5
Applied rewrites67.5%
if 1.54999999999999993e35 < c Initial program 66.3%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6454.1
Applied rewrites54.1%
Taylor expanded in x around 0
Applied rewrites52.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6467.2
Applied rewrites67.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* (* c_m x_m) s_m))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return (1.0 / t_0) / t_0;
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (c_m * x_m) * s_m
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (c_m * x_m) * s_m return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * x_m) * s_m) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (c_m * x_m) * s_m;
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6458.0
Applied rewrites58.0%
Taylor expanded in x around 0
Applied rewrites53.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqr-neg-revN/A
swap-sqrN/A
lift-*.f64N/A
lift-neg.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.1%
Final simplification80.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* (* c_m s_m) x_m))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * s_m) * x_m;
return 1.0 / (t_0 * t_0);
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (c_m * s_m) * x_m
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * s_m) * x_m;
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (c_m * s_m) * x_m return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * s_m) * x_m) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (c_m * s_m) * x_m;
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\_m\right) \cdot x\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6458.0
Applied rewrites58.0%
Taylor expanded in x around 0
Applied rewrites53.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6466.6
Applied rewrites66.6%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
unpow2N/A
pow2N/A
associate-*l*N/A
unpow-prod-downN/A
lift-*.f64N/A
pow-prod-downN/A
lift-*.f64N/A
pow2N/A
lower-*.f6478.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.9
Applied rewrites78.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* (* c_m s_m) (* x_m x_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
}
x_m = private
c_m = private
s_m = private
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x_m, c_m, s_m)
use fmin_fmax_functions
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(Float64(c_m * s_m) * Float64(x_m * x_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * ((c_m * s_m) * (x_m * x_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot x\_m\right)\right)}
\end{array}
Initial program 66.2%
lift-*.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6458.0
Applied rewrites58.0%
Taylor expanded in x around 0
Applied rewrites53.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6466.6
Applied rewrites66.6%
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
unpow2N/A
pow2N/A
associate-*l*N/A
unpow-prod-downN/A
lift-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow2N/A
lift-*.f6466.8
Applied rewrites66.8%
herbie shell --seed 2025027
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))