
(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 11 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
(if (<= B_m 1.2e+37)
(/
(-
(sqrt
(*
(* 2.0 (fma (* F B_m) B_m (* (* -4.0 (* A C)) F)))
(+ (- (* -0.5 (/ (* B_m B_m) C)) (* -1.0 A)) A))))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (hypot A B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.2e+37) {
tmp = -sqrt(((2.0 * fma((F * B_m), B_m, ((-4.0 * (A * C)) * F))) * (((-0.5 * ((B_m * B_m) / C)) - (-1.0 * A)) + A))) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.2e+37) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * fma(Float64(F * B_m), B_m, Float64(Float64(-4.0 * Float64(A * C)) * F))) * Float64(Float64(Float64(-0.5 * Float64(Float64(B_m * B_m) / C)) - Float64(-1.0 * A)) + A)))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.2e+37], N[((-N[Sqrt[N[(N[(2.0 * N[(N[(F * B$95$m), $MachinePrecision] * B$95$m + N[(N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision] - N[(-1.0 * A), $MachinePrecision]), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.2 \cdot 10^{+37}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \mathsf{fma}\left(F \cdot B\_m, B\_m, \left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(-0.5 \cdot \frac{B\_m \cdot B\_m}{C} - -1 \cdot A\right) + A\right)}}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if B < 1.2e37Initial program 24.7%
lift--.f64N/A
lift-+.f64N/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6426.4
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
lower-hypot.f6435.4
Applied rewrites35.4%
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
*-commutativeN/A
lift-*.f64N/A
fp-cancel-sign-sub-invN/A
+-commutativeN/A
lift-*.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
Applied rewrites35.4%
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-inN/A
lift-*.f64N/A
associate-*r*N/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
rem-sqrt-square-revN/A
*-commutativeN/A
lower-fma.f64N/A
rem-sqrt-square-revN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites35.4%
Taylor expanded in C around inf
lower--.f64N/A
lower-*.f64N/A
lower-/.f64N/A
pow2N/A
lift-*.f64N/A
lower-*.f6443.1
Applied rewrites43.1%
if 1.2e37 < B Initial program 10.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites7.3%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6449.8
Applied rewrites49.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 (<= (pow B_m 2.0) 1e+41)
(/
(- (sqrt (* -8.0 (* A (* C (* F (- A (* -1.0 A))))))))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (hypot A B_m))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (pow(B_m, 2.0) <= 1e+41) {
tmp = -sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (Math.pow(B_m, 2.0) <= 1e+41) {
tmp = -Math.sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (Math.pow(B_m, 2.0) - ((4.0 * A) * C));
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (A - Math.hypot(A, B_m)))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if math.pow(B_m, 2.0) <= 1e+41: tmp = -math.sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (math.pow(B_m, 2.0) - ((4.0 * A) * C)) else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (A - math.hypot(A, B_m))))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if ((B_m ^ 2.0) <= 1e+41) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A - Float64(-1.0 * A)))))))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if ((B_m ^ 2.0) <= 1e+41)
tmp = -sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / ((B_m ^ 2.0) - ((4.0 * A) * C));
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+41], N[((-N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A - N[(-1.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B\_m}^{2} \leq 10^{+41}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A - -1 \cdot A\right)\right)\right)\right)}}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000001e41Initial program 23.9%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites28.1%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-*.f6439.3
Applied rewrites39.3%
if 1.00000000000000001e41 < (pow.f64 B #s(literal 2 binary64)) Initial program 12.5%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites9.5%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6449.4
Applied rewrites49.4%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B_m B_m))))
(if (<= (pow B_m 2.0) 5e-198)
(/
(sqrt
(*
(- A (* 0.5 (fma -1.0 (+ A B_m) (* -1.0 (- A B_m)))))
(* (+ F F) t_0)))
(- t_0))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (hypot A B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
double tmp;
if (pow(B_m, 2.0) <= 5e-198) {
tmp = sqrt(((A - (0.5 * fma(-1.0, (A + B_m), (-1.0 * (A - B_m))))) * ((F + F) * t_0))) / -t_0;
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) tmp = 0.0 if ((B_m ^ 2.0) <= 5e-198) tmp = Float64(sqrt(Float64(Float64(A - Float64(0.5 * fma(-1.0, Float64(A + B_m), Float64(-1.0 * Float64(A - B_m))))) * Float64(Float64(F + F) * t_0))) / Float64(-t_0)); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-198], N[(N[Sqrt[N[(N[(A - N[(0.5 * N[(-1.0 * N[(A + B$95$m), $MachinePrecision] + N[(-1.0 * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(F + F), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-198}:\\
\;\;\;\;\frac{\sqrt{\left(A - 0.5 \cdot \mathsf{fma}\left(-1, A + B\_m, -1 \cdot \left(A - B\_m\right)\right)\right) \cdot \left(\left(F + F\right) \cdot t\_0\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999999e-198Initial program 19.3%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites26.6%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in C around inf
lower--.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower--.f6442.8
Applied rewrites42.8%
if 4.9999999999999999e-198 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.3%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites17.8%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6443.1
Applied rewrites43.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 (<= B_m 1.26e-93)
(/
(- (sqrt (* (* 2.0 (fma (* F B_m) B_m (* (* -4.0 (* A C)) F))) (+ A A))))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(if (<= B_m 6e+75)
(*
-1.0
(*
(sqrt
(/
(* F (- (+ A C) (hypot B_m (- A C))))
(- (* B_m B_m) (* 4.0 (* A C)))))
(sqrt 2.0)))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (hypot A B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 1.26e-93) {
tmp = -sqrt(((2.0 * fma((F * B_m), B_m, ((-4.0 * (A * C)) * F))) * (A + A))) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else if (B_m <= 6e+75) {
tmp = -1.0 * (sqrt(((F * ((A + C) - hypot(B_m, (A - C)))) / ((B_m * B_m) - (4.0 * (A * C))))) * sqrt(2.0));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 1.26e-93) tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * fma(Float64(F * B_m), B_m, Float64(Float64(-4.0 * Float64(A * C)) * F))) * Float64(A + A)))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); elseif (B_m <= 6e+75) tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - hypot(B_m, Float64(A - C)))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 1.26e-93], N[((-N[Sqrt[N[(N[(2.0 * N[(N[(F * B$95$m), $MachinePrecision] * B$95$m + N[(N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6e+75], N[(-1.0 * N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 1.26 \cdot 10^{-93}:\\
\;\;\;\;\frac{-\sqrt{\left(2 \cdot \mathsf{fma}\left(F \cdot B\_m, B\_m, \left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(A + A\right)}}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 6 \cdot 10^{+75}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F \cdot \left(\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if B < 1.2600000000000001e-93Initial program 19.6%
lift--.f64N/A
lift-+.f64N/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6421.6
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
lower-hypot.f6430.4
Applied rewrites30.4%
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
*-commutativeN/A
lift-*.f64N/A
fp-cancel-sign-sub-invN/A
+-commutativeN/A
lift-*.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
Applied rewrites30.4%
lift-*.f64N/A
*-commutativeN/A
lift-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-inN/A
lift-*.f64N/A
associate-*r*N/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
rem-sqrt-square-revN/A
*-commutativeN/A
lower-fma.f64N/A
rem-sqrt-square-revN/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites30.4%
Taylor expanded in A around -inf
Applied rewrites45.6%
if 1.2600000000000001e-93 < B < 6e75Initial program 33.0%
lift--.f64N/A
lift-+.f64N/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6433.9
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
lower-hypot.f6442.7
Applied rewrites42.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f6442.7
unpow1N/A
metadata-evalN/A
pow-to-expN/A
lower-exp.f64N/A
lower-*.f64N/A
lower-log.f64N/A
metadata-eval6.6
Applied rewrites6.6%
Taylor expanded in F around 0
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites39.1%
if 6e75 < B Initial program 7.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites3.5%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6450.7
Applied rewrites50.7%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.4e-95)
(/
(- (sqrt (* -8.0 (* A (* C (* F (- A (* -1.0 A))))))))
(- (pow B_m 2.0) (* (* 4.0 A) C)))
(if (<= B_m 6e+75)
(*
-1.0
(*
(sqrt
(/
(* F (- (+ A C) (hypot B_m (- A C))))
(- (* B_m B_m) (* 4.0 (* A C)))))
(sqrt 2.0)))
(* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (hypot A B_m)))))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.4e-95) {
tmp = -sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (pow(B_m, 2.0) - ((4.0 * A) * C));
} else if (B_m <= 6e+75) {
tmp = -1.0 * (sqrt(((F * ((A + C) - hypot(B_m, (A - C)))) / ((B_m * B_m) - (4.0 * (A * C))))) * sqrt(2.0));
} else {
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.4e-95) {
tmp = -Math.sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (Math.pow(B_m, 2.0) - ((4.0 * A) * C));
} else if (B_m <= 6e+75) {
tmp = -1.0 * (Math.sqrt(((F * ((A + C) - Math.hypot(B_m, (A - C)))) / ((B_m * B_m) - (4.0 * (A * C))))) * Math.sqrt(2.0));
} else {
tmp = -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (A - Math.hypot(A, B_m)))));
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if B_m <= 4.4e-95: tmp = -math.sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / (math.pow(B_m, 2.0) - ((4.0 * A) * C)) elif B_m <= 6e+75: tmp = -1.0 * (math.sqrt(((F * ((A + C) - math.hypot(B_m, (A - C)))) / ((B_m * B_m) - (4.0 * (A * C))))) * math.sqrt(2.0)) else: tmp = -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (A - math.hypot(A, B_m))))) return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.4e-95) tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A - Float64(-1.0 * A)))))))) / Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))); elseif (B_m <= 6e+75) tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - hypot(B_m, Float64(A - C)))) / Float64(Float64(B_m * B_m) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0))); else tmp = Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - hypot(A, B_m)))))); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (B_m <= 4.4e-95)
tmp = -sqrt((-8.0 * (A * (C * (F * (A - (-1.0 * A))))))) / ((B_m ^ 2.0) - ((4.0 * A) * C));
elseif (B_m <= 6e+75)
tmp = -1.0 * (sqrt(((F * ((A + C) - hypot(B_m, (A - C)))) / ((B_m * B_m) - (4.0 * (A * C))))) * sqrt(2.0));
else
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - hypot(A, B_m)))));
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.4e-95], N[((-N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A - N[(-1.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 6e+75], N[(-1.0 * N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(B$95$m * B$95$m), $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.4 \cdot 10^{-95}:\\
\;\;\;\;\frac{-\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A - -1 \cdot A\right)\right)\right)\right)}}{{B\_m}^{2} - \left(4 \cdot A\right) \cdot C}\\
\mathbf{elif}\;B\_m \leq 6 \cdot 10^{+75}:\\
\;\;\;\;-1 \cdot \left(\sqrt{\frac{F \cdot \left(\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right)}{B\_m \cdot B\_m - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \mathsf{hypot}\left(A, B\_m\right)\right)}\right)\\
\end{array}
\end{array}
if B < 4.3999999999999998e-95Initial program 19.5%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites23.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-*.f6443.3
Applied rewrites43.3%
if 4.3999999999999998e-95 < B < 6e75Initial program 33.0%
lift--.f64N/A
lift-+.f64N/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6434.0
lift-sqrt.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-pow.f64N/A
unpow2N/A
lower-hypot.f6442.7
Applied rewrites42.7%
lift-*.f64N/A
*-commutativeN/A
lift-*.f6442.7
unpow1N/A
metadata-evalN/A
pow-to-expN/A
lower-exp.f64N/A
lower-*.f64N/A
lower-log.f64N/A
metadata-eval6.5
Applied rewrites6.5%
Taylor expanded in F around 0
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites39.1%
if 6e75 < B Initial program 7.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites3.5%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
unpow2N/A
pow2N/A
lower-hypot.f6450.7
Applied rewrites50.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 (fma -4.0 (* C A) (* B_m B_m))))
(/
(sqrt
(* (- A (* 0.5 (fma -1.0 (+ A B_m) (* -1.0 (- A B_m))))) (* (+ F F) t_0)))
(- t_0))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
return sqrt(((A - (0.5 * fma(-1.0, (A + B_m), (-1.0 * (A - B_m))))) * ((F + F) * t_0))) / -t_0;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) return Float64(sqrt(Float64(Float64(A - Float64(0.5 * fma(-1.0, Float64(A + B_m), Float64(-1.0 * Float64(A - B_m))))) * Float64(Float64(F + F) * t_0))) / Float64(-t_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_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[N[(N[(A - N[(0.5 * N[(-1.0 * N[(A + B$95$m), $MachinePrecision] + N[(-1.0 * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(F + F), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\frac{\sqrt{\left(A - 0.5 \cdot \mathsf{fma}\left(-1, A + B\_m, -1 \cdot \left(A - B\_m\right)\right)\right) \cdot \left(\left(F + F\right) \cdot t\_0\right)}}{-t\_0}
\end{array}
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in C around inf
lower--.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower--.f6424.2
Applied rewrites24.2%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(/
(sqrt
(*
-8.0
(* A (* C (* F (- A (* 0.5 (fma -1.0 (+ A B_m) (* -1.0 (- A B_m))))))))))
(- (fma -4.0 (* C A) (* B_m B_m)))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-8.0 * (A * (C * (F * (A - (0.5 * fma(-1.0, (A + B_m), (-1.0 * (A - B_m)))))))))) / -fma(-4.0, (C * A), (B_m * B_m));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A - Float64(0.5 * fma(-1.0, Float64(A + B_m), Float64(-1.0 * Float64(A - B_m)))))))))) / Float64(-fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A - N[(0.5 * N[(-1.0 * N[(A + B$95$m), $MachinePrecision] + N[(-1.0 * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A - 0.5 \cdot \mathsf{fma}\left(-1, A + B\_m, -1 \cdot \left(A - B\_m\right)\right)\right)\right)\right)\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower--.f6421.2
Applied rewrites21.2%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))) (/ (sqrt (* (- (+ C A) C) (* (+ F F) t_0))) (- t_0))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B_m * B_m));
return sqrt((((C + A) - C) * ((F + F) * t_0))) / -t_0;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B_m * B_m)) return Float64(sqrt(Float64(Float64(Float64(C + A) - C) * Float64(Float64(F + F) * t_0))) / Float64(-t_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_] := Block[{t$95$0 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - C), $MachinePrecision] * N[(N[(F + F), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\
\frac{\sqrt{\left(\left(C + A\right) - C\right) \cdot \left(\left(F + F\right) \cdot t\_0\right)}}{-t\_0}
\end{array}
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in C around inf
Applied rewrites4.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 (* -1.0 (* (/ (sqrt 2.0) B_m) (sqrt (* F (- A (sqrt (* (+ A B_m) (- A B_m)))))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(((A + B_m) * (A - B_m)))))));
}
B_m = private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (-1.0d0) * ((sqrt(2.0d0) / b_m) * sqrt((f * (a - sqrt(((a + b_m) * (a - b_m)))))))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -1.0 * ((Math.sqrt(2.0) / B_m) * Math.sqrt((F * (A - Math.sqrt(((A + B_m) * (A - B_m)))))));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -1.0 * ((math.sqrt(2.0) / B_m) * math.sqrt((F * (A - math.sqrt(((A + B_m) * (A - B_m)))))))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-1.0 * Float64(Float64(sqrt(2.0) / B_m) * sqrt(Float64(F * Float64(A - sqrt(Float64(Float64(A + B_m) * Float64(A - B_m)))))))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -1.0 * ((sqrt(2.0) / B_m) * sqrt((F * (A - sqrt(((A + B_m) * (A - B_m)))))));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(N[(A + B$95$m), $MachinePrecision] * N[(A - B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-1 \cdot \left(\frac{\sqrt{2}}{B\_m} \cdot \sqrt{F \cdot \left(A - \sqrt{\left(A + B\_m\right) \cdot \left(A - B\_m\right)}\right)}\right)
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in C around 0
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-+.f64N/A
lower--.f644.1
Applied rewrites4.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 (* -16.0 (* A (* (* C C) F)))) (- (fma -4.0 (* C A) (* B_m B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-16.0 * (A * ((C * C) * F)))) / -fma(-4.0, (C * A), (B_m * B_m));
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(sqrt(Float64(-16.0 * Float64(A * Float64(Float64(C * C) * F)))) / Float64(-fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(-16.0 * N[(A * N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{-16 \cdot \left(A \cdot \left(\left(C \cdot C\right) \cdot F\right)\right)}}{-\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f642.1
Applied rewrites2.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 (* -1.0 (* (sqrt (/ F A)) (* (sqrt -0.5) (sqrt 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 / A)) * (sqrt(-0.5) * sqrt(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 / a)) * (sqrt((-0.5d0)) * sqrt(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 / A)) * (Math.sqrt(-0.5) * Math.sqrt(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 / A)) * (math.sqrt(-0.5) * math.sqrt(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 * Float64(sqrt(Float64(F / A)) * Float64(sqrt(-0.5) * sqrt(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 / A)) * (sqrt(-0.5) * sqrt(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[(N[Sqrt[N[(F / A), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[-0.5], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-1 \cdot \left(\sqrt{\frac{F}{A}} \cdot \left(\sqrt{-0.5} \cdot \sqrt{2}\right)\right)
\end{array}
Initial program 18.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites23.8%
lift-hypot.f64N/A
sqr-neg-revN/A
fp-cancel-sub-signN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
pow2N/A
sqr-neg-revN/A
pow2N/A
sqrt-pow1N/A
pow-plus-revN/A
metadata-evalN/A
metadata-evalN/A
pow2N/A
sqr-neg-revN/A
lift-*.f64N/A
lift-*.f64N/A
difference-of-squaresN/A
sqrt-prodN/A
lower-*.f64N/A
Applied rewrites0.0%
lift-*.f64N/A
count-2-revN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f640.0
Applied rewrites0.0%
herbie shell --seed 2025106
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))