
(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}
Herbie found 24 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}
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (* d (- (sqrt (/ 1.0 (* l h))))))
(t_1 (* M (/ D (+ d d))))
(t_2 (- 1.0 (/ (* (* (* t_1 t_1) 0.5) h) l))))
(if (<= l -4.8e+53)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* t_1 (* (/ (* (* M D) 0.5) (+ d d)) h)) l)))
(if (<= l -5e-310) (* t_0 t_2) (* (- t_0) t_2)))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = d * -sqrt((1.0 / (l * h)));
double t_1 = M * (D / (d + d));
double t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
double tmp;
if (l <= -4.8e+53) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((t_1 * ((((M * D) * 0.5) / (d + d)) * h)) / l));
} else if (l <= -5e-310) {
tmp = t_0 * t_2;
} else {
tmp = -t_0 * t_2;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = d * -sqrt((1.0d0 / (l * h)))
t_1 = m * (d_1 / (d + d))
t_2 = 1.0d0 - ((((t_1 * t_1) * 0.5d0) * h) / l)
if (l <= (-4.8d+53)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - ((t_1 * ((((m * d_1) * 0.5d0) / (d + d)) * h)) / l))
else if (l <= (-5d-310)) then
tmp = t_0 * t_2
else
tmp = -t_0 * t_2
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = d * -Math.sqrt((1.0 / (l * h)));
double t_1 = M * (D / (d + d));
double t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
double tmp;
if (l <= -4.8e+53) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((t_1 * ((((M * D) * 0.5) / (d + d)) * h)) / l));
} else if (l <= -5e-310) {
tmp = t_0 * t_2;
} else {
tmp = -t_0 * t_2;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = d * -math.sqrt((1.0 / (l * h))) t_1 = M * (D / (d + d)) t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l) tmp = 0 if l <= -4.8e+53: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((t_1 * ((((M * D) * 0.5) / (d + d)) * h)) / l)) elif l <= -5e-310: tmp = t_0 * t_2 else: tmp = -t_0 * t_2 return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(l * h))))) t_1 = Float64(M * Float64(D / Float64(d + d))) t_2 = Float64(1.0 - Float64(Float64(Float64(Float64(t_1 * t_1) * 0.5) * h) / l)) tmp = 0.0 if (l <= -4.8e+53) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(t_1 * Float64(Float64(Float64(Float64(M * D) * 0.5) / Float64(d + d)) * h)) / l))); elseif (l <= -5e-310) tmp = Float64(t_0 * t_2); else tmp = Float64(Float64(-t_0) * t_2); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = d * -sqrt((1.0 / (l * h)));
t_1 = M * (D / (d + d));
t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
tmp = 0.0;
if (l <= -4.8e+53)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((t_1 * ((((M * D) * 0.5) / (d + d)) * h)) / l));
elseif (l <= -5e-310)
tmp = t_0 * t_2;
else
tmp = -t_0 * t_2;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(d * (-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]}, Block[{t$95$1 = N[(M * N[(D / N[(d + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 - N[(N[(N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 0.5), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4.8e+53], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(t$95$1 * N[(N[(N[(N[(M * D), $MachinePrecision] * 0.5), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(t$95$0 * t$95$2), $MachinePrecision], N[((-t$95$0) * t$95$2), $MachinePrecision]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := d \cdot \left(-\sqrt{\frac{1}{\ell \cdot h}}\right)\\
t_1 := M \cdot \frac{D}{d + d}\\
t_2 := 1 - \frac{\left(\left(t\_1 \cdot t\_1\right) \cdot 0.5\right) \cdot h}{\ell}\\
\mathbf{if}\;\ell \leq -4.8 \cdot 10^{+53}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{t\_1 \cdot \left(\frac{\left(M \cdot D\right) \cdot 0.5}{d + d} \cdot h\right)}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;t\_0 \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(-t\_0\right) \cdot t\_2\\
\end{array}
\end{array}
if l < -4.8e53Initial program 56.4%
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 rewrites55.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6455.9
Applied rewrites55.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6455.4
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6455.9
Applied rewrites55.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lower-*.f6456.5
Applied rewrites56.5%
if -4.8e53 < l < -4.999999999999985e-310Initial program 72.8%
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 rewrites75.8%
Taylor expanded in h around -inf
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
associate-*l*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6484.8
Applied rewrites84.8%
if -4.999999999999985e-310 < l Initial program 67.1%
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 rewrites68.1%
Taylor expanded in d around -inf
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
mul-1-negN/A
lower-neg.f64N/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
associate-*l*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
Applied rewrites73.8%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (* d (- (sqrt (/ 1.0 (* l h))))))
(t_1 (* M (/ D (+ d d))))
(t_2 (- 1.0 (/ (* (* (* t_1 t_1) 0.5) h) l))))
(if (<= l -4.8e+53)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (/ (* D M) (+ d d)) (* 0.25 (/ (* M D) d))) h) l)))
(if (<= l -5e-310) (* t_0 t_2) (* (- t_0) t_2)))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = d * -sqrt((1.0 / (l * h)));
double t_1 = M * (D / (d + d));
double t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
double tmp;
if (l <= -4.8e+53) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((((D * M) / (d + d)) * (0.25 * ((M * D) / d))) * h) / l));
} else if (l <= -5e-310) {
tmp = t_0 * t_2;
} else {
tmp = -t_0 * t_2;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = d * -sqrt((1.0d0 / (l * h)))
t_1 = m * (d_1 / (d + d))
t_2 = 1.0d0 - ((((t_1 * t_1) * 0.5d0) * h) / l)
if (l <= (-4.8d+53)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (((((d_1 * m) / (d + d)) * (0.25d0 * ((m * d_1) / d))) * h) / l))
else if (l <= (-5d-310)) then
tmp = t_0 * t_2
else
tmp = -t_0 * t_2
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = d * -Math.sqrt((1.0 / (l * h)));
double t_1 = M * (D / (d + d));
double t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
double tmp;
if (l <= -4.8e+53) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (((((D * M) / (d + d)) * (0.25 * ((M * D) / d))) * h) / l));
} else if (l <= -5e-310) {
tmp = t_0 * t_2;
} else {
tmp = -t_0 * t_2;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = d * -math.sqrt((1.0 / (l * h))) t_1 = M * (D / (d + d)) t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l) tmp = 0 if l <= -4.8e+53: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (((((D * M) / (d + d)) * (0.25 * ((M * D) / d))) * h) / l)) elif l <= -5e-310: tmp = t_0 * t_2 else: tmp = -t_0 * t_2 return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(l * h))))) t_1 = Float64(M * Float64(D / Float64(d + d))) t_2 = Float64(1.0 - Float64(Float64(Float64(Float64(t_1 * t_1) * 0.5) * h) / l)) tmp = 0.0 if (l <= -4.8e+53) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(D * M) / Float64(d + d)) * Float64(0.25 * Float64(Float64(M * D) / d))) * h) / l))); elseif (l <= -5e-310) tmp = Float64(t_0 * t_2); else tmp = Float64(Float64(-t_0) * t_2); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = d * -sqrt((1.0 / (l * h)));
t_1 = M * (D / (d + d));
t_2 = 1.0 - ((((t_1 * t_1) * 0.5) * h) / l);
tmp = 0.0;
if (l <= -4.8e+53)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((((D * M) / (d + d)) * (0.25 * ((M * D) / d))) * h) / l));
elseif (l <= -5e-310)
tmp = t_0 * t_2;
else
tmp = -t_0 * t_2;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(d * (-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]}, Block[{t$95$1 = N[(M * N[(D / N[(d + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 - N[(N[(N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 0.5), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4.8e+53], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(D * M), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision] * N[(0.25 * N[(N[(M * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(t$95$0 * t$95$2), $MachinePrecision], N[((-t$95$0) * t$95$2), $MachinePrecision]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := d \cdot \left(-\sqrt{\frac{1}{\ell \cdot h}}\right)\\
t_1 := M \cdot \frac{D}{d + d}\\
t_2 := 1 - \frac{\left(\left(t\_1 \cdot t\_1\right) \cdot 0.5\right) \cdot h}{\ell}\\
\mathbf{if}\;\ell \leq -4.8 \cdot 10^{+53}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\frac{D \cdot M}{d + d} \cdot \left(0.25 \cdot \frac{M \cdot D}{d}\right)\right) \cdot h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;t\_0 \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(-t\_0\right) \cdot t\_2\\
\end{array}
\end{array}
if l < -4.8e53Initial program 56.4%
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 rewrites55.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6455.9
Applied rewrites55.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6455.4
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6455.9
Applied rewrites55.9%
Taylor expanded in d around 0
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.9
Applied rewrites55.9%
if -4.8e53 < l < -4.999999999999985e-310Initial program 72.8%
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 rewrites75.8%
Taylor expanded in h around -inf
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
associate-*l*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6484.8
Applied rewrites84.8%
if -4.999999999999985e-310 < l Initial program 67.1%
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 rewrites68.1%
Taylor expanded in d around -inf
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
mul-1-negN/A
lower-neg.f64N/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
associate-*l*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
Applied rewrites73.8%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (/ (* D M) (+ d d))) (t_1 (* M (/ D (+ d d)))))
(if (<= l -4.8e+53)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* t_0 (* 0.25 (/ (* M D) d))) h) l)))
(if (<= l -5e-310)
(*
(* d (- (sqrt (/ 1.0 (* l h)))))
(- 1.0 (/ (* (* (* t_1 t_1) 0.5) h) l)))
(*
(* (sqrt (/ 1.0 (* h l))) d)
(- 1.0 (/ (* (* t_0 (* t_0 0.5)) h) l)))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double t_1 = M * (D / (d + d));
double tmp;
if (l <= -4.8e+53) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else if (l <= -5e-310) {
tmp = (d * -sqrt((1.0 / (l * h)))) * (1.0 - ((((t_1 * t_1) * 0.5) * h) / l));
} else {
tmp = (sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (d_1 * m) / (d + d)
t_1 = m * (d_1 / (d + d))
if (l <= (-4.8d+53)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (((t_0 * (0.25d0 * ((m * d_1) / d))) * h) / l))
else if (l <= (-5d-310)) then
tmp = (d * -sqrt((1.0d0 / (l * h)))) * (1.0d0 - ((((t_1 * t_1) * 0.5d0) * h) / l))
else
tmp = (sqrt((1.0d0 / (h * l))) * d) * (1.0d0 - (((t_0 * (t_0 * 0.5d0)) * h) / l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double t_1 = M * (D / (d + d));
double tmp;
if (l <= -4.8e+53) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else if (l <= -5e-310) {
tmp = (d * -Math.sqrt((1.0 / (l * h)))) * (1.0 - ((((t_1 * t_1) * 0.5) * h) / l));
} else {
tmp = (Math.sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (D * M) / (d + d) t_1 = M * (D / (d + d)) tmp = 0 if l <= -4.8e+53: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l)) elif l <= -5e-310: tmp = (d * -math.sqrt((1.0 / (l * h)))) * (1.0 - ((((t_1 * t_1) * 0.5) * h) / l)) else: tmp = (math.sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(D * M) / Float64(d + d)) t_1 = Float64(M * Float64(D / Float64(d + d))) tmp = 0.0 if (l <= -4.8e+53) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(t_0 * Float64(0.25 * Float64(Float64(M * D) / d))) * h) / l))); elseif (l <= -5e-310) tmp = Float64(Float64(d * Float64(-sqrt(Float64(1.0 / Float64(l * h))))) * Float64(1.0 - Float64(Float64(Float64(Float64(t_1 * t_1) * 0.5) * h) / l))); else tmp = Float64(Float64(sqrt(Float64(1.0 / Float64(h * l))) * d) * Float64(1.0 - Float64(Float64(Float64(t_0 * Float64(t_0 * 0.5)) * h) / l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (D * M) / (d + d);
t_1 = M * (D / (d + d));
tmp = 0.0;
if (l <= -4.8e+53)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
elseif (l <= -5e-310)
tmp = (d * -sqrt((1.0 / (l * h)))) * (1.0 - ((((t_1 * t_1) * 0.5) * h) / l));
else
tmp = (sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(D * M), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(M * N[(D / N[(d + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4.8e+53], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(t$95$0 * N[(0.25 * N[(N[(M * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * (-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 0.5), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision] * N[(1.0 - N[(N[(N[(t$95$0 * N[(t$95$0 * 0.5), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \frac{D \cdot M}{d + d}\\
t_1 := M \cdot \frac{D}{d + d}\\
\mathbf{if}\;\ell \leq -4.8 \cdot 10^{+53}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(t\_0 \cdot \left(0.25 \cdot \frac{M \cdot D}{d}\right)\right) \cdot h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \left(-\sqrt{\frac{1}{\ell \cdot h}}\right)\right) \cdot \left(1 - \frac{\left(\left(t\_1 \cdot t\_1\right) \cdot 0.5\right) \cdot h}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{\frac{1}{h \cdot \ell}} \cdot d\right) \cdot \left(1 - \frac{\left(t\_0 \cdot \left(t\_0 \cdot 0.5\right)\right) \cdot h}{\ell}\right)\\
\end{array}
\end{array}
if l < -4.8e53Initial program 56.4%
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 rewrites55.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6455.9
Applied rewrites55.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6455.4
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6455.9
Applied rewrites55.9%
Taylor expanded in d around 0
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.9
Applied rewrites55.9%
if -4.8e53 < l < -4.999999999999985e-310Initial program 72.8%
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 rewrites75.8%
Taylor expanded in h around -inf
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
metadata-evalN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
associate-*l*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6484.8
Applied rewrites84.8%
if -4.999999999999985e-310 < l Initial program 67.1%
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 rewrites68.1%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6468.1
Applied rewrites68.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6468.0
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6468.8
Applied rewrites68.8%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6474.4
lift-*.f64N/A
*-commutativeN/A
lift-*.f6474.4
Applied rewrites74.4%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (/ (* D M) (+ d d))))
(if (<= h 1.65e-294)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* t_0 (* 0.25 (/ (* M D) d))) h) l)))
(*
(* (sqrt (/ 1.0 (* h l))) d)
(- 1.0 (/ (* (* t_0 (* t_0 0.5)) h) l))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double tmp;
if (h <= 1.65e-294) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else {
tmp = (sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: tmp
t_0 = (d_1 * m) / (d + d)
if (h <= 1.65d-294) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (((t_0 * (0.25d0 * ((m * d_1) / d))) * h) / l))
else
tmp = (sqrt((1.0d0 / (h * l))) * d) * (1.0d0 - (((t_0 * (t_0 * 0.5d0)) * h) / l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double tmp;
if (h <= 1.65e-294) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else {
tmp = (Math.sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (D * M) / (d + d) tmp = 0 if h <= 1.65e-294: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l)) else: tmp = (math.sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(D * M) / Float64(d + d)) tmp = 0.0 if (h <= 1.65e-294) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(t_0 * Float64(0.25 * Float64(Float64(M * D) / d))) * h) / l))); else tmp = Float64(Float64(sqrt(Float64(1.0 / Float64(h * l))) * d) * Float64(1.0 - Float64(Float64(Float64(t_0 * Float64(t_0 * 0.5)) * h) / l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (D * M) / (d + d);
tmp = 0.0;
if (h <= 1.65e-294)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
else
tmp = (sqrt((1.0 / (h * l))) * d) * (1.0 - (((t_0 * (t_0 * 0.5)) * h) / l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(D * M), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, 1.65e-294], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(t$95$0 * N[(0.25 * N[(N[(M * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision] * N[(1.0 - N[(N[(N[(t$95$0 * N[(t$95$0 * 0.5), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \frac{D \cdot M}{d + d}\\
\mathbf{if}\;h \leq 1.65 \cdot 10^{-294}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(t\_0 \cdot \left(0.25 \cdot \frac{M \cdot D}{d}\right)\right) \cdot h}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{\frac{1}{h \cdot \ell}} \cdot d\right) \cdot \left(1 - \frac{\left(t\_0 \cdot \left(t\_0 \cdot 0.5\right)\right) \cdot h}{\ell}\right)\\
\end{array}
\end{array}
if h < 1.65e-294Initial program 65.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 rewrites67.5%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6467.5
Applied rewrites67.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6467.2
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6467.9
Applied rewrites67.9%
Taylor expanded in d around 0
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6467.9
Applied rewrites67.9%
if 1.65e-294 < h Initial program 67.3%
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 rewrites68.3%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6468.3
Applied rewrites68.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6468.2
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6469.0
Applied rewrites69.0%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6474.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6474.5
Applied rewrites74.5%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(if (<= l 2.2e-111)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (/ (* D M) (+ d d)) (* 0.25 (/ (* M D) d))) h) l)))
(if (<= l 5.4e+102)
(/
(fma
(/ (* (* (* D M) (* D M)) (sqrt (* l h))) d)
-0.125
(* (sqrt (/ (* (* l l) l) h)) d))
(* l l))
(* (/ 1.0 (* (sqrt l) (sqrt h))) d))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 2.2e-111) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((((D * M) / (d + d)) * (0.25 * ((M * D) / d))) * h) / l));
} else if (l <= 5.4e+102) {
tmp = fma(((((D * M) * (D * M)) * sqrt((l * h))) / d), -0.125, (sqrt((((l * l) * l) / h)) * d)) / (l * l);
} else {
tmp = (1.0 / (sqrt(l) * sqrt(h))) * d;
}
return tmp;
}
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (l <= 2.2e-111) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(D * M) / Float64(d + d)) * Float64(0.25 * Float64(Float64(M * D) / d))) * h) / l))); elseif (l <= 5.4e+102) tmp = Float64(fma(Float64(Float64(Float64(Float64(D * M) * Float64(D * M)) * sqrt(Float64(l * h))) / d), -0.125, Float64(sqrt(Float64(Float64(Float64(l * l) * l) / h)) * d)) / Float64(l * l)); else tmp = Float64(Float64(1.0 / Float64(sqrt(l) * sqrt(h))) * d); end return tmp end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[l, 2.2e-111], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(D * M), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision] * N[(0.25 * N[(N[(M * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.4e+102], N[(N[(N[(N[(N[(N[(D * M), $MachinePrecision] * N[(D * M), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.125 + N[(N[Sqrt[N[(N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.2 \cdot 10^{-111}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\frac{D \cdot M}{d + d} \cdot \left(0.25 \cdot \frac{M \cdot D}{d}\right)\right) \cdot h}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 5.4 \cdot 10^{+102}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right) \cdot \sqrt{\ell \cdot h}}{d}, -0.125, \sqrt{\frac{\left(\ell \cdot \ell\right) \cdot \ell}{h}} \cdot d\right)}{\ell \cdot \ell}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\ell} \cdot \sqrt{h}} \cdot d\\
\end{array}
\end{array}
if l < 2.2e-111Initial program 67.7%
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 rewrites69.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6469.9
Applied rewrites69.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6469.6
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6470.4
Applied rewrites70.4%
Taylor expanded in d around 0
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6470.4
Applied rewrites70.4%
if 2.2e-111 < l < 5.4000000000000002e102Initial program 72.3%
Taylor expanded in l around 0
lower-/.f64N/A
Applied rewrites58.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.0
Applied rewrites72.0%
if 5.4000000000000002e102 < l Initial program 56.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6449.3
Applied rewrites49.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6449.2
Applied rewrites49.2%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6463.4
Applied rewrites63.4%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (/ (* D M) (+ d d))))
(if (<= h 1.3e-156)
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* t_0 (* 0.25 (/ (* M D) d))) h) l)))
(*
(- 1.0 (* (* (* (* t_0 (/ D (+ d d))) M) 0.5) (/ h l)))
(* (sqrt (/ 1.0 (* h l))) d)))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double tmp;
if (h <= 1.3e-156) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else {
tmp = (1.0 - ((((t_0 * (D / (d + d))) * M) * 0.5) * (h / l))) * (sqrt((1.0 / (h * l))) * d);
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: tmp
t_0 = (d_1 * m) / (d + d)
if (h <= 1.3d-156) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - (((t_0 * (0.25d0 * ((m * d_1) / d))) * h) / l))
else
tmp = (1.0d0 - ((((t_0 * (d_1 / (d + d))) * m) * 0.5d0) * (h / l))) * (sqrt((1.0d0 / (h * l))) * d)
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (D * M) / (d + d);
double tmp;
if (h <= 1.3e-156) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
} else {
tmp = (1.0 - ((((t_0 * (D / (d + d))) * M) * 0.5) * (h / l))) * (Math.sqrt((1.0 / (h * l))) * d);
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (D * M) / (d + d) tmp = 0 if h <= 1.3e-156: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l)) else: tmp = (1.0 - ((((t_0 * (D / (d + d))) * M) * 0.5) * (h / l))) * (math.sqrt((1.0 / (h * l))) * d) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(D * M) / Float64(d + d)) tmp = 0.0 if (h <= 1.3e-156) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(t_0 * Float64(0.25 * Float64(Float64(M * D) / d))) * h) / l))); else tmp = Float64(Float64(1.0 - Float64(Float64(Float64(Float64(t_0 * Float64(D / Float64(d + d))) * M) * 0.5) * Float64(h / l))) * Float64(sqrt(Float64(1.0 / Float64(h * l))) * d)); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (D * M) / (d + d);
tmp = 0.0;
if (h <= 1.3e-156)
tmp = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - (((t_0 * (0.25 * ((M * D) / d))) * h) / l));
else
tmp = (1.0 - ((((t_0 * (D / (d + d))) * M) * 0.5) * (h / l))) * (sqrt((1.0 / (h * l))) * d);
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(D * M), $MachinePrecision] / N[(d + d), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, 1.3e-156], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(t$95$0 * N[(0.25 * N[(N[(M * D), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(N[(N[(N[(t$95$0 * N[(D / N[(d + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * M), $MachinePrecision] * 0.5), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \frac{D \cdot M}{d + d}\\
\mathbf{if}\;h \leq 1.3 \cdot 10^{-156}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(t\_0 \cdot \left(0.25 \cdot \frac{M \cdot D}{d}\right)\right) \cdot h}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \left(\left(\left(t\_0 \cdot \frac{D}{d + d}\right) \cdot M\right) \cdot 0.5\right) \cdot \frac{h}{\ell}\right) \cdot \left(\sqrt{\frac{1}{h \cdot \ell}} \cdot d\right)\\
\end{array}
\end{array}
if h < 1.3e-156Initial program 66.1%
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 rewrites67.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6467.3
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6468.1
Applied rewrites68.1%
Taylor expanded in d around 0
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.1
Applied rewrites68.1%
if 1.3e-156 < h Initial program 67.4%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.9
Applied rewrites68.9%
Applied rewrites67.4%
Applied rewrites67.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (* (* l l) l))
(t_1
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (* (* (* M M) D) (/ D (* d d))) 0.125) h) l)))))
(if (<= d -6.6e+154)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -8.5e-157)
t_1
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) (sqrt (/ h t_0)))
(if (<= d 1.02e-84)
(/
(fma
(/ (* (* (* D M) (* D M)) (sqrt (* l h))) d)
-0.125
(* (sqrt (/ t_0 h)) d))
(* l l))
(if (<= d 3.8e+145) t_1 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (l * l) * l;
double t_1 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double tmp;
if (d <= -6.6e+154) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_1;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / t_0));
} else if (d <= 1.02e-84) {
tmp = fma(((((D * M) * (D * M)) * sqrt((l * h))) / d), -0.125, (sqrt((t_0 / h)) * d)) / (l * l);
} else if (d <= 3.8e+145) {
tmp = t_1;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(l * l) * l) t_1 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * D) * Float64(D / Float64(d * d))) * 0.125) * h) / l))) tmp = 0.0 if (d <= -6.6e+154) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -8.5e-157) tmp = t_1; elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * sqrt(Float64(h / t_0))); elseif (d <= 1.02e-84) tmp = Float64(fma(Float64(Float64(Float64(Float64(D * M) * Float64(D * M)) * sqrt(Float64(l * h))) / d), -0.125, Float64(sqrt(Float64(t_0 / h)) * d)) / Float64(l * l)); elseif (d <= 3.8e+145) tmp = t_1; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * N[(D / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -6.6e+154], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$1, If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.02e-84], N[(N[(N[(N[(N[(N[(D * M), $MachinePrecision] * N[(D * M), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.125 + N[(N[Sqrt[N[(t$95$0 / h), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.8e+145], t$95$1, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\ell \cdot \ell\right) \cdot \ell\\
t_1 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\left(\left(\left(M \cdot M\right) \cdot D\right) \cdot \frac{D}{d \cdot d}\right) \cdot 0.125\right) \cdot h}{\ell}\right)\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{+154}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{t\_0}}\\
\mathbf{elif}\;d \leq 1.02 \cdot 10^{-84}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right) \cdot \sqrt{\ell \cdot h}}{d}, -0.125, \sqrt{\frac{t\_0}{h}} \cdot d\right)}{\ell \cdot \ell}\\
\mathbf{elif}\;d \leq 3.8 \cdot 10^{+145}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.6e154Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.7
Applied rewrites70.7%
if -6.6e154 < d < -8.49999999999999976e-157 or 1.02000000000000004e-84 < d < 3.80000000000000012e145Initial program 77.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 rewrites79.0%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6479.0
Applied rewrites79.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6479.0
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6479.7
Applied rewrites79.7%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
pow2N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6469.1
Applied rewrites69.1%
if -8.49999999999999976e-157 < d < -2.60000000000000011e-302Initial program 42.9%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites38.6%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6438.6
Applied rewrites38.6%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6442.4
Applied rewrites42.4%
if -2.60000000000000011e-302 < d < 1.02000000000000004e-84Initial program 49.3%
Taylor expanded in l around 0
lower-/.f64N/A
Applied rewrites32.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unswap-sqrN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6440.7
Applied rewrites40.7%
if 3.80000000000000012e145 < d Initial program 74.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6477.2
Applied rewrites77.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (* (* l l) l))
(t_1
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (* (* (* M M) D) (/ D (* d d))) 0.125) h) l)))))
(if (<= d -6.6e+154)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -8.5e-157)
t_1
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) (sqrt (/ h t_0)))
(if (<= d 7.6e-152)
(/
(fma
(/ (* (* M (* M (* D D))) (sqrt (* l h))) d)
-0.125
(* (sqrt (/ t_0 h)) d))
(* l l))
(if (<= d 3.8e+145) t_1 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (l * l) * l;
double t_1 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double tmp;
if (d <= -6.6e+154) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_1;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / t_0));
} else if (d <= 7.6e-152) {
tmp = fma((((M * (M * (D * D))) * sqrt((l * h))) / d), -0.125, (sqrt((t_0 / h)) * d)) / (l * l);
} else if (d <= 3.8e+145) {
tmp = t_1;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(l * l) * l) t_1 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * D) * Float64(D / Float64(d * d))) * 0.125) * h) / l))) tmp = 0.0 if (d <= -6.6e+154) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -8.5e-157) tmp = t_1; elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * sqrt(Float64(h / t_0))); elseif (d <= 7.6e-152) tmp = Float64(fma(Float64(Float64(Float64(M * Float64(M * Float64(D * D))) * sqrt(Float64(l * h))) / d), -0.125, Float64(sqrt(Float64(t_0 / h)) * d)) / Float64(l * l)); elseif (d <= 3.8e+145) tmp = t_1; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * N[(D / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -6.6e+154], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$1, If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 7.6e-152], N[(N[(N[(N[(N[(M * N[(M * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.125 + N[(N[Sqrt[N[(t$95$0 / h), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.8e+145], t$95$1, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\ell \cdot \ell\right) \cdot \ell\\
t_1 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\left(\left(\left(M \cdot M\right) \cdot D\right) \cdot \frac{D}{d \cdot d}\right) \cdot 0.125\right) \cdot h}{\ell}\right)\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{+154}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{t\_0}}\\
\mathbf{elif}\;d \leq 7.6 \cdot 10^{-152}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(M \cdot \left(M \cdot \left(D \cdot D\right)\right)\right) \cdot \sqrt{\ell \cdot h}}{d}, -0.125, \sqrt{\frac{t\_0}{h}} \cdot d\right)}{\ell \cdot \ell}\\
\mathbf{elif}\;d \leq 3.8 \cdot 10^{+145}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.6e154Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.7
Applied rewrites70.7%
if -6.6e154 < d < -8.49999999999999976e-157 or 7.60000000000000024e-152 < d < 3.80000000000000012e145Initial program 75.6%
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 rewrites77.2%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6477.2
Applied rewrites77.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6477.2
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6478.0
Applied rewrites78.0%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
pow2N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6467.6
Applied rewrites67.6%
if -8.49999999999999976e-157 < d < -2.60000000000000011e-302Initial program 42.9%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites38.6%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6438.6
Applied rewrites38.6%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6442.4
Applied rewrites42.4%
if -2.60000000000000011e-302 < d < 7.60000000000000024e-152Initial program 43.1%
Taylor expanded in l around 0
lower-/.f64N/A
Applied rewrites31.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6434.8
Applied rewrites34.8%
if 3.80000000000000012e145 < d Initial program 74.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6477.2
Applied rewrites77.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (* (* (* M M) D) (/ D (* d d))) 0.125) h) l))))
(t_1 (sqrt (/ 1.0 (* l h))))
(t_2 (sqrt (/ h (* (* l l) l)))))
(if (<= d -6.6e+154)
(* (- t_1) d)
(if (<= d -8.5e-157)
t_0
(if (<= d 9.5e-281)
(* (* 0.125 (* (* D D) (* M (/ M d)))) t_2)
(if (<= d 1.05e-84)
(* (fma (* (/ (* (* M (* M D)) D) (* d d)) t_2) -0.125 t_1) d)
(if (<= d 3.8e+145) t_0 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double t_1 = sqrt((1.0 / (l * h)));
double t_2 = sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -6.6e+154) {
tmp = -t_1 * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= 9.5e-281) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_2;
} else if (d <= 1.05e-84) {
tmp = fma(((((M * (M * D)) * D) / (d * d)) * t_2), -0.125, t_1) * d;
} else if (d <= 3.8e+145) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * D) * Float64(D / Float64(d * d))) * 0.125) * h) / l))) t_1 = sqrt(Float64(1.0 / Float64(l * h))) t_2 = sqrt(Float64(h / Float64(Float64(l * l) * l))) tmp = 0.0 if (d <= -6.6e+154) tmp = Float64(Float64(-t_1) * d); elseif (d <= -8.5e-157) tmp = t_0; elseif (d <= 9.5e-281) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * t_2); elseif (d <= 1.05e-84) tmp = Float64(fma(Float64(Float64(Float64(Float64(M * Float64(M * D)) * D) / Float64(d * d)) * t_2), -0.125, t_1) * d); elseif (d <= 3.8e+145) tmp = t_0; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * N[(D / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.6e+154], N[((-t$95$1) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$0, If[LessEqual[d, 9.5e-281], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[d, 1.05e-84], N[(N[(N[(N[(N[(N[(M * N[(M * D), $MachinePrecision]), $MachinePrecision] * D), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] * -0.125 + t$95$1), $MachinePrecision] * d), $MachinePrecision], If[LessEqual[d, 3.8e+145], t$95$0, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\left(\left(\left(M \cdot M\right) \cdot D\right) \cdot \frac{D}{d \cdot d}\right) \cdot 0.125\right) \cdot h}{\ell}\right)\\
t_1 := \sqrt{\frac{1}{\ell \cdot h}}\\
t_2 := \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{+154}:\\
\;\;\;\;\left(-t\_1\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq 9.5 \cdot 10^{-281}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot t\_2\\
\mathbf{elif}\;d \leq 1.05 \cdot 10^{-84}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\left(M \cdot \left(M \cdot D\right)\right) \cdot D}{d \cdot d} \cdot t\_2, -0.125, t\_1\right) \cdot d\\
\mathbf{elif}\;d \leq 3.8 \cdot 10^{+145}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.6e154Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.7
Applied rewrites70.7%
if -6.6e154 < d < -8.49999999999999976e-157 or 1.04999999999999999e-84 < d < 3.80000000000000012e145Initial program 77.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 rewrites79.0%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6479.0
Applied rewrites79.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6479.0
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6479.7
Applied rewrites79.7%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
pow2N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6469.1
Applied rewrites69.1%
if -8.49999999999999976e-157 < d < 9.5000000000000003e-281Initial program 40.0%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites33.5%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6433.5
Applied rewrites33.5%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6436.8
Applied rewrites36.8%
if 9.5000000000000003e-281 < d < 1.04999999999999999e-84Initial program 53.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 rewrites52.3%
Taylor expanded in d around inf
Applied rewrites38.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6441.6
Applied rewrites41.6%
if 3.80000000000000012e145 < d Initial program 74.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6477.2
Applied rewrites77.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (* (* (* M M) D) (/ D (* d d))) 0.125) h) l))))
(t_1 (sqrt (/ 1.0 (* l h)))))
(if (<= d -6.6e+154)
(* (- t_1) d)
(if (<= d -8.5e-157)
t_0
(if (<= d 9.4e-279)
(* (* 0.125 (* (* D D) (* M (/ M d)))) (sqrt (/ h (* (* l l) l))))
(if (<= d 9000000000.0)
(*
(-
1.0
(* (* 0.5 (* M (/ (* 0.25 (* (* D D) M)) (* d d)))) (/ h l)))
(* t_1 d))
(if (<= d 3.8e+145) t_0 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double t_1 = sqrt((1.0 / (l * h)));
double tmp;
if (d <= -6.6e+154) {
tmp = -t_1 * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= 9.4e-279) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
} else if (d <= 9000000000.0) {
tmp = (1.0 - ((0.5 * (M * ((0.25 * ((D * D) * M)) / (d * d)))) * (h / l))) * (t_1 * d);
} else if (d <= 3.8e+145) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - ((((((m * m) * d_1) * (d_1 / (d * d))) * 0.125d0) * h) / l))
t_1 = sqrt((1.0d0 / (l * h)))
if (d <= (-6.6d+154)) then
tmp = -t_1 * d
else if (d <= (-8.5d-157)) then
tmp = t_0
else if (d <= 9.4d-279) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * sqrt((h / ((l * l) * l)))
else if (d <= 9000000000.0d0) then
tmp = (1.0d0 - ((0.5d0 * (m * ((0.25d0 * ((d_1 * d_1) * m)) / (d * d)))) * (h / l))) * (t_1 * d)
else if (d <= 3.8d+145) then
tmp = t_0
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double t_1 = Math.sqrt((1.0 / (l * h)));
double tmp;
if (d <= -6.6e+154) {
tmp = -t_1 * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= 9.4e-279) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * Math.sqrt((h / ((l * l) * l)));
} else if (d <= 9000000000.0) {
tmp = (1.0 - ((0.5 * (M * ((0.25 * ((D * D) * M)) / (d * d)))) * (h / l))) * (t_1 * d);
} else if (d <= 3.8e+145) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l)) t_1 = math.sqrt((1.0 / (l * h))) tmp = 0 if d <= -6.6e+154: tmp = -t_1 * d elif d <= -8.5e-157: tmp = t_0 elif d <= 9.4e-279: tmp = (0.125 * ((D * D) * (M * (M / d)))) * math.sqrt((h / ((l * l) * l))) elif d <= 9000000000.0: tmp = (1.0 - ((0.5 * (M * ((0.25 * ((D * D) * M)) / (d * d)))) * (h / l))) * (t_1 * d) elif d <= 3.8e+145: tmp = t_0 else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * D) * Float64(D / Float64(d * d))) * 0.125) * h) / l))) t_1 = sqrt(Float64(1.0 / Float64(l * h))) tmp = 0.0 if (d <= -6.6e+154) tmp = Float64(Float64(-t_1) * d); elseif (d <= -8.5e-157) tmp = t_0; elseif (d <= 9.4e-279) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); elseif (d <= 9000000000.0) tmp = Float64(Float64(1.0 - Float64(Float64(0.5 * Float64(M * Float64(Float64(0.25 * Float64(Float64(D * D) * M)) / Float64(d * d)))) * Float64(h / l))) * Float64(t_1 * d)); elseif (d <= 3.8e+145) tmp = t_0; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
t_1 = sqrt((1.0 / (l * h)));
tmp = 0.0;
if (d <= -6.6e+154)
tmp = -t_1 * d;
elseif (d <= -8.5e-157)
tmp = t_0;
elseif (d <= 9.4e-279)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
elseif (d <= 9000000000.0)
tmp = (1.0 - ((0.5 * (M * ((0.25 * ((D * D) * M)) / (d * d)))) * (h / l))) * (t_1 * d);
elseif (d <= 3.8e+145)
tmp = t_0;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * N[(D / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.6e+154], N[((-t$95$1) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$0, If[LessEqual[d, 9.4e-279], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 9000000000.0], N[(N[(1.0 - N[(N[(0.5 * N[(M * N[(N[(0.25 * N[(N[(D * D), $MachinePrecision] * M), $MachinePrecision]), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * d), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.8e+145], t$95$0, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\left(\left(\left(M \cdot M\right) \cdot D\right) \cdot \frac{D}{d \cdot d}\right) \cdot 0.125\right) \cdot h}{\ell}\right)\\
t_1 := \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{+154}:\\
\;\;\;\;\left(-t\_1\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq 9.4 \cdot 10^{-279}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{elif}\;d \leq 9000000000:\\
\;\;\;\;\left(1 - \left(0.5 \cdot \left(M \cdot \frac{0.25 \cdot \left(\left(D \cdot D\right) \cdot M\right)}{d \cdot d}\right)\right) \cdot \frac{h}{\ell}\right) \cdot \left(t\_1 \cdot d\right)\\
\mathbf{elif}\;d \leq 3.8 \cdot 10^{+145}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.6e154Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.7
Applied rewrites70.7%
if -6.6e154 < d < -8.49999999999999976e-157 or 9e9 < d < 3.80000000000000012e145Initial program 77.1%
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 rewrites78.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6478.8
Applied rewrites78.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6478.8
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6479.5
Applied rewrites79.5%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
pow2N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6468.7
Applied rewrites68.7%
if -8.49999999999999976e-157 < d < 9.3999999999999997e-279Initial program 39.9%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites33.4%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6433.4
Applied rewrites33.4%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6436.7
Applied rewrites36.7%
if 9.3999999999999997e-279 < d < 9e9Initial program 61.2%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6466.9
Applied rewrites66.9%
Applied rewrites64.1%
Taylor expanded in d around 0
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6451.2
Applied rewrites51.2%
if 3.80000000000000012e145 < d Initial program 74.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6477.2
Applied rewrites77.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (* (* (* M M) D) (/ D (* d d))) 0.125) h) l))))
(t_1 (sqrt (/ h (* (* l l) l)))))
(if (<= d -6.6e+154)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -8.5e-157)
t_0
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) t_1)
(if (<= d 7.6e-152)
(* (* -0.125 (* (* D D) (/ (* M M) d))) t_1)
(if (<= d 3.8e+145) t_0 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double t_1 = sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -6.6e+154) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
} else if (d <= 7.6e-152) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
} else if (d <= 3.8e+145) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - ((((((m * m) * d_1) * (d_1 / (d * d))) * 0.125d0) * h) / l))
t_1 = sqrt((h / ((l * l) * l)))
if (d <= (-6.6d+154)) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else if (d <= (-8.5d-157)) then
tmp = t_0
else if (d <= (-2.6d-302)) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * t_1
else if (d <= 7.6d-152) then
tmp = ((-0.125d0) * ((d_1 * d_1) * ((m * m) / d))) * t_1
else if (d <= 3.8d+145) then
tmp = t_0
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
double t_1 = Math.sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -6.6e+154) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
} else if (d <= 7.6e-152) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
} else if (d <= 3.8e+145) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l)) t_1 = math.sqrt((h / ((l * l) * l))) tmp = 0 if d <= -6.6e+154: tmp = -math.sqrt((1.0 / (l * h))) * d elif d <= -8.5e-157: tmp = t_0 elif d <= -2.6e-302: tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1 elif d <= 7.6e-152: tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1 elif d <= 3.8e+145: tmp = t_0 else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * D) * Float64(D / Float64(d * d))) * 0.125) * h) / l))) t_1 = sqrt(Float64(h / Float64(Float64(l * l) * l))) tmp = 0.0 if (d <= -6.6e+154) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -8.5e-157) tmp = t_0; elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * t_1); elseif (d <= 7.6e-152) tmp = Float64(Float64(-0.125 * Float64(Float64(D * D) * Float64(Float64(M * M) / d))) * t_1); elseif (d <= 3.8e+145) tmp = t_0; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * D) * (D / (d * d))) * 0.125) * h) / l));
t_1 = sqrt((h / ((l * l) * l)));
tmp = 0.0;
if (d <= -6.6e+154)
tmp = -sqrt((1.0 / (l * h))) * d;
elseif (d <= -8.5e-157)
tmp = t_0;
elseif (d <= -2.6e-302)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
elseif (d <= 7.6e-152)
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
elseif (d <= 3.8e+145)
tmp = t_0;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * N[(D / N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -6.6e+154], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$0, If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[d, 7.6e-152], N[(N[(-0.125 * N[(N[(D * D), $MachinePrecision] * N[(N[(M * M), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[d, 3.8e+145], t$95$0, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\left(\left(\left(M \cdot M\right) \cdot D\right) \cdot \frac{D}{d \cdot d}\right) \cdot 0.125\right) \cdot h}{\ell}\right)\\
t_1 := \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{if}\;d \leq -6.6 \cdot 10^{+154}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot t\_1\\
\mathbf{elif}\;d \leq 7.6 \cdot 10^{-152}:\\
\;\;\;\;\left(-0.125 \cdot \left(\left(D \cdot D\right) \cdot \frac{M \cdot M}{d}\right)\right) \cdot t\_1\\
\mathbf{elif}\;d \leq 3.8 \cdot 10^{+145}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -6.6e154Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.7
Applied rewrites70.7%
if -6.6e154 < d < -8.49999999999999976e-157 or 7.60000000000000024e-152 < d < 3.80000000000000012e145Initial program 75.6%
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 rewrites77.2%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6477.2
Applied rewrites77.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lower-*.f6477.2
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f6478.0
Applied rewrites78.0%
Taylor expanded in d around 0
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
pow2N/A
associate-/l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6467.6
Applied rewrites67.6%
if -8.49999999999999976e-157 < d < -2.60000000000000011e-302Initial program 42.9%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites38.6%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6438.6
Applied rewrites38.6%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6442.4
Applied rewrites42.4%
if -2.60000000000000011e-302 < d < 7.60000000000000024e-152Initial program 43.1%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6439.8
Applied rewrites39.8%
if 3.80000000000000012e145 < d Initial program 74.0%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6477.2
Applied rewrites77.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0
(*
(* (sqrt (/ d l)) (sqrt (/ d h)))
(- 1.0 (/ (* (* (/ (* (* M M) (* D D)) (* d d)) 0.125) h) l))))
(t_1 (sqrt (/ h (* (* l l) l)))))
(if (<= d -5.8e+153)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -8.5e-157)
t_0
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) t_1)
(if (<= d 7.5e-152)
(* (* -0.125 (* (* D D) (/ (* M M) d))) t_1)
(if (<= d 1.7e+20) t_0 (/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * (D * D)) / (d * d)) * 0.125) * h) / l));
double t_1 = sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -5.8e+153) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
} else if (d <= 7.5e-152) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
} else if (d <= 1.7e+20) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0d0 - ((((((m * m) * (d_1 * d_1)) / (d * d)) * 0.125d0) * h) / l))
t_1 = sqrt((h / ((l * l) * l)))
if (d <= (-5.8d+153)) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else if (d <= (-8.5d-157)) then
tmp = t_0
else if (d <= (-2.6d-302)) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * t_1
else if (d <= 7.5d-152) then
tmp = ((-0.125d0) * ((d_1 * d_1) * ((m * m) / d))) * t_1
else if (d <= 1.7d+20) then
tmp = t_0
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * (1.0 - ((((((M * M) * (D * D)) / (d * d)) * 0.125) * h) / l));
double t_1 = Math.sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -5.8e+153) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else if (d <= -8.5e-157) {
tmp = t_0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
} else if (d <= 7.5e-152) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
} else if (d <= 1.7e+20) {
tmp = t_0;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = (math.sqrt((d / l)) * math.sqrt((d / h))) * (1.0 - ((((((M * M) * (D * D)) / (d * d)) * 0.125) * h) / l)) t_1 = math.sqrt((h / ((l * l) * l))) tmp = 0 if d <= -5.8e+153: tmp = -math.sqrt((1.0 / (l * h))) * d elif d <= -8.5e-157: tmp = t_0 elif d <= -2.6e-302: tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1 elif d <= 7.5e-152: tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1 elif d <= 1.7e+20: tmp = t_0 else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * Float64(1.0 - Float64(Float64(Float64(Float64(Float64(Float64(M * M) * Float64(D * D)) / Float64(d * d)) * 0.125) * h) / l))) t_1 = sqrt(Float64(h / Float64(Float64(l * l) * l))) tmp = 0.0 if (d <= -5.8e+153) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -8.5e-157) tmp = t_0; elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * t_1); elseif (d <= 7.5e-152) tmp = Float64(Float64(-0.125 * Float64(Float64(D * D) * Float64(Float64(M * M) / d))) * t_1); elseif (d <= 1.7e+20) tmp = t_0; else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (sqrt((d / l)) * sqrt((d / h))) * (1.0 - ((((((M * M) * (D * D)) / (d * d)) * 0.125) * h) / l));
t_1 = sqrt((h / ((l * l) * l)));
tmp = 0.0;
if (d <= -5.8e+153)
tmp = -sqrt((1.0 / (l * h))) * d;
elseif (d <= -8.5e-157)
tmp = t_0;
elseif (d <= -2.6e-302)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_1;
elseif (d <= 7.5e-152)
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_1;
elseif (d <= 1.7e+20)
tmp = t_0;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(N[(N[(N[(M * M), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision] * h), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -5.8e+153], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -8.5e-157], t$95$0, If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[d, 7.5e-152], N[(N[(-0.125 * N[(N[(D * D), $MachinePrecision] * N[(N[(M * M), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[d, 1.7e+20], t$95$0, N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot \left(1 - \frac{\left(\frac{\left(M \cdot M\right) \cdot \left(D \cdot D\right)}{d \cdot d} \cdot 0.125\right) \cdot h}{\ell}\right)\\
t_1 := \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{if}\;d \leq -5.8 \cdot 10^{+153}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -8.5 \cdot 10^{-157}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot t\_1\\
\mathbf{elif}\;d \leq 7.5 \cdot 10^{-152}:\\
\;\;\;\;\left(-0.125 \cdot \left(\left(D \cdot D\right) \cdot \frac{M \cdot M}{d}\right)\right) \cdot t\_1\\
\mathbf{elif}\;d \leq 1.7 \cdot 10^{+20}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -5.80000000000000004e153Initial program 68.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.8
Applied rewrites70.8%
if -5.80000000000000004e153 < d < -8.49999999999999976e-157 or 7.5e-152 < d < 1.7e20Initial program 75.0%
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 rewrites76.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6476.4
Applied rewrites76.4%
Taylor expanded in d around 0
Applied rewrites63.2%
if -8.49999999999999976e-157 < d < -2.60000000000000011e-302Initial program 42.9%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites38.6%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6438.6
Applied rewrites38.6%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6442.4
Applied rewrites42.4%
if -2.60000000000000011e-302 < d < 7.5e-152Initial program 43.1%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6439.8
Applied rewrites39.8%
if 1.7e20 < d Initial program 75.8%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6458.3
Applied rewrites58.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6458.5
Applied rewrites58.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6458.6
Applied rewrites58.6%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6468.5
Applied rewrites68.5%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(if (<= d -8.5e+149)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -3.5e-49)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) 1.0)
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) (sqrt (/ h (* (* l l) l))))
(if (<= d 2.2e-133)
(/ (* (/ (* (sqrt (* l h)) (* (* (* M M) D) D)) d) -0.125) (* l l))
(/ (* 1.0 d) (* (sqrt h) (sqrt l))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (d <= -8.5e+149) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
} else if (d <= 2.2e-133) {
tmp = (((sqrt((l * h)) * (((M * M) * D) * D)) / d) * -0.125) / (l * l);
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (d <= (-8.5d+149)) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else if (d <= (-3.5d-49)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0d0
else if (d <= (-2.6d-302)) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * sqrt((h / ((l * l) * l)))
else if (d <= 2.2d-133) then
tmp = (((sqrt((l * h)) * (((m * m) * d_1) * d_1)) / d) * (-0.125d0)) / (l * l)
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (d <= -8.5e+149) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * Math.sqrt((h / ((l * l) * l)));
} else if (d <= 2.2e-133) {
tmp = (((Math.sqrt((l * h)) * (((M * M) * D) * D)) / d) * -0.125) / (l * l);
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if d <= -8.5e+149: tmp = -math.sqrt((1.0 / (l * h))) * d elif d <= -3.5e-49: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * 1.0 elif d <= -2.6e-302: tmp = (0.125 * ((D * D) * (M * (M / d)))) * math.sqrt((h / ((l * l) * l))) elif d <= 2.2e-133: tmp = (((math.sqrt((l * h)) * (((M * M) * D) * D)) / d) * -0.125) / (l * l) else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (d <= -8.5e+149) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -3.5e-49) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * 1.0); elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); elseif (d <= 2.2e-133) tmp = Float64(Float64(Float64(Float64(sqrt(Float64(l * h)) * Float64(Float64(Float64(M * M) * D) * D)) / d) * -0.125) / Float64(l * l)); else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (d <= -8.5e+149)
tmp = -sqrt((1.0 / (l * h))) * d;
elseif (d <= -3.5e-49)
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
elseif (d <= -2.6e-302)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
elseif (d <= 2.2e-133)
tmp = (((sqrt((l * h)) * (((M * M) * D) * D)) / d) * -0.125) / (l * l);
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[d, -8.5e+149], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -3.5e-49], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 2.2e-133], N[(N[(N[(N[(N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(M * M), $MachinePrecision] * D), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.125), $MachinePrecision] / N[(l * l), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -8.5 \cdot 10^{+149}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -3.5 \cdot 10^{-49}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot 1\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{elif}\;d \leq 2.2 \cdot 10^{-133}:\\
\;\;\;\;\frac{\frac{\sqrt{\ell \cdot h} \cdot \left(\left(\left(M \cdot M\right) \cdot D\right) \cdot D\right)}{d} \cdot -0.125}{\ell \cdot \ell}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -8.49999999999999956e149Initial program 68.5%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.9
Applied rewrites70.9%
if -8.49999999999999956e149 < d < -3.50000000000000006e-49Initial program 81.1%
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 rewrites83.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6483.4
Applied rewrites83.4%
Taylor expanded in d around inf
Applied rewrites46.4%
if -3.50000000000000006e-49 < d < -2.60000000000000011e-302Initial program 53.3%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites35.7%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6435.7
Applied rewrites35.7%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6438.4
Applied rewrites38.4%
if -2.60000000000000011e-302 < d < 2.2000000000000001e-133Initial program 44.6%
Taylor expanded in l around 0
lower-/.f64N/A
Applied rewrites32.0%
Taylor expanded in d around 0
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
pow2N/A
pow2N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites38.4%
if 2.2000000000000001e-133 < d Initial program 75.2%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6449.6
Applied rewrites49.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6449.8
Applied rewrites49.8%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6449.8
Applied rewrites49.8%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6459.5
Applied rewrites59.5%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(let* ((t_0 (sqrt (/ h (* (* l l) l)))))
(if (<= d -8.5e+149)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -3.5e-49)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) 1.0)
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) t_0)
(if (<= d 4e-206)
(* (* -0.125 (* (* D D) (/ (* M M) d))) t_0)
(/ (* 1.0 d) (* (sqrt h) (sqrt l)))))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double t_0 = sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -8.5e+149) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_0;
} else if (d <= 4e-206) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_0;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h / ((l * l) * l)))
if (d <= (-8.5d+149)) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else if (d <= (-3.5d-49)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0d0
else if (d <= (-2.6d-302)) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * t_0
else if (d <= 4d-206) then
tmp = ((-0.125d0) * ((d_1 * d_1) * ((m * m) / d))) * t_0
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double t_0 = Math.sqrt((h / ((l * l) * l)));
double tmp;
if (d <= -8.5e+149) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_0;
} else if (d <= 4e-206) {
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_0;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): t_0 = math.sqrt((h / ((l * l) * l))) tmp = 0 if d <= -8.5e+149: tmp = -math.sqrt((1.0 / (l * h))) * d elif d <= -3.5e-49: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * 1.0 elif d <= -2.6e-302: tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_0 elif d <= 4e-206: tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_0 else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) t_0 = sqrt(Float64(h / Float64(Float64(l * l) * l))) tmp = 0.0 if (d <= -8.5e+149) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -3.5e-49) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * 1.0); elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * t_0); elseif (d <= 4e-206) tmp = Float64(Float64(-0.125 * Float64(Float64(D * D) * Float64(Float64(M * M) / d))) * t_0); else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = sqrt((h / ((l * l) * l)));
tmp = 0.0;
if (d <= -8.5e+149)
tmp = -sqrt((1.0 / (l * h))) * d;
elseif (d <= -3.5e-49)
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
elseif (d <= -2.6e-302)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * t_0;
elseif (d <= 4e-206)
tmp = (-0.125 * ((D * D) * ((M * M) / d))) * t_0;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := Block[{t$95$0 = N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[d, -8.5e+149], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -3.5e-49], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[d, 4e-206], N[(N[(-0.125 * N[(N[(D * D), $MachinePrecision] * N[(N[(M * M), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{if}\;d \leq -8.5 \cdot 10^{+149}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -3.5 \cdot 10^{-49}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot 1\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot t\_0\\
\mathbf{elif}\;d \leq 4 \cdot 10^{-206}:\\
\;\;\;\;\left(-0.125 \cdot \left(\left(D \cdot D\right) \cdot \frac{M \cdot M}{d}\right)\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -8.49999999999999956e149Initial program 68.5%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.9
Applied rewrites70.9%
if -8.49999999999999956e149 < d < -3.50000000000000006e-49Initial program 81.1%
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 rewrites83.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6483.4
Applied rewrites83.4%
Taylor expanded in d around inf
Applied rewrites46.4%
if -3.50000000000000006e-49 < d < -2.60000000000000011e-302Initial program 53.3%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites35.7%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6435.7
Applied rewrites35.7%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6438.4
Applied rewrites38.4%
if -2.60000000000000011e-302 < d < 4.00000000000000011e-206Initial program 37.1%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6440.2
Applied rewrites40.2%
if 4.00000000000000011e-206 < d Initial program 72.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6446.1
Applied rewrites46.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6446.3
Applied rewrites46.3%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6446.3
Applied rewrites46.3%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6454.9
Applied rewrites54.9%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
: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) (* 2.0 d)) 2.0)) (/ h l)))))
(t_1 (* (sqrt (/ d l)) (sqrt (/ d h)))))
(if (<= t_0 -5e-103)
(* t_1 (* (/ (* (* (* M M) h) (* D D)) (* (* d d) l)) -0.125))
(if (<= t_0 4e-200) (/ d (sqrt (* h l))) (* t_1 1.0)))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
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) / (2.0 * d)), 2.0)) * (h / l)));
double t_1 = sqrt((d / l)) * sqrt((d / h));
double tmp;
if (t_0 <= -5e-103) {
tmp = t_1 * (((((M * M) * h) * (D * D)) / ((d * d) * l)) * -0.125);
} else if (t_0 <= 4e-200) {
tmp = d / sqrt((h * l));
} else {
tmp = t_1 * 1.0;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (((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)))
t_1 = sqrt((d / l)) * sqrt((d / h))
if (t_0 <= (-5d-103)) then
tmp = t_1 * (((((m * m) * h) * (d_1 * d_1)) / ((d * d) * l)) * (-0.125d0))
else if (t_0 <= 4d-200) then
tmp = d / sqrt((h * l))
else
tmp = t_1 * 1.0d0
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
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) / (2.0 * d)), 2.0)) * (h / l)));
double t_1 = Math.sqrt((d / l)) * Math.sqrt((d / h));
double tmp;
if (t_0 <= -5e-103) {
tmp = t_1 * (((((M * M) * h) * (D * D)) / ((d * d) * l)) * -0.125);
} else if (t_0 <= 4e-200) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = t_1 * 1.0;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): 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) / (2.0 * d)), 2.0)) * (h / l))) t_1 = math.sqrt((d / l)) * math.sqrt((d / h)) tmp = 0 if t_0 <= -5e-103: tmp = t_1 * (((((M * M) * h) * (D * D)) / ((d * d) * l)) * -0.125) elif t_0 <= 4e-200: tmp = d / math.sqrt((h * l)) else: tmp = t_1 * 1.0 return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) 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) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) t_1 = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) tmp = 0.0 if (t_0 <= -5e-103) tmp = Float64(t_1 * Float64(Float64(Float64(Float64(Float64(M * M) * h) * Float64(D * D)) / Float64(Float64(d * d) * l)) * -0.125)); elseif (t_0 <= 4e-200) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(t_1 * 1.0); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (((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)));
t_1 = sqrt((d / l)) * sqrt((d / h));
tmp = 0.0;
if (t_0 <= -5e-103)
tmp = t_1 * (((((M * M) * h) * (D * D)) / ((d * d) * l)) * -0.125);
elseif (t_0 <= 4e-200)
tmp = d / sqrt((h * l));
else
tmp = t_1 * 1.0;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := 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), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-103], N[(t$95$1 * N[(N[(N[(N[(N[(M * M), $MachinePrecision] * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e-200], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$1 * 1.0), $MachinePrecision]]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\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}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
t_1 := \sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{-103}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell} \cdot -0.125\right)\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{-200}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot 1\\
\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)))) < -4.99999999999999966e-103Initial program 86.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 rewrites84.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6484.9
Applied rewrites84.9%
Taylor expanded in d around 0
Applied rewrites51.8%
if -4.99999999999999966e-103 < (*.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)))) < 3.9999999999999999e-200Initial program 49.8%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.7
Applied rewrites45.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6445.6
Applied rewrites45.6%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6445.7
Applied rewrites45.7%
lift-*.f64N/A
*-lft-identity45.7
Applied rewrites45.7%
if 3.9999999999999999e-200 < (*.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 57.3%
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 rewrites60.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6460.8
Applied rewrites60.8%
Taylor expanded in d around inf
Applied rewrites60.6%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(if (<= d -8.5e+149)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(if (<= d -3.5e-49)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) 1.0)
(if (<= d -2.6e-302)
(* (* 0.125 (* (* D D) (* M (/ M d)))) (sqrt (/ h (* (* l l) l))))
(/ (* 1.0 d) (* (sqrt h) (sqrt l)))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (d <= -8.5e+149) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (d <= (-8.5d+149)) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else if (d <= (-3.5d-49)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0d0
else if (d <= (-2.6d-302)) then
tmp = (0.125d0 * ((d_1 * d_1) * (m * (m / d)))) * sqrt((h / ((l * l) * l)))
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (d <= -8.5e+149) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else if (d <= -3.5e-49) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * 1.0;
} else if (d <= -2.6e-302) {
tmp = (0.125 * ((D * D) * (M * (M / d)))) * Math.sqrt((h / ((l * l) * l)));
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if d <= -8.5e+149: tmp = -math.sqrt((1.0 / (l * h))) * d elif d <= -3.5e-49: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * 1.0 elif d <= -2.6e-302: tmp = (0.125 * ((D * D) * (M * (M / d)))) * math.sqrt((h / ((l * l) * l))) else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (d <= -8.5e+149) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); elseif (d <= -3.5e-49) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * 1.0); elseif (d <= -2.6e-302) tmp = Float64(Float64(0.125 * Float64(Float64(D * D) * Float64(M * Float64(M / d)))) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (d <= -8.5e+149)
tmp = -sqrt((1.0 / (l * h))) * d;
elseif (d <= -3.5e-49)
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
elseif (d <= -2.6e-302)
tmp = (0.125 * ((D * D) * (M * (M / d)))) * sqrt((h / ((l * l) * l)));
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[d, -8.5e+149], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], If[LessEqual[d, -3.5e-49], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[d, -2.6e-302], N[(N[(0.125 * N[(N[(D * D), $MachinePrecision] * N[(M * N[(M / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -8.5 \cdot 10^{+149}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{elif}\;d \leq -3.5 \cdot 10^{-49}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot 1\\
\mathbf{elif}\;d \leq -2.6 \cdot 10^{-302}:\\
\;\;\;\;\left(0.125 \cdot \left(\left(D \cdot D\right) \cdot \left(M \cdot \frac{M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if d < -8.49999999999999956e149Initial program 68.5%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f646.5
Applied rewrites6.5%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6470.9
Applied rewrites70.9%
if -8.49999999999999956e149 < d < -3.50000000000000006e-49Initial program 81.1%
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 rewrites83.4%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6483.4
Applied rewrites83.4%
Taylor expanded in d around inf
Applied rewrites46.4%
if -3.50000000000000006e-49 < d < -2.60000000000000011e-302Initial program 53.3%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites35.7%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6435.7
Applied rewrites35.7%
lift-*.f64N/A
lift-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6438.4
Applied rewrites38.4%
if -2.60000000000000011e-302 < d Initial program 66.7%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6441.8
Applied rewrites41.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6441.9
Applied rewrites41.9%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6442.0
Applied rewrites42.0%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6449.2
Applied rewrites49.2%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
: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) (* 2.0 d)) 2.0)) (/ h l))))))
(if (<= t_0 -1e+36)
(* (* 0.125 (* D (* D (/ (* M M) d)))) (sqrt (/ h (* (* l l) l))))
(if (<= t_0 4e-200)
(/ d (sqrt (* h l)))
(* (* (sqrt (/ d l)) (sqrt (/ d h))) 1.0)))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
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) / (2.0 * d)), 2.0)) * (h / l)));
double tmp;
if (t_0 <= -1e+36) {
tmp = (0.125 * (D * (D * ((M * M) / d)))) * sqrt((h / ((l * l) * l)));
} else if (t_0 <= 4e-200) {
tmp = d / sqrt((h * l));
} else {
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: t_0
real(8) :: tmp
t_0 = (((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)))
if (t_0 <= (-1d+36)) then
tmp = (0.125d0 * (d_1 * (d_1 * ((m * m) / d)))) * sqrt((h / ((l * l) * l)))
else if (t_0 <= 4d-200) then
tmp = d / sqrt((h * l))
else
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0d0
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
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) / (2.0 * d)), 2.0)) * (h / l)));
double tmp;
if (t_0 <= -1e+36) {
tmp = (0.125 * (D * (D * ((M * M) / d)))) * Math.sqrt((h / ((l * l) * l)));
} else if (t_0 <= 4e-200) {
tmp = d / Math.sqrt((h * l));
} else {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * 1.0;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): 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) / (2.0 * d)), 2.0)) * (h / l))) tmp = 0 if t_0 <= -1e+36: tmp = (0.125 * (D * (D * ((M * M) / d)))) * math.sqrt((h / ((l * l) * l))) elif t_0 <= 4e-200: tmp = d / math.sqrt((h * l)) else: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * 1.0 return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) 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) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) tmp = 0.0 if (t_0 <= -1e+36) tmp = Float64(Float64(0.125 * Float64(D * Float64(D * Float64(Float64(M * M) / d)))) * sqrt(Float64(h / Float64(Float64(l * l) * l)))); elseif (t_0 <= 4e-200) tmp = Float64(d / sqrt(Float64(h * l))); else tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * 1.0); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
t_0 = (((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)));
tmp = 0.0;
if (t_0 <= -1e+36)
tmp = (0.125 * (D * (D * ((M * M) / d)))) * sqrt((h / ((l * l) * l)));
elseif (t_0 <= 4e-200)
tmp = d / sqrt((h * l));
else
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M_, D_] := 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), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e+36], N[(N[(0.125 * N[(D * N[(D * N[(N[(M * M), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(h / N[(N[(l * l), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e-200], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision]]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\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}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)\\
\mathbf{if}\;t\_0 \leq -1 \cdot 10^{+36}:\\
\;\;\;\;\left(0.125 \cdot \left(D \cdot \left(D \cdot \frac{M \cdot M}{d}\right)\right)\right) \cdot \sqrt{\frac{h}{\left(\ell \cdot \ell\right) \cdot \ell}}\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{-200}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot 1\\
\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)))) < -1.00000000000000004e36Initial program 85.5%
Taylor expanded in h around -inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites30.8%
Taylor expanded in d around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
pow3N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-sqrt.f6430.8
Applied rewrites30.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-/.f64N/A
lift-*.f6432.5
Applied rewrites32.5%
if -1.00000000000000004e36 < (*.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)))) < 3.9999999999999999e-200Initial program 59.2%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6437.5
Applied rewrites37.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6437.5
Applied rewrites37.5%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6437.5
Applied rewrites37.5%
lift-*.f64N/A
*-lft-identity37.5
Applied rewrites37.5%
if 3.9999999999999999e-200 < (*.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 57.3%
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 rewrites60.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6460.8
Applied rewrites60.8%
Taylor expanded in d around inf
Applied rewrites60.6%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M D)
:precision binary64
(if (<= l -1.3e+52)
(* (* (sqrt (/ d l)) (sqrt (/ d h))) 1.0)
(if (<= l 9.5e-222)
(* (- (sqrt (/ 1.0 (* l h)))) d)
(/ (* 1.0 d) (* (sqrt h) (sqrt l))))))assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= -1.3e+52) {
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
} else if (l <= 9.5e-222) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (l <= (-1.3d+52)) then
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0d0
else if (l <= 9.5d-222) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= -1.3e+52) {
tmp = (Math.sqrt((d / l)) * Math.sqrt((d / h))) * 1.0;
} else if (l <= 9.5e-222) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if l <= -1.3e+52: tmp = (math.sqrt((d / l)) * math.sqrt((d / h))) * 1.0 elif l <= 9.5e-222: tmp = -math.sqrt((1.0 / (l * h))) * d else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (l <= -1.3e+52) tmp = Float64(Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))) * 1.0); elseif (l <= 9.5e-222) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (l <= -1.3e+52)
tmp = (sqrt((d / l)) * sqrt((d / h))) * 1.0;
elseif (l <= 9.5e-222)
tmp = -sqrt((1.0 / (l * h))) * d;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[l, -1.3e+52], N[(N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[l, 9.5e-222], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.3 \cdot 10^{+52}:\\
\;\;\;\;\left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right) \cdot 1\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{-222}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.3e52Initial program 56.5%
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 rewrites56.0%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
lift-/.f64N/A
lift-/.f64N/A
metadata-evalN/A
lift-pow.f64N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lift-/.f6456.0
Applied rewrites56.0%
Taylor expanded in d around inf
Applied rewrites45.8%
if -1.3e52 < l < 9.5000000000000002e-222Initial program 72.5%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6413.7
Applied rewrites13.7%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6435.7
Applied rewrites35.7%
if 9.5000000000000002e-222 < l Initial program 66.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6445.4
Applied rewrites45.4%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6445.5
Applied rewrites45.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6453.0
Applied rewrites53.0%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (if (<= l 9.5e-222) (* (- (sqrt (/ 1.0 (* l h)))) d) (/ (* 1.0 d) (* (sqrt h) (sqrt l)))))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.5e-222) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (l <= 9.5d-222) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else
tmp = (1.0d0 * d) / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.5e-222) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 * d) / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if l <= 9.5e-222: tmp = -math.sqrt((1.0 / (l * h))) * d else: tmp = (1.0 * d) / (math.sqrt(h) * math.sqrt(l)) return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (l <= 9.5e-222) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); else tmp = Float64(Float64(1.0 * d) / Float64(sqrt(h) * sqrt(l))); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (l <= 9.5e-222)
tmp = -sqrt((1.0 / (l * h))) * d;
else
tmp = (1.0 * d) / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[l, 9.5e-222], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], N[(N[(1.0 * d), $MachinePrecision] / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9.5 \cdot 10^{-222}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < 9.5000000000000002e-222Initial program 66.7%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6411.3
Applied rewrites11.3%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6441.5
Applied rewrites41.5%
if 9.5000000000000002e-222 < l Initial program 66.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6445.4
Applied rewrites45.4%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6445.5
Applied rewrites45.5%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6453.0
Applied rewrites53.0%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (if (<= l 9.5e-222) (* (- (sqrt (/ 1.0 (* l h)))) d) (* (/ 1.0 (* (sqrt l) (sqrt h))) d)))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.5e-222) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 / (sqrt(l) * sqrt(h))) * d;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (l <= 9.5d-222) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else
tmp = (1.0d0 / (sqrt(l) * sqrt(h))) * d
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.5e-222) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else {
tmp = (1.0 / (Math.sqrt(l) * Math.sqrt(h))) * d;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if l <= 9.5e-222: tmp = -math.sqrt((1.0 / (l * h))) * d else: tmp = (1.0 / (math.sqrt(l) * math.sqrt(h))) * d return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (l <= 9.5e-222) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); else tmp = Float64(Float64(1.0 / Float64(sqrt(l) * sqrt(h))) * d); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (l <= 9.5e-222)
tmp = -sqrt((1.0 / (l * h))) * d;
else
tmp = (1.0 / (sqrt(l) * sqrt(h))) * d;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[l, 9.5e-222], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], N[(N[(1.0 / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9.5 \cdot 10^{-222}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\ell} \cdot \sqrt{h}} \cdot d\\
\end{array}
\end{array}
if l < 9.5000000000000002e-222Initial program 66.7%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6411.3
Applied rewrites11.3%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6441.5
Applied rewrites41.5%
if 9.5000000000000002e-222 < l Initial program 66.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6445.4
Applied rewrites45.4%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6452.9
Applied rewrites52.9%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (if (<= l 9.8e-222) (* (- (sqrt (/ 1.0 (* l h)))) d) (* (sqrt (/ (/ 1.0 l) h)) d)))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.8e-222) {
tmp = -sqrt((1.0 / (l * h))) * d;
} else {
tmp = sqrt(((1.0 / l) / h)) * d;
}
return tmp;
}
NOTE: d, h, l, M, and D 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_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
real(8) :: tmp
if (l <= 9.8d-222) then
tmp = -sqrt((1.0d0 / (l * h))) * d
else
tmp = sqrt(((1.0d0 / l) / h)) * d
end if
code = tmp
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
double tmp;
if (l <= 9.8e-222) {
tmp = -Math.sqrt((1.0 / (l * h))) * d;
} else {
tmp = Math.sqrt(((1.0 / l) / h)) * d;
}
return tmp;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): tmp = 0 if l <= 9.8e-222: tmp = -math.sqrt((1.0 / (l * h))) * d else: tmp = math.sqrt(((1.0 / l) / h)) * d return tmp
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) tmp = 0.0 if (l <= 9.8e-222) tmp = Float64(Float64(-sqrt(Float64(1.0 / Float64(l * h)))) * d); else tmp = Float64(sqrt(Float64(Float64(1.0 / l) / h)) * d); end return tmp end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp_2 = code(d, h, l, M, D)
tmp = 0.0;
if (l <= 9.8e-222)
tmp = -sqrt((1.0 / (l * h))) * d;
else
tmp = sqrt(((1.0 / l) / h)) * d;
end
tmp_2 = tmp;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := If[LessEqual[l, 9.8e-222], N[((-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) * d), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 9.8 \cdot 10^{-222}:\\
\;\;\;\;\left(-\sqrt{\frac{1}{\ell \cdot h}}\right) \cdot d\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{1}{\ell}}{h}} \cdot d\\
\end{array}
\end{array}
if l < 9.7999999999999999e-222Initial program 66.7%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6411.3
Applied rewrites11.3%
Taylor expanded in h around -inf
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
*-commutativeN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f6441.5
Applied rewrites41.5%
if 9.7999999999999999e-222 < l Initial program 66.4%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.3
Applied rewrites45.3%
lift-*.f64N/A
lift-/.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6445.6
Applied rewrites45.6%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (* (sqrt (/ (/ 1.0 l) h)) d))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
return sqrt(((1.0 / l) / h)) * d;
}
NOTE: d, h, l, M, and D 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_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 = sqrt(((1.0d0 / l) / h)) * d
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
return Math.sqrt(((1.0 / l) / h)) * d;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): return math.sqrt(((1.0 / l) / h)) * d
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) return Float64(sqrt(Float64(Float64(1.0 / l) / h)) * d) end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp = code(d, h, l, M, D)
tmp = sqrt(((1.0 / l) / h)) * d;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := N[(N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\sqrt{\frac{\frac{1}{\ell}}{h}} \cdot d
\end{array}
Initial program 66.6%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6426.0
Applied rewrites26.0%
lift-*.f64N/A
lift-/.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6426.1
Applied rewrites26.1%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (* (sqrt (/ 1.0 (* l h))) d))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
return sqrt((1.0 / (l * h))) * d;
}
NOTE: d, h, l, M, and D 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_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 = sqrt((1.0d0 / (l * h))) * d
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
return Math.sqrt((1.0 / (l * h))) * d;
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): return math.sqrt((1.0 / (l * h))) * d
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) return Float64(sqrt(Float64(1.0 / Float64(l * h))) * d) end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp = code(d, h, l, M, D)
tmp = sqrt((1.0 / (l * h))) * d;
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := N[(N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * d), $MachinePrecision]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\sqrt{\frac{1}{\ell \cdot h}} \cdot d
\end{array}
Initial program 66.6%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6426.0
Applied rewrites26.0%
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. (FPCore (d h l M D) :precision binary64 (/ d (sqrt (* h l))))
assert(d < h && h < l && l < M && M < D);
double code(double d, double h, double l, double M, double D) {
return d / sqrt((h * l));
}
NOTE: d, h, l, M, and D 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_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 / sqrt((h * l))
end function
assert d < h && h < l && l < M && M < D;
public static double code(double d, double h, double l, double M, double D) {
return d / Math.sqrt((h * l));
}
[d, h, l, M, D] = sort([d, h, l, M, D]) def code(d, h, l, M, D): return d / math.sqrt((h * l))
d, h, l, M, D = sort([d, h, l, M, D]) function code(d, h, l, M, D) return Float64(d / sqrt(Float64(h * l))) end
d, h, l, M, D = num2cell(sort([d, h, l, M, D])){:}
function tmp = code(d, h, l, M, D)
tmp = d / sqrt((h * l));
end
NOTE: d, h, l, M, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M_, D_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[d, h, l, M, D] = \mathsf{sort}([d, h, l, M, D])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 66.6%
Taylor expanded in d around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6426.0
Applied rewrites26.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-*.f6425.8
Applied rewrites25.8%
lift-*.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
*-commutativeN/A
lower-*.f6425.9
Applied rewrites25.9%
lift-*.f64N/A
*-lft-identity25.9
Applied rewrites25.9%
herbie shell --seed 2025101
(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)))))