
(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 15 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 (- (pow B_m 2.0) t_0)))
(if (<= B_m 2.65e-20)
(/ (- (sqrt (* (* 2.0 (* t_1 F)) (* 2.0 C)))) t_1)
(if (<= B_m 8e+72)
(/
(-
(*
(sqrt (* 2.0 (* (- (* B_m B_m) t_0) F)))
(sqrt (+ (+ A C) (hypot (- A C) B_m)))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(*
-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 = (4.0 * A) * C;
double t_1 = pow(B_m, 2.0) - t_0;
double tmp;
if (B_m <= 2.65e-20) {
tmp = -sqrt(((2.0 * (t_1 * F)) * (2.0 * C))) / t_1;
} else if (B_m <= 8e+72) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt(((A + C) + hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C;
double t_1 = Math.pow(B_m, 2.0) - t_0;
double tmp;
if (B_m <= 2.65e-20) {
tmp = -Math.sqrt(((2.0 * (t_1 * F)) * (2.0 * C))) / t_1;
} else if (B_m <= 8e+72) {
tmp = -(Math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * Math.sqrt(((A + C) + Math.hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C t_1 = math.pow(B_m, 2.0) - t_0 tmp = 0 if B_m <= 2.65e-20: tmp = -math.sqrt(((2.0 * (t_1 * F)) * (2.0 * C))) / t_1 elif B_m <= 8e+72: tmp = -(math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * math.sqrt(((A + C) + math.hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m))))) 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(Float64(4.0 * A) * C) t_1 = Float64((B_m ^ 2.0) - t_0) tmp = 0.0 if (B_m <= 2.65e-20) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(2.0 * C)))) / t_1); elseif (B_m <= 8e+72) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) * sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); 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 = (4.0 * A) * C;
t_1 = (B_m ^ 2.0) - t_0;
tmp = 0.0;
if (B_m <= 2.65e-20)
tmp = -sqrt(((2.0 * (t_1 * F)) * (2.0 * C))) / t_1;
elseif (B_m <= 8e+72)
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt(((A + C) + hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, If[LessEqual[B$95$m, 2.65e-20], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision], If[LessEqual[B$95$m, 8e+72], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := {B\_m}^{2} - t\_0\\
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-20}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_1}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{+72}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)} \cdot \sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\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 B < 2.6500000000000001e-20Initial program 21.8%
Taylor expanded in A around -inf
lower-*.f6444.6
Applied rewrites44.6%
if 2.6500000000000001e-20 < B < 7.99999999999999955e72Initial program 37.0%
Applied rewrites51.8%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6451.8
Applied rewrites51.8%
if 7.99999999999999955e72 < B Initial program 8.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.f6454.5
Applied rewrites54.5%
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-+.f6478.6
Applied rewrites78.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 (* (* 4.0 A) C))
(t_1 (- (pow B_m 2.0) t_0))
(t_2
(/
(-
(sqrt
(*
(* 2.0 (* t_1 F))
(+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0)))))))
t_1))
(t_3 (/ (sqrt 2.0) B_m)))
(if (<= t_2 -5e-201)
(* -1.0 (* t_3 (sqrt (* F (+ C (hypot B_m C))))))
(if (<= t_2 INFINITY)
(/
(-
(*
(sqrt (* 2.0 (* (- (* B_m B_m) t_0) F)))
(sqrt (fma -0.5 (/ (* B_m B_m) A) (* 2.0 C)))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(* -1.0 (* t_3 (* (sqrt F) (sqrt (+ C 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 = pow(B_m, 2.0) - t_0;
double t_2 = -sqrt(((2.0 * (t_1 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_1;
double t_3 = sqrt(2.0) / B_m;
double tmp;
if (t_2 <= -5e-201) {
tmp = -1.0 * (t_3 * sqrt((F * (C + hypot(B_m, C)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt(fma(-0.5, ((B_m * B_m) / A), (2.0 * C)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} else {
tmp = -1.0 * (t_3 * (sqrt(F) * sqrt((C + 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((B_m ^ 2.0) - t_0) t_2 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0))))))) / t_1) t_3 = Float64(sqrt(2.0) / B_m) tmp = 0.0 if (t_2 <= -5e-201) tmp = Float64(-1.0 * Float64(t_3 * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); elseif (t_2 <= Inf) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) * sqrt(fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(2.0 * C))))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); else tmp = Float64(-1.0 * Float64(t_3 * Float64(sqrt(F) * sqrt(Float64(C + 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[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$1 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-201], N[(-1.0 * N[(t$95$3 * N[Sqrt[N[(F * N[(C + N[Sqrt[B$95$m ^ 2 + C ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$3 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + 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 := \left(4 \cdot A\right) \cdot C\\
t_1 := {B\_m}^{2} - t\_0\\
t_2 := \frac{-\sqrt{\left(2 \cdot \left(t\_1 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_1}\\
t_3 := \frac{\sqrt{2}}{B\_m}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-201}:\\
\;\;\;\;-1 \cdot \left(t\_3 \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B\_m, C\right)\right)}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)} \cdot \sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, 2 \cdot C\right)}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_3 \cdot \left(\sqrt{F} \cdot \sqrt{C + B\_m}\right)\right)\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999999e-201Initial program 43.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.f6446.2
Applied rewrites46.2%
if -4.9999999999999999e-201 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 18.4%
Applied rewrites35.5%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6417.0
Applied rewrites17.0%
Taylor expanded in A around -inf
lower-fma.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6431.2
Applied rewrites31.2%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in 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.6
Applied rewrites35.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-+.f6453.7
Applied rewrites53.7%
Taylor expanded in B around inf
Applied rewrites48.3%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (/ (sqrt 2.0) B_m)))
(if (<= (pow B_m 2.0) 2e-298)
(* -1.0 (* t_0 (* (sqrt F) (sqrt B_m))))
(if (<= (pow B_m 2.0) 2e+42)
(/
(-
(*
(sqrt (* 2.0 (* (- (* B_m B_m) (* (* 4.0 A) C)) F)))
(sqrt (* 2.0 C))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(* -1.0 (* t_0 (* (sqrt F) (sqrt (+ C 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 tmp;
if (pow(B_m, 2.0) <= 2e-298) {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt(B_m)));
} else if (pow(B_m, 2.0) <= 2e+42) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} else {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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 = sqrt(2.0d0) / b_m
if ((b_m ** 2.0d0) <= 2d-298) then
tmp = (-1.0d0) * (t_0 * (sqrt(f) * sqrt(b_m)))
else if ((b_m ** 2.0d0) <= 2d+42) then
tmp = -(sqrt((2.0d0 * (((b_m * b_m) - ((4.0d0 * a) * c)) * f))) * sqrt((2.0d0 * c))) / ((b_m * b_m) * (1.0d0 + ((-4.0d0) * ((a * c) / (b_m * b_m)))))
else
tmp = (-1.0d0) * (t_0 * (sqrt(f) * sqrt((c + 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 = Math.sqrt(2.0) / B_m;
double tmp;
if (Math.pow(B_m, 2.0) <= 2e-298) {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt(B_m)));
} else if (Math.pow(B_m, 2.0) <= 2e+42) {
tmp = -(Math.sqrt((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F))) * Math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} else {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((C + 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 tmp = 0 if math.pow(B_m, 2.0) <= 2e-298: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt(B_m))) elif math.pow(B_m, 2.0) <= 2e+42: tmp = -(math.sqrt((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F))) * math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m))))) else: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((C + 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) tmp = 0.0 if ((B_m ^ 2.0) <= 2e-298) tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(B_m)))); elseif ((B_m ^ 2.0) <= 2e+42) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - Float64(Float64(4.0 * A) * C)) * F))) * sqrt(Float64(2.0 * C)))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); else tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(C + 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;
tmp = 0.0;
if ((B_m ^ 2.0) <= 2e-298)
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt(B_m)));
elseif ((B_m ^ 2.0) <= 2e+42)
tmp = -(sqrt((2.0 * (((B_m * B_m) - ((4.0 * A) * C)) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
else
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-298], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e+42], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + 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 := \frac{\sqrt{2}}{B\_m}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-298}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{B\_m}\right)\right)\\
\mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+42}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\right)}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{C + B\_m}\right)\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999982e-298Initial program 17.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.f645.3
Applied rewrites5.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-+.f646.3
Applied rewrites6.3%
Taylor expanded in B around inf
Applied rewrites5.6%
if 1.99999999999999982e-298 < (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000009e42Initial program 30.3%
Applied rewrites45.4%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6439.9
Applied rewrites39.9%
Taylor expanded in A around -inf
lower-*.f6434.4
Applied rewrites34.4%
if 2.00000000000000009e42 < (pow.f64 B #s(literal 2 binary64)) Initial program 13.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.f6452.4
Applied rewrites52.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-+.f6473.3
Applied rewrites73.3%
Taylor expanded in B around inf
Applied rewrites62.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 (* (* 4.0 A) C)) (t_1 (sqrt (* 2.0 (* (- (* B_m B_m) t_0) F)))))
(if (<= B_m 2.65e-20)
(/ (- (* t_1 (sqrt (* 2.0 C)))) (- (pow B_m 2.0) t_0))
(if (<= B_m 8e+72)
(/
(- (* t_1 (sqrt (+ (+ A C) (hypot (- A C) B_m)))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(*
-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 = (4.0 * A) * C;
double t_1 = sqrt((2.0 * (((B_m * B_m) - t_0) * F)));
double tmp;
if (B_m <= 2.65e-20) {
tmp = -(t_1 * sqrt((2.0 * C))) / (pow(B_m, 2.0) - t_0);
} else if (B_m <= 8e+72) {
tmp = -(t_1 * sqrt(((A + C) + hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C;
double t_1 = Math.sqrt((2.0 * (((B_m * B_m) - t_0) * F)));
double tmp;
if (B_m <= 2.65e-20) {
tmp = -(t_1 * Math.sqrt((2.0 * C))) / (Math.pow(B_m, 2.0) - t_0);
} else if (B_m <= 8e+72) {
tmp = -(t_1 * Math.sqrt(((A + C) + Math.hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C t_1 = math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) tmp = 0 if B_m <= 2.65e-20: tmp = -(t_1 * math.sqrt((2.0 * C))) / (math.pow(B_m, 2.0) - t_0) elif B_m <= 8e+72: tmp = -(t_1 * math.sqrt(((A + C) + math.hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m))))) 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(Float64(4.0 * A) * C) t_1 = sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) tmp = 0.0 if (B_m <= 2.65e-20) tmp = Float64(Float64(-Float64(t_1 * sqrt(Float64(2.0 * C)))) / Float64((B_m ^ 2.0) - t_0)); elseif (B_m <= 8e+72) tmp = Float64(Float64(-Float64(t_1 * sqrt(Float64(Float64(A + C) + hypot(Float64(A - C), B_m))))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); 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 = (4.0 * A) * C;
t_1 = sqrt((2.0 * (((B_m * B_m) - t_0) * F)));
tmp = 0.0;
if (B_m <= 2.65e-20)
tmp = -(t_1 * sqrt((2.0 * C))) / ((B_m ^ 2.0) - t_0);
elseif (B_m <= 8e+72)
tmp = -(t_1 * sqrt(((A + C) + hypot((A - C), B_m)))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[B$95$m, 2.65e-20], N[((-N[(t$95$1 * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 8e+72], N[((-N[(t$95$1 * N[Sqrt[N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)}\\
\mathbf{if}\;B\_m \leq 2.65 \cdot 10^{-20}:\\
\;\;\;\;\frac{-t\_1 \cdot \sqrt{2 \cdot C}}{{B\_m}^{2} - t\_0}\\
\mathbf{elif}\;B\_m \leq 8 \cdot 10^{+72}:\\
\;\;\;\;\frac{-t\_1 \cdot \sqrt{\left(A + C\right) + \mathsf{hypot}\left(A - C, B\_m\right)}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\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 B < 2.6500000000000001e-20Initial program 21.8%
Applied rewrites36.4%
Taylor expanded in A around -inf
lower-*.f6444.1
Applied rewrites44.1%
if 2.6500000000000001e-20 < B < 7.99999999999999955e72Initial program 37.0%
Applied rewrites51.8%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6451.8
Applied rewrites51.8%
if 7.99999999999999955e72 < B Initial program 8.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.f6454.5
Applied rewrites54.5%
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-+.f6478.6
Applied rewrites78.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 (* (* 4.0 A) C)))
(if (<= B_m 4e+17)
(/
(- (* (sqrt (* 2.0 (* (- (* B_m B_m) t_0) F))) (sqrt (* 2.0 C))))
(- (pow B_m 2.0) 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 4e+17) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt((2.0 * C))) / (pow(B_m, 2.0) - 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 4e+17) {
tmp = -(Math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * Math.sqrt((2.0 * C))) / (Math.pow(B_m, 2.0) - 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 = (4.0 * A) * C tmp = 0 if B_m <= 4e+17: tmp = -(math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * math.sqrt((2.0 * C))) / (math.pow(B_m, 2.0) - 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(Float64(4.0 * A) * C) tmp = 0.0 if (B_m <= 4e+17) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) * sqrt(Float64(2.0 * 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(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 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 4e+17)
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt((2.0 * C))) / ((B_m ^ 2.0) - 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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 4e+17], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $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[(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 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 4 \cdot 10^{+17}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{{B\_m}^{2} - 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 B < 4e17Initial program 23.6%
Applied rewrites38.1%
Taylor expanded in A around -inf
lower-*.f6443.1
Applied rewrites43.1%
if 4e17 < B Initial program 14.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6452.5
Applied rewrites52.5%
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-+.f6473.0
Applied rewrites73.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
(let* ((t_0 (* (* 4.0 A) C)))
(if (<= B_m 9.2e-98)
(/ (- (sqrt (* -16.0 (* A (* (* C C) F))))) (- (pow B_m 2.0) t_0))
(if (<= B_m 4e+17)
(/
(- (* (sqrt (* 2.0 (* (- (* B_m B_m) t_0) F))) (sqrt (* 2.0 C))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(*
-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 = (4.0 * A) * C;
double tmp;
if (B_m <= 9.2e-98) {
tmp = -sqrt((-16.0 * (A * ((C * C) * F)))) / (pow(B_m, 2.0) - t_0);
} else if (B_m <= 4e+17) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 9.2e-98) {
tmp = -Math.sqrt((-16.0 * (A * ((C * C) * F)))) / (Math.pow(B_m, 2.0) - t_0);
} else if (B_m <= 4e+17) {
tmp = -(Math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * Math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} 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 = (4.0 * A) * C tmp = 0 if B_m <= 9.2e-98: tmp = -math.sqrt((-16.0 * (A * ((C * C) * F)))) / (math.pow(B_m, 2.0) - t_0) elif B_m <= 4e+17: tmp = -(math.sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m))))) 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(Float64(4.0 * A) * C) tmp = 0.0 if (B_m <= 9.2e-98) tmp = Float64(Float64(-sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F))))) / Float64((B_m ^ 2.0) - t_0)); elseif (B_m <= 4e+17) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_0) * F))) * sqrt(Float64(2.0 * C)))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); 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 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 9.2e-98)
tmp = -sqrt((-16.0 * (A * ((C * C) * F)))) / ((B_m ^ 2.0) - t_0);
elseif (B_m <= 4e+17)
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_0) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 9.2e-98], N[((-N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4e+17], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 9.2 \cdot 10^{-98}:\\
\;\;\;\;\frac{-\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{{B\_m}^{2} - t\_0}\\
\mathbf{elif}\;B\_m \leq 4 \cdot 10^{+17}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_0\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\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 B < 9.20000000000000002e-98Initial program 18.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6430.1
Applied rewrites30.1%
if 9.20000000000000002e-98 < B < 4e17Initial program 33.2%
Applied rewrites47.0%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.5
Applied rewrites44.5%
Taylor expanded in A around -inf
lower-*.f6436.8
Applied rewrites36.8%
if 4e17 < B Initial program 14.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6452.5
Applied rewrites52.5%
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-+.f6473.0
Applied rewrites73.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
(let* ((t_0 (/ (sqrt 2.0) B_m)) (t_1 (* (* 4.0 A) C)))
(if (<= B_m 9.2e-98)
(/ (- (sqrt (* -16.0 (* A (* (* C C) F))))) (- (pow B_m 2.0) t_1))
(if (<= B_m 4.1e+17)
(/
(- (* (sqrt (* 2.0 (* (- (* B_m B_m) t_1) F))) (sqrt (* 2.0 C))))
(* (* B_m B_m) (+ 1.0 (* -4.0 (/ (* A C) (* B_m B_m))))))
(if (<= B_m 2.5e+153)
(* -1.0 (* t_0 (sqrt (* F (+ C (hypot B_m C))))))
(* -1.0 (* t_0 (* (sqrt F) (sqrt (+ C 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 9.2e-98) {
tmp = -sqrt((-16.0 * (A * ((C * C) * F)))) / (pow(B_m, 2.0) - t_1);
} else if (B_m <= 4.1e+17) {
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_1) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} else if (B_m <= 2.5e+153) {
tmp = -1.0 * (t_0 * sqrt((F * (C + hypot(B_m, C)))));
} else {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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 = (4.0 * A) * C;
double tmp;
if (B_m <= 9.2e-98) {
tmp = -Math.sqrt((-16.0 * (A * ((C * C) * F)))) / (Math.pow(B_m, 2.0) - t_1);
} else if (B_m <= 4.1e+17) {
tmp = -(Math.sqrt((2.0 * (((B_m * B_m) - t_1) * F))) * Math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
} else if (B_m <= 2.5e+153) {
tmp = -1.0 * (t_0 * Math.sqrt((F * (C + Math.hypot(B_m, C)))));
} else {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((C + 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 = (4.0 * A) * C tmp = 0 if B_m <= 9.2e-98: tmp = -math.sqrt((-16.0 * (A * ((C * C) * F)))) / (math.pow(B_m, 2.0) - t_1) elif B_m <= 4.1e+17: tmp = -(math.sqrt((2.0 * (((B_m * B_m) - t_1) * F))) * math.sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m))))) elif B_m <= 2.5e+153: tmp = -1.0 * (t_0 * math.sqrt((F * (C + math.hypot(B_m, C))))) else: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((C + 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(4.0 * A) * C) tmp = 0.0 if (B_m <= 9.2e-98) tmp = Float64(Float64(-sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F))))) / Float64((B_m ^ 2.0) - t_1)); elseif (B_m <= 4.1e+17) tmp = Float64(Float64(-Float64(sqrt(Float64(2.0 * Float64(Float64(Float64(B_m * B_m) - t_1) * F))) * sqrt(Float64(2.0 * C)))) / Float64(Float64(B_m * B_m) * Float64(1.0 + Float64(-4.0 * Float64(Float64(A * C) / Float64(B_m * B_m)))))); elseif (B_m <= 2.5e+153) tmp = Float64(-1.0 * Float64(t_0 * sqrt(Float64(F * Float64(C + hypot(B_m, C)))))); else tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(C + 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 = (4.0 * A) * C;
tmp = 0.0;
if (B_m <= 9.2e-98)
tmp = -sqrt((-16.0 * (A * ((C * C) * F)))) / ((B_m ^ 2.0) - t_1);
elseif (B_m <= 4.1e+17)
tmp = -(sqrt((2.0 * (((B_m * B_m) - t_1) * F))) * sqrt((2.0 * C))) / ((B_m * B_m) * (1.0 + (-4.0 * ((A * C) / (B_m * B_m)))));
elseif (B_m <= 2.5e+153)
tmp = -1.0 * (t_0 * sqrt((F * (C + hypot(B_m, C)))));
else
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[B$95$m, 9.2e-98], N[((-N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.1e+17], N[((-N[(N[Sqrt[N[(2.0 * N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]) / N[(N[(B$95$m * B$95$m), $MachinePrecision] * N[(1.0 + N[(-4.0 * N[(N[(A * C), $MachinePrecision] / N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 2.5e+153], 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[F], $MachinePrecision] * N[Sqrt[N[(C + 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 := \frac{\sqrt{2}}{B\_m}\\
t_1 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;B\_m \leq 9.2 \cdot 10^{-98}:\\
\;\;\;\;\frac{-\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{{B\_m}^{2} - t\_1}\\
\mathbf{elif}\;B\_m \leq 4.1 \cdot 10^{+17}:\\
\;\;\;\;\frac{-\sqrt{2 \cdot \left(\left(B\_m \cdot B\_m - t\_1\right) \cdot F\right)} \cdot \sqrt{2 \cdot C}}{\left(B\_m \cdot B\_m\right) \cdot \left(1 + -4 \cdot \frac{A \cdot C}{B\_m \cdot B\_m}\right)}\\
\mathbf{elif}\;B\_m \leq 2.5 \cdot 10^{+153}:\\
\;\;\;\;-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 \left(\sqrt{F} \cdot \sqrt{C + B\_m}\right)\right)\\
\end{array}
\end{array}
if B < 9.20000000000000002e-98Initial program 18.2%
Taylor expanded in A around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6430.1
Applied rewrites30.1%
if 9.20000000000000002e-98 < B < 4.1e17Initial program 33.2%
Applied rewrites47.0%
Taylor expanded in B around inf
pow2N/A
lower-*.f64N/A
pow2N/A
lift-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
pow2N/A
lift-*.f6444.5
Applied rewrites44.5%
Taylor expanded in A around -inf
lower-*.f6436.8
Applied rewrites36.8%
if 4.1e17 < B < 2.50000000000000009e153Initial program 30.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6448.6
Applied rewrites48.6%
if 2.50000000000000009e153 < B Initial program 0.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6455.9
Applied rewrites55.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-+.f6485.3
Applied rewrites85.3%
Taylor expanded in B around inf
Applied rewrites77.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 8.2e+155)
(* -1.0 (* t_0 (* (sqrt F) (sqrt (+ C 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 <= 8.2e+155) {
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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 <= 8.2d+155) then
tmp = (-1.0d0) * (t_0 * (sqrt(f) * sqrt((c + 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 <= 8.2e+155) {
tmp = -1.0 * (t_0 * (Math.sqrt(F) * Math.sqrt((C + 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 <= 8.2e+155: tmp = -1.0 * (t_0 * (math.sqrt(F) * math.sqrt((C + 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 <= 8.2e+155) tmp = Float64(-1.0 * Float64(t_0 * Float64(sqrt(F) * sqrt(Float64(C + 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 <= 8.2e+155)
tmp = -1.0 * (t_0 * (sqrt(F) * sqrt((C + 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, 8.2e+155], N[(-1.0 * N[(t$95$0 * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $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 8.2 \cdot 10^{+155}:\\
\;\;\;\;-1 \cdot \left(t\_0 \cdot \left(\sqrt{F} \cdot \sqrt{C + 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 < 8.1999999999999996e155Initial program 24.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.f6436.3
Applied rewrites36.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-+.f6446.5
Applied rewrites46.5%
Taylor expanded in B around inf
Applied rewrites42.2%
if 8.1999999999999996e155 < C Initial program 1.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.f6421.5
Applied rewrites21.5%
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-+.f6432.6
Applied rewrites32.6%
Taylor expanded in B around 0
Applied rewrites22.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 8.2e+155) (* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt (+ C B_m))))) (* -1.0 (* (/ 2.0 B_m) (* (sqrt C) (sqrt 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 <= 8.2e+155) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + B_m))));
} else {
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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 <= 8.2d+155) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt((c + b_m))))
else
tmp = (-1.0d0) * ((2.0d0 / b_m) * (sqrt(c) * sqrt(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 <= 8.2e+155) {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * Math.sqrt((C + B_m))));
} else {
tmp = -1.0 * ((2.0 / B_m) * (Math.sqrt(C) * Math.sqrt(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 <= 8.2e+155: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * (math.sqrt(F) * math.sqrt((C + B_m)))) else: tmp = -1.0 * ((2.0 / B_m) * (math.sqrt(C) * math.sqrt(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 <= 8.2e+155) tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * sqrt(Float64(C + B_m))))); else tmp = Float64(-1.0 * Float64(Float64(2.0 / B_m) * Float64(sqrt(C) * sqrt(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 <= 8.2e+155)
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt((C + B_m))));
else
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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, 8.2e+155], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(C + B$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(2.0 / B$95$m), $MachinePrecision] * N[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[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 8.2 \cdot 10^{+155}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{F} \cdot \sqrt{C + B\_m}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{2}{B\_m} \cdot \left(\sqrt{C} \cdot \sqrt{F}\right)\right)\\
\end{array}
\end{array}
if C < 8.1999999999999996e155Initial program 24.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.f6436.3
Applied rewrites36.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-+.f6446.5
Applied rewrites46.5%
Taylor expanded in B around inf
Applied rewrites42.2%
if 8.1999999999999996e155 < C Initial program 1.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.f6421.5
Applied rewrites21.5%
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-+.f6432.6
Applied rewrites32.6%
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
lower-*.f6415.2
Applied rewrites15.2%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-sqrt.f6422.2
Applied rewrites22.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 8.2e+155) (* -1.0 (* (/ (sqrt 2.0) B_m) (* (sqrt F) (sqrt B_m)))) (* -1.0 (* (/ 2.0 B_m) (* (sqrt C) (sqrt 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 <= 8.2e+155) {
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)));
} else {
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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 <= 8.2d+155) then
tmp = (-1.0d0) * ((sqrt(2.0d0) / b_m) * (sqrt(f) * sqrt(b_m)))
else
tmp = (-1.0d0) * ((2.0d0 / b_m) * (sqrt(c) * sqrt(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 <= 8.2e+155) {
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) * Math.sqrt(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 <= 8.2e+155: 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) * math.sqrt(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 <= 8.2e+155) 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) * Float64(sqrt(C) * sqrt(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 <= 8.2e+155)
tmp = -1.0 * ((sqrt(2.0) / B_m) * (sqrt(F) * sqrt(B_m)));
else
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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, 8.2e+155], 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[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[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 8.2 \cdot 10^{+155}:\\
\;\;\;\;-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 \left(\sqrt{C} \cdot \sqrt{F}\right)\right)\\
\end{array}
\end{array}
if C < 8.1999999999999996e155Initial program 24.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.f6436.3
Applied rewrites36.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-+.f6446.5
Applied rewrites46.5%
Taylor expanded in B around inf
Applied rewrites41.8%
if 8.1999999999999996e155 < C Initial program 1.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.f6421.5
Applied rewrites21.5%
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-+.f6432.6
Applied rewrites32.6%
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
lower-*.f6415.2
Applied rewrites15.2%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-sqrt.f6422.2
Applied rewrites22.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F 5.3e-26) (* -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 <= 5.3e-26) {
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 <= 5.3d-26) 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 <= 5.3e-26) {
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 <= 5.3e-26: 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 <= 5.3e-26) 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 <= 5.3e-26)
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, 5.3e-26], 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 5.3 \cdot 10^{-26}:\\
\;\;\;\;-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 < 5.29999999999999992e-26Initial program 22.1%
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.f6436.9
Applied rewrites36.9%
Taylor expanded in B around inf
Applied rewrites30.5%
if 5.29999999999999992e-26 < 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-/.f6438.9
Applied rewrites38.9%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= C 6.8e+126) (* -1.0 (sqrt (* (/ F B_m) 2.0))) (* -1.0 (* (/ 2.0 B_m) (* (sqrt C) (sqrt 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 <= 6.8e+126) {
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
} else {
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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 <= 6.8d+126) then
tmp = (-1.0d0) * sqrt(((f / b_m) * 2.0d0))
else
tmp = (-1.0d0) * ((2.0d0 / b_m) * (sqrt(c) * sqrt(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 <= 6.8e+126) {
tmp = -1.0 * Math.sqrt(((F / B_m) * 2.0));
} else {
tmp = -1.0 * ((2.0 / B_m) * (Math.sqrt(C) * Math.sqrt(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 <= 6.8e+126: tmp = -1.0 * math.sqrt(((F / B_m) * 2.0)) else: tmp = -1.0 * ((2.0 / B_m) * (math.sqrt(C) * math.sqrt(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 <= 6.8e+126) tmp = Float64(-1.0 * sqrt(Float64(Float64(F / B_m) * 2.0))); else tmp = Float64(-1.0 * Float64(Float64(2.0 / B_m) * Float64(sqrt(C) * sqrt(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 <= 6.8e+126)
tmp = -1.0 * sqrt(((F / B_m) * 2.0));
else
tmp = -1.0 * ((2.0 / B_m) * (sqrt(C) * sqrt(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, 6.8e+126], 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[(N[Sqrt[C], $MachinePrecision] * N[Sqrt[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.8 \cdot 10^{+126}:\\
\;\;\;\;-1 \cdot \sqrt{\frac{F}{B\_m} \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{2}{B\_m} \cdot \left(\sqrt{C} \cdot \sqrt{F}\right)\right)\\
\end{array}
\end{array}
if C < 6.79999999999999979e126Initial program 23.8%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6433.1
Applied rewrites33.1%
if 6.79999999999999979e126 < C Initial program 7.2%
Taylor expanded in A around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
unpow2N/A
unpow2N/A
lower-hypot.f6423.1
Applied rewrites23.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-+.f6434.1
Applied rewrites34.1%
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
lower-*.f6415.4
Applied rewrites15.4%
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-sqrt.f6421.8
Applied rewrites21.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 (<= C 8.2e+155) (* -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 <= 8.2e+155) {
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 <= 8.2d+155) 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 <= 8.2e+155) {
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 <= 8.2e+155: 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 <= 8.2e+155) 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 <= 8.2e+155)
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, 8.2e+155], 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 8.2 \cdot 10^{+155}:\\
\;\;\;\;-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 < 8.1999999999999996e155Initial program 24.5%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6432.3
Applied rewrites32.3%
if 8.1999999999999996e155 < C Initial program 1.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.f6421.5
Applied rewrites21.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
lower-*.f6415.2
Applied rewrites15.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.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6427.1
Applied rewrites27.1%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (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.2%
Taylor expanded in B around inf
lower-*.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6427.1
Applied rewrites27.1%
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 2025089
(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))))