
(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;
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b, c, f)
use fmin_fmax_functions
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}
Herbie found 10 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;
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b, c, f)
use fmin_fmax_functions
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 (- (* B_m B_m) (* (* 4.0 A) C))) (t_1 (* 2.0 (* t_0 F))))
(if (<= B_m 5.2e-86)
(/ (- (sqrt (* t_1 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))) t_0)
(if (<= B_m 26500000000.0)
(/ (- (* (sqrt t_1) (sqrt (* 2.0 C)))) (fma -4.0 (* A C) (* B_m B_m)))
(if (<= B_m 5.6e+248)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))))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 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = 2.0 * (t_0 * F);
double tmp;
if (B_m <= 5.2e-86) {
tmp = -sqrt((t_1 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_0;
} else if (B_m <= 26500000000.0) {
tmp = -(sqrt(t_1) * sqrt((2.0 * C))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (B_m <= 5.6e+248) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(2.0 * Float64(t_0 * F)) tmp = 0.0 if (B_m <= 5.2e-86) tmp = Float64(Float64(-sqrt(Float64(t_1 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))))) / t_0); elseif (B_m <= 26500000000.0) tmp = Float64(Float64(-Float64(sqrt(t_1) * sqrt(Float64(2.0 * C)))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif (B_m <= 5.6e+248) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5.2e-86], N[((-N[Sqrt[N[(t$95$1 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 26500000000.0], N[((-N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+248], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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 := B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(t\_0 \cdot F\right)\\
\mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-86}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 26500000000:\\
\;\;\;\;\frac{-\sqrt{t\_1} \cdot \sqrt{2 \cdot C}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+248}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 5.2000000000000002e-86Initial program 18.3%
Taylor expanded in A around -inf
lower-*.f6444.9
Applied rewrites44.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6444.9
lift-pow.f64N/A
pow2N/A
lift-*.f6444.9
Applied rewrites44.9%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f6444.5
Applied rewrites44.5%
if 5.2000000000000002e-86 < B < 2.65e10Initial program 33.0%
Taylor expanded in A around -inf
lower-*.f6438.5
Applied rewrites38.5%
lift-pow.f64N/A
pow2N/A
lift-*.f6438.5
lift-pow.f64N/A
pow2N/A
lift-*.f6438.5
Applied rewrites38.5%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6438.5
Applied rewrites38.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites37.3%
if 2.65e10 < B < 5.6000000000000004e248Initial program 18.8%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6426.8
Applied rewrites26.8%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6451.2
Applied rewrites51.2%
if 5.6000000000000004e248 < B Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6452.2
Applied rewrites52.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 -4.0 (* A C) (* B_m B_m)))
(t_1 (* 2.0 (* (- (* B_m B_m) (* (* 4.0 A) C)) F))))
(if (<= B_m 5.2e-87)
(/ (- (sqrt (* t_1 (* 2.0 C)))) t_0)
(if (<= B_m 26500000000.0)
(/ (- (* (sqrt t_1) (sqrt (* 2.0 C)))) t_0)
(if (<= B_m 5.6e+248)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))))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(-4.0, (A * C), (B_m * B_m));
double t_1 = 2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F);
double tmp;
if (B_m <= 5.2e-87) {
tmp = -sqrt((t_1 * (2.0 * C))) / t_0;
} else if (B_m <= 26500000000.0) {
tmp = -(sqrt(t_1) * sqrt((2.0 * C))) / t_0;
} else if (B_m <= 5.6e+248) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
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(-4.0, Float64(A * C), Float64(B_m * B_m)) t_1 = Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) * F)) tmp = 0.0 if (B_m <= 5.2e-87) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(2.0 * C)))) / t_0); elseif (B_m <= 26500000000.0) tmp = Float64(Float64(-Float64(sqrt(t_1) * sqrt(Float64(2.0 * C)))) / t_0); elseif (B_m <= 5.6e+248) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 5.2e-87], N[((-N[Sqrt[N[(t$95$1 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 26500000000.0], N[((-N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+248], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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(-4, A \cdot C, B\_m \cdot B\_m\right)\\
t_1 := 2 \cdot \left(\left(B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\\
\mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-87}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 26500000000:\\
\;\;\;\;\frac{-\sqrt{t\_1} \cdot \sqrt{2 \cdot C}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+248}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 5.20000000000000005e-87Initial program 18.2%
Taylor expanded in A around -inf
lower-*.f6444.9
Applied rewrites44.9%
lift-pow.f64N/A
pow2N/A
lift-*.f6444.9
lift-pow.f64N/A
pow2N/A
lift-*.f6444.9
Applied rewrites44.9%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.8
Applied rewrites44.8%
if 5.20000000000000005e-87 < B < 2.65e10Initial program 33.0%
Taylor expanded in A around -inf
lower-*.f6438.7
Applied rewrites38.7%
lift-pow.f64N/A
pow2N/A
lift-*.f6438.7
lift-pow.f64N/A
pow2N/A
lift-*.f6438.7
Applied rewrites38.7%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6438.7
Applied rewrites38.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-prodN/A
Applied rewrites37.4%
if 2.65e10 < B < 5.6000000000000004e248Initial program 18.8%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6426.8
Applied rewrites26.8%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6451.2
Applied rewrites51.2%
if 5.6000000000000004e248 < B Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6452.2
Applied rewrites52.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= F 1.166e-307)
(sqrt (* -1.0 (/ F A)))
(if (<= F 8.8e+45)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(if (<= F 6.7e+78)
(sqrt (* (/ (* F (* 2.0 C)) (- (* B_m B_m) (* 4.0 (* A C)))) 2.0))
(* -1.0 (sqrt (* (/ F B_m) 2.0)))))))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 (F <= 1.166e-307) {
tmp = sqrt((-1.0 * (F / A)));
} else if (F <= 8.8e+45) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else if (F <= 6.7e+78) {
tmp = sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
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 (F <= 1.166e-307) {
tmp = Math.sqrt((-1.0 * (F / A)));
} else if (F <= 8.8e+45) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (C + Math.hypot(B_m, C)))));
} else if (F <= 6.7e+78) {
tmp = Math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
} else {
tmp = -1.0 * Math.sqrt(((F / B_m) * 2.0));
}
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 F <= 1.166e-307: tmp = math.sqrt((-1.0 * (F / A))) elif F <= 8.8e+45: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (C + math.hypot(B_m, C))))) elif F <= 6.7e+78: tmp = math.sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0)) else: tmp = -1.0 * math.sqrt(((F / B_m) * 2.0)) 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 (F <= 1.166e-307) tmp = sqrt(Float64(-1.0 * Float64(F / A))); elseif (F <= 8.8e+45) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); elseif (F <= 6.7e+78) tmp = sqrt(Float64(Float64(Float64(F * Float64(2.0 * C)) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C)))) * 2.0)); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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 (F <= 1.166e-307)
tmp = sqrt((-1.0 * (F / A)));
elseif (F <= 8.8e+45)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
elseif (F <= 6.7e+78)
tmp = sqrt((((F * (2.0 * C)) / ((B_m * B_m) - (4.0 * (A * C)))) * 2.0));
else
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
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[F, 1.166e-307], N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[F, 8.8e+45], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[F, 6.7e+78], N[Sqrt[N[(N[(N[(F * N[(2.0 * C), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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}\;F \leq 1.166 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;F \leq 8.8 \cdot 10^{+45}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{elif}\;F \leq 6.7 \cdot 10^{+78}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(2 \cdot C\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)} \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < 1.16600000000000009e-307Initial program 26.1%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites28.1%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6477.5
Applied rewrites77.5%
if 1.16600000000000009e-307 < F < 8.8000000000000001e45Initial program 20.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6422.1
Applied rewrites22.1%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6449.0
Applied rewrites49.0%
if 8.8000000000000001e45 < F < 6.69999999999999967e78Initial program 17.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites1.2%
Taylor expanded in A around -inf
lift-*.f6413.4
Applied rewrites13.4%
if 6.69999999999999967e78 < F Initial program 13.7%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6438.9
Applied rewrites38.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.5e-29)
(/
(- (sqrt (* (* 2.0 (* (- (* B_m B_m) (* (* 4.0 A) C)) F)) (* 2.0 C))))
(fma -4.0 (* A C) (* B_m B_m)))
(if (<= B_m 5.6e+248)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.5e-29) {
tmp = -sqrt(((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F)) * (2.0 * C))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (B_m <= 5.6e+248) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.5e-29) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) * F)) * Float64(2.0 * C)))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif (B_m <= 5.6e+248) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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, 4.5e-29], N[((-N[Sqrt[N[(N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+248], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.5 \cdot 10^{-29}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(\left(B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+248}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 4.4999999999999998e-29Initial program 20.7%
Taylor expanded in A around -inf
lower-*.f6444.4
Applied rewrites44.4%
lift-pow.f64N/A
pow2N/A
lift-*.f6444.4
lift-pow.f64N/A
pow2N/A
lift-*.f6444.4
Applied rewrites44.4%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.4
Applied rewrites44.4%
if 4.4999999999999998e-29 < B < 5.6000000000000004e248Initial program 21.3%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.6
Applied rewrites27.6%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6448.8
Applied rewrites48.8%
if 5.6000000000000004e248 < B Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6452.2
Applied rewrites52.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.2e-39)
(/
(- (sqrt (* (* 2.0 (* (* -4.0 (* A C)) F)) (* 2.0 C))))
(fma -4.0 (* A C) (* B_m B_m)))
(if (<= B_m 5.6e+248)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.2e-39) {
tmp = -sqrt(((2.0 * ((-4.0 * (A * C)) * F)) * (2.0 * C))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (B_m <= 5.6e+248) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.2e-39) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(Float64(-4.0 * Float64(A * C)) * F)) * Float64(2.0 * C)))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif (B_m <= 5.6e+248) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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, 4.2e-39], N[((-N[Sqrt[N[(N[(2.0 * N[(N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+248], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.2 \cdot 10^{-39}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+248}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 4.19999999999999987e-39Initial program 20.2%
Taylor expanded in A around -inf
lower-*.f6444.1
Applied rewrites44.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6444.1
lift-pow.f64N/A
pow2N/A
lift-*.f6444.1
Applied rewrites44.1%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.1
Applied rewrites44.1%
Taylor expanded in A around inf
pow2N/A
lower-*.f64N/A
lift-*.f6442.2
Applied rewrites42.2%
if 4.19999999999999987e-39 < B < 5.6000000000000004e248Initial program 21.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.6
Applied rewrites27.6%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6448.1
Applied rewrites48.1%
if 5.6000000000000004e248 < B Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6452.2
Applied rewrites52.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.2e-39)
(/
(- (sqrt (* (* -8.0 (* A (* C F))) (* 2.0 C))))
(fma -4.0 (* A C) (* B_m B_m)))
(if (<= B_m 5.6e+248)
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.2e-39) {
tmp = -sqrt(((-8.0 * (A * (C * F))) * (2.0 * C))) / fma(-4.0, (A * C), (B_m * B_m));
} else if (B_m <= 5.6e+248) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.2e-39) tmp = Float64(Float64(-sqrt(Float64(Float64(-8.0 * Float64(A * Float64(C * F))) * Float64(2.0 * C)))) / fma(-4.0, Float64(A * C), Float64(B_m * B_m))); elseif (B_m <= 5.6e+248) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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, 4.2e-39], N[((-N[Sqrt[N[(N[(-8.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+248], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.2 \cdot 10^{-39}:\\
\;\;\;\;\frac{-\sqrt{\left(-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)\right) \cdot \left(2 \cdot C\right)}}{\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+248}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 4.19999999999999987e-39Initial program 20.2%
Taylor expanded in A around -inf
lower-*.f6444.1
Applied rewrites44.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6444.1
lift-pow.f64N/A
pow2N/A
lift-*.f6444.1
Applied rewrites44.1%
Taylor expanded in A around 0
pow2N/A
lower-fma.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.1
Applied rewrites44.1%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6440.9
Applied rewrites40.9%
if 4.19999999999999987e-39 < B < 5.6000000000000004e248Initial program 21.7%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6427.6
Applied rewrites27.6%
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lower-hypot.f6448.1
Applied rewrites48.1%
if 5.6000000000000004e248 < B Initial program 0.0%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6452.2
Applied rewrites52.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.5e-27)
(sqrt (* -1.0 (/ F A)))
(if (<= B_m 2.45e+138)
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(* (sqrt F) (sqrt (+ C (sqrt (fma B_m B_m (* C C))))))))
(* -1.0 (sqrt (* (/ F B_m) 2.0))))))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.5e-27) {
tmp = sqrt((-1.0 * (F / A)));
} else if (B_m <= 2.45e+138) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + sqrt(fma(B_m, B_m, (C * C)))))));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
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.5e-27) tmp = sqrt(Float64(-1.0 * Float64(F / A))); elseif (B_m <= 2.45e+138) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(C + sqrt(fma(B_m, B_m, Float64(C * C)))))))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); 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.5e-27], N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[B$95$m, 2.45e+138], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[N[(B$95$m * B$95$m + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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.5 \cdot 10^{-27}:\\
\;\;\;\;\sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 2.45 \cdot 10^{+138}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{C + \sqrt{\mathsf{fma}\left(B\_m, B\_m, C \cdot C\right)}}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if B < 3.5000000000000001e-27Initial program 20.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.0
Applied rewrites35.0%
if 3.5000000000000001e-27 < B < 2.44999999999999992e138Initial program 33.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6439.8
Applied rewrites39.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-sqrt.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
Applied rewrites44.6%
if 2.44999999999999992e138 < B Initial program 1.6%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6450.5
Applied rewrites50.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 (<= (pow B_m 2.0) 1e-58) (sqrt (* -1.0 (/ F A))) (* -1.0 (sqrt (* (/ F B_m) 2.0)))))
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-58) {
tmp = sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if ((b_m ** 2.0d0) <= 1d-58) then
tmp = sqrt(((-1.0d0) * (f / a)))
else
tmp = (-1.0d0) * sqrt(((f / b_m) * 2.0d0))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e-58) {
tmp = Math.sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * Math.sqrt(((F / B_m) * 2.0));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e-58: tmp = math.sqrt((-1.0 * (F / A))) else: tmp = -1.0 * math.sqrt(((F / B_m) * 2.0)) 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-58) tmp = sqrt(Float64(-1.0 * Float64(F / A))); else tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e-58)
tmp = sqrt((-1.0 * (F / A)));
else
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-58], N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $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^{-58}:\\
\;\;\;\;\sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-58Initial program 20.7%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites8.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.0
Applied rewrites35.0%
if 1e-58 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.6%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6442.8
Applied rewrites42.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 (* -1.0 (/ F A))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-1.0 * (F / A)));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((-1.0d0) * (f / a)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((-1.0 * (F / A)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((-1.0 * (F / A)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(-1.0 * Float64(F / A))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((-1.0 * (F / A)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{-1 \cdot \frac{F}{A}}
\end{array}
Initial program 19.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites4.7%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6421.2
Applied rewrites21.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 = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
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 19.0%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites4.7%
Taylor expanded in B around -inf
lower-*.f64N/A
lift-/.f641.6
Applied rewrites1.6%
herbie shell --seed 2025108
(FPCore (A B C F)
:name "ABCF->ab-angle a"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))