1/2(abs(p)+abs(r) + sqrt((p-r)^2 + 4q^2))

Percentage Accurate: 45.4% → 79.7%

Time: 5.8s

Alternatives: 9

Speedup: 13.1×

Specification

Math

\[\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} \]

FPCore

(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)))))))

C

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)))));
}

Fortran

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

Java

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)))));
}

Python

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)))))

Julia

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

MATLAB

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

Wolfram

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]

Initial Program: 45.4% accurate, 1.0× speedup

Math

\[\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} \]

FPCore

(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)))))))

C

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)))));
}

Fortran

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

Java

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)))));
}

Python

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)))))

Julia

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

MATLAB

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

Wolfram

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]

Alternative 1: 79.7% accurate, 10.0× speedup

Math

\[\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.5 \cdot 10^{+19}:\\ \;\;\;\;\left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left|r\right| + \left|p\right|, 0.5, q\_m\right)\\ \end{array} \end{array} \]

FPCore

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.5e+19)
   (* (- (- p (+ r (fabs p))) (fabs r)) -0.5)
   (fma (+ (fabs r) (fabs p)) 0.5 q_m)))

C

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.5e+19) {
		tmp = ((p - (r + fabs(p))) - fabs(r)) * -0.5;
	} else {
		tmp = fma((fabs(r) + fabs(p)), 0.5, q_m);
	}
	return tmp;
}

Julia

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.5e+19)
		tmp = Float64(Float64(Float64(p - Float64(r + abs(p))) - abs(r)) * -0.5);
	else
		tmp = fma(Float64(abs(r) + abs(p)), 0.5, q_m);
	end
	return tmp
end

