
(FPCore (p r q) :precision binary64 (* (/ 1.0 2.0) (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))
double code(double p, double r, double q) {
return (1.0 / 2.0) * ((fabs(p) + fabs(r)) - sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.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(p, r, q)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q
code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) - sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function
public static double code(double p, double r, double q) {
return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) - Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}
def code(p, r, q): return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) - math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))
function code(p, r, q) return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) - sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0)))))) end
function tmp = code(p, r, q) tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) - sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0))))); end
code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (p r q) :precision binary64 (* (/ 1.0 2.0) (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))
double code(double p, double r, double q) {
return (1.0 / 2.0) * ((fabs(p) + fabs(r)) - sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.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(p, r, q)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q
code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) - sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function
public static double code(double p, double r, double q) {
return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) - Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}
def code(p, r, q): return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) - math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))
function code(p, r, q) return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) - sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0)))))) end
function tmp = code(p, r, q) tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) - sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0))))); end
code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right)
\end{array}
q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
:precision binary64
(if (<= r -9.8e-76)
(fma (+ (+ p (fabs p)) (fabs r)) 0.5 (* -0.5 r))
(if (<= r 35.0)
(*
0.5
(-
(+ (+ (fabs p) (fabs r)) (* p (fma -0.25 (/ p q_m) (* 0.5 (/ r q_m)))))
(* 2.0 q_m)))
(if (<= r 3.6e+250)
(*
(/ 1.0 2.0)
(+
(/ (* (+ (+ (fma -1.0 r (fabs r)) (fabs p)) p) r) r)
(/ (* -2.0 (* q_m q_m)) r)))
(if (<= r 1.18e+277)
(* (/ 1.0 2.0) (* (* -2.0 (* (/ q_m r) (/ q_m r))) r))
(* 0.5 (+ p (+ (- (fabs r) r) (fabs p)))))))))q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (r <= -9.8e-76) {
tmp = fma(((p + fabs(p)) + fabs(r)), 0.5, (-0.5 * r));
} else if (r <= 35.0) {
tmp = 0.5 * (((fabs(p) + fabs(r)) + (p * fma(-0.25, (p / q_m), (0.5 * (r / q_m))))) - (2.0 * q_m));
} else if (r <= 3.6e+250) {
tmp = (1.0 / 2.0) * (((((fma(-1.0, r, fabs(r)) + fabs(p)) + p) * r) / r) + ((-2.0 * (q_m * q_m)) / r));
} else if (r <= 1.18e+277) {
tmp = (1.0 / 2.0) * ((-2.0 * ((q_m / r) * (q_m / r))) * r);
} else {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
}
return tmp;
}
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (r <= -9.8e-76) tmp = fma(Float64(Float64(p + abs(p)) + abs(r)), 0.5, Float64(-0.5 * r)); elseif (r <= 35.0) tmp = Float64(0.5 * Float64(Float64(Float64(abs(p) + abs(r)) + Float64(p * fma(-0.25, Float64(p / q_m), Float64(0.5 * Float64(r / q_m))))) - Float64(2.0 * q_m))); elseif (r <= 3.6e+250) tmp = Float64(Float64(1.0 / 2.0) * Float64(Float64(Float64(Float64(Float64(fma(-1.0, r, abs(r)) + abs(p)) + p) * r) / r) + Float64(Float64(-2.0 * Float64(q_m * q_m)) / r))); elseif (r <= 1.18e+277) tmp = Float64(Float64(1.0 / 2.0) * Float64(Float64(-2.0 * Float64(Float64(q_m / r) * Float64(q_m / r))) * r)); else tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); end return tmp end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[r, -9.8e-76], N[(N[(N[(p + N[Abs[p], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5 + N[(-0.5 * r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 35.0], N[(0.5 * N[(N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[(p * N[(-0.25 * N[(p / q$95$m), $MachinePrecision] + N[(0.5 * N[(r / q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(2.0 * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 3.6e+250], N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[(N[(N[(N[(-1.0 * r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + p), $MachinePrecision] * r), $MachinePrecision] / r), $MachinePrecision] + N[(N[(-2.0 * N[(q$95$m * q$95$m), $MachinePrecision]), $MachinePrecision] / r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1.18e+277], N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(-2.0 * N[(N[(q$95$m / r), $MachinePrecision] * N[(q$95$m / r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * r), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;r \leq -9.8 \cdot 10^{-76}:\\
\;\;\;\;\mathsf{fma}\left(\left(p + \left|p\right|\right) + \left|r\right|, 0.5, -0.5 \cdot r\right)\\
\mathbf{elif}\;r \leq 35:\\
\;\;\;\;0.5 \cdot \left(\left(\left(\left|p\right| + \left|r\right|\right) + p \cdot \mathsf{fma}\left(-0.25, \frac{p}{q\_m}, 0.5 \cdot \frac{r}{q\_m}\right)\right) - 2 \cdot q\_m\right)\\
\mathbf{elif}\;r \leq 3.6 \cdot 10^{+250}:\\
\;\;\;\;\frac{1}{2} \cdot \left(\frac{\left(\left(\mathsf{fma}\left(-1, r, \left|r\right|\right) + \left|p\right|\right) + p\right) \cdot r}{r} + \frac{-2 \cdot \left(q\_m \cdot q\_m\right)}{r}\right)\\
\mathbf{elif}\;r \leq 1.18 \cdot 10^{+277}:\\
\;\;\;\;\frac{1}{2} \cdot \left(\left(-2 \cdot \left(\frac{q\_m}{r} \cdot \frac{q\_m}{r}\right)\right) \cdot r\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\end{array}
\end{array}
if r < -9.79999999999999944e-76Initial program 15.7%
Taylor expanded in r around inf
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in r around 0
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
metadata-evalN/A
lower-*.f6411.6
Applied rewrites11.6%
if -9.79999999999999944e-76 < r < 35Initial program 41.9%
Taylor expanded in r around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
Applied rewrites33.3%
Taylor expanded in p around 0
metadata-evalN/A
lower--.f64N/A
Applied rewrites29.2%
if 35 < r < 3.5999999999999997e250Initial program 16.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites29.7%
Taylor expanded in r around 0
lower-/.f64N/A
Applied rewrites70.9%
lift-/.f64N/A
lift-fma.f64N/A
lift-neg.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-fabs.f64N/A
lift-fma.f64N/A
lift-fabs.f64N/A
div-addN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
Applied rewrites70.9%
if 3.5999999999999997e250 < r < 1.17999999999999997e277Initial program 3.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites1.6%
Taylor expanded in p around inf
lift-/.f643.5
Applied rewrites3.5%
Taylor expanded in r around 0
lower-*.f64N/A
pow2N/A
pow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
if 1.17999999999999997e277 < r Initial program 0.8%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval0.8
Applied rewrites0.8%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f64100.0
Applied rewrites100.0%
Final simplification36.2%
q_m = (fabs.f64 q) NOTE: p, r, and q_m should be sorted in increasing order before calling this function. (FPCore (p r q_m) :precision binary64 (if (<= (* 4.0 (pow q_m 2.0)) 2e-231) (* (- (+ r p) r) 0.5) (- q_m)))
q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if ((4.0 * pow(q_m, 2.0)) <= 2e-231) {
tmp = ((r + p) - r) * 0.5;
} else {
tmp = -q_m;
}
return tmp;
}
q_m = private
NOTE: p, r, and q_m 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(p, r, q_m)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q_m
real(8) :: tmp
if ((4.0d0 * (q_m ** 2.0d0)) <= 2d-231) then
tmp = ((r + p) - r) * 0.5d0
else
tmp = -q_m
end if
code = tmp
end function
q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
double tmp;
if ((4.0 * Math.pow(q_m, 2.0)) <= 2e-231) {
tmp = ((r + p) - r) * 0.5;
} else {
tmp = -q_m;
}
return tmp;
}
q_m = math.fabs(q) [p, r, q_m] = sort([p, r, q_m]) def code(p, r, q_m): tmp = 0 if (4.0 * math.pow(q_m, 2.0)) <= 2e-231: tmp = ((r + p) - r) * 0.5 else: tmp = -q_m return tmp
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (Float64(4.0 * (q_m ^ 2.0)) <= 2e-231) tmp = Float64(Float64(Float64(r + p) - r) * 0.5); else tmp = Float64(-q_m); end return tmp end
q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
tmp = 0.0;
if ((4.0 * (q_m ^ 2.0)) <= 2e-231)
tmp = ((r + p) - r) * 0.5;
else
tmp = -q_m;
end
tmp_2 = tmp;
end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[N[(4.0 * N[Power[q$95$m, 2.0], $MachinePrecision]), $MachinePrecision], 2e-231], N[(N[(N[(r + p), $MachinePrecision] - r), $MachinePrecision] * 0.5), $MachinePrecision], (-q$95$m)]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;4 \cdot {q\_m}^{2} \leq 2 \cdot 10^{-231}:\\
\;\;\;\;\left(\left(r + p\right) - r\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;-q\_m\\
\end{array}
\end{array}
if (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 2e-231Initial program 27.3%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites45.2%
Taylor expanded in p around 0
metadata-evalN/A
associate-+r-N/A
*-commutativeN/A
lower-*.f64N/A
associate-+r-N/A
lower--.f64N/A
+-commutativeN/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-+.f64N/A
metadata-eval26.6
Applied rewrites26.6%
if 2e-231 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) Initial program 24.9%
Taylor expanded in q around inf
mul-1-negN/A
lower-neg.f6426.4
Applied rewrites26.4%
q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
:precision binary64
(if (<= r -9.8e-76)
(fma (+ (+ p (fabs p)) (fabs r)) 0.5 (* -0.5 r))
(if (<= r 35.0)
(*
0.5
(-
(+ (+ (fabs p) (fabs r)) (* p (fma -0.25 (/ p q_m) (* 0.5 (/ r q_m)))))
(* 2.0 q_m)))
(if (<= r 3.6e+250)
(*
0.5
(/
(fma (+ (+ (fma -1.0 r (fabs r)) (fabs p)) p) r (* -2.0 (* q_m q_m)))
r))
(if (<= r 1.18e+277)
(* (/ 1.0 2.0) (* (* -2.0 (* (/ q_m r) (/ q_m r))) r))
(* 0.5 (+ p (+ (- (fabs r) r) (fabs p)))))))))q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (r <= -9.8e-76) {
tmp = fma(((p + fabs(p)) + fabs(r)), 0.5, (-0.5 * r));
} else if (r <= 35.0) {
tmp = 0.5 * (((fabs(p) + fabs(r)) + (p * fma(-0.25, (p / q_m), (0.5 * (r / q_m))))) - (2.0 * q_m));
} else if (r <= 3.6e+250) {
tmp = 0.5 * (fma(((fma(-1.0, r, fabs(r)) + fabs(p)) + p), r, (-2.0 * (q_m * q_m))) / r);
} else if (r <= 1.18e+277) {
tmp = (1.0 / 2.0) * ((-2.0 * ((q_m / r) * (q_m / r))) * r);
} else {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
}
return tmp;
}
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (r <= -9.8e-76) tmp = fma(Float64(Float64(p + abs(p)) + abs(r)), 0.5, Float64(-0.5 * r)); elseif (r <= 35.0) tmp = Float64(0.5 * Float64(Float64(Float64(abs(p) + abs(r)) + Float64(p * fma(-0.25, Float64(p / q_m), Float64(0.5 * Float64(r / q_m))))) - Float64(2.0 * q_m))); elseif (r <= 3.6e+250) tmp = Float64(0.5 * Float64(fma(Float64(Float64(fma(-1.0, r, abs(r)) + abs(p)) + p), r, Float64(-2.0 * Float64(q_m * q_m))) / r)); elseif (r <= 1.18e+277) tmp = Float64(Float64(1.0 / 2.0) * Float64(Float64(-2.0 * Float64(Float64(q_m / r) * Float64(q_m / r))) * r)); else tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); end return tmp end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[r, -9.8e-76], N[(N[(N[(p + N[Abs[p], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5 + N[(-0.5 * r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 35.0], N[(0.5 * N[(N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[(p * N[(-0.25 * N[(p / q$95$m), $MachinePrecision] + N[(0.5 * N[(r / q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(2.0 * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 3.6e+250], N[(0.5 * N[(N[(N[(N[(N[(-1.0 * r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + p), $MachinePrecision] * r + N[(-2.0 * N[(q$95$m * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1.18e+277], N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(-2.0 * N[(N[(q$95$m / r), $MachinePrecision] * N[(q$95$m / r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * r), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;r \leq -9.8 \cdot 10^{-76}:\\
\;\;\;\;\mathsf{fma}\left(\left(p + \left|p\right|\right) + \left|r\right|, 0.5, -0.5 \cdot r\right)\\
\mathbf{elif}\;r \leq 35:\\
\;\;\;\;0.5 \cdot \left(\left(\left(\left|p\right| + \left|r\right|\right) + p \cdot \mathsf{fma}\left(-0.25, \frac{p}{q\_m}, 0.5 \cdot \frac{r}{q\_m}\right)\right) - 2 \cdot q\_m\right)\\
\mathbf{elif}\;r \leq 3.6 \cdot 10^{+250}:\\
\;\;\;\;0.5 \cdot \frac{\mathsf{fma}\left(\left(\mathsf{fma}\left(-1, r, \left|r\right|\right) + \left|p\right|\right) + p, r, -2 \cdot \left(q\_m \cdot q\_m\right)\right)}{r}\\
\mathbf{elif}\;r \leq 1.18 \cdot 10^{+277}:\\
\;\;\;\;\frac{1}{2} \cdot \left(\left(-2 \cdot \left(\frac{q\_m}{r} \cdot \frac{q\_m}{r}\right)\right) \cdot r\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\end{array}
\end{array}
if r < -9.79999999999999944e-76Initial program 15.7%
Taylor expanded in r around inf
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in r around 0
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
metadata-evalN/A
lower-*.f6411.6
Applied rewrites11.6%
if -9.79999999999999944e-76 < r < 35Initial program 41.9%
Taylor expanded in r around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
Applied rewrites33.3%
Taylor expanded in p around 0
metadata-evalN/A
lower--.f64N/A
Applied rewrites29.2%
if 35 < r < 3.5999999999999997e250Initial program 16.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites29.7%
Taylor expanded in r around 0
lower-/.f64N/A
Applied rewrites70.9%
lift-/.f64N/A
metadata-eval70.9
Applied rewrites70.9%
if 3.5999999999999997e250 < r < 1.17999999999999997e277Initial program 3.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites1.6%
Taylor expanded in p around inf
lift-/.f643.5
Applied rewrites3.5%
Taylor expanded in r around 0
lower-*.f64N/A
pow2N/A
pow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
if 1.17999999999999997e277 < r Initial program 0.8%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval0.8
Applied rewrites0.8%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f64100.0
Applied rewrites100.0%
Final simplification36.2%
q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
:precision binary64
(if (<= r -9.8e-76)
(fma (+ (+ p (fabs p)) (fabs r)) 0.5 (* -0.5 r))
(if (<= r 35.0)
(fma
0.5
(- (+ (fabs p) (fabs r)) (* 2.0 q_m))
(* p (fma -0.125 (/ p q_m) (* 0.25 (/ r q_m)))))
(if (<= r 3.6e+250)
(*
0.5
(/
(fma (+ (+ (fma -1.0 r (fabs r)) (fabs p)) p) r (* -2.0 (* q_m q_m)))
r))
(if (<= r 1.18e+277)
(* (/ 1.0 2.0) (* (* -2.0 (* (/ q_m r) (/ q_m r))) r))
(* 0.5 (+ p (+ (- (fabs r) r) (fabs p)))))))))q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (r <= -9.8e-76) {
tmp = fma(((p + fabs(p)) + fabs(r)), 0.5, (-0.5 * r));
} else if (r <= 35.0) {
tmp = fma(0.5, ((fabs(p) + fabs(r)) - (2.0 * q_m)), (p * fma(-0.125, (p / q_m), (0.25 * (r / q_m)))));
} else if (r <= 3.6e+250) {
tmp = 0.5 * (fma(((fma(-1.0, r, fabs(r)) + fabs(p)) + p), r, (-2.0 * (q_m * q_m))) / r);
} else if (r <= 1.18e+277) {
tmp = (1.0 / 2.0) * ((-2.0 * ((q_m / r) * (q_m / r))) * r);
} else {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
}
return tmp;
}
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (r <= -9.8e-76) tmp = fma(Float64(Float64(p + abs(p)) + abs(r)), 0.5, Float64(-0.5 * r)); elseif (r <= 35.0) tmp = fma(0.5, Float64(Float64(abs(p) + abs(r)) - Float64(2.0 * q_m)), Float64(p * fma(-0.125, Float64(p / q_m), Float64(0.25 * Float64(r / q_m))))); elseif (r <= 3.6e+250) tmp = Float64(0.5 * Float64(fma(Float64(Float64(fma(-1.0, r, abs(r)) + abs(p)) + p), r, Float64(-2.0 * Float64(q_m * q_m))) / r)); elseif (r <= 1.18e+277) tmp = Float64(Float64(1.0 / 2.0) * Float64(Float64(-2.0 * Float64(Float64(q_m / r) * Float64(q_m / r))) * r)); else tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); end return tmp end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[r, -9.8e-76], N[(N[(N[(p + N[Abs[p], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5 + N[(-0.5 * r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 35.0], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[(2.0 * q$95$m), $MachinePrecision]), $MachinePrecision] + N[(p * N[(-0.125 * N[(p / q$95$m), $MachinePrecision] + N[(0.25 * N[(r / q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 3.6e+250], N[(0.5 * N[(N[(N[(N[(N[(-1.0 * r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + p), $MachinePrecision] * r + N[(-2.0 * N[(q$95$m * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1.18e+277], N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(-2.0 * N[(N[(q$95$m / r), $MachinePrecision] * N[(q$95$m / r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * r), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;r \leq -9.8 \cdot 10^{-76}:\\
\;\;\;\;\mathsf{fma}\left(\left(p + \left|p\right|\right) + \left|r\right|, 0.5, -0.5 \cdot r\right)\\
\mathbf{elif}\;r \leq 35:\\
\;\;\;\;\mathsf{fma}\left(0.5, \left(\left|p\right| + \left|r\right|\right) - 2 \cdot q\_m, p \cdot \mathsf{fma}\left(-0.125, \frac{p}{q\_m}, 0.25 \cdot \frac{r}{q\_m}\right)\right)\\
\mathbf{elif}\;r \leq 3.6 \cdot 10^{+250}:\\
\;\;\;\;0.5 \cdot \frac{\mathsf{fma}\left(\left(\mathsf{fma}\left(-1, r, \left|r\right|\right) + \left|p\right|\right) + p, r, -2 \cdot \left(q\_m \cdot q\_m\right)\right)}{r}\\
\mathbf{elif}\;r \leq 1.18 \cdot 10^{+277}:\\
\;\;\;\;\frac{1}{2} \cdot \left(\left(-2 \cdot \left(\frac{q\_m}{r} \cdot \frac{q\_m}{r}\right)\right) \cdot r\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\end{array}
\end{array}
if r < -9.79999999999999944e-76Initial program 15.7%
Taylor expanded in r around inf
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in r around 0
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
metadata-evalN/A
lower-*.f6411.6
Applied rewrites11.6%
if -9.79999999999999944e-76 < r < 35Initial program 41.9%
Taylor expanded in r around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
Applied rewrites33.3%
Taylor expanded in p around 0
metadata-evalN/A
lower-fma.f64N/A
metadata-evalN/A
lower--.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6429.2
Applied rewrites29.2%
if 35 < r < 3.5999999999999997e250Initial program 16.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites29.7%
Taylor expanded in r around 0
lower-/.f64N/A
Applied rewrites70.9%
lift-/.f64N/A
metadata-eval70.9
Applied rewrites70.9%
if 3.5999999999999997e250 < r < 1.17999999999999997e277Initial program 3.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites1.6%
Taylor expanded in p around inf
lift-/.f643.5
Applied rewrites3.5%
Taylor expanded in r around 0
lower-*.f64N/A
pow2N/A
pow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
if 1.17999999999999997e277 < r Initial program 0.8%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval0.8
Applied rewrites0.8%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f64100.0
Applied rewrites100.0%
Final simplification36.2%
q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
:precision binary64
(if (<= r -9.8e-76)
(fma (+ (+ p (fabs p)) (fabs r)) 0.5 (* -0.5 r))
(if (<= r 1850000.0)
(- q_m)
(if (<= r 3.6e+250)
(*
0.5
(/
(fma (+ (+ (fma -1.0 r (fabs r)) (fabs p)) p) r (* -2.0 (* q_m q_m)))
r))
(if (<= r 1.18e+277)
(* (/ 1.0 2.0) (* (* -2.0 (* (/ q_m r) (/ q_m r))) r))
(* 0.5 (+ p (+ (- (fabs r) r) (fabs p)))))))))q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (r <= -9.8e-76) {
tmp = fma(((p + fabs(p)) + fabs(r)), 0.5, (-0.5 * r));
} else if (r <= 1850000.0) {
tmp = -q_m;
} else if (r <= 3.6e+250) {
tmp = 0.5 * (fma(((fma(-1.0, r, fabs(r)) + fabs(p)) + p), r, (-2.0 * (q_m * q_m))) / r);
} else if (r <= 1.18e+277) {
tmp = (1.0 / 2.0) * ((-2.0 * ((q_m / r) * (q_m / r))) * r);
} else {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
}
return tmp;
}
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (r <= -9.8e-76) tmp = fma(Float64(Float64(p + abs(p)) + abs(r)), 0.5, Float64(-0.5 * r)); elseif (r <= 1850000.0) tmp = Float64(-q_m); elseif (r <= 3.6e+250) tmp = Float64(0.5 * Float64(fma(Float64(Float64(fma(-1.0, r, abs(r)) + abs(p)) + p), r, Float64(-2.0 * Float64(q_m * q_m))) / r)); elseif (r <= 1.18e+277) tmp = Float64(Float64(1.0 / 2.0) * Float64(Float64(-2.0 * Float64(Float64(q_m / r) * Float64(q_m / r))) * r)); else tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); end return tmp end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[r, -9.8e-76], N[(N[(N[(p + N[Abs[p], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5 + N[(-0.5 * r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1850000.0], (-q$95$m), If[LessEqual[r, 3.6e+250], N[(0.5 * N[(N[(N[(N[(N[(-1.0 * r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + p), $MachinePrecision] * r + N[(-2.0 * N[(q$95$m * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1.18e+277], N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(-2.0 * N[(N[(q$95$m / r), $MachinePrecision] * N[(q$95$m / r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * r), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;r \leq -9.8 \cdot 10^{-76}:\\
\;\;\;\;\mathsf{fma}\left(\left(p + \left|p\right|\right) + \left|r\right|, 0.5, -0.5 \cdot r\right)\\
\mathbf{elif}\;r \leq 1850000:\\
\;\;\;\;-q\_m\\
\mathbf{elif}\;r \leq 3.6 \cdot 10^{+250}:\\
\;\;\;\;0.5 \cdot \frac{\mathsf{fma}\left(\left(\mathsf{fma}\left(-1, r, \left|r\right|\right) + \left|p\right|\right) + p, r, -2 \cdot \left(q\_m \cdot q\_m\right)\right)}{r}\\
\mathbf{elif}\;r \leq 1.18 \cdot 10^{+277}:\\
\;\;\;\;\frac{1}{2} \cdot \left(\left(-2 \cdot \left(\frac{q\_m}{r} \cdot \frac{q\_m}{r}\right)\right) \cdot r\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\end{array}
\end{array}
if r < -9.79999999999999944e-76Initial program 15.7%
Taylor expanded in r around inf
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in r around 0
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
metadata-evalN/A
lower-*.f6411.6
Applied rewrites11.6%
if -9.79999999999999944e-76 < r < 1.85e6Initial program 43.0%
Taylor expanded in q around inf
mul-1-negN/A
lower-neg.f6430.2
Applied rewrites30.2%
if 1.85e6 < r < 3.5999999999999997e250Initial program 13.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites28.9%
Taylor expanded in r around 0
lower-/.f64N/A
Applied rewrites71.5%
lift-/.f64N/A
metadata-eval71.5
Applied rewrites71.5%
if 3.5999999999999997e250 < r < 1.17999999999999997e277Initial program 3.9%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites1.6%
Taylor expanded in p around inf
lift-/.f643.5
Applied rewrites3.5%
Taylor expanded in r around 0
lower-*.f64N/A
pow2N/A
pow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
if 1.17999999999999997e277 < r Initial program 0.8%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval0.8
Applied rewrites0.8%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f64100.0
Applied rewrites100.0%
Final simplification36.4%
q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
:precision binary64
(if (<= r -9.8e-76)
(fma (+ (+ p (fabs p)) (fabs r)) 0.5 (* -0.5 r))
(if (<= r 1850000.0)
(- q_m)
(if (<= r 4.5e+285)
(*
0.5
(/
(fma (+ (+ (fma -1.0 r (fabs r)) (fabs p)) p) r (* -2.0 (* q_m q_m)))
r))
(* 0.5 (+ p (+ (- (fabs r) r) (fabs p))))))))q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (r <= -9.8e-76) {
tmp = fma(((p + fabs(p)) + fabs(r)), 0.5, (-0.5 * r));
} else if (r <= 1850000.0) {
tmp = -q_m;
} else if (r <= 4.5e+285) {
tmp = 0.5 * (fma(((fma(-1.0, r, fabs(r)) + fabs(p)) + p), r, (-2.0 * (q_m * q_m))) / r);
} else {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
}
return tmp;
}
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (r <= -9.8e-76) tmp = fma(Float64(Float64(p + abs(p)) + abs(r)), 0.5, Float64(-0.5 * r)); elseif (r <= 1850000.0) tmp = Float64(-q_m); elseif (r <= 4.5e+285) tmp = Float64(0.5 * Float64(fma(Float64(Float64(fma(-1.0, r, abs(r)) + abs(p)) + p), r, Float64(-2.0 * Float64(q_m * q_m))) / r)); else tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); end return tmp end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[r, -9.8e-76], N[(N[(N[(p + N[Abs[p], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5 + N[(-0.5 * r), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 1850000.0], (-q$95$m), If[LessEqual[r, 4.5e+285], N[(0.5 * N[(N[(N[(N[(N[(-1.0 * r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + p), $MachinePrecision] * r + N[(-2.0 * N[(q$95$m * q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / r), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;r \leq -9.8 \cdot 10^{-76}:\\
\;\;\;\;\mathsf{fma}\left(\left(p + \left|p\right|\right) + \left|r\right|, 0.5, -0.5 \cdot r\right)\\
\mathbf{elif}\;r \leq 1850000:\\
\;\;\;\;-q\_m\\
\mathbf{elif}\;r \leq 4.5 \cdot 10^{+285}:\\
\;\;\;\;0.5 \cdot \frac{\mathsf{fma}\left(\left(\mathsf{fma}\left(-1, r, \left|r\right|\right) + \left|p\right|\right) + p, r, -2 \cdot \left(q\_m \cdot q\_m\right)\right)}{r}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\end{array}
\end{array}
if r < -9.79999999999999944e-76Initial program 15.7%
Taylor expanded in r around inf
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites5.0%
Taylor expanded in r around 0
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lift-fabs.f64N/A
lift-fabs.f64N/A
metadata-evalN/A
lower-*.f6411.6
Applied rewrites11.6%
if -9.79999999999999944e-76 < r < 1.85e6Initial program 43.0%
Taylor expanded in q around inf
mul-1-negN/A
lower-neg.f6430.2
Applied rewrites30.2%
if 1.85e6 < r < 4.5e285Initial program 12.2%
Taylor expanded in r around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites25.8%
Taylor expanded in r around 0
lower-/.f64N/A
Applied rewrites63.3%
lift-/.f64N/A
metadata-eval63.3
Applied rewrites63.3%
if 4.5e285 < r Initial program 0.7%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval0.7
Applied rewrites0.7%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f64100.0
Applied rewrites100.0%
Final simplification34.2%
q_m = (fabs.f64 q) NOTE: p, r, and q_m should be sorted in increasing order before calling this function. (FPCore (p r q_m) :precision binary64 (if (<= q_m 3.6e-24) (* 0.5 (+ p (+ (- (fabs r) r) (fabs p)))) (- q_m)))
q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
double tmp;
if (q_m <= 3.6e-24) {
tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
} else {
tmp = -q_m;
}
return tmp;
}
q_m = private
NOTE: p, r, and q_m 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(p, r, q_m)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q_m
real(8) :: tmp
if (q_m <= 3.6d-24) then
tmp = 0.5d0 * (p + ((abs(r) - r) + abs(p)))
else
tmp = -q_m
end if
code = tmp
end function
q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
double tmp;
if (q_m <= 3.6e-24) {
tmp = 0.5 * (p + ((Math.abs(r) - r) + Math.abs(p)));
} else {
tmp = -q_m;
}
return tmp;
}
q_m = math.fabs(q) [p, r, q_m] = sort([p, r, q_m]) def code(p, r, q_m): tmp = 0 if q_m <= 3.6e-24: tmp = 0.5 * (p + ((math.fabs(r) - r) + math.fabs(p))) else: tmp = -q_m return tmp
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) tmp = 0.0 if (q_m <= 3.6e-24) tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))); else tmp = Float64(-q_m); end return tmp end
q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
tmp = 0.0;
if (q_m <= 3.6e-24)
tmp = 0.5 * (p + ((abs(r) - r) + abs(p)));
else
tmp = -q_m;
end
tmp_2 = tmp;
end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 3.6e-24], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-q$95$m)]
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
\begin{array}{l}
\mathbf{if}\;q\_m \leq 3.6 \cdot 10^{-24}:\\
\;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\
\mathbf{else}:\\
\;\;\;\;-q\_m\\
\end{array}
\end{array}
if q < 3.6000000000000001e-24Initial program 26.1%
Taylor expanded in p around -inf
metadata-evalN/A
associate-*r*N/A
mul-1-negN/A
lower-*.f64N/A
lower-neg.f64N/A
lower--.f64N/A
Applied rewrites27.8%
Taylor expanded in r around inf
metadata-evalN/A
*-commutativeN/A
unpow1N/A
metadata-evalN/A
sqrt-pow1N/A
unpow2N/A
rem-sqrt-square-revN/A
lower-*.f64N/A
rem-sqrt-square-revN/A
unpow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-/.f64N/A
metadata-eval6.7
Applied rewrites6.7%
Taylor expanded in p around 0
metadata-evalN/A
metadata-evalN/A
distribute-lft-outN/A
lower-*.f64N/A
metadata-evalN/A
lower-+.f64N/A
associate-+r-N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lift-fabs.f64N/A
lift-fabs.f6427.9
Applied rewrites27.9%
if 3.6000000000000001e-24 < q Initial program 24.5%
Taylor expanded in q around inf
mul-1-negN/A
lower-neg.f6452.3
Applied rewrites52.3%
q_m = (fabs.f64 q) NOTE: p, r, and q_m should be sorted in increasing order before calling this function. (FPCore (p r q_m) :precision binary64 (- q_m))
q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
return -q_m;
}
q_m = private
NOTE: p, r, and q_m 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(p, r, q_m)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q_m
code = -q_m
end function
q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
return -q_m;
}
q_m = math.fabs(q) [p, r, q_m] = sort([p, r, q_m]) def code(p, r, q_m): return -q_m
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) return Float64(-q_m) end
q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
tmp = -q_m;
end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := (-q$95$m)
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
-q\_m
\end{array}
Initial program 25.6%
Taylor expanded in q around inf
mul-1-negN/A
lower-neg.f6420.4
Applied rewrites20.4%
q_m = (fabs.f64 q) NOTE: p, r, and q_m should be sorted in increasing order before calling this function. (FPCore (p r q_m) :precision binary64 q_m)
q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
return q_m;
}
q_m = private
NOTE: p, r, and q_m 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(p, r, q_m)
use fmin_fmax_functions
real(8), intent (in) :: p
real(8), intent (in) :: r
real(8), intent (in) :: q_m
code = q_m
end function
q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
return q_m;
}
q_m = math.fabs(q) [p, r, q_m] = sort([p, r, q_m]) def code(p, r, q_m): return q_m
q_m = abs(q) p, r, q_m = sort([p, r, q_m]) function code(p, r, q_m) return q_m end
q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
tmp = q_m;
end
q_m = N[Abs[q], $MachinePrecision] NOTE: p, r, and q_m should be sorted in increasing order before calling this function. code[p_, r_, q$95$m_] := q$95$m
\begin{array}{l}
q_m = \left|q\right|
\\
[p, r, q_m] = \mathsf{sort}([p, r, q_m])\\
\\
q\_m
\end{array}
Initial program 25.6%
Taylor expanded in q around -inf
Applied rewrites16.0%
herbie shell --seed 2025074
(FPCore (p r q)
:name "1/2(abs(p)+abs(r) - sqrt((p-r)^2 + 4q^2))"
:precision binary64
(* (/ 1.0 2.0) (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))