
(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 23 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 (<= h -1.44e+197)
(*
(* (/ (pow (- 0.0 d) 0.5) (sqrt (- 0.0 h))) (sqrt (/ d l)))
(+
(/ (* h (* (/ (* D_m (* M_m (* M_m (/ (/ D_m d) 2.0)))) d) -0.25)) l)
1.0))
(if (<= h -4e-311)
(*
(/
(+
(* (* (/ M_m (* d 2.0)) (* D_m (* h -0.25))) (/ (/ D_m (/ d M_m)) l))
1.0)
(* (pow (- 0.0 l) 0.5) (sqrt (/ -1.0 d))))
(sqrt (/ d h)))
(if (<= h 1.82e-90)
(*
(/ 1.0 (/ (sqrt (* h l)) d))
(+
(/ (/ (* h (* D_m -0.25)) l) (/ (/ d M_m) (/ D_m (/ 2.0 (/ M_m d)))))
1.0))
(/
(*
d
(/
(+
(/
(/ h l)
(/ (/ d M_m) (* 0.25 (/ D_m (/ -2.0 (/ (* D_m M_m) d))))))
1.0)
(sqrt h)))
(sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (h <= -1.44e+197) {
tmp = ((pow((0.0 - d), 0.5) / sqrt((0.0 - h))) * sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
} else if (h <= -4e-311) {
tmp = (((((M_m / (d * 2.0)) * (D_m * (h * -0.25))) * ((D_m / (d / M_m)) / l)) + 1.0) / (pow((0.0 - l), 0.5) * sqrt((-1.0 / d)))) * sqrt((d / h));
} else if (h <= 1.82e-90) {
tmp = (1.0 / (sqrt((h * l)) / d)) * ((((h * (D_m * -0.25)) / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (h <= (-1.44d+197)) then
tmp = ((((0.0d0 - d) ** 0.5d0) / sqrt((0.0d0 - h))) * sqrt((d / l))) * (((h * (((d_m * (m_m * (m_m * ((d_m / d) / 2.0d0)))) / d) * (-0.25d0))) / l) + 1.0d0)
else if (h <= (-4d-311)) then
tmp = (((((m_m / (d * 2.0d0)) * (d_m * (h * (-0.25d0)))) * ((d_m / (d / m_m)) / l)) + 1.0d0) / (((0.0d0 - l) ** 0.5d0) * sqrt(((-1.0d0) / d)))) * sqrt((d / h))
else if (h <= 1.82d-90) then
tmp = (1.0d0 / (sqrt((h * l)) / d)) * ((((h * (d_m * (-0.25d0))) / l) / ((d / m_m) / (d_m / (2.0d0 / (m_m / d))))) + 1.0d0)
else
tmp = (d * ((((h / l) / ((d / m_m) / (0.25d0 * (d_m / ((-2.0d0) / ((d_m * m_m) / d)))))) + 1.0d0) / sqrt(h))) / sqrt(l)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (h <= -1.44e+197) {
tmp = ((Math.pow((0.0 - d), 0.5) / Math.sqrt((0.0 - h))) * Math.sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
} else if (h <= -4e-311) {
tmp = (((((M_m / (d * 2.0)) * (D_m * (h * -0.25))) * ((D_m / (d / M_m)) / l)) + 1.0) / (Math.pow((0.0 - l), 0.5) * Math.sqrt((-1.0 / d)))) * Math.sqrt((d / h));
} else if (h <= 1.82e-90) {
tmp = (1.0 / (Math.sqrt((h * l)) / d)) * ((((h * (D_m * -0.25)) / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / Math.sqrt(h))) / Math.sqrt(l);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if h <= -1.44e+197: tmp = ((math.pow((0.0 - d), 0.5) / math.sqrt((0.0 - h))) * math.sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) elif h <= -4e-311: tmp = (((((M_m / (d * 2.0)) * (D_m * (h * -0.25))) * ((D_m / (d / M_m)) / l)) + 1.0) / (math.pow((0.0 - l), 0.5) * math.sqrt((-1.0 / d)))) * math.sqrt((d / h)) elif h <= 1.82e-90: tmp = (1.0 / (math.sqrt((h * l)) / d)) * ((((h * (D_m * -0.25)) / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0) else: tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / math.sqrt(h))) / math.sqrt(l) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (h <= -1.44e+197) tmp = Float64(Float64(Float64((Float64(0.0 - d) ^ 0.5) / sqrt(Float64(0.0 - h))) * sqrt(Float64(d / l))) * Float64(Float64(Float64(h * Float64(Float64(Float64(D_m * Float64(M_m * Float64(M_m * Float64(Float64(D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0)); elseif (h <= -4e-311) tmp = Float64(Float64(Float64(Float64(Float64(Float64(M_m / Float64(d * 2.0)) * Float64(D_m * Float64(h * -0.25))) * Float64(Float64(D_m / Float64(d / M_m)) / l)) + 1.0) / Float64((Float64(0.0 - l) ^ 0.5) * sqrt(Float64(-1.0 / d)))) * sqrt(Float64(d / h))); elseif (h <= 1.82e-90) tmp = Float64(Float64(1.0 / Float64(sqrt(Float64(h * l)) / d)) * Float64(Float64(Float64(Float64(h * Float64(D_m * -0.25)) / l) / Float64(Float64(d / M_m) / Float64(D_m / Float64(2.0 / Float64(M_m / d))))) + 1.0)); else tmp = Float64(Float64(d * Float64(Float64(Float64(Float64(h / l) / Float64(Float64(d / M_m) / Float64(0.25 * Float64(D_m / Float64(-2.0 / Float64(Float64(D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (h <= -1.44e+197)
tmp = ((((0.0 - d) ^ 0.5) / sqrt((0.0 - h))) * sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
elseif (h <= -4e-311)
tmp = (((((M_m / (d * 2.0)) * (D_m * (h * -0.25))) * ((D_m / (d / M_m)) / l)) + 1.0) / (((0.0 - l) ^ 0.5) * sqrt((-1.0 / d)))) * sqrt((d / h));
elseif (h <= 1.82e-90)
tmp = (1.0 / (sqrt((h * l)) / d)) * ((((h * (D_m * -0.25)) / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
else
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[h, -1.44e+197], N[(N[(N[(N[Power[N[(0.0 - d), $MachinePrecision], 0.5], $MachinePrecision] / N[Sqrt[N[(0.0 - h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(N[(N[(D$95$m * N[(M$95$m * N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -4e-311], N[(N[(N[(N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] * N[(D$95$m * N[(h * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Power[N[(0.0 - l), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(-1.0 / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 1.82e-90], N[(N[(1.0 / N[(N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(D$95$m / N[(2.0 / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(d * N[(N[(N[(N[(h / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(0.25 * N[(D$95$m / N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $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.44 \cdot 10^{+197}:\\
\;\;\;\;\left(\frac{{\left(0 - d\right)}^{0.5}}{\sqrt{0 - h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(\frac{h \cdot \left(\frac{D\_m \cdot \left(M\_m \cdot \left(M\_m \cdot \frac{\frac{D\_m}{d}}{2}\right)\right)}{d} \cdot -0.25\right)}{\ell} + 1\right)\\
\mathbf{elif}\;h \leq -4 \cdot 10^{-311}:\\
\;\;\;\;\frac{\left(\frac{M\_m}{d \cdot 2} \cdot \left(D\_m \cdot \left(h \cdot -0.25\right)\right)\right) \cdot \frac{\frac{D\_m}{\frac{d}{M\_m}}}{\ell} + 1}{{\left(0 - \ell\right)}^{0.5} \cdot \sqrt{\frac{-1}{d}}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;h \leq 1.82 \cdot 10^{-90}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{h \cdot \ell}}{d}} \cdot \left(\frac{\frac{h \cdot \left(D\_m \cdot -0.25\right)}{\ell}}{\frac{\frac{d}{M\_m}}{\frac{D\_m}{\frac{2}{\frac{M\_m}{d}}}}} + 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d \cdot \frac{\frac{\frac{h}{\ell}}{\frac{\frac{d}{M\_m}}{0.25 \cdot \frac{D\_m}{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}}} + 1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if h < -1.44000000000000003e197Initial program 49.7%
Simplified49.9%
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
neg-sub0N/A
--lowering--.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6474.9%
Applied egg-rr74.9%
if -1.44000000000000003e197 < h < -3.99999999999979e-311Initial program 67.8%
Simplified62.9%
Applied egg-rr64.1%
associate-/r/N/A
*-commutativeN/A
div-invN/A
associate-/l/N/A
clear-numN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l/N/A
associate-/l/N/A
associate-*l/N/A
Applied egg-rr68.3%
frac-2negN/A
div-invN/A
sqrt-prodN/A
sub0-negN/A
unpow1/2N/A
*-lowering-*.f64N/A
sub0-negN/A
pow-lowering-pow.f64N/A
sub0-negN/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
distribute-frac-neg2N/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f6476.3%
Applied egg-rr76.3%
if -3.99999999999979e-311 < h < 1.8199999999999999e-90Initial program 59.6%
Simplified55.1%
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6468.3%
Applied egg-rr68.3%
div-invN/A
Applied egg-rr74.6%
if 1.8199999999999999e-90 < h Initial program 62.3%
Simplified62.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr65.3%
Applied egg-rr66.8%
sqrt-prodN/A
pow1/2N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr78.4%
Final simplification76.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ M_m (* d 2.0))))
(if (<= d -4.7e-86)
(*
(* (/ (pow (- 0.0 d) 0.5) (sqrt (- 0.0 h))) (sqrt (/ d l)))
(+
(/ (* h (* (/ (* D_m (* M_m (* M_m (/ (/ D_m d) 2.0)))) d) -0.25)) l)
1.0))
(if (<= d -2e-310)
(*
(* d (sqrt (/ 1.0 (* h l))))
(- -1.0 (* (* h (* D_m -0.25)) (/ (/ t_0 (/ d (* D_m M_m))) l))))
(if (<= d 1.45e-88)
(/
(*
d
(/
(+
(/
(/ h l)
(/ (/ d M_m) (* 0.25 (/ D_m (/ -2.0 (/ (* D_m M_m) d))))))
1.0)
(sqrt h)))
(sqrt l))
(*
(sqrt d)
(/
(/
(+ (/ (/ (* D_m -0.25) (/ (/ (/ d M_m) D_m) t_0)) (/ l h)) 1.0)
(sqrt (/ l d)))
(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 = M_m / (d * 2.0);
double tmp;
if (d <= -4.7e-86) {
tmp = ((pow((0.0 - d), 0.5) / sqrt((0.0 - h))) * sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
} else if (d <= -2e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)));
} else if (d <= 1.45e-88) {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
} else {
tmp = sqrt(d) * ((((((D_m * -0.25) / (((d / M_m) / D_m) / t_0)) / (l / h)) + 1.0) / sqrt((l / d))) / 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 = m_m / (d * 2.0d0)
if (d <= (-4.7d-86)) then
tmp = ((((0.0d0 - d) ** 0.5d0) / sqrt((0.0d0 - h))) * sqrt((d / l))) * (((h * (((d_m * (m_m * (m_m * ((d_m / d) / 2.0d0)))) / d) * (-0.25d0))) / l) + 1.0d0)
else if (d <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h * (d_m * (-0.25d0))) * ((t_0 / (d / (d_m * m_m))) / l)))
else if (d <= 1.45d-88) then
tmp = (d * ((((h / l) / ((d / m_m) / (0.25d0 * (d_m / ((-2.0d0) / ((d_m * m_m) / d)))))) + 1.0d0) / sqrt(h))) / sqrt(l)
else
tmp = sqrt(d) * ((((((d_m * (-0.25d0)) / (((d / m_m) / d_m) / t_0)) / (l / h)) + 1.0d0) / sqrt((l / d))) / 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 = M_m / (d * 2.0);
double tmp;
if (d <= -4.7e-86) {
tmp = ((Math.pow((0.0 - d), 0.5) / Math.sqrt((0.0 - h))) * Math.sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
} else if (d <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)));
} else if (d <= 1.45e-88) {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / Math.sqrt(h))) / Math.sqrt(l);
} else {
tmp = Math.sqrt(d) * ((((((D_m * -0.25) / (((d / M_m) / D_m) / t_0)) / (l / h)) + 1.0) / Math.sqrt((l / d))) / 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 = M_m / (d * 2.0) tmp = 0 if d <= -4.7e-86: tmp = ((math.pow((0.0 - d), 0.5) / math.sqrt((0.0 - h))) * math.sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) elif d <= -2e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l))) elif d <= 1.45e-88: tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / math.sqrt(h))) / math.sqrt(l) else: tmp = math.sqrt(d) * ((((((D_m * -0.25) / (((d / M_m) / D_m) / t_0)) / (l / h)) + 1.0) / math.sqrt((l / d))) / 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(M_m / Float64(d * 2.0)) tmp = 0.0 if (d <= -4.7e-86) tmp = Float64(Float64(Float64((Float64(0.0 - d) ^ 0.5) / sqrt(Float64(0.0 - h))) * sqrt(Float64(d / l))) * Float64(Float64(Float64(h * Float64(Float64(Float64(D_m * Float64(M_m * Float64(M_m * Float64(Float64(D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0)); elseif (d <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h * Float64(D_m * -0.25)) * Float64(Float64(t_0 / Float64(d / Float64(D_m * M_m))) / l)))); elseif (d <= 1.45e-88) tmp = Float64(Float64(d * Float64(Float64(Float64(Float64(h / l) / Float64(Float64(d / M_m) / Float64(0.25 * Float64(D_m / Float64(-2.0 / Float64(Float64(D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l)); else tmp = Float64(sqrt(d) * Float64(Float64(Float64(Float64(Float64(Float64(D_m * -0.25) / Float64(Float64(Float64(d / M_m) / D_m) / t_0)) / Float64(l / h)) + 1.0) / sqrt(Float64(l / d))) / 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 = M_m / (d * 2.0);
tmp = 0.0;
if (d <= -4.7e-86)
tmp = ((((0.0 - d) ^ 0.5) / sqrt((0.0 - h))) * sqrt((d / l))) * (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0);
elseif (d <= -2e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)));
elseif (d <= 1.45e-88)
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
else
tmp = sqrt(d) * ((((((D_m * -0.25) / (((d / M_m) / D_m) / t_0)) / (l / h)) + 1.0) / sqrt((l / d))) / 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[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -4.7e-86], N[(N[(N[(N[Power[N[(0.0 - d), $MachinePrecision], 0.5], $MachinePrecision] / N[Sqrt[N[(0.0 - h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(N[(N[(D$95$m * N[(M$95$m * N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.45e-88], N[(N[(d * N[(N[(N[(N[(h / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(0.25 * N[(D$95$m / N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[d], $MachinePrecision] * N[(N[(N[(N[(N[(N[(D$95$m * -0.25), $MachinePrecision] / N[(N[(N[(d / M$95$m), $MachinePrecision] / D$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(l / h), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(l / d), $MachinePrecision]], $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}
t_0 := \frac{M\_m}{d \cdot 2}\\
\mathbf{if}\;d \leq -4.7 \cdot 10^{-86}:\\
\;\;\;\;\left(\frac{{\left(0 - d\right)}^{0.5}}{\sqrt{0 - h}} \cdot \sqrt{\frac{d}{\ell}}\right) \cdot \left(\frac{h \cdot \left(\frac{D\_m \cdot \left(M\_m \cdot \left(M\_m \cdot \frac{\frac{D\_m}{d}}{2}\right)\right)}{d} \cdot -0.25\right)}{\ell} + 1\right)\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \left(h \cdot \left(D\_m \cdot -0.25\right)\right) \cdot \frac{\frac{t\_0}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;d \leq 1.45 \cdot 10^{-88}:\\
\;\;\;\;\frac{d \cdot \frac{\frac{\frac{h}{\ell}}{\frac{\frac{d}{M\_m}}{0.25 \cdot \frac{D\_m}{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}}} + 1}{\sqrt{h}}}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{d} \cdot \frac{\frac{\frac{\frac{D\_m \cdot -0.25}{\frac{\frac{\frac{d}{M\_m}}{D\_m}}{t\_0}}}{\frac{\ell}{h}} + 1}{\sqrt{\frac{\ell}{d}}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -4.7000000000000001e-86Initial program 74.1%
Simplified72.9%
frac-2negN/A
sqrt-divN/A
/-lowering-/.f64N/A
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
neg-sub0N/A
--lowering--.f64N/A
metadata-evalN/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f6483.4%
Applied egg-rr83.4%
if -4.7000000000000001e-86 < d < -1.999999999999994e-310Initial program 51.8%
Simplified42.7%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr43.9%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6446.4%
Applied egg-rr46.4%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6465.3%
Simplified65.3%
if -1.999999999999994e-310 < d < 1.4500000000000001e-88Initial program 38.6%
Simplified37.1%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr37.0%
Applied egg-rr55.2%
sqrt-prodN/A
pow1/2N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr65.1%
if 1.4500000000000001e-88 < d Initial program 75.3%
Simplified73.6%
Applied egg-rr86.5%
Final simplification77.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= d -2e-310)
(*
(* d (sqrt (/ 1.0 (* h l))))
(-
-1.0
(* (* h (* D_m -0.25)) (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= d 2.8e-80)
(/
(*
d
(+
(/ h (/ (* (* d l) (/ (/ -2.0 (/ (* D_m M_m) d)) (* D_m M_m))) 0.25))
1.0))
(sqrt (* h l)))
(if (<= d 7.6e+56)
(*
(sqrt (/ d h))
(/
(+ (* (/ (/ D_m (/ d M_m)) l) (/ (* M_m (* (* h D_m) -0.125)) d)) 1.0)
(sqrt (/ l d))))
(* (/ d (sqrt h)) (pow l -0.5))))))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 <= -2e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (d <= 2.8e-80) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
} else if (d <= 7.6e+56) {
tmp = sqrt((d / h)) * (((((D_m / (d / M_m)) / l) * ((M_m * ((h * D_m) * -0.125)) / d)) + 1.0) / sqrt((l / d)));
} else {
tmp = (d / sqrt(h)) * pow(l, -0.5);
}
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 <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h * (d_m * (-0.25d0))) * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (d <= 2.8d-80) then
tmp = (d * ((h / (((d * l) * (((-2.0d0) / ((d_m * m_m) / d)) / (d_m * m_m))) / 0.25d0)) + 1.0d0)) / sqrt((h * l))
else if (d <= 7.6d+56) then
tmp = sqrt((d / h)) * (((((d_m / (d / m_m)) / l) * ((m_m * ((h * d_m) * (-0.125d0))) / d)) + 1.0d0) / sqrt((l / d)))
else
tmp = (d / sqrt(h)) * (l ** (-0.5d0))
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 <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (d <= 2.8e-80) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / Math.sqrt((h * l));
} else if (d <= 7.6e+56) {
tmp = Math.sqrt((d / h)) * (((((D_m / (d / M_m)) / l) * ((M_m * ((h * D_m) * -0.125)) / d)) + 1.0) / Math.sqrt((l / d)));
} else {
tmp = (d / Math.sqrt(h)) * Math.pow(l, -0.5);
}
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 <= -2e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif d <= 2.8e-80: tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / math.sqrt((h * l)) elif d <= 7.6e+56: tmp = math.sqrt((d / h)) * (((((D_m / (d / M_m)) / l) * ((M_m * ((h * D_m) * -0.125)) / d)) + 1.0) / math.sqrt((l / d))) else: tmp = (d / math.sqrt(h)) * math.pow(l, -0.5) 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 <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h * Float64(D_m * -0.25)) * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (d <= 2.8e-80) tmp = Float64(Float64(d * Float64(Float64(h / Float64(Float64(Float64(d * l) * Float64(Float64(-2.0 / Float64(Float64(D_m * M_m) / d)) / Float64(D_m * M_m))) / 0.25)) + 1.0)) / sqrt(Float64(h * l))); elseif (d <= 7.6e+56) tmp = Float64(sqrt(Float64(d / h)) * Float64(Float64(Float64(Float64(Float64(D_m / Float64(d / M_m)) / l) * Float64(Float64(M_m * Float64(Float64(h * D_m) * -0.125)) / d)) + 1.0) / sqrt(Float64(l / d)))); else tmp = Float64(Float64(d / sqrt(h)) * (l ^ -0.5)); 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 <= -2e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (d <= 2.8e-80)
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
elseif (d <= 7.6e+56)
tmp = sqrt((d / h)) * (((((D_m / (d / M_m)) / l) * ((M_m * ((h * D_m) * -0.125)) / d)) + 1.0) / sqrt((l / d)));
else
tmp = (d / sqrt(h)) * (l ^ -0.5);
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, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 2.8e-80], N[(N[(d * N[(N[(h / N[(N[(N[(d * l), $MachinePrecision] * N[(N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 0.25), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 7.6e+56], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(N[(N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] * N[(N[(M$95$m * N[(N[(h * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(l / d), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[Power[l, -0.5], $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 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \left(h \cdot \left(D\_m \cdot -0.25\right)\right) \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;d \leq 2.8 \cdot 10^{-80}:\\
\;\;\;\;\frac{d \cdot \left(\frac{h}{\frac{\left(d \cdot \ell\right) \cdot \frac{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}{D\_m \cdot M\_m}}{0.25}} + 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{elif}\;d \leq 7.6 \cdot 10^{+56}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\frac{\frac{D\_m}{\frac{d}{M\_m}}}{\ell} \cdot \frac{M\_m \cdot \left(\left(h \cdot D\_m\right) \cdot -0.125\right)}{d} + 1}{\sqrt{\frac{\ell}{d}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h}} \cdot {\ell}^{-0.5}\\
\end{array}
\end{array}
if d < -1.999999999999994e-310Initial program 65.5%
Simplified61.3%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.4%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.7%
Applied egg-rr60.7%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6470.6%
Simplified70.6%
if -1.999999999999994e-310 < d < 2.79999999999999989e-80Initial program 43.2%
Simplified40.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr41.7%
Applied egg-rr57.1%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr63.7%
if 2.79999999999999989e-80 < d < 7.59999999999999991e56Initial program 88.0%
Simplified83.8%
Applied egg-rr85.7%
associate-/r/N/A
*-commutativeN/A
div-invN/A
associate-/l/N/A
clear-numN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l/N/A
associate-/l/N/A
associate-*l/N/A
Applied egg-rr95.0%
associate-*l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval92.8%
Applied egg-rr92.8%
if 7.59999999999999991e56 < d Initial program 62.2%
Simplified64.3%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.2%
Simplified65.2%
sqrt-divN/A
metadata-evalN/A
div-invN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
frac-timesN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
associate-*r/N/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-eval82.1%
Applied egg-rr82.1%
Final simplification74.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 (* h (* D_m -0.25))))
(if (<= h -4e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(- -1.0 (* t_0 (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= h 1.32e-92)
(*
(/ 1.0 (/ (sqrt (* h l)) d))
(+ (/ (/ t_0 l) (/ (/ d M_m) (/ D_m (/ 2.0 (/ M_m d))))) 1.0))
(/
(*
d
(/
(+
(/
(/ h l)
(/ (/ d M_m) (* 0.25 (/ D_m (/ -2.0 (/ (* D_m M_m) d))))))
1.0)
(sqrt h)))
(sqrt l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = h * (D_m * -0.25);
double tmp;
if (h <= -4e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 1.32e-92) {
tmp = (1.0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = h * (d_m * (-0.25d0))
if (h <= (-4d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - (t_0 * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (h <= 1.32d-92) then
tmp = (1.0d0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / m_m) / (d_m / (2.0d0 / (m_m / d))))) + 1.0d0)
else
tmp = (d * ((((h / l) / ((d / m_m) / (0.25d0 * (d_m / ((-2.0d0) / ((d_m * m_m) / d)))))) + 1.0d0) / sqrt(h))) / sqrt(l)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = h * (D_m * -0.25);
double tmp;
if (h <= -4e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 1.32e-92) {
tmp = (1.0 / (Math.sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / Math.sqrt(h))) / Math.sqrt(l);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = h * (D_m * -0.25) tmp = 0 if h <= -4e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif h <= 1.32e-92: tmp = (1.0 / (math.sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0) else: tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / math.sqrt(h))) / math.sqrt(l) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(h * Float64(D_m * -0.25)) tmp = 0.0 if (h <= -4e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(t_0 * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (h <= 1.32e-92) tmp = Float64(Float64(1.0 / Float64(sqrt(Float64(h * l)) / d)) * Float64(Float64(Float64(t_0 / l) / Float64(Float64(d / M_m) / Float64(D_m / Float64(2.0 / Float64(M_m / d))))) + 1.0)); else tmp = Float64(Float64(d * Float64(Float64(Float64(Float64(h / l) / Float64(Float64(d / M_m) / Float64(0.25 * Float64(D_m / Float64(-2.0 / Float64(Float64(D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = h * (D_m * -0.25);
tmp = 0.0;
if (h <= -4e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (h <= 1.32e-92)
tmp = (1.0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
else
tmp = (d * ((((h / l) / ((d / M_m) / (0.25 * (D_m / (-2.0 / ((D_m * M_m) / d)))))) + 1.0) / sqrt(h))) / sqrt(l);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -4e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(t$95$0 * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 1.32e-92], N[(N[(1.0 / N[(N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(D$95$m / N[(2.0 / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(d * N[(N[(N[(N[(h / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(0.25 * N[(D$95$m / N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $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 := h \cdot \left(D\_m \cdot -0.25\right)\\
\mathbf{if}\;h \leq -4 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - t\_0 \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;h \leq 1.32 \cdot 10^{-92}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{h \cdot \ell}}{d}} \cdot \left(\frac{\frac{t\_0}{\ell}}{\frac{\frac{d}{M\_m}}{\frac{D\_m}{\frac{2}{\frac{M\_m}{d}}}}} + 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d \cdot \frac{\frac{\frac{h}{\ell}}{\frac{\frac{d}{M\_m}}{0.25 \cdot \frac{D\_m}{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}}} + 1}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if h < -3.99999999999979e-311Initial program 65.5%
Simplified61.3%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.4%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.7%
Applied egg-rr60.7%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6470.6%
Simplified70.6%
if -3.99999999999979e-311 < h < 1.3200000000000001e-92Initial program 59.6%
Simplified55.1%
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6468.3%
Applied egg-rr68.3%
div-invN/A
Applied egg-rr74.6%
if 1.3200000000000001e-92 < h Initial program 62.3%
Simplified62.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr65.3%
Applied egg-rr66.8%
sqrt-prodN/A
pow1/2N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr78.4%
Final simplification74.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* h (* D_m -0.25))))
(if (<= h -4e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(- -1.0 (* t_0 (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= h 4e-82)
(*
(/ 1.0 (/ (sqrt (* h l)) d))
(+ (/ (/ t_0 l) (/ (/ d M_m) (/ D_m (/ 2.0 (/ M_m d))))) 1.0))
(*
(+
(/ (* h (* (/ (* D_m (* M_m (* M_m (/ (/ D_m d) 2.0)))) d) -0.25)) l)
1.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 = h * (D_m * -0.25);
double tmp;
if (h <= -4e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 4e-82) {
tmp = (1.0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.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) :: t_0
real(8) :: tmp
t_0 = h * (d_m * (-0.25d0))
if (h <= (-4d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - (t_0 * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (h <= 4d-82) then
tmp = (1.0d0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / m_m) / (d_m / (2.0d0 / (m_m / d))))) + 1.0d0)
else
tmp = (((h * (((d_m * (m_m * (m_m * ((d_m / d) / 2.0d0)))) / d) * (-0.25d0))) / l) + 1.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 t_0 = h * (D_m * -0.25);
double tmp;
if (h <= -4e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 4e-82) {
tmp = (1.0 / (Math.sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.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): t_0 = h * (D_m * -0.25) tmp = 0 if h <= -4e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif h <= 4e-82: tmp = (1.0 / (math.sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0) else: tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.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) t_0 = Float64(h * Float64(D_m * -0.25)) tmp = 0.0 if (h <= -4e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(t_0 * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (h <= 4e-82) tmp = Float64(Float64(1.0 / Float64(sqrt(Float64(h * l)) / d)) * Float64(Float64(Float64(t_0 / l) / Float64(Float64(d / M_m) / Float64(D_m / Float64(2.0 / Float64(M_m / d))))) + 1.0)); else tmp = Float64(Float64(Float64(Float64(h * Float64(Float64(Float64(D_m * Float64(M_m * Float64(M_m * Float64(Float64(D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.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)
t_0 = h * (D_m * -0.25);
tmp = 0.0;
if (h <= -4e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (h <= 4e-82)
tmp = (1.0 / (sqrt((h * l)) / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
else
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.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_] := Block[{t$95$0 = N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -4e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(t$95$0 * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 4e-82], N[(N[(1.0 / N[(N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(D$95$m / N[(2.0 / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(h * N[(N[(N[(D$95$m * N[(M$95$m * N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $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}
t_0 := h \cdot \left(D\_m \cdot -0.25\right)\\
\mathbf{if}\;h \leq -4 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - t\_0 \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;h \leq 4 \cdot 10^{-82}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{h \cdot \ell}}{d}} \cdot \left(\frac{\frac{t\_0}{\ell}}{\frac{\frac{d}{M\_m}}{\frac{D\_m}{\frac{2}{\frac{M\_m}{d}}}}} + 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{h \cdot \left(\frac{D\_m \cdot \left(M\_m \cdot \left(M\_m \cdot \frac{\frac{D\_m}{d}}{2}\right)\right)}{d} \cdot -0.25\right)}{\ell} + 1\right) \cdot \frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if h < -3.99999999999979e-311Initial program 65.5%
Simplified61.3%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.4%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.7%
Applied egg-rr60.7%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6470.6%
Simplified70.6%
if -3.99999999999979e-311 < h < 4e-82Initial program 60.3%
Simplified55.8%
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6468.8%
Applied egg-rr68.8%
div-invN/A
Applied egg-rr75.0%
if 4e-82 < h Initial program 61.9%
Simplified62.1%
*-commutativeN/A
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6473.3%
Applied egg-rr73.3%
Final simplification72.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 7.5e-308)
(*
(* d (sqrt (/ 1.0 (* h l))))
(-
-1.0
(* (* h (* D_m -0.25)) (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= l 3.1e+53)
(/
(*
d
(+
(/ h (/ (* (* d l) (/ (/ -2.0 (/ (* D_m M_m) d)) (* D_m M_m))) 0.25))
1.0))
(sqrt (* h l)))
(* (/ d (sqrt h)) (pow l -0.5)))))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-308) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (l <= 3.1e+53) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
} else {
tmp = (d / sqrt(h)) * pow(l, -0.5);
}
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-308) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h * (d_m * (-0.25d0))) * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (l <= 3.1d+53) then
tmp = (d * ((h / (((d * l) * (((-2.0d0) / ((d_m * m_m) / d)) / (d_m * m_m))) / 0.25d0)) + 1.0d0)) / sqrt((h * l))
else
tmp = (d / sqrt(h)) * (l ** (-0.5d0))
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-308) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (l <= 3.1e+53) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / Math.sqrt((h * l));
} else {
tmp = (d / Math.sqrt(h)) * Math.pow(l, -0.5);
}
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-308: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif l <= 3.1e+53: tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / math.sqrt((h * l)) else: tmp = (d / math.sqrt(h)) * math.pow(l, -0.5) 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-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h * Float64(D_m * -0.25)) * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (l <= 3.1e+53) tmp = Float64(Float64(d * Float64(Float64(h / Float64(Float64(Float64(d * l) * Float64(Float64(-2.0 / Float64(Float64(D_m * M_m) / d)) / Float64(D_m * M_m))) / 0.25)) + 1.0)) / sqrt(Float64(h * l))); else tmp = Float64(Float64(d / sqrt(h)) * (l ^ -0.5)); 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-308)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (l <= 3.1e+53)
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
else
tmp = (d / sqrt(h)) * (l ^ -0.5);
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-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.1e+53], N[(N[(d * N[(N[(h / N[(N[(N[(d * l), $MachinePrecision] * N[(N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 0.25), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[Power[l, -0.5], $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^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \left(h \cdot \left(D\_m \cdot -0.25\right)\right) \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 3.1 \cdot 10^{+53}:\\
\;\;\;\;\frac{d \cdot \left(\frac{h}{\frac{\left(d \cdot \ell\right) \cdot \frac{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}{D\_m \cdot M\_m}}{0.25}} + 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h}} \cdot {\ell}^{-0.5}\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.8%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.1%
Applied egg-rr61.1%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6469.9%
Simplified69.9%
if 7.4999999999999998e-308 < l < 3.10000000000000019e53Initial program 69.1%
Simplified70.5%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr71.6%
Applied egg-rr85.3%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr86.6%
if 3.10000000000000019e53 < l Initial program 52.5%
Simplified47.6%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6451.6%
Simplified51.6%
sqrt-divN/A
metadata-evalN/A
div-invN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
frac-timesN/A
pow1/2N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
pow1/2N/A
associate-*r/N/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
inv-powN/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-eval62.9%
Applied egg-rr62.9%
Final simplification73.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 7.5e-308)
(*
(* d (sqrt (/ 1.0 (* h l))))
(-
-1.0
(* (* h (* D_m -0.25)) (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= l 3.1e+53)
(/
(*
d
(+
(/ h (/ (* (* d l) (/ (/ -2.0 (/ (* D_m M_m) d)) (* D_m M_m))) 0.25))
1.0))
(sqrt (* h l)))
(/ (/ d (sqrt h)) (sqrt l)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (l <= 3.1e+53) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
} else {
tmp = (d / sqrt(h)) / sqrt(l);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 7.5d-308) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - ((h * (d_m * (-0.25d0))) * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (l <= 3.1d+53) then
tmp = (d * ((h / (((d * l) * (((-2.0d0) / ((d_m * m_m) / d)) / (d_m * m_m))) / 0.25d0)) + 1.0d0)) / sqrt((h * l))
else
tmp = (d / sqrt(h)) / sqrt(l)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (l <= 3.1e+53) {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / Math.sqrt((h * l));
} else {
tmp = (d / Math.sqrt(h)) / Math.sqrt(l);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 7.5e-308: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif l <= 3.1e+53: tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / math.sqrt((h * l)) else: tmp = (d / math.sqrt(h)) / math.sqrt(l) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 7.5e-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(Float64(h * Float64(D_m * -0.25)) * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (l <= 3.1e+53) tmp = Float64(Float64(d * Float64(Float64(h / Float64(Float64(Float64(d * l) * Float64(Float64(-2.0 / Float64(Float64(D_m * M_m) / d)) / Float64(D_m * M_m))) / 0.25)) + 1.0)) / sqrt(Float64(h * l))); else tmp = Float64(Float64(d / sqrt(h)) / sqrt(l)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 7.5e-308)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - ((h * (D_m * -0.25)) * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (l <= 3.1e+53)
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / sqrt((h * l));
else
tmp = (d / sqrt(h)) / sqrt(l);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 7.5e-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.1e+53], N[(N[(d * N[(N[(h / N[(N[(N[(d * l), $MachinePrecision] * N[(N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 0.25), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $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^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - \left(h \cdot \left(D\_m \cdot -0.25\right)\right) \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;\ell \leq 3.1 \cdot 10^{+53}:\\
\;\;\;\;\frac{d \cdot \left(\frac{h}{\frac{\left(d \cdot \ell\right) \cdot \frac{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}{D\_m \cdot M\_m}}{0.25}} + 1\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.8%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.1%
Applied egg-rr61.1%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6469.9%
Simplified69.9%
if 7.4999999999999998e-308 < l < 3.10000000000000019e53Initial program 69.1%
Simplified70.5%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr71.6%
Applied egg-rr85.3%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr86.6%
if 3.10000000000000019e53 < l Initial program 52.5%
Simplified47.6%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6451.6%
Simplified51.6%
sqrt-divN/A
metadata-evalN/A
div-invN/A
sqrt-prodN/A
pow1/2N/A
associate-/r*N/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
associate-*r/N/A
pow1/2N/A
/-lowering-/.f64N/A
pow1/2N/A
associate-*r/N/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6462.8%
Applied egg-rr62.8%
Final simplification73.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 (* h (* D_m -0.25))) (t_1 (sqrt (* h l))))
(if (<= h -4e-311)
(*
(* d (sqrt (/ 1.0 (* h l))))
(- -1.0 (* t_0 (/ (/ (/ M_m (* d 2.0)) (/ d (* D_m M_m))) l))))
(if (<= h 1e-120)
(*
(/ 1.0 (/ t_1 d))
(+ (/ (/ t_0 l) (/ (/ d M_m) (/ D_m (/ 2.0 (/ M_m d))))) 1.0))
(/
(*
d
(+
(/ h (/ (* (* d l) (/ (/ -2.0 (/ (* D_m M_m) d)) (* D_m M_m))) 0.25))
1.0))
t_1)))))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 = h * (D_m * -0.25);
double t_1 = sqrt((h * l));
double tmp;
if (h <= -4e-311) {
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 1e-120) {
tmp = (1.0 / (t_1 / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / t_1;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = h * (d_m * (-0.25d0))
t_1 = sqrt((h * l))
if (h <= (-4d-311)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((-1.0d0) - (t_0 * (((m_m / (d * 2.0d0)) / (d / (d_m * m_m))) / l)))
else if (h <= 1d-120) then
tmp = (1.0d0 / (t_1 / d)) * (((t_0 / l) / ((d / m_m) / (d_m / (2.0d0 / (m_m / d))))) + 1.0d0)
else
tmp = (d * ((h / (((d * l) * (((-2.0d0) / ((d_m * m_m) / d)) / (d_m * m_m))) / 0.25d0)) + 1.0d0)) / t_1
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 = h * (D_m * -0.25);
double t_1 = Math.sqrt((h * l));
double tmp;
if (h <= -4e-311) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
} else if (h <= 1e-120) {
tmp = (1.0 / (t_1 / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
} else {
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / t_1;
}
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 = h * (D_m * -0.25) t_1 = math.sqrt((h * l)) tmp = 0 if h <= -4e-311: tmp = (d * math.sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l))) elif h <= 1e-120: tmp = (1.0 / (t_1 / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0) else: tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / t_1 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(h * Float64(D_m * -0.25)) t_1 = sqrt(Float64(h * l)) tmp = 0.0 if (h <= -4e-311) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(-1.0 - Float64(t_0 * Float64(Float64(Float64(M_m / Float64(d * 2.0)) / Float64(d / Float64(D_m * M_m))) / l)))); elseif (h <= 1e-120) tmp = Float64(Float64(1.0 / Float64(t_1 / d)) * Float64(Float64(Float64(t_0 / l) / Float64(Float64(d / M_m) / Float64(D_m / Float64(2.0 / Float64(M_m / d))))) + 1.0)); else tmp = Float64(Float64(d * Float64(Float64(h / Float64(Float64(Float64(d * l) * Float64(Float64(-2.0 / Float64(Float64(D_m * M_m) / d)) / Float64(D_m * M_m))) / 0.25)) + 1.0)) / t_1); 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 = h * (D_m * -0.25);
t_1 = sqrt((h * l));
tmp = 0.0;
if (h <= -4e-311)
tmp = (d * sqrt((1.0 / (h * l)))) * (-1.0 - (t_0 * (((M_m / (d * 2.0)) / (d / (D_m * M_m))) / l)));
elseif (h <= 1e-120)
tmp = (1.0 / (t_1 / d)) * (((t_0 / l) / ((d / M_m) / (D_m / (2.0 / (M_m / d))))) + 1.0);
else
tmp = (d * ((h / (((d * l) * ((-2.0 / ((D_m * M_m) / d)) / (D_m * M_m))) / 0.25)) + 1.0)) / t_1;
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[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -4e-311], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 - N[(t$95$0 * N[(N[(N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision] / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 1e-120], N[(N[(1.0 / N[(t$95$1 / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 / l), $MachinePrecision] / N[(N[(d / M$95$m), $MachinePrecision] / N[(D$95$m / N[(2.0 / N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(d * N[(N[(h / N[(N[(N[(d * l), $MachinePrecision] * N[(N[(-2.0 / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 0.25), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $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 := h \cdot \left(D\_m \cdot -0.25\right)\\
t_1 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;h \leq -4 \cdot 10^{-311}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(-1 - t\_0 \cdot \frac{\frac{\frac{M\_m}{d \cdot 2}}{\frac{d}{D\_m \cdot M\_m}}}{\ell}\right)\\
\mathbf{elif}\;h \leq 10^{-120}:\\
\;\;\;\;\frac{1}{\frac{t\_1}{d}} \cdot \left(\frac{\frac{t\_0}{\ell}}{\frac{\frac{d}{M\_m}}{\frac{D\_m}{\frac{2}{\frac{M\_m}{d}}}}} + 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d \cdot \left(\frac{h}{\frac{\left(d \cdot \ell\right) \cdot \frac{\frac{-2}{\frac{D\_m \cdot M\_m}{d}}}{D\_m \cdot M\_m}}{0.25}} + 1\right)}{t\_1}\\
\end{array}
\end{array}
if h < -3.99999999999979e-311Initial program 65.5%
Simplified61.3%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.4%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.7%
Applied egg-rr60.7%
Taylor expanded in h around -inf
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6470.6%
Simplified70.6%
if -3.99999999999979e-311 < h < 9.99999999999999979e-121Initial program 58.1%
Simplified56.5%
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6471.5%
Applied egg-rr71.5%
div-invN/A
Applied egg-rr74.8%
if 9.99999999999999979e-121 < h Initial program 62.9%
Simplified61.2%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr65.7%
Applied egg-rr65.3%
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr69.3%
Final simplification71.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (/ M_m (* d 2.0))))
(if (<= d -8e+102)
(/ (sqrt (/ l h)) (/ l d))
(if (<= d -2e-310)
(*
(+ (* (* h (* D_m -0.25)) (/ (/ t_0 (/ d (* D_m M_m))) l)) 1.0)
(sqrt (/ d (/ h (/ d l)))))
(*
(/ d (sqrt (* h l)))
(+ (/ (* h (/ (* D_m -0.25) (/ (/ (/ d M_m) D_m) t_0))) l) 1.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 = M_m / (d * 2.0);
double tmp;
if (d <= -8e+102) {
tmp = sqrt((l / h)) / (l / d);
} else if (d <= -2e-310) {
tmp = (((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)) + 1.0) * sqrt((d / (h / (d / l))));
} else {
tmp = (d / sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / t_0))) / l) + 1.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 = m_m / (d * 2.0d0)
if (d <= (-8d+102)) then
tmp = sqrt((l / h)) / (l / d)
else if (d <= (-2d-310)) then
tmp = (((h * (d_m * (-0.25d0))) * ((t_0 / (d / (d_m * m_m))) / l)) + 1.0d0) * sqrt((d / (h / (d / l))))
else
tmp = (d / sqrt((h * l))) * (((h * ((d_m * (-0.25d0)) / (((d / m_m) / d_m) / t_0))) / l) + 1.0d0)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = M_m / (d * 2.0);
double tmp;
if (d <= -8e+102) {
tmp = Math.sqrt((l / h)) / (l / d);
} else if (d <= -2e-310) {
tmp = (((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)) + 1.0) * Math.sqrt((d / (h / (d / l))));
} else {
tmp = (d / Math.sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / t_0))) / l) + 1.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 = M_m / (d * 2.0) tmp = 0 if d <= -8e+102: tmp = math.sqrt((l / h)) / (l / d) elif d <= -2e-310: tmp = (((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)) + 1.0) * math.sqrt((d / (h / (d / l)))) else: tmp = (d / math.sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / t_0))) / l) + 1.0) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(M_m / Float64(d * 2.0)) tmp = 0.0 if (d <= -8e+102) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); elseif (d <= -2e-310) tmp = Float64(Float64(Float64(Float64(h * Float64(D_m * -0.25)) * Float64(Float64(t_0 / Float64(d / Float64(D_m * M_m))) / l)) + 1.0) * sqrt(Float64(d / Float64(h / Float64(d / l))))); else tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(Float64(Float64(h * Float64(Float64(D_m * -0.25) / Float64(Float64(Float64(d / M_m) / D_m) / t_0))) / l) + 1.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 = M_m / (d * 2.0);
tmp = 0.0;
if (d <= -8e+102)
tmp = sqrt((l / h)) / (l / d);
elseif (d <= -2e-310)
tmp = (((h * (D_m * -0.25)) * ((t_0 / (d / (D_m * M_m))) / l)) + 1.0) * sqrt((d / (h / (d / l))));
else
tmp = (d / sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / t_0))) / l) + 1.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[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, -8e+102], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(N[(N[(N[(h * N[(D$95$m * -0.25), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 / N[(d / N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sqrt[N[(d / N[(h / N[(d / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(N[(D$95$m * -0.25), $MachinePrecision] / N[(N[(N[(d / M$95$m), $MachinePrecision] / D$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{M\_m}{d \cdot 2}\\
\mathbf{if}\;d \leq -8 \cdot 10^{+102}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(\left(h \cdot \left(D\_m \cdot -0.25\right)\right) \cdot \frac{\frac{t\_0}{\frac{d}{D\_m \cdot M\_m}}}{\ell} + 1\right) \cdot \sqrt{\frac{d}{\frac{h}{\frac{d}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(\frac{h \cdot \frac{D\_m \cdot -0.25}{\frac{\frac{\frac{d}{M\_m}}{D\_m}}{t\_0}}}{\ell} + 1\right)\\
\end{array}
\end{array}
if d < -7.99999999999999982e102Initial program 69.5%
Simplified67.0%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.3%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f640.6%
Simplified0.6%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f640.6%
Applied egg-rr0.6%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6465.6%
Simplified65.6%
if -7.99999999999999982e102 < d < -1.999999999999994e-310Initial program 63.4%
Simplified58.1%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr59.9%
associate-*r/N/A
associate-/l/N/A
div-invN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.7%
Applied egg-rr58.7%
*-commutativeN/A
sqrt-unprodN/A
clear-numN/A
div-invN/A
associate-/r*N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6448.2%
Applied egg-rr48.2%
if -1.999999999999994e-310 < d Initial program 61.3%
Simplified59.7%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.9%
sqrt-unprodN/A
frac-timesN/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6469.8%
Applied egg-rr69.8%
Final simplification64.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(+
(/ (* h (/ (* D_m -0.25) (/ (/ (/ d M_m) D_m) (/ M_m (* d 2.0))))) l)
1.0)))
(if (<= l 7.5e-308)
(* t_0 (sqrt (* (/ d l) (/ d h))))
(* (/ d (sqrt (* 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 = ((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.0;
double tmp;
if (l <= 7.5e-308) {
tmp = t_0 * sqrt(((d / l) * (d / h)));
} else {
tmp = (d / sqrt((h * l))) * 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 = ((h * ((d_m * (-0.25d0)) / (((d / m_m) / d_m) / (m_m / (d * 2.0d0))))) / l) + 1.0d0
if (l <= 7.5d-308) then
tmp = t_0 * sqrt(((d / l) * (d / h)))
else
tmp = (d / sqrt((h * l))) * 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 = ((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.0;
double tmp;
if (l <= 7.5e-308) {
tmp = t_0 * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = (d / Math.sqrt((h * l))) * 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 = ((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.0 tmp = 0 if l <= 7.5e-308: tmp = t_0 * math.sqrt(((d / l) * (d / h))) else: tmp = (d / math.sqrt((h * l))) * 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 = Float64(Float64(Float64(h * Float64(Float64(D_m * -0.25) / Float64(Float64(Float64(d / M_m) / D_m) / Float64(M_m / Float64(d * 2.0))))) / l) + 1.0) tmp = 0.0 if (l <= 7.5e-308) tmp = Float64(t_0 * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(Float64(d / sqrt(Float64(h * l))) * 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 = ((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.0;
tmp = 0.0;
if (l <= 7.5e-308)
tmp = t_0 * sqrt(((d / l) * (d / h)));
else
tmp = (d / sqrt((h * l))) * 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[(N[(N[(h * N[(N[(D$95$m * -0.25), $MachinePrecision] / N[(N[(N[(d / M$95$m), $MachinePrecision] / D$95$m), $MachinePrecision] / N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[l, 7.5e-308], N[(t$95$0 * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \frac{h \cdot \frac{D\_m \cdot -0.25}{\frac{\frac{\frac{d}{M\_m}}{D\_m}}{\frac{M\_m}{d \cdot 2}}}}{\ell} + 1\\
\mathbf{if}\;\ell \leq 7.5 \cdot 10^{-308}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot t\_0\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
frac-timesN/A
*-lft-identityN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6449.3%
Applied egg-rr49.3%
associate-/r*N/A
div-invN/A
clear-numN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6452.2%
Applied egg-rr52.2%
if 7.4999999999999998e-308 < l Initial program 61.0%
Simplified59.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.7%
sqrt-unprodN/A
frac-timesN/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6470.2%
Applied egg-rr70.2%
Final simplification63.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-308)
(*
(+ (/ (* M_m (* (* h D_m) -0.125)) (* d (/ l (/ (* D_m M_m) d)))) 1.0)
(sqrt (* (/ d l) (/ d h))))
(*
(/ d (sqrt (* h l)))
(+
(/ (* h (/ (* D_m -0.25) (/ (/ (/ d M_m) D_m) (/ M_m (* d 2.0))))) l)
1.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 tmp;
if (l <= 7.5e-308) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
} else {
tmp = (d / sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.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) :: tmp
if (l <= 7.5d-308) then
tmp = (((m_m * ((h * d_m) * (-0.125d0))) / (d * (l / ((d_m * m_m) / d)))) + 1.0d0) * sqrt(((d / l) * (d / h)))
else
tmp = (d / sqrt((h * l))) * (((h * ((d_m * (-0.25d0)) / (((d / m_m) / d_m) / (m_m / (d * 2.0d0))))) / l) + 1.0d0)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = (d / Math.sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.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): tmp = 0 if l <= 7.5e-308: tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * math.sqrt(((d / l) * (d / h))) else: tmp = (d / math.sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.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) tmp = 0.0 if (l <= 7.5e-308) tmp = Float64(Float64(Float64(Float64(M_m * Float64(Float64(h * D_m) * -0.125)) / Float64(d * Float64(l / Float64(Float64(D_m * M_m) / d)))) + 1.0) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(Float64(d / sqrt(Float64(h * l))) * Float64(Float64(Float64(h * Float64(Float64(D_m * -0.25) / Float64(Float64(Float64(d / M_m) / D_m) / Float64(M_m / Float64(d * 2.0))))) / l) + 1.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)
tmp = 0.0;
if (l <= 7.5e-308)
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
else
tmp = (d / sqrt((h * l))) * (((h * ((D_m * -0.25) / (((d / M_m) / D_m) / (M_m / (d * 2.0))))) / l) + 1.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_] := If[LessEqual[l, 7.5e-308], N[(N[(N[(N[(M$95$m * N[(N[(h * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / N[(d * N[(l / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(h * N[(N[(D$95$m * -0.25), $MachinePrecision] / N[(N[(N[(d / M$95$m), $MachinePrecision] / D$95$m), $MachinePrecision] / N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $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^{-308}:\\
\;\;\;\;\left(\frac{M\_m \cdot \left(\left(h \cdot D\_m\right) \cdot -0.125\right)}{d \cdot \frac{\ell}{\frac{D\_m \cdot M\_m}{d}}} + 1\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}} \cdot \left(\frac{h \cdot \frac{D\_m \cdot -0.25}{\frac{\frac{\frac{d}{M\_m}}{D\_m}}{\frac{M\_m}{d \cdot 2}}}}{\ell} + 1\right)\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
Applied egg-rr62.7%
associate-/r/N/A
*-commutativeN/A
div-invN/A
associate-/l/N/A
clear-numN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l/N/A
associate-/l/N/A
associate-*l/N/A
Applied egg-rr65.5%
Applied egg-rr50.8%
if 7.4999999999999998e-308 < l Initial program 61.0%
Simplified59.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.7%
sqrt-unprodN/A
frac-timesN/A
sqrt-divN/A
sqrt-unprodN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6470.2%
Applied egg-rr70.2%
Final simplification62.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 (<= l 1.12e-305)
(*
(+ (/ (* M_m (* (* h D_m) -0.125)) (* d (/ l (/ (* D_m M_m) d)))) 1.0)
(sqrt (* (/ d l) (/ d h))))
(*
(+
(/ (* h (* (/ (* D_m (* M_m (* M_m (/ (/ D_m d) 2.0)))) d) -0.25)) l)
1.0)
(/ d (sqrt (* h l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 1.12e-305) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
} else {
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) * (d / sqrt((h * l)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 1.12d-305) then
tmp = (((m_m * ((h * d_m) * (-0.125d0))) / (d * (l / ((d_m * m_m) / d)))) + 1.0d0) * sqrt(((d / l) * (d / h)))
else
tmp = (((h * (((d_m * (m_m * (m_m * ((d_m / d) / 2.0d0)))) / d) * (-0.25d0))) / l) + 1.0d0) * (d / sqrt((h * l)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 1.12e-305) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) * (d / Math.sqrt((h * l)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 1.12e-305: tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * math.sqrt(((d / l) * (d / h))) else: tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) * (d / math.sqrt((h * l))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 1.12e-305) tmp = Float64(Float64(Float64(Float64(M_m * Float64(Float64(h * D_m) * -0.125)) / Float64(d * Float64(l / Float64(Float64(D_m * M_m) / d)))) + 1.0) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(Float64(Float64(Float64(h * Float64(Float64(Float64(D_m * Float64(M_m * Float64(M_m * Float64(Float64(D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) * Float64(d / sqrt(Float64(h * l)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 1.12e-305)
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
else
tmp = (((h * (((D_m * (M_m * (M_m * ((D_m / d) / 2.0)))) / d) * -0.25)) / l) + 1.0) * (d / sqrt((h * l)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 1.12e-305], N[(N[(N[(N[(M$95$m * N[(N[(h * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / N[(d * N[(l / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(h * N[(N[(N[(D$95$m * N[(M$95$m * N[(M$95$m * N[(N[(D$95$m / d), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision] * N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.12 \cdot 10^{-305}:\\
\;\;\;\;\left(\frac{M\_m \cdot \left(\left(h \cdot D\_m\right) \cdot -0.125\right)}{d \cdot \frac{\ell}{\frac{D\_m \cdot M\_m}{d}}} + 1\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{h \cdot \left(\frac{D\_m \cdot \left(M\_m \cdot \left(M\_m \cdot \frac{\frac{D\_m}{d}}{2}\right)\right)}{d} \cdot -0.25\right)}{\ell} + 1\right) \cdot \frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 1.1200000000000001e-305Initial program 65.9%
Simplified61.7%
Applied egg-rr62.7%
associate-/r/N/A
*-commutativeN/A
div-invN/A
associate-/l/N/A
clear-numN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l/N/A
associate-/l/N/A
associate-*l/N/A
Applied egg-rr65.5%
Applied egg-rr50.8%
if 1.1200000000000001e-305 < l Initial program 61.0%
Simplified59.4%
sqrt-divN/A
sqrt-divN/A
frac-timesN/A
rem-square-sqrtN/A
/-lowering-/.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
Final simplification60.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 3.6e-272)
(*
(+ (/ (* M_m (* (* h D_m) -0.125)) (* d (/ l (/ (* D_m M_m) d)))) 1.0)
(sqrt (* (/ d l) (/ d h))))
(/
(+ d (/ (* -0.125 (/ (* h (* D_m (* D_m (* M_m M_m)))) l)) d))
(sqrt (* h l)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 3.6e-272) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
} else {
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 3.6d-272) then
tmp = (((m_m * ((h * d_m) * (-0.125d0))) / (d * (l / ((d_m * m_m) / d)))) + 1.0d0) * sqrt(((d / l) * (d / h)))
else
tmp = (d + (((-0.125d0) * ((h * (d_m * (d_m * (m_m * m_m)))) / l)) / d)) / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 3.6e-272) {
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 3.6e-272: tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * math.sqrt(((d / l) * (d / h))) else: tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 3.6e-272) tmp = Float64(Float64(Float64(Float64(M_m * Float64(Float64(h * D_m) * -0.125)) / Float64(d * Float64(l / Float64(Float64(D_m * M_m) / d)))) + 1.0) * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(Float64(d + Float64(Float64(-0.125 * Float64(Float64(h * Float64(D_m * Float64(D_m * Float64(M_m * M_m)))) / l)) / d)) / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 3.6e-272)
tmp = (((M_m * ((h * D_m) * -0.125)) / (d * (l / ((D_m * M_m) / d)))) + 1.0) * sqrt(((d / l) * (d / h)));
else
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 3.6e-272], N[(N[(N[(N[(M$95$m * N[(N[(h * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision] / N[(d * N[(l / N[(N[(D$95$m * M$95$m), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d + N[(N[(-0.125 * N[(N[(h * N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.6 \cdot 10^{-272}:\\
\;\;\;\;\left(\frac{M\_m \cdot \left(\left(h \cdot D\_m\right) \cdot -0.125\right)}{d \cdot \frac{\ell}{\frac{D\_m \cdot M\_m}{d}}} + 1\right) \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d + \frac{-0.125 \cdot \frac{h \cdot \left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right)}{\ell}}{d}}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 3.59999999999999968e-272Initial program 66.9%
Simplified62.9%
Applied egg-rr63.9%
associate-/r/N/A
*-commutativeN/A
div-invN/A
associate-/l/N/A
clear-numN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l/N/A
associate-/l/N/A
associate-*l/N/A
Applied egg-rr66.5%
Applied egg-rr52.7%
if 3.59999999999999968e-272 < l Initial program 60.2%
Simplified58.5%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr62.9%
Applied egg-rr67.2%
Taylor expanded in h around 0
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
associate-/l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified58.6%
Final simplification56.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
(let* ((t_0 (sqrt (* h l))))
(if (<= l 6e-304)
(/ (sqrt (/ l h)) (/ l d))
(if (<= l 5.5e-193)
(/ (/ (* -0.125 (/ (* h (* D_m (* D_m (* M_m M_m)))) l)) d) t_0)
(/ d 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((h * l));
double tmp;
if (l <= 6e-304) {
tmp = sqrt((l / h)) / (l / d);
} else if (l <= 5.5e-193) {
tmp = ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d) / t_0;
} else {
tmp = d / 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((h * l))
if (l <= 6d-304) then
tmp = sqrt((l / h)) / (l / d)
else if (l <= 5.5d-193) then
tmp = (((-0.125d0) * ((h * (d_m * (d_m * (m_m * m_m)))) / l)) / d) / t_0
else
tmp = d / 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((h * l));
double tmp;
if (l <= 6e-304) {
tmp = Math.sqrt((l / h)) / (l / d);
} else if (l <= 5.5e-193) {
tmp = ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d) / t_0;
} else {
tmp = d / 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((h * l)) tmp = 0 if l <= 6e-304: tmp = math.sqrt((l / h)) / (l / d) elif l <= 5.5e-193: tmp = ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d) / t_0 else: tmp = d / 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(h * l)) tmp = 0.0 if (l <= 6e-304) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); elseif (l <= 5.5e-193) tmp = Float64(Float64(Float64(-0.125 * Float64(Float64(h * Float64(D_m * Float64(D_m * Float64(M_m * M_m)))) / l)) / d) / t_0); else tmp = Float64(d / 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((h * l));
tmp = 0.0;
if (l <= 6e-304)
tmp = sqrt((l / h)) / (l / d);
elseif (l <= 5.5e-193)
tmp = ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d) / t_0;
else
tmp = d / 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[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, 6e-304], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.5e-193], N[(N[(N[(-0.125 * N[(N[(h * N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision] / t$95$0), $MachinePrecision], N[(d / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;\ell \leq 6 \cdot 10^{-304}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{elif}\;\ell \leq 5.5 \cdot 10^{-193}:\\
\;\;\;\;\frac{\frac{-0.125 \cdot \frac{h \cdot \left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right)}{\ell}}{d}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{t\_0}\\
\end{array}
\end{array}
if l < 6.0000000000000002e-304Initial program 66.2%
Simplified62.0%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.5%
Simplified1.5%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.2%
Simplified44.2%
if 6.0000000000000002e-304 < l < 5.50000000000000014e-193Initial program 77.7%
Simplified77.9%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr77.9%
Applied egg-rr95.8%
Taylor expanded in d around 0
associate-*r/N/A
times-fracN/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6468.5%
Simplified68.5%
if 5.50000000000000014e-193 < l Initial program 58.1%
Simplified56.1%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.7%
Simplified48.7%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6449.8%
Applied egg-rr49.8%
remove-double-negN/A
neg-lowering-neg.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6451.2%
Applied egg-rr51.2%
Final simplification49.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 6.8e-304)
(/ (sqrt (/ l h)) (/ l d))
(if (<= l 1.25e-192)
(/
(* (* D_m (* D_m (* M_m M_m))) (* -0.125 (sqrt (/ h (* l (* l l))))))
d)
(/ d (sqrt (* h l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 6.8e-304) {
tmp = sqrt((l / h)) / (l / d);
} else if (l <= 1.25e-192) {
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 * sqrt((h / (l * (l * l)))))) / d;
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 6.8d-304) then
tmp = sqrt((l / h)) / (l / d)
else if (l <= 1.25d-192) then
tmp = ((d_m * (d_m * (m_m * m_m))) * ((-0.125d0) * sqrt((h / (l * (l * l)))))) / d
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 6.8e-304) {
tmp = Math.sqrt((l / h)) / (l / d);
} else if (l <= 1.25e-192) {
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 * Math.sqrt((h / (l * (l * l)))))) / d;
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 6.8e-304: tmp = math.sqrt((l / h)) / (l / d) elif l <= 1.25e-192: tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 * math.sqrt((h / (l * (l * l)))))) / d else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 6.8e-304) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); elseif (l <= 1.25e-192) tmp = Float64(Float64(Float64(D_m * Float64(D_m * Float64(M_m * M_m))) * Float64(-0.125 * sqrt(Float64(h / Float64(l * Float64(l * l)))))) / d); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 6.8e-304)
tmp = sqrt((l / h)) / (l / d);
elseif (l <= 1.25e-192)
tmp = ((D_m * (D_m * (M_m * M_m))) * (-0.125 * sqrt((h / (l * (l * l)))))) / d;
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 6.8e-304], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.25e-192], N[(N[(N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(-0.125 * N[Sqrt[N[(h / N[(l * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.8 \cdot 10^{-304}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{elif}\;\ell \leq 1.25 \cdot 10^{-192}:\\
\;\;\;\;\frac{\left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right) \cdot \left(-0.125 \cdot \sqrt{\frac{h}{\ell \cdot \left(\ell \cdot \ell\right)}}\right)}{d}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 6.7999999999999997e-304Initial program 66.2%
Simplified62.0%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.5%
Simplified1.5%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.2%
Simplified44.2%
if 6.7999999999999997e-304 < l < 1.25e-192Initial program 77.7%
Simplified77.9%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr77.9%
Taylor expanded in d around 0
associate-*l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified68.2%
if 1.25e-192 < l Initial program 58.1%
Simplified56.1%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.7%
Simplified48.7%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6449.8%
Applied egg-rr49.8%
remove-double-negN/A
neg-lowering-neg.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6451.2%
Applied egg-rr51.2%
Final simplification49.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 6e-304)
(/ (sqrt (/ l h)) (/ l d))
(if (<= l 1.32e-192)
(*
(* M_m M_m)
(* (sqrt (/ (/ h (* l l)) l)) (/ (* -0.125 (* D_m D_m)) d)))
(/ d (sqrt (* h l))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 6e-304) {
tmp = sqrt((l / h)) / (l / d);
} else if (l <= 1.32e-192) {
tmp = (M_m * M_m) * (sqrt(((h / (l * l)) / l)) * ((-0.125 * (D_m * D_m)) / d));
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 6d-304) then
tmp = sqrt((l / h)) / (l / d)
else if (l <= 1.32d-192) then
tmp = (m_m * m_m) * (sqrt(((h / (l * l)) / l)) * (((-0.125d0) * (d_m * d_m)) / d))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 6e-304) {
tmp = Math.sqrt((l / h)) / (l / d);
} else if (l <= 1.32e-192) {
tmp = (M_m * M_m) * (Math.sqrt(((h / (l * l)) / l)) * ((-0.125 * (D_m * D_m)) / d));
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 6e-304: tmp = math.sqrt((l / h)) / (l / d) elif l <= 1.32e-192: tmp = (M_m * M_m) * (math.sqrt(((h / (l * l)) / l)) * ((-0.125 * (D_m * D_m)) / d)) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 6e-304) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); elseif (l <= 1.32e-192) tmp = Float64(Float64(M_m * M_m) * Float64(sqrt(Float64(Float64(h / Float64(l * l)) / l)) * Float64(Float64(-0.125 * Float64(D_m * D_m)) / d))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 6e-304)
tmp = sqrt((l / h)) / (l / d);
elseif (l <= 1.32e-192)
tmp = (M_m * M_m) * (sqrt(((h / (l * l)) / l)) * ((-0.125 * (D_m * D_m)) / d));
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 6e-304], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.32e-192], N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[Sqrt[N[(N[(h / N[(l * l), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * N[(N[(-0.125 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6 \cdot 10^{-304}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{elif}\;\ell \leq 1.32 \cdot 10^{-192}:\\
\;\;\;\;\left(M\_m \cdot M\_m\right) \cdot \left(\sqrt{\frac{\frac{h}{\ell \cdot \ell}}{\ell}} \cdot \frac{-0.125 \cdot \left(D\_m \cdot D\_m\right)}{d}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 6.0000000000000002e-304Initial program 66.2%
Simplified62.0%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.5%
Simplified1.5%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.2%
Simplified44.2%
if 6.0000000000000002e-304 < l < 1.32e-192Initial program 77.7%
Simplified77.9%
Taylor expanded in d around 0
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
Simplified68.2%
if 1.32e-192 < l Initial program 58.1%
Simplified56.1%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.7%
Simplified48.7%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6449.8%
Applied egg-rr49.8%
remove-double-negN/A
neg-lowering-neg.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6451.2%
Applied egg-rr51.2%
Final simplification49.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.5e-308)
(/ (sqrt (/ l h)) (/ l d))
(/
(+ d (/ (* -0.125 (/ (* h (* D_m (* D_m (* M_m M_m)))) l)) d))
(sqrt (* h l)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = sqrt((l / h)) / (l / d);
} else {
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 7.5d-308) then
tmp = sqrt((l / h)) / (l / d)
else
tmp = (d + (((-0.125d0) * ((h * (d_m * (d_m * (m_m * m_m)))) / l)) / d)) / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = Math.sqrt((l / h)) / (l / d);
} else {
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 7.5e-308: tmp = math.sqrt((l / h)) / (l / d) else: tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 7.5e-308) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); else tmp = Float64(Float64(d + Float64(Float64(-0.125 * Float64(Float64(h * Float64(D_m * Float64(D_m * Float64(M_m * M_m)))) / l)) / d)) / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 7.5e-308)
tmp = sqrt((l / h)) / (l / d);
else
tmp = (d + ((-0.125 * ((h * (D_m * (D_m * (M_m * M_m)))) / l)) / d)) / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 7.5e-308], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], N[(N[(d + N[(N[(-0.125 * N[(N[(h * N[(D$95$m * N[(D$95$m * N[(M$95$m * M$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.5 \cdot 10^{-308}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d + \frac{-0.125 \cdot \frac{h \cdot \left(D\_m \cdot \left(D\_m \cdot \left(M\_m \cdot M\_m\right)\right)\right)}{\ell}}{d}}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.6%
Simplified1.6%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.7%
Simplified44.7%
if 7.4999999999999998e-308 < l Initial program 61.0%
Simplified59.4%
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l/N/A
associate-/l*N/A
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
Applied egg-rr63.7%
Applied egg-rr68.4%
Taylor expanded in h around 0
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r/N/A
associate-/l/N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified58.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 7.5e-308) (/ (sqrt (/ l h)) (/ l d)) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = sqrt((l / h)) / (l / d);
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 7.5d-308) then
tmp = sqrt((l / h)) / (l / d)
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 7.5e-308) {
tmp = Math.sqrt((l / h)) / (l / d);
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 7.5e-308: tmp = math.sqrt((l / h)) / (l / d) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 7.5e-308) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 7.5e-308)
tmp = sqrt((l / h)) / (l / d);
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 7.5e-308], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.5 \cdot 10^{-308}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 7.4999999999999998e-308Initial program 65.9%
Simplified61.7%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified0.5%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.6%
Simplified1.6%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6444.7%
Simplified44.7%
if 7.4999999999999998e-308 < l Initial program 61.0%
Simplified59.4%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6444.2%
Simplified44.2%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6445.1%
Applied egg-rr45.1%
remove-double-negN/A
neg-lowering-neg.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6450.2%
Applied egg-rr50.2%
Final simplification44.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 (<= l 1.3e-257) (/ (sqrt (/ l h)) (/ l d)) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 1.3e-257) {
tmp = sqrt((l / h)) / (l / d);
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= 1.3d-257) then
tmp = sqrt((l / h)) / (l / d)
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= 1.3e-257) {
tmp = Math.sqrt((l / h)) / (l / d);
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= 1.3e-257: tmp = math.sqrt((l / h)) / (l / d) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= 1.3e-257) tmp = Float64(sqrt(Float64(l / h)) / Float64(l / d)); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= 1.3e-257)
tmp = sqrt((l / h)) / (l / d);
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, 1.3e-257], N[(N[Sqrt[N[(l / h), $MachinePrecision]], $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.3 \cdot 10^{-257}:\\
\;\;\;\;\frac{\sqrt{\frac{\ell}{h}}}{\frac{\ell}{d}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < 1.3e-257Initial program 66.3%
Simplified62.4%
Taylor expanded in l around 0
/-lowering-/.f64N/A
Simplified3.3%
Taylor expanded in h around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
unpow2N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f641.4%
Simplified1.4%
*-commutativeN/A
times-fracN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f641.8%
Applied egg-rr1.8%
Taylor expanded in l around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6441.5%
Simplified41.5%
if 1.3e-257 < l Initial program 60.4%
Simplified58.7%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6446.5%
Simplified46.5%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6447.5%
Applied egg-rr47.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= d -9.5e-259) (sqrt (/ (/ d h) (/ l d))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -9.5e-259) {
tmp = sqrt(((d / h) / (l / d)));
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-9.5d-259)) then
tmp = sqrt(((d / h) / (l / d)))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -9.5e-259) {
tmp = Math.sqrt(((d / h) / (l / d)));
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -9.5e-259: tmp = math.sqrt(((d / h) / (l / d))) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -9.5e-259) tmp = sqrt(Float64(Float64(d / h) / Float64(l / d))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -9.5e-259)
tmp = sqrt(((d / h) / (l / d)));
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -9.5e-259], N[Sqrt[N[(N[(d / h), $MachinePrecision] / N[(l / d), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -9.5 \cdot 10^{-259}:\\
\;\;\;\;\sqrt{\frac{\frac{d}{h}}{\frac{\ell}{d}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if d < -9.4999999999999995e-259Initial program 65.9%
Simplified61.3%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f642.9%
Simplified2.9%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f642.9%
Applied egg-rr2.9%
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
frac-timesN/A
frac-2negN/A
associate-*r/N/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
neg-sub0N/A
--lowering--.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
neg-sub0N/A
--lowering--.f6436.0%
Applied egg-rr36.0%
sub0-negN/A
sqrt-prodN/A
pow1/2N/A
associate-/l*N/A
clear-numN/A
unpow1/2N/A
sub0-negN/A
pow1/2N/A
sqrt-divN/A
frac-2negN/A
div-invN/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6434.9%
Applied egg-rr34.9%
if -9.4999999999999995e-259 < d Initial program 61.2%
Simplified59.7%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.3%
Simplified43.3%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6444.2%
Applied egg-rr44.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 (<= d -9.5e-259) (sqrt (/ d (/ h (/ d l)))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -9.5e-259) {
tmp = sqrt((d / (h / (d / l))));
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-9.5d-259)) then
tmp = sqrt((d / (h / (d / l))))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -9.5e-259) {
tmp = Math.sqrt((d / (h / (d / l))));
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -9.5e-259: tmp = math.sqrt((d / (h / (d / l)))) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -9.5e-259) tmp = sqrt(Float64(d / Float64(h / Float64(d / l)))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -9.5e-259)
tmp = sqrt((d / (h / (d / l))));
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -9.5e-259], N[Sqrt[N[(d / N[(h / N[(d / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -9.5 \cdot 10^{-259}:\\
\;\;\;\;\sqrt{\frac{d}{\frac{h}{\frac{d}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if d < -9.4999999999999995e-259Initial program 65.9%
Simplified61.3%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f642.9%
Simplified2.9%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f642.9%
Applied egg-rr2.9%
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
frac-timesN/A
*-commutativeN/A
clear-numN/A
div-invN/A
associate-/r*N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6431.8%
Applied egg-rr31.8%
if -9.4999999999999995e-259 < d Initial program 61.2%
Simplified59.7%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.3%
Simplified43.3%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6444.2%
Applied egg-rr44.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 (<= d -7.8e-259) (sqrt (/ d (* l (/ h d)))) (/ d (sqrt (* h l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -7.8e-259) {
tmp = sqrt((d / (l * (h / d))));
} else {
tmp = d / sqrt((h * l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (d <= (-7.8d-259)) then
tmp = sqrt((d / (l * (h / d))))
else
tmp = d / sqrt((h * l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -7.8e-259) {
tmp = Math.sqrt((d / (l * (h / d))));
} else {
tmp = d / Math.sqrt((h * l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if d <= -7.8e-259: tmp = math.sqrt((d / (l * (h / d)))) else: tmp = d / math.sqrt((h * l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -7.8e-259) tmp = sqrt(Float64(d / Float64(l * Float64(h / d)))); else tmp = Float64(d / sqrt(Float64(h * l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (d <= -7.8e-259)
tmp = sqrt((d / (l * (h / d))));
else
tmp = d / sqrt((h * l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -7.8e-259], N[Sqrt[N[(d / N[(l * N[(h / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -7.8 \cdot 10^{-259}:\\
\;\;\;\;\sqrt{\frac{d}{\ell \cdot \frac{h}{d}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{d}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if d < -7.80000000000000031e-259Initial program 65.9%
Simplified61.3%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f642.9%
Simplified2.9%
sqrt-divN/A
metadata-evalN/A
div-invN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-divN/A
frac-timesN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
frac-timesN/A
*-lft-identityN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6431.7%
Applied egg-rr31.7%
if -7.80000000000000031e-259 < d Initial program 61.2%
Simplified59.7%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6443.3%
Simplified43.3%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6444.2%
Applied egg-rr44.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 (/ d (sqrt (* h l))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((h * l));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((h * l))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((h * l));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((h * l))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(h * l))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((h * l));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{h \cdot \ell}}
\end{array}
Initial program 62.9%
Simplified60.3%
Taylor expanded in d around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.0%
Simplified29.0%
sqrt-divN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6429.5%
Applied egg-rr29.5%
herbie shell --seed 2024164
(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)))))