Wolfram

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.5e+19], N[(N[(N[(p - N[(r + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Abs[r], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5 + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 3.5e19

   1. Initial program 48.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 35.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.3%

      \[\leadsto \left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot \color{blue}{-0.5} \]

   if 3.5e19 < q

   1. Initial program 45.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| + \left|p\right|}{q} \cdot 0.5, q, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 74.6%

      \[\leadsto \mathsf{fma}\left(\left|r\right| + \left|p\right|, \color{blue}{0.5}, q\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 63.7% accurate, 9.6× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;p \leq -2.05 \cdot 10^{+138}:\\ \;\;\;\;\left(\left(-p\right) + \left|p\right|\right) \cdot 0.5\\ \mathbf{elif}\;p \leq -7 \cdot 10^{-226}:\\ \;\;\;\;\mathsf{fma}\left(\left|r\right| + \left|p\right|, 0.5, q\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-r\right) - \left|r\right|\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

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 (<= p -2.05e+138)
   (* (+ (- p) (fabs p)) 0.5)
   (if (<= p -7e-226)
     (fma (+ (fabs r) (fabs p)) 0.5 q_m)
     (* (- (- r) (fabs r)) -0.5))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -2.05e+138) {
		tmp = (-p + fabs(p)) * 0.5;
	} else if (p <= -7e-226) {
		tmp = fma((fabs(r) + fabs(p)), 0.5, q_m);
	} else {
		tmp = (-r - fabs(r)) * -0.5;
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (p <= -2.05e+138)
		tmp = Float64(Float64(Float64(-p) + abs(p)) * 0.5);
	elseif (p <= -7e-226)
		tmp = fma(Float64(abs(r) + abs(p)), 0.5, q_m);
	else
		tmp = Float64(Float64(Float64(-r) - abs(r)) * -0.5);
	end
	return tmp
end

Wolfram

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[p, -2.05e+138], N[(N[((-p) + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[p, -7e-226], N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5 + q$95$m), $MachinePrecision], N[(N[((-r) - N[Abs[r], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if p < -2.0499999999999999e138

   1. Initial program 24.0%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{r}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 18.9%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{r}\right) \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + r\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right) \cdot \frac{1}{2}} \]

      3. lower-*.f64 18.9

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right) \cdot \frac{1}{2}} \]

      4. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right)} \cdot \frac{1}{2} \]

      5. +-commutative N/A

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      6. lower-+.f64 18.9

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      7. lift-/.f64 N/A

         \[\leadsto \left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot \color{blue}{\frac{1}{2}} \]

      8. metadata-eval 18.9

         \[\leadsto \left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot \color{blue}{0.5} \]

   7. Applied rewrites 18.9%

      \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot 0.5} \]
   8. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      2. lift-+.f64 N/A

         \[\leadsto \left(r + \color{blue}{\left(\left|p\right| + \left|r\right|\right)}\right) \cdot \frac{1}{2} \]

      3. +-commutative N/A

         \[\leadsto \left(r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}\right) \cdot \frac{1}{2} \]

      4. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot \frac{1}{2} \]

      5. lower-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot \frac{1}{2} \]

      6. lower-+.f64 19.2

         \[\leadsto \left(\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|\right) \cdot 0.5 \]

   9. Applied rewrites 19.2%

      \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot 0.5 \]

   10. Taylor expanded in p around -inf

       \[\leadsto \left(\color{blue}{-1 \cdot p} + \left|p\right|\right) \cdot \frac{1}{2} \]
   11. Step-by-step derivation

   12. Applied rewrites 83.9%

       \[\leadsto \left(\color{blue}{\left(-p\right)} + \left|p\right|\right) \cdot 0.5 \]

   if -2.0499999999999999e138 < p < -7e-226

   1. Initial program 51.6%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 26.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| + \left|p\right|}{q} \cdot 0.5, q, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.4%

      \[\leadsto \mathsf{fma}\left(\left|r\right| + \left|p\right|, \color{blue}{0.5}, q\right) \]

   if -7e-226 < p

   1. Initial program 51.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 26.9%

      \[\leadsto \left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot \color{blue}{-0.5} \]

   9. Taylor expanded in r around inf

      \[\leadsto \left(-1 \cdot r - \left|r\right|\right) \cdot \frac{-1}{2} \]
   10. Step-by-step derivation

   11. Applied rewrites 26.3%

       \[\leadsto \left(\left(-r\right) - \left|r\right|\right) \cdot -0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 62.2% accurate, 10.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;p \leq -6 \cdot 10^{+70}:\\ \;\;\;\;\left(\left(-p\right) + \left|p\right|\right) \cdot 0.5\\ \mathbf{elif}\;p \leq -7.5 \cdot 10^{-226}:\\ \;\;\;\;q\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-r\right) - \left|r\right|\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

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 (<= p -6e+70)
   (* (+ (- p) (fabs p)) 0.5)
   (if (<= p -7.5e-226) q_m (* (- (- r) (fabs r)) -0.5))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -6e+70) {
		tmp = (-p + fabs(p)) * 0.5;
	} else if (p <= -7.5e-226) {
		tmp = q_m;
	} else {
		tmp = (-r - fabs(r)) * -0.5;
	}
	return tmp;
}

Fortran

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 (p <= (-6d+70)) then
        tmp = (-p + abs(p)) * 0.5d0
    else if (p <= (-7.5d-226)) then
        tmp = q_m
    else
        tmp = (-r - abs(r)) * (-0.5d0)
    end if
    code = tmp
end function

