
(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 12 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)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B_m 2.0))))
(t_3 (+ A (- C (hypot B_m (- A C)))))
(t_4 (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= t_2 (- INFINITY))
(- (sqrt (* (/ t_3 (fma -4.0 (* A C) (pow B_m 2.0))) (* 2.0 F))))
(if (<= t_2 -4e-198)
(/ (* (sqrt (* F t_3)) (sqrt (* 2.0 t_4))) (- t_4))
(if (<= t_2 INFINITY)
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (/ (* (pow B_m 2.0) -0.5) C))))))
(- t_0))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
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 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
double t_3 = A + (C - hypot(B_m, (A - C)));
double t_4 = fma(C, (A * -4.0), pow(B_m, 2.0));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = -sqrt(((t_3 / fma(-4.0, (A * C), pow(B_m, 2.0))) * (2.0 * F)));
} else if (t_2 <= -4e-198) {
tmp = (sqrt((F * t_3)) * sqrt((2.0 * t_4))) / -t_4;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + (A + ((pow(B_m, 2.0) * -0.5) / C)))))) / -t_0;
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0))) t_3 = Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) t_4 = fma(C, Float64(A * -4.0), (B_m ^ 2.0)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(-sqrt(Float64(Float64(t_3 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))) * Float64(2.0 * F)))); elseif (t_2 <= -4e-198) tmp = Float64(Float64(sqrt(Float64(F * t_3)) * sqrt(Float64(2.0 * t_4))) / Float64(-t_4)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(Float64((B_m ^ 2.0) * -0.5) / C)))))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], (-N[Sqrt[N[(N[(t$95$3 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$2, -4e-198], N[(N[(N[Sqrt[N[(F * t$95$3), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$4), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$4)), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * -0.5), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
t_3 := A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\\
t_4 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;-\sqrt{\frac{t\_3}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)} \cdot \left(2 \cdot F\right)}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{F \cdot t\_3} \cdot \sqrt{2 \cdot t\_4}}{-t\_4}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + \frac{{B\_m}^{2} \cdot -0.5}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in F around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
associate-/l*24.4%
associate--l+24.4%
unpow224.4%
unpow224.4%
hypot-undefine57.2%
cancel-sign-sub-inv57.2%
Simplified57.2%
Taylor expanded in C around 0 57.2%
*-commutative57.2%
sqrt-prod57.4%
associate-*r/40.3%
associate-+r-39.6%
fma-define39.6%
pow1/239.6%
Applied egg-rr57.4%
unpow1/257.4%
associate-*l*57.4%
Simplified57.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999996e-198Initial program 98.6%
Simplified75.1%
pow1/275.1%
associate-*r*99.4%
unpow-prod-down99.1%
associate-+r-99.1%
hypot-undefine99.1%
unpow299.1%
unpow299.1%
+-commutative99.1%
unpow299.1%
unpow299.1%
hypot-define99.1%
pow1/299.1%
Applied egg-rr99.1%
unpow1/299.1%
associate-+r-99.1%
hypot-undefine99.1%
unpow299.1%
unpow299.1%
+-commutative99.1%
unpow299.1%
unpow299.1%
hypot-undefine99.1%
Simplified99.1%
if -3.9999999999999996e-198 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 26.7%
Simplified34.8%
Taylor expanded in C around inf 34.1%
associate-*r/34.1%
mul-1-neg34.1%
Simplified34.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define23.0%
Simplified23.0%
Final simplification43.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
(t_1 (+ A (- C (hypot B_m (- A C)))))
(t_2 (- t_0))
(t_3 (* (* 4.0 A) C))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_3) F))
(- (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_3 (pow B_m 2.0))))
(t_5 (* F t_0)))
(if (<= t_4 (- INFINITY))
(- (sqrt (* (/ t_1 (fma -4.0 (* A C) (pow B_m 2.0))) (* 2.0 F))))
(if (<= t_4 -4e-198)
(/ (sqrt (* t_5 (* 2.0 t_1))) t_2)
(if (<= t_4 INFINITY)
(/
(sqrt (* t_5 (* 2.0 (+ A (+ A (/ (* (pow B_m 2.0) -0.5) C))))))
t_2)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
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 = A + (C - hypot(B_m, (A - C)));
double t_2 = -t_0;
double t_3 = (4.0 * A) * C;
double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) - sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
double t_5 = F * t_0;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = -sqrt(((t_1 / fma(-4.0, (A * C), pow(B_m, 2.0))) * (2.0 * F)));
} else if (t_4 <= -4e-198) {
tmp = sqrt((t_5 * (2.0 * t_1))) / t_2;
} else if (t_4 <= ((double) INFINITY)) {
tmp = sqrt((t_5 * (2.0 * (A + (A + ((pow(B_m, 2.0) * -0.5) / C)))))) / t_2;
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) t_2 = Float64(-t_0) t_3 = Float64(Float64(4.0 * A) * C) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_3) * F)) * Float64(Float64(A + C) - sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_3 - (B_m ^ 2.0))) t_5 = Float64(F * t_0) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(-sqrt(Float64(Float64(t_1 / fma(-4.0, Float64(A * C), (B_m ^ 2.0))) * Float64(2.0 * F)))); elseif (t_4 <= -4e-198) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * t_1))) / t_2); elseif (t_4 <= Inf) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * Float64(A + Float64(A + Float64(Float64((B_m ^ 2.0) * -0.5) / C)))))) / t_2); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(F * t$95$0), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], (-N[Sqrt[N[(N[(t$95$1 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$4, -4e-198], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * N[(A + N[(A + N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] * -0.5), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\\
t_2 := -t\_0\\
t_3 := \left(4 \cdot A\right) \cdot C\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_3\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3 - {B\_m}^{2}}\\
t_5 := F \cdot t\_0\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;-\sqrt{\frac{t\_1}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)} \cdot \left(2 \cdot F\right)}\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot t\_1\right)}}{t\_2}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot \left(A + \left(A + \frac{{B\_m}^{2} \cdot -0.5}{C}\right)\right)\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in F around 0 13.1%
mul-1-neg13.1%
*-commutative13.1%
associate-/l*24.4%
associate--l+24.4%
unpow224.4%
unpow224.4%
hypot-undefine57.2%
cancel-sign-sub-inv57.2%
Simplified57.2%
Taylor expanded in C around 0 57.2%
*-commutative57.2%
sqrt-prod57.4%
associate-*r/40.3%
associate-+r-39.6%
fma-define39.6%
pow1/239.6%
Applied egg-rr57.4%
unpow1/257.4%
associate-*l*57.4%
Simplified57.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.9999999999999996e-198Initial program 98.6%
Simplified98.6%
if -3.9999999999999996e-198 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 26.7%
Simplified34.8%
Taylor expanded in C around inf 34.1%
associate-*r/34.1%
mul-1-neg34.1%
Simplified34.1%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around 0 1.9%
mul-1-neg1.9%
+-commutative1.9%
unpow21.9%
unpow21.9%
hypot-define23.0%
Simplified23.0%
Final simplification43.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-189)
(/
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= (pow B_m 2.0) 2e+257)
(-
(sqrt
(*
(/ (+ A (- C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0)))
(* 2.0 F))))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-189) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else if (pow(B_m, 2.0) <= 2e+257) {
tmp = -sqrt((((A + (C - hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))) * (2.0 * F)));
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-189) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); elseif ((B_m ^ 2.0) <= 2e+257) tmp = Float64(-sqrt(Float64(Float64(Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))) * Float64(2.0 * F)))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-189], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+257], (-N[Sqrt[N[(N[(N[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-189}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+257}:\\
\;\;\;\;-\sqrt{\frac{A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)} \cdot \left(2 \cdot F\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-189Initial program 26.8%
Simplified31.7%
Taylor expanded in C around inf 26.8%
associate-*r*27.9%
*-commutative27.9%
mul-1-neg27.9%
Simplified27.9%
if 4.00000000000000027e-189 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000006e257Initial program 31.3%
Taylor expanded in F around 0 32.8%
mul-1-neg32.8%
*-commutative32.8%
associate-/l*38.5%
associate--l+38.5%
unpow238.5%
unpow238.5%
hypot-undefine50.8%
cancel-sign-sub-inv50.8%
Simplified50.8%
Taylor expanded in C around 0 50.8%
*-commutative50.8%
sqrt-prod51.0%
associate-*r/42.2%
associate-+r-42.2%
fma-define42.2%
pow1/242.2%
Applied egg-rr51.0%
unpow1/251.0%
associate-*l*51.0%
Simplified51.0%
if 2.00000000000000006e257 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.0%
Taylor expanded in C around 0 8.3%
mul-1-neg8.3%
+-commutative8.3%
unpow28.3%
unpow28.3%
hypot-define37.6%
Simplified37.6%
Final simplification39.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= (pow B_m 2.0) 2e+61)
(/
(sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 A)))
(- t_0 (pow B_m 2.0)))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (pow(B_m, 2.0) <= 2e+61) {
tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if (Math.pow(B_m, 2.0) <= 2e+61) {
tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
} else {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (A - Math.hypot(B_m, A))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): t_0 = (4.0 * A) * C tmp = 0 if math.pow(B_m, 2.0) <= 2e+61: tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0)) else: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (A - math.hypot(B_m, A)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if ((B_m ^ 2.0) <= 2e+61) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
t_0 = (4.0 * A) * C;
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e+61)
tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
else
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+61], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+61}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e61Initial program 30.2%
Taylor expanded in A around -inf 21.5%
if 1.9999999999999999e61 < (pow.f64 B #s(literal 2 binary64)) Initial program 11.6%
Taylor expanded in C around 0 13.6%
mul-1-neg13.6%
+-commutative13.6%
unpow213.6%
unpow213.6%
hypot-define33.4%
Simplified33.4%
Final simplification27.0%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-189)
(/
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-189) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-189) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); else tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-189], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-189}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000027e-189Initial program 26.8%
Simplified31.7%
Taylor expanded in C around inf 26.8%
associate-*r*27.9%
*-commutative27.9%
mul-1-neg27.9%
Simplified27.9%
if 4.00000000000000027e-189 < (pow.f64 B #s(literal 2 binary64)) Initial program 19.0%
Taylor expanded in C around 0 13.9%
mul-1-neg13.9%
+-commutative13.9%
unpow213.9%
unpow213.9%
hypot-define27.8%
Simplified27.8%
Final simplification27.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 5.4e-81)
(* (sqrt 2.0) (- (sqrt (* -0.5 (/ F C)))))
(if (<= B_m 5.6e+230)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A (hypot B_m A))))))
(- (sqrt (* F (* 2.0 (/ -1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 5.4e-81) {
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
} else if (B_m <= 5.6e+230) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
} else {
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 5.4e-81) {
tmp = Math.sqrt(2.0) * -Math.sqrt((-0.5 * (F / C)));
} else if (B_m <= 5.6e+230) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (A - Math.hypot(B_m, A))));
} else {
tmp = -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 5.4e-81: tmp = math.sqrt(2.0) * -math.sqrt((-0.5 * (F / C))) elif B_m <= 5.6e+230: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (A - math.hypot(B_m, A)))) else: tmp = -math.sqrt((F * (2.0 * (-1.0 / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 5.4e-81) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(-0.5 * Float64(F / C))))); elseif (B_m <= 5.6e+230) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - hypot(B_m, A)))))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 5.4e-81)
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
elseif (B_m <= 5.6e+230)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - hypot(B_m, A))));
else
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 5.4e-81], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+230], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 5.4 \cdot 10^{-81}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{-0.5 \cdot \frac{F}{C}}\right)\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+230}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}\\
\end{array}
\end{array}
if B < 5.39999999999999979e-81Initial program 22.5%
Simplified26.7%
sqrt-prod1.2%
*-commutative1.2%
associate-+r-0.8%
hypot-undefine0.6%
unpow20.6%
unpow20.6%
+-commutative0.6%
unpow20.6%
unpow20.6%
hypot-define0.8%
Applied egg-rr0.8%
fma-undefine0.8%
associate-*r*0.8%
*-commutative0.8%
unpow20.8%
+-commutative0.8%
fma-define0.8%
*-commutative0.8%
associate-+r-1.2%
hypot-undefine0.8%
unpow20.8%
unpow20.8%
+-commutative0.8%
unpow20.8%
unpow20.8%
hypot-undefine1.2%
Simplified1.2%
Taylor expanded in F around 0 15.8%
mul-1-neg15.8%
unpow215.8%
unpow215.8%
hypot-undefine23.3%
fma-define23.3%
Simplified23.3%
Taylor expanded in A around -inf 12.4%
if 5.39999999999999979e-81 < B < 5.6000000000000004e230Initial program 23.8%
Taylor expanded in C around 0 26.5%
mul-1-neg26.5%
+-commutative26.5%
unpow226.5%
unpow226.5%
hypot-define47.9%
Simplified47.9%
if 5.6000000000000004e230 < B Initial program 0.0%
Taylor expanded in F around 0 0.0%
mul-1-neg0.0%
*-commutative0.0%
associate-/l*0.0%
associate--l+0.0%
unpow20.0%
unpow20.0%
hypot-undefine4.0%
cancel-sign-sub-inv4.0%
Simplified4.0%
Taylor expanded in B around inf 86.0%
*-commutative86.0%
pow1/286.0%
pow1/286.0%
pow-prod-down86.4%
Applied egg-rr86.4%
unpow1/286.4%
associate-*l*86.4%
Simplified86.4%
Final simplification27.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.1e+55)
(* (sqrt 2.0) (- (sqrt (* -0.5 (/ F C)))))
(if (<= B_m 1.35e+209)
(* (/ (sqrt 2.0) B_m) (- (sqrt (* F (- A B_m)))))
(- (sqrt (* F (* 2.0 (/ -1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.1e+55) {
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
} else if (B_m <= 1.35e+209) {
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - B_m)));
} else {
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 (b_m <= 4.1d+55) then
tmp = sqrt(2.0d0) * -sqrt(((-0.5d0) * (f / c)))
else if (b_m <= 1.35d+209) then
tmp = (sqrt(2.0d0) / b_m) * -sqrt((f * (a - b_m)))
else
tmp = -sqrt((f * (2.0d0 * ((-1.0d0) / b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.1e+55) {
tmp = Math.sqrt(2.0) * -Math.sqrt((-0.5 * (F / C)));
} else if (B_m <= 1.35e+209) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt((F * (A - B_m)));
} else {
tmp = -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4.1e+55: tmp = math.sqrt(2.0) * -math.sqrt((-0.5 * (F / C))) elif B_m <= 1.35e+209: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt((F * (A - B_m))) else: tmp = -math.sqrt((F * (2.0 * (-1.0 / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.1e+55) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(-0.5 * Float64(F / C))))); elseif (B_m <= 1.35e+209) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(Float64(F * Float64(A - B_m))))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4.1e+55)
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
elseif (B_m <= 1.35e+209)
tmp = (sqrt(2.0) / B_m) * -sqrt((F * (A - B_m)));
else
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.1e+55], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.35e+209], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.1 \cdot 10^{+55}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{-0.5 \cdot \frac{F}{C}}\right)\\
\mathbf{elif}\;B\_m \leq 1.35 \cdot 10^{+209}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{F \cdot \left(A - B\_m\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}\\
\end{array}
\end{array}
if B < 4.09999999999999981e55Initial program 23.5%
Simplified28.6%
sqrt-prod1.1%
*-commutative1.1%
associate-+r-0.7%
hypot-undefine0.5%
unpow20.5%
unpow20.5%
+-commutative0.5%
unpow20.5%
unpow20.5%
hypot-define0.7%
Applied egg-rr0.7%
fma-undefine0.7%
associate-*r*0.7%
*-commutative0.7%
unpow20.7%
+-commutative0.7%
fma-define0.7%
*-commutative0.7%
associate-+r-1.1%
hypot-undefine0.6%
unpow20.6%
unpow20.6%
+-commutative0.6%
unpow20.6%
unpow20.6%
hypot-undefine1.1%
Simplified1.1%
Taylor expanded in F around 0 18.1%
mul-1-neg18.1%
unpow218.1%
unpow218.1%
hypot-undefine25.4%
fma-define25.4%
Simplified25.4%
Taylor expanded in A around -inf 13.7%
if 4.09999999999999981e55 < B < 1.35e209Initial program 23.2%
Taylor expanded in B around inf 23.1%
Taylor expanded in C around 0 63.5%
mul-1-neg63.5%
Simplified63.5%
if 1.35e209 < B Initial program 0.0%
Taylor expanded in F around 0 0.0%
mul-1-neg0.0%
*-commutative0.0%
associate-/l*0.0%
associate--l+0.0%
unpow20.0%
unpow20.0%
hypot-undefine4.2%
cancel-sign-sub-inv4.2%
Simplified4.2%
Taylor expanded in B around inf 74.6%
*-commutative74.6%
pow1/274.6%
pow1/274.6%
pow-prod-down74.9%
Applied egg-rr74.9%
unpow1/274.9%
associate-*l*74.9%
Simplified74.9%
Final simplification26.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.6e+56)
(* (sqrt 2.0) (- (sqrt (* -0.5 (/ F C)))))
(if (<= B_m 1.55e+206)
(* (sqrt (* F (- B_m))) (/ (sqrt 2.0) (- B_m)))
(- (sqrt (* F (* 2.0 (/ -1.0 B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.6e+56) {
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
} else if (B_m <= 1.55e+206) {
tmp = sqrt((F * -B_m)) * (sqrt(2.0) / -B_m);
} else {
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 (b_m <= 3.6d+56) then
tmp = sqrt(2.0d0) * -sqrt(((-0.5d0) * (f / c)))
else if (b_m <= 1.55d+206) then
tmp = sqrt((f * -b_m)) * (sqrt(2.0d0) / -b_m)
else
tmp = -sqrt((f * (2.0d0 * ((-1.0d0) / b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.6e+56) {
tmp = Math.sqrt(2.0) * -Math.sqrt((-0.5 * (F / C)));
} else if (B_m <= 1.55e+206) {
tmp = Math.sqrt((F * -B_m)) * (Math.sqrt(2.0) / -B_m);
} else {
tmp = -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 3.6e+56: tmp = math.sqrt(2.0) * -math.sqrt((-0.5 * (F / C))) elif B_m <= 1.55e+206: tmp = math.sqrt((F * -B_m)) * (math.sqrt(2.0) / -B_m) else: tmp = -math.sqrt((F * (2.0 * (-1.0 / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.6e+56) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(-0.5 * Float64(F / C))))); elseif (B_m <= 1.55e+206) tmp = Float64(sqrt(Float64(F * Float64(-B_m))) * Float64(sqrt(2.0) / Float64(-B_m))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 3.6e+56)
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
elseif (B_m <= 1.55e+206)
tmp = sqrt((F * -B_m)) * (sqrt(2.0) / -B_m);
else
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.6e+56], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.55e+206], N[(N[Sqrt[N[(F * (-B$95$m)), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.6 \cdot 10^{+56}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{-0.5 \cdot \frac{F}{C}}\right)\\
\mathbf{elif}\;B\_m \leq 1.55 \cdot 10^{+206}:\\
\;\;\;\;\sqrt{F \cdot \left(-B\_m\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}\\
\end{array}
\end{array}
if B < 3.59999999999999998e56Initial program 23.5%
Simplified28.6%
sqrt-prod1.1%
*-commutative1.1%
associate-+r-0.7%
hypot-undefine0.5%
unpow20.5%
unpow20.5%
+-commutative0.5%
unpow20.5%
unpow20.5%
hypot-define0.7%
Applied egg-rr0.7%
fma-undefine0.7%
associate-*r*0.7%
*-commutative0.7%
unpow20.7%
+-commutative0.7%
fma-define0.7%
*-commutative0.7%
associate-+r-1.1%
hypot-undefine0.6%
unpow20.6%
unpow20.6%
+-commutative0.6%
unpow20.6%
unpow20.6%
hypot-undefine1.1%
Simplified1.1%
Taylor expanded in F around 0 18.1%
mul-1-neg18.1%
unpow218.1%
unpow218.1%
hypot-undefine25.4%
fma-define25.4%
Simplified25.4%
Taylor expanded in A around -inf 13.7%
if 3.59999999999999998e56 < B < 1.54999999999999995e206Initial program 23.2%
Taylor expanded in A around 0 32.0%
mul-1-neg32.0%
unpow232.0%
unpow232.0%
hypot-define65.3%
Simplified65.3%
Taylor expanded in C around 0 63.1%
associate-*r*63.1%
mul-1-neg63.1%
Simplified63.1%
if 1.54999999999999995e206 < B Initial program 0.0%
Taylor expanded in F around 0 0.0%
mul-1-neg0.0%
*-commutative0.0%
associate-/l*0.0%
associate--l+0.0%
unpow20.0%
unpow20.0%
hypot-undefine4.2%
cancel-sign-sub-inv4.2%
Simplified4.2%
Taylor expanded in B around inf 74.6%
*-commutative74.6%
pow1/274.6%
pow1/274.6%
pow-prod-down74.9%
Applied egg-rr74.9%
unpow1/274.9%
associate-*l*74.9%
Simplified74.9%
Final simplification26.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 4e+65) (* (sqrt (* F (/ -0.5 C))) (- (sqrt 2.0))) (- (sqrt (* F (* 2.0 (/ -1.0 B_m)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4e+65) {
tmp = sqrt((F * (-0.5 / C))) * -sqrt(2.0);
} else {
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 (b_m <= 4d+65) then
tmp = sqrt((f * ((-0.5d0) / c))) * -sqrt(2.0d0)
else
tmp = -sqrt((f * (2.0d0 * ((-1.0d0) / b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4e+65) {
tmp = Math.sqrt((F * (-0.5 / C))) * -Math.sqrt(2.0);
} else {
tmp = -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4e+65: tmp = math.sqrt((F * (-0.5 / C))) * -math.sqrt(2.0) else: tmp = -math.sqrt((F * (2.0 * (-1.0 / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4e+65) tmp = Float64(sqrt(Float64(F * Float64(-0.5 / C))) * Float64(-sqrt(2.0))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4e+65)
tmp = sqrt((F * (-0.5 / C))) * -sqrt(2.0);
else
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4e+65], N[(N[Sqrt[N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4 \cdot 10^{+65}:\\
\;\;\;\;\sqrt{F \cdot \frac{-0.5}{C}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}\\
\end{array}
\end{array}
if B < 4e65Initial program 23.8%
Taylor expanded in F around 0 18.0%
mul-1-neg18.0%
*-commutative18.0%
associate-/l*19.7%
associate--l+20.0%
unpow220.0%
unpow220.0%
hypot-undefine29.1%
cancel-sign-sub-inv29.1%
Simplified29.1%
Taylor expanded in A around -inf 13.6%
if 4e65 < B Initial program 14.2%
Taylor expanded in F around 0 11.1%
mul-1-neg11.1%
*-commutative11.1%
associate-/l*16.0%
associate--l+16.0%
unpow216.0%
unpow216.0%
hypot-undefine22.3%
cancel-sign-sub-inv22.3%
Simplified22.3%
Taylor expanded in B around inf 55.7%
*-commutative55.7%
pow1/255.7%
pow1/255.7%
pow-prod-down55.8%
Applied egg-rr55.8%
unpow1/255.8%
associate-*l*55.8%
Simplified55.8%
Final simplification23.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= B_m 7.2e+65) (* (sqrt 2.0) (- (sqrt (* -0.5 (/ F C))))) (- (sqrt (* F (* 2.0 (/ -1.0 B_m)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.2e+65) {
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
} else {
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 (b_m <= 7.2d+65) then
tmp = sqrt(2.0d0) * -sqrt(((-0.5d0) * (f / c)))
else
tmp = -sqrt((f * (2.0d0 * ((-1.0d0) / b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 7.2e+65) {
tmp = Math.sqrt(2.0) * -Math.sqrt((-0.5 * (F / C)));
} else {
tmp = -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 7.2e+65: tmp = math.sqrt(2.0) * -math.sqrt((-0.5 * (F / C))) else: tmp = -math.sqrt((F * (2.0 * (-1.0 / B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 7.2e+65) tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(-0.5 * Float64(F / C))))); else tmp = Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 7.2e+65)
tmp = sqrt(2.0) * -sqrt((-0.5 * (F / C)));
else
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 7.2e+65], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(-0.5 * N[(F / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 7.2 \cdot 10^{+65}:\\
\;\;\;\;\sqrt{2} \cdot \left(-\sqrt{-0.5 \cdot \frac{F}{C}}\right)\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}\\
\end{array}
\end{array}
if B < 7.19999999999999957e65Initial program 23.8%
Simplified28.8%
sqrt-prod1.1%
*-commutative1.1%
associate-+r-0.7%
hypot-undefine0.5%
unpow20.5%
unpow20.5%
+-commutative0.5%
unpow20.5%
unpow20.5%
hypot-define0.7%
Applied egg-rr0.7%
fma-undefine0.7%
associate-*r*0.7%
*-commutative0.7%
unpow20.7%
+-commutative0.7%
fma-define0.7%
*-commutative0.7%
associate-+r-1.1%
hypot-undefine0.7%
unpow20.7%
unpow20.7%
+-commutative0.7%
unpow20.7%
unpow20.7%
hypot-undefine1.1%
Simplified1.1%
Taylor expanded in F around 0 18.0%
mul-1-neg18.0%
unpow218.0%
unpow218.0%
hypot-undefine25.2%
fma-define25.2%
Simplified25.2%
Taylor expanded in A around -inf 13.7%
if 7.19999999999999957e65 < B Initial program 14.2%
Taylor expanded in F around 0 11.1%
mul-1-neg11.1%
*-commutative11.1%
associate-/l*16.0%
associate--l+16.0%
unpow216.0%
unpow216.0%
hypot-undefine22.3%
cancel-sign-sub-inv22.3%
Simplified22.3%
Taylor expanded in B around inf 55.7%
*-commutative55.7%
pow1/255.7%
pow1/255.7%
pow-prod-down55.8%
Applied egg-rr55.8%
unpow1/255.8%
associate-*l*55.8%
Simplified55.8%
Final simplification23.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (pow (* 2.0 (* F (/ -1.0 B_m))) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -pow((2.0 * (F * (-1.0 / B_m))), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 = -((2.0d0 * (f * ((-1.0d0) / b_m))) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.pow((2.0 * (F * (-1.0 / B_m))), 0.5);
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.pow((2.0 * (F * (-1.0 / B_m))), 0.5)
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-(Float64(2.0 * Float64(F * Float64(-1.0 / B_m))) ^ 0.5)) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -((2.0 * (F * (-1.0 / B_m))) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Power[N[(2.0 * N[(F * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \left(F \cdot \frac{-1}{B\_m}\right)\right)}^{0.5}
\end{array}
Initial program 21.7%
Taylor expanded in F around 0 16.4%
mul-1-neg16.4%
*-commutative16.4%
associate-/l*18.9%
associate--l+19.1%
unpow219.1%
unpow219.1%
hypot-undefine27.6%
cancel-sign-sub-inv27.6%
Simplified27.6%
Taylor expanded in B around inf 17.6%
*-commutative17.6%
pow1/217.8%
pow1/217.8%
pow-prod-down17.8%
Applied egg-rr17.8%
Final simplification17.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* F (* 2.0 (/ -1.0 B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((F * (2.0 * (-1.0 / B_m))));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
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 * (2.0d0 * ((-1.0d0) / b_m))))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((F * (2.0 * (-1.0 / B_m))));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((F * (2.0 * (-1.0 / B_m))))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(F * Float64(2.0 * Float64(-1.0 / B_m))))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((F * (2.0 * (-1.0 / B_m))));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(F * N[(2.0 * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{F \cdot \left(2 \cdot \frac{-1}{B\_m}\right)}
\end{array}
Initial program 21.7%
Taylor expanded in F around 0 16.4%
mul-1-neg16.4%
*-commutative16.4%
associate-/l*18.9%
associate--l+19.1%
unpow219.1%
unpow219.1%
hypot-undefine27.6%
cancel-sign-sub-inv27.6%
Simplified27.6%
Taylor expanded in B around inf 17.6%
*-commutative17.6%
pow1/217.8%
pow1/217.8%
pow-prod-down17.8%
Applied egg-rr17.8%
unpow1/217.7%
associate-*l*17.7%
Simplified17.7%
Final simplification17.7%
herbie shell --seed 2024079
(FPCore (A B C F)
:name "ABCF->ab-angle b"
: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))))