
(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 21 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)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (- d))))
(if (<= h -4e-310)
(*
(/ t_0 (sqrt (- h)))
(*
(/ t_0 (sqrt (- l)))
(- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D d)) 2.0) l))))))
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* D (/ (* M_m 0.5) d)) 2.0)) 1.0)
(* (sqrt l) (sqrt h)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt(-d);
double tmp;
if (h <= -4e-310) {
tmp = (t_0 / sqrt(-h)) * ((t_0 / sqrt(-l)) * (1.0 - (h * (0.125 * (pow((M_m * (D / d)), 2.0) / l)))));
} else {
tmp = d * (fma((h / l), (-0.5 * pow((D * ((M_m * 0.5) / d)), 2.0)), 1.0) / (sqrt(l) * sqrt(h)));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(-d)) tmp = 0.0 if (h <= -4e-310) tmp = Float64(Float64(t_0 / sqrt(Float64(-h))) * Float64(Float64(t_0 / sqrt(Float64(-l))) * Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D / d)) ^ 2.0) / l)))))); else tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(Float64(M_m * 0.5) / d)) ^ 2.0)), 1.0) / Float64(sqrt(l) * sqrt(h)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[(-d)], $MachinePrecision]}, If[LessEqual[h, -4e-310], N[(N[(t$95$0 / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{-d}\\
\mathbf{if}\;h \leq -4 \cdot 10^{-310}:\\
\;\;\;\;\frac{t\_0}{\sqrt{-h}} \cdot \left(\frac{t\_0}{\sqrt{-\ell}} \cdot \left(1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if h < -3.999999999999988e-310Initial program 62.8%
Simplified62.1%
Taylor expanded in h around -inf 37.8%
associate-*r*37.8%
neg-mul-137.8%
sub-neg37.8%
distribute-lft-in37.8%
Simplified63.2%
frac-2neg63.2%
sqrt-div71.2%
Applied egg-rr71.2%
frac-2neg71.2%
sqrt-div84.5%
Applied egg-rr84.5%
if -3.999999999999988e-310 < h Initial program 64.1%
Simplified63.4%
associate-*r/65.5%
*-commutative65.5%
div-inv65.5%
metadata-eval65.5%
Applied egg-rr65.5%
Applied egg-rr75.8%
unpow175.8%
associate-*l/77.6%
associate-/l*76.0%
Simplified72.8%
pow1/272.8%
*-commutative72.8%
unpow-prod-down83.5%
pow1/283.5%
pow1/283.5%
Applied egg-rr83.5%
Final simplification84.0%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* M_m D) (* d 2.0)) 2.0))))))
(t_1 (sqrt (/ d h)))
(t_2 (sqrt (/ d l)))
(t_3 (fabs (/ d (sqrt (* h l)))))
(t_4 (- 1.0 (* 0.5 (/ (* h (pow (* (/ D d) (* M_m 0.5)) 2.0)) l)))))
(if (<= t_0 -5e+133)
(* t_4 (* t_1 t_2))
(if (<= t_0 0.0)
(* t_3 (- 1.0 (* 0.5 (* (/ h l) (pow (* D (* M_m (/ 0.5 d))) 2.0)))))
(if (<= t_0 2e+253)
(*
t_1
(* t_2 (+ 1.0 (* h (* -0.125 (/ (pow (* D (/ M_m d)) 2.0) l))))))
(* t_3 t_4))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = (pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((M_m * D) / (d * 2.0)), 2.0))));
double t_1 = sqrt((d / h));
double t_2 = sqrt((d / l));
double t_3 = fabs((d / sqrt((h * l))));
double t_4 = 1.0 - (0.5 * ((h * pow(((D / d) * (M_m * 0.5)), 2.0)) / l));
double tmp;
if (t_0 <= -5e+133) {
tmp = t_4 * (t_1 * t_2);
} else if (t_0 <= 0.0) {
tmp = t_3 * (1.0 - (0.5 * ((h / l) * pow((D * (M_m * (0.5 / d))), 2.0))));
} else if (t_0 <= 2e+253) {
tmp = t_1 * (t_2 * (1.0 + (h * (-0.125 * (pow((D * (M_m / d)), 2.0) / l)))));
} else {
tmp = t_3 * t_4;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_0 = (((d / h) ** 0.5d0) * ((d / l) ** 0.5d0)) * (1.0d0 - ((h / l) * (0.5d0 * (((m_m * d_1) / (d * 2.0d0)) ** 2.0d0))))
t_1 = sqrt((d / h))
t_2 = sqrt((d / l))
t_3 = abs((d / sqrt((h * l))))
t_4 = 1.0d0 - (0.5d0 * ((h * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)) / l))
if (t_0 <= (-5d+133)) then
tmp = t_4 * (t_1 * t_2)
else if (t_0 <= 0.0d0) then
tmp = t_3 * (1.0d0 - (0.5d0 * ((h / l) * ((d_1 * (m_m * (0.5d0 / d))) ** 2.0d0))))
else if (t_0 <= 2d+253) then
tmp = t_1 * (t_2 * (1.0d0 + (h * ((-0.125d0) * (((d_1 * (m_m / d)) ** 2.0d0) / l)))))
else
tmp = t_3 * t_4
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = (Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((M_m * D) / (d * 2.0)), 2.0))));
double t_1 = Math.sqrt((d / h));
double t_2 = Math.sqrt((d / l));
double t_3 = Math.abs((d / Math.sqrt((h * l))));
double t_4 = 1.0 - (0.5 * ((h * Math.pow(((D / d) * (M_m * 0.5)), 2.0)) / l));
double tmp;
if (t_0 <= -5e+133) {
tmp = t_4 * (t_1 * t_2);
} else if (t_0 <= 0.0) {
tmp = t_3 * (1.0 - (0.5 * ((h / l) * Math.pow((D * (M_m * (0.5 / d))), 2.0))));
} else if (t_0 <= 2e+253) {
tmp = t_1 * (t_2 * (1.0 + (h * (-0.125 * (Math.pow((D * (M_m / d)), 2.0) / l)))));
} else {
tmp = t_3 * t_4;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = (math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((M_m * D) / (d * 2.0)), 2.0)))) t_1 = math.sqrt((d / h)) t_2 = math.sqrt((d / l)) t_3 = math.fabs((d / math.sqrt((h * l)))) t_4 = 1.0 - (0.5 * ((h * math.pow(((D / d) * (M_m * 0.5)), 2.0)) / l)) tmp = 0 if t_0 <= -5e+133: tmp = t_4 * (t_1 * t_2) elif t_0 <= 0.0: tmp = t_3 * (1.0 - (0.5 * ((h / l) * math.pow((D * (M_m * (0.5 / d))), 2.0)))) elif t_0 <= 2e+253: tmp = t_1 * (t_2 * (1.0 + (h * (-0.125 * (math.pow((D * (M_m / d)), 2.0) / l))))) else: tmp = t_3 * t_4 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(M_m * D) / Float64(d * 2.0)) ^ 2.0))))) t_1 = sqrt(Float64(d / h)) t_2 = sqrt(Float64(d / l)) t_3 = abs(Float64(d / sqrt(Float64(h * l)))) t_4 = Float64(1.0 - Float64(0.5 * Float64(Float64(h * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)) / l))) tmp = 0.0 if (t_0 <= -5e+133) tmp = Float64(t_4 * Float64(t_1 * t_2)); elseif (t_0 <= 0.0) tmp = Float64(t_3 * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0))))); elseif (t_0 <= 2e+253) tmp = Float64(t_1 * Float64(t_2 * Float64(1.0 + Float64(h * Float64(-0.125 * Float64((Float64(D * Float64(M_m / d)) ^ 2.0) / l)))))); else tmp = Float64(t_3 * t_4); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((M_m * D) / (d * 2.0)) ^ 2.0))));
t_1 = sqrt((d / h));
t_2 = sqrt((d / l));
t_3 = abs((d / sqrt((h * l))));
t_4 = 1.0 - (0.5 * ((h * (((D / d) * (M_m * 0.5)) ^ 2.0)) / l));
tmp = 0.0;
if (t_0 <= -5e+133)
tmp = t_4 * (t_1 * t_2);
elseif (t_0 <= 0.0)
tmp = t_3 * (1.0 - (0.5 * ((h / l) * ((D * (M_m * (0.5 / d))) ^ 2.0))));
elseif (t_0 <= 2e+253)
tmp = t_1 * (t_2 * (1.0 + (h * (-0.125 * (((D * (M_m / d)) ^ 2.0) / l)))));
else
tmp = t_3 * t_4;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(M$95$m * D), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(1.0 - N[(0.5 * N[(N[(h * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+133], N[(t$95$4 * N[(t$95$1 * t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(t$95$3 * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+253], N[(t$95$1 * N[(t$95$2 * N[(1.0 + N[(h * N[(-0.125 * N[(N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$3 * t$95$4), $MachinePrecision]]]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{M\_m \cdot D}{d \cdot 2}\right)}^{2}\right)\right)\\
t_1 := \sqrt{\frac{d}{h}}\\
t_2 := \sqrt{\frac{d}{\ell}}\\
t_3 := \left|\frac{d}{\sqrt{h \cdot \ell}}\right|\\
t_4 := 1 - 0.5 \cdot \frac{h \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}}{\ell}\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{+133}:\\
\;\;\;\;t\_4 \cdot \left(t\_1 \cdot t\_2\right)\\
\mathbf{elif}\;t\_0 \leq 0:\\
\;\;\;\;t\_3 \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(D \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}\right)\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+253}:\\
\;\;\;\;t\_1 \cdot \left(t\_2 \cdot \left(1 + h \cdot \left(-0.125 \cdot \frac{{\left(D \cdot \frac{M\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_3 \cdot t\_4\\
\end{array}
\end{array}
if (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < -4.99999999999999961e133Initial program 89.1%
Simplified86.7%
associate-*r/88.6%
*-commutative88.6%
div-inv88.6%
metadata-eval88.6%
Applied egg-rr88.6%
if -4.99999999999999961e133 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < 0.0Initial program 54.2%
Simplified54.3%
pow154.3%
sqrt-unprod44.2%
Applied egg-rr44.2%
unpow144.2%
Simplified44.2%
add-sqr-sqrt44.2%
rem-sqrt-square44.2%
frac-times40.7%
sqrt-div44.7%
sqrt-unprod54.8%
add-sqr-sqrt89.2%
Applied egg-rr89.2%
Taylor expanded in M around 0 89.1%
associate-*r/89.1%
*-commutative89.1%
associate-*l*89.1%
associate-*l/72.4%
*-commutative72.4%
*-commutative72.4%
associate-/l*72.4%
Simplified72.4%
if 0.0 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) < 1.9999999999999999e253Initial program 98.7%
Simplified98.7%
Taylor expanded in h around -inf 69.3%
associate-*r*69.3%
neg-mul-169.3%
sub-neg69.3%
distribute-lft-in69.3%
Simplified98.7%
pow198.7%
associate-*r/98.7%
Applied egg-rr98.7%
unpow198.7%
distribute-lft-neg-in98.7%
distribute-rgt-neg-in98.7%
associate-/l*98.7%
distribute-lft-neg-in98.7%
metadata-eval98.7%
associate-*r/98.7%
*-commutative98.7%
associate-/l*98.7%
Simplified98.7%
if 1.9999999999999999e253 < (*.f64 (*.f64 (pow.f64 (/.f64 d h) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64))) (pow.f64 (/.f64 d l) (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)))) (-.f64 #s(literal 1 binary64) (*.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))) (/.f64 h l)))) Initial program 14.9%
Simplified14.9%
pow114.9%
sqrt-unprod13.8%
Applied egg-rr13.8%
unpow113.8%
Simplified13.8%
add-sqr-sqrt13.8%
rem-sqrt-square13.8%
frac-times18.6%
sqrt-div23.2%
sqrt-unprod27.6%
add-sqr-sqrt47.3%
Applied egg-rr47.3%
associate-*r/20.1%
*-commutative20.1%
div-inv20.1%
metadata-eval20.1%
Applied egg-rr60.5%
Final simplification80.2%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -3.4e+106)
(*
(/ (sqrt (- d)) (sqrt (- l)))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* -0.125 (pow (* D (/ M_m d)) 2.0))))))
(if (<= l 1.25e-142)
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (/ (* h (pow (* (/ D d) (* M_m 0.5)) 2.0)) l))))
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* D (/ (* M_m 0.5) d)) 2.0)) 1.0)
(* (sqrt l) (sqrt h)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -3.4e+106) {
tmp = (sqrt(-d) / sqrt(-l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.125 * pow((D * (M_m / d)), 2.0)))));
} else if (l <= 1.25e-142) {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h * pow(((D / d) * (M_m * 0.5)), 2.0)) / l)));
} else {
tmp = d * (fma((h / l), (-0.5 * pow((D * ((M_m * 0.5) / d)), 2.0)), 1.0) / (sqrt(l) * sqrt(h)));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -3.4e+106) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.125 * (Float64(D * Float64(M_m / d)) ^ 2.0)))))); elseif (l <= 1.25e-142) tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)) / l)))); else tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(Float64(M_m * 0.5) / d)) ^ 2.0)), 1.0) / Float64(sqrt(l) * sqrt(h)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -3.4e+106], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.125 * N[Power[N[(D * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.25e-142], N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -3.4 \cdot 10^{+106}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.125 \cdot {\left(D \cdot \frac{M\_m}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{elif}\;\ell \leq 1.25 \cdot 10^{-142}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \frac{h \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}, 1\right)}{\sqrt{\ell} \cdot \sqrt{h}}\\
\end{array}
\end{array}
if l < -3.39999999999999994e106Initial program 48.7%
Simplified48.5%
Taylor expanded in D around 0 48.7%
*-commutative48.7%
associate-*l/48.7%
associate-*r*48.7%
Simplified48.7%
Taylor expanded in D around 0 32.1%
*-commutative32.1%
associate-/l*34.5%
unpow234.5%
unpow234.5%
unpow234.5%
times-frac39.5%
swap-sqr48.7%
unpow248.7%
associate-*r/48.7%
*-commutative48.7%
associate-/l*48.5%
Simplified48.5%
frac-2neg48.7%
sqrt-div61.4%
Applied egg-rr58.8%
if -3.39999999999999994e106 < l < 1.2500000000000001e-142Initial program 69.1%
Simplified67.5%
pow167.5%
sqrt-unprod56.1%
Applied egg-rr56.1%
unpow156.1%
Simplified56.1%
add-sqr-sqrt56.1%
rem-sqrt-square56.1%
frac-times47.6%
sqrt-div52.2%
sqrt-unprod19.3%
add-sqr-sqrt77.1%
Applied egg-rr77.1%
associate-*r/70.7%
*-commutative70.7%
div-inv70.7%
metadata-eval70.7%
Applied egg-rr85.1%
if 1.2500000000000001e-142 < l Initial program 62.3%
Simplified62.3%
associate-*r/63.4%
*-commutative63.4%
div-inv63.4%
metadata-eval63.4%
Applied egg-rr63.4%
Applied egg-rr74.7%
unpow174.7%
associate-*l/77.2%
associate-/l*77.1%
Simplified73.8%
pow1/273.8%
*-commutative73.8%
unpow-prod-down84.3%
pow1/284.3%
pow1/284.3%
Applied egg-rr84.3%
Final simplification80.6%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.15e+148)
(* (/ (sqrt (- d)) (sqrt (- l))) (sqrt (/ d h)))
(if (<= l 1.75e+189)
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (/ (* h (pow (* (/ D d) (* M_m 0.5)) 2.0)) l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.15e+148) {
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
} else if (l <= 1.75e+189) {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h * pow(((D / d) * (M_m * 0.5)), 2.0)) / l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-1.15d+148)) then
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h))
else if (l <= 1.75d+189) then
tmp = abs((d / sqrt((h * l)))) * (1.0d0 - (0.5d0 * ((h * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)) / l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.15e+148) {
tmp = (Math.sqrt(-d) / Math.sqrt(-l)) * Math.sqrt((d / h));
} else if (l <= 1.75e+189) {
tmp = Math.abs((d / Math.sqrt((h * l)))) * (1.0 - (0.5 * ((h * Math.pow(((D / d) * (M_m * 0.5)), 2.0)) / l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -1.15e+148: tmp = (math.sqrt(-d) / math.sqrt(-l)) * math.sqrt((d / h)) elif l <= 1.75e+189: tmp = math.fabs((d / math.sqrt((h * l)))) * (1.0 - (0.5 * ((h * math.pow(((D / d) * (M_m * 0.5)), 2.0)) / l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.15e+148) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * sqrt(Float64(d / h))); elseif (l <= 1.75e+189) tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)) / l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -1.15e+148)
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
elseif (l <= 1.75e+189)
tmp = abs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h * (((D / d) * (M_m * 0.5)) ^ 2.0)) / l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.15e+148], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.75e+189], N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.15 \cdot 10^{+148}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+189}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \frac{h \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}}{\ell}\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.15e148Initial program 47.9%
Simplified47.7%
frac-2neg48.0%
sqrt-div60.9%
Applied egg-rr58.1%
Taylor expanded in d around inf 51.9%
if -1.15e148 < l < 1.74999999999999998e189Initial program 67.5%
Simplified66.5%
pow166.5%
sqrt-unprod53.8%
Applied egg-rr53.8%
unpow153.8%
Simplified53.8%
add-sqr-sqrt53.8%
rem-sqrt-square53.8%
frac-times44.6%
sqrt-div49.1%
sqrt-unprod40.0%
add-sqr-sqrt77.3%
Applied egg-rr77.3%
associate-*r/69.5%
*-commutative69.5%
div-inv69.5%
metadata-eval69.5%
Applied egg-rr83.3%
if 1.74999999999999998e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification78.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (sqrt (* h l))))
(if (<= l -6.8e+137)
(* (/ (sqrt (- d)) (sqrt (- l))) (sqrt (/ d h)))
(if (<= l 1.08e-145)
(*
(fabs (/ d t_0))
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0)))))
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* D (/ (* M_m 0.5) d)) 2.0)) 1.0)
t_0))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = sqrt((h * l));
double tmp;
if (l <= -6.8e+137) {
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
} else if (l <= 1.08e-145) {
tmp = fabs((d / t_0)) * (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0))));
} else {
tmp = d * (fma((h / l), (-0.5 * pow((D * ((M_m * 0.5) / d)), 2.0)), 1.0) / t_0);
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = sqrt(Float64(h * l)) tmp = 0.0 if (l <= -6.8e+137) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * sqrt(Float64(d / h))); elseif (l <= 1.08e-145) tmp = Float64(abs(Float64(d / t_0)) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))))); else tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(Float64(M_m * 0.5) / d)) ^ 2.0)), 1.0) / t_0)); end return tmp end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -6.8e+137], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.08e-145], N[(N[Abs[N[(d / t$95$0), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := \sqrt{h \cdot \ell}\\
\mathbf{if}\;\ell \leq -6.8 \cdot 10^{+137}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq 1.08 \cdot 10^{-145}:\\
\;\;\;\;\left|\frac{d}{t\_0}\right| \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}, 1\right)}{t\_0}\\
\end{array}
\end{array}
if l < -6.79999999999999973e137Initial program 47.9%
Simplified47.7%
frac-2neg48.0%
sqrt-div60.9%
Applied egg-rr58.1%
Taylor expanded in d around inf 51.9%
if -6.79999999999999973e137 < l < 1.07999999999999998e-145Initial program 68.8%
Simplified67.3%
pow167.3%
sqrt-unprod55.6%
Applied egg-rr55.6%
unpow155.6%
Simplified55.6%
add-sqr-sqrt55.6%
rem-sqrt-square55.6%
frac-times47.3%
sqrt-div51.9%
sqrt-unprod18.9%
add-sqr-sqrt76.9%
Applied egg-rr76.9%
if 1.07999999999999998e-145 < l Initial program 62.3%
Simplified62.3%
associate-*r/63.4%
*-commutative63.4%
div-inv63.4%
metadata-eval63.4%
Applied egg-rr63.4%
Applied egg-rr74.7%
unpow174.7%
associate-*l/77.2%
associate-/l*77.1%
Simplified73.8%
Final simplification72.1%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.45e+142)
(* (/ (sqrt (- d)) (sqrt (- l))) (sqrt (/ d h)))
(if (<= l -5e-310)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0))) -1.0))
(*
d
(/
(fma (/ h l) (* -0.5 (pow (* D (/ (* M_m 0.5) d)) 2.0)) 1.0)
(sqrt (* h l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.45e+142) {
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
} else if (l <= -5e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else {
tmp = d * (fma((h / l), (-0.5 * pow((D * ((M_m * 0.5) / d)), 2.0)), 1.0) / sqrt((h * l)));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.45e+142) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * sqrt(Float64(d / h))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); else tmp = Float64(d * Float64(fma(Float64(h / l), Float64(-0.5 * (Float64(D * Float64(Float64(M_m * 0.5) / d)) ^ 2.0)), 1.0) / sqrt(Float64(h * l)))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.45e+142], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D * N[(N[(M$95$m * 0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.45 \cdot 10^{+142}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\mathsf{fma}\left(\frac{h}{\ell}, -0.5 \cdot {\left(D \cdot \frac{M\_m \cdot 0.5}{d}\right)}^{2}, 1\right)}{\sqrt{h \cdot \ell}}\\
\end{array}
\end{array}
if l < -1.45000000000000007e142Initial program 47.9%
Simplified47.7%
frac-2neg48.0%
sqrt-div60.9%
Applied egg-rr58.1%
Taylor expanded in d around inf 51.9%
if -1.45000000000000007e142 < l < -4.999999999999985e-310Initial program 68.7%
Simplified67.7%
pow167.7%
sqrt-unprod54.9%
Applied egg-rr54.9%
unpow154.9%
Simplified54.9%
Taylor expanded in d around -inf 77.3%
if -4.999999999999985e-310 < l Initial program 64.1%
Simplified63.4%
associate-*r/65.5%
*-commutative65.5%
div-inv65.5%
metadata-eval65.5%
Applied egg-rr65.5%
Applied egg-rr75.8%
unpow175.8%
associate-*l/77.6%
associate-/l*76.0%
Simplified72.8%
Final simplification71.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -7e+147)
(* (/ (sqrt (- d)) (sqrt (- l))) (sqrt (/ d h)))
(*
(fabs (/ d (sqrt (* h l))))
(- 1.0 (* 0.5 (* (/ h l) (pow (* D (* M_m (/ 0.5 d))) 2.0)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -7e+147) {
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
} else {
tmp = fabs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * pow((D * (M_m * (0.5 / d))), 2.0))));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-7d+147)) then
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h))
else
tmp = abs((d / sqrt((h * l)))) * (1.0d0 - (0.5d0 * ((h / l) * ((d_1 * (m_m * (0.5d0 / d))) ** 2.0d0))))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -7e+147) {
tmp = (Math.sqrt(-d) / Math.sqrt(-l)) * Math.sqrt((d / h));
} else {
tmp = Math.abs((d / Math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * Math.pow((D * (M_m * (0.5 / d))), 2.0))));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -7e+147: tmp = (math.sqrt(-d) / math.sqrt(-l)) * math.sqrt((d / h)) else: tmp = math.fabs((d / math.sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * math.pow((D * (M_m * (0.5 / d))), 2.0)))) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -7e+147) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * sqrt(Float64(d / h))); else tmp = Float64(abs(Float64(d / sqrt(Float64(h * l)))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(D * Float64(M_m * Float64(0.5 / d))) ^ 2.0))))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -7e+147)
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
else
tmp = abs((d / sqrt((h * l)))) * (1.0 - (0.5 * ((h / l) * ((D * (M_m * (0.5 / d))) ^ 2.0))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -7e+147], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Abs[N[(d / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(D * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -7 \cdot 10^{+147}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;\left|\frac{d}{\sqrt{h \cdot \ell}}\right| \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(D \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}\right)\right)\\
\end{array}
\end{array}
if l < -6.99999999999999949e147Initial program 47.9%
Simplified47.7%
frac-2neg48.0%
sqrt-div60.9%
Applied egg-rr58.1%
Taylor expanded in d around inf 51.9%
if -6.99999999999999949e147 < l Initial program 66.2%
Simplified65.3%
pow165.3%
sqrt-unprod52.4%
Applied egg-rr52.4%
unpow152.4%
Simplified52.4%
add-sqr-sqrt52.4%
rem-sqrt-square52.4%
frac-times43.9%
sqrt-div48.9%
sqrt-unprod41.8%
add-sqr-sqrt76.0%
Applied egg-rr76.0%
Taylor expanded in M around 0 76.9%
associate-*r/76.9%
*-commutative76.9%
associate-*l*76.9%
associate-*l/74.2%
*-commutative74.2%
*-commutative74.2%
associate-/l*74.2%
Simplified74.2%
Final simplification70.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -4.7e+147)
(* (/ (sqrt (- d)) (sqrt (- l))) (sqrt (/ d h)))
(if (<= l -5e-310)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0))) -1.0))
(if (<= l 1.8e+189)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D d) (* M_m 0.5)) 2.0))))
(sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.7e+147) {
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
} else if (l <= -5e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 1.8e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * pow(((D / d) * (M_m * 0.5)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-4.7d+147)) then
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h))
else if (l <= (-5d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else if (l <= 1.8d+189) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.5d0) * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)))) / sqrt((h * l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.7e+147) {
tmp = (Math.sqrt(-d) / Math.sqrt(-l)) * Math.sqrt((d / h));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 1.8e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * Math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / Math.sqrt((h * l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -4.7e+147: tmp = (math.sqrt(-d) / math.sqrt(-l)) * math.sqrt((d / h)) elif l <= -5e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0) elif l <= 1.8e+189: tmp = d * ((1.0 + ((h / l) * (-0.5 * math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / math.sqrt((h * l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -4.7e+147) tmp = Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-l))) * sqrt(Float64(d / h))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); elseif (l <= 1.8e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -4.7e+147)
tmp = (sqrt(-d) / sqrt(-l)) * sqrt((d / h));
elseif (l <= -5e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
elseif (l <= 1.8e+189)
tmp = d * ((1.0 + ((h / l) * (-0.5 * (((D / d) * (M_m * 0.5)) ^ 2.0)))) / sqrt((h * l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -4.7e+147], N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.8e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.7 \cdot 10^{+147}:\\
\;\;\;\;\frac{\sqrt{-d}}{\sqrt{-\ell}} \cdot \sqrt{\frac{d}{h}}\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 1.8 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -4.7000000000000003e147Initial program 47.9%
Simplified47.7%
frac-2neg48.0%
sqrt-div60.9%
Applied egg-rr58.1%
Taylor expanded in d around inf 51.9%
if -4.7000000000000003e147 < l < -4.999999999999985e-310Initial program 68.7%
Simplified67.7%
pow167.7%
sqrt-unprod54.9%
Applied egg-rr54.9%
unpow154.9%
Simplified54.9%
Taylor expanded in d around -inf 77.3%
if -4.999999999999985e-310 < l < 1.80000000000000004e189Initial program 66.4%
Simplified65.5%
associate-*r/68.9%
*-commutative68.9%
div-inv68.9%
metadata-eval68.9%
Applied egg-rr68.9%
Applied egg-rr78.1%
unpow178.1%
associate-*l/80.3%
associate-/l*78.4%
Simplified75.6%
fma-undefine75.6%
associate-*r/78.4%
associate-*l/77.5%
*-commutative77.5%
Applied egg-rr77.5%
if 1.80000000000000004e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification74.1%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -6.4e+147)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l -5e-310)
(*
(* d (sqrt (/ 1.0 (* h l))))
(+ (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0))) -1.0))
(if (<= l 2.75e+189)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D d) (* M_m 0.5)) 2.0))))
(sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -6.4e+147) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= -5e-310) {
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 2.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * pow(((D / d) * (M_m * 0.5)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-6.4d+147)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= (-5d-310)) then
tmp = (d * sqrt((1.0d0 / (h * l)))) * ((0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0))) + (-1.0d0))
else if (l <= 2.75d+189) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.5d0) * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)))) / sqrt((h * l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -6.4e+147) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= -5e-310) {
tmp = (d * Math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0);
} else if (l <= 2.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * Math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / Math.sqrt((h * l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -6.4e+147: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= -5e-310: tmp = (d * math.sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0))) + -1.0) elif l <= 2.75e+189: tmp = d * ((1.0 + ((h / l) * (-0.5 * math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / math.sqrt((h * l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -6.4e+147) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= -5e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) * Float64(Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0))) + -1.0)); elseif (l <= 2.75e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -6.4e+147)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= -5e-310)
tmp = (d * sqrt((1.0 / (h * l)))) * ((0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0))) + -1.0);
elseif (l <= 2.75e+189)
tmp = d * ((1.0 + ((h / l) * (-0.5 * (((D / d) * (M_m * 0.5)) ^ 2.0)))) / sqrt((h * l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -6.4e+147], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -5e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.75e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.4 \cdot 10^{+147}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{h \cdot \ell}}\right) \cdot \left(0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right) + -1\right)\\
\mathbf{elif}\;\ell \leq 2.75 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -6.39999999999999958e147Initial program 47.9%
Simplified48.0%
Taylor expanded in d around inf 5.4%
pow15.4%
pow1/25.4%
inv-pow5.4%
pow-pow5.4%
metadata-eval5.4%
Applied egg-rr5.4%
unpow15.4%
Simplified5.4%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt48.4%
neg-mul-148.4%
Simplified48.4%
if -6.39999999999999958e147 < l < -4.999999999999985e-310Initial program 68.7%
Simplified67.7%
pow167.7%
sqrt-unprod54.9%
Applied egg-rr54.9%
unpow154.9%
Simplified54.9%
Taylor expanded in d around -inf 77.3%
if -4.999999999999985e-310 < l < 2.75e189Initial program 66.4%
Simplified65.5%
associate-*r/68.9%
*-commutative68.9%
div-inv68.9%
metadata-eval68.9%
Applied egg-rr68.9%
Applied egg-rr78.1%
unpow178.1%
associate-*l/80.3%
associate-/l*78.4%
Simplified75.6%
fma-undefine75.6%
associate-*r/78.4%
associate-*l/77.5%
*-commutative77.5%
Applied egg-rr77.5%
if 2.75e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification73.5%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (pow (* (/ D d) (* M_m 0.5)) 2.0)))
(if (<= l -1.02e+86)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 7.5e-259)
(* (- 1.0 (* 0.5 (/ (* h t_0) l))) (sqrt (* (/ d h) (/ d l))))
(if (<= l 1.75e+189)
(* d (/ (+ 1.0 (* (/ h l) (* -0.5 t_0))) (sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l))))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = pow(((D / d) * (M_m * 0.5)), 2.0);
double tmp;
if (l <= -1.02e+86) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 7.5e-259) {
tmp = (1.0 - (0.5 * ((h * t_0) / l))) * sqrt(((d / h) * (d / l)));
} else if (l <= 1.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * t_0))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: t_0
real(8) :: tmp
t_0 = ((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0
if (l <= (-1.02d+86)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 7.5d-259) then
tmp = (1.0d0 - (0.5d0 * ((h * t_0) / l))) * sqrt(((d / h) * (d / l)))
else if (l <= 1.75d+189) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.5d0) * t_0))) / sqrt((h * l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.pow(((D / d) * (M_m * 0.5)), 2.0);
double tmp;
if (l <= -1.02e+86) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 7.5e-259) {
tmp = (1.0 - (0.5 * ((h * t_0) / l))) * Math.sqrt(((d / h) * (d / l)));
} else if (l <= 1.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * t_0))) / Math.sqrt((h * l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.pow(((D / d) * (M_m * 0.5)), 2.0) tmp = 0 if l <= -1.02e+86: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 7.5e-259: tmp = (1.0 - (0.5 * ((h * t_0) / l))) * math.sqrt(((d / h) * (d / l))) elif l <= 1.75e+189: tmp = d * ((1.0 + ((h / l) * (-0.5 * t_0))) / math.sqrt((h * l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0 tmp = 0.0 if (l <= -1.02e+86) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 7.5e-259) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h * t_0) / l))) * sqrt(Float64(Float64(d / h) * Float64(d / l)))); elseif (l <= 1.75e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * t_0))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = ((D / d) * (M_m * 0.5)) ^ 2.0;
tmp = 0.0;
if (l <= -1.02e+86)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 7.5e-259)
tmp = (1.0 - (0.5 * ((h * t_0) / l))) * sqrt(((d / h) * (d / l)));
elseif (l <= 1.75e+189)
tmp = d * ((1.0 + ((h / l) * (-0.5 * t_0))) / sqrt((h * l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[l, -1.02e+86], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 7.5e-259], N[(N[(1.0 - N[(0.5 * N[(N[(h * t$95$0), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.75e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\\
\mathbf{if}\;\ell \leq -1.02 \cdot 10^{+86}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 7.5 \cdot 10^{-259}:\\
\;\;\;\;\left(1 - 0.5 \cdot \frac{h \cdot t\_0}{\ell}\right) \cdot \sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot t\_0\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.01999999999999996e86Initial program 45.7%
Simplified45.8%
Taylor expanded in d around inf 4.7%
pow14.7%
pow1/24.7%
inv-pow4.7%
pow-pow4.7%
metadata-eval4.7%
Applied egg-rr4.7%
unpow14.7%
Simplified4.7%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
neg-mul-146.8%
Simplified46.8%
if -1.01999999999999996e86 < l < 7.50000000000000052e-259Initial program 72.4%
Simplified71.4%
associate-*r/73.9%
*-commutative73.9%
div-inv73.9%
metadata-eval73.9%
Applied egg-rr73.9%
pow171.4%
sqrt-unprod59.2%
Applied egg-rr61.7%
unpow159.2%
Simplified61.7%
if 7.50000000000000052e-259 < l < 1.74999999999999998e189Initial program 65.4%
Simplified64.4%
associate-*r/68.0%
*-commutative68.0%
div-inv68.0%
metadata-eval68.0%
Applied egg-rr68.0%
Applied egg-rr80.7%
unpow180.7%
associate-*l/83.0%
associate-/l*81.0%
Simplified78.0%
fma-undefine78.0%
associate-*r/81.0%
associate-*l/80.0%
*-commutative80.0%
Applied egg-rr80.0%
if 1.74999999999999998e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification67.6%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -4.6e+88)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 1.45e-240)
(*
(sqrt (* (/ d h) (/ d l)))
(- 1.0 (* 0.5 (* (/ h l) (pow (/ (* M_m 0.5) (/ d D)) 2.0)))))
(if (<= l 1.8e+189)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D d) (* M_m 0.5)) 2.0))))
(sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.6e+88) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 1.45e-240) {
tmp = sqrt(((d / h) * (d / l))) * (1.0 - (0.5 * ((h / l) * pow(((M_m * 0.5) / (d / D)), 2.0))));
} else if (l <= 1.8e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * pow(((D / d) * (M_m * 0.5)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-4.6d+88)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 1.45d-240) then
tmp = sqrt(((d / h) * (d / l))) * (1.0d0 - (0.5d0 * ((h / l) * (((m_m * 0.5d0) / (d / d_1)) ** 2.0d0))))
else if (l <= 1.8d+189) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.5d0) * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)))) / sqrt((h * l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.6e+88) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 1.45e-240) {
tmp = Math.sqrt(((d / h) * (d / l))) * (1.0 - (0.5 * ((h / l) * Math.pow(((M_m * 0.5) / (d / D)), 2.0))));
} else if (l <= 1.8e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * Math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / Math.sqrt((h * l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -4.6e+88: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 1.45e-240: tmp = math.sqrt(((d / h) * (d / l))) * (1.0 - (0.5 * ((h / l) * math.pow(((M_m * 0.5) / (d / D)), 2.0)))) elif l <= 1.8e+189: tmp = d * ((1.0 + ((h / l) * (-0.5 * math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / math.sqrt((h * l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -4.6e+88) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 1.45e-240) tmp = Float64(sqrt(Float64(Float64(d / h) * Float64(d / l))) * Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m * 0.5) / Float64(d / D)) ^ 2.0))))); elseif (l <= 1.8e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -4.6e+88)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 1.45e-240)
tmp = sqrt(((d / h) * (d / l))) * (1.0 - (0.5 * ((h / l) * (((M_m * 0.5) / (d / D)) ^ 2.0))));
elseif (l <= 1.8e+189)
tmp = d * ((1.0 + ((h / l) * (-0.5 * (((D / d) * (M_m * 0.5)) ^ 2.0)))) / sqrt((h * l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -4.6e+88], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 1.45e-240], N[(N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m * 0.5), $MachinePrecision] / N[(d / D), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.8e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.6 \cdot 10^{+88}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 1.45 \cdot 10^{-240}:\\
\;\;\;\;\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}} \cdot \left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m \cdot 0.5}{\frac{d}{D}}\right)}^{2}\right)\right)\\
\mathbf{elif}\;\ell \leq 1.8 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -4.6000000000000003e88Initial program 45.7%
Simplified45.8%
Taylor expanded in d around inf 4.7%
pow14.7%
pow1/24.7%
inv-pow4.7%
pow-pow4.7%
metadata-eval4.7%
Applied egg-rr4.7%
unpow14.7%
Simplified4.7%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
neg-mul-146.8%
Simplified46.8%
if -4.6000000000000003e88 < l < 1.4500000000000001e-240Initial program 73.3%
Simplified72.3%
pow172.3%
sqrt-unprod59.5%
Applied egg-rr59.5%
unpow159.5%
Simplified59.5%
clear-num59.5%
un-div-inv59.5%
div-inv59.5%
metadata-eval59.5%
*-commutative59.5%
Applied egg-rr59.5%
if 1.4500000000000001e-240 < l < 1.80000000000000004e189Initial program 64.3%
Simplified63.3%
associate-*r/67.0%
*-commutative67.0%
div-inv67.0%
metadata-eval67.0%
Applied egg-rr67.0%
Applied egg-rr81.1%
unpow181.1%
associate-*l/83.4%
associate-/l*81.4%
Simplified78.3%
fma-undefine78.3%
associate-*r/81.4%
associate-*l/80.4%
*-commutative80.4%
Applied egg-rr80.4%
if 1.80000000000000004e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification66.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.8e+85)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 9.5e-262)
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ D d) (/ M_m 2.0)) 2.0))))
(sqrt (* (/ d h) (/ d l))))
(if (<= l 2.75e+189)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D d) (* M_m 0.5)) 2.0))))
(sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.8e+85) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 9.5e-262) {
tmp = (1.0 - (0.5 * ((h / l) * pow(((D / d) * (M_m / 2.0)), 2.0)))) * sqrt(((d / h) * (d / l)));
} else if (l <= 2.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * pow(((D / d) * (M_m * 0.5)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-1.8d+85)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 9.5d-262) then
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((d_1 / d) * (m_m / 2.0d0)) ** 2.0d0)))) * sqrt(((d / h) * (d / l)))
else if (l <= 2.75d+189) then
tmp = d * ((1.0d0 + ((h / l) * ((-0.5d0) * (((d_1 / d) * (m_m * 0.5d0)) ** 2.0d0)))) / sqrt((h * l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.8e+85) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 9.5e-262) {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((D / d) * (M_m / 2.0)), 2.0)))) * Math.sqrt(((d / h) * (d / l)));
} else if (l <= 2.75e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * Math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / Math.sqrt((h * l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -1.8e+85: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 9.5e-262: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((D / d) * (M_m / 2.0)), 2.0)))) * math.sqrt(((d / h) * (d / l))) elif l <= 2.75e+189: tmp = d * ((1.0 + ((h / l) * (-0.5 * math.pow(((D / d) * (M_m * 0.5)), 2.0)))) / math.sqrt((h * l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.8e+85) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 9.5e-262) tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(D / d) * Float64(M_m / 2.0)) ^ 2.0)))) * sqrt(Float64(Float64(d / h) * Float64(d / l)))); elseif (l <= 2.75e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -1.8e+85)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 9.5e-262)
tmp = (1.0 - (0.5 * ((h / l) * (((D / d) * (M_m / 2.0)) ^ 2.0)))) * sqrt(((d / h) * (d / l)));
elseif (l <= 2.75e+189)
tmp = d * ((1.0 + ((h / l) * (-0.5 * (((D / d) * (M_m * 0.5)) ^ 2.0)))) / sqrt((h * l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.8e+85], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 9.5e-262], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m / 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 2.75e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.8 \cdot 10^{+85}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{-262}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{D}{d} \cdot \frac{M\_m}{2}\right)}^{2}\right)\right) \cdot \sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{elif}\;\ell \leq 2.75 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.7999999999999999e85Initial program 45.7%
Simplified45.8%
Taylor expanded in d around inf 4.7%
pow14.7%
pow1/24.7%
inv-pow4.7%
pow-pow4.7%
metadata-eval4.7%
Applied egg-rr4.7%
unpow14.7%
Simplified4.7%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt46.8%
neg-mul-146.8%
Simplified46.8%
if -1.7999999999999999e85 < l < 9.4999999999999999e-262Initial program 72.4%
Simplified71.4%
pow171.4%
sqrt-unprod59.2%
Applied egg-rr59.2%
unpow159.2%
Simplified59.2%
if 9.4999999999999999e-262 < l < 2.75e189Initial program 65.4%
Simplified64.4%
associate-*r/68.0%
*-commutative68.0%
div-inv68.0%
metadata-eval68.0%
Applied egg-rr68.0%
Applied egg-rr80.7%
unpow180.7%
associate-*l/83.0%
associate-/l*81.0%
Simplified78.0%
fma-undefine78.0%
associate-*r/81.0%
associate-*l/80.0%
*-commutative80.0%
Applied egg-rr80.0%
if 2.75e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification66.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.9e-69)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l -5e-310)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(if (<= l 1.95e+189)
(*
d
(/
(+ 1.0 (* (/ h l) (* -0.5 (pow (* (/ D d) (* M_m 0.5)) 2.0))))
(sqrt (* h l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l)))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.9e-69) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= -5e-310) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else if (l <= 1.95e+189) {
tmp = d * ((1.0 + ((h / l) * (-0.5 * pow(((D / d) * (M_m * 0.5)), 2.0)))) / sqrt((h * l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.9e-69) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= -5e-310) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); elseif (l <= 1.95e+189) tmp = Float64(d * Float64(Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(Float64(D / d) * Float64(M_m * 0.5)) ^ 2.0)))) / sqrt(Float64(h * l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.9e-69], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, -5e-310], N[(d * N[Power[N[(-1.0 + N[(h * l + 1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.95e+189], N[(d * N[(N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(N[(D / d), $MachinePrecision] * N[(M$95$m * 0.5), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(h * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.9 \cdot 10^{-69}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;d \cdot {\left(-1 + \mathsf{fma}\left(h, \ell, 1\right)\right)}^{-0.5}\\
\mathbf{elif}\;\ell \leq 1.95 \cdot 10^{+189}:\\
\;\;\;\;d \cdot \frac{1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(\frac{D}{d} \cdot \left(M\_m \cdot 0.5\right)\right)}^{2}\right)}{\sqrt{h \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.8999999999999999e-69Initial program 55.8%
Simplified55.8%
Taylor expanded in d around inf 4.1%
pow14.1%
pow1/24.1%
inv-pow4.1%
pow-pow4.1%
metadata-eval4.1%
Applied egg-rr4.1%
unpow14.1%
Simplified4.1%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt40.7%
neg-mul-140.7%
Simplified40.7%
if -1.8999999999999999e-69 < l < -4.999999999999985e-310Initial program 72.8%
Simplified71.1%
Taylor expanded in d around inf 24.4%
pow124.4%
pow1/224.4%
inv-pow24.4%
pow-pow22.7%
metadata-eval22.7%
Applied egg-rr22.7%
unpow122.7%
Simplified22.7%
expm1-log1p-u22.7%
expm1-undefine59.4%
Applied egg-rr59.4%
sub-neg59.4%
metadata-eval59.4%
+-commutative59.4%
log1p-undefine59.4%
rem-exp-log59.4%
+-commutative59.4%
fma-define59.4%
Simplified59.4%
if -4.999999999999985e-310 < l < 1.95e189Initial program 66.4%
Simplified65.5%
associate-*r/68.9%
*-commutative68.9%
div-inv68.9%
metadata-eval68.9%
Applied egg-rr68.9%
Applied egg-rr78.1%
unpow178.1%
associate-*l/80.3%
associate-/l*78.4%
Simplified75.6%
fma-undefine75.6%
associate-*r/78.4%
associate-*l/77.5%
*-commutative77.5%
Applied egg-rr77.5%
if 1.95e189 < l Initial program 51.2%
Simplified51.2%
Taylor expanded in d around inf 67.7%
pow167.7%
pow1/267.7%
inv-pow67.7%
pow-pow67.8%
metadata-eval67.8%
Applied egg-rr67.8%
unpow167.8%
Simplified67.8%
Taylor expanded in d around 0 67.7%
associate-/r*67.9%
Simplified67.9%
sqrt-div83.6%
Applied egg-rr83.6%
Final simplification62.7%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.8e-73)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 1.65e-280)
(* d (pow (+ -1.0 (fma h l 1.0)) -0.5))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.8e-73) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 1.65e-280) {
tmp = d * pow((-1.0 + fma(h, l, 1.0)), -0.5);
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.8e-73) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 1.65e-280) tmp = Float64(d * (Float64(-1.0 + fma(h, l, 1.0)) ^ -0.5)); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.8e-73], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 1.65e-280], N[(d * N[Power[N[(-1.0 + N[(h * l + 1.0), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.8 \cdot 10^{-73}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 1.65 \cdot 10^{-280}:\\
\;\;\;\;d \cdot {\left(-1 + \mathsf{fma}\left(h, \ell, 1\right)\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.8e-73Initial program 55.8%
Simplified55.8%
Taylor expanded in d around inf 4.1%
pow14.1%
pow1/24.1%
inv-pow4.1%
pow-pow4.1%
metadata-eval4.1%
Applied egg-rr4.1%
unpow14.1%
Simplified4.1%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt40.7%
neg-mul-140.7%
Simplified40.7%
if -1.8e-73 < l < 1.64999999999999995e-280Initial program 72.5%
Simplified70.8%
Taylor expanded in d around inf 24.9%
pow124.9%
pow1/224.9%
inv-pow24.9%
pow-pow23.2%
metadata-eval23.2%
Applied egg-rr23.2%
unpow123.2%
Simplified23.2%
expm1-log1p-u23.2%
expm1-undefine58.0%
Applied egg-rr58.0%
sub-neg58.0%
metadata-eval58.0%
+-commutative58.0%
log1p-undefine58.0%
rem-exp-log58.1%
+-commutative58.1%
fma-define58.1%
Simplified58.1%
if 1.64999999999999995e-280 < l Initial program 64.1%
Simplified63.3%
Taylor expanded in d around inf 45.6%
pow145.6%
pow1/245.6%
inv-pow45.6%
pow-pow45.6%
metadata-eval45.6%
Applied egg-rr45.6%
unpow145.6%
Simplified45.6%
Taylor expanded in d around 0 45.6%
associate-/r*45.6%
Simplified45.6%
sqrt-div54.3%
Applied egg-rr54.3%
Final simplification50.9%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -1.05e-183)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 7.2e-283)
(- (sqrt (* (/ d h) (/ d l))))
(* d (/ (sqrt (/ 1.0 h)) (sqrt l))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.05e-183) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 7.2e-283) {
tmp = -sqrt(((d / h) * (d / l)));
} else {
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-1.05d-183)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 7.2d-283) then
tmp = -sqrt(((d / h) * (d / l)))
else
tmp = d * (sqrt((1.0d0 / h)) / sqrt(l))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -1.05e-183) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 7.2e-283) {
tmp = -Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * (Math.sqrt((1.0 / h)) / Math.sqrt(l));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -1.05e-183: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 7.2e-283: tmp = -math.sqrt(((d / h) * (d / l))) else: tmp = d * (math.sqrt((1.0 / h)) / math.sqrt(l)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -1.05e-183) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 7.2e-283) tmp = Float64(-sqrt(Float64(Float64(d / h) * Float64(d / l)))); else tmp = Float64(d * Float64(sqrt(Float64(1.0 / h)) / sqrt(l))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -1.05e-183)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 7.2e-283)
tmp = -sqrt(((d / h) * (d / l)));
else
tmp = d * (sqrt((1.0 / h)) / sqrt(l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -1.05e-183], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 7.2e-283], (-N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(d * N[(N[Sqrt[N[(1.0 / h), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -1.05 \cdot 10^{-183}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{-283}:\\
\;\;\;\;-\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \frac{\sqrt{\frac{1}{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if l < -1.0500000000000001e-183Initial program 59.9%
Simplified60.0%
Taylor expanded in d around inf 5.5%
pow15.5%
pow1/25.5%
inv-pow5.5%
pow-pow4.6%
metadata-eval4.6%
Applied egg-rr4.6%
unpow14.6%
Simplified4.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.5%
neg-mul-139.5%
Simplified39.5%
if -1.0500000000000001e-183 < l < 7.1999999999999999e-283Initial program 73.6%
Simplified70.7%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt37.3%
mul-1-neg37.3%
Simplified37.3%
pow137.3%
distribute-rgt-neg-out37.3%
sqrt-unprod45.6%
Applied egg-rr45.6%
unpow145.6%
*-commutative45.6%
Simplified45.6%
if 7.1999999999999999e-283 < l Initial program 63.5%
Simplified62.8%
Taylor expanded in d around inf 46.1%
pow146.1%
pow1/246.1%
inv-pow46.1%
pow-pow46.1%
metadata-eval46.1%
Applied egg-rr46.1%
unpow146.1%
Simplified46.1%
Taylor expanded in d around 0 46.1%
associate-/r*46.1%
Simplified46.1%
sqrt-div54.6%
Applied egg-rr54.6%
Final simplification47.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -6e-184)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 7.2e-283)
(- (sqrt (* (/ d h) (/ d l))))
(* d (* (pow l -0.5) (pow h -0.5))))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -6e-184) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 7.2e-283) {
tmp = -sqrt(((d / h) * (d / l)));
} else {
tmp = d * (pow(l, -0.5) * pow(h, -0.5));
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-6d-184)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 7.2d-283) then
tmp = -sqrt(((d / h) * (d / l)))
else
tmp = d * ((l ** (-0.5d0)) * (h ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -6e-184) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 7.2e-283) {
tmp = -Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * (Math.pow(l, -0.5) * Math.pow(h, -0.5));
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -6e-184: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 7.2e-283: tmp = -math.sqrt(((d / h) * (d / l))) else: tmp = d * (math.pow(l, -0.5) * math.pow(h, -0.5)) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -6e-184) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 7.2e-283) tmp = Float64(-sqrt(Float64(Float64(d / h) * Float64(d / l)))); else tmp = Float64(d * Float64((l ^ -0.5) * (h ^ -0.5))); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -6e-184)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 7.2e-283)
tmp = -sqrt(((d / h) * (d / l)));
else
tmp = d * ((l ^ -0.5) * (h ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -6e-184], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 7.2e-283], (-N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(d * N[(N[Power[l, -0.5], $MachinePrecision] * N[Power[h, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6 \cdot 10^{-184}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 7.2 \cdot 10^{-283}:\\
\;\;\;\;-\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \left({\ell}^{-0.5} \cdot {h}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -5.99999999999999982e-184Initial program 59.9%
Simplified60.0%
Taylor expanded in d around inf 5.5%
pow15.5%
pow1/25.5%
inv-pow5.5%
pow-pow4.6%
metadata-eval4.6%
Applied egg-rr4.6%
unpow14.6%
Simplified4.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.5%
neg-mul-139.5%
Simplified39.5%
if -5.99999999999999982e-184 < l < 7.1999999999999999e-283Initial program 73.6%
Simplified70.7%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt37.3%
mul-1-neg37.3%
Simplified37.3%
pow137.3%
distribute-rgt-neg-out37.3%
sqrt-unprod45.6%
Applied egg-rr45.6%
unpow145.6%
*-commutative45.6%
Simplified45.6%
if 7.1999999999999999e-283 < l Initial program 63.5%
Simplified62.8%
Taylor expanded in d around inf 46.1%
pow146.1%
pow1/246.1%
inv-pow46.1%
pow-pow46.1%
metadata-eval46.1%
Applied egg-rr46.1%
unpow146.1%
Simplified46.1%
*-commutative46.1%
unpow-prod-down54.6%
Applied egg-rr54.6%
Final simplification47.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(if (<= l -4.1e-184)
(* d (- (sqrt (/ (/ 1.0 h) l))))
(if (<= l 1.3e-281)
(- (sqrt (* (/ d h) (/ d l))))
(* d (pow (* h l) -0.5)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.1e-184) {
tmp = d * -sqrt(((1.0 / h) / l));
} else if (l <= 1.3e-281) {
tmp = -sqrt(((d / h) * (d / l)));
} else {
tmp = d * pow((h * l), -0.5);
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: tmp
if (l <= (-4.1d-184)) then
tmp = d * -sqrt(((1.0d0 / h) / l))
else if (l <= 1.3d-281) then
tmp = -sqrt(((d / h) * (d / l)))
else
tmp = d * ((h * l) ** (-0.5d0))
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double tmp;
if (l <= -4.1e-184) {
tmp = d * -Math.sqrt(((1.0 / h) / l));
} else if (l <= 1.3e-281) {
tmp = -Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * Math.pow((h * l), -0.5);
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): tmp = 0 if l <= -4.1e-184: tmp = d * -math.sqrt(((1.0 / h) / l)) elif l <= 1.3e-281: tmp = -math.sqrt(((d / h) * (d / l))) else: tmp = d * math.pow((h * l), -0.5) return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) tmp = 0.0 if (l <= -4.1e-184) tmp = Float64(d * Float64(-sqrt(Float64(Float64(1.0 / h) / l)))); elseif (l <= 1.3e-281) tmp = Float64(-sqrt(Float64(Float64(d / h) * Float64(d / l)))); else tmp = Float64(d * (Float64(h * l) ^ -0.5)); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
tmp = 0.0;
if (l <= -4.1e-184)
tmp = d * -sqrt(((1.0 / h) / l));
elseif (l <= 1.3e-281)
tmp = -sqrt(((d / h) * (d / l)));
else
tmp = d * ((h * l) ^ -0.5);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := If[LessEqual[l, -4.1e-184], N[(d * (-N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[l, 1.3e-281], (-N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -4.1 \cdot 10^{-184}:\\
\;\;\;\;d \cdot \left(-\sqrt{\frac{\frac{1}{h}}{\ell}}\right)\\
\mathbf{elif}\;\ell \leq 1.3 \cdot 10^{-281}:\\
\;\;\;\;-\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot {\left(h \cdot \ell\right)}^{-0.5}\\
\end{array}
\end{array}
if l < -4.1e-184Initial program 59.9%
Simplified60.0%
Taylor expanded in d around inf 5.5%
pow15.5%
pow1/25.5%
inv-pow5.5%
pow-pow4.6%
metadata-eval4.6%
Applied egg-rr4.6%
unpow14.6%
Simplified4.6%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
associate-/r*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt39.5%
neg-mul-139.5%
Simplified39.5%
if -4.1e-184 < l < 1.30000000000000002e-281Initial program 73.6%
Simplified70.7%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt37.3%
mul-1-neg37.3%
Simplified37.3%
pow137.3%
distribute-rgt-neg-out37.3%
sqrt-unprod45.6%
Applied egg-rr45.6%
unpow145.6%
*-commutative45.6%
Simplified45.6%
if 1.30000000000000002e-281 < l Initial program 63.5%
Simplified62.8%
Taylor expanded in d around inf 46.1%
pow146.1%
pow1/246.1%
inv-pow46.1%
pow-pow46.1%
metadata-eval46.1%
Applied egg-rr46.1%
unpow146.1%
Simplified46.1%
Final simplification43.4%
M_m = (fabs.f64 M)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D)
:precision binary64
(let* ((t_0 (pow (* h l) -0.5)))
(if (<= l -2.9e-184)
(* d (- t_0))
(if (<= l 1.45e-282) (- (sqrt (* (/ d h) (/ d l)))) (* d t_0)))))M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = pow((h * l), -0.5);
double tmp;
if (l <= -2.9e-184) {
tmp = d * -t_0;
} else if (l <= 1.45e-282) {
tmp = -sqrt(((d / h) * (d / l)));
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: t_0
real(8) :: tmp
t_0 = (h * l) ** (-0.5d0)
if (l <= (-2.9d-184)) then
tmp = d * -t_0
else if (l <= 1.45d-282) then
tmp = -sqrt(((d / h) * (d / l)))
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.pow((h * l), -0.5);
double tmp;
if (l <= -2.9e-184) {
tmp = d * -t_0;
} else if (l <= 1.45e-282) {
tmp = -Math.sqrt(((d / h) * (d / l)));
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.pow((h * l), -0.5) tmp = 0 if l <= -2.9e-184: tmp = d * -t_0 elif l <= 1.45e-282: tmp = -math.sqrt(((d / h) * (d / l))) else: tmp = d * t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(h * l) ^ -0.5 tmp = 0.0 if (l <= -2.9e-184) tmp = Float64(d * Float64(-t_0)); elseif (l <= 1.45e-282) tmp = Float64(-sqrt(Float64(Float64(d / h) * Float64(d / l)))); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (h * l) ^ -0.5;
tmp = 0.0;
if (l <= -2.9e-184)
tmp = d * -t_0;
elseif (l <= 1.45e-282)
tmp = -sqrt(((d / h) * (d / l)));
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -2.9e-184], N[(d * (-t$95$0)), $MachinePrecision], If[LessEqual[l, 1.45e-282], (-N[Sqrt[N[(N[(d / h), $MachinePrecision] * N[(d / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(d * t$95$0), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -2.9 \cdot 10^{-184}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{elif}\;\ell \leq 1.45 \cdot 10^{-282}:\\
\;\;\;\;-\sqrt{\frac{d}{h} \cdot \frac{d}{\ell}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -2.90000000000000014e-184Initial program 59.9%
Simplified60.0%
Taylor expanded in d around inf 5.5%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt38.1%
*-commutative38.1%
associate-*r*38.1%
unpow1/238.1%
rem-exp-log36.2%
exp-neg36.2%
exp-prod36.2%
distribute-lft-neg-out36.2%
distribute-rgt-neg-in36.2%
metadata-eval36.2%
exp-to-pow38.1%
neg-mul-138.1%
Simplified38.1%
if -2.90000000000000014e-184 < l < 1.44999999999999999e-282Initial program 73.6%
Simplified70.7%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt37.3%
mul-1-neg37.3%
Simplified37.3%
pow137.3%
distribute-rgt-neg-out37.3%
sqrt-unprod45.6%
Applied egg-rr45.6%
unpow145.6%
*-commutative45.6%
Simplified45.6%
if 1.44999999999999999e-282 < l Initial program 63.5%
Simplified62.8%
Taylor expanded in d around inf 46.1%
pow146.1%
pow1/246.1%
inv-pow46.1%
pow-pow46.1%
metadata-eval46.1%
Applied egg-rr46.1%
unpow146.1%
Simplified46.1%
Final simplification42.8%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (let* ((t_0 (pow (* h l) -0.5))) (if (<= l -1.6e-184) (* d (- t_0)) (* d t_0))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
double t_0 = pow((h * l), -0.5);
double tmp;
if (l <= -1.6e-184) {
tmp = d * -t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
real(8) :: t_0
real(8) :: tmp
t_0 = (h * l) ** (-0.5d0)
if (l <= (-1.6d-184)) then
tmp = d * -t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
double t_0 = Math.pow((h * l), -0.5);
double tmp;
if (l <= -1.6e-184) {
tmp = d * -t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): t_0 = math.pow((h * l), -0.5) tmp = 0 if l <= -1.6e-184: tmp = d * -t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) t_0 = Float64(h * l) ^ -0.5 tmp = 0.0 if (l <= -1.6e-184) tmp = Float64(d * Float64(-t_0)); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp_2 = code(d, h, l, M_m, D)
t_0 = (h * l) ^ -0.5;
tmp = 0.0;
if (l <= -1.6e-184)
tmp = d * -t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D_] := Block[{t$95$0 = N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]}, If[LessEqual[l, -1.6e-184], N[(d * (-t$95$0)), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
\begin{array}{l}
t_0 := {\left(h \cdot \ell\right)}^{-0.5}\\
\mathbf{if}\;\ell \leq -1.6 \cdot 10^{-184}:\\
\;\;\;\;d \cdot \left(-t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -1.6e-184Initial program 59.9%
Simplified60.0%
Taylor expanded in d around inf 5.5%
Taylor expanded in h around -inf 0.0%
associate-*l*0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt38.1%
*-commutative38.1%
associate-*r*38.1%
unpow1/238.1%
rem-exp-log36.2%
exp-neg36.2%
exp-prod36.2%
distribute-lft-neg-out36.2%
distribute-rgt-neg-in36.2%
metadata-eval36.2%
exp-to-pow38.1%
neg-mul-138.1%
Simplified38.1%
if -1.6e-184 < l Initial program 65.8%
Simplified64.5%
Taylor expanded in d around inf 43.0%
pow143.0%
pow1/243.0%
inv-pow43.0%
pow-pow43.0%
metadata-eval43.0%
Applied egg-rr43.0%
unpow143.0%
Simplified43.0%
Final simplification41.1%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* d (sqrt (/ 1.0 (* h l)))))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * sqrt((1.0 / (h * l)));
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
code = d * sqrt((1.0d0 / (h * l)))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.sqrt((1.0 / (h * l)));
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.sqrt((1.0 / (h * l)))
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * sqrt(Float64(1.0 / Float64(h * l)))) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * sqrt((1.0 / (h * l)));
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Sqrt[N[(1.0 / N[(h * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d \cdot \sqrt{\frac{1}{h \cdot \ell}}
\end{array}
Initial program 63.4%
Simplified62.7%
Taylor expanded in d around inf 28.1%
M_m = (fabs.f64 M) NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. (FPCore (d h l M_m D) :precision binary64 (* d (pow (* h l) -0.5)))
M_m = fabs(M);
assert(d < h && h < l && l < M_m && M_m < D);
double code(double d, double h, double l, double M_m, double D) {
return d * pow((h * l), -0.5);
}
M_m = abs(m)
NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_1)
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_1
code = d * ((h * l) ** (-0.5d0))
end function
M_m = Math.abs(M);
assert d < h && h < l && l < M_m && M_m < D;
public static double code(double d, double h, double l, double M_m, double D) {
return d * Math.pow((h * l), -0.5);
}
M_m = math.fabs(M) [d, h, l, M_m, D] = sort([d, h, l, M_m, D]) def code(d, h, l, M_m, D): return d * math.pow((h * l), -0.5)
M_m = abs(M) d, h, l, M_m, D = sort([d, h, l, M_m, D]) function code(d, h, l, M_m, D) return Float64(d * (Float64(h * l) ^ -0.5)) end
M_m = abs(M);
d, h, l, M_m, D = num2cell(sort([d, h, l, M_m, D])){:}
function tmp = code(d, h, l, M_m, D)
tmp = d * ((h * l) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] NOTE: d, h, l, M_m, and D should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D_] := N[(d * N[Power[N[(h * l), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
[d, h, l, M_m, D] = \mathsf{sort}([d, h, l, M_m, D])\\
\\
d \cdot {\left(h \cdot \ell\right)}^{-0.5}
\end{array}
Initial program 63.4%
Simplified62.7%
Taylor expanded in d around inf 28.1%
pow128.1%
pow1/228.1%
inv-pow28.1%
pow-pow27.7%
metadata-eval27.7%
Applied egg-rr27.7%
unpow127.7%
Simplified27.7%
herbie shell --seed 2024157
(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)))))