Java

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 (p <= -6e+70) {
		tmp = (-p + Math.abs(p)) * 0.5;
	} else if (p <= -7.5e-226) {
		tmp = q_m;
	} else {
		tmp = (-r - Math.abs(r)) * -0.5;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if p <= -6e+70:
		tmp = (-p + math.fabs(p)) * 0.5
	elif p <= -7.5e-226:
		tmp = q_m
	else:
		tmp = (-r - math.fabs(r)) * -0.5
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (p <= -6e+70)
		tmp = Float64(Float64(Float64(-p) + abs(p)) * 0.5);
	elseif (p <= -7.5e-226)
		tmp = q_m;
	else
		tmp = Float64(Float64(Float64(-r) - abs(r)) * -0.5);
	end
	return tmp
end

MATLAB

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 (p <= -6e+70)
		tmp = (-p + abs(p)) * 0.5;
	elseif (p <= -7.5e-226)
		tmp = q_m;
	else
		tmp = (-r - abs(r)) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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[p, -6e+70], N[(N[((-p) + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[p, -7.5e-226], q$95$m, N[(N[((-r) - N[Abs[r], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if p < -5.99999999999999952e70

   1. Initial program 32.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{r}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 23.9%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{r}\right) \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + r\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right) \cdot \frac{1}{2}} \]

      3. lower-*.f64 23.9

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right) \cdot \frac{1}{2}} \]

      4. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) + r\right)} \cdot \frac{1}{2} \]

      5. +-commutative N/A

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      6. lower-+.f64 23.9

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      7. lift-/.f64 N/A

         \[\leadsto \left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot \color{blue}{\frac{1}{2}} \]

      8. metadata-eval 23.9

         \[\leadsto \left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot \color{blue}{0.5} \]

   7. Applied rewrites 23.9%

      \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right) \cdot 0.5} \]
   8. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \cdot \frac{1}{2} \]

      2. lift-+.f64 N/A

         \[\leadsto \left(r + \color{blue}{\left(\left|p\right| + \left|r\right|\right)}\right) \cdot \frac{1}{2} \]

      3. +-commutative N/A

         \[\leadsto \left(r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}\right) \cdot \frac{1}{2} \]

      4. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot \frac{1}{2} \]

      5. lower-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot \frac{1}{2} \]

      6. lower-+.f64 24.2

         \[\leadsto \left(\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|\right) \cdot 0.5 \]

   9. Applied rewrites 24.2%

      \[\leadsto \color{blue}{\left(\left(r + \left|r\right|\right) + \left|p\right|\right)} \cdot 0.5 \]

   10. Taylor expanded in p around -inf

       \[\leadsto \left(\color{blue}{-1 \cdot p} + \left|p\right|\right) \cdot \frac{1}{2} \]
   11. Step-by-step derivation

   12. Applied rewrites 69.3%

       \[\leadsto \left(\color{blue}{\left(-p\right)} + \left|p\right|\right) \cdot 0.5 \]

   if -5.99999999999999952e70 < p < -7.50000000000000044e-226

   1. Initial program 51.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q} \]
   4. Step-by-step derivation

   5. Applied rewrites 21.4%

      \[\leadsto \color{blue}{q} \]

   if -7.50000000000000044e-226 < p

   1. Initial program 51.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 26.9%

      \[\leadsto \left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot \color{blue}{-0.5} \]

   9. Taylor expanded in r around inf

      \[\leadsto \left(-1 \cdot r - \left|r\right|\right) \cdot \frac{-1}{2} \]
   10. Step-by-step derivation

   11. Applied rewrites 26.3%

       \[\leadsto \left(\left(-r\right) - \left|r\right|\right) \cdot -0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 79.7% accurate, 10.0× speedup

Math

\[\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.5 \cdot 10^{+19}:\\ \;\;\;\;-0.5 \cdot \left(p - \left(\left(\left|p\right| + r\right) + \left|r\right|\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left|r\right| + \left|p\right|, 0.5, q\_m\right)\\ \end{array} \end{array} \]

FPCore

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.5e+19)
   (* -0.5 (- p (+ (+ (fabs p) r) (fabs r))))
   (fma (+ (fabs r) (fabs p)) 0.5 q_m)))

C

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.5e+19) {
		tmp = -0.5 * (p - ((fabs(p) + r) + fabs(r)));
	} else {
		tmp = fma((fabs(r) + fabs(p)), 0.5, q_m);
	}
	return tmp;
}

Julia

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.5e+19)
		tmp = Float64(-0.5 * Float64(p - Float64(Float64(abs(p) + r) + abs(r))));
	else
		tmp = fma(Float64(abs(r) + abs(p)), 0.5, q_m);
	end
	return tmp
end

