
(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)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 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)));
}
real(8) function code(d, h, l, m, d_1)
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}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (- d)))
(t_1
(*
(sqrt (/ d l))
(*
(/ t_0 (sqrt (- h)))
(+ 1.0 (* h (/ (pow (* M_m (/ D_m (/ d 0.5))) 2.0) (/ l -0.5))))))))
(if (<= h -3.8e+194)
t_1
(if (<= h -1.45e-190)
(*
(/ t_0 (sqrt (- l)))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D_m 2.0) (/ M_m d)) 2.0))))))
(if (<= h -1e-310)
t_1
(*
(+ 1.0 (* (pow (* (/ M_m d) (* D_m 0.5)) 2.0) (* -0.5 (/ h l))))
(/ d (* (sqrt h) (sqrt l)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(-d);
double t_1 = sqrt((d / l)) * ((t_0 / sqrt(-h)) * (1.0 + (h * (pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5)))));
double tmp;
if (h <= -3.8e+194) {
tmp = t_1;
} else if (h <= -1.45e-190) {
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * pow(((D_m / 2.0) * (M_m / d)), 2.0)))));
} else if (h <= -1e-310) {
tmp = t_1;
} else {
tmp = (1.0 + (pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt(-d)
t_1 = sqrt((d / l)) * ((t_0 / sqrt(-h)) * (1.0d0 + (h * (((m_m * (d_m / (d / 0.5d0))) ** 2.0d0) / (l / (-0.5d0))))))
if (h <= (-3.8d+194)) then
tmp = t_1
else if (h <= (-1.45d-190)) then
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0d0 + ((h / l) * ((-0.5d0) * (((d_m / 2.0d0) * (m_m / d)) ** 2.0d0)))))
else if (h <= (-1d-310)) then
tmp = t_1
else
tmp = (1.0d0 + ((((m_m / d) * (d_m * 0.5d0)) ** 2.0d0) * ((-0.5d0) * (h / l)))) * (d / (sqrt(h) * sqrt(l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(-d);
double t_1 = Math.sqrt((d / l)) * ((t_0 / Math.sqrt(-h)) * (1.0 + (h * (Math.pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5)))));
double tmp;
if (h <= -3.8e+194) {
tmp = t_1;
} else if (h <= -1.45e-190) {
tmp = (t_0 / Math.sqrt(-l)) * (Math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * Math.pow(((D_m / 2.0) * (M_m / d)), 2.0)))));
} else if (h <= -1e-310) {
tmp = t_1;
} else {
tmp = (1.0 + (Math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (Math.sqrt(h) * Math.sqrt(l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(-d) t_1 = math.sqrt((d / l)) * ((t_0 / math.sqrt(-h)) * (1.0 + (h * (math.pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5))))) tmp = 0 if h <= -3.8e+194: tmp = t_1 elif h <= -1.45e-190: tmp = (t_0 / math.sqrt(-l)) * (math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * math.pow(((D_m / 2.0) * (M_m / d)), 2.0))))) elif h <= -1e-310: tmp = t_1 else: tmp = (1.0 + (math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (math.sqrt(h) * math.sqrt(l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(-d)) t_1 = Float64(sqrt(Float64(d / l)) * Float64(Float64(t_0 / sqrt(Float64(-h))) * Float64(1.0 + Float64(h * Float64((Float64(M_m * Float64(D_m / Float64(d / 0.5))) ^ 2.0) / Float64(l / -0.5)))))) tmp = 0.0 if (h <= -3.8e+194) tmp = t_1; elseif (h <= -1.45e-190) tmp = Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D_m / 2.0) * Float64(M_m / d)) ^ 2.0)))))); elseif (h <= -1e-310) tmp = t_1; else tmp = Float64(Float64(1.0 + Float64((Float64(Float64(M_m / d) * Float64(D_m * 0.5)) ^ 2.0) * Float64(-0.5 * Float64(h / l)))) * Float64(d / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(-d);
t_1 = sqrt((d / l)) * ((t_0 / sqrt(-h)) * (1.0 + (h * (((M_m * (D_m / (d / 0.5))) ^ 2.0) / (l / -0.5)))));
tmp = 0.0;
if (h <= -3.8e+194)
tmp = t_1;
elseif (h <= -1.45e-190)
tmp = (t_0 / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * (((D_m / 2.0) * (M_m / d)) ^ 2.0)))));
elseif (h <= -1e-310)
tmp = t_1;
else
tmp = (1.0 + ((((M_m / d) * (D_m * 0.5)) ^ 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(h * N[(N[Power[N[(M$95$m * N[(D$95$m / N[(d / 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(l / -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -3.8e+194], t$95$1, If[LessEqual[h, -1.45e-190], N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D$95$m / 2.0), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -1e-310], t$95$1, N[(N[(1.0 + N[(N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.5 * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
t_1 := \sqrt{\frac{d}{\ell}} \cdot \left(\frac{t_0}{\sqrt{-h}} \cdot \left(1 + h \cdot \frac{{\left(M_m \cdot \frac{D_m}{\frac{d}{0.5}}\right)}^{2}}{\frac{\ell}{-0.5}}\right)\right)\\
\mathbf{if}\;h \leq -3.8 \cdot 10^{+194}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;h \leq -1.45 \cdot 10^{-190}:\\
\;\;\;\;\frac{t_0}{\sqrt{-\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D_m}{2} \cdot \frac{M_m}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{elif}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\left(1 + {\left(\frac{M_m}{d} \cdot \left(D_m \cdot 0.5\right)\right)}^{2} \cdot \left(-0.5 \cdot \frac{h}{\ell}\right)\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if h < -3.7999999999999999e194 or -1.4500000000000001e-190 < h < -9.999999999999969e-311Initial program 57.3%
Simplified57.3%
associate-*l/62.7%
associate-/l*62.7%
*-commutative62.7%
div-inv62.7%
metadata-eval62.7%
Applied egg-rr62.7%
associate-/l*62.7%
*-commutative62.7%
associate-*l/62.7%
*-commutative62.7%
*-commutative62.7%
associate-/l*62.7%
associate-*r/62.8%
associate-*l/62.8%
*-commutative62.8%
associate-/l*62.8%
Simplified62.8%
frac-2neg62.8%
sqrt-div86.4%
Applied egg-rr86.4%
if -3.7999999999999999e194 < h < -1.4500000000000001e-190Initial program 69.3%
Simplified67.2%
frac-2neg67.2%
sqrt-div81.4%
Applied egg-rr81.4%
if -9.999999999999969e-311 < h Initial program 69.8%
Simplified69.7%
Applied egg-rr71.3%
*-commutative71.3%
distribute-rgt1-in82.2%
+-commutative82.2%
Simplified82.2%
Final simplification82.8%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<=
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* M_m D_m) (* d 2.0)) 2.0)))))
2e+191)
(*
(- 1.0 (* 0.5 (pow (* (* D_m 0.5) (* (/ M_m d) (sqrt (/ h l)))) 2.0)))
(* (sqrt (/ d l)) (sqrt (/ d h))))
(fabs (/ d (sqrt (* h l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((M_m * D_m) / (d * 2.0)), 2.0))))) <= 2e+191) {
tmp = (1.0 - (0.5 * pow(((D_m * 0.5) * ((M_m / d) * sqrt((h / l)))), 2.0))) * (sqrt((d / l)) * sqrt((d / h)));
} else {
tmp = fabs((d / sqrt((h * l))));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (((((d / h) ** 0.5d0) * ((d / l) ** 0.5d0)) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m * d_m) / (d * 2.0d0)) ** 2.0d0))))) <= 2d+191) then
tmp = (1.0d0 - (0.5d0 * (((d_m * 0.5d0) * ((m_m / d) * sqrt((h / l)))) ** 2.0d0))) * (sqrt((d / l)) * sqrt((d / h)))
else
tmp = abs((d / sqrt((h * l))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m * D_m) / (d * 2.0)), 2.0))))) <= 2e+191) {
tmp = (1.0 - (0.5 * Math.pow(((D_m * 0.5) * ((M_m / d) * Math.sqrt((h / l)))), 2.0))) * (Math.sqrt((d / l)) * Math.sqrt((d / h)));
} else {
tmp = Math.abs((d / Math.sqrt((h * l))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if ((math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m * D_m) / (d * 2.0)), 2.0))))) <= 2e+191: tmp = (1.0 - (0.5 * math.pow(((D_m * 0.5) * ((M_m / d) * math.sqrt((h / l)))), 2.0))) * (math.sqrt((d / l)) * math.sqrt((d / h))) else: tmp = math.fabs((d / math.sqrt((h * l)))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m * D_m) / Float64(d * 2.0)) ^ 2.0))))) <= 2e+191) tmp = Float64(Float64(1.0 - Float64(0.5 * (Float64(Float64(D_m * 0.5) * Float64(Float64(M_m / d) * sqrt(Float64(h / l)))) ^ 2.0))) * Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h)))); else tmp = abs(Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (((((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((M_m * D_m) / (d * 2.0)) ^ 2.0))))) <= 2e+191)
tmp = (1.0 - (0.5 * (((D_m * 0.5) * ((M_m / d) * sqrt((h / l)))) ^ 2.0))) * (sqrt((d / l)) * sqrt((d / h)));
else
tmp = abs((d / sqrt((h * l))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+191], N[(N[(1.0 - N[(0.5 * N[Power[N[(N[(D$95$m * 0.5), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * N[Sqrt[N[(h / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M_m \cdot D_m}{d \cdot 2}\right)}^{2}\right)\right) \leq 2 \cdot 10^{+191}:\\
\;\;\;\;\left(1 - 0.5 \cdot {\left(\left(D_m \cdot 0.5\right) \cdot \left(\frac{M_m}{d} \cdot \sqrt{\frac{h}{\ell}}\right)\right)}^{2}\right) \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right|\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 1 2)) (pow.f64 (/.f64 d l) (/.f64 1 2))) (-.f64 1 (*.f64 (*.f64 (/.f64 1 2) (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2)) (/.f64 h l)))) < 2.00000000000000015e191Initial program 87.5%
Simplified87.1%
add-sqr-sqrt87.1%
pow287.1%
sqrt-prod87.1%
unpow287.1%
sqrt-prod50.0%
add-sqr-sqrt88.2%
associate-/l*88.2%
associate-/r/87.5%
*-commutative87.5%
div-inv87.5%
metadata-eval87.5%
Applied egg-rr87.5%
associate-*l*87.5%
Simplified87.5%
if 2.00000000000000015e191 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 1 2)) (pow.f64 (/.f64 d l) (/.f64 1 2))) (-.f64 1 (*.f64 (*.f64 (/.f64 1 2) (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2)) (/.f64 h l)))) Initial program 23.8%
Simplified23.8%
Taylor expanded in d around inf 24.0%
add-sqr-sqrt23.1%
sqrt-prod31.9%
unpow231.9%
sqrt-prod26.3%
div-inv26.3%
add-sqr-sqrt26.3%
rem-sqrt-square26.3%
sqrt-div31.9%
unpow231.9%
sqrt-prod23.1%
add-sqr-sqrt60.9%
Applied egg-rr60.9%
Final simplification78.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* M_m D_m) (* d 2.0)) 2.0)))))))
(if (<= t_0 2e+191) t_0 (fabs (/ d (sqrt (* h l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((M_m * D_m) / (d * 2.0)), 2.0))));
double tmp;
if (t_0 <= 2e+191) {
tmp = t_0;
} else {
tmp = fabs((d / sqrt((h * l))));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (((d / h) ** 0.5d0) * ((d / l) ** 0.5d0)) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m * d_m) / (d * 2.0d0)) ** 2.0d0))))
if (t_0 <= 2d+191) then
tmp = t_0
else
tmp = abs((d / sqrt((h * l))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m * D_m) / (d * 2.0)), 2.0))));
double tmp;
if (t_0 <= 2e+191) {
tmp = t_0;
} else {
tmp = Math.abs((d / Math.sqrt((h * l))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = (math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m * D_m) / (d * 2.0)), 2.0)))) tmp = 0 if t_0 <= 2e+191: tmp = t_0 else: tmp = math.fabs((d / math.sqrt((h * l)))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m * D_m) / Float64(d * 2.0)) ^ 2.0))))) tmp = 0.0 if (t_0 <= 2e+191) tmp = t_0; else tmp = abs(Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((M_m * D_m) / (d * 2.0)) ^ 2.0))));
tmp = 0.0;
if (t_0 <= 2e+191)
tmp = t_0;
else
tmp = abs((d / sqrt((h * l))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e+191], t$95$0, N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M_m \cdot D_m}{d \cdot 2}\right)}^{2}\right)\right)\\
\mathbf{if}\;t_0 \leq 2 \cdot 10^{+191}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right|\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 1 2)) (pow.f64 (/.f64 d l) (/.f64 1 2))) (-.f64 1 (*.f64 (*.f64 (/.f64 1 2) (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2)) (/.f64 h l)))) < 2.00000000000000015e191Initial program 87.5%
if 2.00000000000000015e191 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 1 2)) (pow.f64 (/.f64 d l) (/.f64 1 2))) (-.f64 1 (*.f64 (*.f64 (/.f64 1 2) (pow.f64 (/.f64 (*.f64 M D) (*.f64 2 d)) 2)) (/.f64 h l)))) Initial program 23.8%
Simplified23.8%
Taylor expanded in d around inf 24.0%
add-sqr-sqrt23.1%
sqrt-prod31.9%
unpow231.9%
sqrt-prod26.3%
div-inv26.3%
add-sqr-sqrt26.3%
rem-sqrt-square26.3%
sqrt-div31.9%
unpow231.9%
sqrt-prod23.1%
add-sqr-sqrt60.9%
Applied egg-rr60.9%
Final simplification78.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -7.2e+144)
(* t_0 (/ (sqrt (- d)) (sqrt (- h))))
(if (<= l 6.8e-306)
(*
t_0
(*
(+ 1.0 (* h (/ (pow (* M_m (/ D_m (/ d 0.5))) 2.0) (/ l -0.5))))
(sqrt (/ d h))))
(*
(+ 1.0 (* (pow (* (/ M_m d) (* D_m 0.5)) 2.0) (* -0.5 (/ h l))))
(/ d (* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -7.2e+144) {
tmp = t_0 * (sqrt(-d) / sqrt(-h));
} else if (l <= 6.8e-306) {
tmp = t_0 * ((1.0 + (h * (pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5)))) * sqrt((d / h)));
} else {
tmp = (1.0 + (pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (l <= (-7.2d+144)) then
tmp = t_0 * (sqrt(-d) / sqrt(-h))
else if (l <= 6.8d-306) then
tmp = t_0 * ((1.0d0 + (h * (((m_m * (d_m / (d / 0.5d0))) ** 2.0d0) / (l / (-0.5d0))))) * sqrt((d / h)))
else
tmp = (1.0d0 + ((((m_m / d) * (d_m * 0.5d0)) ** 2.0d0) * ((-0.5d0) * (h / l)))) * (d / (sqrt(h) * sqrt(l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (l <= -7.2e+144) {
tmp = t_0 * (Math.sqrt(-d) / Math.sqrt(-h));
} else if (l <= 6.8e-306) {
tmp = t_0 * ((1.0 + (h * (Math.pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5)))) * Math.sqrt((d / h)));
} else {
tmp = (1.0 + (Math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (Math.sqrt(h) * Math.sqrt(l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) tmp = 0 if l <= -7.2e+144: tmp = t_0 * (math.sqrt(-d) / math.sqrt(-h)) elif l <= 6.8e-306: tmp = t_0 * ((1.0 + (h * (math.pow((M_m * (D_m / (d / 0.5))), 2.0) / (l / -0.5)))) * math.sqrt((d / h))) else: tmp = (1.0 + (math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (math.sqrt(h) * math.sqrt(l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -7.2e+144) tmp = Float64(t_0 * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h)))); elseif (l <= 6.8e-306) tmp = Float64(t_0 * Float64(Float64(1.0 + Float64(h * Float64((Float64(M_m * Float64(D_m / Float64(d / 0.5))) ^ 2.0) / Float64(l / -0.5)))) * sqrt(Float64(d / h)))); else tmp = Float64(Float64(1.0 + Float64((Float64(Float64(M_m / d) * Float64(D_m * 0.5)) ^ 2.0) * Float64(-0.5 * Float64(h / l)))) * Float64(d / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
tmp = 0.0;
if (l <= -7.2e+144)
tmp = t_0 * (sqrt(-d) / sqrt(-h));
elseif (l <= 6.8e-306)
tmp = t_0 * ((1.0 + (h * (((M_m * (D_m / (d / 0.5))) ^ 2.0) / (l / -0.5)))) * sqrt((d / h)));
else
tmp = (1.0 + ((((M_m / d) * (D_m * 0.5)) ^ 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -7.2e+144], N[(t$95$0 * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.8e-306], N[(t$95$0 * N[(N[(1.0 + N[(h * N[(N[Power[N[(M$95$m * N[(D$95$m / N[(d / 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(l / -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.5 * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -7.2 \cdot 10^{+144}:\\
\;\;\;\;t_0 \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq 6.8 \cdot 10^{-306}:\\
\;\;\;\;t_0 \cdot \left(\left(1 + h \cdot \frac{{\left(M_m \cdot \frac{D_m}{\frac{d}{0.5}}\right)}^{2}}{\frac{\ell}{-0.5}}\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + {\left(\frac{M_m}{d} \cdot \left(D_m \cdot 0.5\right)\right)}^{2} \cdot \left(-0.5 \cdot \frac{h}{\ell}\right)\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -7.1999999999999995e144Initial program 51.2%
Simplified49.8%
Taylor expanded in d around inf 5.3%
sqrt-div5.3%
metadata-eval5.3%
un-div-inv5.3%
Applied egg-rr5.3%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div51.8%
Applied egg-rr51.8%
*-commutative51.8%
Simplified51.8%
frac-2neg52.1%
sqrt-div63.2%
Applied egg-rr62.7%
if -7.1999999999999995e144 < l < 6.7999999999999996e-306Initial program 70.1%
Simplified68.3%
associate-*l/70.5%
associate-/l*70.4%
*-commutative70.4%
div-inv70.4%
metadata-eval70.4%
Applied egg-rr70.4%
associate-/l*70.5%
*-commutative70.5%
associate-*l/70.5%
*-commutative70.5%
*-commutative70.5%
associate-/l*70.5%
associate-*r/72.3%
associate-*l/72.3%
*-commutative72.3%
associate-/l*72.3%
Simplified72.3%
if 6.7999999999999996e-306 < l Initial program 69.8%
Simplified69.7%
Applied egg-rr71.3%
*-commutative71.3%
distribute-rgt1-in82.2%
+-commutative82.2%
Simplified82.2%
Final simplification75.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -1.35e-105)
(* (sqrt (/ d l)) (/ (sqrt (- d)) (sqrt (- h))))
(if (<= l -1e-309)
(* d (log (exp (pow (* h l) -0.5))))
(if (<= l 6e+37)
(*
(/ d (sqrt (* h l)))
(fma h (* (pow (* (/ M_m 2.0) (/ D_m d)) 2.0) (/ -0.5 l)) 1.0))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -1.35e-105) {
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h));
} else if (l <= -1e-309) {
tmp = d * log(exp(pow((h * l), -0.5)));
} else if (l <= 6e+37) {
tmp = (d / sqrt((h * l))) * fma(h, (pow(((M_m / 2.0) * (D_m / d)), 2.0) * (-0.5 / l)), 1.0);
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -1.35e-105) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h)))); elseif (l <= -1e-309) tmp = Float64(d * log(exp((Float64(h * l) ^ -0.5)))); elseif (l <= 6e+37) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * fma(h, Float64((Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0) * Float64(-0.5 / l)), 1.0)); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -1.35e-105], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1e-309], N[(d * N[Log[N[Exp[N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6e+37], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(h * N[(N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.5 / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.35 \cdot 10^{-105}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-309}:\\
\;\;\;\;d \cdot \log \left(e^{{\left(h \cdot \ell\right)}^{-0.5}}\right)\\
\mathbf{elif}\;\ell \leq 6 \cdot 10^{+37}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \mathsf{fma}\left(h, {\left(\frac{M_m}{2} \cdot \frac{D_m}{d}\right)}^{2} \cdot \frac{-0.5}{\ell}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.34999999999999996e-105Initial program 63.8%
Simplified63.2%
Taylor expanded in d around inf 4.8%
sqrt-div4.8%
metadata-eval4.8%
un-div-inv4.8%
Applied egg-rr4.8%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div48.2%
Applied egg-rr48.2%
*-commutative48.2%
Simplified48.2%
frac-2neg64.2%
sqrt-div76.2%
Applied egg-rr58.2%
if -1.34999999999999996e-105 < l < -1.000000000000002e-309Initial program 66.4%
Simplified66.4%
Taylor expanded in d around inf 23.0%
add-log-exp45.4%
inv-pow45.4%
metadata-eval45.4%
sqrt-pow145.4%
metadata-eval45.4%
metadata-eval45.4%
Applied egg-rr45.4%
if -1.000000000000002e-309 < l < 6.00000000000000043e37Initial program 72.8%
Simplified72.7%
expm1-log1p-u72.6%
expm1-udef72.6%
*-commutative72.6%
associate-/l*72.6%
associate-/r/71.1%
*-commutative71.1%
div-inv71.1%
metadata-eval71.1%
Applied egg-rr71.1%
expm1-def71.1%
expm1-log1p71.3%
associate-*l/73.8%
*-commutative73.8%
associate-*l/73.8%
*-commutative73.8%
associate-*r/75.4%
associate-*l/73.9%
*-commutative73.9%
associate-/l*73.9%
Simplified73.9%
Applied egg-rr62.5%
*-commutative62.5%
distribute-rgt1-in85.1%
*-commutative85.1%
fma-def85.1%
Simplified85.1%
if 6.00000000000000043e37 < l Initial program 65.7%
Simplified65.6%
Taylor expanded in d around inf 50.1%
associate-/r*52.1%
sqrt-div66.3%
Applied egg-rr66.3%
Final simplification64.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -6.4e-106)
(* (sqrt (/ d l)) (/ (sqrt (- d)) (sqrt (- h))))
(if (<= l -1e-309)
(* d (log (exp (pow (* h l) -0.5))))
(*
(+ 1.0 (* (pow (* (/ M_m d) (* D_m 0.5)) 2.0) (* -0.5 (/ h l))))
(/ d (* (sqrt h) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.4e-106) {
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h));
} else if (l <= -1e-309) {
tmp = d * log(exp(pow((h * l), -0.5)));
} else {
tmp = (1.0 + (pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-6.4d-106)) then
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h))
else if (l <= (-1d-309)) then
tmp = d * log(exp(((h * l) ** (-0.5d0))))
else
tmp = (1.0d0 + ((((m_m / d) * (d_m * 0.5d0)) ** 2.0d0) * ((-0.5d0) * (h / l)))) * (d / (sqrt(h) * sqrt(l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.4e-106) {
tmp = Math.sqrt((d / l)) * (Math.sqrt(-d) / Math.sqrt(-h));
} else if (l <= -1e-309) {
tmp = d * Math.log(Math.exp(Math.pow((h * l), -0.5)));
} else {
tmp = (1.0 + (Math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (Math.sqrt(h) * Math.sqrt(l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -6.4e-106: tmp = math.sqrt((d / l)) * (math.sqrt(-d) / math.sqrt(-h)) elif l <= -1e-309: tmp = d * math.log(math.exp(math.pow((h * l), -0.5))) else: tmp = (1.0 + (math.pow(((M_m / d) * (D_m * 0.5)), 2.0) * (-0.5 * (h / l)))) * (d / (math.sqrt(h) * math.sqrt(l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -6.4e-106) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h)))); elseif (l <= -1e-309) tmp = Float64(d * log(exp((Float64(h * l) ^ -0.5)))); else tmp = Float64(Float64(1.0 + Float64((Float64(Float64(M_m / d) * Float64(D_m * 0.5)) ^ 2.0) * Float64(-0.5 * Float64(h / l)))) * Float64(d / Float64(sqrt(h) * sqrt(l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -6.4e-106)
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h));
elseif (l <= -1e-309)
tmp = d * log(exp(((h * l) ^ -0.5)));
else
tmp = (1.0 + ((((M_m / d) * (D_m * 0.5)) ^ 2.0) * (-0.5 * (h / l)))) * (d / (sqrt(h) * sqrt(l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -6.4e-106], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1e-309], N[(d * N[Log[N[Exp[N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[Power[N[(N[(M$95$m / d), $MachinePrecision] * N[(D$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(-0.5 * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.4 \cdot 10^{-106}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-309}:\\
\;\;\;\;d \cdot \log \left(e^{{\left(h \cdot \ell\right)}^{-0.5}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 + {\left(\frac{M_m}{d} \cdot \left(D_m \cdot 0.5\right)\right)}^{2} \cdot \left(-0.5 \cdot \frac{h}{\ell}\right)\right) \cdot \frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -6.4e-106Initial program 63.8%
Simplified63.2%
Taylor expanded in d around inf 4.8%
sqrt-div4.8%
metadata-eval4.8%
un-div-inv4.8%
Applied egg-rr4.8%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div48.2%
Applied egg-rr48.2%
*-commutative48.2%
Simplified48.2%
frac-2neg64.2%
sqrt-div76.2%
Applied egg-rr58.2%
if -6.4e-106 < l < -1.000000000000002e-309Initial program 66.4%
Simplified66.4%
Taylor expanded in d around inf 23.0%
add-log-exp45.4%
inv-pow45.4%
metadata-eval45.4%
sqrt-pow145.4%
metadata-eval45.4%
metadata-eval45.4%
Applied egg-rr45.4%
if -1.000000000000002e-309 < l Initial program 69.8%
Simplified69.7%
Applied egg-rr71.3%
*-commutative71.3%
distribute-rgt1-in82.2%
+-commutative82.2%
Simplified82.2%
Final simplification66.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -5.8e-106)
(* (sqrt (/ d l)) (/ (sqrt (- d)) (sqrt (- h))))
(if (<= l -1e-309)
(* d (log (exp (pow (* h l) -0.5))))
(if (<= l 6e+37)
(*
(/ d (sqrt (* h l)))
(+ 1.0 (* h (* (/ -0.5 l) (pow (* D_m (/ (* M_m 0.5) d)) 2.0)))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.8e-106) {
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h));
} else if (l <= -1e-309) {
tmp = d * log(exp(pow((h * l), -0.5)));
} else if (l <= 6e+37) {
tmp = (d / sqrt((h * l))) * (1.0 + (h * ((-0.5 / l) * pow((D_m * ((M_m * 0.5) / d)), 2.0))));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-5.8d-106)) then
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h))
else if (l <= (-1d-309)) then
tmp = d * log(exp(((h * l) ** (-0.5d0))))
else if (l <= 6d+37) then
tmp = (d / sqrt((h * l))) * (1.0d0 + (h * (((-0.5d0) / l) * ((d_m * ((m_m * 0.5d0) / d)) ** 2.0d0))))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.8e-106) {
tmp = Math.sqrt((d / l)) * (Math.sqrt(-d) / Math.sqrt(-h));
} else if (l <= -1e-309) {
tmp = d * Math.log(Math.exp(Math.pow((h * l), -0.5)));
} else if (l <= 6e+37) {
tmp = (d / Math.sqrt((h * l))) * (1.0 + (h * ((-0.5 / l) * Math.pow((D_m * ((M_m * 0.5) / d)), 2.0))));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -5.8e-106: tmp = math.sqrt((d / l)) * (math.sqrt(-d) / math.sqrt(-h)) elif l <= -1e-309: tmp = d * math.log(math.exp(math.pow((h * l), -0.5))) elif l <= 6e+37: tmp = (d / math.sqrt((h * l))) * (1.0 + (h * ((-0.5 / l) * math.pow((D_m * ((M_m * 0.5) / d)), 2.0)))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -5.8e-106) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-h)))); elseif (l <= -1e-309) tmp = Float64(d * log(exp((Float64(h * l) ^ -0.5)))); elseif (l <= 6e+37) tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(1.0 + Float64(h * Float64(Float64(-0.5 / l) * (Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0))))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -5.8e-106)
tmp = sqrt((d / l)) * (sqrt(-d) / sqrt(-h));
elseif (l <= -1e-309)
tmp = d * log(exp(((h * l) ^ -0.5)));
elseif (l <= 6e+37)
tmp = (d / sqrt((h * l))) * (1.0 + (h * ((-0.5 / l) * ((D_m * ((M_m * 0.5) / d)) ^ 2.0))));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -5.8e-106], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1e-309], N[(d * N[Log[N[Exp[N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6e+37], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(h * N[(N[(-0.5 / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.8 \cdot 10^{-106}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \frac{\sqrt{-d}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-309}:\\
\;\;\;\;d \cdot \log \left(e^{{\left(h \cdot \ell\right)}^{-0.5}}\right)\\
\mathbf{elif}\;\ell \leq 6 \cdot 10^{+37}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(1 + h \cdot \left(\frac{-0.5}{\ell} \cdot {\left(D_m \cdot \frac{M_m \cdot 0.5}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -5.8000000000000001e-106Initial program 63.8%
Simplified63.2%
Taylor expanded in d around inf 4.8%
sqrt-div4.8%
metadata-eval4.8%
un-div-inv4.8%
Applied egg-rr4.8%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div48.2%
Applied egg-rr48.2%
*-commutative48.2%
Simplified48.2%
frac-2neg64.2%
sqrt-div76.2%
Applied egg-rr58.2%
if -5.8000000000000001e-106 < l < -1.000000000000002e-309Initial program 66.4%
Simplified66.4%
Taylor expanded in d around inf 23.0%
add-log-exp45.4%
inv-pow45.4%
metadata-eval45.4%
sqrt-pow145.4%
metadata-eval45.4%
metadata-eval45.4%
Applied egg-rr45.4%
if -1.000000000000002e-309 < l < 6.00000000000000043e37Initial program 72.8%
Simplified72.7%
Applied egg-rr15.6%
Applied egg-rr85.1%
if 6.00000000000000043e37 < l Initial program 65.7%
Simplified65.6%
Taylor expanded in d around inf 50.1%
associate-/r*52.1%
sqrt-div66.3%
Applied egg-rr66.3%
Final simplification64.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ d (sqrt (* h l)))))
(if (<= h -7.5e+146)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= h -1e-310)
(fabs t_0)
(*
t_0
(+ 1.0 (* h (* (/ -0.5 l) (pow (* D_m (/ (* M_m 0.5) d)) 2.0)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d / sqrt((h * l));
double tmp;
if (h <= -7.5e+146) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (h <= -1e-310) {
tmp = fabs(t_0);
} else {
tmp = t_0 * (1.0 + (h * ((-0.5 / l) * pow((D_m * ((M_m * 0.5) / d)), 2.0))));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = d / sqrt((h * l))
if (h <= (-7.5d+146)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (h <= (-1d-310)) then
tmp = abs(t_0)
else
tmp = t_0 * (1.0d0 + (h * (((-0.5d0) / l) * ((d_m * ((m_m * 0.5d0) / d)) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d / Math.sqrt((h * l));
double tmp;
if (h <= -7.5e+146) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (h <= -1e-310) {
tmp = Math.abs(t_0);
} else {
tmp = t_0 * (1.0 + (h * ((-0.5 / l) * Math.pow((D_m * ((M_m * 0.5) / d)), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = d / math.sqrt((h * l)) tmp = 0 if h <= -7.5e+146: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif h <= -1e-310: tmp = math.fabs(t_0) else: tmp = t_0 * (1.0 + (h * ((-0.5 / l) * math.pow((D_m * ((M_m * 0.5) / d)), 2.0)))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(d / sqrt(Float64(h * l))) tmp = 0.0 if (h <= -7.5e+146) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (h <= -1e-310) tmp = abs(t_0); else tmp = Float64(t_0 * Float64(1.0 + Float64(h * Float64(Float64(-0.5 / l) * (Float64(D_m * Float64(Float64(M_m * 0.5) / d)) ^ 2.0))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = d / sqrt((h * l));
tmp = 0.0;
if (h <= -7.5e+146)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (h <= -1e-310)
tmp = abs(t_0);
else
tmp = t_0 * (1.0 + (h * ((-0.5 / l) * ((D_m * ((M_m * 0.5) / d)) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -7.5e+146], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -1e-310], N[Abs[t$95$0], $MachinePrecision], N[(t$95$0 * N[(1.0 + N[(h * N[(N[(-0.5 / l), $MachinePrecision] * N[Power[N[(D$95$m * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{if}\;h \leq -7.5 \cdot 10^{+146}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;h \leq -1 \cdot 10^{-310}:\\
\;\;\;\;\left|t_0\right|\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot \left(1 + h \cdot \left(\frac{-0.5}{\ell} \cdot {\left(D_m \cdot \frac{M_m \cdot 0.5}{d}\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if h < -7.49999999999999983e146Initial program 59.8%
Simplified59.8%
Taylor expanded in d around inf 6.9%
sqrt-div6.9%
metadata-eval6.9%
un-div-inv6.9%
Applied egg-rr6.9%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div42.1%
Applied egg-rr42.1%
*-commutative42.1%
Simplified42.1%
if -7.49999999999999983e146 < h < -9.999999999999969e-311Initial program 66.7%
Simplified66.1%
Taylor expanded in d around inf 12.2%
add-sqr-sqrt0.0%
sqrt-prod30.9%
unpow230.9%
sqrt-prod27.2%
div-inv27.3%
add-sqr-sqrt27.3%
rem-sqrt-square27.3%
sqrt-div30.9%
unpow230.9%
sqrt-prod0.0%
add-sqr-sqrt53.0%
Applied egg-rr53.0%
if -9.999999999999969e-311 < h Initial program 69.8%
Simplified69.7%
Applied egg-rr24.0%
Applied egg-rr72.8%
Final simplification59.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (* h l))))
(if (<= l -5.1e+168)
(* (sqrt (/ d l)) (sqrt (/ d h)))
(if (<= l -1.5e-257)
(fabs (/ d t_0))
(if (<= l -1e-309)
(/ d (+ 1.0 (+ t_0 -1.0)))
(if (<= l 7.6e-180)
(* (- d) (sqrt (/ 1.0 (* h l))))
(/ d (* (sqrt h) (sqrt l)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((h * l));
double tmp;
if (l <= -5.1e+168) {
tmp = sqrt((d / l)) * sqrt((d / h));
} else if (l <= -1.5e-257) {
tmp = fabs((d / t_0));
} else if (l <= -1e-309) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 7.6e-180) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h * l))
if (l <= (-5.1d+168)) then
tmp = sqrt((d / l)) * sqrt((d / h))
else if (l <= (-1.5d-257)) then
tmp = abs((d / t_0))
else if (l <= (-1d-309)) then
tmp = d / (1.0d0 + (t_0 + (-1.0d0)))
else if (l <= 7.6d-180) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((h * l));
double tmp;
if (l <= -5.1e+168) {
tmp = Math.sqrt((d / l)) * Math.sqrt((d / h));
} else if (l <= -1.5e-257) {
tmp = Math.abs((d / t_0));
} else if (l <= -1e-309) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 7.6e-180) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((h * l)) tmp = 0 if l <= -5.1e+168: tmp = math.sqrt((d / l)) * math.sqrt((d / h)) elif l <= -1.5e-257: tmp = math.fabs((d / t_0)) elif l <= -1e-309: tmp = d / (1.0 + (t_0 + -1.0)) elif l <= 7.6e-180: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(h * l)) tmp = 0.0 if (l <= -5.1e+168) tmp = Float64(sqrt(Float64(d / l)) * sqrt(Float64(d / h))); elseif (l <= -1.5e-257) tmp = abs(Float64(d / t_0)); elseif (l <= -1e-309) tmp = Float64(d / Float64(1.0 + Float64(t_0 + -1.0))); elseif (l <= 7.6e-180) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((h * l));
tmp = 0.0;
if (l <= -5.1e+168)
tmp = sqrt((d / l)) * sqrt((d / h));
elseif (l <= -1.5e-257)
tmp = abs((d / t_0));
elseif (l <= -1e-309)
tmp = d / (1.0 + (t_0 + -1.0));
elseif (l <= 7.6e-180)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -5.1e+168], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1.5e-257], N[Abs[N[(d / t$95$0), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, -1e-309], N[(d / N[(1.0 + N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7.6e-180], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;\ell \leq -5.1 \cdot 10^{+168}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -1.5 \cdot 10^{-257}:\\
\;\;\;\;\left|\frac{d}{t_0}\right|\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-309}:\\
\;\;\;\;\frac{d}{1 + \left(t_0 + -1\right)}\\
\mathbf{elif}\;\ell \leq 7.6 \cdot 10^{-180}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -5.10000000000000025e168Initial program 53.8%
Simplified52.1%
Taylor expanded in d around inf 5.5%
sqrt-div5.5%
metadata-eval5.5%
un-div-inv5.5%
Applied egg-rr5.5%
add-sqr-sqrt0.0%
sqrt-prod0.0%
times-frac0.0%
sqrt-div0.0%
sqrt-div54.3%
Applied egg-rr54.3%
*-commutative54.3%
Simplified54.3%
if -5.10000000000000025e168 < l < -1.5e-257Initial program 66.1%
Simplified66.0%
Taylor expanded in d around inf 7.6%
add-sqr-sqrt0.0%
sqrt-prod28.7%
unpow228.7%
sqrt-prod23.3%
div-inv23.3%
add-sqr-sqrt23.3%
rem-sqrt-square23.3%
sqrt-div28.7%
unpow228.7%
sqrt-prod0.0%
add-sqr-sqrt48.3%
Applied egg-rr48.3%
if -1.5e-257 < l < -1.000000000000002e-309Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
expm1-log1p-u47.9%
Applied egg-rr47.9%
expm1-udef69.7%
expm1-log1p69.7%
log1p-udef69.7%
add-exp-log69.7%
associate--l+69.7%
expm1-log1p69.7%
Applied egg-rr69.7%
if -1.000000000000002e-309 < l < 7.59999999999999999e-180Initial program 81.9%
Simplified81.7%
Applied egg-rr4.1%
Taylor expanded in d around -inf 45.9%
associate-*r*45.9%
mul-1-neg45.9%
Simplified45.9%
if 7.59999999999999999e-180 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
sqrt-div51.0%
metadata-eval51.0%
un-div-inv51.1%
Applied egg-rr51.1%
sqrt-prod62.4%
*-commutative62.4%
Applied egg-rr62.4%
Final simplification54.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (* h l))))
(if (<= l -1.8e-259)
(fabs (/ d t_0))
(if (<= l -1e-309)
(/ d (+ 1.0 (+ t_0 -1.0)))
(if (<= l 1.26e-179)
(* (- d) (sqrt (/ 1.0 (* h l))))
(/ d (* (sqrt h) (sqrt l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((h * l));
double tmp;
if (l <= -1.8e-259) {
tmp = fabs((d / t_0));
} else if (l <= -1e-309) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 1.26e-179) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d / (sqrt(h) * sqrt(l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h * l))
if (l <= (-1.8d-259)) then
tmp = abs((d / t_0))
else if (l <= (-1d-309)) then
tmp = d / (1.0d0 + (t_0 + (-1.0d0)))
else if (l <= 1.26d-179) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d / (sqrt(h) * sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((h * l));
double tmp;
if (l <= -1.8e-259) {
tmp = Math.abs((d / t_0));
} else if (l <= -1e-309) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 1.26e-179) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d / (Math.sqrt(h) * Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((h * l)) tmp = 0 if l <= -1.8e-259: tmp = math.fabs((d / t_0)) elif l <= -1e-309: tmp = d / (1.0 + (t_0 + -1.0)) elif l <= 1.26e-179: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d / (math.sqrt(h) * math.sqrt(l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(h * l)) tmp = 0.0 if (l <= -1.8e-259) tmp = abs(Float64(d / t_0)); elseif (l <= -1e-309) tmp = Float64(d / Float64(1.0 + Float64(t_0 + -1.0))); elseif (l <= 1.26e-179) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d / Float64(sqrt(h) * sqrt(l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((h * l));
tmp = 0.0;
if (l <= -1.8e-259)
tmp = abs((d / t_0));
elseif (l <= -1e-309)
tmp = d / (1.0 + (t_0 + -1.0));
elseif (l <= 1.26e-179)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d / (sqrt(h) * sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -1.8e-259], N[Abs[N[(d / t$95$0), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, -1e-309], N[(d / N[(1.0 + N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.26e-179], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[h], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;\ell \leq -1.8 \cdot 10^{-259}:\\
\;\;\;\;\left|\frac{d}{t_0}\right|\\
\mathbf{elif}\;\ell \leq -1 \cdot 10^{-309}:\\
\;\;\;\;\frac{d}{1 + \left(t_0 + -1\right)}\\
\mathbf{elif}\;\ell \leq 1.26 \cdot 10^{-179}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h} \cdot \sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.7999999999999999e-259Initial program 62.7%
Simplified62.2%
Taylor expanded in d around inf 7.1%
add-sqr-sqrt0.0%
sqrt-prod26.8%
unpow226.8%
sqrt-prod22.9%
div-inv22.9%
add-sqr-sqrt22.9%
rem-sqrt-square22.9%
sqrt-div26.8%
unpow226.8%
sqrt-prod0.0%
add-sqr-sqrt45.9%
Applied egg-rr45.9%
if -1.7999999999999999e-259 < l < -1.000000000000002e-309Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
expm1-log1p-u47.9%
Applied egg-rr47.9%
expm1-udef69.7%
expm1-log1p69.7%
log1p-udef69.7%
add-exp-log69.7%
associate--l+69.7%
expm1-log1p69.7%
Applied egg-rr69.7%
if -1.000000000000002e-309 < l < 1.2599999999999999e-179Initial program 81.9%
Simplified81.7%
Applied egg-rr4.1%
Taylor expanded in d around -inf 45.9%
associate-*r*45.9%
mul-1-neg45.9%
Simplified45.9%
if 1.2599999999999999e-179 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
sqrt-div51.0%
metadata-eval51.0%
un-div-inv51.1%
Applied egg-rr51.1%
sqrt-prod62.4%
*-commutative62.4%
Applied egg-rr62.4%
Final simplification52.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (* h l))))
(if (<= l -1.6e-260)
(fabs (/ d t_0))
(if (<= l -6.5e-307)
(/ d (+ 1.0 (+ t_0 -1.0)))
(if (<= l 7.6e-180)
(* (- d) (sqrt (/ 1.0 (* h l))))
(* d (sqrt (/ (/ 1.0 h) l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((h * l));
double tmp;
if (l <= -1.6e-260) {
tmp = fabs((d / t_0));
} else if (l <= -6.5e-307) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 7.6e-180) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((h * l))
if (l <= (-1.6d-260)) then
tmp = abs((d / t_0))
else if (l <= (-6.5d-307)) then
tmp = d / (1.0d0 + (t_0 + (-1.0d0)))
else if (l <= 7.6d-180) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((h * l));
double tmp;
if (l <= -1.6e-260) {
tmp = Math.abs((d / t_0));
} else if (l <= -6.5e-307) {
tmp = d / (1.0 + (t_0 + -1.0));
} else if (l <= 7.6e-180) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((h * l)) tmp = 0 if l <= -1.6e-260: tmp = math.fabs((d / t_0)) elif l <= -6.5e-307: tmp = d / (1.0 + (t_0 + -1.0)) elif l <= 7.6e-180: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(h * l)) tmp = 0.0 if (l <= -1.6e-260) tmp = abs(Float64(d / t_0)); elseif (l <= -6.5e-307) tmp = Float64(d / Float64(1.0 + Float64(t_0 + -1.0))); elseif (l <= 7.6e-180) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((h * l));
tmp = 0.0;
if (l <= -1.6e-260)
tmp = abs((d / t_0));
elseif (l <= -6.5e-307)
tmp = d / (1.0 + (t_0 + -1.0));
elseif (l <= 7.6e-180)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -1.6e-260], N[Abs[N[(d / t$95$0), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, -6.5e-307], N[(d / N[(1.0 + N[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7.6e-180], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;\ell \leq -1.6 \cdot 10^{-260}:\\
\;\;\;\;\left|\frac{d}{t_0}\right|\\
\mathbf{elif}\;\ell \leq -6.5 \cdot 10^{-307}:\\
\;\;\;\;\frac{d}{1 + \left(t_0 + -1\right)}\\
\mathbf{elif}\;\ell \leq 7.6 \cdot 10^{-180}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -1.59999999999999997e-260Initial program 62.7%
Simplified62.2%
Taylor expanded in d around inf 7.1%
add-sqr-sqrt0.0%
sqrt-prod26.8%
unpow226.8%
sqrt-prod22.9%
div-inv22.9%
add-sqr-sqrt22.9%
rem-sqrt-square22.9%
sqrt-div26.8%
unpow226.8%
sqrt-prod0.0%
add-sqr-sqrt45.9%
Applied egg-rr45.9%
if -1.59999999999999997e-260 < l < -6.5000000000000001e-307Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
expm1-log1p-u47.9%
Applied egg-rr47.9%
expm1-udef69.7%
expm1-log1p69.7%
log1p-udef69.7%
add-exp-log69.7%
associate--l+69.7%
expm1-log1p69.7%
Applied egg-rr69.7%
if -6.5000000000000001e-307 < l < 7.59999999999999999e-180Initial program 81.9%
Simplified81.7%
Applied egg-rr4.1%
Taylor expanded in d around -inf 45.9%
associate-*r*45.9%
mul-1-neg45.9%
Simplified45.9%
if 7.59999999999999999e-180 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
associate-/r*52.1%
Simplified52.1%
Final simplification49.1%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -2.25e-259)
(* d (- (pow (* h l) -0.5)))
(if (<= l -1.9e-306)
(/ d (sqrt (* h l)))
(if (<= l 3.05e-176)
(* (- d) (sqrt (/ 1.0 (* h l))))
(* d (sqrt (/ (/ 1.0 h) l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -2.25e-259) {
tmp = d * -pow((h * l), -0.5);
} else if (l <= -1.9e-306) {
tmp = d / sqrt((h * l));
} else if (l <= 3.05e-176) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-2.25d-259)) then
tmp = d * -((h * l) ** (-0.5d0))
else if (l <= (-1.9d-306)) then
tmp = d / sqrt((h * l))
else if (l <= 3.05d-176) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -2.25e-259) {
tmp = d * -Math.pow((h * l), -0.5);
} else if (l <= -1.9e-306) {
tmp = d / Math.sqrt((h * l));
} else if (l <= 3.05e-176) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -2.25e-259: tmp = d * -math.pow((h * l), -0.5) elif l <= -1.9e-306: tmp = d / math.sqrt((h * l)) elif l <= 3.05e-176: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -2.25e-259) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); elseif (l <= -1.9e-306) tmp = Float64(d / sqrt(Float64(h * l))); elseif (l <= 3.05e-176) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -2.25e-259)
tmp = d * -((h * l) ^ -0.5);
elseif (l <= -1.9e-306)
tmp = d / sqrt((h * l));
elseif (l <= 3.05e-176)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -2.25e-259], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -1.9e-306], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.05e-176], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -2.25 \cdot 10^{-259}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{elif}\;\ell \leq -1.9 \cdot 10^{-306}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq 3.05 \cdot 10^{-176}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -2.24999999999999987e-259Initial program 62.7%
Simplified62.2%
Applied egg-rr20.0%
Taylor expanded in d around -inf 45.8%
mul-1-neg45.8%
distribute-rgt-neg-in45.8%
unpow-145.8%
metadata-eval45.8%
pow-sqr45.8%
rem-sqrt-square45.8%
rem-square-sqrt45.6%
fabs-sqr45.6%
rem-square-sqrt45.8%
Simplified45.8%
if -2.24999999999999987e-259 < l < -1.9e-306Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
if -1.9e-306 < l < 3.0500000000000001e-176Initial program 81.9%
Simplified81.7%
Applied egg-rr4.1%
Taylor expanded in d around -inf 45.9%
associate-*r*45.9%
mul-1-neg45.9%
Simplified45.9%
if 3.0500000000000001e-176 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
associate-/r*52.1%
Simplified52.1%
Final simplification48.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= l -5.2e-261)
(* d (- (pow (* h l) -0.5)))
(if (<= l 2.5e-308)
(/ d (+ 1.0 (+ (sqrt (* h l)) -1.0)))
(if (<= l 1.26e-179)
(* (- d) (sqrt (/ 1.0 (* h l))))
(* d (sqrt (/ (/ 1.0 h) l)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.2e-261) {
tmp = d * -pow((h * l), -0.5);
} else if (l <= 2.5e-308) {
tmp = d / (1.0 + (sqrt((h * l)) + -1.0));
} else if (l <= 1.26e-179) {
tmp = -d * sqrt((1.0 / (h * l)));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-5.2d-261)) then
tmp = d * -((h * l) ** (-0.5d0))
else if (l <= 2.5d-308) then
tmp = d / (1.0d0 + (sqrt((h * l)) + (-1.0d0)))
else if (l <= 1.26d-179) then
tmp = -d * sqrt((1.0d0 / (h * l)))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.2e-261) {
tmp = d * -Math.pow((h * l), -0.5);
} else if (l <= 2.5e-308) {
tmp = d / (1.0 + (Math.sqrt((h * l)) + -1.0));
} else if (l <= 1.26e-179) {
tmp = -d * Math.sqrt((1.0 / (h * l)));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -5.2e-261: tmp = d * -math.pow((h * l), -0.5) elif l <= 2.5e-308: tmp = d / (1.0 + (math.sqrt((h * l)) + -1.0)) elif l <= 1.26e-179: tmp = -d * math.sqrt((1.0 / (h * l))) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -5.2e-261) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); elseif (l <= 2.5e-308) tmp = Float64(d / Float64(1.0 + Float64(sqrt(Float64(h * l)) + -1.0))); elseif (l <= 1.26e-179) tmp = Float64(Float64(-d) * sqrt(Float64(1.0 / Float64(h * l)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -5.2e-261)
tmp = d * -((h * l) ^ -0.5);
elseif (l <= 2.5e-308)
tmp = d / (1.0 + (sqrt((h * l)) + -1.0));
elseif (l <= 1.26e-179)
tmp = -d * sqrt((1.0 / (h * l)));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -5.2e-261], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 2.5e-308], N[(d / N[(1.0 + N[(N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.26e-179], N[((-d) * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.2 \cdot 10^{-261}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{elif}\;\ell \leq 2.5 \cdot 10^{-308}:\\
\;\;\;\;\frac{d}{1 + \left(\sqrt{h \cdot \ell} + -1\right)}\\
\mathbf{elif}\;\ell \leq 1.26 \cdot 10^{-179}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{1}{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -5.2000000000000002e-261Initial program 62.7%
Simplified62.2%
Applied egg-rr20.0%
Taylor expanded in d around -inf 45.8%
mul-1-neg45.8%
distribute-rgt-neg-in45.8%
unpow-145.8%
metadata-eval45.8%
pow-sqr45.8%
rem-sqrt-square45.8%
rem-square-sqrt45.6%
fabs-sqr45.6%
rem-square-sqrt45.8%
Simplified45.8%
if -5.2000000000000002e-261 < l < 2.49999999999999977e-308Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
expm1-log1p-u47.9%
Applied egg-rr47.9%
expm1-udef69.7%
expm1-log1p69.7%
log1p-udef69.7%
add-exp-log69.7%
associate--l+69.7%
expm1-log1p69.7%
Applied egg-rr69.7%
if 2.49999999999999977e-308 < l < 1.2599999999999999e-179Initial program 81.9%
Simplified81.7%
Applied egg-rr4.1%
Taylor expanded in d around -inf 45.9%
associate-*r*45.9%
mul-1-neg45.9%
Simplified45.9%
if 1.2599999999999999e-179 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
associate-/r*52.1%
Simplified52.1%
Final simplification49.1%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (or (<= l -4.4e-260) (and (not (<= l 7.2e-307)) (<= l 5.2e-179))) (* d (- (pow (* h l) -0.5))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if ((l <= -4.4e-260) || (!(l <= 7.2e-307) && (l <= 5.2e-179))) {
tmp = d * -pow((h * l), -0.5);
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if ((l <= (-4.4d-260)) .or. (.not. (l <= 7.2d-307)) .and. (l <= 5.2d-179)) then
tmp = d * -((h * l) ** (-0.5d0))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if ((l <= -4.4e-260) || (!(l <= 7.2e-307) && (l <= 5.2e-179))) {
tmp = d * -Math.pow((h * l), -0.5);
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if (l <= -4.4e-260) or (not (l <= 7.2e-307) and (l <= 5.2e-179)): tmp = d * -math.pow((h * l), -0.5) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if ((l <= -4.4e-260) || (!(l <= 7.2e-307) && (l <= 5.2e-179))) tmp = Float64(d * Float64(-(Float64(h * l) ^ -0.5))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if ((l <= -4.4e-260) || (~((l <= 7.2e-307)) && (l <= 5.2e-179)))
tmp = d * -((h * l) ^ -0.5);
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[Or[LessEqual[l, -4.4e-260], And[N[Not[LessEqual[l, 7.2e-307]], $MachinePrecision], LessEqual[l, 5.2e-179]]], N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.4 \cdot 10^{-260} \lor \neg \left(\ell \leq 7.2 \cdot 10^{-307}\right) \land \ell \leq 5.2 \cdot 10^{-179}:\\
\;\;\;\;d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -4.40000000000000034e-260 or 7.20000000000000014e-307 < l < 5.20000000000000011e-179Initial program 66.0%
Simplified65.5%
Applied egg-rr17.3%
Taylor expanded in d around -inf 45.8%
mul-1-neg45.8%
distribute-rgt-neg-in45.8%
unpow-145.8%
metadata-eval45.8%
pow-sqr45.8%
rem-sqrt-square45.2%
rem-square-sqrt45.0%
fabs-sqr45.0%
rem-square-sqrt45.2%
Simplified45.2%
if -4.40000000000000034e-260 < l < 7.20000000000000014e-307 or 5.20000000000000011e-179 < l Initial program 68.3%
Simplified68.3%
Taylor expanded in d around inf 50.5%
sqrt-div50.6%
metadata-eval50.6%
un-div-inv50.7%
Applied egg-rr50.7%
Final simplification47.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* d (- (pow (* h l) -0.5)))))
(if (<= l -2.3e-260)
t_0
(if (<= l 2e-308)
(/ d (sqrt (* h l)))
(if (<= l 8.2e-180) t_0 (* d (sqrt (/ (/ 1.0 h) l))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d * -pow((h * l), -0.5);
double tmp;
if (l <= -2.3e-260) {
tmp = t_0;
} else if (l <= 2e-308) {
tmp = d / sqrt((h * l));
} else if (l <= 8.2e-180) {
tmp = t_0;
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = d * -((h * l) ** (-0.5d0))
if (l <= (-2.3d-260)) then
tmp = t_0
else if (l <= 2d-308) then
tmp = d / sqrt((h * l))
else if (l <= 8.2d-180) then
tmp = t_0
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = d * -Math.pow((h * l), -0.5);
double tmp;
if (l <= -2.3e-260) {
tmp = t_0;
} else if (l <= 2e-308) {
tmp = d / Math.sqrt((h * l));
} else if (l <= 8.2e-180) {
tmp = t_0;
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = d * -math.pow((h * l), -0.5) tmp = 0 if l <= -2.3e-260: tmp = t_0 elif l <= 2e-308: tmp = d / math.sqrt((h * l)) elif l <= 8.2e-180: tmp = t_0 else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(d * Float64(-(Float64(h * l) ^ -0.5))) tmp = 0.0 if (l <= -2.3e-260) tmp = t_0; elseif (l <= 2e-308) tmp = Float64(d / sqrt(Float64(h * l))); elseif (l <= 8.2e-180) tmp = t_0; else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = d * -((h * l) ^ -0.5);
tmp = 0.0;
if (l <= -2.3e-260)
tmp = t_0;
elseif (l <= 2e-308)
tmp = d / sqrt((h * l));
elseif (l <= 8.2e-180)
tmp = t_0;
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(d * (-N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision])), $MachinePrecision]}, If[LessEqual[l, -2.3e-260], t$95$0, If[LessEqual[l, 2e-308], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 8.2e-180], t$95$0, N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := d \cdot \left(-{\left(h \cdot \ell\right)}^{-0.5}\right)\\
\mathbf{if}\;\ell \leq -2.3 \cdot 10^{-260}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;\ell \leq 2 \cdot 10^{-308}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\mathbf{elif}\;\ell \leq 8.2 \cdot 10^{-180}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -2.3e-260 or 1.9999999999999998e-308 < l < 8.2e-180Initial program 66.0%
Simplified65.5%
Applied egg-rr17.3%
Taylor expanded in d around -inf 45.8%
mul-1-neg45.8%
distribute-rgt-neg-in45.8%
unpow-145.8%
metadata-eval45.8%
pow-sqr45.8%
rem-sqrt-square45.2%
rem-square-sqrt45.0%
fabs-sqr45.0%
rem-square-sqrt45.2%
Simplified45.2%
if -2.3e-260 < l < 1.9999999999999998e-308Initial program 84.4%
Simplified84.4%
Taylor expanded in d around inf 47.5%
sqrt-div47.9%
metadata-eval47.9%
un-div-inv47.9%
Applied egg-rr47.9%
if 8.2e-180 < l Initial program 65.8%
Simplified65.8%
Taylor expanded in d around inf 51.0%
associate-/r*52.1%
Simplified52.1%
Final simplification47.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (/ d (sqrt (* h l))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((h * l));
}
M_m = abs(M)
D_m = abs(D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((h * l))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 66.9%
Simplified66.6%
Taylor expanded in d around inf 23.8%
sqrt-div23.5%
metadata-eval23.5%
un-div-inv23.5%
Applied egg-rr23.5%
Final simplification23.5%
herbie shell --seed 2023336
(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)))))