
(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 20 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
(if (<= l -1e+223)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(if (<= l 9e-175)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(*
d
(/
(fma (* (/ h l) -0.5) (pow (* D_m (/ (* 0.5 M_m) d)) 2.0) 1.0)
(* (sqrt l) (sqrt h))))))))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 <= -1e+223) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 9e-175) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = d * (fma(((h / l) * -0.5), pow((D_m * ((0.5 * M_m) / d)), 2.0), 1.0) / (sqrt(l) * sqrt(h)));
}
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 <= -1e+223) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); elseif (l <= 9e-175) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(d * Float64(fma(Float64(Float64(h / l) * -0.5), (Float64(D_m * Float64(Float64(0.5 * M_m) / d)) ^ 2.0), 1.0) / Float64(sqrt(l) * sqrt(h)))); 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, -1e+223], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9e-175], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(N[(0.5 * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 -1 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 9 \cdot 10^{-175}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell} \cdot -0.5, {\left(D\_m \cdot \frac{0.5 \cdot M\_m}{d}\right)}^{2}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.00000000000000005e223Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -1.00000000000000005e223 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l < 8.99999999999999996e-175Initial program 56.7%
Simplified60.6%
Taylor expanded in d around 0 60.9%
*-commutative60.9%
Simplified60.9%
clear-num60.6%
un-div-inv68.6%
div-inv68.6%
metadata-eval68.6%
associate-*l*68.6%
Applied egg-rr69.0%
associate-/r/87.4%
associate-*r/87.4%
*-commutative87.4%
Simplified87.4%
if 8.99999999999999996e-175 < l Initial program 72.5%
Simplified71.6%
add-sqr-sqrt71.4%
pow271.4%
*-commutative71.4%
sqrt-div75.1%
sqrt-div83.2%
frac-times83.2%
add-sqr-sqrt83.4%
Applied egg-rr83.4%
Applied egg-rr67.8%
unpow167.8%
associate-*l/70.8%
associate-/l*70.7%
+-commutative70.7%
associate-*r*70.7%
fma-define70.7%
*-commutative70.7%
associate-*r/71.6%
associate-*l*71.6%
*-commutative71.6%
associate-*r/71.6%
*-commutative71.6%
Simplified71.6%
pow1/271.6%
*-commutative71.6%
unpow-prod-down88.3%
pow1/288.3%
pow1/288.3%
Applied egg-rr88.3%
Final simplification84.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 -7.4e+222)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(*
(-
1.0
(* 0.5 (pow (* (* M_m (* 0.5 (/ D_m d))) (/ (sqrt h) (sqrt l))) 2.0)))
(/ (/ d (sqrt l)) (sqrt h))))))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 <= -7.4e+222) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else {
tmp = (1.0 - (0.5 * pow(((M_m * (0.5 * (D_m / d))) * (sqrt(h) / sqrt(l))), 2.0))) * ((d / sqrt(l)) / sqrt(h));
}
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 <= (-7.4d+222)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else
tmp = (1.0d0 - (0.5d0 * (((m_m * (0.5d0 * (d_m / d))) * (sqrt(h) / sqrt(l))) ** 2.0d0))) * ((d / sqrt(l)) / sqrt(h))
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 <= -7.4e+222) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else {
tmp = (1.0 - (0.5 * Math.pow(((M_m * (0.5 * (D_m / d))) * (Math.sqrt(h) / Math.sqrt(l))), 2.0))) * ((d / Math.sqrt(l)) / Math.sqrt(h));
}
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 <= -7.4e+222: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) else: tmp = (1.0 - (0.5 * math.pow(((M_m * (0.5 * (D_m / d))) * (math.sqrt(h) / math.sqrt(l))), 2.0))) * ((d / math.sqrt(l)) / math.sqrt(h)) 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 <= -7.4e+222) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); else tmp = Float64(Float64(1.0 - Float64(0.5 * (Float64(Float64(M_m * Float64(0.5 * Float64(D_m / d))) * Float64(sqrt(h) / sqrt(l))) ^ 2.0))) * Float64(Float64(d / sqrt(l)) / sqrt(h))); 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 <= -7.4e+222)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
else
tmp = (1.0 - (0.5 * (((M_m * (0.5 * (D_m / d))) * (sqrt(h) / sqrt(l))) ^ 2.0))) * ((d / sqrt(l)) / sqrt(h));
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, -7.4e+222], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[Power[N[(N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[h], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 -7.4 \cdot 10^{+222}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot {\left(\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right) \cdot \frac{\sqrt{h}}{\sqrt{\ell}}\right)}^{2}\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -7.3999999999999997e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -7.3999999999999997e222 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l Initial program 69.5%
Simplified69.4%
add-sqr-sqrt69.4%
pow269.4%
sqrt-prod69.4%
sqrt-pow170.2%
metadata-eval70.2%
pow170.2%
div-inv70.2%
metadata-eval70.2%
associate-*l*70.2%
Applied egg-rr70.2%
*-commutative70.2%
sqrt-div73.7%
sqrt-div81.8%
frac-times81.7%
add-sqr-sqrt82.0%
Applied egg-rr82.0%
associate-/r*82.0%
Simplified82.0%
sqrt-div88.2%
Applied egg-rr88.2%
Final simplification84.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 -7.4e+222)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(if (<= l 3.8e-175)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(/
(*
(/ d (sqrt l))
(+ 1.0 (* -0.5 (* (/ h l) (pow (* M_m (* 0.5 (/ D_m d))) 2.0)))))
(sqrt h))))))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 <= -7.4e+222) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 3.8e-175) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = ((d / sqrt(l)) * (1.0 + (-0.5 * ((h / l) * pow((M_m * (0.5 * (D_m / d))), 2.0))))) / sqrt(h);
}
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 <= (-7.4d+222)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else if (l <= 3.8d-175) then
tmp = (1.0d0 - (0.5d0 * (h * (((m_m * ((0.5d0 * d_m) / d)) ** 2.0d0) / l)))) * (d * sqrt((1.0d0 / (l * h))))
else
tmp = ((d / sqrt(l)) * (1.0d0 + ((-0.5d0) * ((h / l) * ((m_m * (0.5d0 * (d_m / d))) ** 2.0d0))))) / sqrt(h)
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 <= -7.4e+222) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 3.8e-175) {
tmp = (1.0 - (0.5 * (h * (Math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * Math.sqrt((1.0 / (l * h))));
} else {
tmp = ((d / Math.sqrt(l)) * (1.0 + (-0.5 * ((h / l) * Math.pow((M_m * (0.5 * (D_m / d))), 2.0))))) / Math.sqrt(h);
}
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 <= -7.4e+222: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) elif l <= 3.8e-175: tmp = (1.0 - (0.5 * (h * (math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * math.sqrt((1.0 / (l * h)))) else: tmp = ((d / math.sqrt(l)) * (1.0 + (-0.5 * ((h / l) * math.pow((M_m * (0.5 * (D_m / d))), 2.0))))) / math.sqrt(h) 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 <= -7.4e+222) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); elseif (l <= 3.8e-175) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(Float64(Float64(d / sqrt(l)) * Float64(1.0 + Float64(-0.5 * Float64(Float64(h / l) * (Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0))))) / sqrt(h)); 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 <= -7.4e+222)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
elseif (l <= 3.8e-175)
tmp = (1.0 - (0.5 * (h * (((M_m * ((0.5 * D_m) / d)) ^ 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
else
tmp = ((d / sqrt(l)) * (1.0 + (-0.5 * ((h / l) * ((M_m * (0.5 * (D_m / d))) ^ 2.0))))) / sqrt(h);
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, -7.4e+222], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.8e-175], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 -7.4 \cdot 10^{+222}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 3.8 \cdot 10^{-175}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}} \cdot \left(1 + -0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}\right)\right)}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -7.3999999999999997e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -7.3999999999999997e222 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l < 3.8e-175Initial program 56.7%
Simplified60.6%
Taylor expanded in d around 0 60.9%
*-commutative60.9%
Simplified60.9%
clear-num60.6%
un-div-inv68.6%
div-inv68.6%
metadata-eval68.6%
associate-*l*68.6%
Applied egg-rr69.0%
associate-/r/87.4%
associate-*r/87.4%
*-commutative87.4%
Simplified87.4%
if 3.8e-175 < l Initial program 72.5%
Simplified71.6%
add-sqr-sqrt71.6%
pow271.6%
sqrt-prod71.6%
sqrt-pow172.6%
metadata-eval72.6%
pow172.6%
div-inv72.6%
metadata-eval72.6%
associate-*l*72.6%
Applied egg-rr72.6%
*-commutative72.6%
sqrt-div76.1%
sqrt-div85.1%
frac-times85.0%
add-sqr-sqrt85.4%
Applied egg-rr85.4%
associate-/r*85.4%
Simplified85.4%
associate-*l/88.2%
cancel-sign-sub-inv88.2%
metadata-eval88.2%
*-commutative88.2%
unpow-prod-down86.4%
pow286.4%
add-sqr-sqrt86.4%
Applied egg-rr86.4%
Final simplification83.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
(if (<= l -1e+223)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(if (<= l 4.2e-175)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))))
(/ d (* (sqrt l) (sqrt h))))))))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 <= -1e+223) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 4.2e-175) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / (sqrt(l) * sqrt(h)));
}
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 <= (-1d+223)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else if (l <= 4.2d-175) then
tmp = (1.0d0 - (0.5d0 * (h * (((m_m * ((0.5d0 * d_m) / d)) ** 2.0d0) / l)))) * (d * sqrt((1.0d0 / (l * h))))
else
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0)))) * (d / (sqrt(l) * sqrt(h)))
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 <= -1e+223) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 4.2e-175) {
tmp = (1.0 - (0.5 * (h * (Math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * Math.sqrt((1.0 / (l * h))));
} else {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / (Math.sqrt(l) * Math.sqrt(h)));
}
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 <= -1e+223: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) elif l <= 4.2e-175: tmp = (1.0 - (0.5 * (h * (math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * math.sqrt((1.0 / (l * h)))) else: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0)))) * (d / (math.sqrt(l) * math.sqrt(h))) 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 <= -1e+223) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); elseif (l <= 4.2e-175) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0)))) * Float64(d / Float64(sqrt(l) * sqrt(h)))); 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 <= -1e+223)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
elseif (l <= 4.2e-175)
tmp = (1.0 - (0.5 * (h * (((M_m * ((0.5 * D_m) / d)) ^ 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
else
tmp = (1.0 - (0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0)))) * (d / (sqrt(l) * sqrt(h)));
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, -1e+223], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 4.2e-175], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 -1 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 4.2 \cdot 10^{-175}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.00000000000000005e223Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -1.00000000000000005e223 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l < 4.2e-175Initial program 56.7%
Simplified60.6%
Taylor expanded in d around 0 60.9%
*-commutative60.9%
Simplified60.9%
clear-num60.6%
un-div-inv68.6%
div-inv68.6%
metadata-eval68.6%
associate-*l*68.6%
Applied egg-rr69.0%
associate-/r/87.4%
associate-*r/87.4%
*-commutative87.4%
Simplified87.4%
if 4.2e-175 < l Initial program 72.5%
Simplified71.6%
*-commutative72.6%
sqrt-div76.1%
sqrt-div85.1%
frac-times85.0%
add-sqr-sqrt85.4%
Applied egg-rr83.5%
Final simplification82.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 -1e+223)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(*
(- 1.0 (* 0.5 (/ (pow (* M_m (* 0.5 (/ D_m d))) 2.0) (/ l h))))
(/ d (* (sqrt l) (sqrt h)))))))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 <= -1e+223) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else {
tmp = (1.0 - (0.5 * (pow((M_m * (0.5 * (D_m / d))), 2.0) / (l / h)))) * (d / (sqrt(l) * sqrt(h)));
}
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 <= (-1d+223)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else
tmp = (1.0d0 - (0.5d0 * (((m_m * (0.5d0 * (d_m / d))) ** 2.0d0) / (l / h)))) * (d / (sqrt(l) * sqrt(h)))
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 <= -1e+223) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else {
tmp = (1.0 - (0.5 * (Math.pow((M_m * (0.5 * (D_m / d))), 2.0) / (l / h)))) * (d / (Math.sqrt(l) * Math.sqrt(h)));
}
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 <= -1e+223: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) else: tmp = (1.0 - (0.5 * (math.pow((M_m * (0.5 * (D_m / d))), 2.0) / (l / h)))) * (d / (math.sqrt(l) * math.sqrt(h))) 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 <= -1e+223) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64((Float64(M_m * Float64(0.5 * Float64(D_m / d))) ^ 2.0) / Float64(l / h)))) * Float64(d / Float64(sqrt(l) * sqrt(h)))); 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 <= -1e+223)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
else
tmp = (1.0 - (0.5 * (((M_m * (0.5 * (D_m / d))) ^ 2.0) / (l / h)))) * (d / (sqrt(l) * sqrt(h)));
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, -1e+223], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[Power[N[(M$95$m * N[(0.5 * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / N[(l / h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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 -1 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \frac{{\left(M\_m \cdot \left(0.5 \cdot \frac{D\_m}{d}\right)\right)}^{2}}{\frac{\ell}{h}}\right) \cdot \frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -1.00000000000000005e223Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -1.00000000000000005e223 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l Initial program 69.5%
Simplified69.4%
clear-num69.4%
un-div-inv71.0%
div-inv71.0%
metadata-eval71.0%
associate-*l*71.0%
Applied egg-rr71.0%
*-commutative70.2%
sqrt-div73.7%
sqrt-div81.8%
frac-times81.7%
add-sqr-sqrt82.0%
Applied egg-rr82.0%
Final simplification81.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 -1e+223)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(if (<= l 9.2e+122)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(/ (/ d (sqrt l)) (sqrt h))))))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 <= -1e+223) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 9.2e+122) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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 <= (-1d+223)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else if (l <= 9.2d+122) then
tmp = (1.0d0 - (0.5d0 * (h * (((m_m * ((0.5d0 * d_m) / d)) ** 2.0d0) / l)))) * (d * sqrt((1.0d0 / (l * h))))
else
tmp = (d / sqrt(l)) / sqrt(h)
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 <= -1e+223) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 9.2e+122) {
tmp = (1.0 - (0.5 * (h * (Math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * Math.sqrt((1.0 / (l * h))));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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 <= -1e+223: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) elif l <= 9.2e+122: tmp = (1.0 - (0.5 * (h * (math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * math.sqrt((1.0 / (l * h)))) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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 <= -1e+223) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); elseif (l <= 9.2e+122) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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 <= -1e+223)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
elseif (l <= 9.2e+122)
tmp = (1.0 - (0.5 * (h * (((M_m * ((0.5 * D_m) / d)) ^ 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
else
tmp = (d / sqrt(l)) / sqrt(h);
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, -1e+223], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 9.2e+122], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 9.2 \cdot 10^{+122}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -1.00000000000000005e223Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
frac-2neg58.4%
sqrt-div67.3%
Applied egg-rr67.3%
if -1.00000000000000005e223 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l < 9.2000000000000002e122Initial program 71.9%
Simplified71.9%
Taylor expanded in d around 0 76.1%
*-commutative76.1%
Simplified76.1%
clear-num71.9%
un-div-inv74.1%
div-inv74.1%
metadata-eval74.1%
associate-*l*74.1%
Applied egg-rr78.3%
associate-/r/83.5%
associate-*r/83.5%
*-commutative83.5%
Simplified83.5%
if 9.2000000000000002e122 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification81.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
(let* ((t_0 (pow (* D_m (* M_m (/ 0.5 d))) 2.0)))
(if (<= l -8e+222)
(/ (sqrt (* d (/ d (- l)))) (sqrt (- h)))
(if (<= l -1.15e+174)
(* (- d) (sqrt (/ (/ 1.0 h) l)))
(if (<= l 6.8e-278)
(* (sqrt (* (/ d h) (/ d l))) (+ 1.0 (* t_0 (* (/ h l) -0.5))))
(if (<= l 5.6e-250)
(/ d (* (sqrt l) (sqrt h)))
(if (<= l 1.52e+125)
(* d (/ (+ 1.0 (* t_0 (/ (* h -0.5) l))) (sqrt (* l h))))
(/ (/ d (sqrt l)) (sqrt h)))))))))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_m * (M_m * (0.5 / d))), 2.0);
double tmp;
if (l <= -8e+222) {
tmp = sqrt((d * (d / -l))) / sqrt(-h);
} else if (l <= -1.15e+174) {
tmp = -d * sqrt(((1.0 / h) / l));
} else if (l <= 6.8e-278) {
tmp = sqrt(((d / h) * (d / l))) * (1.0 + (t_0 * ((h / l) * -0.5)));
} else if (l <= 5.6e-250) {
tmp = d / (sqrt(l) * sqrt(h));
} else if (l <= 1.52e+125) {
tmp = d * ((1.0 + (t_0 * ((h * -0.5) / l))) / sqrt((l * h)));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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_m * (m_m * (0.5d0 / d))) ** 2.0d0
if (l <= (-8d+222)) then
tmp = sqrt((d * (d / -l))) / sqrt(-h)
else if (l <= (-1.15d+174)) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else if (l <= 6.8d-278) then
tmp = sqrt(((d / h) * (d / l))) * (1.0d0 + (t_0 * ((h / l) * (-0.5d0))))
else if (l <= 5.6d-250) then
tmp = d / (sqrt(l) * sqrt(h))
else if (l <= 1.52d+125) then
tmp = d * ((1.0d0 + (t_0 * ((h * (-0.5d0)) / l))) / sqrt((l * h)))
else
tmp = (d / sqrt(l)) / sqrt(h)
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_m * (M_m * (0.5 / d))), 2.0);
double tmp;
if (l <= -8e+222) {
tmp = Math.sqrt((d * (d / -l))) / Math.sqrt(-h);
} else if (l <= -1.15e+174) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else if (l <= 6.8e-278) {
tmp = Math.sqrt(((d / h) * (d / l))) * (1.0 + (t_0 * ((h / l) * -0.5)));
} else if (l <= 5.6e-250) {
tmp = d / (Math.sqrt(l) * Math.sqrt(h));
} else if (l <= 1.52e+125) {
tmp = d * ((1.0 + (t_0 * ((h * -0.5) / l))) / Math.sqrt((l * h)));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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_m * (M_m * (0.5 / d))), 2.0) tmp = 0 if l <= -8e+222: tmp = math.sqrt((d * (d / -l))) / math.sqrt(-h) elif l <= -1.15e+174: tmp = -d * math.sqrt(((1.0 / h) / l)) elif l <= 6.8e-278: tmp = math.sqrt(((d / h) * (d / l))) * (1.0 + (t_0 * ((h / l) * -0.5))) elif l <= 5.6e-250: tmp = d / (math.sqrt(l) * math.sqrt(h)) elif l <= 1.52e+125: tmp = d * ((1.0 + (t_0 * ((h * -0.5) / l))) / math.sqrt((l * h))) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0 tmp = 0.0 if (l <= -8e+222) tmp = Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h))); elseif (l <= -1.15e+174) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); elseif (l <= 6.8e-278) tmp = Float64(sqrt(Float64(Float64(d / h) * Float64(d / l))) * Float64(1.0 + Float64(t_0 * Float64(Float64(h / l) * -0.5)))); elseif (l <= 5.6e-250) tmp = Float64(d / Float64(sqrt(l) * sqrt(h))); elseif (l <= 1.52e+125) tmp = Float64(d * Float64(Float64(1.0 + Float64(t_0 * Float64(Float64(h * -0.5) / l))) / sqrt(Float64(l * h)))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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_m * (M_m * (0.5 / d))) ^ 2.0;
tmp = 0.0;
if (l <= -8e+222)
tmp = sqrt((d * (d / -l))) / sqrt(-h);
elseif (l <= -1.15e+174)
tmp = -d * sqrt(((1.0 / h) / l));
elseif (l <= 6.8e-278)
tmp = sqrt(((d / h) * (d / l))) * (1.0 + (t_0 * ((h / l) * -0.5)));
elseif (l <= 5.6e-250)
tmp = d / (sqrt(l) * sqrt(h));
elseif (l <= 1.52e+125)
tmp = d * ((1.0 + (t_0 * ((h * -0.5) / l))) / sqrt((l * h)));
else
tmp = (d / sqrt(l)) / sqrt(h);
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[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[l, -8e+222], N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1.15e+174], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 6.8e-278], N[(N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(t$95$0 * N[(N[(h / l), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.6e-250], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.52e+125], N[(d * N[(N[(1.0 + N[(t$95$0 * N[(N[(h * -0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}\\
\mathbf{if}\;\ell \leq -8 \cdot 10^{+222}:\\
\;\;\;\;\frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -1.15 \cdot 10^{+174}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{elif}\;\ell \leq 6.8 \cdot 10^{-278}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}} \cdot \left(1 + t\_0 \cdot \left(\frac{h}{\ell} \cdot -0.5\right)\right)\\
\mathbf{elif}\;\ell \leq 5.6 \cdot 10^{-250}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\mathbf{elif}\;\ell \leq 1.52 \cdot 10^{+125}:\\
\;\;\;\;d \cdot \frac{1 + t\_0 \cdot \frac{h \cdot -0.5}{\ell}}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -8.0000000000000004e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
*-rgt-identity58.4%
frac-2neg58.4%
sqrt-undiv66.3%
associate-*l/66.3%
pow1/266.3%
pow1/266.3%
pow-prod-down66.4%
Applied egg-rr66.4%
unpow1/266.4%
*-commutative66.4%
Simplified66.4%
if -8.0000000000000004e222 < l < -1.1499999999999999e174Initial program 33.7%
Simplified33.7%
add-sqr-sqrt33.7%
pow233.7%
sqrt-prod33.7%
sqrt-pow134.0%
metadata-eval34.0%
pow134.0%
div-inv34.0%
metadata-eval34.0%
associate-*l*34.0%
Applied egg-rr34.0%
Taylor expanded in M around 0 34.2%
clear-num33.4%
sqrt-div33.4%
metadata-eval33.4%
Applied egg-rr34.2%
Taylor expanded in d around -inf 64.8%
mul-1-neg64.5%
distribute-rgt-neg-in64.5%
associate-/r*71.0%
Simplified71.3%
if -1.1499999999999999e174 < l < 6.8000000000000001e-278Initial program 68.4%
Simplified68.4%
add-sqr-sqrt68.4%
pow268.4%
sqrt-prod68.4%
sqrt-pow170.5%
metadata-eval70.5%
pow170.5%
div-inv70.5%
metadata-eval70.5%
associate-*l*70.5%
Applied egg-rr70.5%
pow170.5%
Applied egg-rr59.7%
unpow159.7%
*-lft-identity59.7%
distribute-lft-in59.7%
metadata-eval59.7%
*-lft-identity59.7%
associate-*r*59.7%
unpow259.7%
unpow259.7%
associate-*r/59.7%
associate-*l*59.7%
*-commutative59.7%
associate-*r/59.7%
associate-/l*59.7%
Simplified59.7%
if 6.8000000000000001e-278 < l < 5.60000000000000055e-250Initial program 1.7%
Simplified1.7%
add-sqr-sqrt1.7%
pow21.7%
sqrt-prod1.7%
sqrt-pow11.9%
metadata-eval1.9%
pow11.9%
div-inv1.9%
metadata-eval1.9%
associate-*l*1.9%
Applied egg-rr1.9%
Taylor expanded in M around 0 44.4%
*-commutative1.9%
sqrt-div17.6%
sqrt-div17.6%
frac-times17.6%
add-sqr-sqrt17.6%
Applied egg-rr97.1%
if 5.60000000000000055e-250 < l < 1.5199999999999999e125Initial program 76.1%
Simplified76.0%
add-sqr-sqrt75.8%
pow275.8%
*-commutative75.8%
sqrt-div78.1%
sqrt-div85.2%
frac-times85.3%
add-sqr-sqrt85.3%
Applied egg-rr85.3%
Applied egg-rr80.8%
unpow180.8%
associate-*l/84.5%
associate-/l*84.4%
+-commutative84.4%
associate-*r*84.4%
fma-define84.4%
*-commutative84.4%
associate-*r/84.5%
associate-*l*84.5%
*-commutative84.5%
associate-*r/84.4%
*-commutative84.4%
Simplified84.4%
fma-undefine84.4%
associate-*l/84.4%
associate-*r/84.4%
Applied egg-rr84.4%
if 1.5199999999999999e125 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification72.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
(if (<= l -8.6e+222)
(/ (sqrt (* d (/ d (- l)))) (sqrt (- h)))
(if (<= l -5e-310)
(*
(* d (sqrt (/ (/ 1.0 h) l)))
(+ (* 0.5 (* h (/ (pow (* D_m (* M_m (/ 0.5 d))) 2.0) l))) -1.0))
(if (<= l 3.6e+123)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(/ (/ d (sqrt l)) (sqrt h))))))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 <= -8.6e+222) {
tmp = sqrt((d * (d / -l))) / sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 3.6e+123) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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 <= (-8.6d+222)) then
tmp = sqrt((d * (d / -l))) / sqrt(-h)
else if (l <= (-5d-310)) then
tmp = (d * sqrt(((1.0d0 / h) / l))) * ((0.5d0 * (h * (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) / l))) + (-1.0d0))
else if (l <= 3.6d+123) then
tmp = (1.0d0 - (0.5d0 * (h * (((m_m * ((0.5d0 * d_m) / d)) ** 2.0d0) / l)))) * (d * sqrt((1.0d0 / (l * h))))
else
tmp = (d / sqrt(l)) / sqrt(h)
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 <= -8.6e+222) {
tmp = Math.sqrt((d * (d / -l))) / Math.sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0);
} else if (l <= 3.6e+123) {
tmp = (1.0 - (0.5 * (h * (Math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * Math.sqrt((1.0 / (l * h))));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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 <= -8.6e+222: tmp = math.sqrt((d * (d / -l))) / math.sqrt(-h) elif l <= -5e-310: tmp = (d * math.sqrt(((1.0 / h) / l))) * ((0.5 * (h * (math.pow((D_m * (M_m * (0.5 / d))), 2.0) / l))) + -1.0) elif l <= 3.6e+123: tmp = (1.0 - (0.5 * (h * (math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * math.sqrt((1.0 / (l * h)))) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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 <= -8.6e+222) tmp = Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(Float64(1.0 / h) / l))) * Float64(Float64(0.5 * Float64(h * Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) / l))) + -1.0)); elseif (l <= 3.6e+123) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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 <= -8.6e+222)
tmp = sqrt((d * (d / -l))) / sqrt(-h);
elseif (l <= -5e-310)
tmp = (d * sqrt(((1.0 / h) / l))) * ((0.5 * (h * (((D_m * (M_m * (0.5 / d))) ^ 2.0) / l))) + -1.0);
elseif (l <= 3.6e+123)
tmp = (1.0 - (0.5 * (h * (((M_m * ((0.5 * D_m) / d)) ^ 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
else
tmp = (d / sqrt(l)) / sqrt(h);
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, -8.6e+222], N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(h * N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.6e+123], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 -8.6 \cdot 10^{+222}:\\
\;\;\;\;\frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\right) \cdot \left(0.5 \cdot \left(h \cdot \frac{{\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}}{\ell}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 3.6 \cdot 10^{+123}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -8.5999999999999998e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
*-rgt-identity58.4%
frac-2neg58.4%
sqrt-undiv66.3%
associate-*l/66.3%
pow1/266.3%
pow1/266.3%
pow-prod-down66.4%
Applied egg-rr66.4%
unpow1/266.4%
*-commutative66.4%
Simplified66.4%
if -8.5999999999999998e222 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
clear-num63.5%
un-div-inv63.5%
div-inv63.5%
metadata-eval63.5%
associate-*l*63.5%
Applied egg-rr63.5%
associate-/r/68.4%
*-commutative68.4%
associate-*r*68.4%
associate-*r/68.4%
associate-*l/67.4%
associate-*r/67.4%
*-commutative67.4%
Simplified67.4%
clear-num66.1%
sqrt-div67.3%
metadata-eval67.3%
Applied egg-rr67.3%
Taylor expanded in d around -inf 82.3%
mul-1-neg82.3%
distribute-rgt-neg-in82.3%
associate-/r*83.1%
Simplified83.1%
if -4.999999999999985e-310 < l < 3.59999999999999998e123Initial program 71.9%
Simplified71.9%
Taylor expanded in d around 0 76.1%
*-commutative76.1%
Simplified76.1%
clear-num71.9%
un-div-inv74.1%
div-inv74.1%
metadata-eval74.1%
associate-*l*74.1%
Applied egg-rr78.3%
associate-/r/83.5%
associate-*r/83.5%
*-commutative83.5%
Simplified83.5%
if 3.59999999999999998e123 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification81.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 -9.8e+222)
(/ (sqrt (* d (/ d (- l)))) (sqrt (- h)))
(if (<= l -5e-310)
(*
(* d (pow (* l h) -0.5))
(+ (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))) -1.0))
(if (<= l 7.4e+124)
(*
(- 1.0 (* 0.5 (* h (/ (pow (* M_m (/ (* 0.5 D_m) d)) 2.0) l))))
(* d (sqrt (/ 1.0 (* l h)))))
(/ (/ d (sqrt l)) (sqrt h))))))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 <= -9.8e+222) {
tmp = sqrt((d * (d / -l))) / sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * pow((l * h), -0.5)) * ((0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 7.4e+124) {
tmp = (1.0 - (0.5 * (h * (pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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 <= (-9.8d+222)) then
tmp = sqrt((d * (d / -l))) / sqrt(-h)
else if (l <= (-5d-310)) then
tmp = (d * ((l * h) ** (-0.5d0))) * ((0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else if (l <= 7.4d+124) then
tmp = (1.0d0 - (0.5d0 * (h * (((m_m * ((0.5d0 * d_m) / d)) ** 2.0d0) / l)))) * (d * sqrt((1.0d0 / (l * h))))
else
tmp = (d / sqrt(l)) / sqrt(h)
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 <= -9.8e+222) {
tmp = Math.sqrt((d * (d / -l))) / Math.sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * Math.pow((l * h), -0.5)) * ((0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 7.4e+124) {
tmp = (1.0 - (0.5 * (h * (Math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * Math.sqrt((1.0 / (l * h))));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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 <= -9.8e+222: tmp = math.sqrt((d * (d / -l))) / math.sqrt(-h) elif l <= -5e-310: tmp = (d * math.pow((l * h), -0.5)) * ((0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0) elif l <= 7.4e+124: tmp = (1.0 - (0.5 * (h * (math.pow((M_m * ((0.5 * D_m) / d)), 2.0) / l)))) * (d * math.sqrt((1.0 / (l * h)))) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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 <= -9.8e+222) tmp = Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h))); elseif (l <= -5e-310) tmp = Float64(Float64(d * (Float64(l * h) ^ -0.5)) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); elseif (l <= 7.4e+124) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(h * Float64((Float64(M_m * Float64(Float64(0.5 * D_m) / d)) ^ 2.0) / l)))) * Float64(d * sqrt(Float64(1.0 / Float64(l * h))))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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 <= -9.8e+222)
tmp = sqrt((d * (d / -l))) / sqrt(-h);
elseif (l <= -5e-310)
tmp = (d * ((l * h) ^ -0.5)) * ((0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
elseif (l <= 7.4e+124)
tmp = (1.0 - (0.5 * (h * (((M_m * ((0.5 * D_m) / d)) ^ 2.0) / l)))) * (d * sqrt((1.0 / (l * h))));
else
tmp = (d / sqrt(l)) / sqrt(h);
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, -9.8e+222], N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 7.4e+124], N[(N[(1.0 - N[(0.5 * N[(h * N[(N[Power[N[(M$95$m * N[(N[(0.5 * D$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 -9.8 \cdot 10^{+222}:\\
\;\;\;\;\frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot {\left(\ell \cdot h\right)}^{-0.5}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 7.4 \cdot 10^{+124}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(h \cdot \frac{{\left(M\_m \cdot \frac{0.5 \cdot D\_m}{d}\right)}^{2}}{\ell}\right)\right) \cdot \left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -9.79999999999999981e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
*-rgt-identity58.4%
frac-2neg58.4%
sqrt-undiv66.3%
associate-*l/66.3%
pow1/266.3%
pow1/266.3%
pow-prod-down66.4%
Applied egg-rr66.4%
unpow1/266.4%
*-commutative66.4%
Simplified66.4%
if -9.79999999999999981e222 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
Taylor expanded in d around 0 0.9%
*-commutative0.9%
Simplified0.9%
Taylor expanded in l around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt75.1%
mul-1-neg75.1%
*-commutative75.1%
unpow-175.1%
metadata-eval75.1%
pow-sqr75.1%
rem-sqrt-square75.1%
rem-square-sqrt74.9%
fabs-sqr74.9%
rem-square-sqrt75.1%
*-commutative75.1%
Simplified75.1%
if -4.999999999999985e-310 < l < 7.40000000000000016e124Initial program 71.9%
Simplified71.9%
Taylor expanded in d around 0 76.1%
*-commutative76.1%
Simplified76.1%
clear-num71.9%
un-div-inv74.1%
div-inv74.1%
metadata-eval74.1%
associate-*l*74.1%
Applied egg-rr78.3%
associate-/r/83.5%
associate-*r/83.5%
*-commutative83.5%
Simplified83.5%
if 7.40000000000000016e124 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification77.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
(if (<= l -8.2e+222)
(/ (sqrt (* d (/ d (- l)))) (sqrt (- h)))
(if (<= l -5e-310)
(*
(* d (pow (* l h) -0.5))
(+ (* 0.5 (* (/ h l) (pow (* (/ D_m d) (/ M_m 2.0)) 2.0))) -1.0))
(if (<= l 5e+125)
(*
d
(/
(+ 1.0 (* (pow (* D_m (* M_m (/ 0.5 d))) 2.0) (/ (* h -0.5) l)))
(sqrt (* l h))))
(/ (/ d (sqrt l)) (sqrt h))))))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 <= -8.2e+222) {
tmp = sqrt((d * (d / -l))) / sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * pow((l * h), -0.5)) * ((0.5 * ((h / l) * pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 5e+125) {
tmp = d * ((1.0 + (pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / sqrt((l * h)));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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 <= (-8.2d+222)) then
tmp = sqrt((d * (d / -l))) / sqrt(-h)
else if (l <= (-5d-310)) then
tmp = (d * ((l * h) ** (-0.5d0))) * ((0.5d0 * ((h / l) * (((d_m / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else if (l <= 5d+125) then
tmp = d * ((1.0d0 + (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) * ((h * (-0.5d0)) / l))) / sqrt((l * h)))
else
tmp = (d / sqrt(l)) / sqrt(h)
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 <= -8.2e+222) {
tmp = Math.sqrt((d * (d / -l))) / Math.sqrt(-h);
} else if (l <= -5e-310) {
tmp = (d * Math.pow((l * h), -0.5)) * ((0.5 * ((h / l) * Math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 5e+125) {
tmp = d * ((1.0 + (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / Math.sqrt((l * h)));
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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 <= -8.2e+222: tmp = math.sqrt((d * (d / -l))) / math.sqrt(-h) elif l <= -5e-310: tmp = (d * math.pow((l * h), -0.5)) * ((0.5 * ((h / l) * math.pow(((D_m / d) * (M_m / 2.0)), 2.0))) + -1.0) elif l <= 5e+125: tmp = d * ((1.0 + (math.pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / math.sqrt((l * h))) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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 <= -8.2e+222) tmp = Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h))); elseif (l <= -5e-310) tmp = Float64(Float64(d * (Float64(l * h) ^ -0.5)) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D_m / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); elseif (l <= 5e+125) tmp = Float64(d * Float64(Float64(1.0 + Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) * Float64(Float64(h * -0.5) / l))) / sqrt(Float64(l * h)))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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 <= -8.2e+222)
tmp = sqrt((d * (d / -l))) / sqrt(-h);
elseif (l <= -5e-310)
tmp = (d * ((l * h) ^ -0.5)) * ((0.5 * ((h / l) * (((D_m / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
elseif (l <= 5e+125)
tmp = d * ((1.0 + (((D_m * (M_m * (0.5 / d))) ^ 2.0) * ((h * -0.5) / l))) / sqrt((l * h)));
else
tmp = (d / sqrt(l)) / sqrt(h);
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, -8.2e+222], N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D$95$m / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5e+125], N[(d * N[(N[(1.0 + N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(h * -0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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 -8.2 \cdot 10^{+222}:\\
\;\;\;\;\frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot {\left(\ell \cdot h\right)}^{-0.5}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D\_m}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 5 \cdot 10^{+125}:\\
\;\;\;\;d \cdot \frac{1 + {\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2} \cdot \frac{h \cdot -0.5}{\ell}}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -8.19999999999999974e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
*-rgt-identity58.4%
frac-2neg58.4%
sqrt-undiv66.3%
associate-*l/66.3%
pow1/266.3%
pow1/266.3%
pow-prod-down66.4%
Applied egg-rr66.4%
unpow1/266.4%
*-commutative66.4%
Simplified66.4%
if -8.19999999999999974e222 < l < -4.999999999999985e-310Initial program 63.5%
Simplified63.5%
Taylor expanded in d around 0 0.9%
*-commutative0.9%
Simplified0.9%
Taylor expanded in l around -inf 0.0%
associate-*l*0.0%
unpow20.0%
rem-square-sqrt75.1%
mul-1-neg75.1%
*-commutative75.1%
unpow-175.1%
metadata-eval75.1%
pow-sqr75.1%
rem-sqrt-square75.1%
rem-square-sqrt74.9%
fabs-sqr74.9%
rem-square-sqrt75.1%
*-commutative75.1%
Simplified75.1%
if -4.999999999999985e-310 < l < 4.99999999999999962e125Initial program 71.9%
Simplified71.9%
add-sqr-sqrt71.7%
pow271.7%
*-commutative71.7%
sqrt-div74.6%
sqrt-div81.0%
frac-times81.0%
add-sqr-sqrt81.1%
Applied egg-rr81.1%
Applied egg-rr76.1%
unpow176.1%
associate-*l/79.4%
associate-/l*79.4%
+-commutative79.4%
associate-*r*79.4%
fma-define79.4%
*-commutative79.4%
associate-*r/79.4%
associate-*l*79.4%
*-commutative79.4%
associate-*r/79.4%
*-commutative79.4%
Simplified79.4%
fma-undefine79.4%
associate-*l/79.4%
associate-*r/79.4%
Applied egg-rr79.4%
if 4.99999999999999962e125 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification76.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 (sqrt (* l h))))
(if (<= l -9.4e+222)
(/ (sqrt (* d (/ d (- l)))) (sqrt (- h)))
(if (<= l 1.5e-243)
(/ (fabs d) t_0)
(if (<= l 3.05e+125)
(*
d
(/
(+ 1.0 (* (pow (* D_m (* M_m (/ 0.5 d))) 2.0) (/ (* h -0.5) l)))
t_0))
(/ (/ d (sqrt l)) (sqrt h)))))))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((l * h));
double tmp;
if (l <= -9.4e+222) {
tmp = sqrt((d * (d / -l))) / sqrt(-h);
} else if (l <= 1.5e-243) {
tmp = fabs(d) / t_0;
} else if (l <= 3.05e+125) {
tmp = d * ((1.0 + (pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / t_0);
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
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((l * h))
if (l <= (-9.4d+222)) then
tmp = sqrt((d * (d / -l))) / sqrt(-h)
else if (l <= 1.5d-243) then
tmp = abs(d) / t_0
else if (l <= 3.05d+125) then
tmp = d * ((1.0d0 + (((d_m * (m_m * (0.5d0 / d))) ** 2.0d0) * ((h * (-0.5d0)) / l))) / t_0)
else
tmp = (d / sqrt(l)) / sqrt(h)
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((l * h));
double tmp;
if (l <= -9.4e+222) {
tmp = Math.sqrt((d * (d / -l))) / Math.sqrt(-h);
} else if (l <= 1.5e-243) {
tmp = Math.abs(d) / t_0;
} else if (l <= 3.05e+125) {
tmp = d * ((1.0 + (Math.pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / t_0);
} else {
tmp = (d / Math.sqrt(l)) / Math.sqrt(h);
}
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((l * h)) tmp = 0 if l <= -9.4e+222: tmp = math.sqrt((d * (d / -l))) / math.sqrt(-h) elif l <= 1.5e-243: tmp = math.fabs(d) / t_0 elif l <= 3.05e+125: tmp = d * ((1.0 + (math.pow((D_m * (M_m * (0.5 / d))), 2.0) * ((h * -0.5) / l))) / t_0) else: tmp = (d / math.sqrt(l)) / math.sqrt(h) 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(l * h)) tmp = 0.0 if (l <= -9.4e+222) tmp = Float64(sqrt(Float64(d * Float64(d / Float64(-l)))) / sqrt(Float64(-h))); elseif (l <= 1.5e-243) tmp = Float64(abs(d) / t_0); elseif (l <= 3.05e+125) tmp = Float64(d * Float64(Float64(1.0 + Float64((Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0) * Float64(Float64(h * -0.5) / l))) / t_0)); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); 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((l * h));
tmp = 0.0;
if (l <= -9.4e+222)
tmp = sqrt((d * (d / -l))) / sqrt(-h);
elseif (l <= 1.5e-243)
tmp = abs(d) / t_0;
elseif (l <= 3.05e+125)
tmp = d * ((1.0 + (((D_m * (M_m * (0.5 / d))) ^ 2.0) * ((h * -0.5) / l))) / t_0);
else
tmp = (d / sqrt(l)) / sqrt(h);
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[(l * h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -9.4e+222], N[(N[Sqrt[N[(d * N[(d / (-l)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.5e-243], N[(N[Abs[d], $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[l, 3.05e+125], N[(d * N[(N[(1.0 + N[(N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(h * -0.5), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $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{\ell \cdot h}\\
\mathbf{if}\;\ell \leq -9.4 \cdot 10^{+222}:\\
\;\;\;\;\frac{\sqrt{d \cdot \frac{d}{-\ell}}}{\sqrt{-h}}\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{-243}:\\
\;\;\;\;\frac{\left|d\right|}{t\_0}\\
\mathbf{elif}\;\ell \leq 3.05 \cdot 10^{+125}:\\
\;\;\;\;d \cdot \frac{1 + {\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2} \cdot \frac{h \cdot -0.5}{\ell}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if l < -9.3999999999999998e222Initial program 57.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-prod57.8%
sqrt-pow160.6%
metadata-eval60.6%
pow160.6%
div-inv60.6%
metadata-eval60.6%
associate-*l*60.6%
Applied egg-rr60.6%
Taylor expanded in M around 0 58.4%
*-rgt-identity58.4%
frac-2neg58.4%
sqrt-undiv66.3%
associate-*l/66.3%
pow1/266.3%
pow1/266.3%
pow-prod-down66.4%
Applied egg-rr66.4%
unpow1/266.4%
*-commutative66.4%
Simplified66.4%
if -9.3999999999999998e222 < l < 1.5000000000000001e-243Initial program 61.1%
Simplified61.1%
add-sqr-sqrt61.1%
pow261.1%
sqrt-prod61.1%
sqrt-pow162.9%
metadata-eval62.9%
pow162.9%
div-inv62.9%
metadata-eval62.9%
associate-*l*62.9%
Applied egg-rr62.9%
Taylor expanded in M around 0 31.7%
pow131.7%
*-rgt-identity31.7%
sqrt-unprod26.5%
Applied egg-rr26.5%
unpow126.5%
Simplified26.5%
frac-times25.0%
sqrt-div30.8%
pow230.8%
Applied egg-rr30.8%
unpow230.8%
rem-sqrt-square42.5%
Simplified42.5%
if 1.5000000000000001e-243 < l < 3.04999999999999988e125Initial program 76.1%
Simplified76.0%
add-sqr-sqrt75.8%
pow275.8%
*-commutative75.8%
sqrt-div78.1%
sqrt-div85.2%
frac-times85.3%
add-sqr-sqrt85.3%
Applied egg-rr85.3%
Applied egg-rr80.8%
unpow180.8%
associate-*l/84.5%
associate-/l*84.4%
+-commutative84.4%
associate-*r*84.4%
fma-define84.4%
*-commutative84.4%
associate-*r/84.5%
associate-*l*84.5%
*-commutative84.5%
associate-*r/84.4%
*-commutative84.4%
Simplified84.4%
fma-undefine84.4%
associate-*l/84.4%
associate-*r/84.4%
Applied egg-rr84.4%
if 3.04999999999999988e125 < l Initial program 63.7%
Simplified63.7%
add-sqr-sqrt63.7%
pow263.7%
sqrt-prod63.7%
sqrt-pow164.0%
metadata-eval64.0%
pow164.0%
div-inv64.0%
metadata-eval64.0%
associate-*l*64.0%
Applied egg-rr64.0%
Taylor expanded in M around 0 61.1%
*-commutative64.0%
sqrt-div68.9%
sqrt-div81.0%
frac-times80.7%
add-sqr-sqrt81.3%
Applied egg-rr78.4%
associate-/r*81.5%
Simplified78.6%
Final simplification63.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
(if (<= h -2.8e+55)
(/ (sqrt (/ d l)) (sqrt (/ h d)))
(if (<= h 3.9e-295)
(/ (fabs d) (sqrt (* l h)))
(/ d (* (sqrt l) (sqrt h))))))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 (h <= -2.8e+55) {
tmp = sqrt((d / l)) / sqrt((h / d));
} else if (h <= 3.9e-295) {
tmp = fabs(d) / sqrt((l * h));
} else {
tmp = d / (sqrt(l) * sqrt(h));
}
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 (h <= (-2.8d+55)) then
tmp = sqrt((d / l)) / sqrt((h / d))
else if (h <= 3.9d-295) then
tmp = abs(d) / sqrt((l * h))
else
tmp = d / (sqrt(l) * sqrt(h))
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 (h <= -2.8e+55) {
tmp = Math.sqrt((d / l)) / Math.sqrt((h / d));
} else if (h <= 3.9e-295) {
tmp = Math.abs(d) / Math.sqrt((l * h));
} else {
tmp = d / (Math.sqrt(l) * Math.sqrt(h));
}
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 h <= -2.8e+55: tmp = math.sqrt((d / l)) / math.sqrt((h / d)) elif h <= 3.9e-295: tmp = math.fabs(d) / math.sqrt((l * h)) else: tmp = d / (math.sqrt(l) * math.sqrt(h)) 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 (h <= -2.8e+55) tmp = Float64(sqrt(Float64(d / l)) / sqrt(Float64(h / d))); elseif (h <= 3.9e-295) tmp = Float64(abs(d) / sqrt(Float64(l * h))); else tmp = Float64(d / Float64(sqrt(l) * sqrt(h))); 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 (h <= -2.8e+55)
tmp = sqrt((d / l)) / sqrt((h / d));
elseif (h <= 3.9e-295)
tmp = abs(d) / sqrt((l * h));
else
tmp = d / (sqrt(l) * sqrt(h));
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[h, -2.8e+55], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(h / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 3.9e-295], N[(N[Abs[d], $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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}\;h \leq -2.8 \cdot 10^{+55}:\\
\;\;\;\;\frac{\sqrt{\frac{d}{\ell}}}{\sqrt{\frac{h}{d}}}\\
\mathbf{elif}\;h \leq 3.9 \cdot 10^{-295}:\\
\;\;\;\;\frac{\left|d\right|}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if h < -2.8000000000000001e55Initial program 58.9%
Simplified58.9%
add-sqr-sqrt58.9%
pow258.9%
sqrt-prod58.8%
sqrt-pow158.9%
metadata-eval58.9%
pow158.9%
div-inv58.9%
metadata-eval58.9%
associate-*l*58.9%
Applied egg-rr58.9%
Taylor expanded in M around 0 40.8%
pow140.8%
*-rgt-identity40.8%
sqrt-unprod32.0%
Applied egg-rr32.0%
unpow132.0%
Simplified32.0%
sqrt-prod40.8%
clear-num40.8%
sqrt-div40.8%
metadata-eval40.8%
associate-*l/40.9%
*-un-lft-identity40.9%
Applied egg-rr40.9%
if -2.8000000000000001e55 < h < 3.9e-295Initial program 63.4%
Simplified63.4%
add-sqr-sqrt63.4%
pow263.4%
sqrt-prod63.4%
sqrt-pow166.4%
metadata-eval66.4%
pow166.4%
div-inv66.4%
metadata-eval66.4%
associate-*l*66.4%
Applied egg-rr66.4%
Taylor expanded in M around 0 32.4%
pow132.4%
*-rgt-identity32.4%
sqrt-unprod28.2%
Applied egg-rr28.2%
unpow128.2%
Simplified28.2%
frac-times30.0%
sqrt-div37.9%
pow237.9%
Applied egg-rr37.9%
unpow237.9%
rem-sqrt-square51.0%
Simplified51.0%
if 3.9e-295 < h Initial program 70.2%
Simplified70.2%
add-sqr-sqrt70.2%
pow270.2%
sqrt-prod70.2%
sqrt-pow171.0%
metadata-eval71.0%
pow171.0%
div-inv71.0%
metadata-eval71.0%
associate-*l*71.0%
Applied egg-rr71.0%
Taylor expanded in M around 0 47.7%
*-commutative71.0%
sqrt-div74.6%
sqrt-div81.4%
frac-times81.3%
add-sqr-sqrt81.6%
Applied egg-rr57.3%
Final simplification52.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
(if (<= h -9.6e+54)
(sqrt (* (/ d h) (/ d l)))
(if (<= h 2.6e+19)
(/ (fabs d) (sqrt (* l h)))
(sqrt (* (/ d h) (* d (/ 1.0 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 (h <= -9.6e+54) {
tmp = sqrt(((d / h) * (d / l)));
} else if (h <= 2.6e+19) {
tmp = fabs(d) / sqrt((l * h));
} else {
tmp = sqrt(((d / h) * (d * (1.0 / 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 (h <= (-9.6d+54)) then
tmp = sqrt(((d / h) * (d / l)))
else if (h <= 2.6d+19) then
tmp = abs(d) / sqrt((l * h))
else
tmp = sqrt(((d / h) * (d * (1.0d0 / 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 (h <= -9.6e+54) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else if (h <= 2.6e+19) {
tmp = Math.abs(d) / Math.sqrt((l * h));
} else {
tmp = Math.sqrt(((d / h) * (d * (1.0 / 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 h <= -9.6e+54: tmp = math.sqrt(((d / h) * (d / l))) elif h <= 2.6e+19: tmp = math.fabs(d) / math.sqrt((l * h)) else: tmp = math.sqrt(((d / h) * (d * (1.0 / 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 (h <= -9.6e+54) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); elseif (h <= 2.6e+19) tmp = Float64(abs(d) / sqrt(Float64(l * h))); else tmp = sqrt(Float64(Float64(d / h) * Float64(d * Float64(1.0 / 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 (h <= -9.6e+54)
tmp = sqrt(((d / h) * (d / l)));
elseif (h <= 2.6e+19)
tmp = abs(d) / sqrt((l * h));
else
tmp = sqrt(((d / h) * (d * (1.0 / 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[h, -9.6e+54], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[h, 2.6e+19], N[(N[Abs[d], $MachinePrecision] / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d * N[(1.0 / 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}\;h \leq -9.6 \cdot 10^{+54}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;h \leq 2.6 \cdot 10^{+19}:\\
\;\;\;\;\frac{\left|d\right|}{\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \left(d \cdot \frac{1}{\ell}\right)}\\
\end{array}
\end{array}
if h < -9.59999999999999993e54Initial program 58.9%
Simplified58.9%
add-sqr-sqrt58.9%
pow258.9%
sqrt-prod58.8%
sqrt-pow158.9%
metadata-eval58.9%
pow158.9%
div-inv58.9%
metadata-eval58.9%
associate-*l*58.9%
Applied egg-rr58.9%
Taylor expanded in M around 0 40.8%
pow140.8%
*-rgt-identity40.8%
sqrt-unprod32.0%
Applied egg-rr32.0%
unpow132.0%
Simplified32.0%
if -9.59999999999999993e54 < h < 2.6e19Initial program 65.3%
Simplified64.6%
add-sqr-sqrt64.6%
pow264.6%
sqrt-prod64.6%
sqrt-pow167.0%
metadata-eval67.0%
pow167.0%
div-inv67.0%
metadata-eval67.0%
associate-*l*67.0%
Applied egg-rr67.0%
Taylor expanded in M around 0 37.9%
pow137.9%
*-rgt-identity37.9%
sqrt-unprod30.7%
Applied egg-rr30.7%
unpow130.7%
Simplified30.7%
frac-times31.7%
sqrt-div38.5%
pow238.5%
Applied egg-rr38.5%
unpow238.5%
rem-sqrt-square53.0%
Simplified53.0%
if 2.6e19 < h Initial program 73.3%
Simplified75.0%
add-sqr-sqrt75.0%
pow275.0%
sqrt-prod75.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
div-inv75.1%
metadata-eval75.1%
associate-*l*75.1%
Applied egg-rr75.1%
Taylor expanded in M around 0 51.3%
pow151.3%
*-rgt-identity51.3%
sqrt-unprod41.4%
Applied egg-rr41.4%
unpow141.4%
Simplified41.4%
clear-num41.3%
associate-/r/41.4%
Applied egg-rr41.4%
Final simplification46.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 (if (<= d 2.1e-227) (* (- d) (sqrt (/ (/ 1.0 h) l))) (/ d (* (sqrt l) (sqrt h)))))
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 (d <= 2.1e-227) {
tmp = -d * sqrt(((1.0 / h) / l));
} else {
tmp = d / (sqrt(l) * sqrt(h));
}
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 <= 2.1d-227) then
tmp = -d * sqrt(((1.0d0 / h) / l))
else
tmp = d / (sqrt(l) * sqrt(h))
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 (d <= 2.1e-227) {
tmp = -d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = d / (Math.sqrt(l) * Math.sqrt(h));
}
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 d <= 2.1e-227: tmp = -d * math.sqrt(((1.0 / h) / l)) else: tmp = d / (math.sqrt(l) * math.sqrt(h)) 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 (d <= 2.1e-227) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = Float64(d / Float64(sqrt(l) * sqrt(h))); 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 <= 2.1e-227)
tmp = -d * sqrt(((1.0 / h) / l));
else
tmp = d / (sqrt(l) * sqrt(h));
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[d, 2.1e-227], N[((-d) * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(d / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $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}\;d \leq 2.1 \cdot 10^{-227}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if d < 2.1e-227Initial program 59.3%
Simplified60.0%
add-sqr-sqrt60.0%
pow260.0%
sqrt-prod59.9%
sqrt-pow161.8%
metadata-eval61.8%
pow161.8%
div-inv61.8%
metadata-eval61.8%
associate-*l*61.8%
Applied egg-rr61.8%
Taylor expanded in M around 0 33.9%
clear-num61.9%
sqrt-div62.7%
metadata-eval62.7%
Applied egg-rr34.8%
Taylor expanded in d around -inf 38.7%
mul-1-neg66.9%
distribute-rgt-neg-in66.9%
associate-/r*67.6%
Simplified39.3%
if 2.1e-227 < d Initial program 74.6%
Simplified73.7%
add-sqr-sqrt73.7%
pow273.7%
sqrt-prod73.7%
sqrt-pow174.6%
metadata-eval74.6%
pow174.6%
div-inv74.6%
metadata-eval74.6%
associate-*l*74.6%
Applied egg-rr74.6%
Taylor expanded in M around 0 50.9%
*-commutative74.6%
sqrt-div77.8%
sqrt-div85.2%
frac-times85.2%
add-sqr-sqrt85.5%
Applied egg-rr63.4%
Final simplification49.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 (<= h -1.8e+54)
(sqrt (* (/ d h) (/ d l)))
(if (<= h -1e-309)
(* d (- (sqrt (/ 1.0 (* l h)))))
(if (<= h 2.9e+19)
(* d (sqrt (/ (/ 1.0 h) l)))
(sqrt (* (/ d h) (* d (/ 1.0 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 (h <= -1.8e+54) {
tmp = sqrt(((d / h) * (d / l)));
} else if (h <= -1e-309) {
tmp = d * -sqrt((1.0 / (l * h)));
} else if (h <= 2.9e+19) {
tmp = d * sqrt(((1.0 / h) / l));
} else {
tmp = sqrt(((d / h) * (d * (1.0 / 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 (h <= (-1.8d+54)) then
tmp = sqrt(((d / h) * (d / l)))
else if (h <= (-1d-309)) then
tmp = d * -sqrt((1.0d0 / (l * h)))
else if (h <= 2.9d+19) then
tmp = d * sqrt(((1.0d0 / h) / l))
else
tmp = sqrt(((d / h) * (d * (1.0d0 / 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 (h <= -1.8e+54) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else if (h <= -1e-309) {
tmp = d * -Math.sqrt((1.0 / (l * h)));
} else if (h <= 2.9e+19) {
tmp = d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = Math.sqrt(((d / h) * (d * (1.0 / 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 h <= -1.8e+54: tmp = math.sqrt(((d / h) * (d / l))) elif h <= -1e-309: tmp = d * -math.sqrt((1.0 / (l * h))) elif h <= 2.9e+19: tmp = d * math.sqrt(((1.0 / h) / l)) else: tmp = math.sqrt(((d / h) * (d * (1.0 / 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 (h <= -1.8e+54) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); elseif (h <= -1e-309) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(l * h))))); elseif (h <= 2.9e+19) tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = sqrt(Float64(Float64(d / h) * Float64(d * Float64(1.0 / 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 (h <= -1.8e+54)
tmp = sqrt(((d / h) * (d / l)));
elseif (h <= -1e-309)
tmp = d * -sqrt((1.0 / (l * h)));
elseif (h <= 2.9e+19)
tmp = d * sqrt(((1.0 / h) / l));
else
tmp = sqrt(((d / h) * (d * (1.0 / 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[h, -1.8e+54], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[h, -1e-309], N[(d * (-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[h, 2.9e+19], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d * N[(1.0 / 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}\;h \leq -1.8 \cdot 10^{+54}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;h \leq -1 \cdot 10^{-309}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{elif}\;h \leq 2.9 \cdot 10^{+19}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \left(d \cdot \frac{1}{\ell}\right)}\\
\end{array}
\end{array}
if h < -1.8000000000000001e54Initial program 58.9%
Simplified58.9%
add-sqr-sqrt58.9%
pow258.9%
sqrt-prod58.8%
sqrt-pow158.9%
metadata-eval58.9%
pow158.9%
div-inv58.9%
metadata-eval58.9%
associate-*l*58.9%
Applied egg-rr58.9%
Taylor expanded in M around 0 40.8%
pow140.8%
*-rgt-identity40.8%
sqrt-unprod32.0%
Applied egg-rr32.0%
unpow132.0%
Simplified32.0%
if -1.8000000000000001e54 < h < -1.000000000000002e-309Initial program 64.3%
Simplified64.3%
add-sqr-sqrt64.3%
pow264.3%
sqrt-prod64.3%
sqrt-pow167.4%
metadata-eval67.4%
pow167.4%
div-inv67.4%
metadata-eval67.4%
associate-*l*67.4%
Applied egg-rr67.4%
Taylor expanded in M around 0 33.4%
pow133.4%
*-rgt-identity33.4%
sqrt-unprod29.0%
Applied egg-rr29.0%
unpow129.0%
Simplified29.0%
Taylor expanded in d around -inf 50.4%
mul-1-neg50.4%
*-commutative50.4%
distribute-rgt-neg-in50.4%
Simplified50.4%
if -1.000000000000002e-309 < h < 2.9e19Initial program 66.4%
Simplified65.1%
add-sqr-sqrt64.9%
pow264.9%
*-commutative64.9%
sqrt-div71.3%
sqrt-div81.5%
frac-times81.5%
add-sqr-sqrt81.7%
Applied egg-rr81.7%
Applied egg-rr78.2%
unpow178.2%
associate-*l/79.7%
associate-/l*79.6%
+-commutative79.6%
associate-*r*79.6%
fma-define79.6%
*-commutative79.6%
associate-*r/81.0%
associate-*l*81.0%
*-commutative81.0%
associate-*r/81.0%
*-commutative81.0%
Simplified81.0%
Taylor expanded in h around 0 56.0%
associate-/r*56.1%
Simplified56.1%
if 2.9e19 < h Initial program 73.3%
Simplified75.0%
add-sqr-sqrt75.0%
pow275.0%
sqrt-prod75.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
div-inv75.1%
metadata-eval75.1%
associate-*l*75.1%
Applied egg-rr75.1%
Taylor expanded in M around 0 51.3%
pow151.3%
*-rgt-identity51.3%
sqrt-unprod41.4%
Applied egg-rr41.4%
unpow141.4%
Simplified41.4%
clear-num41.3%
associate-/r/41.4%
Applied egg-rr41.4%
Final simplification46.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 h) (/ d l)))))
(if (<= h -2.4e+55)
t_0
(if (<= h -5e-310)
(* d (- (sqrt (/ 1.0 (* l h)))))
(if (<= h 3.15e+19) (* d (sqrt (/ (/ 1.0 h) l))) t_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 = sqrt(((d / h) * (d / l)));
double tmp;
if (h <= -2.4e+55) {
tmp = t_0;
} else if (h <= -5e-310) {
tmp = d * -sqrt((1.0 / (l * h)));
} else if (h <= 3.15e+19) {
tmp = d * sqrt(((1.0 / h) / l));
} else {
tmp = t_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 = sqrt(((d / h) * (d / l)))
if (h <= (-2.4d+55)) then
tmp = t_0
else if (h <= (-5d-310)) then
tmp = d * -sqrt((1.0d0 / (l * h)))
else if (h <= 3.15d+19) then
tmp = d * sqrt(((1.0d0 / h) / l))
else
tmp = t_0
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 / h) * (d / l)));
double tmp;
if (h <= -2.4e+55) {
tmp = t_0;
} else if (h <= -5e-310) {
tmp = d * -Math.sqrt((1.0 / (l * h)));
} else if (h <= 3.15e+19) {
tmp = d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = t_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 = math.sqrt(((d / h) * (d / l))) tmp = 0 if h <= -2.4e+55: tmp = t_0 elif h <= -5e-310: tmp = d * -math.sqrt((1.0 / (l * h))) elif h <= 3.15e+19: tmp = d * math.sqrt(((1.0 / h) / l)) else: tmp = t_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 = sqrt(Float64(Float64(d / h) * Float64(d / l))) tmp = 0.0 if (h <= -2.4e+55) tmp = t_0; elseif (h <= -5e-310) tmp = Float64(d * Float64(-sqrt(Float64(1.0 / Float64(l * h))))); elseif (h <= 3.15e+19) tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = t_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 = sqrt(((d / h) * (d / l)));
tmp = 0.0;
if (h <= -2.4e+55)
tmp = t_0;
elseif (h <= -5e-310)
tmp = d * -sqrt((1.0 / (l * h)));
elseif (h <= 3.15e+19)
tmp = d * sqrt(((1.0 / h) / l));
else
tmp = t_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[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -2.4e+55], t$95$0, If[LessEqual[h, -5e-310], N[(d * (-N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[h, 3.15e+19], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\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}{h} \cdot \frac{d}{\ell}}\\
\mathbf{if}\;h \leq -2.4 \cdot 10^{+55}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;h \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{1}{\ell \cdot h}}\right)\\
\mathbf{elif}\;h \leq 3.15 \cdot 10^{+19}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if h < -2.3999999999999999e55 or 3.15e19 < h Initial program 67.0%
Simplified67.9%
add-sqr-sqrt67.9%
pow267.9%
sqrt-prod67.9%
sqrt-pow168.0%
metadata-eval68.0%
pow168.0%
div-inv68.0%
metadata-eval68.0%
associate-*l*68.0%
Applied egg-rr68.0%
Taylor expanded in M around 0 46.7%
pow146.7%
*-rgt-identity46.7%
sqrt-unprod37.3%
Applied egg-rr37.3%
unpow137.3%
Simplified37.3%
if -2.3999999999999999e55 < h < -4.999999999999985e-310Initial program 64.3%
Simplified64.3%
add-sqr-sqrt64.3%
pow264.3%
sqrt-prod64.3%
sqrt-pow167.4%
metadata-eval67.4%
pow167.4%
div-inv67.4%
metadata-eval67.4%
associate-*l*67.4%
Applied egg-rr67.4%
Taylor expanded in M around 0 33.4%
pow133.4%
*-rgt-identity33.4%
sqrt-unprod29.0%
Applied egg-rr29.0%
unpow129.0%
Simplified29.0%
Taylor expanded in d around -inf 50.4%
mul-1-neg50.4%
*-commutative50.4%
distribute-rgt-neg-in50.4%
Simplified50.4%
if -4.999999999999985e-310 < h < 3.15e19Initial program 66.4%
Simplified65.1%
add-sqr-sqrt64.9%
pow264.9%
*-commutative64.9%
sqrt-div71.3%
sqrt-div81.5%
frac-times81.5%
add-sqr-sqrt81.7%
Applied egg-rr81.7%
Applied egg-rr78.2%
unpow178.2%
associate-*l/79.7%
associate-/l*79.6%
+-commutative79.6%
associate-*r*79.6%
fma-define79.6%
*-commutative79.6%
associate-*r/81.0%
associate-*l*81.0%
*-commutative81.0%
associate-*r/81.0%
*-commutative81.0%
Simplified81.0%
Taylor expanded in h around 0 56.0%
associate-/r*56.1%
Simplified56.1%
Final simplification46.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
(let* ((t_0 (sqrt (/ (/ 1.0 h) l))))
(if (<= h 5.2e-307)
(* (- d) t_0)
(if (<= h 2.6e+19) (* d t_0) (sqrt (* (/ d h) (* d (/ 1.0 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(((1.0 / h) / l));
double tmp;
if (h <= 5.2e-307) {
tmp = -d * t_0;
} else if (h <= 2.6e+19) {
tmp = d * t_0;
} else {
tmp = sqrt(((d / h) * (d * (1.0 / 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(((1.0d0 / h) / l))
if (h <= 5.2d-307) then
tmp = -d * t_0
else if (h <= 2.6d+19) then
tmp = d * t_0
else
tmp = sqrt(((d / h) * (d * (1.0d0 / 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(((1.0 / h) / l));
double tmp;
if (h <= 5.2e-307) {
tmp = -d * t_0;
} else if (h <= 2.6e+19) {
tmp = d * t_0;
} else {
tmp = Math.sqrt(((d / h) * (d * (1.0 / 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(((1.0 / h) / l)) tmp = 0 if h <= 5.2e-307: tmp = -d * t_0 elif h <= 2.6e+19: tmp = d * t_0 else: tmp = math.sqrt(((d / h) * (d * (1.0 / 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(Float64(1.0 / h) / l)) tmp = 0.0 if (h <= 5.2e-307) tmp = Float64(Float64(-d) * t_0); elseif (h <= 2.6e+19) tmp = Float64(d * t_0); else tmp = sqrt(Float64(Float64(d / h) * Float64(d * Float64(1.0 / 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(((1.0 / h) / l));
tmp = 0.0;
if (h <= 5.2e-307)
tmp = -d * t_0;
elseif (h <= 2.6e+19)
tmp = d * t_0;
else
tmp = sqrt(((d / h) * (d * (1.0 / 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[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, 5.2e-307], N[((-d) * t$95$0), $MachinePrecision], If[LessEqual[h, 2.6e+19], N[(d * t$95$0), $MachinePrecision], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d * N[(1.0 / 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{\frac{1}{h}}{\ell}}\\
\mathbf{if}\;h \leq 5.2 \cdot 10^{-307}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{elif}\;h \leq 2.6 \cdot 10^{+19}:\\
\;\;\;\;d \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \left(d \cdot \frac{1}{\ell}\right)}\\
\end{array}
\end{array}
if h < 5.19999999999999992e-307Initial program 62.4%
Simplified62.4%
add-sqr-sqrt62.4%
pow262.4%
sqrt-prod62.4%
sqrt-pow164.5%
metadata-eval64.5%
pow164.5%
div-inv64.5%
metadata-eval64.5%
associate-*l*64.5%
Applied egg-rr64.5%
Taylor expanded in M around 0 35.9%
clear-num64.6%
sqrt-div65.5%
metadata-eval65.5%
Applied egg-rr36.9%
Taylor expanded in d around -inf 40.5%
mul-1-neg74.2%
distribute-rgt-neg-in74.2%
associate-/r*74.9%
Simplified41.2%
if 5.19999999999999992e-307 < h < 2.6e19Initial program 66.4%
Simplified65.1%
add-sqr-sqrt64.9%
pow264.9%
*-commutative64.9%
sqrt-div71.3%
sqrt-div81.5%
frac-times81.5%
add-sqr-sqrt81.7%
Applied egg-rr81.7%
Applied egg-rr78.2%
unpow178.2%
associate-*l/79.7%
associate-/l*79.6%
+-commutative79.6%
associate-*r*79.6%
fma-define79.6%
*-commutative79.6%
associate-*r/81.0%
associate-*l*81.0%
*-commutative81.0%
associate-*r/81.0%
*-commutative81.0%
Simplified81.0%
Taylor expanded in h around 0 56.0%
associate-/r*56.1%
Simplified56.1%
if 2.6e19 < h Initial program 73.3%
Simplified75.0%
add-sqr-sqrt75.0%
pow275.0%
sqrt-prod75.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
div-inv75.1%
metadata-eval75.1%
associate-*l*75.1%
Applied egg-rr75.1%
Taylor expanded in M around 0 51.3%
pow151.3%
*-rgt-identity51.3%
sqrt-unprod41.4%
Applied egg-rr41.4%
unpow141.4%
Simplified41.4%
clear-num41.3%
associate-/r/41.4%
Applied egg-rr41.4%
Final simplification45.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
(if (<= l -8e-256)
(sqrt (* (/ d h) (/ d l)))
(if (<= l 5.4e+210)
(* d (sqrt (/ (/ 1.0 h) l)))
(sqrt (/ (* d (/ d l)) h)))))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 <= -8e-256) {
tmp = sqrt(((d / h) * (d / l)));
} else if (l <= 5.4e+210) {
tmp = d * sqrt(((1.0 / h) / l));
} else {
tmp = sqrt(((d * (d / l)) / h));
}
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 <= (-8d-256)) then
tmp = sqrt(((d / h) * (d / l)))
else if (l <= 5.4d+210) then
tmp = d * sqrt(((1.0d0 / h) / l))
else
tmp = sqrt(((d * (d / l)) / h))
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 <= -8e-256) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else if (l <= 5.4e+210) {
tmp = d * Math.sqrt(((1.0 / h) / l));
} else {
tmp = Math.sqrt(((d * (d / l)) / h));
}
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 <= -8e-256: tmp = math.sqrt(((d / h) * (d / l))) elif l <= 5.4e+210: tmp = d * math.sqrt(((1.0 / h) / l)) else: tmp = math.sqrt(((d * (d / l)) / h)) 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 <= -8e-256) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); elseif (l <= 5.4e+210) tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); else tmp = sqrt(Float64(Float64(d * Float64(d / l)) / h)); 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 <= -8e-256)
tmp = sqrt(((d / h) * (d / l)));
elseif (l <= 5.4e+210)
tmp = d * sqrt(((1.0 / h) / l));
else
tmp = sqrt(((d * (d / l)) / h));
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, -8e-256], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 5.4e+210], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(d * N[(d / l), $MachinePrecision]), $MachinePrecision] / h), $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 -8 \cdot 10^{-256}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq 5.4 \cdot 10^{+210}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d \cdot \frac{d}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -7.99999999999999982e-256Initial program 62.8%
Simplified62.8%
add-sqr-sqrt62.8%
pow262.8%
sqrt-prod62.8%
sqrt-pow165.1%
metadata-eval65.1%
pow165.1%
div-inv65.1%
metadata-eval65.1%
associate-*l*65.1%
Applied egg-rr65.1%
Taylor expanded in M around 0 37.8%
pow137.8%
*-rgt-identity37.8%
sqrt-unprod31.4%
Applied egg-rr31.4%
unpow131.4%
Simplified31.4%
if -7.99999999999999982e-256 < l < 5.3999999999999998e210Initial program 67.4%
Simplified67.4%
add-sqr-sqrt67.2%
pow267.2%
*-commutative67.2%
sqrt-div64.4%
sqrt-div70.7%
frac-times70.7%
add-sqr-sqrt70.8%
Applied egg-rr70.8%
Applied egg-rr63.9%
unpow163.9%
associate-*l/66.5%
associate-/l*66.4%
+-commutative66.4%
associate-*r*66.4%
fma-define66.4%
*-commutative66.4%
associate-*r/66.4%
associate-*l*66.4%
*-commutative66.4%
associate-*r/66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in h around 0 43.1%
associate-/r*43.2%
Simplified43.2%
if 5.3999999999999998e210 < l Initial program 75.3%
Simplified75.3%
add-sqr-sqrt75.3%
pow275.3%
sqrt-prod75.3%
sqrt-pow175.5%
metadata-eval75.5%
pow175.5%
div-inv75.5%
metadata-eval75.5%
associate-*l*75.5%
Applied egg-rr75.5%
Taylor expanded in M around 0 70.6%
pow170.6%
*-rgt-identity70.6%
sqrt-unprod61.0%
Applied egg-rr61.0%
unpow161.0%
Simplified61.0%
associate-*l/70.4%
Applied egg-rr70.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
(if (<= l -7.5e-256)
(sqrt (* (/ d h) (/ d l)))
(if (<= l 7.2e+210)
(* d (sqrt (/ 1.0 (* l h))))
(sqrt (/ (* d (/ d l)) h)))))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 <= -7.5e-256) {
tmp = sqrt(((d / h) * (d / l)));
} else if (l <= 7.2e+210) {
tmp = d * sqrt((1.0 / (l * h)));
} else {
tmp = sqrt(((d * (d / l)) / h));
}
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 <= (-7.5d-256)) then
tmp = sqrt(((d / h) * (d / l)))
else if (l <= 7.2d+210) then
tmp = d * sqrt((1.0d0 / (l * h)))
else
tmp = sqrt(((d * (d / l)) / h))
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 <= -7.5e-256) {
tmp = Math.sqrt(((d / h) * (d / l)));
} else if (l <= 7.2e+210) {
tmp = d * Math.sqrt((1.0 / (l * h)));
} else {
tmp = Math.sqrt(((d * (d / l)) / h));
}
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 <= -7.5e-256: tmp = math.sqrt(((d / h) * (d / l))) elif l <= 7.2e+210: tmp = d * math.sqrt((1.0 / (l * h))) else: tmp = math.sqrt(((d * (d / l)) / h)) 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 <= -7.5e-256) tmp = sqrt(Float64(Float64(d / h) * Float64(d / l))); elseif (l <= 7.2e+210) tmp = Float64(d * sqrt(Float64(1.0 / Float64(l * h)))); else tmp = sqrt(Float64(Float64(d * Float64(d / l)) / h)); 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 <= -7.5e-256)
tmp = sqrt(((d / h) * (d / l)));
elseif (l <= 7.2e+210)
tmp = d * sqrt((1.0 / (l * h)));
else
tmp = sqrt(((d * (d / l)) / h));
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, -7.5e-256], N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 7.2e+210], N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(d * N[(d / l), $MachinePrecision]), $MachinePrecision] / h), $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 -7.5 \cdot 10^{-256}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{+210}:\\
\;\;\;\;d \cdot \sqrt{\frac{1}{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{d \cdot \frac{d}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -7.50000000000000005e-256Initial program 62.8%
Simplified62.8%
add-sqr-sqrt62.8%
pow262.8%
sqrt-prod62.8%
sqrt-pow165.1%
metadata-eval65.1%
pow165.1%
div-inv65.1%
metadata-eval65.1%
associate-*l*65.1%
Applied egg-rr65.1%
Taylor expanded in M around 0 37.8%
pow137.8%
*-rgt-identity37.8%
sqrt-unprod31.4%
Applied egg-rr31.4%
unpow131.4%
Simplified31.4%
if -7.50000000000000005e-256 < l < 7.2000000000000005e210Initial program 67.4%
Simplified67.4%
add-sqr-sqrt67.2%
pow267.2%
*-commutative67.2%
sqrt-div64.4%
sqrt-div70.7%
frac-times70.7%
add-sqr-sqrt70.8%
Applied egg-rr70.8%
Applied egg-rr63.9%
unpow163.9%
associate-*l/66.5%
associate-/l*66.4%
+-commutative66.4%
associate-*r*66.4%
fma-define66.4%
*-commutative66.4%
associate-*r/66.4%
associate-*l*66.4%
*-commutative66.4%
associate-*r/66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in h around 0 43.1%
if 7.2000000000000005e210 < l Initial program 75.3%
Simplified75.3%
add-sqr-sqrt75.3%
pow275.3%
sqrt-prod75.3%
sqrt-pow175.5%
metadata-eval75.5%
pow175.5%
div-inv75.5%
metadata-eval75.5%
associate-*l*75.5%
Applied egg-rr75.5%
Taylor expanded in M around 0 70.6%
pow170.6%
*-rgt-identity70.6%
sqrt-unprod61.0%
Applied egg-rr61.0%
unpow161.0%
Simplified61.0%
associate-*l/70.4%
Applied egg-rr70.4%
Final simplification39.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 (sqrt (* (/ d h) (/ d 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 sqrt(((d / h) * (d / 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 = sqrt(((d / h) * (d / 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 Math.sqrt(((d / h) * (d / 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 math.sqrt(((d / h) * (d / 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 sqrt(Float64(Float64(d / h) * Float64(d / 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 = sqrt(((d / h) * (d / 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[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / 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])\\
\\
\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}
\end{array}
Initial program 65.9%
Simplified65.9%
add-sqr-sqrt65.9%
pow265.9%
sqrt-prod65.9%
sqrt-pow167.4%
metadata-eval67.4%
pow167.4%
div-inv67.4%
metadata-eval67.4%
associate-*l*67.4%
Applied egg-rr67.4%
Taylor expanded in M around 0 41.3%
pow141.3%
*-rgt-identity41.3%
sqrt-unprod33.3%
Applied egg-rr33.3%
unpow133.3%
Simplified33.3%
herbie shell --seed 2024144
(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)))))