Wolfram

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.5e+19], N[(-0.5 * N[(p - N[(N[(N[Abs[p], $MachinePrecision] + r), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5 + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 3.5e19

   1. Initial program 48.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{-1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.0%

      \[\leadsto -0.5 \cdot \color{blue}{\left(p - \left(\left(\left|p\right| + r\right) + \left|r\right|\right)\right)} \]

   if 3.5e19 < q

   1. Initial program 45.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| + \left|p\right|}{q} \cdot 0.5, q, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 74.6%

      \[\leadsto \mathsf{fma}\left(\left|r\right| + \left|p\right|, \color{blue}{0.5}, q\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 53.6% accurate, 13.1× speedup

Math

\[\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 2.9 \cdot 10^{+19}:\\ \;\;\;\;\left(\left(-r\right) - \left|r\right|\right) \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;q\_m\\ \end{array} \end{array} \]

FPCore

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 2.9e+19) (* (- (- r) (fabs r)) -0.5) q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 2.9e+19) {
		tmp = (-r - fabs(r)) * -0.5;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Fortran

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 <= 2.9d+19) then
        tmp = (-r - abs(r)) * (-0.5d0)
    else
        tmp = q_m
    end if
    code = tmp
end function

Java

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 <= 2.9e+19) {
		tmp = (-r - Math.abs(r)) * -0.5;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Python

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 <= 2.9e+19:
		tmp = (-r - math.fabs(r)) * -0.5
	else:
		tmp = q_m
	return tmp

Julia

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 <= 2.9e+19)
		tmp = Float64(Float64(Float64(-r) - abs(r)) * -0.5);
	else
		tmp = q_m;
	end
	return tmp
end

MATLAB

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 <= 2.9e+19)
		tmp = (-r - abs(r)) * -0.5;
	else
		tmp = q_m;
	end
	tmp_2 = tmp;
end

Wolfram

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, 2.9e+19], N[(N[((-r) - N[Abs[r], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 2.9e19

   1. Initial program 48.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 35.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.3%

      \[\leadsto \left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot \color{blue}{-0.5} \]

   9. Taylor expanded in r around inf

      \[\leadsto \left(-1 \cdot r - \left|r\right|\right) \cdot \frac{-1}{2} \]
   10. Step-by-step derivation

   11. Applied rewrites 23.4%

       \[\leadsto \left(\left(-r\right) - \left|r\right|\right) \cdot -0.5 \]

   if 2.9e19 < q

   1. Initial program 45.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q} \]
   4. Step-by-step derivation

   5. Applied rewrites 70.9%

      \[\leadsto \color{blue}{q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 38.8% accurate, 14.7× speedup

Math

\[\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 2.3 \cdot 10^{-47}:\\ \;\;\;\;\left(p - \left|r\right|\right) \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;q\_m\\ \end{array} \end{array} \]

FPCore

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 2.3e-47) (* (- p (fabs r)) -0.5) q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 2.3e-47) {
		tmp = (p - fabs(r)) * -0.5;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Fortran

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 <= 2.3d-47) then
        tmp = (p - abs(r)) * (-0.5d0)
    else
        tmp = q_m
    end if
    code = tmp
end function

Java

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 <= 2.3e-47) {
		tmp = (p - Math.abs(r)) * -0.5;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Python

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 <= 2.3e-47:
		tmp = (p - math.fabs(r)) * -0.5
	else:
		tmp = q_m
	return tmp

Julia

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 <= 2.3e-47)
		tmp = Float64(Float64(p - abs(r)) * -0.5);
	else
		tmp = q_m;
	end
	return tmp
end

MATLAB

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 <= 2.3e-47)
		tmp = (p - abs(r)) * -0.5;
	else
		tmp = q_m;
	end
	tmp_2 = tmp;
end

Wolfram

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, 2.3e-47], N[(N[(p - N[Abs[r], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 2.29999999999999982e-47

   1. Initial program 48.0%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 35.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 43.0%

      \[\leadsto \left(\left(p - \left(r + \left|p\right|\right)\right) - \left|r\right|\right) \cdot \color{blue}{-0.5} \]

   9. Taylor expanded in p around inf

      \[\leadsto \left(p - \left|r\right|\right) \cdot \frac{-1}{2} \]
   10. Step-by-step derivation

   11. Applied rewrites 12.2%

       \[\leadsto \left(p - \left|r\right|\right) \cdot -0.5 \]

   if 2.29999999999999982e-47 < q

   1. Initial program 47.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q} \]
   4. Step-by-step derivation

   5. Applied rewrites 67.6%

      \[\leadsto \color{blue}{q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 38.8% accurate, 16.6× speedup

Math

\[\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 2.3 \cdot 10^{-47}:\\ \;\;\;\;-0.5 \cdot \left(p - r\right)\\ \mathbf{else}:\\ \;\;\;\;q\_m\\ \end{array} \end{array} \]

FPCore

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 2.3e-47) (* -0.5 (- p r)) q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 2.3e-47) {
		tmp = -0.5 * (p - r);
	} else {
		tmp = q_m;
	}
	return tmp;
}

Fortran

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 <= 2.3d-47) then
        tmp = (-0.5d0) * (p - r)
    else
        tmp = q_m
    end if
    code = tmp
end function

Java

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 <= 2.3e-47) {
		tmp = -0.5 * (p - r);
	} else {
		tmp = q_m;
	}
	return tmp;
}

Python

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 <= 2.3e-47:
		tmp = -0.5 * (p - r)
	else:
		tmp = q_m
	return tmp

Julia

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 <= 2.3e-47)
		tmp = Float64(-0.5 * Float64(p - r));
	else
		tmp = q_m;
	end
	return tmp
end

MATLAB

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 <= 2.3e-47)
		tmp = -0.5 * (p - r);
	else
		tmp = q_m;
	end
	tmp_2 = tmp;
end

Wolfram

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, 2.3e-47], N[(-0.5 * N[(p - r), $MachinePrecision]), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 2.29999999999999982e-47

   1. Initial program 48.0%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{-1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 42.6%

      \[\leadsto -0.5 \cdot \color{blue}{\left(p - \left(\left(\left|p\right| + r\right) + \left|r\right|\right)\right)} \]

   9. Taylor expanded in r around inf

      \[\leadsto \frac{-1}{2} \cdot \left(p - r\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 8.6%

       \[\leadsto -0.5 \cdot \left(p - r\right) \]

   if 2.29999999999999982e-47 < q

   1. Initial program 47.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q} \]
   4. Step-by-step derivation

   5. Applied rewrites 67.6%

      \[\leadsto \color{blue}{q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 36.1% accurate, 20.8× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;p \leq -1.95 \cdot 10^{+231}:\\ \;\;\;\;-0.5 \cdot p\\ \mathbf{else}:\\ \;\;\;\;q\_m\\ \end{array} \end{array} \]

FPCore

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 (<= p -1.95e+231) (* -0.5 p) q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -1.95e+231) {
		tmp = -0.5 * p;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Fortran

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 (p <= (-1.95d+231)) then
        tmp = (-0.5d0) * p
    else
        tmp = q_m
    end if
    code = tmp
end function

Java

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 (p <= -1.95e+231) {
		tmp = -0.5 * p;
	} else {
		tmp = q_m;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if p <= -1.95e+231:
		tmp = -0.5 * p
	else:
		tmp = q_m
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (p <= -1.95e+231)
		tmp = Float64(-0.5 * p);
	else
		tmp = q_m;
	end
	return tmp
end

MATLAB

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 (p <= -1.95e+231)
		tmp = -0.5 * p;
	else
		tmp = q_m;
	end
	tmp_2 = tmp;
end

Wolfram

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[p, -1.95e+231], N[(-0.5 * p), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if p < -1.9500000000000001e231

   1. Initial program 8.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot p} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.7%

      \[\leadsto \color{blue}{-0.5 \cdot p} \]

   if -1.9500000000000001e231 < p

   1. Initial program 50.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q} \]
   4. Step-by-step derivation

   5. Applied rewrites 22.9%

      \[\leadsto \color{blue}{q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 35.0% accurate, 250.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ q\_m \end{array} \]

FPCore

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)

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return q_m;
}

Fortran

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

Java

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;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	return q_m

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return q_m
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 47.9%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in q around inf

   \[\leadsto \color{blue}{q} \]
4. Step-by-step derivation

5. Applied rewrites 21.6%

   \[\leadsto \color{blue}{q} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2025019 
(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)))))))