
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
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(d, h, l, m, d_1)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
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(d, h, l, m, d_1)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l)))
(t_1 (* (pow (* (/ M 2.0) (/ D_m d)) 2.0) 0.5))
(t_2 (- 1.0 (/ (* t_1 h) l)))
(t_3 (pow (/ d h) 0.25)))
(if (<= l -6.8e+189)
(*
(* t_0 (* t_3 t_3))
(- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D_m) (* 2.0 d)) 2.0)) (/ h l))))
(if (<= l -5e-310)
(* (* (sqrt (pow (* h l) -1.0)) (- d)) t_2)
(if (<= l 6.9e-74)
(* (* (/ (sqrt d) (sqrt l)) (sqrt (/ d h))) t_2)
(if (<= l 5.8e+220)
(* t_0 (* (/ (sqrt d) (sqrt h)) (- 1.0 (* (/ h l) t_1))))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d)))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_2 = 1.0 - ((t_1 * h) / l);
double t_3 = pow((d / h), 0.25);
double tmp;
if (l <= -6.8e+189) {
tmp = (t_0 * (t_3 * t_3)) * (1.0 - (((1.0 / 2.0) * pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (sqrt(pow((h * l), -1.0)) * -d) * t_2;
} else if (l <= 6.9e-74) {
tmp = ((sqrt(d) / sqrt(l)) * sqrt((d / h))) * t_2;
} else if (l <= 5.8e+220) {
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_1)));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = (((m / 2.0d0) * (d_m / d)) ** 2.0d0) * 0.5d0
t_2 = 1.0d0 - ((t_1 * h) / l)
t_3 = (d / h) ** 0.25d0
if (l <= (-6.8d+189)) then
tmp = (t_0 * (t_3 * t_3)) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_m) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
else if (l <= (-5d-310)) then
tmp = (sqrt(((h * l) ** (-1.0d0))) * -d) * t_2
else if (l <= 6.9d-74) then
tmp = ((sqrt(d) / sqrt(l)) * sqrt((d / h))) * t_2
else if (l <= 5.8d+220) then
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0d0 - ((h / l) * t_1)))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = Math.sqrt((d / l));
double t_1 = Math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_2 = 1.0 - ((t_1 * h) / l);
double t_3 = Math.pow((d / h), 0.25);
double tmp;
if (l <= -6.8e+189) {
tmp = (t_0 * (t_3 * t_3)) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (Math.sqrt(Math.pow((h * l), -1.0)) * -d) * t_2;
} else if (l <= 6.9e-74) {
tmp = ((Math.sqrt(d) / Math.sqrt(l)) * Math.sqrt((d / h))) * t_2;
} else if (l <= 5.8e+220) {
tmp = t_0 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 - ((h / l) * t_1)));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = math.sqrt((d / l)) t_1 = math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5 t_2 = 1.0 - ((t_1 * h) / l) t_3 = math.pow((d / h), 0.25) tmp = 0 if l <= -6.8e+189: tmp = (t_0 * (t_3 * t_3)) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l))) elif l <= -5e-310: tmp = (math.sqrt(math.pow((h * l), -1.0)) * -d) * t_2 elif l <= 6.9e-74: tmp = ((math.sqrt(d) / math.sqrt(l)) * math.sqrt((d / h))) * t_2 elif l <= 5.8e+220: tmp = t_0 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 - ((h / l) * t_1))) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64((Float64(Float64(M / 2.0) * Float64(D_m / d)) ^ 2.0) * 0.5) t_2 = Float64(1.0 - Float64(Float64(t_1 * h) / l)) t_3 = Float64(d / h) ^ 0.25 tmp = 0.0 if (l <= -6.8e+189) tmp = Float64(Float64(t_0 * Float64(t_3 * t_3)) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D_m) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))); elseif (l <= -5e-310) tmp = Float64(Float64(sqrt((Float64(h * l) ^ -1.0)) * Float64(-d)) * t_2); elseif (l <= 6.9e-74) tmp = Float64(Float64(Float64(sqrt(d) / sqrt(l)) * sqrt(Float64(d / h))) * t_2); elseif (l <= 5.8e+220) tmp = Float64(t_0 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 - Float64(Float64(h / l) * t_1)))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = sqrt((d / l));
t_1 = (((M / 2.0) * (D_m / d)) ^ 2.0) * 0.5;
t_2 = 1.0 - ((t_1 * h) / l);
t_3 = (d / h) ^ 0.25;
tmp = 0.0;
if (l <= -6.8e+189)
tmp = (t_0 * (t_3 * t_3)) * (1.0 - (((1.0 / 2.0) * (((M * D_m) / (2.0 * d)) ^ 2.0)) * (h / l)));
elseif (l <= -5e-310)
tmp = (sqrt(((h * l) ^ -1.0)) * -d) * t_2;
elseif (l <= 6.9e-74)
tmp = ((sqrt(d) / sqrt(l)) * sqrt((d / h))) * t_2;
elseif (l <= 5.8e+220)
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_1)));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[N[(N[(M / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 0.5), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 - N[(N[(t$95$1 * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Power[N[(d / h), $MachinePrecision], 0.25], $MachinePrecision]}, If[LessEqual[l, -6.8e+189], N[(N[(t$95$0 * N[(t$95$3 * t$95$3), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(N[Sqrt[N[Power[N[(h * l), $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * (-d)), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[l, 6.9e-74], N[(N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[l, 5.8e+220], N[(t$95$0 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]]]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := {\left(\frac{M}{2} \cdot \frac{D\_m}{d}\right)}^{2} \cdot 0.5\\
t_2 := 1 - \frac{t\_1 \cdot h}{\ell}\\
t_3 := {\left(\frac{d}{h}\right)}^{0.25}\\
\mathbf{if}\;\ell \leq -6.8 \cdot 10^{+189}:\\
\;\;\;\;\left(t\_0 \cdot \left(t\_3 \cdot t\_3\right)\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D\_m}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(\sqrt{{\left(h \cdot \ell\right)}^{-1}} \cdot \left(-d\right)\right) \cdot t\_2\\
\mathbf{elif}\;\ell \leq 6.9 \cdot 10^{-74}:\\
\;\;\;\;\left(\frac{\sqrt{d}}{\sqrt{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot t\_2\\
\mathbf{elif}\;\ell \leq 5.8 \cdot 10^{+220}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot t\_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if l < -6.79999999999999966e189Initial program 64.0%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6464.0
Applied rewrites64.0%
lift-/.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
metadata-evalN/A
sqr-powN/A
lower-*.f64N/A
metadata-evalN/A
metadata-evalN/A
lower-pow.f64N/A
lift-/.f64N/A
metadata-evalN/A
metadata-evalN/A
lower-pow.f64N/A
lift-/.f6464.1
Applied rewrites64.1%
if -6.79999999999999966e189 < l < -4.999999999999985e-310Initial program 72.2%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6472.2
Applied rewrites72.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites71.4%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
lift-*.f6482.6
Applied rewrites82.6%
if -4.999999999999985e-310 < l < 6.89999999999999981e-74Initial program 73.9%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6473.9
Applied rewrites73.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites79.0%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.1
Applied rewrites90.1%
if 6.89999999999999981e-74 < l < 5.79999999999999983e220Initial program 71.3%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6471.3
Applied rewrites71.3%
Applied rewrites71.3%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6482.7
Applied rewrites82.7%
if 5.79999999999999983e220 < l Initial program 36.3%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6456.0
Applied rewrites56.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6479.9
Applied rewrites79.9%
Final simplification81.6%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(-
1.0
(* (* (/ 1.0 2.0) (pow (/ (* M D_m) (* 2.0 d)) 2.0)) (/ h l))))))
(if (<= t_0 2e+279)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* (* 0.5 (pow (/ (* M D_m) (+ d d)) 2.0)) (/ h l))))
(if (<= t_0 INFINITY)
(* (pow (* h l) -0.5) (- d))
(*
(* -0.125 (/ (* (pow (* D_m M) 2.0) -1.0) d))
(sqrt (/ h (* (* l l) l))))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
double tmp;
if (t_0 <= 2e+279) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (t_0 <= ((double) INFINITY)) {
tmp = pow((h * l), -0.5) * -d;
} else {
tmp = (-0.125 * ((pow((D_m * M), 2.0) * -1.0) / d)) * sqrt((h / ((l * l) * l)));
}
return tmp;
}
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
double tmp;
if (t_0 <= 2e+279) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((0.5 * Math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = Math.pow((h * l), -0.5) * -d;
} else {
tmp = (-0.125 * ((Math.pow((D_m * M), 2.0) * -1.0) / d)) * Math.sqrt((h / ((l * l) * l)));
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l))) tmp = 0 if t_0 <= 2e+279: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((0.5 * math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l))) elif t_0 <= math.inf: tmp = math.pow((h * l), -0.5) * -d else: tmp = (-0.125 * ((math.pow((D_m * M), 2.0) * -1.0) / d)) * math.sqrt((h / ((l * l) * l))) return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D_m) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) tmp = 0.0 if (t_0 <= 2e+279) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.5 * (Float64(Float64(M * D_m) / Float64(d + d)) ^ 2.0)) * Float64(h / l)))); elseif (t_0 <= Inf) tmp = Float64((Float64(h * l) ^ -0.5) * Float64(-d)); else tmp = Float64(Float64(-0.125 * Float64(Float64((Float64(D_m * M) ^ 2.0) * -1.0) / d)) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D_m) / (2.0 * d)) ^ 2.0)) * (h / l)));
tmp = 0.0;
if (t_0 <= 2e+279)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * (((M * D_m) / (d + d)) ^ 2.0)) * (h / l)));
elseif (t_0 <= Inf)
tmp = ((h * l) ^ -0.5) * -d;
else
tmp = (-0.125 * ((((D_m * M) ^ 2.0) * -1.0) / d)) * sqrt((h / ((l * l) * l)));
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e+279], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision], N[(N[(-0.125 * N[(N[(N[Power[N[(D$95$m * M), $MachinePrecision], 2.0], $MachinePrecision] * -1.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D\_m}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{if}\;t\_0 \leq 2 \cdot 10^{+279}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \left(0.5 \cdot {\left(\frac{M \cdot D\_m}{d + d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;{\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-0.125 \cdot \frac{{\left(D\_m \cdot M\right)}^{2} \cdot -1}{d}\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < 2.00000000000000012e279Initial program 90.8%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6490.8
Applied rewrites90.8%
lift-/.f64N/A
metadata-eval90.8
Applied rewrites90.8%
lift-*.f64N/A
count-2-revN/A
lower-+.f6490.8
Applied rewrites90.8%
if 2.00000000000000012e279 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 44.5%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6444.5
lift-/.f64N/A
metadata-eval44.5
Applied rewrites44.5%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval56.8
Applied rewrites56.8%
if +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 0.0%
Taylor expanded in h around -inf
associate-*r*N/A
lower-*.f64N/A
Applied rewrites27.1%
lift-pow.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6427.1
Applied rewrites27.1%
Final simplification75.5%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0)))
(-
1.0
(* (* (/ 1.0 2.0) (pow (/ (* M D_m) (* 2.0 d)) 2.0)) (/ h l)))))
(t_1 (* (/ D_m d) (/ M 2.0))))
(if (<= t_0 2e+279)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* (* 0.5 (* t_1 t_1)) (/ h l))))
(if (<= t_0 INFINITY)
(* (pow (* h l) -0.5) (- d))
(*
(* -0.125 (/ (* (pow (* D_m M) 2.0) -1.0) d))
(sqrt (/ h (* (* l l) l))))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
double t_1 = (D_m / d) * (M / 2.0);
double tmp;
if (t_0 <= 2e+279) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * (t_1 * t_1)) * (h / l)));
} else if (t_0 <= ((double) INFINITY)) {
tmp = pow((h * l), -0.5) * -d;
} else {
tmp = (-0.125 * ((pow((D_m * M), 2.0) * -1.0) / d)) * sqrt((h / ((l * l) * l)));
}
return tmp;
}
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l)));
double t_1 = (D_m / d) * (M / 2.0);
double tmp;
if (t_0 <= 2e+279) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((0.5 * (t_1 * t_1)) * (h / l)));
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = Math.pow((h * l), -0.5) * -d;
} else {
tmp = (-0.125 * ((Math.pow((D_m * M), 2.0) * -1.0) / d)) * Math.sqrt((h / ((l * l) * l)));
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D_m) / (2.0 * d)), 2.0)) * (h / l))) t_1 = (D_m / d) * (M / 2.0) tmp = 0 if t_0 <= 2e+279: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((0.5 * (t_1 * t_1)) * (h / l))) elif t_0 <= math.inf: tmp = math.pow((h * l), -0.5) * -d else: tmp = (-0.125 * ((math.pow((D_m * M), 2.0) * -1.0) / d)) * math.sqrt((h / ((l * l) * l))) return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D_m) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) t_1 = Float64(Float64(D_m / d) * Float64(M / 2.0)) tmp = 0.0 if (t_0 <= 2e+279) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.5 * Float64(t_1 * t_1)) * Float64(h / l)))); elseif (t_0 <= Inf) tmp = Float64((Float64(h * l) ^ -0.5) * Float64(-d)); else tmp = Float64(Float64(-0.125 * Float64(Float64((Float64(D_m * M) ^ 2.0) * -1.0) / d)) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D_m) / (2.0 * d)) ^ 2.0)) * (h / l)));
t_1 = (D_m / d) * (M / 2.0);
tmp = 0.0;
if (t_0 <= 2e+279)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * (t_1 * t_1)) * (h / l)));
elseif (t_0 <= Inf)
tmp = ((h * l) ^ -0.5) * -d;
else
tmp = (-0.125 * ((((D_m * M) ^ 2.0) * -1.0) / d)) * sqrt((h / ((l * l) * l)));
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(D$95$m / d), $MachinePrecision] * N[(M / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e+279], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision], N[(N[(-0.125 * N[(N[(N[Power[N[(D$95$m * M), $MachinePrecision], 2.0], $MachinePrecision] * -1.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D\_m}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
t_1 := \frac{D\_m}{d} \cdot \frac{M}{2}\\
\mathbf{if}\;t\_0 \leq 2 \cdot 10^{+279}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \left(0.5 \cdot \left(t\_1 \cdot t\_1\right)\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;{\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-0.125 \cdot \frac{{\left(D\_m \cdot M\right)}^{2} \cdot -1}{d}\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < 2.00000000000000012e279Initial program 90.8%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6490.8
Applied rewrites90.8%
lift-/.f64N/A
metadata-eval90.8
Applied rewrites90.8%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-timesN/A
unpow2N/A
lower-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f6489.1
Applied rewrites89.1%
if 2.00000000000000012e279 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < +inf.0Initial program 44.5%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6444.5
lift-/.f64N/A
metadata-eval44.5
Applied rewrites44.5%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval56.8
Applied rewrites56.8%
if +inf.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 0.0%
Taylor expanded in h around -inf
associate-*r*N/A
lower-*.f64N/A
Applied rewrites27.1%
lift-pow.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6427.1
Applied rewrites27.1%
Final simplification74.3%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d h)))
(t_1 (sqrt (/ d l)))
(t_2 (* (pow (* (/ M 2.0) (/ D_m d)) 2.0) 0.5))
(t_3 (- 1.0 (/ (* t_2 h) l))))
(if (<= l -6.8e+189)
(*
(* t_1 t_0)
(- 1.0 (* (* 0.5 (pow (/ (* M D_m) (+ d d)) 2.0)) (/ h l))))
(if (<= l -5e-310)
(* (* (sqrt (pow (* h l) -1.0)) (- d)) t_3)
(if (<= l 6.9e-74)
(* (* (/ (sqrt d) (sqrt l)) t_0) t_3)
(if (<= l 5.8e+220)
(* t_1 (* (/ (sqrt d) (sqrt h)) (- 1.0 (* (/ h l) t_2))))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d)))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = sqrt((d / h));
double t_1 = sqrt((d / l));
double t_2 = pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_3 = 1.0 - ((t_2 * h) / l);
double tmp;
if (l <= -6.8e+189) {
tmp = (t_1 * t_0) * (1.0 - ((0.5 * pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (sqrt(pow((h * l), -1.0)) * -d) * t_3;
} else if (l <= 6.9e-74) {
tmp = ((sqrt(d) / sqrt(l)) * t_0) * t_3;
} else if (l <= 5.8e+220) {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_2)));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = sqrt((d / h))
t_1 = sqrt((d / l))
t_2 = (((m / 2.0d0) * (d_m / d)) ** 2.0d0) * 0.5d0
t_3 = 1.0d0 - ((t_2 * h) / l)
if (l <= (-6.8d+189)) then
tmp = (t_1 * t_0) * (1.0d0 - ((0.5d0 * (((m * d_m) / (d + d)) ** 2.0d0)) * (h / l)))
else if (l <= (-5d-310)) then
tmp = (sqrt(((h * l) ** (-1.0d0))) * -d) * t_3
else if (l <= 6.9d-74) then
tmp = ((sqrt(d) / sqrt(l)) * t_0) * t_3
else if (l <= 5.8d+220) then
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0d0 - ((h / l) * t_2)))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = Math.sqrt((d / h));
double t_1 = Math.sqrt((d / l));
double t_2 = Math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_3 = 1.0 - ((t_2 * h) / l);
double tmp;
if (l <= -6.8e+189) {
tmp = (t_1 * t_0) * (1.0 - ((0.5 * Math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (Math.sqrt(Math.pow((h * l), -1.0)) * -d) * t_3;
} else if (l <= 6.9e-74) {
tmp = ((Math.sqrt(d) / Math.sqrt(l)) * t_0) * t_3;
} else if (l <= 5.8e+220) {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 - ((h / l) * t_2)));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = math.sqrt((d / h)) t_1 = math.sqrt((d / l)) t_2 = math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5 t_3 = 1.0 - ((t_2 * h) / l) tmp = 0 if l <= -6.8e+189: tmp = (t_1 * t_0) * (1.0 - ((0.5 * math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l))) elif l <= -5e-310: tmp = (math.sqrt(math.pow((h * l), -1.0)) * -d) * t_3 elif l <= 6.9e-74: tmp = ((math.sqrt(d) / math.sqrt(l)) * t_0) * t_3 elif l <= 5.8e+220: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 - ((h / l) * t_2))) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = sqrt(Float64(d / h)) t_1 = sqrt(Float64(d / l)) t_2 = Float64((Float64(Float64(M / 2.0) * Float64(D_m / d)) ^ 2.0) * 0.5) t_3 = Float64(1.0 - Float64(Float64(t_2 * h) / l)) tmp = 0.0 if (l <= -6.8e+189) tmp = Float64(Float64(t_1 * t_0) * Float64(1.0 - Float64(Float64(0.5 * (Float64(Float64(M * D_m) / Float64(d + d)) ^ 2.0)) * Float64(h / l)))); elseif (l <= -5e-310) tmp = Float64(Float64(sqrt((Float64(h * l) ^ -1.0)) * Float64(-d)) * t_3); elseif (l <= 6.9e-74) tmp = Float64(Float64(Float64(sqrt(d) / sqrt(l)) * t_0) * t_3); elseif (l <= 5.8e+220) tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 - Float64(Float64(h / l) * t_2)))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = sqrt((d / h));
t_1 = sqrt((d / l));
t_2 = (((M / 2.0) * (D_m / d)) ^ 2.0) * 0.5;
t_3 = 1.0 - ((t_2 * h) / l);
tmp = 0.0;
if (l <= -6.8e+189)
tmp = (t_1 * t_0) * (1.0 - ((0.5 * (((M * D_m) / (d + d)) ^ 2.0)) * (h / l)));
elseif (l <= -5e-310)
tmp = (sqrt(((h * l) ^ -1.0)) * -d) * t_3;
elseif (l <= 6.9e-74)
tmp = ((sqrt(d) / sqrt(l)) * t_0) * t_3;
elseif (l <= 5.8e+220)
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_2)));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[N[(N[(M / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 0.5), $MachinePrecision]}, Block[{t$95$3 = N[(1.0 - N[(N[(t$95$2 * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -6.8e+189], N[(N[(t$95$1 * t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(N[Sqrt[N[Power[N[(h * l), $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * (-d)), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[l, 6.9e-74], N[(N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[l, 5.8e+220], N[(t$95$1 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]]]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{h}}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := {\left(\frac{M}{2} \cdot \frac{D\_m}{d}\right)}^{2} \cdot 0.5\\
t_3 := 1 - \frac{t\_2 \cdot h}{\ell}\\
\mathbf{if}\;\ell \leq -6.8 \cdot 10^{+189}:\\
\;\;\;\;\left(t\_1 \cdot t\_0\right) \cdot \left(1 - \left(0.5 \cdot {\left(\frac{M \cdot D\_m}{d + d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(\sqrt{{\left(h \cdot \ell\right)}^{-1}} \cdot \left(-d\right)\right) \cdot t\_3\\
\mathbf{elif}\;\ell \leq 6.9 \cdot 10^{-74}:\\
\;\;\;\;\left(\frac{\sqrt{d}}{\sqrt{\ell}} \cdot t\_0\right) \cdot t\_3\\
\mathbf{elif}\;\ell \leq 5.8 \cdot 10^{+220}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot t\_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if l < -6.79999999999999966e189Initial program 64.0%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6464.0
Applied rewrites64.0%
lift-/.f64N/A
metadata-eval64.0
Applied rewrites64.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f6464.0
Applied rewrites64.0%
if -6.79999999999999966e189 < l < -4.999999999999985e-310Initial program 72.2%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6472.2
Applied rewrites72.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites71.4%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
associate-*r*N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
lift-*.f6482.6
Applied rewrites82.6%
if -4.999999999999985e-310 < l < 6.89999999999999981e-74Initial program 73.9%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6473.9
Applied rewrites73.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites79.0%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.1
Applied rewrites90.1%
if 6.89999999999999981e-74 < l < 5.79999999999999983e220Initial program 71.3%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6471.3
Applied rewrites71.3%
Applied rewrites71.3%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6482.7
Applied rewrites82.7%
if 5.79999999999999983e220 < l Initial program 36.3%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6456.0
Applied rewrites56.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6479.9
Applied rewrites79.9%
Final simplification81.6%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (* (pow (* (/ M 2.0) (/ D_m d)) 2.0) 0.5))
(t_1 (sqrt (/ d l)))
(t_2 (* (/ D_m d) (/ M 2.0)))
(t_3 (sqrt (/ d h))))
(if (<= l -5e+188)
(*
(* t_1 t_3)
(- 1.0 (* (* 0.5 (pow (/ (* M D_m) (+ d d)) 2.0)) (/ h l))))
(if (<= l -5e-310)
(*
(* (pow (* h l) -0.5) (- d))
(- 1.0 (* (* (/ 1.0 2.0) (* t_2 t_2)) (/ h l))))
(if (<= l 6.9e-74)
(* (* (/ (sqrt d) (sqrt l)) t_3) (- 1.0 (/ (* t_0 h) l)))
(if (<= l 5.8e+220)
(* t_1 (* (/ (sqrt d) (sqrt h)) (- 1.0 (* (/ h l) t_0))))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d)))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_1 = sqrt((d / l));
double t_2 = (D_m / d) * (M / 2.0);
double t_3 = sqrt((d / h));
double tmp;
if (l <= -5e+188) {
tmp = (t_1 * t_3) * (1.0 - ((0.5 * pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
} else if (l <= 6.9e-74) {
tmp = ((sqrt(d) / sqrt(l)) * t_3) * (1.0 - ((t_0 * h) / l));
} else if (l <= 5.8e+220) {
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_0)));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_0 = (((m / 2.0d0) * (d_m / d)) ** 2.0d0) * 0.5d0
t_1 = sqrt((d / l))
t_2 = (d_m / d) * (m / 2.0d0)
t_3 = sqrt((d / h))
if (l <= (-5d+188)) then
tmp = (t_1 * t_3) * (1.0d0 - ((0.5d0 * (((m * d_m) / (d + d)) ** 2.0d0)) * (h / l)))
else if (l <= (-5d-310)) then
tmp = (((h * l) ** (-0.5d0)) * -d) * (1.0d0 - (((1.0d0 / 2.0d0) * (t_2 * t_2)) * (h / l)))
else if (l <= 6.9d-74) then
tmp = ((sqrt(d) / sqrt(l)) * t_3) * (1.0d0 - ((t_0 * h) / l))
else if (l <= 5.8d+220) then
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0d0 - ((h / l) * t_0)))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = Math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5;
double t_1 = Math.sqrt((d / l));
double t_2 = (D_m / d) * (M / 2.0);
double t_3 = Math.sqrt((d / h));
double tmp;
if (l <= -5e+188) {
tmp = (t_1 * t_3) * (1.0 - ((0.5 * Math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (Math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
} else if (l <= 6.9e-74) {
tmp = ((Math.sqrt(d) / Math.sqrt(l)) * t_3) * (1.0 - ((t_0 * h) / l));
} else if (l <= 5.8e+220) {
tmp = t_1 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 - ((h / l) * t_0)));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5 t_1 = math.sqrt((d / l)) t_2 = (D_m / d) * (M / 2.0) t_3 = math.sqrt((d / h)) tmp = 0 if l <= -5e+188: tmp = (t_1 * t_3) * (1.0 - ((0.5 * math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l))) elif l <= -5e-310: tmp = (math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l))) elif l <= 6.9e-74: tmp = ((math.sqrt(d) / math.sqrt(l)) * t_3) * (1.0 - ((t_0 * h) / l)) elif l <= 5.8e+220: tmp = t_1 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 - ((h / l) * t_0))) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = Float64((Float64(Float64(M / 2.0) * Float64(D_m / d)) ^ 2.0) * 0.5) t_1 = sqrt(Float64(d / l)) t_2 = Float64(Float64(D_m / d) * Float64(M / 2.0)) t_3 = sqrt(Float64(d / h)) tmp = 0.0 if (l <= -5e+188) tmp = Float64(Float64(t_1 * t_3) * Float64(1.0 - Float64(Float64(0.5 * (Float64(Float64(M * D_m) / Float64(d + d)) ^ 2.0)) * Float64(h / l)))); elseif (l <= -5e-310) tmp = Float64(Float64((Float64(h * l) ^ -0.5) * Float64(-d)) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * Float64(t_2 * t_2)) * Float64(h / l)))); elseif (l <= 6.9e-74) tmp = Float64(Float64(Float64(sqrt(d) / sqrt(l)) * t_3) * Float64(1.0 - Float64(Float64(t_0 * h) / l))); elseif (l <= 5.8e+220) tmp = Float64(t_1 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 - Float64(Float64(h / l) * t_0)))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = (((M / 2.0) * (D_m / d)) ^ 2.0) * 0.5;
t_1 = sqrt((d / l));
t_2 = (D_m / d) * (M / 2.0);
t_3 = sqrt((d / h));
tmp = 0.0;
if (l <= -5e+188)
tmp = (t_1 * t_3) * (1.0 - ((0.5 * (((M * D_m) / (d + d)) ^ 2.0)) * (h / l)));
elseif (l <= -5e-310)
tmp = (((h * l) ^ -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
elseif (l <= 6.9e-74)
tmp = ((sqrt(d) / sqrt(l)) * t_3) * (1.0 - ((t_0 * h) / l));
elseif (l <= 5.8e+220)
tmp = t_1 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * t_0)));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[(N[Power[N[(N[(M / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 0.5), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(D$95$m / d), $MachinePrecision] * N[(M / 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -5e+188], N[(N[(t$95$1 * t$95$3), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[(t$95$2 * t$95$2), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.9e-74], N[(N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(1.0 - N[(N[(t$95$0 * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.8e+220], N[(t$95$1 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]]]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := {\left(\frac{M}{2} \cdot \frac{D\_m}{d}\right)}^{2} \cdot 0.5\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := \frac{D\_m}{d} \cdot \frac{M}{2}\\
t_3 := \sqrt{\frac{d}{h}}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{+188}:\\
\;\;\;\;\left(t\_1 \cdot t\_3\right) \cdot \left(1 - \left(0.5 \cdot {\left(\frac{M \cdot D\_m}{d + d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left({\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\right) \cdot \left(1 - \left(\frac{1}{2} \cdot \left(t\_2 \cdot t\_2\right)\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 6.9 \cdot 10^{-74}:\\
\;\;\;\;\left(\frac{\sqrt{d}}{\sqrt{\ell}} \cdot t\_3\right) \cdot \left(1 - \frac{t\_0 \cdot h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 5.8 \cdot 10^{+220}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot t\_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if l < -5.0000000000000001e188Initial program 64.0%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6464.0
Applied rewrites64.0%
lift-/.f64N/A
metadata-eval64.0
Applied rewrites64.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f6464.0
Applied rewrites64.0%
if -5.0000000000000001e188 < l < -4.999999999999985e-310Initial program 72.2%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6463.8
lift-/.f64N/A
metadata-eval63.8
Applied rewrites63.8%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval82.4
Applied rewrites82.4%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-timesN/A
unpow2N/A
lower-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f6481.5
Applied rewrites81.5%
if -4.999999999999985e-310 < l < 6.89999999999999981e-74Initial program 73.9%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6473.9
Applied rewrites73.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites79.0%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.1
Applied rewrites90.1%
if 6.89999999999999981e-74 < l < 5.79999999999999983e220Initial program 71.3%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6471.3
Applied rewrites71.3%
Applied rewrites71.3%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6482.7
Applied rewrites82.7%
if 5.79999999999999983e220 < l Initial program 36.3%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6456.0
Applied rewrites56.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6479.9
Applied rewrites79.9%
Final simplification81.1%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))) (t_1 (* (/ D_m d) (/ M 2.0))))
(if (<= l -5e+188)
(*
(* t_0 (sqrt (/ d h)))
(- 1.0 (* (* 0.5 (pow (/ (* M D_m) (+ d d)) 2.0)) (/ h l))))
(if (<= l -5e-310)
(*
(* (pow (* h l) -0.5) (- d))
(- 1.0 (* (* (/ 1.0 2.0) (* t_1 t_1)) (/ h l))))
(if (<= l 5.8e+220)
(*
t_0
(*
(/ (sqrt d) (sqrt h))
(- 1.0 (* (/ h l) (* (pow (* (/ M 2.0) (/ D_m d)) 2.0) 0.5)))))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d))))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = sqrt((d / l));
double t_1 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= -5e+188) {
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.5 * pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_1 * t_1)) * (h / l)));
} else if (l <= 5.8e+220) {
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * (pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5))));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((d / l))
t_1 = (d_m / d) * (m / 2.0d0)
if (l <= (-5d+188)) then
tmp = (t_0 * sqrt((d / h))) * (1.0d0 - ((0.5d0 * (((m * d_m) / (d + d)) ** 2.0d0)) * (h / l)))
else if (l <= (-5d-310)) then
tmp = (((h * l) ** (-0.5d0)) * -d) * (1.0d0 - (((1.0d0 / 2.0d0) * (t_1 * t_1)) * (h / l)))
else if (l <= 5.8d+220) then
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0d0 - ((h / l) * ((((m / 2.0d0) * (d_m / d)) ** 2.0d0) * 0.5d0))))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = Math.sqrt((d / l));
double t_1 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= -5e+188) {
tmp = (t_0 * Math.sqrt((d / h))) * (1.0 - ((0.5 * Math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l)));
} else if (l <= -5e-310) {
tmp = (Math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_1 * t_1)) * (h / l)));
} else if (l <= 5.8e+220) {
tmp = t_0 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 - ((h / l) * (Math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5))));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = math.sqrt((d / l)) t_1 = (D_m / d) * (M / 2.0) tmp = 0 if l <= -5e+188: tmp = (t_0 * math.sqrt((d / h))) * (1.0 - ((0.5 * math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l))) elif l <= -5e-310: tmp = (math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_1 * t_1)) * (h / l))) elif l <= 5.8e+220: tmp = t_0 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 - ((h / l) * (math.pow(((M / 2.0) * (D_m / d)), 2.0) * 0.5)))) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = sqrt(Float64(d / l)) t_1 = Float64(Float64(D_m / d) * Float64(M / 2.0)) tmp = 0.0 if (l <= -5e+188) tmp = Float64(Float64(t_0 * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.5 * (Float64(Float64(M * D_m) / Float64(d + d)) ^ 2.0)) * Float64(h / l)))); elseif (l <= -5e-310) tmp = Float64(Float64((Float64(h * l) ^ -0.5) * Float64(-d)) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * Float64(t_1 * t_1)) * Float64(h / l)))); elseif (l <= 5.8e+220) tmp = Float64(t_0 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 - Float64(Float64(h / l) * Float64((Float64(Float64(M / 2.0) * Float64(D_m / d)) ^ 2.0) * 0.5))))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = sqrt((d / l));
t_1 = (D_m / d) * (M / 2.0);
tmp = 0.0;
if (l <= -5e+188)
tmp = (t_0 * sqrt((d / h))) * (1.0 - ((0.5 * (((M * D_m) / (d + d)) ^ 2.0)) * (h / l)));
elseif (l <= -5e-310)
tmp = (((h * l) ^ -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_1 * t_1)) * (h / l)));
elseif (l <= 5.8e+220)
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 - ((h / l) * ((((M / 2.0) * (D_m / d)) ^ 2.0) * 0.5))));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(D$95$m / d), $MachinePrecision] * N[(M / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -5e+188], N[(N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.8e+220], N[(t$95$0 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(N[Power[N[(N[(M / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
t_1 := \frac{D\_m}{d} \cdot \frac{M}{2}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{+188}:\\
\;\;\;\;\left(t\_0 \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \left(0.5 \cdot {\left(\frac{M \cdot D\_m}{d + d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left({\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\right) \cdot \left(1 - \left(\frac{1}{2} \cdot \left(t\_1 \cdot t\_1\right)\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 5.8 \cdot 10^{+220}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 - \frac{h}{\ell} \cdot \left({\left(\frac{M}{2} \cdot \frac{D\_m}{d}\right)}^{2} \cdot 0.5\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if l < -5.0000000000000001e188Initial program 64.0%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6464.0
Applied rewrites64.0%
lift-/.f64N/A
metadata-eval64.0
Applied rewrites64.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f6464.0
Applied rewrites64.0%
if -5.0000000000000001e188 < l < -4.999999999999985e-310Initial program 72.2%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6463.8
lift-/.f64N/A
metadata-eval63.8
Applied rewrites63.8%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval82.4
Applied rewrites82.4%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-timesN/A
unpow2N/A
lower-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f6481.5
Applied rewrites81.5%
if -4.999999999999985e-310 < l < 5.79999999999999983e220Initial program 72.4%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6472.4
Applied rewrites72.4%
Applied rewrites72.4%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6480.1
Applied rewrites80.1%
if 5.79999999999999983e220 < l Initial program 36.3%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6456.0
Applied rewrites56.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6479.9
Applied rewrites79.9%
Final simplification78.9%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (- 1.0 (* (* 0.5 (pow (/ (* M D_m) (+ d d)) 2.0)) (/ h l))))
(t_1 (sqrt (/ d l)))
(t_2 (* (/ D_m d) (/ M 2.0))))
(if (<= l -5e+188)
(* (* t_1 (sqrt (/ d h))) t_0)
(if (<= l -5e-310)
(*
(* (pow (* h l) -0.5) (- d))
(- 1.0 (* (* (/ 1.0 2.0) (* t_2 t_2)) (/ h l))))
(* (* t_1 (/ (sqrt d) (sqrt h))) t_0)))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = 1.0 - ((0.5 * pow(((M * D_m) / (d + d)), 2.0)) * (h / l));
double t_1 = sqrt((d / l));
double t_2 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= -5e+188) {
tmp = (t_1 * sqrt((d / h))) * t_0;
} else if (l <= -5e-310) {
tmp = (pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
} else {
tmp = (t_1 * (sqrt(d) / sqrt(h))) * t_0;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = 1.0d0 - ((0.5d0 * (((m * d_m) / (d + d)) ** 2.0d0)) * (h / l))
t_1 = sqrt((d / l))
t_2 = (d_m / d) * (m / 2.0d0)
if (l <= (-5d+188)) then
tmp = (t_1 * sqrt((d / h))) * t_0
else if (l <= (-5d-310)) then
tmp = (((h * l) ** (-0.5d0)) * -d) * (1.0d0 - (((1.0d0 / 2.0d0) * (t_2 * t_2)) * (h / l)))
else
tmp = (t_1 * (sqrt(d) / sqrt(h))) * t_0
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = 1.0 - ((0.5 * Math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l));
double t_1 = Math.sqrt((d / l));
double t_2 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= -5e+188) {
tmp = (t_1 * Math.sqrt((d / h))) * t_0;
} else if (l <= -5e-310) {
tmp = (Math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
} else {
tmp = (t_1 * (Math.sqrt(d) / Math.sqrt(h))) * t_0;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = 1.0 - ((0.5 * math.pow(((M * D_m) / (d + d)), 2.0)) * (h / l)) t_1 = math.sqrt((d / l)) t_2 = (D_m / d) * (M / 2.0) tmp = 0 if l <= -5e+188: tmp = (t_1 * math.sqrt((d / h))) * t_0 elif l <= -5e-310: tmp = (math.pow((h * l), -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l))) else: tmp = (t_1 * (math.sqrt(d) / math.sqrt(h))) * t_0 return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = Float64(1.0 - Float64(Float64(0.5 * (Float64(Float64(M * D_m) / Float64(d + d)) ^ 2.0)) * Float64(h / l))) t_1 = sqrt(Float64(d / l)) t_2 = Float64(Float64(D_m / d) * Float64(M / 2.0)) tmp = 0.0 if (l <= -5e+188) tmp = Float64(Float64(t_1 * sqrt(Float64(d / h))) * t_0); elseif (l <= -5e-310) tmp = Float64(Float64((Float64(h * l) ^ -0.5) * Float64(-d)) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * Float64(t_2 * t_2)) * Float64(h / l)))); else tmp = Float64(Float64(t_1 * Float64(sqrt(d) / sqrt(h))) * t_0); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = 1.0 - ((0.5 * (((M * D_m) / (d + d)) ^ 2.0)) * (h / l));
t_1 = sqrt((d / l));
t_2 = (D_m / d) * (M / 2.0);
tmp = 0.0;
if (l <= -5e+188)
tmp = (t_1 * sqrt((d / h))) * t_0;
elseif (l <= -5e-310)
tmp = (((h * l) ^ -0.5) * -d) * (1.0 - (((1.0 / 2.0) * (t_2 * t_2)) * (h / l)));
else
tmp = (t_1 * (sqrt(d) / sqrt(h))) * t_0;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[(1.0 - N[(N[(0.5 * N[Power[N[(N[(M * D$95$m), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(D$95$m / d), $MachinePrecision] * N[(M / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -5e+188], N[(N[(t$95$1 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[(t$95$2 * t$95$2), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]]]]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := 1 - \left(0.5 \cdot {\left(\frac{M \cdot D\_m}{d + d}\right)}^{2}\right) \cdot \frac{h}{\ell}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
t_2 := \frac{D\_m}{d} \cdot \frac{M}{2}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{+188}:\\
\;\;\;\;\left(t\_1 \cdot \sqrt{\frac{d}{h}}\right) \cdot t\_0\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left({\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\right) \cdot \left(1 - \left(\frac{1}{2} \cdot \left(t\_2 \cdot t\_2\right)\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right) \cdot t\_0\\
\end{array}
\end{array}
if l < -5.0000000000000001e188Initial program 64.0%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6464.0
Applied rewrites64.0%
lift-/.f64N/A
metadata-eval64.0
Applied rewrites64.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f6464.0
Applied rewrites64.0%
if -5.0000000000000001e188 < l < -4.999999999999985e-310Initial program 72.2%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6463.8
lift-/.f64N/A
metadata-eval63.8
Applied rewrites63.8%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval82.4
Applied rewrites82.4%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-timesN/A
unpow2N/A
lower-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f6481.5
Applied rewrites81.5%
if -4.999999999999985e-310 < l Initial program 67.6%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6467.6
Applied rewrites67.6%
lift-/.f64N/A
metadata-eval67.6
Applied rewrites67.6%
lift-*.f64N/A
count-2-revN/A
lower-+.f6467.6
Applied rewrites67.6%
lift-/.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6475.0
Applied rewrites75.0%
Final simplification76.6%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(let* ((t_0 (* (/ D_m d) (/ M 2.0))))
(if (<= l 1.15e+219)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (* (* 0.5 (* t_0 t_0)) (/ h l))))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double t_0 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= 1.15e+219) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * (t_0 * t_0)) * (h / l)));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (d_m / d) * (m / 2.0d0)
if (l <= 1.15d+219) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - ((0.5d0 * (t_0 * t_0)) * (h / l)))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double t_0 = (D_m / d) * (M / 2.0);
double tmp;
if (l <= 1.15e+219) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((0.5 * (t_0 * t_0)) * (h / l)));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): t_0 = (D_m / d) * (M / 2.0) tmp = 0 if l <= 1.15e+219: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((0.5 * (t_0 * t_0)) * (h / l))) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) t_0 = Float64(Float64(D_m / d) * Float64(M / 2.0)) tmp = 0.0 if (l <= 1.15e+219) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(0.5 * Float64(t_0 * t_0)) * Float64(h / l)))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
t_0 = (D_m / d) * (M / 2.0);
tmp = 0.0;
if (l <= 1.15e+219)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((0.5 * (t_0 * t_0)) * (h / l)));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D$95$m_] := Block[{t$95$0 = N[(N[(D$95$m / d), $MachinePrecision] * N[(M / 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 1.15e+219], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(0.5 * N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{D\_m}{d} \cdot \frac{M}{2}\\
\mathbf{if}\;\ell \leq 1.15 \cdot 10^{+219}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \left(0.5 \cdot \left(t\_0 \cdot t\_0\right)\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if l < 1.15e219Initial program 71.3%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6471.3
Applied rewrites71.3%
lift-/.f64N/A
metadata-eval71.3
Applied rewrites71.3%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
frac-timesN/A
unpow2N/A
lower-*.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f6470.5
Applied rewrites70.5%
if 1.15e219 < l Initial program 36.3%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6456.0
Applied rewrites56.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6479.9
Applied rewrites79.9%
D_m = (fabs.f64 D)
NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M D_m)
:precision binary64
(if (<= d -1.9e+148)
(* (pow (* h l) -0.5) (- d))
(if (<= d 3.25e-243)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(* (/ 1.0 (* (sqrt h) (sqrt l))) d))))D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= -1.9e+148) {
tmp = pow((h * l), -0.5) * -d;
} else if (d <= 3.25e-243) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-1.9d+148)) then
tmp = ((h * l) ** (-0.5d0)) * -d
else if (d <= 3.25d-243) then
tmp = sqrt((d / l)) * sqrt((d / h))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= -1.9e+148) {
tmp = Math.pow((h * l), -0.5) * -d;
} else if (d <= 3.25e-243) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): tmp = 0 if d <= -1.9e+148: tmp = math.pow((h * l), -0.5) * -d elif d <= 3.25e-243: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) tmp = 0.0 if (d <= -1.9e+148) tmp = Float64((Float64(h * l) ^ -0.5) * Float64(-d)); elseif (d <= 3.25e-243) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
tmp = 0.0;
if (d <= -1.9e+148)
tmp = ((h * l) ^ -0.5) * -d;
elseif (d <= 3.25e-243)
tmp = sqrt((d / l)) * sqrt((d / h));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := If[LessEqual[d, -1.9e+148], N[(N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision] * (-d)), $MachinePrecision], If[LessEqual[d, 3.25e-243], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -1.9 \cdot 10^{+148}:\\
\;\;\;\;{\left(h \cdot \ell\right)}^{-0.5} \cdot \left(-d\right)\\
\mathbf{elif}\;d \leq 3.25 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if d < -1.8999999999999999e148Initial program 69.6%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6465.2
lift-/.f64N/A
metadata-eval65.2
Applied rewrites65.2%
Taylor expanded in d around -inf
metadata-evalN/A
pow-prod-downN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow-1N/A
sqrt-pow1N/A
*-commutativeN/A
lower-pow.f64N/A
lower-*.f64N/A
metadata-eval66.0
Applied rewrites66.0%
if -1.8999999999999999e148 < d < 3.25000000000000021e-243Initial program 67.3%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6467.3
Applied rewrites67.3%
Applied rewrites65.4%
Taylor expanded in d around inf
lift-sqrt.f64N/A
lift-/.f6437.1
Applied rewrites37.1%
if 3.25000000000000021e-243 < d Initial program 71.1%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6445.1
Applied rewrites45.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6445.8
Applied rewrites45.8%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6456.2
Applied rewrites56.2%
Final simplification49.7%
D_m = (fabs.f64 D) NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M D_m) :precision binary64 (if (<= d 3.25e-243) (* (sqrt (/ d l)) (sqrt (/ d h))) (* (/ 1.0 (* (sqrt h) (sqrt l))) d)))
D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 3.25e-243) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 3.25d-243) then
tmp = sqrt((d / l)) * sqrt((d / h))
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 3.25e-243) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): tmp = 0 if d <= 3.25e-243: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) tmp = 0.0 if (d <= 3.25e-243) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
tmp = 0.0;
if (d <= 3.25e-243)
tmp = sqrt((d / l)) * sqrt((d / h));
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := If[LessEqual[d, 3.25e-243], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 3.25 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if d < 3.25000000000000021e-243Initial program 67.9%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6467.9
Applied rewrites67.9%
Applied rewrites65.9%
Taylor expanded in d around inf
lift-sqrt.f64N/A
lift-/.f6439.4
Applied rewrites39.4%
if 3.25000000000000021e-243 < d Initial program 71.1%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6445.1
Applied rewrites45.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6445.8
Applied rewrites45.8%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6456.2
Applied rewrites56.2%
D_m = (fabs.f64 D) NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M D_m) :precision binary64 (if (<= d 3.25e-243) (* (sqrt (* (/ d l) (/ d h))) 1.0) (* (/ 1.0 (* (sqrt h) (sqrt l))) d)))
D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 3.25e-243) {
tmp = sqrt(((d / l) * (d / h))) * 1.0;
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 3.25d-243) then
tmp = sqrt(((d / l) * (d / h))) * 1.0d0
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 3.25e-243) {
tmp = Math.sqrt(((d / l) * (d / h))) * 1.0;
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): tmp = 0 if d <= 3.25e-243: tmp = math.sqrt(((d / l) * (d / h))) * 1.0 else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) tmp = 0.0 if (d <= 3.25e-243) tmp = Float64(sqrt(Float64(Float64(d / l) * Float64(d / h))) * 1.0); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
tmp = 0.0;
if (d <= 3.25e-243)
tmp = sqrt(((d / l) * (d / h))) * 1.0;
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := If[LessEqual[d, 3.25e-243], N[(N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 3.25 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{\frac{d}{\ell} \cdot \frac{d}{h}} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if d < 3.25000000000000021e-243Initial program 67.9%
lift-*.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
lift-/.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6460.6
lift-/.f64N/A
metadata-eval60.6
Applied rewrites60.6%
Taylor expanded in d around inf
Applied rewrites34.8%
lift-pow.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
unpow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-/.f64N/A
lift-/.f6434.8
Applied rewrites34.8%
if 3.25000000000000021e-243 < d Initial program 71.1%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6445.1
Applied rewrites45.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6445.8
Applied rewrites45.8%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6456.2
Applied rewrites56.2%
D_m = (fabs.f64 D) NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M D_m) :precision binary64 (if (<= d 5e-199) (* (sqrt (/ 1.0 (* h l))) d) (* (/ 1.0 (* (sqrt h) (sqrt l))) d)))
D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 5e-199) {
tmp = sqrt((1.0 / (h * l))) * d;
} else {
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
}
return tmp;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= 5d-199) then
tmp = sqrt((1.0d0 / (h * l))) * d
else
tmp = (1.0d0 / (sqrt(h) * sqrt(l))) * d
end if
code = tmp
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
double tmp;
if (d <= 5e-199) {
tmp = Math.sqrt((1.0 / (h * l))) * d;
} else {
tmp = (1.0 / (Math.sqrt(h) * Math.sqrt(l))) * d;
}
return tmp;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): tmp = 0 if d <= 5e-199: tmp = math.sqrt((1.0 / (h * l))) * d else: tmp = (1.0 / (math.sqrt(h) * math.sqrt(l))) * d return tmp
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) tmp = 0.0 if (d <= 5e-199) tmp = Float64(sqrt(Float64(1.0 / Float64(h * l))) * d); else tmp = Float64(Float64(1.0 / Float64(sqrt(h) * sqrt(l))) * d); end return tmp end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp_2 = code(d, h, l, M, D_m)
tmp = 0.0;
if (d <= 5e-199)
tmp = sqrt((1.0 / (h * l))) * d;
else
tmp = (1.0 / (sqrt(h) * sqrt(l))) * d;
end
tmp_2 = tmp;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := If[LessEqual[d, 5e-199], N[(N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq 5 \cdot 10^{-199}:\\
\;\;\;\;\sqrt{\frac{1}{h \cdot \ell}} \cdot d\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{h} \cdot \sqrt{\ell}} \cdot d\\
\end{array}
\end{array}
if d < 4.9999999999999996e-199Initial program 67.2%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6410.8
Applied rewrites10.8%
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f6410.8
Applied rewrites10.8%
if 4.9999999999999996e-199 < d Initial program 72.5%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6444.9
Applied rewrites44.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6445.7
Applied rewrites45.7%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6457.2
Applied rewrites57.2%
D_m = (fabs.f64 D) NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M D_m) :precision binary64 (* (/ 1.0 (sqrt (* h l))) d))
D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
return (1.0 / sqrt((h * l))) * d;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
code = (1.0d0 / sqrt((h * l))) * d
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
return (1.0 / Math.sqrt((h * l))) * d;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): return (1.0 / math.sqrt((h * l))) * d
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) return Float64(Float64(1.0 / sqrt(Float64(h * l))) * d) end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp = code(d, h, l, M, D_m)
tmp = (1.0 / sqrt((h * l))) * d;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := N[(N[(1.0 / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\frac{1}{\sqrt{h \cdot \ell}} \cdot d
\end{array}
Initial program 69.2%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6423.9
Applied rewrites23.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f6424.2
Applied rewrites24.2%
D_m = (fabs.f64 D) NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M D_m) :precision binary64 (* (sqrt (/ 1.0 (* h l))) d))
D_m = fabs(D);
assert(d < h && h < l && l < M && M < D_m);
double code(double d, double h, double l, double M, double D_m) {
return sqrt((1.0 / (h * l))) * d;
}
D_m = private
NOTE: d, h, l, M, and D_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(d, h, l, m, d_m)
use fmin_fmax_functions
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_m
code = sqrt((1.0d0 / (h * l))) * d
end function
D_m = Math.abs(D);
assert d < h && h < l && l < M && M < D_m;
public static double code(double d, double h, double l, double M, double D_m) {
return Math.sqrt((1.0 / (h * l))) * d;
}
D_m = math.fabs(D) [d, h, l, M, D_m] = sort([d, h, l, M, D_m]) def code(d, h, l, M, D_m): return math.sqrt((1.0 / (h * l))) * d
D_m = abs(D) d, h, l, M, D_m = sort([d, h, l, M, D_m]) function code(d, h, l, M, D_m) return Float64(sqrt(Float64(1.0 / Float64(h * l))) * d) end
D_m = abs(D);
d, h, l, M, D_m = num2cell(sort([d, h, l, M, D_m])){:}
function tmp = code(d, h, l, M, D_m)
tmp = sqrt((1.0 / (h * l))) * d;
end
D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D$95$m_] := N[(N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]
\begin{array}{l}
D_m = \left|D\right|
\\
[d, h, l, M, D_m] = \mathsf{sort}([d, h, l, M, D_m])\\
\\
\sqrt{\frac{1}{h \cdot \ell}} \cdot d
\end{array}
Initial program 69.2%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
inv-powN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6423.9
Applied rewrites23.9%
lift-*.f64N/A
lift-pow.f64N/A
unpow-1N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f6423.9
Applied rewrites23.9%
herbie shell --seed 2025083
(FPCore (d h l M D)
:name "Henrywood and Agarwal, Equation (12)"
:precision binary64
(* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))