
(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 14 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 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B_m 2.0) t_2) F))
(+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B_m 2.0))))
(t_4
(/
(* (sqrt (* 2.0 (* F t_0))) (sqrt (+ A (+ C (hypot (- A C) B_m)))))
t_1)))
(if (<= t_3 (- INFINITY))
(/ (sqrt F) (- (sqrt (- A))))
(if (<= t_3 -1e-201)
t_4
(if (<= t_3 0.0)
(/ (* (sqrt (* A -4.0)) (sqrt (* (* C F) (* 4.0 C)))) t_1)
(if (<= t_3 INFINITY) t_4 (/ (sqrt (* 2.0 F)) (- (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_2) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B_m, 2.0));
double t_4 = (sqrt((2.0 * (F * t_0))) * sqrt((A + (C + hypot((A - C), B_m))))) / t_1;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt(F) / -sqrt(-A);
} else if (t_3 <= -1e-201) {
tmp = t_4;
} else if (t_3 <= 0.0) {
tmp = (sqrt((A * -4.0)) * sqrt(((C * F) * (4.0 * C)))) / t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = t_4;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B_m ^ 2.0))) t_4 = Float64(Float64(sqrt(Float64(2.0 * Float64(F * t_0))) * sqrt(Float64(A + Float64(C + hypot(Float64(A - C), B_m))))) / t_1) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(F) / Float64(-sqrt(Float64(-A)))); elseif (t_3 <= -1e-201) tmp = t_4; elseif (t_3 <= 0.0) tmp = Float64(Float64(sqrt(Float64(A * -4.0)) * sqrt(Float64(Float64(C * F) * Float64(4.0 * C)))) / t_1); elseif (t_3 <= Inf) tmp = t_4; else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $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$2 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[Sqrt[N[(2.0 * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A + N[(C + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[(-A)], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -1e-201], t$95$4, If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(A * -4.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(C * F), $MachinePrecision] * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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 := -t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B\_m}^{2}}\\
t_4 := \frac{\sqrt{2 \cdot \left(F \cdot t\_0\right)} \cdot \sqrt{A + \left(C + \mathsf{hypot}\left(A - C, B\_m\right)\right)}}{t\_1}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{F}}{-\sqrt{-A}}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-201}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;\frac{\sqrt{A \cdot -4} \cdot \sqrt{\left(C \cdot F\right) \cdot \left(4 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;t\_4\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\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.0%
Taylor expanded in F around 0 15.7%
Simplified48.7%
*-commutative48.7%
pow1/248.7%
pow1/248.7%
pow-prod-down49.0%
+-commutative49.0%
+-commutative49.0%
*-commutative49.0%
Applied egg-rr49.0%
unpow1/249.0%
Simplified49.0%
Taylor expanded in A around -inf 32.3%
mul-1-neg32.3%
Simplified32.3%
distribute-neg-frac232.3%
sqrt-div42.7%
Applied egg-rr42.7%
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))) < -9.99999999999999946e-202 or -0.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))) < +inf.0Initial program 75.9%
Simplified83.8%
associate-*r*83.8%
associate-+r+83.8%
hypot-undefine75.9%
unpow275.9%
unpow275.9%
+-commutative75.9%
sqrt-prod76.0%
*-commutative76.0%
associate-+l+76.0%
Applied egg-rr93.5%
if -9.99999999999999946e-202 < (/.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))) < -0.0Initial program 21.9%
Simplified21.8%
Taylor expanded in B around 0 22.0%
associate-*r*22.0%
Simplified22.0%
Taylor expanded in A around -inf 35.8%
pow1/235.8%
associate-*l*38.9%
unpow-prod-down40.4%
pow1/240.4%
*-commutative40.4%
associate-*r*40.4%
metadata-eval40.4%
Applied egg-rr40.4%
unpow1/240.4%
Simplified40.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))) Initial program 0.0%
Taylor expanded in B around inf 13.5%
mul-1-neg13.5%
*-commutative13.5%
Simplified13.5%
sqrt-div20.0%
Applied egg-rr20.0%
associate-*r/19.9%
pow1/219.9%
pow1/219.9%
pow-prod-down20.0%
*-commutative20.0%
pow1/220.0%
*-commutative20.0%
Applied egg-rr20.0%
Final simplification41.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) 9e+55)
(/
(pow (* (fma B_m B_m (* -4.0 (* A C))) (* F (* 4.0 C))) 0.5)
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 1e+293)
(*
(sqrt
(/
(* 2.0 (+ A (+ C (hypot B_m (- A C)))))
(fma -4.0 (* A C) (pow B_m 2.0))))
(- (sqrt F)))
(/ (sqrt (* 2.0 F)) (- (sqrt 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 (pow(B_m, 2.0) <= 9e+55) {
tmp = pow((fma(B_m, B_m, (-4.0 * (A * C))) * (F * (4.0 * C))), 0.5) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (pow(B_m, 2.0) <= 1e+293) {
tmp = sqrt(((2.0 * (A + (C + hypot(B_m, (A - C))))) / fma(-4.0, (A * C), pow(B_m, 2.0)))) * -sqrt(F);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 ^ 2.0) <= 9e+55) tmp = Float64((Float64(fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) * Float64(F * Float64(4.0 * C))) ^ 0.5) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif ((B_m ^ 2.0) <= 1e+293) tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(A + Float64(C + hypot(B_m, Float64(A - C))))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))) * Float64(-sqrt(F))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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], 9e+55], N[(N[Power[N[(N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+293], N[(N[Sqrt[N[(N[(2.0 * N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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 9 \cdot 10^{+55}:\\
\;\;\;\;\frac{{\left(\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right) \cdot \left(F \cdot \left(4 \cdot C\right)\right)\right)}^{0.5}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 10^{+293}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{F}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 8.99999999999999996e55Initial program 23.2%
Simplified33.8%
Taylor expanded in A around -inf 30.6%
*-commutative30.6%
Simplified30.6%
pow1/230.6%
associate-*l*30.0%
associate-*r*30.0%
Applied egg-rr30.0%
if 8.99999999999999996e55 < (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999992e292Initial program 33.3%
Taylor expanded in F around 0 32.0%
Simplified57.6%
*-commutative57.6%
pow1/257.6%
pow1/257.6%
pow-prod-down57.8%
+-commutative57.8%
+-commutative57.8%
*-commutative57.8%
Applied egg-rr57.8%
unpow1/257.8%
Simplified57.8%
pow1/257.8%
associate-*l*57.8%
unpow-prod-down60.2%
pow1/260.2%
Applied egg-rr60.2%
unpow1/260.2%
associate-*l/60.2%
+-commutative60.2%
hypot-undefine49.5%
unpow249.5%
unpow249.5%
associate-+r+49.4%
unpow249.4%
unpow249.4%
hypot-undefine60.1%
Simplified60.1%
if 9.9999999999999992e292 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in B around inf 22.5%
mul-1-neg22.5%
*-commutative22.5%
Simplified22.5%
sqrt-div34.0%
Applied egg-rr34.0%
associate-*r/33.8%
pow1/233.8%
pow1/233.8%
pow-prod-down34.0%
*-commutative34.0%
pow1/234.0%
*-commutative34.0%
Applied egg-rr34.0%
Final simplification36.6%
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)))))
(if (<= (pow B_m 2.0) 2e-77)
(/ (sqrt (* (* 4.0 C) (* F t_0))) (- t_0))
(if (<= (pow B_m 2.0) 5e+166)
(-
(sqrt
(*
2.0
(*
F
(/
(+ (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))))
(/ (sqrt (* 2.0 F)) (- (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 2e-77) {
tmp = sqrt(((4.0 * C) * (F * t_0))) / -t_0;
} else if (pow(B_m, 2.0) <= 5e+166) {
tmp = -sqrt((2.0 * (F * (((A + C) + hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-77) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(F * t_0))) / Float64(-t_0)); elseif ((B_m ^ 2.0) <= 5e+166) tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) + hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-77], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+166], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-77}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+166}:\\
\;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) + \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e-77Initial program 21.9%
Simplified31.4%
Taylor expanded in A around -inf 31.0%
*-commutative31.0%
Simplified31.0%
if 1.9999999999999999e-77 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e166Initial program 33.7%
Taylor expanded in F around 0 31.9%
Simplified53.4%
*-commutative53.4%
pow1/253.4%
pow1/253.4%
pow-prod-down53.6%
+-commutative53.6%
+-commutative53.6%
*-commutative53.6%
Applied egg-rr53.6%
unpow1/253.6%
Simplified53.6%
if 5.0000000000000002e166 < (pow.f64 B #s(literal 2 binary64)) Initial program 8.9%
Taylor expanded in B around inf 22.7%
mul-1-neg22.7%
*-commutative22.7%
Simplified22.7%
sqrt-div36.6%
Applied egg-rr36.6%
associate-*r/36.5%
pow1/236.5%
pow1/236.5%
pow-prod-down36.7%
*-commutative36.7%
pow1/236.7%
*-commutative36.7%
Applied egg-rr36.7%
Final simplification36.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 (<= (pow B_m 2.0) 9e+55)
(/
(pow (* (fma B_m B_m (* -4.0 (* A C))) (* F (* 4.0 C))) 0.5)
(- (fma B_m B_m (* A (* C -4.0)))))
(/ (sqrt (* 2.0 F)) (- (sqrt 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 (pow(B_m, 2.0) <= 9e+55) {
tmp = pow((fma(B_m, B_m, (-4.0 * (A * C))) * (F * (4.0 * C))), 0.5) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 ^ 2.0) <= 9e+55) tmp = Float64((Float64(fma(B_m, B_m, Float64(-4.0 * Float64(A * C))) * Float64(F * Float64(4.0 * C))) ^ 0.5) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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], 9e+55], N[(N[Power[N[(N[(B$95$m * B$95$m + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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 9 \cdot 10^{+55}:\\
\;\;\;\;\frac{{\left(\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right) \cdot \left(F \cdot \left(4 \cdot C\right)\right)\right)}^{0.5}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 8.99999999999999996e55Initial program 23.2%
Simplified33.8%
Taylor expanded in A around -inf 30.6%
*-commutative30.6%
Simplified30.6%
pow1/230.6%
associate-*l*30.0%
associate-*r*30.0%
Applied egg-rr30.0%
if 8.99999999999999996e55 < (pow.f64 B #s(literal 2 binary64)) Initial program 13.9%
Taylor expanded in B around inf 22.8%
mul-1-neg22.8%
*-commutative22.8%
Simplified22.8%
sqrt-div34.5%
Applied egg-rr34.5%
associate-*r/34.4%
pow1/234.4%
pow1/234.4%
pow-prod-down34.6%
*-commutative34.6%
pow1/234.6%
*-commutative34.6%
Applied egg-rr34.6%
Final simplification32.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 9e+55)
(/ (sqrt (* (* 4.0 C) (* F t_0))) (- t_0))
(/ (sqrt (* 2.0 F)) (- (sqrt 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 t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 9e+55) {
tmp = sqrt(((4.0 * C) * (F * t_0))) / -t_0;
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 9e+55) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 9e+55], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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)\\
\mathbf{if}\;{B\_m}^{2} \leq 9 \cdot 10^{+55}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 8.99999999999999996e55Initial program 23.2%
Simplified33.8%
Taylor expanded in A around -inf 30.6%
*-commutative30.6%
Simplified30.6%
if 8.99999999999999996e55 < (pow.f64 B #s(literal 2 binary64)) Initial program 13.9%
Taylor expanded in B around inf 22.8%
mul-1-neg22.8%
*-commutative22.8%
Simplified22.8%
sqrt-div34.5%
Applied egg-rr34.5%
associate-*r/34.4%
pow1/234.4%
pow1/234.4%
pow-prod-down34.6%
*-commutative34.6%
pow1/234.6%
*-commutative34.6%
Applied egg-rr34.6%
Final simplification32.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 (<= (pow B_m 2.0) 1e-129)
(/
(sqrt (* (* 4.0 C) (* F (fma B_m B_m (* A (* C -4.0))))))
(* A (* 4.0 C)))
(if (<= (pow B_m 2.0) 2e+97)
(/ (sqrt F) (- (sqrt (- A))))
(/ (sqrt (* 2.0 F)) (- (sqrt 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 (pow(B_m, 2.0) <= 1e-129) {
tmp = sqrt(((4.0 * C) * (F * fma(B_m, B_m, (A * (C * -4.0)))))) / (A * (4.0 * C));
} else if (pow(B_m, 2.0) <= 2e+97) {
tmp = sqrt(F) / -sqrt(-A);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 ^ 2.0) <= 1e-129) tmp = Float64(sqrt(Float64(Float64(4.0 * C) * Float64(F * fma(B_m, B_m, Float64(A * Float64(C * -4.0)))))) / Float64(A * Float64(4.0 * C))); elseif ((B_m ^ 2.0) <= 2e+97) tmp = Float64(sqrt(F) / Float64(-sqrt(Float64(-A)))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m))); 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], 1e-129], N[(N[Sqrt[N[(N[(4.0 * C), $MachinePrecision] * N[(F * N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+97], N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[(-A)], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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 10^{-129}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot C\right) \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\right)}}{A \cdot \left(4 \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+97}:\\
\;\;\;\;\frac{\sqrt{F}}{-\sqrt{-A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999993e-130Initial program 21.8%
Simplified30.4%
Taylor expanded in A around -inf 29.2%
*-commutative29.2%
Simplified29.2%
Taylor expanded in B around 0 29.1%
metadata-eval29.1%
distribute-lft-neg-in29.1%
*-commutative29.1%
associate-*l*29.1%
*-commutative29.1%
distribute-rgt-neg-in29.1%
distribute-lft-neg-in29.1%
metadata-eval29.1%
*-commutative29.1%
Simplified29.1%
if 9.9999999999999993e-130 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e97Initial program 29.0%
Taylor expanded in F around 0 27.1%
Simplified44.6%
*-commutative44.6%
pow1/244.6%
pow1/244.6%
pow-prod-down44.8%
+-commutative44.8%
+-commutative44.8%
*-commutative44.8%
Applied egg-rr44.8%
unpow1/244.8%
Simplified44.8%
Taylor expanded in A around -inf 23.9%
mul-1-neg23.9%
Simplified23.9%
distribute-neg-frac223.9%
sqrt-div29.8%
Applied egg-rr29.8%
if 2.0000000000000001e97 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.0%
Taylor expanded in B around inf 22.4%
mul-1-neg22.4%
*-commutative22.4%
Simplified22.4%
sqrt-div35.0%
Applied egg-rr35.0%
associate-*r/34.9%
pow1/234.9%
pow1/234.9%
pow-prod-down35.1%
*-commutative35.1%
pow1/235.1%
*-commutative35.1%
Applied egg-rr35.1%
Final simplification31.7%
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) 2e+97) (/ (sqrt F) (- (sqrt (- A)))) (/ (sqrt (* 2.0 F)) (- (sqrt 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 (pow(B_m, 2.0) <= 2e+97) {
tmp = sqrt(F) / -sqrt(-A);
} else {
tmp = sqrt((2.0 * F)) / -sqrt(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 ** 2.0d0) <= 2d+97) then
tmp = sqrt(f) / -sqrt(-a)
else
tmp = sqrt((2.0d0 * f)) / -sqrt(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 (Math.pow(B_m, 2.0) <= 2e+97) {
tmp = Math.sqrt(F) / -Math.sqrt(-A);
} else {
tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(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 math.pow(B_m, 2.0) <= 2e+97: tmp = math.sqrt(F) / -math.sqrt(-A) else: tmp = math.sqrt((2.0 * F)) / -math.sqrt(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 ^ 2.0) <= 2e+97) tmp = Float64(sqrt(F) / Float64(-sqrt(Float64(-A)))); else tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(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 ^ 2.0) <= 2e+97)
tmp = sqrt(F) / -sqrt(-A);
else
tmp = sqrt((2.0 * F)) / -sqrt(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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+97], N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[(-A)], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $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 2 \cdot 10^{+97}:\\
\;\;\;\;\frac{\sqrt{F}}{-\sqrt{-A}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e97Initial program 24.0%
Taylor expanded in F around 0 18.6%
Simplified29.4%
*-commutative29.4%
pow1/229.4%
pow1/229.4%
pow-prod-down29.5%
+-commutative29.5%
+-commutative29.5%
*-commutative29.5%
Applied egg-rr29.5%
unpow1/229.5%
Simplified29.5%
Taylor expanded in A around -inf 21.6%
mul-1-neg21.6%
Simplified21.6%
distribute-neg-frac221.6%
sqrt-div22.9%
Applied egg-rr22.9%
if 2.0000000000000001e97 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.0%
Taylor expanded in B around inf 22.4%
mul-1-neg22.4%
*-commutative22.4%
Simplified22.4%
sqrt-div35.0%
Applied egg-rr35.0%
associate-*r/34.9%
pow1/234.9%
pow1/234.9%
pow-prod-down35.1%
*-commutative35.1%
pow1/235.1%
*-commutative35.1%
Applied egg-rr35.1%
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.5e+48) (/ (sqrt F) (- (sqrt (- A)))) (* (sqrt F) (- (sqrt (/ 2.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.5e+48) {
tmp = sqrt(F) / -sqrt(-A);
} else {
tmp = sqrt(F) * -sqrt((2.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 <= 5.5d+48) then
tmp = sqrt(f) / -sqrt(-a)
else
tmp = sqrt(f) * -sqrt((2.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 <= 5.5e+48) {
tmp = Math.sqrt(F) / -Math.sqrt(-A);
} else {
tmp = Math.sqrt(F) * -Math.sqrt((2.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.5e+48: tmp = math.sqrt(F) / -math.sqrt(-A) else: tmp = math.sqrt(F) * -math.sqrt((2.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.5e+48) tmp = Float64(sqrt(F) / Float64(-sqrt(Float64(-A)))); else tmp = Float64(sqrt(F) * Float64(-sqrt(Float64(2.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.5e+48)
tmp = sqrt(F) / -sqrt(-A);
else
tmp = sqrt(F) * -sqrt((2.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.5e+48], N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[(-A)], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(2.0 / B$95$m), $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.5 \cdot 10^{+48}:\\
\;\;\;\;\frac{\sqrt{F}}{-\sqrt{-A}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\
\end{array}
\end{array}
if B < 5.5000000000000002e48Initial program 18.9%
Taylor expanded in F around 0 15.4%
Simplified26.8%
*-commutative26.8%
pow1/226.8%
pow1/226.8%
pow-prod-down26.9%
+-commutative26.9%
+-commutative26.9%
*-commutative26.9%
Applied egg-rr26.9%
unpow1/226.9%
Simplified26.9%
Taylor expanded in A around -inf 19.4%
mul-1-neg19.4%
Simplified19.4%
distribute-neg-frac219.4%
sqrt-div19.8%
Applied egg-rr19.8%
if 5.5000000000000002e48 < B Initial program 19.8%
Simplified23.2%
add-cube-cbrt23.1%
pow323.1%
hypot-undefine19.7%
unpow219.7%
unpow219.7%
+-commutative19.7%
unpow219.7%
unpow219.7%
hypot-define23.1%
Applied egg-rr23.1%
Taylor expanded in B around inf 37.9%
mul-1-neg37.9%
rem-cube-cbrt38.7%
Simplified38.7%
pow1/238.7%
associate-/l*38.7%
unpow-prod-down64.6%
pow1/264.6%
Applied egg-rr64.6%
unpow1/264.6%
Simplified64.6%
Final simplification29.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 (<= A -6e-34) (/ (sqrt F) (- (sqrt (- A)))) (- (sqrt (/ (* 2.0 (+ F (* F (/ (+ A C) B_m)))) 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 (A <= -6e-34) {
tmp = sqrt(F) / -sqrt(-A);
} else {
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (a <= (-6d-34)) then
tmp = sqrt(f) / -sqrt(-a)
else
tmp = -sqrt(((2.0d0 * (f + (f * ((a + c) / b_m)))) / 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 (A <= -6e-34) {
tmp = Math.sqrt(F) / -Math.sqrt(-A);
} else {
tmp = -Math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 A <= -6e-34: tmp = math.sqrt(F) / -math.sqrt(-A) else: tmp = -math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (A <= -6e-34) tmp = Float64(sqrt(F) / Float64(-sqrt(Float64(-A)))); else tmp = Float64(-sqrt(Float64(Float64(2.0 * Float64(F + Float64(F * Float64(Float64(A + C) / B_m)))) / 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 (A <= -6e-34)
tmp = sqrt(F) / -sqrt(-A);
else
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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[A, -6e-34], N[(N[Sqrt[F], $MachinePrecision] / (-N[Sqrt[(-A)], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(N[(2.0 * N[(F + N[(F * N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / B$95$m), $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}\;A \leq -6 \cdot 10^{-34}:\\
\;\;\;\;\frac{\sqrt{F}}{-\sqrt{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot \left(F + F \cdot \frac{A + C}{B\_m}\right)}{B\_m}}\\
\end{array}
\end{array}
if A < -6e-34Initial program 12.3%
Taylor expanded in F around 0 12.3%
Simplified29.1%
*-commutative29.1%
pow1/229.1%
pow1/229.1%
pow-prod-down29.0%
+-commutative29.0%
+-commutative29.0%
*-commutative29.0%
Applied egg-rr29.0%
unpow1/229.0%
Simplified29.0%
Taylor expanded in A around -inf 40.7%
mul-1-neg40.7%
Simplified40.7%
distribute-neg-frac240.7%
sqrt-div43.4%
Applied egg-rr43.4%
if -6e-34 < A Initial program 22.7%
Taylor expanded in F around 0 17.4%
Simplified27.6%
*-commutative27.6%
pow1/227.6%
pow1/227.6%
pow-prod-down27.8%
+-commutative27.8%
+-commutative27.8%
*-commutative27.8%
Applied egg-rr27.8%
unpow1/227.8%
Simplified27.8%
Taylor expanded in B around inf 14.0%
distribute-lft-out14.0%
associate-/l*14.7%
Simplified14.7%
Final simplification24.7%
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 (<= A -6.2e-34) (- (sqrt (fabs (/ F A)))) (- (sqrt (/ (* 2.0 (+ F (* F (/ (+ A C) B_m)))) 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 (A <= -6.2e-34) {
tmp = -sqrt(fabs((F / A)));
} else {
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (a <= (-6.2d-34)) then
tmp = -sqrt(abs((f / a)))
else
tmp = -sqrt(((2.0d0 * (f + (f * ((a + c) / b_m)))) / 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 (A <= -6.2e-34) {
tmp = -Math.sqrt(Math.abs((F / A)));
} else {
tmp = -Math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 A <= -6.2e-34: tmp = -math.sqrt(math.fabs((F / A))) else: tmp = -math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (A <= -6.2e-34) tmp = Float64(-sqrt(abs(Float64(F / A)))); else tmp = Float64(-sqrt(Float64(Float64(2.0 * Float64(F + Float64(F * Float64(Float64(A + C) / B_m)))) / 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 (A <= -6.2e-34)
tmp = -sqrt(abs((F / A)));
else
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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[A, -6.2e-34], (-N[Sqrt[N[Abs[N[(F / A), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(2.0 * N[(F + N[(F * N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / B$95$m), $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}\;A \leq -6.2 \cdot 10^{-34}:\\
\;\;\;\;-\sqrt{\left|\frac{F}{A}\right|}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot \left(F + F \cdot \frac{A + C}{B\_m}\right)}{B\_m}}\\
\end{array}
\end{array}
if A < -6.1999999999999996e-34Initial program 12.3%
Taylor expanded in F around 0 12.3%
Simplified29.1%
*-commutative29.1%
pow1/229.1%
pow1/229.1%
pow-prod-down29.0%
+-commutative29.0%
+-commutative29.0%
*-commutative29.0%
Applied egg-rr29.0%
unpow1/229.0%
Simplified29.0%
Taylor expanded in A around -inf 40.7%
mul-1-neg40.7%
Simplified40.7%
add-sqr-sqrt40.7%
pow1/240.7%
pow1/240.7%
pow-prod-down31.4%
pow231.4%
distribute-neg-frac31.4%
Applied egg-rr31.4%
unpow1/231.4%
unpow231.4%
rem-sqrt-square41.1%
Simplified41.1%
if -6.1999999999999996e-34 < A Initial program 22.7%
Taylor expanded in F around 0 17.4%
Simplified27.6%
*-commutative27.6%
pow1/227.6%
pow1/227.6%
pow-prod-down27.8%
+-commutative27.8%
+-commutative27.8%
*-commutative27.8%
Applied egg-rr27.8%
unpow1/227.8%
Simplified27.8%
Taylor expanded in B around inf 14.0%
distribute-lft-out14.0%
associate-/l*14.7%
Simplified14.7%
Final simplification23.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 (<= A -6e-34) (- (sqrt (/ F (- A)))) (- (sqrt (/ (* 2.0 (+ F (* F (/ (+ A C) B_m)))) 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 (A <= -6e-34) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (a <= (-6d-34)) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt(((2.0d0 * (f + (f * ((a + c) / b_m)))) / 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 (A <= -6e-34) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 A <= -6e-34: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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 (A <= -6e-34) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(Float64(2.0 * Float64(F + Float64(F * Float64(Float64(A + C) / B_m)))) / 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 (A <= -6e-34)
tmp = -sqrt((F / -A));
else
tmp = -sqrt(((2.0 * (F + (F * ((A + C) / B_m)))) / 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[A, -6e-34], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(2.0 * N[(F + N[(F * N[(N[(A + C), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / B$95$m), $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}\;A \leq -6 \cdot 10^{-34}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot \left(F + F \cdot \frac{A + C}{B\_m}\right)}{B\_m}}\\
\end{array}
\end{array}
if A < -6e-34Initial program 12.3%
Taylor expanded in F around 0 12.3%
Simplified29.1%
*-commutative29.1%
pow1/229.1%
pow1/229.1%
pow-prod-down29.0%
+-commutative29.0%
+-commutative29.0%
*-commutative29.0%
Applied egg-rr29.0%
unpow1/229.0%
Simplified29.0%
Taylor expanded in A around -inf 40.7%
mul-1-neg40.7%
Simplified40.7%
if -6e-34 < A Initial program 22.7%
Taylor expanded in F around 0 17.4%
Simplified27.6%
*-commutative27.6%
pow1/227.6%
pow1/227.6%
pow-prod-down27.8%
+-commutative27.8%
+-commutative27.8%
*-commutative27.8%
Applied egg-rr27.8%
unpow1/227.8%
Simplified27.8%
Taylor expanded in B around inf 14.0%
distribute-lft-out14.0%
associate-/l*14.7%
Simplified14.7%
Final simplification23.7%
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 9e+29) (- (sqrt (/ F (- A)))) (- (sqrt (/ (* 2.0 F) 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 <= 9e+29) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt(((2.0 * F) / 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 <= 9d+29) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt(((2.0d0 * f) / 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 <= 9e+29) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt(((2.0 * F) / 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 <= 9e+29: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt(((2.0 * F) / 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 <= 9e+29) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / 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 <= 9e+29)
tmp = -sqrt((F / -A));
else
tmp = -sqrt(((2.0 * F) / 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, 9e+29], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $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 9 \cdot 10^{+29}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{\frac{2 \cdot F}{B\_m}}\\
\end{array}
\end{array}
if B < 9.0000000000000005e29Initial program 18.2%
Taylor expanded in F around 0 14.7%
Simplified26.2%
*-commutative26.2%
pow1/226.2%
pow1/226.2%
pow-prod-down26.3%
+-commutative26.3%
+-commutative26.3%
*-commutative26.3%
Applied egg-rr26.3%
unpow1/226.3%
Simplified26.3%
Taylor expanded in A around -inf 19.7%
mul-1-neg19.7%
Simplified19.7%
if 9.0000000000000005e29 < B Initial program 21.9%
Simplified25.0%
add-cube-cbrt24.9%
pow324.9%
hypot-undefine21.7%
unpow221.7%
unpow221.7%
+-commutative21.7%
unpow221.7%
unpow221.7%
hypot-define24.9%
Applied egg-rr24.9%
Taylor expanded in B around inf 38.8%
mul-1-neg38.8%
rem-cube-cbrt39.7%
Simplified39.7%
Final simplification24.5%
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 8.8e+29) (- (sqrt (/ F (- A)))) (- (sqrt (* F (/ 2.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 <= 8.8e+29) {
tmp = -sqrt((F / -A));
} else {
tmp = -sqrt((F * (2.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 <= 8.8d+29) then
tmp = -sqrt((f / -a))
else
tmp = -sqrt((f * (2.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 <= 8.8e+29) {
tmp = -Math.sqrt((F / -A));
} else {
tmp = -Math.sqrt((F * (2.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 <= 8.8e+29: tmp = -math.sqrt((F / -A)) else: tmp = -math.sqrt((F * (2.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 <= 8.8e+29) tmp = Float64(-sqrt(Float64(F / Float64(-A)))); else tmp = Float64(-sqrt(Float64(F * Float64(2.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 <= 8.8e+29)
tmp = -sqrt((F / -A));
else
tmp = -sqrt((F * (2.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, 8.8e+29], (-N[Sqrt[N[(F / (-A)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(F * N[(2.0 / B$95$m), $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 8.8 \cdot 10^{+29}:\\
\;\;\;\;-\sqrt{\frac{F}{-A}}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \frac{2}{B\_m}}\\
\end{array}
\end{array}
if B < 8.8000000000000005e29Initial program 18.2%
Taylor expanded in F around 0 14.7%
Simplified26.2%
*-commutative26.2%
pow1/226.2%
pow1/226.2%
pow-prod-down26.3%
+-commutative26.3%
+-commutative26.3%
*-commutative26.3%
Applied egg-rr26.3%
unpow1/226.3%
Simplified26.3%
Taylor expanded in A around -inf 19.7%
mul-1-neg19.7%
Simplified19.7%
if 8.8000000000000005e29 < B Initial program 21.9%
Taylor expanded in B around inf 39.5%
mul-1-neg39.5%
*-commutative39.5%
Simplified39.5%
sqrt-div63.8%
Applied egg-rr63.8%
neg-sub063.8%
associate-*r/63.6%
pow1/263.6%
pow1/263.6%
pow-prod-down64.0%
*-commutative64.0%
pow1/264.0%
sqrt-div39.7%
associate-/l*39.6%
Applied egg-rr39.6%
neg-sub039.6%
Simplified39.6%
Final simplification24.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 (- (sqrt (/ F (- 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) {
return -sqrt((F / -A));
}
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 / -a))
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 / -A));
}
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 / -A))
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(-A)))) 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 / -A));
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 / (-A)), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{F}{-A}}
\end{array}
Initial program 19.1%
Taylor expanded in F around 0 15.6%
Simplified28.1%
*-commutative28.1%
pow1/228.1%
pow1/228.1%
pow-prod-down28.2%
+-commutative28.2%
+-commutative28.2%
*-commutative28.2%
Applied egg-rr28.2%
unpow1/228.2%
Simplified28.2%
Taylor expanded in A around -inf 16.4%
mul-1-neg16.4%
Simplified16.4%
Final simplification16.4%
herbie shell --seed 2024173
(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))))