
(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 16 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)))))
(if (<= t_2 -4e-154)
(*
(sqrt
(*
F
(/ (+ A (- C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_2 INFINITY)
(/
(sqrt (* (* F t_0) (/ (- (* 2.0 (* C (+ A A))) (pow B_m 2.0)) C)))
(- t_0))
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (- A (hypot A 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 = (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 tmp;
if (t_2 <= -4e-154) {
tmp = sqrt((F * ((A + (C - hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (((2.0 * (C * (A + A))) - pow(B_m, 2.0)) / C))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (A - hypot(A, 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(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))) tmp = 0.0 if (t_2 <= -4e-154) tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C - hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(Float64(Float64(2.0 * Float64(C * Float64(A + A))) - (B_m ^ 2.0)) / C))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(A - hypot(A, 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 = 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]}, If[LessEqual[t$95$2, -4e-154], N[(N[Sqrt[N[(F * 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]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(N[(N[(2.0 * N[(C * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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}}\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{-154}:\\
\;\;\;\;\sqrt{F \cdot \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(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \frac{2 \cdot \left(C \cdot \left(A + A\right)\right) - {B\_m}^{2}}{C}}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{A - \mathsf{hypot}\left(A, B\_m\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))) < -3.9999999999999999e-154Initial program 32.0%
Simplified36.3%
add-cbrt-cube19.3%
pow319.3%
*-commutative19.3%
Applied egg-rr19.3%
Taylor expanded in F around 0 49.0%
mul-1-neg49.0%
Simplified69.2%
if -3.9999999999999999e-154 < (/.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 25.3%
Simplified40.6%
Taylor expanded in C around inf 37.1%
Taylor expanded in C around 0 37.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-define14.6%
Simplified14.6%
pow1/214.6%
pow-to-exp14.5%
Applied egg-rr14.5%
associate-*l/14.5%
exp-to-pow14.6%
pow1/214.6%
sqrt-prod14.6%
distribute-frac-neg214.6%
clear-num14.6%
associate-*r*14.6%
Applied egg-rr14.6%
Taylor expanded in F around 0 1.6%
mul-1-neg1.6%
distribute-rgt-neg-in1.6%
associate-/r*1.6%
unpow21.6%
unpow21.6%
hypot-define14.5%
Simplified14.5%
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 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e+66)
(/ (sqrt (* (* F t_0) (- (* 2.0 (* 2.0 A)) (/ (pow B_m 2.0) C)))) (- t_0))
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (- A (hypot A 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+66) {
tmp = sqrt(((F * t_0) * ((2.0 * (2.0 * A)) - (pow(B_m, 2.0) / C)))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (A - hypot(A, 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+66) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(Float64(2.0 * Float64(2.0 * A)) - Float64((B_m ^ 2.0) / C)))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(A - hypot(A, 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+66], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(N[(2.0 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision] - N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+66}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(2 \cdot A\right) - \frac{{B\_m}^{2}}{C}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{A - \mathsf{hypot}\left(A, B\_m\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999989e66Initial program 24.0%
Simplified33.5%
Taylor expanded in C around inf 31.4%
*-un-lft-identity31.4%
*-commutative31.4%
*-commutative31.4%
+-commutative31.4%
fma-define31.4%
cancel-sign-sub-inv31.4%
metadata-eval31.4%
*-un-lft-identity31.4%
mul-1-neg31.4%
Applied egg-rr31.4%
*-lft-identity31.4%
fmm-undef31.4%
count-231.4%
Simplified31.4%
if 1.99999999999999989e66 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.6%
Taylor expanded in C around 0 11.3%
mul-1-neg11.3%
+-commutative11.3%
unpow211.3%
unpow211.3%
hypot-define21.5%
Simplified21.5%
pow1/221.5%
pow-to-exp21.5%
Applied egg-rr21.5%
associate-*l/21.5%
exp-to-pow21.6%
pow1/221.6%
sqrt-prod21.6%
distribute-frac-neg221.6%
clear-num21.6%
associate-*r*21.6%
Applied egg-rr21.6%
Taylor expanded in F around 0 11.1%
mul-1-neg11.1%
distribute-rgt-neg-in11.1%
associate-/r*11.6%
unpow211.6%
unpow211.6%
hypot-define22.2%
Simplified22.2%
Final simplification26.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 2e+66)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/
-1.0
(* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (- A (hypot A 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+66) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (A - hypot(A, 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+66) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(A - hypot(A, 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+66], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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)\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{+66}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{A - \mathsf{hypot}\left(A, B\_m\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999989e66Initial program 24.0%
Simplified33.5%
Taylor expanded in A around -inf 31.2%
if 1.99999999999999989e66 < (pow.f64 B #s(literal 2 binary64)) Initial program 10.6%
Taylor expanded in C around 0 11.3%
mul-1-neg11.3%
+-commutative11.3%
unpow211.3%
unpow211.3%
hypot-define21.5%
Simplified21.5%
pow1/221.5%
pow-to-exp21.5%
Applied egg-rr21.5%
associate-*l/21.5%
exp-to-pow21.6%
pow1/221.6%
sqrt-prod21.6%
distribute-frac-neg221.6%
clear-num21.6%
associate-*r*21.6%
Applied egg-rr21.6%
Taylor expanded in F around 0 11.1%
mul-1-neg11.1%
distribute-rgt-neg-in11.1%
associate-/r*11.6%
unpow211.6%
unpow211.6%
hypot-define22.2%
Simplified22.2%
Final simplification26.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) 1e-9)
(/
(sqrt (* (* A -8.0) (* C (* F (* 2.0 A)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(/ -1.0 (* (/ B_m (sqrt 2.0)) (sqrt (/ (/ 1.0 F) (- A (hypot A 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-9) {
tmp = sqrt(((A * -8.0) * (C * (F * (2.0 * A))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = -1.0 / ((B_m / sqrt(2.0)) * sqrt(((1.0 / F) / (A - hypot(A, 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-9) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(2.0 * A))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(-1.0 / Float64(Float64(B_m / sqrt(2.0)) * sqrt(Float64(Float64(1.0 / F) / Float64(A - hypot(A, 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-9], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(-1.0 / N[(N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $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 10^{-9}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{A - \mathsf{hypot}\left(A, B\_m\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-9Initial program 22.8%
Simplified33.6%
add-cbrt-cube24.4%
pow324.4%
*-commutative24.4%
Applied egg-rr24.4%
Taylor expanded in C around inf 30.0%
associate-*r*30.0%
neg-mul-130.0%
unsub-neg30.0%
remove-double-neg30.0%
count-230.0%
Simplified30.0%
if 1.00000000000000006e-9 < (pow.f64 B #s(literal 2 binary64)) Initial program 13.7%
Taylor expanded in C around 0 12.4%
mul-1-neg12.4%
+-commutative12.4%
unpow212.4%
unpow212.4%
hypot-define21.0%
Simplified21.0%
pow1/221.0%
pow-to-exp21.0%
Applied egg-rr21.0%
associate-*l/21.0%
exp-to-pow21.0%
pow1/221.0%
sqrt-prod21.1%
distribute-frac-neg221.1%
clear-num21.1%
associate-*r*21.1%
Applied egg-rr21.1%
Taylor expanded in F around 0 12.2%
mul-1-neg12.2%
distribute-rgt-neg-in12.2%
associate-/r*12.6%
unpow212.6%
unpow212.6%
hypot-define21.4%
Simplified21.4%
Final simplification25.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 (<= B_m 3.65)
(/
(sqrt (* (* A -8.0) (* C (* F (* 2.0 A)))))
(- (fma B_m B_m (* A (* C -4.0)))))
(/ -1.0 (* B_m (pow (* (* 2.0 F) (- A (hypot B_m A))) -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) {
double tmp;
if (B_m <= 3.65) {
tmp = sqrt(((A * -8.0) * (C * (F * (2.0 * A))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else {
tmp = -1.0 / (B_m * pow(((2.0 * F) * (A - hypot(B_m, A))), -0.5));
}
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.65) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(C * Float64(F * Float64(2.0 * A))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); else tmp = Float64(-1.0 / Float64(B_m * (Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A))) ^ -0.5))); 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[B$95$m, 3.65], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(C * N[(F * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(-1.0 / N[(B$95$m * N[Power[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $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.65:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(C \cdot \left(F \cdot \left(2 \cdot A\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{B\_m \cdot {\left(\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}^{-0.5}}\\
\end{array}
\end{array}
if B < 3.64999999999999991Initial program 18.6%
Simplified25.3%
add-cbrt-cube17.5%
pow317.5%
*-commutative17.5%
Applied egg-rr17.5%
Taylor expanded in C around inf 19.3%
associate-*r*19.3%
neg-mul-119.3%
unsub-neg19.3%
remove-double-neg19.3%
count-219.3%
Simplified19.3%
if 3.64999999999999991 < B Initial program 14.6%
Taylor expanded in C around 0 26.2%
mul-1-neg26.2%
+-commutative26.2%
unpow226.2%
unpow226.2%
hypot-define44.6%
Simplified44.6%
pow1/244.6%
pow-to-exp44.5%
Applied egg-rr44.5%
associate-*l/44.5%
exp-to-pow44.6%
pow1/244.6%
sqrt-prod44.7%
distribute-frac-neg244.7%
clear-num44.7%
associate-*r*44.7%
Applied egg-rr44.7%
div-inv44.6%
pow1/244.6%
pow-flip44.7%
metadata-eval44.7%
Applied egg-rr44.7%
Final simplification25.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
(let* ((t_0 (* 2.0 (* A F))))
(if (<= A -1.4e+245)
(* (/ (sqrt 2.0) B_m) (- (sqrt t_0)))
(/ -1.0 (/ B_m (sqrt (+ t_0 (* -2.0 (* B_m F)))))))))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 = 2.0 * (A * F);
double tmp;
if (A <= -1.4e+245) {
tmp = (sqrt(2.0) / B_m) * -sqrt(t_0);
} else {
tmp = -1.0 / (B_m / sqrt((t_0 + (-2.0 * (B_m * F)))));
}
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) :: t_0
real(8) :: tmp
t_0 = 2.0d0 * (a * f)
if (a <= (-1.4d+245)) then
tmp = (sqrt(2.0d0) / b_m) * -sqrt(t_0)
else
tmp = (-1.0d0) / (b_m / sqrt((t_0 + ((-2.0d0) * (b_m * f)))))
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 t_0 = 2.0 * (A * F);
double tmp;
if (A <= -1.4e+245) {
tmp = (Math.sqrt(2.0) / B_m) * -Math.sqrt(t_0);
} else {
tmp = -1.0 / (B_m / Math.sqrt((t_0 + (-2.0 * (B_m * F)))));
}
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 = 2.0 * (A * F) tmp = 0 if A <= -1.4e+245: tmp = (math.sqrt(2.0) / B_m) * -math.sqrt(t_0) else: tmp = -1.0 / (B_m / math.sqrt((t_0 + (-2.0 * (B_m * F))))) 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(2.0 * Float64(A * F)) tmp = 0.0 if (A <= -1.4e+245) tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(-sqrt(t_0))); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(t_0 + Float64(-2.0 * Float64(B_m * F)))))); 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 = 2.0 * (A * F);
tmp = 0.0;
if (A <= -1.4e+245)
tmp = (sqrt(2.0) / B_m) * -sqrt(t_0);
else
tmp = -1.0 / (B_m / sqrt((t_0 + (-2.0 * (B_m * F)))));
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[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[A, -1.4e+245], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(t$95$0 + N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $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 := 2 \cdot \left(A \cdot F\right)\\
\mathbf{if}\;A \leq -1.4 \cdot 10^{+245}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(-\sqrt{t\_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{t\_0 + -2 \cdot \left(B\_m \cdot F\right)}}}\\
\end{array}
\end{array}
if A < -1.39999999999999989e245Initial program 1.3%
Taylor expanded in C around 0 0.8%
mul-1-neg0.8%
+-commutative0.8%
unpow20.8%
unpow20.8%
hypot-define6.9%
Simplified6.9%
Taylor expanded in A around -inf 6.9%
if -1.39999999999999989e245 < A Initial program 18.7%
Taylor expanded in C around 0 9.9%
mul-1-neg9.9%
+-commutative9.9%
unpow29.9%
unpow29.9%
hypot-define15.4%
Simplified15.4%
pow1/215.4%
pow-to-exp15.4%
Applied egg-rr15.4%
associate-*l/15.4%
exp-to-pow15.4%
pow1/215.4%
sqrt-prod15.5%
distribute-frac-neg215.5%
clear-num15.5%
associate-*r*15.5%
Applied egg-rr15.5%
Taylor expanded in A around 0 13.1%
Final simplification12.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 (/ -1.0 (* B_m (pow (* (* 2.0 F) (- A (hypot B_m A))) -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 -1.0 / (B_m * pow(((2.0 * F) * (A - hypot(B_m, A))), -0.5));
}
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 -1.0 / (B_m * Math.pow(((2.0 * F) * (A - Math.hypot(B_m, A))), -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 -1.0 / (B_m * math.pow(((2.0 * F) * (A - math.hypot(B_m, A))), -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(-1.0 / Float64(B_m * (Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A))) ^ -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 = -1.0 / (B_m * (((2.0 * F) * (A - hypot(B_m, A))) ^ -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[(-1.0 / N[(B$95$m * N[Power[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{-1}{B\_m \cdot {\left(\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}^{-0.5}}
\end{array}
Initial program 17.5%
Taylor expanded in C around 0 9.3%
mul-1-neg9.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define14.9%
Simplified14.9%
pow1/214.9%
pow-to-exp14.8%
Applied egg-rr14.8%
associate-*l/14.8%
exp-to-pow14.9%
pow1/214.9%
sqrt-prod14.9%
distribute-frac-neg214.9%
clear-num14.9%
associate-*r*14.9%
Applied egg-rr14.9%
div-inv14.9%
pow1/214.9%
pow-flip15.0%
metadata-eval15.0%
Applied egg-rr15.0%
Final simplification15.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 (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- 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((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
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((2.0 * (F * (A - Math.hypot(B_m, A))))) / -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((2.0 * (F * (A - math.hypot(B_m, A))))) / -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(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-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((2.0 * (F * (A - hypot(B_m, A))))) / -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[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}
\end{array}
Initial program 17.5%
Taylor expanded in C around 0 9.3%
mul-1-neg9.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define14.9%
Simplified14.9%
neg-sub014.9%
associate-*l/14.9%
pow1/214.9%
pow1/215.0%
pow-prod-down15.0%
Applied egg-rr15.0%
neg-sub015.0%
distribute-neg-frac215.0%
unpow1/214.9%
Simplified14.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 -1.6e+249) (/ (sqrt (* (* 4.0 A) F)) (- B_m)) (/ -1.0 (/ B_m (sqrt (+ (* 2.0 (* A F)) (* -2.0 (* B_m F))))))))
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 <= -1.6e+249) {
tmp = sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = -1.0 / (B_m / sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * F)))));
}
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 <= (-1.6d+249)) then
tmp = sqrt(((4.0d0 * a) * f)) / -b_m
else
tmp = (-1.0d0) / (b_m / sqrt(((2.0d0 * (a * f)) + ((-2.0d0) * (b_m * f)))))
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 <= -1.6e+249) {
tmp = Math.sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = -1.0 / (B_m / Math.sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * F)))));
}
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 <= -1.6e+249: tmp = math.sqrt(((4.0 * A) * F)) / -B_m else: tmp = -1.0 / (B_m / math.sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * F))))) 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 <= -1.6e+249) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-B_m)); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(2.0 * Float64(A * F)) + Float64(-2.0 * Float64(B_m * F)))))); 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 <= -1.6e+249)
tmp = sqrt(((4.0 * A) * F)) / -B_m;
else
tmp = -1.0 / (B_m / sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * F)))));
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, -1.6e+249], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $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}\;A \leq -1.6 \cdot 10^{+249}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{2 \cdot \left(A \cdot F\right) + -2 \cdot \left(B\_m \cdot F\right)}}}\\
\end{array}
\end{array}
if A < -1.60000000000000007e249Initial program 1.3%
Taylor expanded in C around 0 0.8%
mul-1-neg0.8%
+-commutative0.8%
unpow20.8%
unpow20.8%
hypot-define7.3%
Simplified7.3%
neg-sub07.3%
associate-*l/7.3%
pow1/27.3%
pow1/27.8%
pow-prod-down7.8%
Applied egg-rr7.8%
neg-sub07.8%
distribute-neg-frac27.8%
unpow1/27.3%
Simplified7.3%
Taylor expanded in A around -inf 7.3%
associate-*r*7.3%
*-commutative7.3%
Simplified7.3%
if -1.60000000000000007e249 < A Initial program 18.6%
Taylor expanded in C around 0 9.8%
mul-1-neg9.8%
+-commutative9.8%
unpow29.8%
unpow29.8%
hypot-define15.4%
Simplified15.4%
pow1/215.4%
pow-to-exp15.3%
Applied egg-rr15.3%
associate-*l/15.3%
exp-to-pow15.4%
pow1/215.4%
sqrt-prod15.4%
distribute-frac-neg215.4%
clear-num15.4%
associate-*r*15.4%
Applied egg-rr15.4%
Taylor expanded in A around 0 13.1%
Final simplification12.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 -1.5e+254) (/ (sqrt (* (* 4.0 A) F)) (- B_m)) (/ (sqrt (+ (* 2.0 (* A F)) (* -2.0 (* B_m 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 (A <= -1.5e+254) {
tmp = sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * 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 (a <= (-1.5d+254)) then
tmp = sqrt(((4.0d0 * a) * f)) / -b_m
else
tmp = sqrt(((2.0d0 * (a * f)) + ((-2.0d0) * (b_m * 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 (A <= -1.5e+254) {
tmp = Math.sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = Math.sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * 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 A <= -1.5e+254: tmp = math.sqrt(((4.0 * A) * F)) / -B_m else: tmp = math.sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * 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 (A <= -1.5e+254) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(A * F)) + Float64(-2.0 * Float64(B_m * F)))) / Float64(-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 <= -1.5e+254)
tmp = sqrt(((4.0 * A) * F)) / -B_m;
else
tmp = sqrt(((2.0 * (A * F)) + (-2.0 * (B_m * 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[A, -1.5e+254], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 -1.5 \cdot 10^{+254}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(A \cdot F\right) + -2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.50000000000000003e254Initial program 1.4%
Taylor expanded in C around 0 0.9%
mul-1-neg0.9%
+-commutative0.9%
unpow20.9%
unpow20.9%
hypot-define7.8%
Simplified7.8%
neg-sub07.8%
associate-*l/7.8%
pow1/27.8%
pow1/28.3%
pow-prod-down8.3%
Applied egg-rr8.3%
neg-sub08.3%
distribute-neg-frac28.3%
unpow1/27.8%
Simplified7.8%
Taylor expanded in A around -inf 7.8%
associate-*r*7.8%
*-commutative7.8%
Simplified7.8%
if -1.50000000000000003e254 < A Initial program 18.5%
Taylor expanded in C around 0 9.8%
mul-1-neg9.8%
+-commutative9.8%
unpow29.8%
unpow29.8%
hypot-define15.3%
Simplified15.3%
neg-sub015.3%
associate-*l/15.3%
pow1/215.3%
pow1/215.4%
pow-prod-down15.4%
Applied egg-rr15.4%
neg-sub015.4%
distribute-neg-frac215.4%
unpow1/215.3%
Simplified15.3%
Taylor expanded in A around 0 13.0%
Final simplification12.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 -2.9e+249) (/ (sqrt (* (* 4.0 A) F)) (- B_m)) (/ (sqrt (* F (* B_m -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 (A <= -2.9e+249) {
tmp = sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = sqrt((F * (B_m * -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 (a <= (-2.9d+249)) then
tmp = sqrt(((4.0d0 * a) * f)) / -b_m
else
tmp = sqrt((f * (b_m * (-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 (A <= -2.9e+249) {
tmp = Math.sqrt(((4.0 * A) * F)) / -B_m;
} else {
tmp = Math.sqrt((F * (B_m * -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 A <= -2.9e+249: tmp = math.sqrt(((4.0 * A) * F)) / -B_m else: tmp = math.sqrt((F * (B_m * -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 (A <= -2.9e+249) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * F)) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-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 <= -2.9e+249)
tmp = sqrt(((4.0 * A) * F)) / -B_m;
else
tmp = sqrt((F * (B_m * -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[A, -2.9e+249], N[(N[Sqrt[N[(N[(4.0 * A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 -2.9 \cdot 10^{+249}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -2.90000000000000017e249Initial program 1.3%
Taylor expanded in C around 0 0.8%
mul-1-neg0.8%
+-commutative0.8%
unpow20.8%
unpow20.8%
hypot-define7.3%
Simplified7.3%
neg-sub07.3%
associate-*l/7.3%
pow1/27.3%
pow1/27.8%
pow-prod-down7.8%
Applied egg-rr7.8%
neg-sub07.8%
distribute-neg-frac27.8%
unpow1/27.3%
Simplified7.3%
Taylor expanded in A around -inf 7.3%
associate-*r*7.3%
*-commutative7.3%
Simplified7.3%
if -2.90000000000000017e249 < A Initial program 18.6%
Taylor expanded in C around 0 9.8%
mul-1-neg9.8%
+-commutative9.8%
unpow29.8%
unpow29.8%
hypot-define15.4%
Simplified15.4%
neg-sub015.4%
associate-*l/15.4%
pow1/215.4%
pow1/215.4%
pow-prod-down15.5%
Applied egg-rr15.5%
neg-sub015.5%
distribute-neg-frac215.5%
unpow1/215.4%
Simplified15.4%
Taylor expanded in A around 0 13.9%
associate-*r*13.9%
Simplified13.9%
Final simplification13.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 (<= A -2.4e+249) (* (sqrt (* A F)) (/ -2.0 B_m)) (/ (sqrt (* F (* B_m -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 (A <= -2.4e+249) {
tmp = sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = sqrt((F * (B_m * -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 (a <= (-2.4d+249)) then
tmp = sqrt((a * f)) * ((-2.0d0) / b_m)
else
tmp = sqrt((f * (b_m * (-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 (A <= -2.4e+249) {
tmp = Math.sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = Math.sqrt((F * (B_m * -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 A <= -2.4e+249: tmp = math.sqrt((A * F)) * (-2.0 / B_m) else: tmp = math.sqrt((F * (B_m * -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 (A <= -2.4e+249) tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-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 <= -2.4e+249)
tmp = sqrt((A * F)) * (-2.0 / B_m);
else
tmp = sqrt((F * (B_m * -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[A, -2.4e+249], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 -2.4 \cdot 10^{+249}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -2.4e249Initial program 1.3%
Taylor expanded in C around 0 0.8%
mul-1-neg0.8%
+-commutative0.8%
unpow20.8%
unpow20.8%
hypot-define7.3%
Simplified7.3%
pow1/27.3%
pow-to-exp7.2%
Applied egg-rr7.2%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt7.2%
unpow27.2%
rem-square-sqrt7.2%
metadata-eval7.2%
Simplified7.2%
if -2.4e249 < A Initial program 18.6%
Taylor expanded in C around 0 9.8%
mul-1-neg9.8%
+-commutative9.8%
unpow29.8%
unpow29.8%
hypot-define15.4%
Simplified15.4%
neg-sub015.4%
associate-*l/15.4%
pow1/215.4%
pow1/215.4%
pow-prod-down15.5%
Applied egg-rr15.5%
neg-sub015.5%
distribute-neg-frac215.5%
unpow1/215.4%
Simplified15.4%
Taylor expanded in A around 0 13.9%
associate-*r*13.9%
Simplified13.9%
Final simplification13.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 (<= A -3.1e+253) (* (sqrt (* A F)) (/ -2.0 B_m)) (/ (sqrt (* -2.0 (* B_m 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 (A <= -3.1e+253) {
tmp = sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = sqrt((-2.0 * (B_m * 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 (a <= (-3.1d+253)) then
tmp = sqrt((a * f)) * ((-2.0d0) / b_m)
else
tmp = sqrt(((-2.0d0) * (b_m * 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 (A <= -3.1e+253) {
tmp = Math.sqrt((A * F)) * (-2.0 / B_m);
} else {
tmp = Math.sqrt((-2.0 * (B_m * 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 A <= -3.1e+253: tmp = math.sqrt((A * F)) * (-2.0 / B_m) else: tmp = math.sqrt((-2.0 * (B_m * 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 (A <= -3.1e+253) tmp = Float64(sqrt(Float64(A * F)) * Float64(-2.0 / B_m)); else tmp = Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / Float64(-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 <= -3.1e+253)
tmp = sqrt((A * F)) * (-2.0 / B_m);
else
tmp = sqrt((-2.0 * (B_m * 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[A, -3.1e+253], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / B$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $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 -3.1 \cdot 10^{+253}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -3.10000000000000006e253Initial program 1.4%
Taylor expanded in C around 0 0.9%
mul-1-neg0.9%
+-commutative0.9%
unpow20.9%
unpow20.9%
hypot-define7.8%
Simplified7.8%
pow1/27.8%
pow-to-exp7.6%
Applied egg-rr7.6%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt7.6%
unpow27.6%
rem-square-sqrt7.7%
metadata-eval7.7%
Simplified7.7%
if -3.10000000000000006e253 < A Initial program 18.5%
Taylor expanded in C around 0 9.8%
mul-1-neg9.8%
+-commutative9.8%
unpow29.8%
unpow29.8%
hypot-define15.3%
Simplified15.3%
neg-sub015.3%
associate-*l/15.3%
pow1/215.3%
pow1/215.4%
pow-prod-down15.4%
Applied egg-rr15.4%
neg-sub015.4%
distribute-neg-frac215.4%
unpow1/215.3%
Simplified15.3%
Taylor expanded in A around 0 13.9%
Final simplification13.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 (* (sqrt (* A 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) {
return sqrt((A * F)) * (-2.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((a * f)) * ((-2.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((A * F)) * (-2.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((A * F)) * (-2.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(A * F)) * Float64(-2.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((A * F)) * (-2.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[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[(-2.0 / 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])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B\_m}
\end{array}
Initial program 17.5%
Taylor expanded in C around 0 9.3%
mul-1-neg9.3%
+-commutative9.3%
unpow29.3%
unpow29.3%
hypot-define14.9%
Simplified14.9%
pow1/214.9%
pow-to-exp14.8%
Applied egg-rr14.8%
Taylor expanded in A around -inf 0.0%
*-commutative0.0%
unpow20.0%
rem-square-sqrt2.9%
unpow22.9%
rem-square-sqrt2.9%
metadata-eval2.9%
Simplified2.9%
Final simplification2.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 (pow (* 2.0 (/ F 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 / 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 / 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 / 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 / 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(2.0 * Float64(F / 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 / 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 / B$95$m), $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 \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Initial program 17.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.1%
Simplified2.1%
Taylor expanded in F around 0 2.1%
sqrt-unprod2.1%
pow1/22.2%
Applied egg-rr2.2%
Final simplification2.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 (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) {
return sqrt((2.0 * (F / 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((2.0d0 * (f / 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((2.0 * (F / 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((2.0 * (F / 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 sqrt(Float64(2.0 * Float64(F / 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((2.0 * (F / 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[(2.0 * N[(F / 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])\\
\\
\sqrt{2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 17.5%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt2.1%
Simplified2.1%
Taylor expanded in F around 0 2.1%
sqrt-unprod2.1%
Applied egg-rr2.1%
Final simplification2.1%
herbie shell --seed 2024186
(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))))