
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
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 (- (pow B_m 2.0) (* (* 4.0 A) C))))
(if (<= (pow B_m 2.0) 5e+14)
(/ (- (sqrt (* (* 2.0 (* t_0 F)) (* 2.0 C)))) t_0)
(* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ C (hypot B_m C)))))))))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 = pow(B_m, 2.0) - ((4.0 * A) * C);
double tmp;
if (pow(B_m, 2.0) <= 5e+14) {
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + hypot(B_m, C)))));
}
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.pow(B_m, 2.0) - ((4.0 * A) * C);
double tmp;
if (Math.pow(B_m, 2.0) <= 5e+14) {
tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt((C + Math.hypot(B_m, C)))));
}
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.pow(B_m, 2.0) - ((4.0 * A) * C) tmp = 0 if math.pow(B_m, 2.0) <= 5e+14: tmp = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0 else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt((C + math.hypot(B_m, C))))) 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((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+14) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(C + hypot(B_m, C)))))); 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 ^ 2.0) - ((4.0 * A) * C);
tmp = 0.0;
if ((B_m ^ 2.0) <= 5e+14)
tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + hypot(B_m, C)))));
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[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+14], 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], 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[B$95$m ^ 2 + C ^ 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}^{2} - \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+14}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(B\_m, C\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5e14Initial program 23.9%
Taylor expanded in A around -inf
lower-*.f6444.1
Applied rewrites44.1%
if 5e14 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.5%
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
unpow2N/A
unpow2N/A
lower-hypot.f6450.8
Applied rewrites50.8%
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-+.f6472.9
Applied rewrites72.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m)))
(if (<= (pow B_m 2.0) 5e+14)
(/
(- (sqrt (* C (fma -16.0 (* A (* C F)) (* 8.0 (* (* B_m B_m) F))))))
(* A (- (/ (* B_m B_m) A) (* 4.0 C))))
(if (<= (pow B_m 2.0) 2e+296)
(* -1.0 (* t_0 (sqrt (* F (+ C (hypot B_m C))))))
(*
-1.0
(* t_0 (fma (sqrt B_m) (sqrt F) (* 0.5 (* (sqrt (/ F B_m)) C)))))))))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 tmp;
if (pow(B_m, 2.0) <= 5e+14) {
tmp = -sqrt((C * fma(-16.0, (A * (C * F)), (8.0 * ((B_m * B_m) * F))))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else if (pow(B_m, 2.0) <= 2e+296) {
tmp = -1.0 * (t_0 * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * (t_0 * fma(sqrt(B_m), sqrt(F), (0.5 * (sqrt((F / B_m)) * C))));
}
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) tmp = 0.0 if ((B_m ^ 2.0) <= 5e+14) tmp = Float64(Float64(-sqrt(Float64(C * fma(-16.0, Float64(A * Float64(C * F)), Float64(8.0 * Float64(Float64(B_m * B_m) * F)))))) / Float64(A * Float64(Float64(Float64(B_m * B_m) / A) - Float64(4.0 * C)))); elseif ((B_m ^ 2.0) <= 2e+296) tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * Float64(t_0 * fma(sqrt(B_m), sqrt(F), Float64(0.5 * Float64(sqrt(Float64(F / B_m)) * C))))); 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[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+14], N[((-N[Sqrt[N[(C * N[(-16.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision] + N[(8.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] - N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+296], N[(-1.0 * N[(t$95$0 * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[F], $MachinePrecision] + N[(0.5 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * C), $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}\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+14}:\\
\;\;\;\;\frac{-\sqrt{C \cdot \mathsf{fma}\left(-16, A \cdot \left(C \cdot F\right), 8 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot F\right)\right)}}{A \cdot \left(\frac{B\_m \cdot B\_m}{A} - 4 \cdot C\right)}\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+296}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \mathsf{fma}\left(\sqrt{B\_m}, \sqrt{F}, 0.5 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot C\right)\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5e14Initial program 23.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6427.8
Applied rewrites27.8%
Taylor expanded in C around inf
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6427.4
Applied rewrites27.4%
Taylor expanded in A around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6427.4
Applied rewrites27.4%
Taylor expanded in C around 0
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f6440.4
Applied rewrites40.4%
if 5e14 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999996e296Initial program 30.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
unpow2N/A
unpow2N/A
lower-hypot.f6446.3
Applied rewrites46.3%
if 1.99999999999999996e296 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.9%
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
unpow2N/A
unpow2N/A
lower-hypot.f6454.6
Applied rewrites54.6%
Taylor expanded in C around 0
sqrt-prodN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f6477.3
Applied rewrites77.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= (pow B_m 2.0) 4e-46)
(/
(- (sqrt (* C (fma -16.0 (* A (* C F)) (* 8.0 (* (* B_m B_m) F))))))
(* A (- (/ (* B_m B_m) A) (* 4.0 C))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ C (hypot B_m C))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 4e-46) {
tmp = -sqrt((C * fma(-16.0, (A * (C * F)), (8.0 * ((B_m * B_m) * F))))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + hypot(B_m, C)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 4e-46) tmp = Float64(Float64(-sqrt(Float64(C * fma(-16.0, Float64(A * Float64(C * F)), Float64(8.0 * Float64(Float64(B_m * B_m) * F)))))) / Float64(A * Float64(Float64(Float64(B_m * B_m) / A) - Float64(4.0 * C)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(C + hypot(B_m, C)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-46], N[((-N[Sqrt[N[(C * N[(-16.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision] + N[(8.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] - N[(4.0 * C), $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[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-46}:\\
\;\;\;\;\frac{-\sqrt{C \cdot \mathsf{fma}\left(-16, A \cdot \left(C \cdot F\right), 8 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot F\right)\right)}}{A \cdot \left(\frac{B\_m \cdot B\_m}{A} - 4 \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(B\_m, C\right)}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000009e-46Initial program 22.6%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6428.7
Applied rewrites28.7%
Taylor expanded in C around inf
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6428.1
Applied rewrites28.1%
Taylor expanded in A around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6428.1
Applied rewrites28.1%
Taylor expanded in C around 0
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f6441.4
Applied rewrites41.4%
if 4.00000000000000009e-46 < (pow.f64 B #s(literal 2 binary64)) Initial program 16.4%
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
unpow2N/A
unpow2N/A
lower-hypot.f6449.6
Applied rewrites49.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-+.f6469.9
Applied rewrites69.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 235000000.0)
(/
(- (sqrt (* C (fma -16.0 (* A (* C F)) (* 8.0 (* (* B_m B_m) F))))))
(* A (- (/ (* B_m B_m) A) (* 4.0 C))))
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(fma (sqrt B_m) (sqrt F) (* 0.5 (* (sqrt (/ F B_m)) C)))))))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 <= 235000000.0) {
tmp = -sqrt((C * fma(-16.0, (A * (C * F)), (8.0 * ((B_m * B_m) * F))))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * fma(sqrt(B_m), sqrt(F), (0.5 * (sqrt((F / B_m)) * C))));
}
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 <= 235000000.0) tmp = Float64(Float64(-sqrt(Float64(C * fma(-16.0, Float64(A * Float64(C * F)), Float64(8.0 * Float64(Float64(B_m * B_m) * F)))))) / Float64(A * Float64(Float64(Float64(B_m * B_m) / A) - Float64(4.0 * C)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * fma(sqrt(B_m), sqrt(F), Float64(0.5 * Float64(sqrt(Float64(F / B_m)) * C))))); 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, 235000000.0], N[((-N[Sqrt[N[(C * N[(-16.0 * N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision] + N[(8.0 * N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] - N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[F], $MachinePrecision] + N[(0.5 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * C), $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 235000000:\\
\;\;\;\;\frac{-\sqrt{C \cdot \mathsf{fma}\left(-16, A \cdot \left(C \cdot F\right), 8 \cdot \left(\left(B\_m \cdot B\_m\right) \cdot F\right)\right)}}{A \cdot \left(\frac{B\_m \cdot B\_m}{A} - 4 \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \mathsf{fma}\left(\sqrt{B\_m}, \sqrt{F}, 0.5 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot C\right)\right)\right)\\
\end{array}
\end{array}
if B < 2.35e8Initial program 23.9%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6427.8
Applied rewrites27.8%
Taylor expanded in C around inf
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6427.3
Applied rewrites27.3%
Taylor expanded in A around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6427.3
Applied rewrites27.3%
Taylor expanded in C around 0
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f6440.3
Applied rewrites40.3%
if 2.35e8 < B Initial program 14.5%
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
unpow2N/A
unpow2N/A
lower-hypot.f6450.9
Applied rewrites50.9%
Taylor expanded in C around 0
sqrt-prodN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f6461.3
Applied rewrites61.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.3e-48)
(/
(- (sqrt (* (* C C) (* -16.0 (* A F)))))
(* A (- (/ (* B_m B_m) A) (* 4.0 C))))
(*
-1.0
(*
(/ (sqrt 2.0) B_m)
(fma (sqrt B_m) (sqrt F) (* 0.5 (* (sqrt (/ F B_m)) C)))))))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.3e-48) {
tmp = -sqrt(((C * C) * (-16.0 * (A * F)))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * fma(sqrt(B_m), sqrt(F), (0.5 * (sqrt((F / B_m)) * C))));
}
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.3e-48) tmp = Float64(Float64(-sqrt(Float64(Float64(C * C) * Float64(-16.0 * Float64(A * F))))) / Float64(A * Float64(Float64(Float64(B_m * B_m) / A) - Float64(4.0 * C)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * fma(sqrt(B_m), sqrt(F), Float64(0.5 * Float64(sqrt(Float64(F / B_m)) * C))))); 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.3e-48], N[((-N[Sqrt[N[(N[(C * C), $MachinePrecision] * N[(-16.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] - N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[B$95$m], $MachinePrecision] * N[Sqrt[F], $MachinePrecision] + N[(0.5 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * C), $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 4.3 \cdot 10^{-48}:\\
\;\;\;\;\frac{-\sqrt{\left(C \cdot C\right) \cdot \left(-16 \cdot \left(A \cdot F\right)\right)}}{A \cdot \left(\frac{B\_m \cdot B\_m}{A} - 4 \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \mathsf{fma}\left(\sqrt{B\_m}, \sqrt{F}, 0.5 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot C\right)\right)\right)\\
\end{array}
\end{array}
if B < 4.3e-48Initial program 21.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.4
Applied rewrites29.4%
Taylor expanded in C around inf
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6428.5
Applied rewrites28.5%
Taylor expanded in A around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6428.6
Applied rewrites28.6%
Taylor expanded in A around inf
lower-*.f64N/A
lift-*.f6428.2
Applied rewrites28.2%
if 4.3e-48 < B Initial program 17.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
unpow2N/A
unpow2N/A
lower-hypot.f6448.3
Applied rewrites48.3%
Taylor expanded in C around 0
sqrt-prodN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f6455.8
Applied rewrites55.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.3e-48)
(/
(- (sqrt (* (* C C) (* -16.0 (* A F)))))
(* A (- (/ (* B_m B_m) A) (* 4.0 C))))
(* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.3e-48) {
tmp = -sqrt(((C * C) * (-16.0 * (A * F)))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(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 <= 4.3d-48) then
tmp = -sqrt(((c * c) * ((-16.0d0) * (a * f)))) / (a * (((b_m * b_m) / a) - (4.0d0 * c)))
else
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt(b_m)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.3e-48) {
tmp = -Math.sqrt(((C * C) * (-16.0 * (A * F)))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt(B_m)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4.3e-48: tmp = -math.sqrt(((C * C) * (-16.0 * (A * F)))) / (A * (((B_m * B_m) / A) - (4.0 * C))) else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt(B_m))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.3e-48) tmp = Float64(Float64(-sqrt(Float64(Float64(C * C) * Float64(-16.0 * Float64(A * F))))) / Float64(A * Float64(Float64(Float64(B_m * B_m) / A) - Float64(4.0 * C)))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(B_m)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4.3e-48)
tmp = -sqrt(((C * C) * (-16.0 * (A * F)))) / (A * (((B_m * B_m) / A) - (4.0 * C)));
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.3e-48], N[((-N[Sqrt[N[(N[(C * C), $MachinePrecision] * N[(-16.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(A * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] - N[(4.0 * C), $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[B$95$m], $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 4.3 \cdot 10^{-48}:\\
\;\;\;\;\frac{-\sqrt{\left(C \cdot C\right) \cdot \left(-16 \cdot \left(A \cdot F\right)\right)}}{A \cdot \left(\frac{B\_m \cdot B\_m}{A} - 4 \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 4.3e-48Initial program 21.4%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.4
Applied rewrites29.4%
Taylor expanded in C around inf
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6428.5
Applied rewrites28.5%
Taylor expanded in A around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6428.6
Applied rewrites28.6%
Taylor expanded in A around inf
lower-*.f64N/A
lift-*.f6428.2
Applied rewrites28.2%
if 4.3e-48 < B Initial program 17.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
unpow2N/A
unpow2N/A
lower-hypot.f6448.3
Applied rewrites48.3%
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-+.f6467.2
Applied rewrites67.2%
Taylor expanded in B around inf
Applied rewrites55.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 (/ (sqrt 2.0) B_m)))
(if (<= C 6.2e+204)
(* -1.0 (* t_0 (* (sqrt F) (sqrt B_m))))
(* -1.0 (* t_0 (* (sqrt F) (sqrt (+ C C))))))))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 tmp;
if (C <= 6.2e+204) {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt(B_m)));
} else {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + C))));
}
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 = sqrt(2.0d0) / b_m
if (c <= 6.2d+204) then
tmp = (-1.0d0) * (t_0 * (sqrt(f) * sqrt(b_m)))
else
tmp = (-1.0d0) * (t_0 * (sqrt(f) * sqrt((c + c))))
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 = Math.sqrt(2.0) / B_m;
double tmp;
if (C <= 6.2e+204) {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt(B_m)));
} else {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((C + C))));
}
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 tmp = 0 if C <= 6.2e+204: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt(B_m))) else: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((C + C)))) 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) tmp = 0.0 if (C <= 6.2e+204) tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(B_m)))); else tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(C + C))))); 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;
tmp = 0.0;
if (C <= 6.2e+204)
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt(B_m)));
else
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + C))));
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]}, If[LessEqual[C, 6.2e+204], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + C), $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}\\
\mathbf{if}\;C \leq 6.2 \cdot 10^{+204}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{B\_m}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{C + C}\right)\right)\\
\end{array}
\end{array}
if C < 6.2000000000000003e204Initial program 23.0%
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
unpow2N/A
unpow2N/A
lower-hypot.f6434.8
Applied rewrites34.8%
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-+.f6445.7
Applied rewrites45.7%
Taylor expanded in B around inf
Applied rewrites40.4%
if 6.2000000000000003e204 < C Initial program 1.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
unpow2N/A
unpow2N/A
lower-hypot.f6418.1
Applied rewrites18.1%
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-+.f6431.3
Applied rewrites31.3%
Taylor expanded in B around 0
Applied rewrites23.3%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 6e+218) (* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt B_m)))) (* -1.0 (* (/ 2.0 B_m) (sqrt (* C F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 6e+218) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)));
} else {
tmp = -1.0 * ((2.0 / B_m) * sqrt((C * F)));
}
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 (c <= 6d+218) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt(b_m)))
else
tmp = (-1.0d0) * ((2.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 6e+218) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt(B_m)));
} else {
tmp = -1.0 * ((2.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 6e+218: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt(B_m))) else: tmp = -1.0 * ((2.0 / B_m) * math.sqrt((C * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 6e+218) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(B_m)))); else tmp = Float64(-1.0 * Float64(Float64(2.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 6e+218)
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)));
else
tmp = -1.0 * ((2.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 6e+218], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $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}\;C \leq 6 \cdot 10^{+218}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{B\_m}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{2}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 6.0000000000000001e218Initial program 22.4%
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
unpow2N/A
unpow2N/A
lower-hypot.f6434.4
Applied rewrites34.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-+.f6445.5
Applied rewrites45.5%
Taylor expanded in B around inf
Applied rewrites39.8%
if 6.0000000000000001e218 < C Initial program 1.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
unpow2N/A
unpow2N/A
lower-hypot.f6417.7
Applied rewrites17.7%
Taylor expanded in B around 0
lower-*.f64N/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f6414.4
Applied rewrites14.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 0.8) (* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (+ C B_m))))) (* -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 <= 0.8) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + B_m))));
} 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 (f <= 0.8d0) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((f * (c + b_m))))
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 (F <= 0.8) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (C + B_m))));
} 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 <= 0.8: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (C + B_m)))) 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 <= 0.8) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(C + B_m))))); 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 <= 0.8)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (C + B_m))));
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, 0.8], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(C + B$95$m), $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}\;F \leq 0.8:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(C + B\_m\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < 0.80000000000000004Initial program 22.5%
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
unpow2N/A
unpow2N/A
lower-hypot.f6437.6
Applied rewrites37.6%
Taylor expanded in B around inf
Applied rewrites31.6%
if 0.80000000000000004 < F Initial program 15.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6439.4
Applied rewrites39.4%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 3.5e-47) (* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F B_m)))) (* -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 <= 3.5e-47) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * B_m)));
} 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 (f <= 3.5d-47) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((f * b_m)))
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 (F <= 3.5e-47) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * B_m)));
} 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 <= 3.5e-47: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * B_m))) 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 <= 3.5e-47) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * B_m)))); 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 <= 3.5e-47)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * B_m)));
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, 3.5e-47], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * B$95$m), $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}\;F \leq 3.5 \cdot 10^{-47}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot B\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\end{array}
\end{array}
if F < 3.4999999999999998e-47Initial program 22.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
unpow2N/A
unpow2N/A
lower-hypot.f6435.7
Applied rewrites35.7%
Taylor expanded in B around inf
Applied rewrites29.5%
if 3.4999999999999998e-47 < F Initial program 15.9%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6439.7
Applied rewrites39.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 1.7e+102) (* -1.0 (sqrt (* (/ F B_m) 2.0))) (* -1.0 (* (/ 2.0 B_m) (sqrt (* C F))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.7e+102) {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
} else {
tmp = -1.0 * ((2.0 / B_m) * sqrt((C * F)));
}
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 (c <= 1.7d+102) then
tmp = (-1.0d0) * sqrt(((f / b_m) * 2.0d0))
else
tmp = (-1.0d0) * ((2.0d0 / b_m) * sqrt((c * f)))
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (C <= 1.7e+102) {
tmp = -1.0 * Math.sqrt(((F / B_m) * 2.0));
} else {
tmp = -1.0 * ((2.0 / B_m) * Math.sqrt((C * F)));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if C <= 1.7e+102: tmp = -1.0 * math.sqrt(((F / B_m) * 2.0)) else: tmp = -1.0 * ((2.0 / B_m) * math.sqrt((C * F))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (C <= 1.7e+102) tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); else tmp = Float64(-1.0 * Float64(Float64(2.0 / B_m) * sqrt(Float64(C * F)))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (C <= 1.7e+102)
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
else
tmp = -1.0 * ((2.0 / B_m) * sqrt((C * F)));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 1.7e+102], N[(-1.0 * N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(C * F), $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}\;C \leq 1.7 \cdot 10^{+102}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{2}{B\_m} \cdot \sqrt{C \cdot F}\right)\\
\end{array}
\end{array}
if C < 1.7e102Initial program 23.4%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6433.5
Applied rewrites33.5%
if 1.7e102 < C Initial program 10.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
unpow2N/A
unpow2N/A
lower-hypot.f6422.5
Applied rewrites22.5%
Taylor expanded in B around 0
lower-*.f64N/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f6414.2
Applied rewrites14.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 (* -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) {
return -1.0 * 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 = (-1.0d0) * 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 -1.0 * 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 -1.0 * 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 Float64(-1.0 * 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 = -1.0 * 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[(-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])\\
\\
-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}
\end{array}
Initial program 19.4%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6427.2
Applied rewrites27.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 (* (/ 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 19.4%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6427.2
Applied rewrites27.2%
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 2025093
(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))))