
(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 24 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (d h l M D) :precision binary64 (* (* (pow (/ d h) (/ 1.0 2.0)) (pow (/ d l) (/ 1.0 2.0))) (- 1.0 (* (* (/ 1.0 2.0) (pow (/ (* M D) (* 2.0 d)) 2.0)) (/ h l)))))
double code(double d, double h, double l, double M, double D) {
return (pow((d / h), (1.0 / 2.0)) * pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
real(8) function code(d, h, l, m, d_1)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m
real(8), intent (in) :: d_1
code = (((d / h) ** (1.0d0 / 2.0d0)) * ((d / l) ** (1.0d0 / 2.0d0))) * (1.0d0 - (((1.0d0 / 2.0d0) * (((m * d_1) / (2.0d0 * d)) ** 2.0d0)) * (h / l)))
end function
public static double code(double d, double h, double l, double M, double D) {
return (Math.pow((d / h), (1.0 / 2.0)) * Math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * Math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)));
}
def code(d, h, l, M, D): return (math.pow((d / h), (1.0 / 2.0)) * math.pow((d / l), (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * math.pow(((M * D) / (2.0 * d)), 2.0)) * (h / l)))
function code(d, h, l, M, D) return Float64(Float64((Float64(d / h) ^ Float64(1.0 / 2.0)) * (Float64(d / l) ^ Float64(1.0 / 2.0))) * Float64(1.0 - Float64(Float64(Float64(1.0 / 2.0) * (Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0)) * Float64(h / l)))) end
function tmp = code(d, h, l, M, D) tmp = (((d / h) ^ (1.0 / 2.0)) * ((d / l) ^ (1.0 / 2.0))) * (1.0 - (((1.0 / 2.0) * (((M * D) / (2.0 * d)) ^ 2.0)) * (h / l))); end
code[d_, h_, l_, M_, D_] := N[(N[(N[Power[N[(d / h), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], N[(1.0 / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(N[(1.0 / 2.0), $MachinePrecision] * N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(\frac{d}{h}\right)}^{\left(\frac{1}{2}\right)} \cdot {\left(\frac{d}{\ell}\right)}^{\left(\frac{1}{2}\right)}\right) \cdot \left(1 - \left(\frac{1}{2} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right) \cdot \frac{h}{\ell}\right)
\end{array}
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l))))
(if (<= l -5e-310)
(* (sqrt (/ d l)) (* (/ (sqrt (- d)) (sqrt (- h))) t_0))
(* (/ (sqrt d) (sqrt l)) (* t_0 (/ (sqrt d) (sqrt h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double tmp;
if (l <= -5e-310) {
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * t_0);
} else {
tmp = (sqrt(d) / sqrt(l)) * (t_0 * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)
if (l <= (-5d-310)) then
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * t_0)
else
tmp = (sqrt(d) / sqrt(l)) * (t_0 * (sqrt(d) / sqrt(h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double tmp;
if (l <= -5e-310) {
tmp = Math.sqrt((d / l)) * ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0);
} else {
tmp = (Math.sqrt(d) / Math.sqrt(l)) * (t_0 * (Math.sqrt(d) / Math.sqrt(h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l) tmp = 0 if l <= -5e-310: tmp = math.sqrt((d / l)) * ((math.sqrt(-d) / math.sqrt(-h)) * t_0) else: tmp = (math.sqrt(d) / math.sqrt(l)) * (t_0 * (math.sqrt(d) / math.sqrt(h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) tmp = 0.0 if (l <= -5e-310) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0)); else tmp = Float64(Float64(sqrt(d) / sqrt(l)) * Float64(t_0 * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l);
tmp = 0.0;
if (l <= -5e-310)
tmp = sqrt((d / l)) * ((sqrt(-d) / sqrt(-h)) * t_0);
else
tmp = (sqrt(d) / sqrt(l)) * (t_0 * (sqrt(d) / sqrt(h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -5e-310], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{d}}{\sqrt{\ell}} \cdot \left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 71.3%
Simplified71.2%
associate-*l/72.1%
*-commutative72.1%
associate-/l/72.1%
Applied egg-rr72.1%
associate-*r*72.1%
*-commutative72.1%
Simplified72.1%
frac-2neg72.1%
sqrt-div83.8%
Applied egg-rr83.8%
if -4.999999999999985e-310 < l Initial program 67.0%
Simplified66.2%
associate-*l/68.4%
*-commutative68.4%
associate-/l/68.4%
Applied egg-rr68.4%
associate-*r*68.4%
*-commutative68.4%
Simplified68.4%
sqrt-div78.9%
Applied egg-rr78.9%
sqrt-div85.4%
Applied egg-rr85.4%
Final simplification84.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<=
(*
(* (pow (/ d h) 0.5) (pow (/ d l) 0.5))
(- 1.0 (* (/ h l) (* 0.5 (pow (/ (* D_m M_m) (* d 2.0)) 2.0)))))
INFINITY)
(*
(sqrt (/ d l))
(*
(sqrt (/ d h))
(+ 1.0 (* (/ h l) (* -0.5 (pow (* D_m (* M_m (/ 0.5 d))) 2.0))))))
(* (* (fabs (/ (pow (* D_m M_m) 2.0) d)) (sqrt (/ h (pow l 3.0)))) -0.125)))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((pow((d / h), 0.5) * pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * pow(((D_m * M_m) / (d * 2.0)), 2.0))))) <= ((double) INFINITY)) {
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * pow((D_m * (M_m * (0.5 / d))), 2.0)))));
} else {
tmp = (fabs((pow((D_m * M_m), 2.0) / d)) * sqrt((h / pow(l, 3.0)))) * -0.125;
}
return tmp;
}
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (((Math.pow((d / h), 0.5) * Math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * Math.pow(((D_m * M_m) / (d * 2.0)), 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((d / l)) * (Math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * Math.pow((D_m * (M_m * (0.5 / d))), 2.0)))));
} else {
tmp = (Math.abs((Math.pow((D_m * M_m), 2.0) / d)) * Math.sqrt((h / Math.pow(l, 3.0)))) * -0.125;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if ((math.pow((d / h), 0.5) * math.pow((d / l), 0.5)) * (1.0 - ((h / l) * (0.5 * math.pow(((D_m * M_m) / (d * 2.0)), 2.0))))) <= math.inf: tmp = math.sqrt((d / l)) * (math.sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * math.pow((D_m * (M_m * (0.5 / d))), 2.0))))) else: tmp = (math.fabs((math.pow((D_m * M_m), 2.0) / d)) * math.sqrt((h / math.pow(l, 3.0)))) * -0.125 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (Float64(Float64((Float64(d / h) ^ 0.5) * (Float64(d / l) ^ 0.5)) * Float64(1.0 - Float64(Float64(h / l) * Float64(0.5 * (Float64(Float64(D_m * M_m) / Float64(d * 2.0)) ^ 2.0))))) <= Inf) tmp = Float64(sqrt(Float64(d / l)) * Float64(sqrt(Float64(d / h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(D_m * Float64(M_m * Float64(0.5 / d))) ^ 2.0)))))); else tmp = Float64(Float64(abs(Float64((Float64(D_m * M_m) ^ 2.0) / d)) * sqrt(Float64(h / (l ^ 3.0)))) * -0.125); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (((((d / h) ^ 0.5) * ((d / l) ^ 0.5)) * (1.0 - ((h / l) * (0.5 * (((D_m * M_m) / (d * 2.0)) ^ 2.0))))) <= Inf)
tmp = sqrt((d / l)) * (sqrt((d / h)) * (1.0 + ((h / l) * (-0.5 * ((D_m * (M_m * (0.5 / d))) ^ 2.0)))));
else
tmp = (abs((((D_m * M_m) ^ 2.0) / d)) * sqrt((h / (l ^ 3.0)))) * -0.125;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[N[(N[(N[Power[N[(d / h), $MachinePrecision], 0.5], $MachinePrecision] * N[Power[N[(d / l), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(N[(h / l), $MachinePrecision] * N[(0.5 * N[Power[N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D$95$m * N[(M$95$m * N[(0.5 / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Abs[N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] / d), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\left({\left(\frac{d}{h}\right)}^{0.5} \cdot {\left(\frac{d}{\ell}\right)}^{0.5}\right) \cdot \left(1 - \frac{h}{\ell} \cdot \left(0.5 \cdot {\left(\frac{D\_m \cdot M\_m}{d \cdot 2}\right)}^{2}\right)\right) \leq \infty:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\sqrt{\frac{d}{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(D\_m \cdot \left(M\_m \cdot \frac{0.5}{d}\right)\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left|\frac{{\left(D\_m \cdot M\_m\right)}^{2}}{d}\right| \cdot \sqrt{\frac{h}{{\ell}^{3}}}\right) \cdot -0.125\\
\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)))) < +inf.0Initial program 81.7%
Simplified81.3%
Taylor expanded in D around 0 81.7%
associate-*r/81.7%
*-commutative81.7%
associate-*r*81.7%
*-commutative81.7%
*-commutative81.7%
associate-/l*81.3%
associate-/l*81.3%
Simplified81.3%
if +inf.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)))) Initial program 0.0%
Simplified0.0%
add-cube-cbrt0.0%
pow30.0%
sqrt-unprod0.0%
Applied egg-rr0.0%
Taylor expanded in d around 0 13.4%
*-commutative13.4%
associate-/l*10.8%
Simplified10.8%
add-sqr-sqrt10.6%
sqrt-unprod18.5%
pow218.5%
associate-*r/21.2%
pow-prod-down31.7%
Applied egg-rr31.7%
unpow231.7%
rem-sqrt-square31.8%
Simplified31.8%
Final simplification73.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l)))
(t_1 (sqrt (/ d l))))
(if (<= h -1.9e+293)
(* (* (fabs (/ (pow (* D_m M_m) 2.0) d)) (sqrt (/ h (pow l 3.0)))) -0.125)
(if (<= h -1.5e-182)
(* t_1 (* t_0 (sqrt (/ d h))))
(if (<= h -2e-310)
(*
(* d (sqrt (/ 1.0 (* l h))))
(+ -1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(* t_1 (* t_0 (/ (sqrt d) (sqrt h)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double t_1 = sqrt((d / l));
double tmp;
if (h <= -1.9e+293) {
tmp = (fabs((pow((D_m * M_m), 2.0) / d)) * sqrt((h / pow(l, 3.0)))) * -0.125;
} else if (h <= -1.5e-182) {
tmp = t_1 * (t_0 * sqrt((d / h)));
} else if (h <= -2e-310) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0))));
} else {
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)
t_1 = sqrt((d / l))
if (h <= (-1.9d+293)) then
tmp = (abs((((d_m * m_m) ** 2.0d0) / d)) * sqrt((h / (l ** 3.0d0)))) * (-0.125d0)
else if (h <= (-1.5d-182)) then
tmp = t_1 * (t_0 * sqrt((d / h)))
else if (h <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + (0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))))
else
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double t_1 = Math.sqrt((d / l));
double tmp;
if (h <= -1.9e+293) {
tmp = (Math.abs((Math.pow((D_m * M_m), 2.0) / d)) * Math.sqrt((h / Math.pow(l, 3.0)))) * -0.125;
} else if (h <= -1.5e-182) {
tmp = t_1 * (t_0 * Math.sqrt((d / h)));
} else if (h <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + (0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0))));
} else {
tmp = t_1 * (t_0 * (Math.sqrt(d) / Math.sqrt(h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l) t_1 = math.sqrt((d / l)) tmp = 0 if h <= -1.9e+293: tmp = (math.fabs((math.pow((D_m * M_m), 2.0) / d)) * math.sqrt((h / math.pow(l, 3.0)))) * -0.125 elif h <= -1.5e-182: tmp = t_1 * (t_0 * math.sqrt((d / h))) elif h <= -2e-310: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + (0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)))) else: tmp = t_1 * (t_0 * (math.sqrt(d) / math.sqrt(h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (h <= -1.9e+293) tmp = Float64(Float64(abs(Float64((Float64(D_m * M_m) ^ 2.0) / d)) * sqrt(Float64(h / (l ^ 3.0)))) * -0.125); elseif (h <= -1.5e-182) tmp = Float64(t_1 * Float64(t_0 * sqrt(Float64(d / h)))); elseif (h <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))))); else tmp = Float64(t_1 * Float64(t_0 * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l);
t_1 = sqrt((d / l));
tmp = 0.0;
if (h <= -1.9e+293)
tmp = (abs((((D_m * M_m) ^ 2.0) / d)) * sqrt((h / (l ^ 3.0)))) * -0.125;
elseif (h <= -1.5e-182)
tmp = t_1 * (t_0 * sqrt((d / h)));
elseif (h <= -2e-310)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + (0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0))));
else
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[h, -1.9e+293], N[(N[(N[Abs[N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] / d), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision], If[LessEqual[h, -1.5e-182], N[(t$95$1 * N[(t$95$0 * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;h \leq -1.9 \cdot 10^{+293}:\\
\;\;\;\;\left(\left|\frac{{\left(D\_m \cdot M\_m\right)}^{2}}{d}\right| \cdot \sqrt{\frac{h}{{\ell}^{3}}}\right) \cdot -0.125\\
\mathbf{elif}\;h \leq -1.5 \cdot 10^{-182}:\\
\;\;\;\;t\_1 \cdot \left(t\_0 \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{elif}\;h \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if h < -1.90000000000000007e293Initial program 13.0%
Simplified13.0%
add-cube-cbrt13.0%
pow313.0%
sqrt-unprod13.0%
Applied egg-rr13.0%
Taylor expanded in d around 0 13.0%
*-commutative13.0%
associate-/l*13.0%
Simplified13.0%
add-sqr-sqrt13.0%
sqrt-unprod73.0%
pow273.0%
associate-*r/73.0%
pow-prod-down93.0%
Applied egg-rr93.0%
unpow293.0%
rem-sqrt-square93.0%
Simplified93.0%
if -1.90000000000000007e293 < h < -1.5000000000000001e-182Initial program 79.0%
Simplified79.0%
associate-*l/80.1%
*-commutative80.1%
associate-/l/80.1%
Applied egg-rr80.1%
associate-*r*80.1%
*-commutative80.1%
Simplified80.1%
if -1.5000000000000001e-182 < h < -1.999999999999994e-310Initial program 56.9%
Simplified56.7%
pow156.7%
sqrt-unprod54.0%
Applied egg-rr54.0%
unpow154.0%
associate-*l/41.7%
associate-*r/35.8%
unpow235.8%
Simplified35.8%
Taylor expanded in d around -inf 76.4%
if -1.999999999999994e-310 < h Initial program 67.0%
Simplified66.2%
associate-*l/68.4%
*-commutative68.4%
associate-/l/68.4%
Applied egg-rr68.4%
associate-*r*68.4%
*-commutative68.4%
Simplified68.4%
sqrt-div78.9%
Applied egg-rr78.9%
Final simplification79.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l)))
(t_1 (sqrt (/ d l))))
(if (<= l -5e-310)
(* t_1 (* (/ (sqrt (- d)) (sqrt (- h))) t_0))
(* t_1 (* t_0 (/ (sqrt d) (sqrt h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double t_1 = sqrt((d / l));
double tmp;
if (l <= -5e-310) {
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
} else {
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)
t_1 = sqrt((d / l))
if (l <= (-5d-310)) then
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0)
else
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l);
double t_1 = Math.sqrt((d / l));
double tmp;
if (l <= -5e-310) {
tmp = t_1 * ((Math.sqrt(-d) / Math.sqrt(-h)) * t_0);
} else {
tmp = t_1 * (t_0 * (Math.sqrt(d) / Math.sqrt(h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l) t_1 = math.sqrt((d / l)) tmp = 0 if l <= -5e-310: tmp = t_1 * ((math.sqrt(-d) / math.sqrt(-h)) * t_0) else: tmp = t_1 * (t_0 * (math.sqrt(d) / math.sqrt(h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) t_1 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -5e-310) tmp = Float64(t_1 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * t_0)); else tmp = Float64(t_1 * Float64(t_0 * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l);
t_1 = sqrt((d / l));
tmp = 0.0;
if (l <= -5e-310)
tmp = t_1 * ((sqrt(-d) / sqrt(-h)) * t_0);
else
tmp = t_1 * (t_0 * (sqrt(d) / sqrt(h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -5e-310], N[(t$95$1 * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(t$95$0 * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\\
t_1 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -5 \cdot 10^{-310}:\\
\;\;\;\;t\_1 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(t\_0 \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if l < -4.999999999999985e-310Initial program 71.3%
Simplified71.2%
associate-*l/72.1%
*-commutative72.1%
associate-/l/72.1%
Applied egg-rr72.1%
associate-*r*72.1%
*-commutative72.1%
Simplified72.1%
frac-2neg72.1%
sqrt-div83.8%
Applied egg-rr83.8%
if -4.999999999999985e-310 < l Initial program 67.0%
Simplified66.2%
associate-*l/68.4%
*-commutative68.4%
associate-/l/68.4%
Applied egg-rr68.4%
associate-*r*68.4%
*-commutative68.4%
Simplified68.4%
sqrt-div78.9%
Applied egg-rr78.9%
Final simplification81.5%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l -1.95e-308)
(*
t_0
(*
(/ (sqrt (- d)) (sqrt (- h)))
(+ 1.0 (* (/ h l) (* -0.5 (pow (* D_m (/ (/ M_m 2.0) d)) 2.0))))))
(*
t_0
(*
(+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l))
(/ (sqrt d) (sqrt h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= -1.95e-308) {
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * pow((D_m * ((M_m / 2.0) / d)), 2.0)))));
} else {
tmp = t_0 * ((1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * (sqrt(d) / sqrt(h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (l <= (-1.95d-308)) then
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0d0 + ((h / l) * ((-0.5d0) * ((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0)))))
else
tmp = t_0 * ((1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)) * (sqrt(d) / sqrt(h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (l <= -1.95e-308) {
tmp = t_0 * ((Math.sqrt(-d) / Math.sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * Math.pow((D_m * ((M_m / 2.0) / d)), 2.0)))));
} else {
tmp = t_0 * ((1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * (Math.sqrt(d) / Math.sqrt(h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) tmp = 0 if l <= -1.95e-308: tmp = t_0 * ((math.sqrt(-d) / math.sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * math.pow((D_m * ((M_m / 2.0) / d)), 2.0))))) else: tmp = t_0 * ((1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * (math.sqrt(d) / math.sqrt(h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= -1.95e-308) tmp = Float64(t_0 * Float64(Float64(sqrt(Float64(-d)) / sqrt(Float64(-h))) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0)))))); else tmp = Float64(t_0 * Float64(Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) * Float64(sqrt(d) / sqrt(h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
tmp = 0.0;
if (l <= -1.95e-308)
tmp = t_0 * ((sqrt(-d) / sqrt(-h)) * (1.0 + ((h / l) * (-0.5 * ((D_m * ((M_m / 2.0) / d)) ^ 2.0)))));
else
tmp = t_0 * ((1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l)) * (sqrt(d) / sqrt(h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -1.95e-308], N[(t$95$0 * N[(N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-h)], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq -1.95 \cdot 10^{-308}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{-d}}{\sqrt{-h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\left(1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\right) \cdot \frac{\sqrt{d}}{\sqrt{h}}\right)\\
\end{array}
\end{array}
if l < -1.95e-308Initial program 71.8%
Simplified71.8%
frac-2neg72.6%
sqrt-div84.4%
Applied egg-rr82.9%
if -1.95e-308 < l Initial program 66.4%
Simplified65.6%
associate-*l/67.8%
*-commutative67.8%
associate-/l/67.8%
Applied egg-rr67.8%
associate-*r*67.8%
*-commutative67.8%
Simplified67.8%
sqrt-div78.2%
Applied egg-rr78.2%
Final simplification80.7%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (sqrt (/ d l))))
(if (<= l 1.55e-97)
(*
t_0
(*
(+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l))
(sqrt (/ d h))))
(*
t_0
(*
(/ (sqrt d) (sqrt h))
(+ 1.0 (* (/ h l) (* -0.5 (pow (* D_m (/ (/ M_m 2.0) d)) 2.0)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt((d / l));
double tmp;
if (l <= 1.55e-97) {
tmp = t_0 * ((1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * sqrt((d / h)));
} else {
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * (-0.5 * pow((D_m * ((M_m / 2.0) / d)), 2.0)))));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((d / l))
if (l <= 1.55d-97) then
tmp = t_0 * ((1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)) * sqrt((d / h)))
else
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0d0 + ((h / l) * ((-0.5d0) * ((d_m * ((m_m / 2.0d0) / d)) ** 2.0d0)))))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt((d / l));
double tmp;
if (l <= 1.55e-97) {
tmp = t_0 * ((1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * Math.sqrt((d / h)));
} else {
tmp = t_0 * ((Math.sqrt(d) / Math.sqrt(h)) * (1.0 + ((h / l) * (-0.5 * Math.pow((D_m * ((M_m / 2.0) / d)), 2.0)))));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt((d / l)) tmp = 0 if l <= 1.55e-97: tmp = t_0 * ((1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * math.sqrt((d / h))) else: tmp = t_0 * ((math.sqrt(d) / math.sqrt(h)) * (1.0 + ((h / l) * (-0.5 * math.pow((D_m * ((M_m / 2.0) / d)), 2.0))))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(d / l)) tmp = 0.0 if (l <= 1.55e-97) tmp = Float64(t_0 * Float64(Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) * sqrt(Float64(d / h)))); else tmp = Float64(t_0 * Float64(Float64(sqrt(d) / sqrt(h)) * Float64(1.0 + Float64(Float64(h / l) * Float64(-0.5 * (Float64(D_m * Float64(Float64(M_m / 2.0) / d)) ^ 2.0)))))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt((d / l));
tmp = 0.0;
if (l <= 1.55e-97)
tmp = t_0 * ((1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l)) * sqrt((d / h)));
else
tmp = t_0 * ((sqrt(d) / sqrt(h)) * (1.0 + ((h / l) * (-0.5 * ((D_m * ((M_m / 2.0) / d)) ^ 2.0)))));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, 1.55e-97], N[(t$95$0 * N[(N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(N[(N[Sqrt[d], $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(h / l), $MachinePrecision] * N[(-0.5 * N[Power[N[(D$95$m * N[(N[(M$95$m / 2.0), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{d}{\ell}}\\
\mathbf{if}\;\ell \leq 1.55 \cdot 10^{-97}:\\
\;\;\;\;t\_0 \cdot \left(\left(1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\frac{\sqrt{d}}{\sqrt{h}} \cdot \left(1 + \frac{h}{\ell} \cdot \left(-0.5 \cdot {\left(D\_m \cdot \frac{\frac{M\_m}{2}}{d}\right)}^{2}\right)\right)\right)\\
\end{array}
\end{array}
if l < 1.55000000000000001e-97Initial program 73.7%
Simplified73.2%
associate-*l/75.3%
*-commutative75.3%
associate-/l/75.3%
Applied egg-rr75.3%
associate-*r*75.3%
*-commutative75.3%
Simplified75.3%
if 1.55000000000000001e-97 < l Initial program 58.7%
Simplified58.7%
sqrt-div74.0%
Applied egg-rr73.9%
Final simplification74.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0))))
(t_1
(*
(sqrt (/ d h))
(*
(sqrt (/ d l))
(- 1.0 (* h (* 0.125 (/ (pow (* M_m (/ D_m d)) 2.0) l))))))))
(if (<= h -2.2e+125)
t_1
(if (<= h -2e-310)
(* (* d (sqrt (/ 1.0 (* l h)))) (+ -1.0 t_0))
(if (<= h 1.55e+109)
(* (- 1.0 t_0) (* d (sqrt (/ (/ 1.0 l) h))))
(if (<= h 3.8e+192)
t_1
(/
(* (pow (* D_m M_m) 2.0) (/ (* (sqrt h) -0.125) (pow l 1.5)))
d)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0));
double t_1 = sqrt((d / h)) * (sqrt((d / l)) * (1.0 - (h * (0.125 * (pow((M_m * (D_m / d)), 2.0) / l)))));
double tmp;
if (h <= -2.2e+125) {
tmp = t_1;
} else if (h <= -2e-310) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (h <= 1.55e+109) {
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
} else if (h <= 3.8e+192) {
tmp = t_1;
} else {
tmp = (pow((D_m * M_m), 2.0) * ((sqrt(h) * -0.125) / pow(l, 1.5))) / d;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))
t_1 = sqrt((d / h)) * (sqrt((d / l)) * (1.0d0 - (h * (0.125d0 * (((m_m * (d_m / d)) ** 2.0d0) / l)))))
if (h <= (-2.2d+125)) then
tmp = t_1
else if (h <= (-2d-310)) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + t_0)
else if (h <= 1.55d+109) then
tmp = (1.0d0 - t_0) * (d * sqrt(((1.0d0 / l) / h)))
else if (h <= 3.8d+192) then
tmp = t_1
else
tmp = (((d_m * m_m) ** 2.0d0) * ((sqrt(h) * (-0.125d0)) / (l ** 1.5d0))) / d
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0));
double t_1 = Math.sqrt((d / h)) * (Math.sqrt((d / l)) * (1.0 - (h * (0.125 * (Math.pow((M_m * (D_m / d)), 2.0) / l)))));
double tmp;
if (h <= -2.2e+125) {
tmp = t_1;
} else if (h <= -2e-310) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (h <= 1.55e+109) {
tmp = (1.0 - t_0) * (d * Math.sqrt(((1.0 / l) / h)));
} else if (h <= 3.8e+192) {
tmp = t_1;
} else {
tmp = (Math.pow((D_m * M_m), 2.0) * ((Math.sqrt(h) * -0.125) / Math.pow(l, 1.5))) / d;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)) t_1 = math.sqrt((d / h)) * (math.sqrt((d / l)) * (1.0 - (h * (0.125 * (math.pow((M_m * (D_m / d)), 2.0) / l))))) tmp = 0 if h <= -2.2e+125: tmp = t_1 elif h <= -2e-310: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0) elif h <= 1.55e+109: tmp = (1.0 - t_0) * (d * math.sqrt(((1.0 / l) / h))) elif h <= 3.8e+192: tmp = t_1 else: tmp = (math.pow((D_m * M_m), 2.0) * ((math.sqrt(h) * -0.125) / math.pow(l, 1.5))) / d return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))) t_1 = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(d / l)) * Float64(1.0 - Float64(h * Float64(0.125 * Float64((Float64(M_m * Float64(D_m / d)) ^ 2.0) / l)))))) tmp = 0.0 if (h <= -2.2e+125) tmp = t_1; elseif (h <= -2e-310) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + t_0)); elseif (h <= 1.55e+109) tmp = Float64(Float64(1.0 - t_0) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); elseif (h <= 3.8e+192) tmp = t_1; else tmp = Float64(Float64((Float64(D_m * M_m) ^ 2.0) * Float64(Float64(sqrt(h) * -0.125) / (l ^ 1.5))) / d); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0));
t_1 = sqrt((d / h)) * (sqrt((d / l)) * (1.0 - (h * (0.125 * (((M_m * (D_m / d)) ^ 2.0) / l)))));
tmp = 0.0;
if (h <= -2.2e+125)
tmp = t_1;
elseif (h <= -2e-310)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
elseif (h <= 1.55e+109)
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
elseif (h <= 3.8e+192)
tmp = t_1;
else
tmp = (((D_m * M_m) ^ 2.0) * ((sqrt(h) * -0.125) / (l ^ 1.5))) / d;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(h * N[(0.125 * N[(N[Power[N[(M$95$m * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[h, -2.2e+125], t$95$1, If[LessEqual[h, -2e-310], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 1.55e+109], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[h, 3.8e+192], t$95$1, N[(N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(N[Sqrt[h], $MachinePrecision] * -0.125), $MachinePrecision] / N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]]]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
t_1 := \sqrt{\frac{d}{h}} \cdot \left(\sqrt{\frac{d}{\ell}} \cdot \left(1 - h \cdot \left(0.125 \cdot \frac{{\left(M\_m \cdot \frac{D\_m}{d}\right)}^{2}}{\ell}\right)\right)\right)\\
\mathbf{if}\;h \leq -2.2 \cdot 10^{+125}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;h \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + t\_0\right)\\
\mathbf{elif}\;h \leq 1.55 \cdot 10^{+109}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\mathbf{elif}\;h \leq 3.8 \cdot 10^{+192}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(D\_m \cdot M\_m\right)}^{2} \cdot \frac{\sqrt{h} \cdot -0.125}{{\ell}^{1.5}}}{d}\\
\end{array}
\end{array}
if h < -2.19999999999999991e125 or 1.54999999999999996e109 < h < 3.7999999999999999e192Initial program 66.4%
Simplified66.4%
Taylor expanded in h around -inf 53.6%
associate-*r*53.6%
neg-mul-153.6%
sub-neg53.6%
distribute-lft-in53.6%
Simplified72.2%
if -2.19999999999999991e125 < h < -1.999999999999994e-310Initial program 71.3%
Simplified70.3%
pow170.3%
sqrt-unprod61.4%
Applied egg-rr61.4%
unpow161.4%
associate-*l/54.3%
associate-*r/43.0%
unpow243.0%
Simplified43.0%
Taylor expanded in d around -inf 78.8%
if -1.999999999999994e-310 < h < 1.54999999999999996e109Initial program 76.5%
Simplified75.4%
pow175.4%
sqrt-unprod68.0%
Applied egg-rr68.0%
unpow168.0%
associate-*l/66.8%
associate-*r/53.9%
unpow253.9%
Simplified53.9%
Taylor expanded in d around 0 81.2%
associate-/r*82.3%
associate-/l/81.2%
associate-/r*82.3%
Simplified82.3%
if 3.7999999999999999e192 < h Initial program 37.7%
Simplified37.6%
add-cube-cbrt37.3%
pow337.3%
sqrt-unprod37.3%
Applied egg-rr37.3%
Taylor expanded in d around 0 22.8%
*-commutative22.8%
associate-/l*24.1%
Simplified24.1%
associate-*l*24.1%
associate-*r/22.8%
associate-*l/22.8%
pow-prod-down54.4%
sqrt-div64.0%
associate-*l/64.0%
sqrt-pow179.0%
metadata-eval79.0%
Applied egg-rr79.0%
Final simplification78.3%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0
(*
(+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l))
(sqrt (/ d h)))))
(if (<= d 3.2e-308)
(* (sqrt (/ d l)) t_0)
(if (<= d 1.8e-159)
(* -0.125 (/ (* (sqrt h) (pow (* D_m M_m) 2.0)) (* d (pow l 1.5))))
(if (<= d 3.7e+155)
(* t_0 (pow (/ l d) -0.5))
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0))))
(* d (sqrt (/ (/ 1.0 l) h)))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * sqrt((d / h));
double tmp;
if (d <= 3.2e-308) {
tmp = sqrt((d / l)) * t_0;
} else if (d <= 1.8e-159) {
tmp = -0.125 * ((sqrt(h) * pow((D_m * M_m), 2.0)) / (d * pow(l, 1.5)));
} else if (d <= 3.7e+155) {
tmp = t_0 * pow((l / d), -0.5);
} else {
tmp = (1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0)))) * (d * sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = (1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)) * sqrt((d / h))
if (d <= 3.2d-308) then
tmp = sqrt((d / l)) * t_0
else if (d <= 1.8d-159) then
tmp = (-0.125d0) * ((sqrt(h) * ((d_m * m_m) ** 2.0d0)) / (d * (l ** 1.5d0)))
else if (d <= 3.7d+155) then
tmp = t_0 * ((l / d) ** (-0.5d0))
else
tmp = (1.0d0 - (0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0)))) * (d * sqrt(((1.0d0 / l) / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = (1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * Math.sqrt((d / h));
double tmp;
if (d <= 3.2e-308) {
tmp = Math.sqrt((d / l)) * t_0;
} else if (d <= 1.8e-159) {
tmp = -0.125 * ((Math.sqrt(h) * Math.pow((D_m * M_m), 2.0)) / (d * Math.pow(l, 1.5)));
} else if (d <= 3.7e+155) {
tmp = t_0 * Math.pow((l / d), -0.5);
} else {
tmp = (1.0 - (0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0)))) * (d * Math.sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = (1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * math.sqrt((d / h)) tmp = 0 if d <= 3.2e-308: tmp = math.sqrt((d / l)) * t_0 elif d <= 1.8e-159: tmp = -0.125 * ((math.sqrt(h) * math.pow((D_m * M_m), 2.0)) / (d * math.pow(l, 1.5))) elif d <= 3.7e+155: tmp = t_0 * math.pow((l / d), -0.5) else: tmp = (1.0 - (0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)))) * (d * math.sqrt(((1.0 / l) / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) * sqrt(Float64(d / h))) tmp = 0.0 if (d <= 3.2e-308) tmp = Float64(sqrt(Float64(d / l)) * t_0); elseif (d <= 1.8e-159) tmp = Float64(-0.125 * Float64(Float64(sqrt(h) * (Float64(D_m * M_m) ^ 2.0)) / Float64(d * (l ^ 1.5)))); elseif (d <= 3.7e+155) tmp = Float64(t_0 * (Float64(l / d) ^ -0.5)); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0)))) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = (1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l)) * sqrt((d / h));
tmp = 0.0;
if (d <= 3.2e-308)
tmp = sqrt((d / l)) * t_0;
elseif (d <= 1.8e-159)
tmp = -0.125 * ((sqrt(h) * ((D_m * M_m) ^ 2.0)) / (d * (l ^ 1.5)));
elseif (d <= 3.7e+155)
tmp = t_0 * ((l / d) ^ -0.5);
else
tmp = (1.0 - (0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0)))) * (d * sqrt(((1.0 / l) / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, 3.2e-308], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[d, 1.8e-159], N[(-0.125 * N[(N[(N[Sqrt[h], $MachinePrecision] * N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / N[(d * N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 3.7e+155], N[(t$95$0 * N[Power[N[(l / d), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \left(1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\right) \cdot \sqrt{\frac{d}{h}}\\
\mathbf{if}\;d \leq 3.2 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot t\_0\\
\mathbf{elif}\;d \leq 1.8 \cdot 10^{-159}:\\
\;\;\;\;-0.125 \cdot \frac{\sqrt{h} \cdot {\left(D\_m \cdot M\_m\right)}^{2}}{d \cdot {\ell}^{1.5}}\\
\mathbf{elif}\;d \leq 3.7 \cdot 10^{+155}:\\
\;\;\;\;t\_0 \cdot {\left(\frac{\ell}{d}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\end{array}
\end{array}
if d < 3.2000000000000001e-308Initial program 71.5%
Simplified71.4%
associate-*l/72.3%
*-commutative72.3%
associate-/l/72.3%
Applied egg-rr72.3%
associate-*r*72.3%
*-commutative72.3%
Simplified72.3%
if 3.2000000000000001e-308 < d < 1.80000000000000011e-159Initial program 35.9%
Simplified32.8%
add-cube-cbrt32.9%
pow332.8%
sqrt-unprod23.0%
Applied egg-rr23.0%
Taylor expanded in d around 0 39.7%
*-commutative39.7%
associate-/l*40.6%
Simplified40.6%
associate-*r/39.7%
sqrt-div42.7%
frac-times41.4%
pow-prod-down57.5%
sqrt-pow166.7%
metadata-eval66.7%
Applied egg-rr66.7%
if 1.80000000000000011e-159 < d < 3.6999999999999998e155Initial program 82.0%
Simplified82.0%
associate-*l/86.1%
*-commutative86.1%
associate-/l/86.1%
Applied egg-rr86.1%
associate-*r*86.1%
*-commutative86.1%
Simplified86.1%
clear-num86.1%
sqrt-div86.7%
metadata-eval86.7%
Applied egg-rr86.7%
inv-pow86.7%
sqrt-pow286.8%
metadata-eval86.8%
Applied egg-rr86.8%
if 3.6999999999999998e155 < d Initial program 67.4%
Simplified67.4%
pow167.4%
sqrt-unprod67.4%
Applied egg-rr67.4%
unpow167.4%
associate-*l/63.8%
associate-*r/49.1%
unpow249.1%
Simplified49.1%
Taylor expanded in d around 0 88.4%
associate-/r*91.6%
associate-/l/88.4%
associate-/r*91.6%
Simplified91.6%
Final simplification77.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= h 1.75e+192)
(*
(sqrt (/ d l))
(*
(+ 1.0 (/ (* (* h -0.5) (pow (* D_m (/ M_m (* d 2.0))) 2.0)) l))
(sqrt (/ d h))))
(/ (* (pow (* D_m M_m) 2.0) (/ (* (sqrt h) -0.125) (pow l 1.5))) d)))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (h <= 1.75e+192) {
tmp = sqrt((d / l)) * ((1.0 + (((h * -0.5) * pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * sqrt((d / h)));
} else {
tmp = (pow((D_m * M_m), 2.0) * ((sqrt(h) * -0.125) / pow(l, 1.5))) / d;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (h <= 1.75d+192) then
tmp = sqrt((d / l)) * ((1.0d0 + (((h * (-0.5d0)) * ((d_m * (m_m / (d * 2.0d0))) ** 2.0d0)) / l)) * sqrt((d / h)))
else
tmp = (((d_m * m_m) ** 2.0d0) * ((sqrt(h) * (-0.125d0)) / (l ** 1.5d0))) / d
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (h <= 1.75e+192) {
tmp = Math.sqrt((d / l)) * ((1.0 + (((h * -0.5) * Math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * Math.sqrt((d / h)));
} else {
tmp = (Math.pow((D_m * M_m), 2.0) * ((Math.sqrt(h) * -0.125) / Math.pow(l, 1.5))) / d;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if h <= 1.75e+192: tmp = math.sqrt((d / l)) * ((1.0 + (((h * -0.5) * math.pow((D_m * (M_m / (d * 2.0))), 2.0)) / l)) * math.sqrt((d / h))) else: tmp = (math.pow((D_m * M_m), 2.0) * ((math.sqrt(h) * -0.125) / math.pow(l, 1.5))) / d return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (h <= 1.75e+192) tmp = Float64(sqrt(Float64(d / l)) * Float64(Float64(1.0 + Float64(Float64(Float64(h * -0.5) * (Float64(D_m * Float64(M_m / Float64(d * 2.0))) ^ 2.0)) / l)) * sqrt(Float64(d / h)))); else tmp = Float64(Float64((Float64(D_m * M_m) ^ 2.0) * Float64(Float64(sqrt(h) * -0.125) / (l ^ 1.5))) / d); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (h <= 1.75e+192)
tmp = sqrt((d / l)) * ((1.0 + (((h * -0.5) * ((D_m * (M_m / (d * 2.0))) ^ 2.0)) / l)) * sqrt((d / h)));
else
tmp = (((D_m * M_m) ^ 2.0) * ((sqrt(h) * -0.125) / (l ^ 1.5))) / d;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[h, 1.75e+192], N[(N[Sqrt[N[(d / l), $MachinePrecision]], $MachinePrecision] * N[(N[(1.0 + N[(N[(N[(h * -0.5), $MachinePrecision] * N[Power[N[(D$95$m * N[(M$95$m / N[(d * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] * N[(N[(N[Sqrt[h], $MachinePrecision] * -0.125), $MachinePrecision] / N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;h \leq 1.75 \cdot 10^{+192}:\\
\;\;\;\;\sqrt{\frac{d}{\ell}} \cdot \left(\left(1 + \frac{\left(h \cdot -0.5\right) \cdot {\left(D\_m \cdot \frac{M\_m}{d \cdot 2}\right)}^{2}}{\ell}\right) \cdot \sqrt{\frac{d}{h}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{{\left(D\_m \cdot M\_m\right)}^{2} \cdot \frac{\sqrt{h} \cdot -0.125}{{\ell}^{1.5}}}{d}\\
\end{array}
\end{array}
if h < 1.74999999999999991e192Initial program 71.8%
Simplified71.4%
associate-*l/72.9%
*-commutative72.9%
associate-/l/72.9%
Applied egg-rr72.9%
associate-*r*72.9%
*-commutative72.9%
Simplified72.9%
if 1.74999999999999991e192 < h Initial program 37.7%
Simplified37.6%
add-cube-cbrt37.3%
pow337.3%
sqrt-unprod37.3%
Applied egg-rr37.3%
Taylor expanded in d around 0 22.8%
*-commutative22.8%
associate-/l*24.1%
Simplified24.1%
associate-*l*24.1%
associate-*r/22.8%
associate-*l/22.8%
pow-prod-down54.4%
sqrt-div64.0%
associate-*l/64.0%
sqrt-pow179.0%
metadata-eval79.0%
Applied egg-rr79.0%
Final simplification73.4%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(if (<= d 3.2e-308)
(* (* d (sqrt (/ 1.0 (* l h)))) (+ -1.0 t_0))
(if (<= d 5.4e-135)
(* -0.125 (/ (* (sqrt h) (pow (* D_m M_m) 2.0)) (* d (pow l 1.5))))
(* (- 1.0 t_0) (* d (sqrt (/ (/ 1.0 l) h))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (d <= 3.2e-308) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (d <= 5.4e-135) {
tmp = -0.125 * ((sqrt(h) * pow((D_m * M_m), 2.0)) / (d * pow(l, 1.5)));
} else {
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))
if (d <= 3.2d-308) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + t_0)
else if (d <= 5.4d-135) then
tmp = (-0.125d0) * ((sqrt(h) * ((d_m * m_m) ** 2.0d0)) / (d * (l ** 1.5d0)))
else
tmp = (1.0d0 - t_0) * (d * sqrt(((1.0d0 / l) / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (d <= 3.2e-308) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (d <= 5.4e-135) {
tmp = -0.125 * ((Math.sqrt(h) * Math.pow((D_m * M_m), 2.0)) / (d * Math.pow(l, 1.5)));
} else {
tmp = (1.0 - t_0) * (d * Math.sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)) tmp = 0 if d <= 3.2e-308: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0) elif d <= 5.4e-135: tmp = -0.125 * ((math.sqrt(h) * math.pow((D_m * M_m), 2.0)) / (d * math.pow(l, 1.5))) else: tmp = (1.0 - t_0) * (d * math.sqrt(((1.0 / l) / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))) tmp = 0.0 if (d <= 3.2e-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + t_0)); elseif (d <= 5.4e-135) tmp = Float64(-0.125 * Float64(Float64(sqrt(h) * (Float64(D_m * M_m) ^ 2.0)) / Float64(d * (l ^ 1.5)))); else tmp = Float64(Float64(1.0 - t_0) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0));
tmp = 0.0;
if (d <= 3.2e-308)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
elseif (d <= 5.4e-135)
tmp = -0.125 * ((sqrt(h) * ((D_m * M_m) ^ 2.0)) / (d * (l ^ 1.5)));
else
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, 3.2e-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 5.4e-135], N[(-0.125 * N[(N[(N[Sqrt[h], $MachinePrecision] * N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / N[(d * N[Power[l, 1.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
\mathbf{if}\;d \leq 3.2 \cdot 10^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + t\_0\right)\\
\mathbf{elif}\;d \leq 5.4 \cdot 10^{-135}:\\
\;\;\;\;-0.125 \cdot \frac{\sqrt{h} \cdot {\left(D\_m \cdot M\_m\right)}^{2}}{d \cdot {\ell}^{1.5}}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\end{array}
\end{array}
if d < 3.2000000000000001e-308Initial program 71.5%
Simplified70.8%
pow170.8%
sqrt-unprod61.7%
Applied egg-rr61.7%
unpow161.7%
associate-*l/53.9%
associate-*r/43.2%
unpow243.2%
Simplified43.2%
Taylor expanded in d around -inf 70.7%
if 3.2000000000000001e-308 < d < 5.39999999999999997e-135Initial program 36.6%
Simplified34.0%
add-cube-cbrt34.0%
pow333.9%
sqrt-unprod22.8%
Applied egg-rr22.8%
Taylor expanded in d around 0 39.8%
*-commutative39.8%
associate-/l*40.6%
Simplified40.6%
associate-*r/39.8%
sqrt-div45.2%
frac-times44.1%
pow-prod-down58.0%
sqrt-pow165.9%
metadata-eval65.9%
Applied egg-rr65.9%
if 5.39999999999999997e-135 < d Initial program 79.9%
Simplified79.9%
pow179.9%
sqrt-unprod75.4%
Applied egg-rr75.4%
unpow175.4%
associate-*l/74.3%
associate-*r/68.5%
unpow268.5%
Simplified68.5%
Taylor expanded in d around 0 82.0%
associate-/r*83.0%
associate-/l/82.0%
associate-/r*83.0%
Simplified83.0%
Final simplification73.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(if (<= d 3.2e-308)
(* (* d (sqrt (/ 1.0 (* l h)))) (+ -1.0 t_0))
(if (<= d 2.7e-160)
(* -0.125 (* (/ (pow (* D_m M_m) 2.0) d) (sqrt (/ h (pow l 3.0)))))
(* (- 1.0 t_0) (* d (sqrt (/ (/ 1.0 l) h))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (d <= 3.2e-308) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (d <= 2.7e-160) {
tmp = -0.125 * ((pow((D_m * M_m), 2.0) / d) * sqrt((h / pow(l, 3.0))));
} else {
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))
if (d <= 3.2d-308) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + t_0)
else if (d <= 2.7d-160) then
tmp = (-0.125d0) * ((((d_m * m_m) ** 2.0d0) / d) * sqrt((h / (l ** 3.0d0))))
else
tmp = (1.0d0 - t_0) * (d * sqrt(((1.0d0 / l) / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (d <= 3.2e-308) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else if (d <= 2.7e-160) {
tmp = -0.125 * ((Math.pow((D_m * M_m), 2.0) / d) * Math.sqrt((h / Math.pow(l, 3.0))));
} else {
tmp = (1.0 - t_0) * (d * Math.sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)) tmp = 0 if d <= 3.2e-308: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0) elif d <= 2.7e-160: tmp = -0.125 * ((math.pow((D_m * M_m), 2.0) / d) * math.sqrt((h / math.pow(l, 3.0)))) else: tmp = (1.0 - t_0) * (d * math.sqrt(((1.0 / l) / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))) tmp = 0.0 if (d <= 3.2e-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + t_0)); elseif (d <= 2.7e-160) tmp = Float64(-0.125 * Float64(Float64((Float64(D_m * M_m) ^ 2.0) / d) * sqrt(Float64(h / (l ^ 3.0))))); else tmp = Float64(Float64(1.0 - t_0) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0));
tmp = 0.0;
if (d <= 3.2e-308)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
elseif (d <= 2.7e-160)
tmp = -0.125 * ((((D_m * M_m) ^ 2.0) / d) * sqrt((h / (l ^ 3.0))));
else
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d, 3.2e-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 2.7e-160], N[(-0.125 * N[(N[(N[Power[N[(D$95$m * M$95$m), $MachinePrecision], 2.0], $MachinePrecision] / d), $MachinePrecision] * N[Sqrt[N[(h / N[Power[l, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
\mathbf{if}\;d \leq 3.2 \cdot 10^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + t\_0\right)\\
\mathbf{elif}\;d \leq 2.7 \cdot 10^{-160}:\\
\;\;\;\;-0.125 \cdot \left(\frac{{\left(D\_m \cdot M\_m\right)}^{2}}{d} \cdot \sqrt{\frac{h}{{\ell}^{3}}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\end{array}
\end{array}
if d < 3.2000000000000001e-308Initial program 71.5%
Simplified70.8%
pow170.8%
sqrt-unprod61.7%
Applied egg-rr61.7%
unpow161.7%
associate-*l/53.9%
associate-*r/43.2%
unpow243.2%
Simplified43.2%
Taylor expanded in d around -inf 70.7%
if 3.2000000000000001e-308 < d < 2.7000000000000001e-160Initial program 35.9%
Simplified32.8%
add-cube-cbrt32.9%
pow332.8%
sqrt-unprod23.0%
Applied egg-rr23.0%
Taylor expanded in d around 0 39.7%
*-commutative39.7%
associate-/l*40.6%
Simplified40.6%
Taylor expanded in D around 0 39.7%
unpow239.7%
unpow239.7%
swap-sqr55.7%
unpow255.7%
Simplified55.7%
if 2.7000000000000001e-160 < d Initial program 77.6%
Simplified77.6%
pow177.6%
sqrt-unprod72.3%
Applied egg-rr72.3%
unpow172.3%
associate-*l/71.3%
associate-*r/65.4%
unpow265.4%
Simplified65.4%
Taylor expanded in d around 0 80.8%
associate-/r*81.7%
associate-/l/80.8%
associate-/r*81.8%
Simplified81.8%
Final simplification72.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(if (<= l -4.5e+131)
(* (sqrt (/ d h)) (/ (sqrt (- d)) (sqrt (- l))))
(if (<= l -1.95e-308)
(* (* d (sqrt (/ 1.0 (* l h)))) (+ -1.0 t_0))
(* (- 1.0 t_0) (* d (sqrt (/ (/ 1.0 l) h))))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (l <= -4.5e+131) {
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
} else if (l <= -1.95e-308) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else {
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))
if (l <= (-4.5d+131)) then
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l))
else if (l <= (-1.95d-308)) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + t_0)
else
tmp = (1.0d0 - t_0) * (d * sqrt(((1.0d0 / l) / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (l <= -4.5e+131) {
tmp = Math.sqrt((d / h)) * (Math.sqrt(-d) / Math.sqrt(-l));
} else if (l <= -1.95e-308) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else {
tmp = (1.0 - t_0) * (d * Math.sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)) tmp = 0 if l <= -4.5e+131: tmp = math.sqrt((d / h)) * (math.sqrt(-d) / math.sqrt(-l)) elif l <= -1.95e-308: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0) else: tmp = (1.0 - t_0) * (d * math.sqrt(((1.0 / l) / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))) tmp = 0.0 if (l <= -4.5e+131) tmp = Float64(sqrt(Float64(d / h)) * Float64(sqrt(Float64(-d)) / sqrt(Float64(-l)))); elseif (l <= -1.95e-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + t_0)); else tmp = Float64(Float64(1.0 - t_0) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0));
tmp = 0.0;
if (l <= -4.5e+131)
tmp = sqrt((d / h)) * (sqrt(-d) / sqrt(-l));
elseif (l <= -1.95e-308)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
else
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -4.5e+131], N[(N[Sqrt[N[(d / h), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[(-d)], $MachinePrecision] / N[Sqrt[(-l)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, -1.95e-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -4.5 \cdot 10^{+131}:\\
\;\;\;\;\sqrt{\frac{d}{h}} \cdot \frac{\sqrt{-d}}{\sqrt{-\ell}}\\
\mathbf{elif}\;\ell \leq -1.95 \cdot 10^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\end{array}
\end{array}
if l < -4.5000000000000002e131Initial program 60.5%
Simplified60.4%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt15.7%
mul-1-neg15.7%
Simplified15.7%
add-sqr-sqrt12.9%
sqrt-unprod56.5%
sqr-neg56.5%
add-sqr-sqrt56.5%
frac-2neg56.5%
sqrt-div64.4%
Applied egg-rr64.4%
if -4.5000000000000002e131 < l < -1.95e-308Initial program 76.9%
Simplified75.9%
pow175.9%
sqrt-unprod66.0%
Applied egg-rr66.0%
unpow166.0%
associate-*l/56.6%
associate-*r/46.0%
unpow246.0%
Simplified46.0%
Taylor expanded in d around -inf 79.4%
if -1.95e-308 < l Initial program 66.4%
Simplified65.6%
pow165.6%
sqrt-unprod59.2%
Applied egg-rr59.2%
unpow159.2%
associate-*l/57.6%
associate-*r/48.4%
unpow248.4%
Simplified48.4%
Taylor expanded in d around 0 67.3%
associate-/r*68.0%
associate-/l/67.3%
associate-/r*68.0%
Simplified68.0%
Final simplification71.6%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(t_1 (sqrt (/ (/ 1.0 l) h))))
(if (<= l -2.9e-69)
(* (- d) t_1)
(if (<= l 1.48e-164)
(* t_0 (sqrt (* (/ d l) (/ d h))))
(* t_0 (* d t_1))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0)));
double t_1 = sqrt(((1.0 / l) / h));
double tmp;
if (l <= -2.9e-69) {
tmp = -d * t_1;
} else if (l <= 1.48e-164) {
tmp = t_0 * sqrt(((d / l) * (d / h)));
} else {
tmp = t_0 * (d * t_1);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 1.0d0 - (0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0)))
t_1 = sqrt(((1.0d0 / l) / h))
if (l <= (-2.9d-69)) then
tmp = -d * t_1
else if (l <= 1.48d-164) then
tmp = t_0 * sqrt(((d / l) * (d / h)))
else
tmp = t_0 * (d * t_1)
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 - (0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0)));
double t_1 = Math.sqrt(((1.0 / l) / h));
double tmp;
if (l <= -2.9e-69) {
tmp = -d * t_1;
} else if (l <= 1.48e-164) {
tmp = t_0 * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = t_0 * (d * t_1);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 1.0 - (0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0))) t_1 = math.sqrt(((1.0 / l) / h)) tmp = 0 if l <= -2.9e-69: tmp = -d * t_1 elif l <= 1.48e-164: tmp = t_0 * math.sqrt(((d / l) * (d / h))) else: tmp = t_0 * (d * t_1) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0)))) t_1 = sqrt(Float64(Float64(1.0 / l) / h)) tmp = 0.0 if (l <= -2.9e-69) tmp = Float64(Float64(-d) * t_1); elseif (l <= 1.48e-164) tmp = Float64(t_0 * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(t_0 * Float64(d * t_1)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 1.0 - (0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0)));
t_1 = sqrt(((1.0 / l) / h));
tmp = 0.0;
if (l <= -2.9e-69)
tmp = -d * t_1;
elseif (l <= 1.48e-164)
tmp = t_0 * sqrt(((d / l) * (d / h)));
else
tmp = t_0 * (d * t_1);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -2.9e-69], N[((-d) * t$95$1), $MachinePrecision], If[LessEqual[l, 1.48e-164], N[(t$95$0 * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(d * t$95$1), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
t_1 := \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{if}\;\ell \leq -2.9 \cdot 10^{-69}:\\
\;\;\;\;\left(-d\right) \cdot t\_1\\
\mathbf{elif}\;\ell \leq 1.48 \cdot 10^{-164}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(d \cdot t\_1\right)\\
\end{array}
\end{array}
if l < -2.8999999999999998e-69Initial program 62.9%
Simplified62.8%
Taylor expanded in d around inf 10.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.4%
associate-*r*62.4%
mul-1-neg62.4%
distribute-rgt-neg-in62.4%
associate-/r*62.9%
associate-/l/62.4%
associate-/r*62.9%
Simplified62.9%
if -2.8999999999999998e-69 < l < 1.48000000000000001e-164Initial program 80.4%
Simplified79.4%
pow179.4%
sqrt-unprod72.8%
Applied egg-rr72.8%
unpow172.8%
Simplified72.8%
if 1.48000000000000001e-164 < l Initial program 64.3%
Simplified63.2%
pow163.2%
sqrt-unprod55.5%
Applied egg-rr55.5%
unpow155.5%
associate-*l/54.5%
associate-*r/46.3%
unpow246.3%
Simplified46.3%
Taylor expanded in d around 0 67.6%
associate-/r*68.6%
associate-/l/67.6%
associate-/r*68.6%
Simplified68.6%
Final simplification68.2%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0))))))
(if (<= l -2.2e-68)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= l 5.2e-175)
(* t_0 (sqrt (* (/ d l) (/ d h))))
(* t_0 (* d (pow (* l h) -0.5)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0)));
double tmp;
if (l <= -2.2e-68) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (l <= 5.2e-175) {
tmp = t_0 * sqrt(((d / l) * (d / h)));
} else {
tmp = t_0 * (d * pow((l * h), -0.5));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 - (0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0)))
if (l <= (-2.2d-68)) then
tmp = -d * sqrt(((1.0d0 / l) / h))
else if (l <= 5.2d-175) then
tmp = t_0 * sqrt(((d / l) * (d / h)))
else
tmp = t_0 * (d * ((l * h) ** (-0.5d0)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 1.0 - (0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0)));
double tmp;
if (l <= -2.2e-68) {
tmp = -d * Math.sqrt(((1.0 / l) / h));
} else if (l <= 5.2e-175) {
tmp = t_0 * Math.sqrt(((d / l) * (d / h)));
} else {
tmp = t_0 * (d * Math.pow((l * h), -0.5));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 1.0 - (0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0))) tmp = 0 if l <= -2.2e-68: tmp = -d * math.sqrt(((1.0 / l) / h)) elif l <= 5.2e-175: tmp = t_0 * math.sqrt(((d / l) * (d / h))) else: tmp = t_0 * (d * math.pow((l * h), -0.5)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0)))) tmp = 0.0 if (l <= -2.2e-68) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (l <= 5.2e-175) tmp = Float64(t_0 * sqrt(Float64(Float64(d / l) * Float64(d / h)))); else tmp = Float64(t_0 * Float64(d * (Float64(l * h) ^ -0.5))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 1.0 - (0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0)));
tmp = 0.0;
if (l <= -2.2e-68)
tmp = -d * sqrt(((1.0 / l) / h));
elseif (l <= 5.2e-175)
tmp = t_0 * sqrt(((d / l) * (d / h)));
else
tmp = t_0 * (d * ((l * h) ^ -0.5));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -2.2e-68], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 5.2e-175], N[(t$95$0 * N[Sqrt[N[(N[(d / l), $MachinePrecision] * N[(d / h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -2.2 \cdot 10^{-68}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;\ell \leq 5.2 \cdot 10^{-175}:\\
\;\;\;\;t\_0 \cdot \sqrt{\frac{d}{\ell} \cdot \frac{d}{h}}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(d \cdot {\left(\ell \cdot h\right)}^{-0.5}\right)\\
\end{array}
\end{array}
if l < -2.20000000000000002e-68Initial program 62.9%
Simplified62.8%
Taylor expanded in d around inf 10.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.4%
associate-*r*62.4%
mul-1-neg62.4%
distribute-rgt-neg-in62.4%
associate-/r*62.9%
associate-/l/62.4%
associate-/r*62.9%
Simplified62.9%
if -2.20000000000000002e-68 < l < 5.2e-175Initial program 81.1%
Simplified80.0%
pow180.0%
sqrt-unprod73.3%
Applied egg-rr73.3%
unpow173.3%
Simplified73.3%
if 5.2e-175 < l Initial program 64.0%
Simplified62.9%
pow162.9%
sqrt-unprod55.4%
Applied egg-rr55.4%
unpow155.4%
associate-*l/54.4%
associate-*r/46.4%
unpow246.4%
Simplified46.4%
Taylor expanded in d around 0 67.3%
unpow-167.3%
metadata-eval67.3%
pow-sqr67.4%
rem-sqrt-square67.4%
rem-square-sqrt67.1%
fabs-sqr67.1%
rem-square-sqrt67.4%
Simplified67.4%
Final simplification67.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= d -1.4e-125)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= d 1.6e-278)
(/ d (sqrt (+ -1.0 (fma l h 1.0))))
(*
(- 1.0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0))))
(* d (pow (* l h) -0.5))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -1.4e-125) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (d <= 1.6e-278) {
tmp = d / sqrt((-1.0 + fma(l, h, 1.0)));
} else {
tmp = (1.0 - (0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0)))) * (d * pow((l * h), -0.5));
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -1.4e-125) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (d <= 1.6e-278) tmp = Float64(d / sqrt(Float64(-1.0 + fma(l, h, 1.0)))); else tmp = Float64(Float64(1.0 - Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0)))) * Float64(d * (Float64(l * h) ^ -0.5))); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -1.4e-125], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 1.6e-278], N[(d / N[Sqrt[N[(-1.0 + N[(l * h + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -1.4 \cdot 10^{-125}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;d \leq 1.6 \cdot 10^{-278}:\\
\;\;\;\;\frac{d}{\sqrt{-1 + \mathsf{fma}\left(\ell, h, 1\right)}}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\right) \cdot \left(d \cdot {\left(\ell \cdot h\right)}^{-0.5}\right)\\
\end{array}
\end{array}
if d < -1.4e-125Initial program 79.1%
Simplified79.1%
Taylor expanded in d around inf 7.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.4%
associate-*r*62.4%
mul-1-neg62.4%
distribute-rgt-neg-in62.4%
associate-/r*62.8%
associate-/l/62.4%
associate-/r*62.8%
Simplified62.8%
if -1.4e-125 < d < 1.60000000000000009e-278Initial program 51.9%
Simplified48.5%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt13.3%
mul-1-neg13.3%
Simplified13.3%
sqrt-div0.4%
add-sqr-sqrt0.2%
sqrt-unprod2.1%
sqr-neg2.1%
add-sqr-sqrt2.1%
sqrt-div2.1%
frac-times2.1%
add-sqr-sqrt2.1%
sqrt-prod20.1%
*-commutative20.1%
Applied egg-rr20.1%
expm1-log1p-u20.1%
expm1-undefine35.6%
Applied egg-rr35.6%
sub-neg35.6%
metadata-eval35.6%
+-commutative35.6%
log1p-undefine35.6%
rem-exp-log35.6%
+-commutative35.6%
fma-define35.6%
Simplified35.6%
if 1.60000000000000009e-278 < d Initial program 70.2%
Simplified69.4%
pow169.4%
sqrt-unprod62.5%
Applied egg-rr62.5%
unpow162.5%
associate-*l/61.7%
associate-*r/51.8%
unpow251.8%
Simplified51.8%
Taylor expanded in d around 0 72.0%
unpow-172.0%
metadata-eval72.0%
pow-sqr72.1%
rem-sqrt-square72.1%
rem-square-sqrt71.9%
fabs-sqr71.9%
rem-square-sqrt72.1%
Simplified72.1%
Final simplification60.9%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(let* ((t_0 (* 0.5 (* (/ h l) (pow (* (/ M_m 2.0) (/ D_m d)) 2.0)))))
(if (<= l -1.95e-308)
(* (* d (sqrt (/ 1.0 (* l h)))) (+ -1.0 t_0))
(* (- 1.0 t_0) (* d (sqrt (/ (/ 1.0 l) h)))))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (l <= -1.95e-308) {
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else {
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = 0.5d0 * ((h / l) * (((m_m / 2.0d0) * (d_m / d)) ** 2.0d0))
if (l <= (-1.95d-308)) then
tmp = (d * sqrt((1.0d0 / (l * h)))) * ((-1.0d0) + t_0)
else
tmp = (1.0d0 - t_0) * (d * sqrt(((1.0d0 / l) / h)))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = 0.5 * ((h / l) * Math.pow(((M_m / 2.0) * (D_m / d)), 2.0));
double tmp;
if (l <= -1.95e-308) {
tmp = (d * Math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
} else {
tmp = (1.0 - t_0) * (d * Math.sqrt(((1.0 / l) / h)));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = 0.5 * ((h / l) * math.pow(((M_m / 2.0) * (D_m / d)), 2.0)) tmp = 0 if l <= -1.95e-308: tmp = (d * math.sqrt((1.0 / (l * h)))) * (-1.0 + t_0) else: tmp = (1.0 - t_0) * (d * math.sqrt(((1.0 / l) / h))) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = Float64(0.5 * Float64(Float64(h / l) * (Float64(Float64(M_m / 2.0) * Float64(D_m / d)) ^ 2.0))) tmp = 0.0 if (l <= -1.95e-308) tmp = Float64(Float64(d * sqrt(Float64(1.0 / Float64(l * h)))) * Float64(-1.0 + t_0)); else tmp = Float64(Float64(1.0 - t_0) * Float64(d * sqrt(Float64(Float64(1.0 / l) / h)))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = 0.5 * ((h / l) * (((M_m / 2.0) * (D_m / d)) ^ 2.0));
tmp = 0.0;
if (l <= -1.95e-308)
tmp = (d * sqrt((1.0 / (l * h)))) * (-1.0 + t_0);
else
tmp = (1.0 - t_0) * (d * sqrt(((1.0 / l) / h)));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[(0.5 * N[(N[(h / l), $MachinePrecision] * N[Power[N[(N[(M$95$m / 2.0), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, -1.95e-308], N[(N[(d * N[Sqrt[N[(1.0 / N[(l * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - t$95$0), $MachinePrecision] * N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(\frac{h}{\ell} \cdot {\left(\frac{M\_m}{2} \cdot \frac{D\_m}{d}\right)}^{2}\right)\\
\mathbf{if}\;\ell \leq -1.95 \cdot 10^{-308}:\\
\;\;\;\;\left(d \cdot \sqrt{\frac{1}{\ell \cdot h}}\right) \cdot \left(-1 + t\_0\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 - t\_0\right) \cdot \left(d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\right)\\
\end{array}
\end{array}
if l < -1.95e-308Initial program 71.8%
Simplified71.1%
pow171.1%
sqrt-unprod61.9%
Applied egg-rr61.9%
unpow161.9%
associate-*l/54.7%
associate-*r/43.8%
unpow243.8%
Simplified43.8%
Taylor expanded in d around -inf 71.7%
if -1.95e-308 < l Initial program 66.4%
Simplified65.6%
pow165.6%
sqrt-unprod59.2%
Applied egg-rr59.2%
unpow159.2%
associate-*l/57.6%
associate-*r/48.4%
unpow248.4%
Simplified48.4%
Taylor expanded in d around 0 67.3%
associate-/r*68.0%
associate-/l/67.3%
associate-/r*68.0%
Simplified68.0%
Final simplification70.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= d -3.5e-127)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= d -2e-310)
(/ d (sqrt (+ -1.0 (fma l h 1.0))))
(/ (/ d (sqrt h)) (sqrt l)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -3.5e-127) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (d <= -2e-310) {
tmp = d / sqrt((-1.0 + fma(l, h, 1.0)));
} else {
tmp = (d / sqrt(h)) / sqrt(l);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -3.5e-127) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (d <= -2e-310) tmp = Float64(d / sqrt(Float64(-1.0 + fma(l, h, 1.0)))); else tmp = Float64(Float64(d / sqrt(h)) / sqrt(l)); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -3.5e-127], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(d / N[Sqrt[N[(-1.0 + N[(l * h + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[h], $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -3.5 \cdot 10^{-127}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{d}{\sqrt{-1 + \mathsf{fma}\left(\ell, h, 1\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{h}}}{\sqrt{\ell}}\\
\end{array}
\end{array}
if d < -3.49999999999999989e-127Initial program 79.1%
Simplified79.1%
Taylor expanded in d around inf 7.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.4%
associate-*r*62.4%
mul-1-neg62.4%
distribute-rgt-neg-in62.4%
associate-/r*62.8%
associate-/l/62.4%
associate-/r*62.8%
Simplified62.8%
if -3.49999999999999989e-127 < d < -1.999999999999994e-310Initial program 57.2%
Simplified53.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt14.8%
mul-1-neg14.8%
Simplified14.8%
sqrt-div0.0%
add-sqr-sqrt0.0%
sqrt-unprod0.0%
sqr-neg0.0%
add-sqr-sqrt0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod22.6%
*-commutative22.6%
Applied egg-rr22.6%
expm1-log1p-u22.6%
expm1-undefine40.3%
Applied egg-rr40.3%
sub-neg40.3%
metadata-eval40.3%
+-commutative40.3%
log1p-undefine40.3%
rem-exp-log40.3%
+-commutative40.3%
fma-define40.3%
Simplified40.3%
if -1.999999999999994e-310 < d Initial program 67.0%
Simplified65.4%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt8.2%
mul-1-neg8.2%
Simplified8.2%
sqrt-div8.2%
frac-2neg8.2%
add-sqr-sqrt0.3%
sqrt-unprod42.4%
sqr-neg42.4%
add-sqr-sqrt42.4%
sqrt-div45.9%
frac-times45.9%
distribute-lft-neg-in45.9%
add-sqr-sqrt46.1%
Applied egg-rr46.1%
associate-/r*44.5%
neg-mul-144.5%
neg-mul-144.5%
times-frac44.5%
metadata-eval44.5%
Simplified44.5%
Final simplification50.0%
M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
(FPCore (d h l M_m D_m)
:precision binary64
(if (<= d -7.6e-124)
(* (- d) (sqrt (/ (/ 1.0 l) h)))
(if (<= d -2e-310)
(/ d (sqrt (+ -1.0 (fma l h 1.0))))
(/ (/ d (sqrt l)) (sqrt h)))))M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (d <= -7.6e-124) {
tmp = -d * sqrt(((1.0 / l) / h));
} else if (d <= -2e-310) {
tmp = d / sqrt((-1.0 + fma(l, h, 1.0)));
} else {
tmp = (d / sqrt(l)) / sqrt(h);
}
return tmp;
}
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (d <= -7.6e-124) tmp = Float64(Float64(-d) * sqrt(Float64(Float64(1.0 / l) / h))); elseif (d <= -2e-310) tmp = Float64(d / sqrt(Float64(-1.0 + fma(l, h, 1.0)))); else tmp = Float64(Float64(d / sqrt(l)) / sqrt(h)); end return tmp end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[d, -7.6e-124], N[((-d) * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[d, -2e-310], N[(d / N[Sqrt[N[(-1.0 + N[(l * h + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(d / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] / N[Sqrt[h], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;d \leq -7.6 \cdot 10^{-124}:\\
\;\;\;\;\left(-d\right) \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{elif}\;d \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{d}{\sqrt{-1 + \mathsf{fma}\left(\ell, h, 1\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{d}{\sqrt{\ell}}}{\sqrt{h}}\\
\end{array}
\end{array}
if d < -7.60000000000000025e-124Initial program 79.1%
Simplified79.1%
Taylor expanded in d around inf 7.3%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt62.4%
associate-*r*62.4%
mul-1-neg62.4%
distribute-rgt-neg-in62.4%
associate-/r*62.8%
associate-/l/62.4%
associate-/r*62.8%
Simplified62.8%
if -7.60000000000000025e-124 < d < -1.999999999999994e-310Initial program 57.2%
Simplified53.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt14.8%
mul-1-neg14.8%
Simplified14.8%
sqrt-div0.0%
add-sqr-sqrt0.0%
sqrt-unprod0.0%
sqr-neg0.0%
add-sqr-sqrt0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod22.6%
*-commutative22.6%
Applied egg-rr22.6%
expm1-log1p-u22.6%
expm1-undefine40.3%
Applied egg-rr40.3%
sub-neg40.3%
metadata-eval40.3%
+-commutative40.3%
log1p-undefine40.3%
rem-exp-log40.3%
+-commutative40.3%
fma-define40.3%
Simplified40.3%
if -1.999999999999994e-310 < d Initial program 67.0%
Simplified65.4%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt8.2%
mul-1-neg8.2%
Simplified8.2%
sqrt-div8.2%
add-sqr-sqrt0.3%
sqrt-unprod42.4%
sqr-neg42.4%
add-sqr-sqrt42.4%
sqrt-div45.9%
frac-times45.9%
add-sqr-sqrt46.1%
sqrt-prod41.3%
*-commutative41.3%
Applied egg-rr41.3%
*-un-lft-identity41.3%
sqrt-prod46.1%
times-frac44.5%
Applied egg-rr44.5%
associate-*r/42.9%
associate-*l/43.0%
*-lft-identity43.0%
Simplified43.0%
Final simplification49.3%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (let* ((t_0 (sqrt (/ (/ 1.0 l) h)))) (if (<= l -2.7e-213) (* (- d) t_0) (* d t_0))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = sqrt(((1.0 / l) / h));
double tmp;
if (l <= -2.7e-213) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt(((1.0d0 / l) / h))
if (l <= (-2.7d-213)) then
tmp = -d * t_0
else
tmp = d * t_0
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double t_0 = Math.sqrt(((1.0 / l) / h));
double tmp;
if (l <= -2.7e-213) {
tmp = -d * t_0;
} else {
tmp = d * t_0;
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): t_0 = math.sqrt(((1.0 / l) / h)) tmp = 0 if l <= -2.7e-213: tmp = -d * t_0 else: tmp = d * t_0 return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) t_0 = sqrt(Float64(Float64(1.0 / l) / h)) tmp = 0.0 if (l <= -2.7e-213) tmp = Float64(Float64(-d) * t_0); else tmp = Float64(d * t_0); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
t_0 = sqrt(((1.0 / l) / h));
tmp = 0.0;
if (l <= -2.7e-213)
tmp = -d * t_0;
else
tmp = d * t_0;
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $MachinePrecision]
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
code[d_, h_, l_, M$95$m_, D$95$m_] := Block[{t$95$0 = N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[l, -2.7e-213], N[((-d) * t$95$0), $MachinePrecision], N[(d * t$95$0), $MachinePrecision]]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\mathbf{if}\;\ell \leq -2.7 \cdot 10^{-213}:\\
\;\;\;\;\left(-d\right) \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;d \cdot t\_0\\
\end{array}
\end{array}
if l < -2.7000000000000001e-213Initial program 70.1%
Simplified69.3%
Taylor expanded in d around inf 9.1%
Taylor expanded in h around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt52.4%
associate-*r*52.4%
mul-1-neg52.4%
distribute-rgt-neg-in52.4%
associate-/r*52.7%
associate-/l/52.4%
associate-/r*52.7%
Simplified52.7%
if -2.7000000000000001e-213 < l Initial program 68.5%
Simplified66.4%
Taylor expanded in d around inf 42.2%
*-un-lft-identity42.2%
associate-/r*42.8%
Applied egg-rr42.8%
*-lft-identity42.8%
associate-/l/42.2%
associate-/r*42.9%
Simplified42.9%
Final simplification47.7%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -6.8e-216) (/ d (- (sqrt (* l h)))) (* d (sqrt (/ (/ 1.0 l) h)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.8e-216) {
tmp = d / -sqrt((l * h));
} else {
tmp = d * sqrt(((1.0 / l) / h));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-6.8d-216)) then
tmp = d / -sqrt((l * h))
else
tmp = d * sqrt(((1.0d0 / l) / h))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -6.8e-216) {
tmp = d / -Math.sqrt((l * h));
} else {
tmp = d * Math.sqrt(((1.0 / l) / h));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -6.8e-216: tmp = d / -math.sqrt((l * h)) else: tmp = d * math.sqrt(((1.0 / l) / h)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -6.8e-216) tmp = Float64(d / Float64(-sqrt(Float64(l * h)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / l) / h))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -6.8e-216)
tmp = d / -sqrt((l * h));
else
tmp = d * sqrt(((1.0 / l) / h));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -6.8e-216], N[(d / (-N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / l), $MachinePrecision] / h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.8 \cdot 10^{-216}:\\
\;\;\;\;\frac{d}{-\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{\ell}}{h}}\\
\end{array}
\end{array}
if l < -6.7999999999999995e-216Initial program 70.1%
Simplified69.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt10.5%
mul-1-neg10.5%
Simplified10.5%
distribute-rgt-neg-out10.5%
neg-sub010.5%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod52.5%
*-commutative52.5%
Applied egg-rr52.5%
neg-sub052.5%
distribute-neg-frac52.5%
Simplified52.5%
if -6.7999999999999995e-216 < l Initial program 68.5%
Simplified66.4%
Taylor expanded in d around inf 42.2%
*-un-lft-identity42.2%
associate-/r*42.8%
Applied egg-rr42.8%
*-lft-identity42.8%
associate-/l/42.2%
associate-/r*42.9%
Simplified42.9%
Final simplification47.6%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -5.8e-218) (/ d (- (sqrt (* l h)))) (* d (sqrt (/ (/ 1.0 h) l)))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.8e-218) {
tmp = d / -sqrt((l * h));
} else {
tmp = d * sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-5.8d-218)) then
tmp = d / -sqrt((l * h))
else
tmp = d * sqrt(((1.0d0 / h) / l))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -5.8e-218) {
tmp = d / -Math.sqrt((l * h));
} else {
tmp = d * Math.sqrt(((1.0 / h) / l));
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -5.8e-218: tmp = d / -math.sqrt((l * h)) else: tmp = d * math.sqrt(((1.0 / h) / l)) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -5.8e-218) tmp = Float64(d / Float64(-sqrt(Float64(l * h)))); else tmp = Float64(d * sqrt(Float64(Float64(1.0 / h) / l))); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -5.8e-218)
tmp = d / -sqrt((l * h));
else
tmp = d * sqrt(((1.0 / h) / l));
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -5.8e-218], N[(d / (-N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Sqrt[N[(N[(1.0 / h), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -5.8 \cdot 10^{-218}:\\
\;\;\;\;\frac{d}{-\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot \sqrt{\frac{\frac{1}{h}}{\ell}}\\
\end{array}
\end{array}
if l < -5.8000000000000004e-218Initial program 70.1%
Simplified69.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt10.5%
mul-1-neg10.5%
Simplified10.5%
distribute-rgt-neg-out10.5%
neg-sub010.5%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod52.5%
*-commutative52.5%
Applied egg-rr52.5%
neg-sub052.5%
distribute-neg-frac52.5%
Simplified52.5%
if -5.8000000000000004e-218 < l Initial program 68.5%
Simplified66.4%
Taylor expanded in d around inf 42.2%
*-un-lft-identity42.2%
pow1/242.2%
inv-pow42.2%
pow-pow42.3%
metadata-eval42.3%
Applied egg-rr42.3%
*-lft-identity42.3%
Simplified42.3%
Taylor expanded in d around 0 42.2%
associate-/r*42.8%
Simplified42.8%
Final simplification47.5%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (if (<= l -9.6e-217) (/ d (- (sqrt (* l h)))) (* d (pow (* l h) -0.5))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -9.6e-217) {
tmp = d / -sqrt((l * h));
} else {
tmp = d * pow((l * h), -0.5);
}
return tmp;
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
real(8) :: tmp
if (l <= (-9.6d-217)) then
tmp = d / -sqrt((l * h))
else
tmp = d * ((l * h) ** (-0.5d0))
end if
code = tmp
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
double tmp;
if (l <= -9.6e-217) {
tmp = d / -Math.sqrt((l * h));
} else {
tmp = d * Math.pow((l * h), -0.5);
}
return tmp;
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): tmp = 0 if l <= -9.6e-217: tmp = d / -math.sqrt((l * h)) else: tmp = d * math.pow((l * h), -0.5) return tmp
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) tmp = 0.0 if (l <= -9.6e-217) tmp = Float64(d / Float64(-sqrt(Float64(l * h)))); else tmp = Float64(d * (Float64(l * h) ^ -0.5)); end return tmp end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp_2 = code(d, h, l, M_m, D_m)
tmp = 0.0;
if (l <= -9.6e-217)
tmp = d / -sqrt((l * h));
else
tmp = d * ((l * h) ^ -0.5);
end
tmp_2 = tmp;
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := If[LessEqual[l, -9.6e-217], N[(d / (-N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -9.6 \cdot 10^{-217}:\\
\;\;\;\;\frac{d}{-\sqrt{\ell \cdot h}}\\
\mathbf{else}:\\
\;\;\;\;d \cdot {\left(\ell \cdot h\right)}^{-0.5}\\
\end{array}
\end{array}
if l < -9.5999999999999995e-217Initial program 70.1%
Simplified69.3%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt10.5%
mul-1-neg10.5%
Simplified10.5%
distribute-rgt-neg-out10.5%
neg-sub010.5%
sqrt-div0.0%
sqrt-div0.0%
frac-times0.0%
add-sqr-sqrt0.0%
sqrt-prod52.5%
*-commutative52.5%
Applied egg-rr52.5%
neg-sub052.5%
distribute-neg-frac52.5%
Simplified52.5%
if -9.5999999999999995e-217 < l Initial program 68.5%
Simplified66.4%
Taylor expanded in d around inf 42.2%
*-un-lft-identity42.2%
pow1/242.2%
inv-pow42.2%
pow-pow42.3%
metadata-eval42.3%
Applied egg-rr42.3%
*-lft-identity42.3%
Simplified42.3%
Final simplification47.2%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (* d (pow (* l h) -0.5)))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d * pow((l * h), -0.5);
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d * ((l * h) ** (-0.5d0))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d * Math.pow((l * h), -0.5);
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d * math.pow((l * h), -0.5)
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d * (Float64(l * h) ^ -0.5)) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d * ((l * h) ^ -0.5);
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d * N[Power[N[(l * h), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
d \cdot {\left(\ell \cdot h\right)}^{-0.5}
\end{array}
Initial program 69.3%
Simplified67.8%
Taylor expanded in d around inf 26.1%
*-un-lft-identity26.1%
pow1/226.1%
inv-pow26.1%
pow-pow26.1%
metadata-eval26.1%
Applied egg-rr26.1%
*-lft-identity26.1%
Simplified26.1%
Final simplification26.1%
M_m = (fabs.f64 M) D_m = (fabs.f64 D) NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. (FPCore (d h l M_m D_m) :precision binary64 (/ d (sqrt (* l h))))
M_m = fabs(M);
D_m = fabs(D);
assert(d < h && h < l && l < M_m && M_m < D_m);
double code(double d, double h, double l, double M_m, double D_m) {
return d / sqrt((l * h));
}
M_m = abs(m)
D_m = abs(d)
NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function.
real(8) function code(d, h, l, m_m, d_m)
real(8), intent (in) :: d
real(8), intent (in) :: h
real(8), intent (in) :: l
real(8), intent (in) :: m_m
real(8), intent (in) :: d_m
code = d / sqrt((l * h))
end function
M_m = Math.abs(M);
D_m = Math.abs(D);
assert d < h && h < l && l < M_m && M_m < D_m;
public static double code(double d, double h, double l, double M_m, double D_m) {
return d / Math.sqrt((l * h));
}
M_m = math.fabs(M) D_m = math.fabs(D) [d, h, l, M_m, D_m] = sort([d, h, l, M_m, D_m]) def code(d, h, l, M_m, D_m): return d / math.sqrt((l * h))
M_m = abs(M) D_m = abs(D) d, h, l, M_m, D_m = sort([d, h, l, M_m, D_m]) function code(d, h, l, M_m, D_m) return Float64(d / sqrt(Float64(l * h))) end
M_m = abs(M);
D_m = abs(D);
d, h, l, M_m, D_m = num2cell(sort([d, h, l, M_m, D_m])){:}
function tmp = code(d, h, l, M_m, D_m)
tmp = d / sqrt((l * h));
end
M_m = N[Abs[M], $MachinePrecision] D_m = N[Abs[D], $MachinePrecision] NOTE: d, h, l, M_m, and D_m should be sorted in increasing order before calling this function. code[d_, h_, l_, M$95$m_, D$95$m_] := N[(d / N[Sqrt[N[(l * h), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
M_m = \left|M\right|
\\
D_m = \left|D\right|
\\
[d, h, l, M_m, D_m] = \mathsf{sort}([d, h, l, M_m, D_m])\\
\\
\frac{d}{\sqrt{\ell \cdot h}}
\end{array}
Initial program 69.3%
Simplified67.8%
Taylor expanded in l around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt9.9%
mul-1-neg9.9%
Simplified9.9%
sqrt-div3.8%
add-sqr-sqrt0.1%
sqrt-unprod19.7%
sqr-neg19.7%
add-sqr-sqrt19.7%
sqrt-div21.3%
frac-times21.3%
add-sqr-sqrt21.4%
sqrt-prod26.1%
*-commutative26.1%
Applied egg-rr26.1%
herbie shell --seed 2024129
(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)))))