
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 2e+191)
(/
(*
(sqrt (* 2.0 (* F (fma B_m B_m (* (* C A) -4.0)))))
(- (sqrt (+ (+ C A) (hypot (- A C) B_m)))))
(- (pow B_m 2.0) (* C (* A 4.0))))
(* (* (sqrt (+ C (hypot B_m C))) (sqrt F)) (* (sqrt 2.0) (/ -1.0 B_m)))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 2e+191) {
tmp = (sqrt((2.0 * (F * fma(B_m, B_m, ((C * A) * -4.0))))) * -sqrt(((C + A) + hypot((A - C), B_m)))) / (pow(B_m, 2.0) - (C * (A * 4.0)));
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+191) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(Float64(C * A) * -4.0))))) * Float64(-sqrt(Float64(Float64(C + A) + hypot(Float64(A - C), B_m))))) / Float64((B_m ^ 2.0) - Float64(C * Float64(A * 4.0)))); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+191], N[(N[(N[Sqrt[N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{+191}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \mathsf{fma}\left(B_m, B_m, \left(C \cdot A\right) \cdot -4\right)\right)} \cdot \left(-\sqrt{\left(C + A\right) + \mathsf{hypot}\left(A - C, B_m\right)}\right)}{{B_m}^{2} - C \cdot \left(A \cdot 4\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 2.00000000000000015e191Initial program 26.3%
sqrt-prod30.1%
associate-*r*30.1%
associate-*l*30.1%
associate-+l+30.4%
unpow230.4%
unpow230.4%
hypot-def42.7%
Applied egg-rr42.7%
associate-*l*42.7%
*-commutative42.7%
unpow242.7%
fma-neg42.7%
distribute-lft-neg-in42.7%
metadata-eval42.7%
*-commutative42.7%
*-commutative42.7%
associate-+r+42.1%
+-commutative42.1%
Simplified42.1%
if 2.00000000000000015e191 < (pow.f64 B 2) Initial program 4.7%
Taylor expanded in A around 0 2.0%
mul-1-neg2.0%
*-commutative2.0%
distribute-rgt-neg-in2.0%
unpow22.0%
unpow22.0%
hypot-def18.4%
Simplified18.4%
pow1/218.5%
*-commutative18.5%
unpow-prod-down28.8%
pow1/228.8%
pow1/228.8%
Applied egg-rr28.8%
div-inv28.9%
Applied egg-rr28.9%
Final simplification37.2%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (/ (sqrt 2.0) B_m))
(t_2 (- t_1)))
(if (<= (pow B_m 2.0) 5e-318)
(sqrt (/ (- F) A))
(if (<= (pow B_m 2.0) 1.1e-85)
(/ (- (sqrt (* (* t_0 (* 2.0 F)) (+ A A)))) t_0)
(if (<= (pow B_m 2.0) 4e-36)
(/ (* (sqrt 2.0) (- (sqrt (* F (+ A (hypot B_m A)))))) B_m)
(if (<= (pow B_m 2.0) 0.001)
(* t_2 (sqrt (* F (* (/ (pow B_m 2.0) C) -0.5))))
(if (<= (pow B_m 2.0) 2e+97)
(* t_1 (- (sqrt (* F (+ C (hypot B_m C))))))
(* t_2 (* (sqrt F) (sqrt B_m))))))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = sqrt(2.0) / B_m;
double t_2 = -t_1;
double tmp;
if (pow(B_m, 2.0) <= 5e-318) {
tmp = sqrt((-F / A));
} else if (pow(B_m, 2.0) <= 1.1e-85) {
tmp = -sqrt(((t_0 * (2.0 * F)) * (A + A))) / t_0;
} else if (pow(B_m, 2.0) <= 4e-36) {
tmp = (sqrt(2.0) * -sqrt((F * (A + hypot(B_m, A))))) / B_m;
} else if (pow(B_m, 2.0) <= 0.001) {
tmp = t_2 * sqrt((F * ((pow(B_m, 2.0) / C) * -0.5)));
} else if (pow(B_m, 2.0) <= 2e+97) {
tmp = t_1 * -sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = t_2 * (sqrt(F) * sqrt(B_m));
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(sqrt(2.0) / B_m) t_2 = Float64(-t_1) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-318) tmp = sqrt(Float64(Float64(-F) / A)); elseif ((B_m ^ 2.0) <= 1.1e-85) tmp = Float64(Float64(-sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(A + A)))) / t_0); elseif ((B_m ^ 2.0) <= 4e-36) tmp = Float64(Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(A + hypot(B_m, A)))))) / B_m); elseif ((B_m ^ 2.0) <= 0.001) tmp = Float64(t_2 * sqrt(Float64(F * Float64(Float64((B_m ^ 2.0) / C) * -0.5)))); elseif ((B_m ^ 2.0) <= 2e+97) tmp = Float64(t_1 * Float64(-sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(t_2 * Float64(sqrt(F) * sqrt(B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-318], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1.1e-85], N[((-N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-36], N[(N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] / B$95$m), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 0.001], N[(t$95$2 * N[Sqrt[N[(F * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+97], N[(t$95$1 * (-N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(t$95$2 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \frac{\sqrt{2}}{B_m}\\
t_2 := -t_1\\
\mathbf{if}\;{B_m}^{2} \leq 5 \cdot 10^{-318}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;{B_m}^{2} \leq 1.1 \cdot 10^{-85}:\\
\;\;\;\;\frac{-\sqrt{\left(t_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(A + A\right)}}{t_0}\\
\mathbf{elif}\;{B_m}^{2} \leq 4 \cdot 10^{-36}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \left(-\sqrt{F \cdot \left(A + \mathsf{hypot}\left(B_m, A\right)\right)}\right)}{B_m}\\
\mathbf{elif}\;{B_m}^{2} \leq 0.001:\\
\;\;\;\;t_2 \cdot \sqrt{F \cdot \left(\frac{{B_m}^{2}}{C} \cdot -0.5\right)}\\
\mathbf{elif}\;{B_m}^{2} \leq 2 \cdot 10^{+97}:\\
\;\;\;\;t_1 \cdot \left(-\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;t_2 \cdot \left(\sqrt{F} \cdot \sqrt{B_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 4.9999987e-318Initial program 13.1%
add-sqr-sqrt6.1%
sqrt-unprod4.6%
frac-times2.4%
Applied egg-rr3.6%
associate-/l*4.1%
associate-*l*4.1%
*-commutative4.1%
unpow24.1%
fma-neg4.1%
distribute-lft-neg-in4.1%
metadata-eval4.1%
*-commutative4.1%
*-commutative4.1%
Simplified3.2%
Taylor expanded in C around inf 25.7%
mul-1-neg25.7%
Simplified25.7%
if 4.9999987e-318 < (pow.f64 B 2) < 1.1e-85Initial program 34.4%
Simplified44.5%
Taylor expanded in A around inf 38.9%
distribute-rgt1-in38.9%
metadata-eval38.9%
mul0-lft38.9%
Simplified38.9%
if 1.1e-85 < (pow.f64 B 2) < 3.9999999999999998e-36Initial program 46.4%
Taylor expanded in C around 0 10.2%
mul-1-neg10.2%
distribute-rgt-neg-in10.2%
+-commutative10.2%
unpow210.2%
unpow210.2%
hypot-def10.2%
Simplified10.2%
associate-*l/10.2%
Applied egg-rr10.2%
if 3.9999999999999998e-36 < (pow.f64 B 2) < 1e-3Initial program 2.1%
Taylor expanded in A around 0 2.0%
mul-1-neg2.0%
*-commutative2.0%
distribute-rgt-neg-in2.0%
unpow22.0%
unpow22.0%
hypot-def2.8%
Simplified2.8%
Taylor expanded in C around -inf 2.2%
*-commutative2.2%
Simplified2.2%
if 1e-3 < (pow.f64 B 2) < 2.0000000000000001e97Initial program 42.5%
Taylor expanded in A around 0 22.0%
mul-1-neg22.0%
*-commutative22.0%
distribute-rgt-neg-in22.0%
unpow222.0%
unpow222.0%
hypot-def26.5%
Simplified26.5%
if 2.0000000000000001e97 < (pow.f64 B 2) Initial program 8.6%
Taylor expanded in A around 0 4.6%
mul-1-neg4.6%
*-commutative4.6%
distribute-rgt-neg-in4.6%
unpow24.6%
unpow24.6%
hypot-def18.3%
Simplified18.3%
pow1/218.3%
*-commutative18.3%
unpow-prod-down27.0%
pow1/227.0%
pow1/227.0%
Applied egg-rr27.0%
Taylor expanded in C around 0 23.8%
Final simplification25.6%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* (* C A) -4.0))))
(if (<= (pow B_m 2.0) 2e-323)
(sqrt (/ (- F) A))
(if (<= (pow B_m 2.0) 2e+40)
(/ (- (sqrt (* (* 2.0 F) (* t_0 (+ (+ C A) (hypot (- A C) B_m)))))) t_0)
(*
(* (sqrt (+ C (hypot B_m C))) (sqrt F))
(* (sqrt 2.0) (/ -1.0 B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, ((C * A) * -4.0));
double tmp;
if (pow(B_m, 2.0) <= 2e-323) {
tmp = sqrt((-F / A));
} else if (pow(B_m, 2.0) <= 2e+40) {
tmp = -sqrt(((2.0 * F) * (t_0 * ((C + A) + hypot((A - C), B_m))))) / t_0;
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(Float64(C * A) * -4.0)) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-323) tmp = sqrt(Float64(Float64(-F) / A)); elseif ((B_m ^ 2.0) <= 2e+40) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * Float64(t_0 * Float64(Float64(C + A) + hypot(Float64(A - C), B_m)))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-323], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+40], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(t$95$0 * N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, \left(C \cdot A\right) \cdot -4\right)\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-323}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;{B_m}^{2} \leq 2 \cdot 10^{+40}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot F\right) \cdot \left(t_0 \cdot \left(\left(C + A\right) + \mathsf{hypot}\left(A - C, B_m\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.97626e-323Initial program 13.3%
add-sqr-sqrt6.2%
sqrt-unprod4.7%
frac-times2.5%
Applied egg-rr3.5%
associate-/l*4.0%
associate-*l*4.0%
*-commutative4.0%
unpow24.0%
fma-neg4.0%
distribute-lft-neg-in4.0%
metadata-eval4.0%
*-commutative4.0%
*-commutative4.0%
Simplified3.2%
Taylor expanded in C around inf 26.0%
mul-1-neg26.0%
Simplified26.0%
if 1.97626e-323 < (pow.f64 B 2) < 2.00000000000000006e40Initial program 32.5%
neg-sub032.5%
div-sub32.5%
associate-*l*32.5%
Applied egg-rr41.5%
Simplified36.3%
if 2.00000000000000006e40 < (pow.f64 B 2) Initial program 13.0%
Taylor expanded in A around 0 6.5%
mul-1-neg6.5%
*-commutative6.5%
distribute-rgt-neg-in6.5%
unpow26.5%
unpow26.5%
hypot-def19.4%
Simplified19.4%
pow1/219.4%
*-commutative19.4%
unpow-prod-down27.0%
pow1/227.0%
pow1/227.0%
Applied egg-rr27.0%
div-inv27.0%
Applied egg-rr27.0%
Final simplification29.2%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e-323)
(sqrt (/ (- F) A))
(if (<= (pow B_m 2.0) 1e+50)
(/ (- (sqrt (* (* t_0 (* 2.0 F)) (+ A (+ C (hypot B_m (- A C))))))) t_0)
(*
(* (sqrt (+ C (hypot B_m C))) (sqrt F))
(* (sqrt 2.0) (/ -1.0 B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e-323) {
tmp = sqrt((-F / A));
} else if (pow(B_m, 2.0) <= 1e+50) {
tmp = -sqrt(((t_0 * (2.0 * F)) * (A + (C + hypot(B_m, (A - C)))))) / t_0;
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = abs(B) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-323) tmp = sqrt(Float64(Float64(-F) / A)); elseif ((B_m ^ 2.0) <= 1e+50) tmp = Float64(Float64(-sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B_m))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-323], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+50], N[((-N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B_m, B_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-323}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;{B_m}^{2} \leq 10^{+50}:\\
\;\;\;\;\frac{-\sqrt{\left(t_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(A + \left(C + \mathsf{hypot}\left(B_m, A - C\right)\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.97626e-323Initial program 13.3%
add-sqr-sqrt6.2%
sqrt-unprod4.7%
frac-times2.5%
Applied egg-rr3.5%
associate-/l*4.0%
associate-*l*4.0%
*-commutative4.0%
unpow24.0%
fma-neg4.0%
distribute-lft-neg-in4.0%
metadata-eval4.0%
*-commutative4.0%
*-commutative4.0%
Simplified3.2%
Taylor expanded in C around inf 26.0%
mul-1-neg26.0%
Simplified26.0%
if 1.97626e-323 < (pow.f64 B 2) < 1.0000000000000001e50Initial program 32.6%
Simplified42.2%
if 1.0000000000000001e50 < (pow.f64 B 2) Initial program 12.0%
Taylor expanded in A around 0 6.0%
mul-1-neg6.0%
*-commutative6.0%
distribute-rgt-neg-in6.0%
unpow26.0%
unpow26.0%
hypot-def19.3%
Simplified19.3%
pow1/219.4%
*-commutative19.4%
unpow-prod-down27.3%
pow1/227.3%
pow1/227.3%
Applied egg-rr27.3%
div-inv27.3%
Applied egg-rr27.3%
Final simplification31.3%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (pow B_m 2.0) (* C (* A 4.0)))))
(if (<= (pow B_m 2.0) 2e-323)
(sqrt (/ (- F) A))
(if (<= (pow B_m 2.0) 0.2)
(/ (- (sqrt (* (* 2.0 (* F t_0)) (+ A (hypot B_m A))))) t_0)
(*
(* (sqrt (+ C (hypot B_m C))) (sqrt F))
(* (sqrt 2.0) (/ -1.0 B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = pow(B_m, 2.0) - (C * (A * 4.0));
double tmp;
if (pow(B_m, 2.0) <= 2e-323) {
tmp = sqrt((-F / A));
} else if (pow(B_m, 2.0) <= 0.2) {
tmp = -sqrt(((2.0 * (F * t_0)) * (A + hypot(B_m, A)))) / t_0;
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.pow(B_m, 2.0) - (C * (A * 4.0));
double tmp;
if (Math.pow(B_m, 2.0) <= 2e-323) {
tmp = Math.sqrt((-F / A));
} else if (Math.pow(B_m, 2.0) <= 0.2) {
tmp = -Math.sqrt(((2.0 * (F * t_0)) * (A + Math.hypot(B_m, A)))) / t_0;
} else {
tmp = (Math.sqrt((C + Math.hypot(B_m, C))) * Math.sqrt(F)) * (Math.sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): t_0 = math.pow(B_m, 2.0) - (C * (A * 4.0)) tmp = 0 if math.pow(B_m, 2.0) <= 2e-323: tmp = math.sqrt((-F / A)) elif math.pow(B_m, 2.0) <= 0.2: tmp = -math.sqrt(((2.0 * (F * t_0)) * (A + math.hypot(B_m, A)))) / t_0 else: tmp = (math.sqrt((C + math.hypot(B_m, C))) * math.sqrt(F)) * (math.sqrt(2.0) * (-1.0 / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) t_0 = Float64((B_m ^ 2.0) - Float64(C * Float64(A * 4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-323) tmp = sqrt(Float64(Float64(-F) / A)); elseif ((B_m ^ 2.0) <= 0.2) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(F * t_0)) * Float64(A + hypot(B_m, A))))) / t_0); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B_m))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) t_0 = (B_m ^ 2.0) - (C * (A * 4.0)); tmp = 0.0; if ((B_m ^ 2.0) <= 2e-323) tmp = sqrt((-F / A)); elseif ((B_m ^ 2.0) <= 0.2) tmp = -sqrt(((2.0 * (F * t_0)) * (A + hypot(B_m, A)))) / t_0; else tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-323], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 0.2], N[((-N[Sqrt[N[(N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(A + N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := {B_m}^{2} - C \cdot \left(A \cdot 4\right)\\
\mathbf{if}\;{B_m}^{2} \leq 2 \cdot 10^{-323}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;{B_m}^{2} \leq 0.2:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(F \cdot t_0\right)\right) \cdot \left(A + \mathsf{hypot}\left(B_m, A\right)\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B_m}\right)\\
\end{array}
\end{array}
if (pow.f64 B 2) < 1.97626e-323Initial program 13.3%
add-sqr-sqrt6.2%
sqrt-unprod4.7%
frac-times2.5%
Applied egg-rr3.5%
associate-/l*4.0%
associate-*l*4.0%
*-commutative4.0%
unpow24.0%
fma-neg4.0%
distribute-lft-neg-in4.0%
metadata-eval4.0%
*-commutative4.0%
*-commutative4.0%
Simplified3.2%
Taylor expanded in C around inf 26.0%
mul-1-neg26.0%
Simplified26.0%
if 1.97626e-323 < (pow.f64 B 2) < 0.20000000000000001Initial program 32.8%
Taylor expanded in C around 0 31.3%
+-commutative31.3%
unpow231.3%
unpow231.3%
hypot-def34.6%
Simplified34.6%
if 0.20000000000000001 < (pow.f64 B 2) Initial program 13.9%
Taylor expanded in A around 0 7.7%
mul-1-neg7.7%
*-commutative7.7%
distribute-rgt-neg-in7.7%
unpow27.7%
unpow27.7%
hypot-def19.9%
Simplified19.9%
pow1/219.9%
*-commutative19.9%
unpow-prod-down27.1%
pow1/227.1%
pow1/227.1%
Applied egg-rr27.1%
div-inv27.1%
Applied egg-rr27.1%
Final simplification28.6%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 6.3e-299) (sqrt (/ (- F) C)) (* (* (sqrt (+ C (hypot B_m C))) (sqrt F)) (* (sqrt 2.0) (/ -1.0 B_m)))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = sqrt((-F / C));
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = Math.sqrt((-F / C));
} else {
tmp = (Math.sqrt((C + Math.hypot(B_m, C))) * Math.sqrt(F)) * (Math.sqrt(2.0) * (-1.0 / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 6.3e-299: tmp = math.sqrt((-F / C)) else: tmp = (math.sqrt((C + math.hypot(B_m, C))) * math.sqrt(F)) * (math.sqrt(2.0) * (-1.0 / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 6.3e-299) tmp = sqrt(Float64(Float64(-F) / C)); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(sqrt(2.0) * Float64(-1.0 / B_m))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 6.3e-299) tmp = sqrt((-F / C)); else tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * (sqrt(2.0) * (-1.0 / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 6.3e-299], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 6.3 \cdot 10^{-299}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(\sqrt{2} \cdot \frac{-1}{B_m}\right)\\
\end{array}
\end{array}
if F < 6.29999999999999951e-299Initial program 25.4%
add-sqr-sqrt25.3%
sqrt-unprod17.8%
frac-times14.2%
Applied egg-rr20.0%
associate-/l*23.0%
associate-*l*23.0%
*-commutative23.0%
unpow223.0%
fma-neg23.0%
distribute-lft-neg-in23.0%
metadata-eval23.0%
*-commutative23.0%
*-commutative23.0%
Simplified23.0%
Taylor expanded in B around 0 41.0%
mul-1-neg41.0%
Simplified41.0%
if 6.29999999999999951e-299 < F Initial program 17.0%
Taylor expanded in A around 0 7.2%
mul-1-neg7.2%
*-commutative7.2%
distribute-rgt-neg-in7.2%
unpow27.2%
unpow27.2%
hypot-def15.7%
Simplified15.7%
pow1/215.7%
*-commutative15.7%
unpow-prod-down20.2%
pow1/220.2%
pow1/220.2%
Applied egg-rr20.2%
div-inv20.2%
Applied egg-rr20.2%
Final simplification23.2%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 6.3e-299) (sqrt (/ (- F) C)) (* (* (sqrt (+ C (hypot B_m C))) (sqrt F)) (- (/ (sqrt 2.0) B_m)))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = sqrt((-F / C));
} else {
tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * -(sqrt(2.0) / B_m);
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = Math.sqrt((-F / C));
} else {
tmp = (Math.sqrt((C + Math.hypot(B_m, C))) * Math.sqrt(F)) * -(Math.sqrt(2.0) / B_m);
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 6.3e-299: tmp = math.sqrt((-F / C)) else: tmp = (math.sqrt((C + math.hypot(B_m, C))) * math.sqrt(F)) * -(math.sqrt(2.0) / B_m) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 6.3e-299) tmp = sqrt(Float64(Float64(-F) / C)); else tmp = Float64(Float64(sqrt(Float64(C + hypot(B_m, C))) * sqrt(F)) * Float64(-Float64(sqrt(2.0) / B_m))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 6.3e-299) tmp = sqrt((-F / C)); else tmp = (sqrt((C + hypot(B_m, C))) * sqrt(F)) * -(sqrt(2.0) / B_m); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 6.3e-299], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], N[(N[(N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 6.3 \cdot 10^{-299}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{C + \mathsf{hypot}\left(B_m, C\right)} \cdot \sqrt{F}\right) \cdot \left(-\frac{\sqrt{2}}{B_m}\right)\\
\end{array}
\end{array}
if F < 6.29999999999999951e-299Initial program 25.4%
add-sqr-sqrt25.3%
sqrt-unprod17.8%
frac-times14.2%
Applied egg-rr20.0%
associate-/l*23.0%
associate-*l*23.0%
*-commutative23.0%
unpow223.0%
fma-neg23.0%
distribute-lft-neg-in23.0%
metadata-eval23.0%
*-commutative23.0%
*-commutative23.0%
Simplified23.0%
Taylor expanded in B around 0 41.0%
mul-1-neg41.0%
Simplified41.0%
if 6.29999999999999951e-299 < F Initial program 17.0%
Taylor expanded in A around 0 7.2%
mul-1-neg7.2%
*-commutative7.2%
distribute-rgt-neg-in7.2%
unpow27.2%
unpow27.2%
hypot-def15.7%
Simplified15.7%
pow1/215.7%
*-commutative15.7%
unpow-prod-down20.2%
pow1/220.2%
pow1/220.2%
Applied egg-rr20.2%
Final simplification23.2%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m)))
(if (<= B_m 3.55e-228)
(sqrt (/ (- F) A))
(if (<= B_m 2.6e-50)
(sqrt (/ (- F) C))
(if (<= B_m 1.15e+49)
(* t_0 (- (sqrt (* F (+ C (hypot B_m C))))))
(* (- t_0) (* (sqrt F) (sqrt B_m))))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(2.0) / B_m;
double tmp;
if (B_m <= 3.55e-228) {
tmp = sqrt((-F / A));
} else if (B_m <= 2.6e-50) {
tmp = sqrt((-F / C));
} else if (B_m <= 1.15e+49) {
tmp = t_0 * -sqrt((F * (C + hypot(B_m, C))));
} else {
tmp = -t_0 * (sqrt(F) * sqrt(B_m));
}
return tmp;
}
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.sqrt(2.0) / B_m;
double tmp;
if (B_m <= 3.55e-228) {
tmp = Math.sqrt((-F / A));
} else if (B_m <= 2.6e-50) {
tmp = Math.sqrt((-F / C));
} else if (B_m <= 1.15e+49) {
tmp = t_0 * -Math.sqrt((F * (C + Math.hypot(B_m, C))));
} else {
tmp = -t_0 * (Math.sqrt(F) * Math.sqrt(B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): t_0 = math.sqrt(2.0) / B_m tmp = 0 if B_m <= 3.55e-228: tmp = math.sqrt((-F / A)) elif B_m <= 2.6e-50: tmp = math.sqrt((-F / C)) elif B_m <= 1.15e+49: tmp = t_0 * -math.sqrt((F * (C + math.hypot(B_m, C)))) else: tmp = -t_0 * (math.sqrt(F) * math.sqrt(B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) t_0 = Float64(sqrt(2.0) / B_m) tmp = 0.0 if (B_m <= 3.55e-228) tmp = sqrt(Float64(Float64(-F) / A)); elseif (B_m <= 2.6e-50) tmp = sqrt(Float64(Float64(-F) / C)); elseif (B_m <= 1.15e+49) tmp = Float64(t_0 * Float64(-sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(Float64(-t_0) * Float64(sqrt(F) * sqrt(B_m))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) t_0 = sqrt(2.0) / B_m; tmp = 0.0; if (B_m <= 3.55e-228) tmp = sqrt((-F / A)); elseif (B_m <= 2.6e-50) tmp = sqrt((-F / C)); elseif (B_m <= 1.15e+49) tmp = t_0 * -sqrt((F * (C + hypot(B_m, C)))); else tmp = -t_0 * (sqrt(F) * sqrt(B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, If[LessEqual[B$95$m, 3.55e-228], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 2.6e-50], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 1.15e+49], N[(t$95$0 * (-N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[((-t$95$0) * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \frac{\sqrt{2}}{B_m}\\
\mathbf{if}\;B_m \leq 3.55 \cdot 10^{-228}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{elif}\;B_m \leq 2.6 \cdot 10^{-50}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{elif}\;B_m \leq 1.15 \cdot 10^{+49}:\\
\;\;\;\;t_0 \cdot \left(-\sqrt{F \cdot \left(C + \mathsf{hypot}\left(B_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-t_0\right) \cdot \left(\sqrt{F} \cdot \sqrt{B_m}\right)\\
\end{array}
\end{array}
if B < 3.5500000000000003e-228Initial program 18.4%
add-sqr-sqrt4.2%
sqrt-unprod3.4%
frac-times2.0%
Applied egg-rr3.9%
associate-/l*4.2%
associate-*l*4.2%
*-commutative4.2%
unpow24.2%
fma-neg4.2%
distribute-lft-neg-in4.2%
metadata-eval4.2%
*-commutative4.2%
*-commutative4.2%
Simplified3.9%
Taylor expanded in C around inf 11.4%
mul-1-neg11.4%
Simplified11.4%
if 3.5500000000000003e-228 < B < 2.6000000000000001e-50Initial program 24.7%
add-sqr-sqrt17.2%
sqrt-unprod14.2%
frac-times11.7%
Applied egg-rr12.6%
associate-/l*13.0%
associate-*l*13.0%
*-commutative13.0%
unpow213.0%
fma-neg13.0%
distribute-lft-neg-in13.0%
metadata-eval13.0%
*-commutative13.0%
*-commutative13.0%
Simplified12.5%
Taylor expanded in B around 0 23.2%
mul-1-neg23.2%
Simplified23.2%
if 2.6000000000000001e-50 < B < 1.15000000000000001e49Initial program 29.0%
Taylor expanded in A around 0 34.3%
mul-1-neg34.3%
*-commutative34.3%
distribute-rgt-neg-in34.3%
unpow234.3%
unpow234.3%
hypot-def40.3%
Simplified40.3%
if 1.15000000000000001e49 < B Initial program 9.5%
Taylor expanded in A around 0 9.7%
mul-1-neg9.7%
*-commutative9.7%
distribute-rgt-neg-in9.7%
unpow29.7%
unpow29.7%
hypot-def43.0%
Simplified43.0%
pow1/243.0%
*-commutative43.0%
unpow-prod-down64.4%
pow1/264.4%
pow1/264.4%
Applied egg-rr64.4%
Taylor expanded in C around 0 60.3%
Final simplification23.3%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 6.3e-299) (sqrt (/ (- F) C)) (* (- (/ (sqrt 2.0) B_m)) (* (sqrt F) (sqrt B_m)))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = sqrt((-F / C));
} else {
tmp = -(sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m));
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 6.3d-299) then
tmp = sqrt((-f / c))
else
tmp = -(sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt(b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = Math.sqrt((-F / C));
} else {
tmp = -(Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt(B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 6.3e-299: tmp = math.sqrt((-F / C)) else: tmp = -(math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt(B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 6.3e-299) tmp = sqrt(Float64(Float64(-F) / C)); else tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * Float64(sqrt(F) * sqrt(B_m))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 6.3e-299) tmp = sqrt((-F / C)); else tmp = -(sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 6.3e-299], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 6.3 \cdot 10^{-299}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \left(\sqrt{F} \cdot \sqrt{B_m}\right)\\
\end{array}
\end{array}
if F < 6.29999999999999951e-299Initial program 25.4%
add-sqr-sqrt25.3%
sqrt-unprod17.8%
frac-times14.2%
Applied egg-rr20.0%
associate-/l*23.0%
associate-*l*23.0%
*-commutative23.0%
unpow223.0%
fma-neg23.0%
distribute-lft-neg-in23.0%
metadata-eval23.0%
*-commutative23.0%
*-commutative23.0%
Simplified23.0%
Taylor expanded in B around 0 41.0%
mul-1-neg41.0%
Simplified41.0%
if 6.29999999999999951e-299 < F Initial program 17.0%
Taylor expanded in A around 0 7.2%
mul-1-neg7.2%
*-commutative7.2%
distribute-rgt-neg-in7.2%
unpow27.2%
unpow27.2%
hypot-def15.7%
Simplified15.7%
pow1/215.7%
*-commutative15.7%
unpow-prod-down20.2%
pow1/220.2%
pow1/220.2%
Applied egg-rr20.2%
Taylor expanded in C around 0 15.7%
Final simplification19.4%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(if (<= F 6.3e-299)
(sqrt (/ (- F) C))
(if (<= F 2.25e+14)
(* (- (/ (sqrt 2.0) B_m)) (sqrt (* B_m F)))
(* (sqrt 2.0) (- (sqrt (/ F B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = sqrt((-F / C));
} else if (F <= 2.25e+14) {
tmp = -(sqrt(2.0) / B_m) * sqrt((B_m * F));
} else {
tmp = sqrt(2.0) * -sqrt((F / B_m));
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 6.3d-299) then
tmp = sqrt((-f / c))
else if (f <= 2.25d+14) then
tmp = -(sqrt(2.0d0) / b_m) * sqrt((b_m * f))
else
tmp = sqrt(2.0d0) * -sqrt((f / b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 6.3e-299) {
tmp = Math.sqrt((-F / C));
} else if (F <= 2.25e+14) {
tmp = -(Math.sqrt(2.0) / B_m) * Math.sqrt((B_m * F));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 6.3e-299: tmp = math.sqrt((-F / C)) elif F <= 2.25e+14: tmp = -(math.sqrt(2.0) / B_m) * math.sqrt((B_m * F)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 6.3e-299) tmp = sqrt(Float64(Float64(-F) / C)); elseif (F <= 2.25e+14) tmp = Float64(Float64(-Float64(sqrt(2.0) / B_m)) * sqrt(Float64(B_m * F))); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 6.3e-299) tmp = sqrt((-F / C)); elseif (F <= 2.25e+14) tmp = -(sqrt(2.0) / B_m) * sqrt((B_m * F)); else tmp = sqrt(2.0) * -sqrt((F / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 6.3e-299], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], If[LessEqual[F, 2.25e+14], N[((-N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]) * N[Sqrt[N[(B$95$m * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 6.3 \cdot 10^{-299}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{elif}\;F \leq 2.25 \cdot 10^{+14}:\\
\;\;\;\;\left(-\frac{\sqrt{2}}{B_m}\right) \cdot \sqrt{B_m \cdot F}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)\\
\end{array}
\end{array}
if F < 6.29999999999999951e-299Initial program 25.4%
add-sqr-sqrt25.3%
sqrt-unprod17.8%
frac-times14.2%
Applied egg-rr20.0%
associate-/l*23.0%
associate-*l*23.0%
*-commutative23.0%
unpow223.0%
fma-neg23.0%
distribute-lft-neg-in23.0%
metadata-eval23.0%
*-commutative23.0%
*-commutative23.0%
Simplified23.0%
Taylor expanded in B around 0 41.0%
mul-1-neg41.0%
Simplified41.0%
if 6.29999999999999951e-299 < F < 2.25e14Initial program 20.0%
Taylor expanded in A around 0 8.8%
mul-1-neg8.8%
*-commutative8.8%
distribute-rgt-neg-in8.8%
unpow28.8%
unpow28.8%
hypot-def22.8%
Simplified22.8%
Taylor expanded in C around 0 18.2%
if 2.25e14 < F Initial program 13.9%
Taylor expanded in A around 0 5.6%
mul-1-neg5.6%
*-commutative5.6%
distribute-rgt-neg-in5.6%
unpow25.6%
unpow25.6%
hypot-def8.3%
Simplified8.3%
Taylor expanded in C around 0 11.6%
mul-1-neg11.6%
Simplified11.6%
Final simplification18.7%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (<= F 1.25e-212) (sqrt (/ (- F) C)) (* (sqrt 2.0) (- (sqrt (/ F B_m))))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.25e-212) {
tmp = sqrt((-F / C));
} else {
tmp = sqrt(2.0) * -sqrt((F / B_m));
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= 1.25d-212) then
tmp = sqrt((-f / c))
else
tmp = sqrt(2.0d0) * -sqrt((f / b_m))
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= 1.25e-212) {
tmp = Math.sqrt((-F / C));
} else {
tmp = Math.sqrt(2.0) * -Math.sqrt((F / B_m));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if F <= 1.25e-212: tmp = math.sqrt((-F / C)) else: tmp = math.sqrt(2.0) * -math.sqrt((F / B_m)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if (F <= 1.25e-212) tmp = sqrt(Float64(Float64(-F) / C)); else tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F / B_m)))); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if (F <= 1.25e-212) tmp = sqrt((-F / C)); else tmp = sqrt(2.0) * -sqrt((F / B_m)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1.25e-212], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;F \leq 1.25 \cdot 10^{-212}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{\frac{F}{B_m}}\right)\\
\end{array}
\end{array}
if F < 1.25000000000000011e-212Initial program 23.9%
add-sqr-sqrt14.6%
sqrt-unprod10.9%
frac-times8.7%
Applied egg-rr12.5%
associate-/l*14.2%
associate-*l*14.2%
*-commutative14.2%
unpow214.2%
fma-neg14.2%
distribute-lft-neg-in14.2%
metadata-eval14.2%
*-commutative14.2%
*-commutative14.2%
Simplified14.2%
Taylor expanded in B around 0 27.5%
mul-1-neg27.5%
Simplified27.5%
if 1.25000000000000011e-212 < F Initial program 16.3%
Taylor expanded in A around 0 7.3%
mul-1-neg7.3%
*-commutative7.3%
distribute-rgt-neg-in7.3%
unpow27.3%
unpow27.3%
hypot-def15.5%
Simplified15.5%
Taylor expanded in C around 0 11.9%
mul-1-neg11.9%
Simplified11.9%
Final simplification15.9%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (sqrt (/ (- F) A))))
(if (<= B_m 1.6e-228)
t_0
(if (<= B_m 4.1e-32)
(sqrt (/ (- F) C))
(if (<= B_m 7.8e+15) t_0 (/ (* (sqrt (* F C)) (- 2.0)) B_m))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((-F / A));
double tmp;
if (B_m <= 1.6e-228) {
tmp = t_0;
} else if (B_m <= 4.1e-32) {
tmp = sqrt((-F / C));
} else if (B_m <= 7.8e+15) {
tmp = t_0;
} else {
tmp = (sqrt((F * C)) * -2.0) / B_m;
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((-f / a))
if (b_m <= 1.6d-228) then
tmp = t_0
else if (b_m <= 4.1d-32) then
tmp = sqrt((-f / c))
else if (b_m <= 7.8d+15) then
tmp = t_0
else
tmp = (sqrt((f * c)) * -2.0d0) / b_m
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.sqrt((-F / A));
double tmp;
if (B_m <= 1.6e-228) {
tmp = t_0;
} else if (B_m <= 4.1e-32) {
tmp = Math.sqrt((-F / C));
} else if (B_m <= 7.8e+15) {
tmp = t_0;
} else {
tmp = (Math.sqrt((F * C)) * -2.0) / B_m;
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): t_0 = math.sqrt((-F / A)) tmp = 0 if B_m <= 1.6e-228: tmp = t_0 elif B_m <= 4.1e-32: tmp = math.sqrt((-F / C)) elif B_m <= 7.8e+15: tmp = t_0 else: tmp = (math.sqrt((F * C)) * -2.0) / B_m return tmp
B_m = abs(B) function code(A, B_m, C, F) t_0 = sqrt(Float64(Float64(-F) / A)) tmp = 0.0 if (B_m <= 1.6e-228) tmp = t_0; elseif (B_m <= 4.1e-32) tmp = sqrt(Float64(Float64(-F) / C)); elseif (B_m <= 7.8e+15) tmp = t_0; else tmp = Float64(Float64(sqrt(Float64(F * C)) * Float64(-2.0)) / B_m); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) t_0 = sqrt((-F / A)); tmp = 0.0; if (B_m <= 1.6e-228) tmp = t_0; elseif (B_m <= 4.1e-32) tmp = sqrt((-F / C)); elseif (B_m <= 7.8e+15) tmp = t_0; else tmp = (sqrt((F * C)) * -2.0) / B_m; end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 1.6e-228], t$95$0, If[LessEqual[B$95$m, 4.1e-32], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 7.8e+15], t$95$0, N[(N[(N[Sqrt[N[(F * C), $MachinePrecision]], $MachinePrecision] * (-2.0)), $MachinePrecision] / B$95$m), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \sqrt{\frac{-F}{A}}\\
\mathbf{if}\;B_m \leq 1.6 \cdot 10^{-228}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;B_m \leq 4.1 \cdot 10^{-32}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{elif}\;B_m \leq 7.8 \cdot 10^{+15}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot C} \cdot \left(-2\right)}{B_m}\\
\end{array}
\end{array}
if B < 1.60000000000000011e-228 or 4.09999999999999975e-32 < B < 7.8e15Initial program 17.8%
add-sqr-sqrt4.1%
sqrt-unprod3.4%
frac-times1.9%
Applied egg-rr3.8%
associate-/l*4.6%
associate-*l*4.6%
*-commutative4.6%
unpow24.6%
fma-neg4.6%
distribute-lft-neg-in4.6%
metadata-eval4.6%
*-commutative4.6%
*-commutative4.6%
Simplified4.4%
Taylor expanded in C around inf 12.8%
mul-1-neg12.8%
Simplified12.8%
if 1.60000000000000011e-228 < B < 4.09999999999999975e-32Initial program 26.3%
add-sqr-sqrt16.1%
sqrt-unprod13.3%
frac-times11.0%
Applied egg-rr11.8%
associate-/l*12.2%
associate-*l*12.2%
*-commutative12.2%
unpow212.2%
fma-neg12.2%
distribute-lft-neg-in12.2%
metadata-eval12.2%
*-commutative12.2%
*-commutative12.2%
Simplified11.7%
Taylor expanded in B around 0 25.0%
mul-1-neg25.0%
Simplified25.0%
if 7.8e15 < B Initial program 15.2%
Taylor expanded in A around 0 17.1%
mul-1-neg17.1%
*-commutative17.1%
distribute-rgt-neg-in17.1%
unpow217.1%
unpow217.1%
hypot-def46.3%
Simplified46.3%
Taylor expanded in B around 0 10.3%
mul-1-neg10.3%
*-commutative10.3%
*-commutative10.3%
Simplified10.3%
sqrt-pow210.4%
metadata-eval10.4%
metadata-eval10.4%
associate-*r/10.4%
*-commutative10.4%
Applied egg-rr10.4%
Final simplification13.7%
B_m = (fabs.f64 B)
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (sqrt (/ (- F) A))))
(if (<= B_m 2.9e-228)
t_0
(if (<= B_m 6.5e-32)
(sqrt (/ (- F) C))
(if (<= B_m 1.72e+15) t_0 (* (sqrt (* F C)) (/ -2.0 B_m)))))))B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt((-F / A));
double tmp;
if (B_m <= 2.9e-228) {
tmp = t_0;
} else if (B_m <= 6.5e-32) {
tmp = sqrt((-F / C));
} else if (B_m <= 1.72e+15) {
tmp = t_0;
} else {
tmp = sqrt((F * C)) * (-2.0 / B_m);
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((-f / a))
if (b_m <= 2.9d-228) then
tmp = t_0
else if (b_m <= 6.5d-32) then
tmp = sqrt((-f / c))
else if (b_m <= 1.72d+15) then
tmp = t_0
else
tmp = sqrt((f * c)) * ((-2.0d0) / b_m)
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double t_0 = Math.sqrt((-F / A));
double tmp;
if (B_m <= 2.9e-228) {
tmp = t_0;
} else if (B_m <= 6.5e-32) {
tmp = Math.sqrt((-F / C));
} else if (B_m <= 1.72e+15) {
tmp = t_0;
} else {
tmp = Math.sqrt((F * C)) * (-2.0 / B_m);
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): t_0 = math.sqrt((-F / A)) tmp = 0 if B_m <= 2.9e-228: tmp = t_0 elif B_m <= 6.5e-32: tmp = math.sqrt((-F / C)) elif B_m <= 1.72e+15: tmp = t_0 else: tmp = math.sqrt((F * C)) * (-2.0 / B_m) return tmp
B_m = abs(B) function code(A, B_m, C, F) t_0 = sqrt(Float64(Float64(-F) / A)) tmp = 0.0 if (B_m <= 2.9e-228) tmp = t_0; elseif (B_m <= 6.5e-32) tmp = sqrt(Float64(Float64(-F) / C)); elseif (B_m <= 1.72e+15) tmp = t_0; else tmp = Float64(sqrt(Float64(F * C)) * Float64(-2.0 / B_m)); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) t_0 = sqrt((-F / A)); tmp = 0.0; if (B_m <= 2.9e-228) tmp = t_0; elseif (B_m <= 6.5e-32) tmp = sqrt((-F / C)); elseif (B_m <= 1.72e+15) tmp = t_0; else tmp = sqrt((F * C)) * (-2.0 / B_m); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision]
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.9e-228], t$95$0, If[LessEqual[B$95$m, 6.5e-32], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 1.72e+15], t$95$0, N[(N[Sqrt[N[(F * C), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
t_0 := \sqrt{\frac{-F}{A}}\\
\mathbf{if}\;B_m \leq 2.9 \cdot 10^{-228}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;B_m \leq 6.5 \cdot 10^{-32}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\mathbf{elif}\;B_m \leq 1.72 \cdot 10^{+15}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F \cdot C} \cdot \frac{-2}{B_m}\\
\end{array}
\end{array}
if B < 2.9000000000000001e-228 or 6.49999999999999988e-32 < B < 1.72e15Initial program 17.8%
add-sqr-sqrt4.1%
sqrt-unprod3.4%
frac-times1.9%
Applied egg-rr3.8%
associate-/l*4.6%
associate-*l*4.6%
*-commutative4.6%
unpow24.6%
fma-neg4.6%
distribute-lft-neg-in4.6%
metadata-eval4.6%
*-commutative4.6%
*-commutative4.6%
Simplified4.4%
Taylor expanded in C around inf 12.8%
mul-1-neg12.8%
Simplified12.8%
if 2.9000000000000001e-228 < B < 6.49999999999999988e-32Initial program 26.3%
add-sqr-sqrt16.1%
sqrt-unprod13.3%
frac-times11.0%
Applied egg-rr11.8%
associate-/l*12.2%
associate-*l*12.2%
*-commutative12.2%
unpow212.2%
fma-neg12.2%
distribute-lft-neg-in12.2%
metadata-eval12.2%
*-commutative12.2%
*-commutative12.2%
Simplified11.7%
Taylor expanded in B around 0 25.0%
mul-1-neg25.0%
Simplified25.0%
if 1.72e15 < B Initial program 15.2%
Taylor expanded in A around 0 17.1%
mul-1-neg17.1%
*-commutative17.1%
distribute-rgt-neg-in17.1%
unpow217.1%
unpow217.1%
hypot-def46.3%
Simplified46.3%
pow1/246.3%
*-commutative46.3%
unpow-prod-down63.8%
pow1/263.8%
pow1/263.8%
Applied egg-rr63.8%
Taylor expanded in B around 0 10.3%
mul-1-neg10.3%
*-commutative10.3%
distribute-rgt-neg-in10.3%
*-commutative10.3%
mul-1-neg10.3%
unpow210.3%
rem-square-sqrt10.4%
associate-*r/10.4%
metadata-eval10.4%
Simplified10.4%
Final simplification13.7%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (if (or (<= A -2.1e-15) (and (not (<= A -2.8e-236)) (<= A 2.5e-50))) (sqrt (/ (- F) A)) (sqrt (/ (- F) C))))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
double tmp;
if ((A <= -2.1e-15) || (!(A <= -2.8e-236) && (A <= 2.5e-50))) {
tmp = sqrt((-F / A));
} else {
tmp = sqrt((-F / C));
}
return tmp;
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((a <= (-2.1d-15)) .or. (.not. (a <= (-2.8d-236))) .and. (a <= 2.5d-50)) then
tmp = sqrt((-f / a))
else
tmp = sqrt((-f / c))
end if
code = tmp
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
double tmp;
if ((A <= -2.1e-15) || (!(A <= -2.8e-236) && (A <= 2.5e-50))) {
tmp = Math.sqrt((-F / A));
} else {
tmp = Math.sqrt((-F / C));
}
return tmp;
}
B_m = math.fabs(B) def code(A, B_m, C, F): tmp = 0 if (A <= -2.1e-15) or (not (A <= -2.8e-236) and (A <= 2.5e-50)): tmp = math.sqrt((-F / A)) else: tmp = math.sqrt((-F / C)) return tmp
B_m = abs(B) function code(A, B_m, C, F) tmp = 0.0 if ((A <= -2.1e-15) || (!(A <= -2.8e-236) && (A <= 2.5e-50))) tmp = sqrt(Float64(Float64(-F) / A)); else tmp = sqrt(Float64(Float64(-F) / C)); end return tmp end
B_m = abs(B); function tmp_2 = code(A, B_m, C, F) tmp = 0.0; if ((A <= -2.1e-15) || (~((A <= -2.8e-236)) && (A <= 2.5e-50))) tmp = sqrt((-F / A)); else tmp = sqrt((-F / C)); end tmp_2 = tmp; end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := If[Or[LessEqual[A, -2.1e-15], And[N[Not[LessEqual[A, -2.8e-236]], $MachinePrecision], LessEqual[A, 2.5e-50]]], N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[((-F) / C), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
\begin{array}{l}
\mathbf{if}\;A \leq -2.1 \cdot 10^{-15} \lor \neg \left(A \leq -2.8 \cdot 10^{-236}\right) \land A \leq 2.5 \cdot 10^{-50}:\\
\;\;\;\;\sqrt{\frac{-F}{A}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{-F}{C}}\\
\end{array}
\end{array}
if A < -2.09999999999999981e-15 or -2.79999999999999986e-236 < A < 2.49999999999999984e-50Initial program 16.0%
add-sqr-sqrt4.1%
sqrt-unprod3.7%
frac-times2.4%
Applied egg-rr3.6%
associate-/l*4.5%
associate-*l*4.5%
*-commutative4.5%
unpow24.5%
fma-neg4.5%
distribute-lft-neg-in4.5%
metadata-eval4.5%
*-commutative4.5%
*-commutative4.5%
Simplified4.5%
Taylor expanded in C around inf 17.1%
mul-1-neg17.1%
Simplified17.1%
if -2.09999999999999981e-15 < A < -2.79999999999999986e-236 or 2.49999999999999984e-50 < A Initial program 20.5%
add-sqr-sqrt5.2%
sqrt-unprod4.1%
frac-times3.0%
Applied egg-rr4.6%
associate-/l*4.9%
associate-*l*4.9%
*-commutative4.9%
unpow24.9%
fma-neg4.9%
distribute-lft-neg-in4.9%
metadata-eval4.9%
*-commutative4.9%
*-commutative4.9%
Simplified4.4%
Taylor expanded in B around 0 18.3%
mul-1-neg18.3%
Simplified18.3%
Final simplification17.7%
B_m = (fabs.f64 B) (FPCore (A B_m C F) :precision binary64 (sqrt (/ (- F) A)))
B_m = fabs(B);
double code(double A, double B_m, double C, double F) {
return sqrt((-F / A));
}
B_m = abs(B)
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((-f / a))
end function
B_m = Math.abs(B);
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((-F / A));
}
B_m = math.fabs(B) def code(A, B_m, C, F): return math.sqrt((-F / A))
B_m = abs(B) function code(A, B_m, C, F) return sqrt(Float64(Float64(-F) / A)) end
B_m = abs(B); function tmp = code(A, B_m, C, F) tmp = sqrt((-F / A)); end
B_m = N[Abs[B], $MachinePrecision] code[A_, B$95$m_, C_, F_] := N[Sqrt[N[((-F) / A), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
\sqrt{\frac{-F}{A}}
\end{array}
Initial program 18.3%
add-sqr-sqrt4.6%
sqrt-unprod3.9%
frac-times2.7%
Applied egg-rr4.1%
associate-/l*4.7%
associate-*l*4.7%
*-commutative4.7%
unpow24.7%
fma-neg4.7%
distribute-lft-neg-in4.7%
metadata-eval4.7%
*-commutative4.7%
*-commutative4.7%
Simplified4.4%
Taylor expanded in C around inf 12.1%
mul-1-neg12.1%
Simplified12.1%
Final simplification12.1%
herbie shell --seed 2023321
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))