
(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 13 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 (hypot B_m (- A C)))
(t_1 (- (* (* 4.0 A) C) (pow B_m 2.0)))
(t_2
(/
(sqrt
(*
(- (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))
(* 2.0 (* F t_1))))
t_1))
(t_3 (fma B_m B_m (* A (* C -4.0))))
(t_4 (- t_3))
(t_5 (* F t_3)))
(if (<= t_2 (- INFINITY))
(*
(sqrt (* F (/ (- (+ A C) t_0) (fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= t_2 -2e-134)
(/ (sqrt (* t_5 (* 2.0 (+ A (- C t_0))))) t_4)
(if (<= t_2 INFINITY)
(/
(sqrt (* t_5 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
t_4)
(/ -1.0 (/ B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = hypot(B_m, (A - C));
double t_1 = ((4.0 * A) * C) - pow(B_m, 2.0);
double t_2 = sqrt(((sqrt((pow(B_m, 2.0) + pow((A - C), 2.0))) - (A + C)) * (2.0 * (F * t_1)))) / t_1;
double t_3 = fma(B_m, B_m, (A * (C * -4.0)));
double t_4 = -t_3;
double t_5 = F * t_3;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt((F * (((A + C) - t_0) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (t_2 <= -2e-134) {
tmp = sqrt((t_5 * (2.0 * (A + (C - t_0))))) / t_4;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt((t_5 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_4;
} else {
tmp = -1.0 / (B_m / sqrt(((2.0 * F) * (A - hypot(B_m, A)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = hypot(B_m, Float64(A - C)) t_1 = Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)) t_2 = Float64(sqrt(Float64(Float64(sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0))) - Float64(A + C)) * Float64(2.0 * Float64(F * t_1)))) / t_1) t_3 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) t_4 = Float64(-t_3) t_5 = Float64(F * t_3) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) - t_0) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (t_2 <= -2e-134) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * Float64(A + Float64(C - t_0))))) / t_4); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(t_5 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_4); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(A + C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, Block[{t$95$5 = N[(F * t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(F * N[(N[(N[(A + C), $MachinePrecision] - t$95$0), $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, -2e-134], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * N[(A + N[(C - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(t$95$5 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 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{hypot}\left(B\_m, A - C\right)\\
t_1 := \left(4 \cdot A\right) \cdot C - {B\_m}^{2}\\
t_2 := \frac{\sqrt{\left(\sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}} - \left(A + C\right)\right) \cdot \left(2 \cdot \left(F \cdot t\_1\right)\right)}}{t\_1}\\
t_3 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_4 := -t\_3\\
t_5 := F \cdot t\_3\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(A + C\right) - t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-134}:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot \left(A + \left(C - t\_0\right)\right)\right)}}{t\_4}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_5 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Simplified16.5%
clear-num16.5%
inv-pow16.5%
Applied egg-rr15.9%
unpow-115.9%
associate-*l*15.9%
associate-+r-16.5%
hypot-undefine3.3%
unpow23.3%
unpow23.3%
+-commutative3.3%
unpow23.3%
unpow23.3%
hypot-undefine16.5%
Simplified16.5%
Taylor expanded in F around 0 21.7%
mul-1-neg21.7%
associate-/l*31.9%
unpow231.9%
unpow231.9%
hypot-undefine73.0%
fma-define73.0%
Simplified73.0%
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))) < -2.00000000000000008e-134Initial program 98.7%
Simplified98.7%
if -2.00000000000000008e-134 < (/.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 17.4%
Simplified30.1%
Taylor expanded in C around inf 31.5%
mul-1-neg31.5%
Simplified31.5%
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-define17.8%
Simplified17.8%
add-cbrt-cube12.5%
pow1/311.9%
add-sqr-sqrt11.9%
pow111.9%
pow1/212.0%
pow-prod-up12.0%
metadata-eval12.0%
Applied egg-rr12.0%
unpow1/312.6%
Simplified12.6%
associate-*l/12.5%
pow1/212.5%
pow1/312.0%
pow-pow17.8%
metadata-eval17.8%
unpow-prod-down17.9%
clear-num17.9%
unpow1/217.9%
associate-*r*17.9%
Applied egg-rr17.9%
Final simplification41.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
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= (pow B_m 2.0) 4e-34)
(/ (sqrt (* (* 4.0 A) (* F t_0))) (- t_0))
(/ -1.0 (/ B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (pow(B_m, 2.0) <= 4e-34) {
tmp = sqrt(((4.0 * A) * (F * t_0))) / -t_0;
} else {
tmp = -1.0 / (B_m / sqrt(((2.0 * F) * (A - hypot(B_m, A)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-34) tmp = Float64(sqrt(Float64(Float64(4.0 * A) * Float64(F * t_0))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-34], 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[(B$95$m / N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 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 4 \cdot 10^{-34}:\\
\;\;\;\;\frac{\sqrt{\left(4 \cdot A\right) \cdot \left(F \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.99999999999999971e-34Initial program 21.3%
Simplified29.5%
Taylor expanded in A around -inf 24.2%
if 3.99999999999999971e-34 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.4%
Taylor expanded in C around 0 8.0%
mul-1-neg8.0%
+-commutative8.0%
unpow28.0%
unpow28.0%
hypot-define22.4%
Simplified22.4%
add-cbrt-cube15.9%
pow1/315.0%
add-sqr-sqrt15.0%
pow115.0%
pow1/215.1%
pow-prod-up15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/315.9%
Simplified15.9%
associate-*l/15.9%
pow1/215.9%
pow1/315.1%
pow-pow22.4%
metadata-eval22.4%
unpow-prod-down22.5%
clear-num22.5%
unpow1/222.5%
associate-*r*22.5%
Applied egg-rr22.5%
Final simplification23.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-34)
(/
-1.0
(/
(fma B_m B_m (* A (* C -4.0)))
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))))
(/ -1.0 (/ B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-34) {
tmp = -1.0 / (fma(B_m, B_m, (A * (C * -4.0))) / sqrt((-8.0 * (A * (C * (F * (A + A)))))));
} else {
tmp = -1.0 / (B_m / sqrt(((2.0 * F) * (A - hypot(B_m, A)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-34) tmp = Float64(-1.0 / Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) / sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))))); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-34], N[(-1.0 / N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 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 4 \cdot 10^{-34}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 3.99999999999999971e-34Initial program 21.3%
Simplified29.5%
clear-num29.5%
inv-pow29.5%
Applied egg-rr28.1%
unpow-128.1%
associate-*l*28.1%
associate-+r-29.5%
hypot-undefine22.3%
unpow222.3%
unpow222.3%
+-commutative22.3%
unpow222.3%
unpow222.3%
hypot-undefine29.5%
Simplified29.5%
Taylor expanded in C around inf 22.1%
if 3.99999999999999971e-34 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.4%
Taylor expanded in C around 0 8.0%
mul-1-neg8.0%
+-commutative8.0%
unpow28.0%
unpow28.0%
hypot-define22.4%
Simplified22.4%
add-cbrt-cube15.9%
pow1/315.0%
add-sqr-sqrt15.0%
pow115.0%
pow1/215.1%
pow-prod-up15.1%
metadata-eval15.1%
Applied egg-rr15.1%
unpow1/315.9%
Simplified15.9%
associate-*l/15.9%
pow1/215.9%
pow1/315.1%
pow-pow22.4%
metadata-eval22.4%
unpow-prod-down22.5%
clear-num22.5%
unpow1/222.5%
associate-*r*22.5%
Applied egg-rr22.5%
Final simplification22.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2.5e-28)
(/
-1.0
(/
(fma B_m B_m (* A (* C -4.0)))
(sqrt (* -8.0 (* A (* (* C F) (+ A A)))))))
(/ -1.0 (/ B_m (sqrt (* (* 2.0 F) (- A (hypot B_m A))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.5e-28) {
tmp = -1.0 / (fma(B_m, B_m, (A * (C * -4.0))) / sqrt((-8.0 * (A * ((C * F) * (A + A))))));
} else {
tmp = -1.0 / (B_m / sqrt(((2.0 * F) * (A - hypot(B_m, A)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.5e-28) tmp = Float64(-1.0 / Float64(fma(B_m, B_m, Float64(A * Float64(C * -4.0))) / sqrt(Float64(-8.0 * Float64(A * Float64(Float64(C * F) * Float64(A + A))))))); else tmp = Float64(-1.0 / Float64(B_m / sqrt(Float64(Float64(2.0 * F) * Float64(A - hypot(B_m, A)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.5e-28], N[(-1.0 / N[(N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(-8.0 * N[(A * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(B$95$m / N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 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 \leq 2.5 \cdot 10^{-28}:\\
\;\;\;\;\frac{-1}{\frac{\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}{\sqrt{-8 \cdot \left(A \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{B\_m}{\sqrt{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}}\\
\end{array}
\end{array}
if B < 2.5000000000000001e-28Initial program 19.0%
Simplified26.4%
clear-num26.4%
inv-pow26.4%
Applied egg-rr25.3%
unpow-125.3%
associate-*l*25.3%
associate-+r-26.4%
hypot-undefine19.8%
unpow219.8%
unpow219.8%
+-commutative19.8%
unpow219.8%
unpow219.8%
hypot-undefine26.4%
Simplified26.4%
Taylor expanded in C around inf 16.9%
associate-*r*16.0%
mul-1-neg16.0%
Simplified16.0%
if 2.5000000000000001e-28 < B Initial program 11.4%
Taylor expanded in C around 0 13.8%
mul-1-neg13.8%
+-commutative13.8%
unpow213.8%
unpow213.8%
hypot-define39.5%
Simplified39.5%
add-cbrt-cube27.6%
pow1/326.0%
add-sqr-sqrt26.0%
pow126.0%
pow1/226.0%
pow-prod-up26.0%
metadata-eval26.0%
Applied egg-rr26.0%
unpow1/327.6%
Simplified27.6%
associate-*l/27.6%
pow1/227.6%
pow1/326.0%
pow-pow39.4%
metadata-eval39.4%
unpow-prod-down39.6%
clear-num39.6%
unpow1/239.6%
associate-*r*39.6%
Applied egg-rr39.6%
Final simplification22.1%
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.8e+218) (/ (pow (* 4.0 (* A F)) 0.5) (- B_m)) (/ (sqrt (* 2.0 (* F (- C (hypot 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 <= -1.8e+218) {
tmp = pow((4.0 * (A * F)), 0.5) / -B_m;
} else {
tmp = sqrt((2.0 * (F * (C - hypot(C, B_m))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (A <= -1.8e+218) {
tmp = Math.pow((4.0 * (A * F)), 0.5) / -B_m;
} else {
tmp = Math.sqrt((2.0 * (F * (C - Math.hypot(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 <= -1.8e+218: tmp = math.pow((4.0 * (A * F)), 0.5) / -B_m else: tmp = math.sqrt((2.0 * (F * (C - math.hypot(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 <= -1.8e+218) tmp = Float64((Float64(4.0 * Float64(A * F)) ^ 0.5) / Float64(-B_m)); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(C - hypot(C, B_m))))) / 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.8e+218)
tmp = ((4.0 * (A * F)) ^ 0.5) / -B_m;
else
tmp = sqrt((2.0 * (F * (C - hypot(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, -1.8e+218], N[(N[Power[N[(4.0 * N[(A * F), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(F * N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 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])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -1.8 \cdot 10^{+218}:\\
\;\;\;\;\frac{{\left(4 \cdot \left(A \cdot F\right)\right)}^{0.5}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C - \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -1.79999999999999995e218Initial program 2.7%
Taylor expanded in C around 0 1.4%
mul-1-neg1.4%
+-commutative1.4%
unpow21.4%
unpow21.4%
hypot-define9.2%
Simplified9.2%
associate-*l/9.2%
pow1/29.2%
pow1/210.2%
pow-prod-down10.2%
Applied egg-rr10.2%
Taylor expanded in A around -inf 10.3%
if -1.79999999999999995e218 < A Initial program 18.7%
Taylor expanded in A around 0 6.8%
mul-1-neg6.8%
+-commutative6.8%
unpow26.8%
unpow26.8%
hypot-define14.3%
Simplified14.3%
neg-sub014.3%
associate-*l/14.3%
pow1/214.3%
pow1/214.3%
pow-prod-down14.4%
Applied egg-rr14.4%
neg-sub014.4%
distribute-neg-frac214.4%
unpow1/214.3%
Simplified14.3%
Final simplification13.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 (- A (hypot B_m A)))) 0.5) (- 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 pow((2.0 * (F * (A - hypot(B_m, A)))), 0.5) / -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.pow((2.0 * (F * (A - Math.hypot(B_m, A)))), 0.5) / -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.pow((2.0 * (F * (A - math.hypot(B_m, A)))), 0.5) / -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((Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A)))) ^ 0.5) / 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 = ((2.0 * (F * (A - hypot(B_m, A)))) ^ 0.5) / -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[Power[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $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{{\left(2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)\right)}^{0.5}}{-B\_m}
\end{array}
Initial program 17.0%
Taylor expanded in C around 0 6.1%
mul-1-neg6.1%
+-commutative6.1%
unpow26.1%
unpow26.1%
hypot-define13.6%
Simplified13.6%
associate-*l/13.6%
pow1/213.6%
pow1/213.7%
pow-prod-down13.7%
Applied egg-rr13.7%
Final simplification13.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 (/ (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(Float64(2.0 * 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[(N[(2.0 * F), $MachinePrecision] * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $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{\left(2 \cdot F\right) \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)}}{-B\_m}
\end{array}
Initial program 17.0%
Taylor expanded in C around 0 6.1%
mul-1-neg6.1%
+-commutative6.1%
unpow26.1%
unpow26.1%
hypot-define13.6%
Simplified13.6%
neg-sub013.6%
associate-*l/13.6%
pow1/213.6%
pow1/213.7%
pow-prod-down13.7%
Applied egg-rr13.7%
neg-sub013.7%
distribute-neg-frac213.7%
unpow1/213.6%
associate-*r*13.6%
Simplified13.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 (/ (pow (* B_m (+ (* F -2.0) (* 2.0 (/ (* A F) B_m)))) 0.5) (- 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 pow((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m)))), 0.5) / -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 = ((b_m * ((f * (-2.0d0)) + (2.0d0 * ((a * f) / b_m)))) ** 0.5d0) / -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.pow((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m)))), 0.5) / -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.pow((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m)))), 0.5) / -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((Float64(B_m * Float64(Float64(F * -2.0) + Float64(2.0 * Float64(Float64(A * F) / B_m)))) ^ 0.5) / 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 = ((B_m * ((F * -2.0) + (2.0 * ((A * F) / B_m)))) ^ 0.5) / -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[Power[N[(B$95$m * N[(N[(F * -2.0), $MachinePrecision] + N[(2.0 * N[(N[(A * F), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $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{{\left(B\_m \cdot \left(F \cdot -2 + 2 \cdot \frac{A \cdot F}{B\_m}\right)\right)}^{0.5}}{-B\_m}
\end{array}
Initial program 17.0%
Taylor expanded in C around 0 6.1%
mul-1-neg6.1%
+-commutative6.1%
unpow26.1%
unpow26.1%
hypot-define13.6%
Simplified13.6%
associate-*l/13.6%
pow1/213.6%
pow1/213.7%
pow-prod-down13.7%
Applied egg-rr13.7%
Taylor expanded in B around inf 11.3%
Final simplification11.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 (<= A -3.3e+218) (/ (pow (* 4.0 (* A F)) 0.5) (- 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.3e+218) {
tmp = pow((4.0 * (A * F)), 0.5) / -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.3d+218)) then
tmp = ((4.0d0 * (a * f)) ** 0.5d0) / -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.3e+218) {
tmp = Math.pow((4.0 * (A * F)), 0.5) / -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.3e+218: tmp = math.pow((4.0 * (A * F)), 0.5) / -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.3e+218) tmp = Float64((Float64(4.0 * Float64(A * F)) ^ 0.5) / Float64(-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.3e+218)
tmp = ((4.0 * (A * F)) ^ 0.5) / -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.3e+218], N[(N[Power[N[(4.0 * N[(A * F), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision] / (-B$95$m)), $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.3 \cdot 10^{+218}:\\
\;\;\;\;\frac{{\left(4 \cdot \left(A \cdot F\right)\right)}^{0.5}}{-B\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if A < -3.29999999999999998e218Initial program 2.7%
Taylor expanded in C around 0 1.4%
mul-1-neg1.4%
+-commutative1.4%
unpow21.4%
unpow21.4%
hypot-define9.2%
Simplified9.2%
associate-*l/9.2%
pow1/29.2%
pow1/210.2%
pow-prod-down10.2%
Applied egg-rr10.2%
Taylor expanded in A around -inf 10.3%
if -3.29999999999999998e218 < A Initial program 18.7%
Taylor expanded in C around 0 6.7%
mul-1-neg6.7%
+-commutative6.7%
unpow26.7%
unpow26.7%
hypot-define14.1%
Simplified14.1%
neg-sub014.1%
associate-*l/14.1%
pow1/214.1%
pow1/214.1%
pow-prod-down14.1%
Applied egg-rr14.1%
neg-sub014.1%
distribute-neg-frac214.1%
unpow1/214.1%
associate-*r*14.1%
Simplified14.1%
Taylor expanded in A around 0 12.6%
Final simplification12.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 (/ (pow (* 2.0 (* F (- A B_m))) 0.5) (- 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 pow((2.0 * (F * (A - B_m))), 0.5) / -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 = ((2.0d0 * (f * (a - b_m))) ** 0.5d0) / -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.pow((2.0 * (F * (A - B_m))), 0.5) / -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.pow((2.0 * (F * (A - B_m))), 0.5) / -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((Float64(2.0 * Float64(F * Float64(A - B_m))) ^ 0.5) / 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 = ((2.0 * (F * (A - B_m))) ^ 0.5) / -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[Power[N[(2.0 * N[(F * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $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{{\left(2 \cdot \left(F \cdot \left(A - B\_m\right)\right)\right)}^{0.5}}{-B\_m}
\end{array}
Initial program 17.0%
Taylor expanded in C around 0 6.1%
mul-1-neg6.1%
+-commutative6.1%
unpow26.1%
unpow26.1%
hypot-define13.6%
Simplified13.6%
associate-*l/13.6%
pow1/213.6%
pow1/213.7%
pow-prod-down13.7%
Applied egg-rr13.7%
Taylor expanded in A around 0 11.3%
Final simplification11.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 (/ (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) {
return sqrt((-2.0 * (B_m * 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) * (b_m * 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 * (B_m * 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 * (B_m * 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 Float64(sqrt(Float64(-2.0 * Float64(B_m * F))) / 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 * (B_m * 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[(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])\\
\\
\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right)}}{-B\_m}
\end{array}
Initial program 17.0%
Taylor expanded in C around 0 6.1%
mul-1-neg6.1%
+-commutative6.1%
unpow26.1%
unpow26.1%
hypot-define13.6%
Simplified13.6%
neg-sub013.6%
associate-*l/13.6%
pow1/213.6%
pow1/213.7%
pow-prod-down13.7%
Applied egg-rr13.7%
neg-sub013.7%
distribute-neg-frac213.7%
unpow1/213.6%
associate-*r*13.6%
Simplified13.6%
Taylor expanded in A around 0 11.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 (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) {
return sqrt(((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(((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(((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(((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 sqrt(Float64(Float64(F * -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(((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[Sqrt[N[(N[(F * -2.0), $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])\\
\\
\sqrt{\frac{F \cdot -2}{B\_m}}
\end{array}
Initial program 17.0%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
pow11.9%
sqrt-unprod1.9%
Applied egg-rr1.9%
unpow11.9%
Simplified1.9%
associate-*l/1.9%
*-commutative1.9%
frac-2neg1.9%
add-sqr-sqrt1.1%
sqrt-unprod2.4%
sqr-neg2.4%
sqrt-unprod1.1%
add-sqr-sqrt1.8%
Applied egg-rr1.8%
distribute-lft-neg-in1.8%
metadata-eval1.8%
Simplified1.8%
Final simplification1.8%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* 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.0%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
pow11.9%
sqrt-unprod1.9%
Applied egg-rr1.9%
unpow11.9%
Simplified1.9%
Final simplification1.9%
herbie shell --seed 2024139
(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))))