
(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 (* (* 4.0 A) C))
(t_1 (- (* B_m B_m) t_0))
(t_2 (* 2.0 (* t_1 F))))
(if (<= B_m 1.06e-178)
(/ (- (sqrt (* t_2 (* 2.0 C)))) t_1)
(if (<= B_m 3e-103)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(if (<= B_m 9.4e-60)
(/ (- (sqrt (* t_2 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))) t_1)
(if (<= B_m 9.2e+107)
(/
(- (* (* B_m (sqrt 2.0)) (* (sqrt F) (sqrt (+ C (hypot B_m C))))))
(- (pow B_m 2.0) t_0))
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(* (sqrt F) (sqrt (+ A (hypot A B_m))))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = (B_m * B_m) - t_0;
double t_2 = 2.0 * (t_1 * F);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 3e-103) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else if (B_m <= 9.4e-60) {
tmp = -sqrt((t_2 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_1;
} else if (B_m <= 9.2e+107) {
tmp = -((B_m * sqrt(2.0)) * (sqrt(F) * sqrt((C + hypot(B_m, C))))) / (pow(B_m, 2.0) - t_0);
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(Float64(B_m * B_m) - t_0) t_2 = Float64(2.0 * Float64(t_1 * F)) tmp = 0.0 if (B_m <= 1.06e-178) tmp = Float64(Float64(-sqrt(Float64(t_2 * Float64(2.0 * C)))) / t_1); elseif (B_m <= 3e-103) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); elseif (B_m <= 9.4e-60) tmp = Float64(Float64(-sqrt(Float64(t_2 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))))) / t_1); elseif (B_m <= 9.2e+107) tmp = Float64(Float64(-Float64(Float64(B_m * sqrt(2.0)) * Float64(sqrt(F) * sqrt(Float64(C + hypot(B_m, C)))))) / Float64((B_m ^ 2.0) - t_0)); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(A + hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.06e-178], N[((-N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 3e-103], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 9.4e-60], N[((-N[Sqrt[N[(t$95$2 * N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 9.2e+107], N[((-N[(N[(B$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := B\_m \cdot B\_m - t\_0\\
t_2 := 2 \cdot \left(t\_1 \cdot F\right)\\
\mathbf{if}\;B\_m \leq 1.06 \cdot 10^{-178}:\\
\;\;\;\;\frac{-\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{-103}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 9.4 \cdot 10^{-60}:\\
\;\;\;\;\frac{-\sqrt{t\_2 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 9.2 \cdot 10^{+107}:\\
\;\;\;\;\frac{-\left(B\_m \cdot \sqrt{2}\right) \cdot \left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(B\_m, C\right)}\right)}{{B\_m}^{2} - t\_0}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + \mathsf{hypot}\left(A, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178Initial program 18.0%
Taylor expanded in B around inf
Applied rewrites6.3%
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
Applied rewrites6.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.4
Applied rewrites45.4%
if 1.05999999999999999e-178 < B < 3e-103Initial program 21.2%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites20.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.5
Applied rewrites35.5%
if 3e-103 < B < 9.4e-60Initial program 28.7%
Taylor expanded in B around inf
Applied rewrites14.4%
lift-pow.f64N/A
pow2N/A
lift-*.f6414.4
lift-pow.f64N/A
pow2N/A
lift-*.f6414.4
Applied rewrites14.4%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6444.1
Applied rewrites44.1%
if 9.4e-60 < B < 9.2000000000000001e107Initial program 32.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6439.6
Applied rewrites39.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6444.1
Applied rewrites44.1%
if 9.2000000000000001e107 < B Initial program 4.5%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6448.4
Applied rewrites48.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6471.6
Applied rewrites71.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m))
(t_1 (- (* B_m B_m) (* (* 4.0 A) C)))
(t_2 (* 2.0 (* t_1 F))))
(if (<= B_m 1.06e-178)
(/ (- (sqrt (* t_2 (* 2.0 C)))) t_1)
(if (<= B_m 4.1e-81)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(if (<= B_m 5.4e-29)
(/ (- (* (sqrt t_2) (sqrt (+ (+ A C) (hypot (- A C) B_m))))) t_1)
(if (<= B_m 1.55e+55)
(* -1.0 (* t_0 (* (sqrt F) (sqrt (* -0.5 (/ (* B_m B_m) A))))))
(* -1.0 (* t_0 (* (sqrt F) (sqrt (+ A (hypot A B_m))))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = sqrt(2.0) / B_m;
double t_1 = (B_m * B_m) - ((4.0 * A) * C);
double t_2 = 2.0 * (t_1 * F);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 4.1e-81) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else if (B_m <= 5.4e-29) {
tmp = -(sqrt(t_2) * sqrt(((A + C) + hypot((A - C), B_m)))) / t_1;
} else if (B_m <= 1.55e+55) {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((-0.5 * ((B_m * B_m) / A)))));
} else {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((A + hypot(A, 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 t_0 = Math.sqrt(2.0) / B_m;
double t_1 = (B_m * B_m) - ((4.0 * A) * C);
double t_2 = 2.0 * (t_1 * F);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -Math.sqrt((t_2 * (2.0 * C))) / t_1;
} else if (B_m <= 4.1e-81) {
tmp = -1.0 * Math.sqrt((-1.0 * (F / A)));
} else if (B_m <= 5.4e-29) {
tmp = -(Math.sqrt(t_2) * Math.sqrt(((A + C) + Math.hypot((A - C), B_m)))) / t_1;
} else if (B_m <= 1.55e+55) {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((-0.5 * ((B_m * B_m) / A)))));
} else {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((A + Math.hypot(A, 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): t_0 = math.sqrt(2.0) / B_m t_1 = (B_m * B_m) - ((4.0 * A) * C) t_2 = 2.0 * (t_1 * F) tmp = 0 if B_m <= 1.06e-178: tmp = -math.sqrt((t_2 * (2.0 * C))) / t_1 elif B_m <= 4.1e-81: tmp = -1.0 * math.sqrt((-1.0 * (F / A))) elif B_m <= 5.4e-29: tmp = -(math.sqrt(t_2) * math.sqrt(((A + C) + math.hypot((A - C), B_m)))) / t_1 elif B_m <= 1.55e+55: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((-0.5 * ((B_m * B_m) / A))))) else: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((A + math.hypot(A, B_m))))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(sqrt(2.0) / B_m) t_1 = Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) t_2 = Float64(2.0 * Float64(t_1 * F)) tmp = 0.0 if (B_m <= 1.06e-178) tmp = Float64(Float64(-sqrt(Float64(t_2 * Float64(2.0 * C)))) / t_1); elseif (B_m <= 4.1e-81) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); elseif (B_m <= 5.4e-29) tmp = Float64(Float64(-Float64(sqrt(t_2) * sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))))) / t_1); elseif (B_m <= 1.55e+55) tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(-0.5 * Float64(Float64(B_m * B_m) / A)))))); else tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(A + hypot(A, 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)
t_0 = sqrt(2.0) / B_m;
t_1 = (B_m * B_m) - ((4.0 * A) * C);
t_2 = 2.0 * (t_1 * F);
tmp = 0.0;
if (B_m <= 1.06e-178)
tmp = -sqrt((t_2 * (2.0 * C))) / t_1;
elseif (B_m <= 4.1e-81)
tmp = -1.0 * sqrt((-1.0 * (F / A)));
elseif (B_m <= 5.4e-29)
tmp = -(sqrt(t_2) * sqrt(((A + C) + hypot((A - C), B_m)))) / t_1;
elseif (B_m <= 1.55e+55)
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((-0.5 * ((B_m * B_m) / A)))));
else
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((A + hypot(A, 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_] := Block[{t$95$0 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.06e-178], N[((-N[Sqrt[N[(t$95$2 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 4.1e-81], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.4e-29], N[((-N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 1.55e+55], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{2}}{B\_m}\\
t_1 := B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(t\_1 \cdot F\right)\\
\mathbf{if}\;B\_m \leq 1.06 \cdot 10^{-178}:\\
\;\;\;\;\frac{-\sqrt{t\_2 \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 4.1 \cdot 10^{-81}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 5.4 \cdot 10^{-29}:\\
\;\;\;\;\frac{-\sqrt{t\_2} \cdot \sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 1.55 \cdot 10^{+55}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{-0.5 \cdot \frac{B\_m \cdot B\_m}{A}}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{A + \mathsf{hypot}\left(A, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178Initial program 18.0%
Taylor expanded in B around inf
Applied rewrites6.3%
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
Applied rewrites6.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.4
Applied rewrites45.4%
if 1.05999999999999999e-178 < B < 4.09999999999999984e-81Initial program 22.9%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites23.3%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6436.6
Applied rewrites36.6%
if 4.09999999999999984e-81 < B < 5.40000000000000045e-29Initial program 29.3%
Applied rewrites36.0%
Applied rewrites43.6%
if 5.40000000000000045e-29 < B < 1.54999999999999997e55Initial program 35.6%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6428.6
Applied rewrites28.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6429.0
Applied rewrites29.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f6438.4
Applied rewrites38.4%
if 1.54999999999999997e55 < B Initial program 9.4%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6446.0
Applied rewrites46.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6465.7
Applied rewrites65.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
(let* ((t_0 (- (* B_m B_m) (* (* 4.0 A) C))) (t_1 (* 2.0 (* t_0 F))))
(if (<= B_m 1.06e-178)
(/ (- (sqrt (* t_1 (* 2.0 C)))) t_0)
(if (<= B_m 3e-103)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(if (<= B_m 3.8e-57)
(/ (- (sqrt (* t_1 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))) t_0)
(*
-1.0
(* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ A (hypot A B_m)))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = 2.0 * (t_0 * F);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -sqrt((t_1 * (2.0 * C))) / t_0;
} else if (B_m <= 3e-103) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else if (B_m <= 3.8e-57) {
tmp = -sqrt((t_1 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_0;
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = 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 <= 1.06e-178) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(2.0 * C)))) / t_0); elseif (B_m <= 3e-103) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); elseif (B_m <= 3.8e-57) tmp = Float64(Float64(-sqrt(Float64(t_1 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))))) / t_0); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(A + hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(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, 1.06e-178], N[((-N[Sqrt[N[(t$95$1 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 3e-103], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.8e-57], 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], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := 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 1.06 \cdot 10^{-178}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{-103}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 3.8 \cdot 10^{-57}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + \mathsf{hypot}\left(A, B\_m\right)}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178Initial program 18.0%
Taylor expanded in B around inf
Applied rewrites6.3%
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
Applied rewrites6.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.4
Applied rewrites45.4%
if 1.05999999999999999e-178 < B < 3e-103Initial program 21.2%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites20.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.5
Applied rewrites35.5%
if 3e-103 < B < 3.7999999999999997e-57Initial program 28.0%
Taylor expanded in B around inf
Applied rewrites14.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6414.1
lift-pow.f64N/A
pow2N/A
lift-*.f6414.1
Applied rewrites14.1%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6443.0
Applied rewrites43.0%
if 3.7999999999999997e-57 < B Initial program 17.2%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6439.9
Applied rewrites39.9%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6453.6
Applied rewrites53.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 (if (<= (pow B_m 2.0) 1e-118) (* -1.0 (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-118) {
tmp = -1.0 * 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-118) then
tmp = (-1.0d0) * 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-118) {
tmp = -1.0 * 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-118: tmp = -1.0 * 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-118) tmp = Float64(-1.0 * 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-118)
tmp = -1.0 * 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-118], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $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}^{2} \leq 10^{-118}:\\
\;\;\;\;-1 \cdot \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)) < 9.99999999999999985e-119Initial program 20.8%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites20.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6438.2
Applied rewrites38.2%
if 9.99999999999999985e-119 < (pow.f64 B #s(literal 2 binary64)) Initial program 17.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6439.8
Applied rewrites39.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (* B_m B_m) (* (* 4.0 A) C))) (t_1 (* 2.0 (* t_0 F))))
(if (<= B_m 1.06e-178)
(/ (- (sqrt (* t_1 (* 2.0 C)))) t_0)
(if (<= B_m 3e-103)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(if (<= B_m 3.8e-57)
(/ (- (sqrt (* t_1 (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C))))) t_0)
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(* (sqrt F) (sqrt (+ B_m (* A (+ 1.0 (* 0.5 (/ A B_m))))))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = 2.0 * (t_0 * F);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -sqrt((t_1 * (2.0 * C))) / t_0;
} else if (B_m <= 3e-103) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else if (B_m <= 3.8e-57) {
tmp = -sqrt((t_1 * fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / t_0;
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((B_m + (A * (1.0 + (0.5 * (A / B_m))))))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = 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 <= 1.06e-178) tmp = Float64(Float64(-sqrt(Float64(t_1 * Float64(2.0 * C)))) / t_0); elseif (B_m <= 3e-103) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); elseif (B_m <= 3.8e-57) tmp = Float64(Float64(-sqrt(Float64(t_1 * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))))) / t_0); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(B_m + Float64(A * Float64(1.0 + Float64(0.5 * Float64(A / B_m))))))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(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, 1.06e-178], N[((-N[Sqrt[N[(t$95$1 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 3e-103], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.8e-57], 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], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + N[(A * N[(1.0 + N[(0.5 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := 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 1.06 \cdot 10^{-178}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{-103}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 3.8 \cdot 10^{-57}:\\
\;\;\;\;\frac{-\sqrt{t\_1 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + A \cdot \left(1 + 0.5 \cdot \frac{A}{B\_m}\right)}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178Initial program 18.0%
Taylor expanded in B around inf
Applied rewrites6.3%
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
Applied rewrites6.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.4
Applied rewrites45.4%
if 1.05999999999999999e-178 < B < 3e-103Initial program 21.2%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites20.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.5
Applied rewrites35.5%
if 3e-103 < B < 3.7999999999999997e-57Initial program 28.0%
Taylor expanded in B around inf
Applied rewrites14.1%
lift-pow.f64N/A
pow2N/A
lift-*.f6414.1
lift-pow.f64N/A
pow2N/A
lift-*.f6414.1
Applied rewrites14.1%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6443.0
Applied rewrites43.0%
if 3.7999999999999997e-57 < B Initial program 17.2%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6439.9
Applied rewrites39.9%
Taylor expanded in A around 0
lower-+.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f6439.1
Applied rewrites39.1%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f6452.8
Applied rewrites52.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (* B_m B_m) (* (* 4.0 A) C)))
(t_1 (/ (- (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 C)))) t_0)))
(if (<= B_m 1.06e-178)
t_1
(if (<= B_m 3e-103)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(if (<= B_m 3.4e-57)
t_1
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(* (sqrt F) (sqrt (+ B_m (* A (+ 1.0 (* 0.5 (/ A B_m))))))))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
double tmp;
if (B_m <= 1.06e-178) {
tmp = t_1;
} else if (B_m <= 3e-103) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else if (B_m <= 3.4e-57) {
tmp = t_1;
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((B_m + (A * (1.0 + (0.5 * (A / B_m))))))));
}
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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (b_m * b_m) - ((4.0d0 * a) * c)
t_1 = -sqrt(((2.0d0 * (t_0 * f)) * (2.0d0 * c))) / t_0
if (b_m <= 1.06d-178) then
tmp = t_1
else if (b_m <= 3d-103) then
tmp = (-1.0d0) * sqrt(((-1.0d0) * (f / a)))
else if (b_m <= 3.4d-57) then
tmp = t_1
else
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt((b_m + (a * (1.0d0 + (0.5d0 * (a / 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 t_0 = (B_m * B_m) - ((4.0 * A) * C);
double t_1 = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
double tmp;
if (B_m <= 1.06e-178) {
tmp = t_1;
} else if (B_m <= 3e-103) {
tmp = -1.0 * Math.sqrt((-1.0 * (F / A)));
} else if (B_m <= 3.4e-57) {
tmp = t_1;
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt((B_m + (A * (1.0 + (0.5 * (A / 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): t_0 = (B_m * B_m) - ((4.0 * A) * C) t_1 = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0 tmp = 0 if B_m <= 1.06e-178: tmp = t_1 elif B_m <= 3e-103: tmp = -1.0 * math.sqrt((-1.0 * (F / A))) elif B_m <= 3.4e-57: tmp = t_1 else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt((B_m + (A * (1.0 + (0.5 * (A / B_m)))))))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) t_1 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0) tmp = 0.0 if (B_m <= 1.06e-178) tmp = t_1; elseif (B_m <= 3e-103) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); elseif (B_m <= 3.4e-57) tmp = t_1; else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(B_m + Float64(A * Float64(1.0 + Float64(0.5 * Float64(A / 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)
t_0 = (B_m * B_m) - ((4.0 * A) * C);
t_1 = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
tmp = 0.0;
if (B_m <= 1.06e-178)
tmp = t_1;
elseif (B_m <= 3e-103)
tmp = -1.0 * sqrt((-1.0 * (F / A)));
elseif (B_m <= 3.4e-57)
tmp = t_1;
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((B_m + (A * (1.0 + (0.5 * (A / 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_] := 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[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 1.06e-178], t$95$1, If[LessEqual[B$95$m, 3e-103], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.4e-57], t$95$1, N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + N[(A * N[(1.0 + N[(0.5 * N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\\
t_1 := \frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{if}\;B\_m \leq 1.06 \cdot 10^{-178}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;B\_m \leq 3 \cdot 10^{-103}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{elif}\;B\_m \leq 3.4 \cdot 10^{-57}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m + A \cdot \left(1 + 0.5 \cdot \frac{A}{B\_m}\right)}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178 or 3e-103 < B < 3.40000000000000016e-57Initial program 20.6%
Taylor expanded in B around inf
Applied rewrites8.3%
lift-pow.f64N/A
pow2N/A
lift-*.f648.3
lift-pow.f64N/A
pow2N/A
lift-*.f648.3
Applied rewrites8.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.1
Applied rewrites45.1%
if 1.05999999999999999e-178 < B < 3e-103Initial program 21.2%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites20.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.5
Applied rewrites35.5%
if 3.40000000000000016e-57 < B Initial program 17.2%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6439.9
Applied rewrites39.9%
Taylor expanded in A around 0
lower-+.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f6439.1
Applied rewrites39.1%
lift-sqrt.f64N/A
lift-*.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lift-sqrt.f64N/A
lower-sqrt.f6452.8
Applied rewrites52.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (- (* B_m B_m) (* (* 4.0 A) C))))
(if (<= B_m 1.06e-178)
(/ (- (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 C)))) t_0)
(if (<= B_m 2.8e+43)
(* -1.0 (sqrt (* -1.0 (/ F A))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ A B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = (B_m * B_m) - ((4.0 * A) * C);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
} else if (B_m <= 2.8e+43) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + B_m))));
}
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) :: t_0
real(8) :: tmp
t_0 = (b_m * b_m) - ((4.0d0 * a) * c)
if (b_m <= 1.06d-178) then
tmp = -sqrt(((2.0d0 * (t_0 * f)) * (2.0d0 * c))) / t_0
else if (b_m <= 2.8d+43) then
tmp = (-1.0d0) * sqrt(((-1.0d0) * (f / a)))
else
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt((a + 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 t_0 = (B_m * B_m) - ((4.0 * A) * C);
double tmp;
if (B_m <= 1.06e-178) {
tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
} else if (B_m <= 2.8e+43) {
tmp = -1.0 * Math.sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt((A + 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): t_0 = (B_m * B_m) - ((4.0 * A) * C) tmp = 0 if B_m <= 1.06e-178: tmp = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0 elif B_m <= 2.8e+43: tmp = -1.0 * math.sqrt((-1.0 * (F / A))) else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt((A + B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if (B_m <= 1.06e-178) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0); elseif (B_m <= 2.8e+43) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(A + 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)
t_0 = (B_m * B_m) - ((4.0 * A) * C);
tmp = 0.0;
if (B_m <= 1.06e-178)
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
elseif (B_m <= 2.8e+43)
tmp = -1.0 * sqrt((-1.0 * (F / A)));
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + 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_] := Block[{t$95$0 = N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 1.06e-178], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[B$95$m, 2.8e+43], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + B$95$m), $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 := B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 1.06 \cdot 10^{-178}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{elif}\;B\_m \leq 2.8 \cdot 10^{+43}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 1.05999999999999999e-178Initial program 18.0%
Taylor expanded in B around inf
Applied rewrites6.3%
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
lift-pow.f64N/A
pow2N/A
lift-*.f646.3
Applied rewrites6.3%
Taylor expanded in A around -inf
pow2N/A
pow2N/A
lower-*.f6445.4
Applied rewrites45.4%
if 1.05999999999999999e-178 < B < 2.80000000000000019e43Initial program 28.3%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites32.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6435.1
Applied rewrites35.1%
if 2.80000000000000019e43 < B Initial program 10.7%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6445.6
Applied rewrites45.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6464.6
Applied rewrites64.6%
Taylor expanded in A around 0
Applied rewrites62.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 (if (<= B_m 2.8e+43) (* -1.0 (sqrt (* -1.0 (/ F A)))) (* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ A B_m)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.8e+43) {
tmp = -1.0 * sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + B_m))));
}
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.8d+43) then
tmp = (-1.0d0) * sqrt(((-1.0d0) * (f / a)))
else
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt((a + b_m))))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2.8e+43) {
tmp = -1.0 * Math.sqrt((-1.0 * (F / A)));
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt((A + B_m))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 2.8e+43: tmp = -1.0 * math.sqrt((-1.0 * (F / A))) else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt((A + B_m)))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2.8e+43) tmp = Float64(-1.0 * sqrt(Float64(-1.0 * Float64(F / A)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(A + B_m))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 2.8e+43)
tmp = -1.0 * sqrt((-1.0 * (F / A)));
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((A + B_m))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.8e+43], N[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(A + B$95$m), $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.8 \cdot 10^{+43}:\\
\;\;\;\;-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{A + B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 2.80000000000000019e43Initial program 24.5%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites26.0%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6436.7
Applied rewrites36.7%
if 2.80000000000000019e43 < B Initial program 10.7%
Taylor expanded in C 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
unpow2N/A
unpow2N/A
lower-hypot.f6445.6
Applied rewrites45.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-hypot.f64N/A
sqrt-prodN/A
pow2N/A
pow2N/A
lower-*.f64N/A
lower-sqrt.f64N/A
pow2N/A
pow2N/A
lower-sqrt.f64N/A
lift-hypot.f64N/A
lift-+.f6464.6
Applied rewrites64.6%
Taylor expanded in A around 0
Applied rewrites62.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 (* -1.0 (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 -1.0 * 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 = (-1.0d0) * 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 -1.0 * 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 -1.0 * 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 Float64(-1.0 * 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 = -1.0 * 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[(-1.0 * N[Sqrt[N[(-1.0 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-1 \cdot \sqrt{-1 \cdot \frac{F}{A}}
\end{array}
Initial program 18.6%
Taylor expanded in F around 0
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites23.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-/.f6428.0
Applied rewrites28.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* (/ 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) {
return sqrt(((F / B_m) * 2.0));
}
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(((f / b_m) * 2.0d0))
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 / B_m) * 2.0));
}
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 / B_m) * 2.0))
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 / B_m) * 2.0)) 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 / B_m) * 2.0));
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 / B$95$m), $MachinePrecision] * 2.0), $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}{B\_m} \cdot 2}
\end{array}
Initial program 18.6%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6426.9
Applied rewrites26.9%
Taylor expanded in F around -inf
sqrt-unprodN/A
metadata-evalN/A
sqrt-prodN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f642.4
Applied rewrites2.4%
herbie shell --seed 2025106
(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))))