
(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 10 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}
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (cos (+ x x))) (t_1 (* c_m (* x s))) (t_2 (* (* c_m s) x)))
(if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x))) 0.0)
(/ t_0 (* t_1 t_1))
(/ t_0 (* t_2 t_2)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = cos((x + x));
double t_1 = c_m * (x * s);
double t_2 = (c_m * s) * x;
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= 0.0) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (t_2 * t_2);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = cos((x + x))
t_1 = c_m * (x * s)
t_2 = (c_m * s) * x
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= 0.0d0) then
tmp = t_0 / (t_1 * t_1)
else
tmp = t_0 / (t_2 * t_2)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = Math.cos((x + x));
double t_1 = c_m * (x * s);
double t_2 = (c_m * s) * x;
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= 0.0) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (t_2 * t_2);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = math.cos((x + x)) t_1 = c_m * (x * s) t_2 = (c_m * s) * x tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= 0.0: tmp = t_0 / (t_1 * t_1) else: tmp = t_0 / (t_2 * t_2) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = cos(Float64(x + x)) t_1 = Float64(c_m * Float64(x * s)) t_2 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= 0.0) tmp = Float64(t_0 / Float64(t_1 * t_1)); else tmp = Float64(t_0 / Float64(t_2 * t_2)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = cos((x + x));
t_1 = c_m * (x * s);
t_2 = (c_m * s) * x;
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= 0.0)
tmp = t_0 / (t_1 * t_1);
else
tmp = t_0 / (t_2 * t_2);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(t$95$0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(t$95$2 * t$95$2), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(x + x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\right)\\
t_2 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq 0:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{t\_2 \cdot t\_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))) < -0.0Initial program 72.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6476.7
lift-pow.f64N/A
unpow2N/A
lower-*.f6476.7
Applied rewrites76.7%
lift-*.f64N/A
count-2-revN/A
lower-+.f6476.7
Applied rewrites76.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6493.9
Applied rewrites93.9%
lift-*.f64N/A
sqr-neg-revN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f6499.3
Applied rewrites99.3%
if -0.0 < (/.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 58.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6457.3
lift-pow.f64N/A
unpow2N/A
lower-*.f6457.3
Applied rewrites57.3%
lift-*.f64N/A
count-2-revN/A
lower-+.f6457.3
Applied rewrites57.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6498.0
Applied rewrites98.0%
Final simplification98.6%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* (* x (pow s 2.0)) x)))
-2e-229)
(/ -2.0 (* (* (* s c_m) c_m) s))
(/ 1.0 (* t_0 t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * ((x * pow(s, 2.0)) * x))) <= -2e-229) {
tmp = -2.0 / (((s * c_m) * c_m) * s);
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = (c_m * s) * x
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * ((x * (s ** 2.0d0)) * x))) <= (-2d-229)) then
tmp = (-2.0d0) / (((s * c_m) * c_m) * s)
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * ((x * Math.pow(s, 2.0)) * x))) <= -2e-229) {
tmp = -2.0 / (((s * c_m) * c_m) * s);
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = (c_m * s) * x tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * ((x * math.pow(s, 2.0)) * x))) <= -2e-229: tmp = -2.0 / (((s * c_m) * c_m) * s) else: tmp = 1.0 / (t_0 * t_0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) <= -2e-229) tmp = Float64(-2.0 / Float64(Float64(Float64(s * c_m) * c_m) * s)); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = (c_m * s) * x;
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * ((x * (s ^ 2.0)) * x))) <= -2e-229)
tmp = -2.0 / (((s * c_m) * c_m) * s);
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-229], N[(-2.0 / N[(N[(N[(s * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)} \leq -2 \cdot 10^{-229}:\\
\;\;\;\;\frac{-2}{\left(\left(s \cdot c\_m\right) \cdot c\_m\right) \cdot s}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot 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))) < -2.00000000000000014e-229Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites44.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
Applied rewrites30.2%
Taylor expanded in x around inf
Applied rewrites30.2%
if -2.00000000000000014e-229 < (/.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 66.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6467.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
count-2-revN/A
lower-+.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6496.2
Applied rewrites96.2%
Taylor expanded in x around 0
Applied rewrites82.8%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)))
(if (<= x 4.9e-188)
(/ (fma -2.0 (* x x) 1.0) (* (* (pow (* s x) 2.0) c_m) c_m))
(/ (cos (+ x x)) (* t_0 t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if (x <= 4.9e-188) {
tmp = fma(-2.0, (x * x), 1.0) / ((pow((s * x), 2.0) * c_m) * c_m);
} else {
tmp = cos((x + x)) / (t_0 * t_0);
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (x <= 4.9e-188) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(Float64((Float64(s * x) ^ 2.0) * c_m) * c_m)); else tmp = Float64(cos(Float64(x + x)) / Float64(t_0 * t_0)); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, 4.9e-188], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[Power[N[(s * x), $MachinePrecision], 2.0], $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;x \leq 4.9 \cdot 10^{-188}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{\left({\left(s \cdot x\right)}^{2} \cdot c\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 4.90000000000000004e-188Initial program 65.6%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites53.7%
Applied rewrites64.2%
if 4.90000000000000004e-188 < x Initial program 64.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6466.2
lift-pow.f64N/A
unpow2N/A
lower-*.f6466.2
Applied rewrites66.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6466.2
Applied rewrites66.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6498.3
Applied rewrites98.3%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= x 3.7e-75) (/ (fma -2.0 (* x x) 1.0) (* (* (pow (* s x) 2.0) c_m) c_m)) (/ (cos (+ x x)) (* x (* (* x c_m) (* (* s c_m) s))))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if (x <= 3.7e-75) {
tmp = fma(-2.0, (x * x), 1.0) / ((pow((s * x), 2.0) * c_m) * c_m);
} else {
tmp = cos((x + x)) / (x * ((x * c_m) * ((s * c_m) * s)));
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (x <= 3.7e-75) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(Float64((Float64(s * x) ^ 2.0) * c_m) * c_m)); else tmp = Float64(cos(Float64(x + x)) / Float64(x * Float64(Float64(x * c_m) * Float64(Float64(s * c_m) * s)))); end return tmp end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[x, 3.7e-75], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[Power[N[(s * x), $MachinePrecision], 2.0], $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(x * N[(N[(x * c$95$m), $MachinePrecision] * N[(N[(s * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3.7 \cdot 10^{-75}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{\left({\left(s \cdot x\right)}^{2} \cdot c\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{x \cdot \left(\left(x \cdot c\_m\right) \cdot \left(\left(s \cdot c\_m\right) \cdot s\right)\right)}\\
\end{array}
\end{array}
if x < 3.70000000000000024e-75Initial program 65.7%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites57.8%
Applied rewrites68.7%
if 3.70000000000000024e-75 < x Initial program 64.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6467.2
lift-pow.f64N/A
unpow2N/A
lower-*.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6467.2
Applied rewrites67.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6497.9
Applied rewrites97.9%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6480.9
Applied rewrites80.9%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)))
(if (<= s 1.7e+100)
(/ (cos (+ x x)) (* s (* (* s x) (* (* c_m c_m) x))))
(/ 1.0 (* t_0 t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if (s <= 1.7e+100) {
tmp = cos((x + x)) / (s * ((s * x) * ((c_m * c_m) * x)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = (c_m * s) * x
if (s <= 1.7d+100) then
tmp = cos((x + x)) / (s * ((s * x) * ((c_m * c_m) * x)))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if (s <= 1.7e+100) {
tmp = Math.cos((x + x)) / (s * ((s * x) * ((c_m * c_m) * x)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = (c_m * s) * x tmp = 0 if s <= 1.7e+100: tmp = math.cos((x + x)) / (s * ((s * x) * ((c_m * c_m) * x))) else: tmp = 1.0 / (t_0 * t_0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (s <= 1.7e+100) tmp = Float64(cos(Float64(x + x)) / Float64(s * Float64(Float64(s * x) * Float64(Float64(c_m * c_m) * x)))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = (c_m * s) * x;
tmp = 0.0;
if (s <= 1.7e+100)
tmp = cos((x + x)) / (s * ((s * x) * ((c_m * c_m) * x)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[s, 1.7e+100], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(s * N[(N[(s * x), $MachinePrecision] * N[(N[(c$95$m * c$95$m), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;s \leq 1.7 \cdot 10^{+100}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{s \cdot \left(\left(s \cdot x\right) \cdot \left(\left(c\_m \cdot c\_m\right) \cdot x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if s < 1.69999999999999997e100Initial program 67.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6469.5
lift-pow.f64N/A
unpow2N/A
lower-*.f6469.5
Applied rewrites69.5%
lift-*.f64N/A
count-2-revN/A
lower-+.f6469.5
Applied rewrites69.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6478.9
Applied rewrites78.9%
if 1.69999999999999997e100 < s Initial program 54.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6452.2
lift-pow.f64N/A
unpow2N/A
lower-*.f6452.2
Applied rewrites52.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6452.2
Applied rewrites52.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6491.5
Applied rewrites91.5%
Taylor expanded in x around 0
Applied rewrites81.0%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* (* c_m s) x)))
(if (<= x 4.9e-188)
(/ (fma -2.0 (* x x) 1.0) (* (* (pow (* s x) 2.0) c_m) c_m))
(/ 1.0 (* t_0 t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = (c_m * s) * x;
double tmp;
if (x <= 4.9e-188) {
tmp = fma(-2.0, (x * x), 1.0) / ((pow((s * x), 2.0) * c_m) * c_m);
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(Float64(c_m * s) * x) tmp = 0.0 if (x <= 4.9e-188) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(Float64((Float64(s * x) ^ 2.0) * c_m) * c_m)); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[(c$95$m * s), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, 4.9e-188], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[Power[N[(s * x), $MachinePrecision], 2.0], $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\right) \cdot x\\
\mathbf{if}\;x \leq 4.9 \cdot 10^{-188}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{\left({\left(s \cdot x\right)}^{2} \cdot c\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 4.90000000000000004e-188Initial program 65.6%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites53.7%
Applied rewrites64.2%
if 4.90000000000000004e-188 < x Initial program 64.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6466.2
lift-pow.f64N/A
unpow2N/A
lower-*.f6466.2
Applied rewrites66.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6466.2
Applied rewrites66.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6498.3
Applied rewrites98.3%
Taylor expanded in x around 0
Applied rewrites72.3%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ 2.0 (* (* (* (- s) s) c_m) c_m)))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return 2.0 / (((-s * s) * c_m) * c_m);
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = 2.0d0 / (((-s * s) * c_m) * c_m)
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return 2.0 / (((-s * s) * c_m) * c_m);
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return 2.0 / (((-s * s) * c_m) * c_m)
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(2.0 / Float64(Float64(Float64(Float64(-s) * s) * c_m) * c_m)) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = 2.0 / (((-s * s) * c_m) * c_m);
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[(2.0 / N[(N[(N[((-s) * s), $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{2}{\left(\left(\left(-s\right) \cdot s\right) \cdot c\_m\right) \cdot c\_m}
\end{array}
Initial program 65.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites51.3%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites30.0%
Applied rewrites29.4%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ (- 2.0) (* (* s s) (* c_m c_m))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return -2.0 / ((s * s) * (c_m * c_m));
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = -2.0d0 / ((s * s) * (c_m * c_m))
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return -2.0 / ((s * s) * (c_m * c_m));
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return -2.0 / ((s * s) * (c_m * c_m))
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(Float64(-2.0) / Float64(Float64(s * s) * Float64(c_m * c_m))) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = -2.0 / ((s * s) * (c_m * c_m));
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[((-2.0) / N[(N[(s * s), $MachinePrecision] * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{-2}{\left(s \cdot s\right) \cdot \left(c\_m \cdot c\_m\right)}
\end{array}
Initial program 65.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites51.3%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites30.0%
Final simplification30.0%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ (- 2.0) (* (* s c_m) (* s c_m))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return -2.0 / ((s * c_m) * (s * c_m));
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = -2.0d0 / ((s * c_m) * (s * c_m))
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return -2.0 / ((s * c_m) * (s * c_m));
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return -2.0 / ((s * c_m) * (s * c_m))
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(Float64(-2.0) / Float64(Float64(s * c_m) * Float64(s * c_m))) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = -2.0 / ((s * c_m) * (s * c_m));
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[((-2.0) / N[(N[(s * c$95$m), $MachinePrecision] * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{-2}{\left(s \cdot c\_m\right) \cdot \left(s \cdot c\_m\right)}
\end{array}
Initial program 65.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites51.3%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites30.0%
Applied rewrites27.0%
Final simplification27.0%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ -2.0 (* (* (* s c_m) c_m) s)))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return -2.0 / (((s * c_m) * c_m) * s);
}
c_m = private
NOTE: x, c_m, and s 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, c_m, s)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = (-2.0d0) / (((s * c_m) * c_m) * s)
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return -2.0 / (((s * c_m) * c_m) * s);
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return -2.0 / (((s * c_m) * c_m) * s)
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(-2.0 / Float64(Float64(Float64(s * c_m) * c_m) * s)) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = -2.0 / (((s * c_m) * c_m) * s);
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[(-2.0 / N[(N[(N[(s * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{-2}{\left(\left(s \cdot c\_m\right) \cdot c\_m\right) \cdot s}
\end{array}
Initial program 65.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites85.0%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-/r*N/A
Applied rewrites59.5%
Taylor expanded in x around inf
Applied rewrites27.7%
herbie shell --seed 2024350
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))