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

Percentage Accurate: 45.0% → 79.7%

Time: 3.7s

Alternatives: 11

Speedup: 3.2×

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.0% 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, 0.5× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} t_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)\\ \mathbf{if}\;t\_0 \leq 4 \cdot 10^{+150}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(r - \left(\left(p - \left|r\right|\right) - \left|p\right|\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (let* ((t_0
         (*
          (/ 1.0 2.0)
          (+
           (+ (fabs p) (fabs r))
           (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0))))))))
   (if (<= t_0 4e+150) t_0 (* (- r (- (- p (fabs r)) (fabs p))) 0.5))))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	double t_0 = (1.0 / 2.0) * ((fabs(p) + fabs(r)) + sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))));
	double tmp;
	if (t_0 <= 4e+150) {
		tmp = t_0;
	} else {
		tmp = (r - ((p - fabs(r)) - fabs(p))) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) + sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
    if (t_0 <= 4d+150) then
        tmp = t_0
    else
        tmp = (r - ((p - abs(r)) - abs(p))) * 0.5d0
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double t_0 = (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)))));
	double tmp;
	if (t_0 <= 4e+150) {
		tmp = t_0;
	} else {
		tmp = (r - ((p - Math.abs(r)) - Math.abs(p))) * 0.5;
	}
	return tmp;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	t_0 = (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)))))
	tmp = 0
	if t_0 <= 4e+150:
		tmp = t_0
	else:
		tmp = (r - ((p - math.fabs(r)) - math.fabs(p))) * 0.5
	return tmp

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	t_0 = 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))))))
	tmp = 0.0
	if (t_0 <= 4e+150)
		tmp = t_0;
	else
		tmp = Float64(Float64(r - Float64(Float64(p - abs(r)) - abs(p))) * 0.5);
	end
	return tmp
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	t_0 = (1.0 / 2.0) * ((abs(p) + abs(r)) + sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0)))));
	tmp = 0.0;
	if (t_0 <= 4e+150)
		tmp = t_0;
	else
		tmp = (r - ((p - abs(r)) - abs(p))) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, 4e+150], t$95$0, N[(N[(r - N[(N[(p - N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (+.f64 (fabs.f64 p) (fabs.f64 r)) (sqrt.f64 (+.f64 (pow.f64 (-.f64 p r) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))))))) < 3.99999999999999992e150

   1. Initial program 45.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) \]

   if 3.99999999999999992e150 < (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (+.f64 (fabs.f64 p) (fabs.f64 r)) (sqrt.f64 (+.f64 (pow.f64 (-.f64 p r) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))))))

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

Alternative 2: 79.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} \mathbf{if}\;\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \leq 4 \cdot 10^{+150}:\\ \;\;\;\;\left(\left(\left|p\right| + \sqrt{\mathsf{fma}\left(q \cdot 4, q, \left(r - p\right) \cdot \left(r - p\right)\right)}\right) + \left|r\right|\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(r - \left(\left(p - \left|r\right|\right) - \left|p\right|\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (if (<=
      (*
       (/ 1.0 2.0)
       (+
        (+ (fabs p) (fabs r))
        (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0))))))
      4e+150)
   (*
    (+ (+ (fabs p) (sqrt (fma (* q 4.0) q (* (- r p) (- r p))))) (fabs r))
    0.5)
   (* (- r (- (- p (fabs r)) (fabs p))) 0.5)))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	double tmp;
	if (((1.0 / 2.0) * ((fabs(p) + fabs(r)) + sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))))) <= 4e+150) {
		tmp = ((fabs(p) + sqrt(fma((q * 4.0), q, ((r - p) * (r - p))))) + fabs(r)) * 0.5;
	} else {
		tmp = (r - ((p - fabs(r)) - fabs(p))) * 0.5;
	}
	return tmp;
}

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	tmp = 0.0
	if (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)))))) <= 4e+150)
		tmp = Float64(Float64(Float64(abs(p) + sqrt(fma(Float64(q * 4.0), q, Float64(Float64(r - p) * Float64(r - p))))) + abs(r)) * 0.5);
	else
		tmp = Float64(Float64(r - Float64(Float64(p - abs(r)) - abs(p))) * 0.5);
	end
	return tmp
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[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], 4e+150], N[(N[(N[(N[Abs[p], $MachinePrecision] + N[Sqrt[N[(N[(q * 4.0), $MachinePrecision] * q + N[(N[(r - p), $MachinePrecision] * N[(r - p), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(r - N[(N[(p - N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (+.f64 (fabs.f64 p) (fabs.f64 r)) (sqrt.f64 (+.f64 (pow.f64 (-.f64 p r) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))))))) < 3.99999999999999992e150

   1. Initial program 45.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. 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) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right)} \]

      2. *-commutative N/A

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

      3. lower-*.f64 45.0

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

   3. Applied rewrites 45.0%

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

   if 3.99999999999999992e150 < (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (+.f64 (fabs.f64 p) (fabs.f64 r)) (sqrt.f64 (+.f64 (pow.f64 (-.f64 p r) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))))))

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

Alternative 3: 74.4% accurate, 3.2× speedup

Math

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

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (if (<= q 3.1e+66)
   (* (- r (- (- p (fabs r)) (fabs p))) 0.5)
   (+ q (* (+ (fabs p) (fabs r)) 0.5))))

C

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

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: tmp
    if (q <= 3.1d+66) then
        tmp = (r - ((p - abs(r)) - abs(p))) * 0.5d0
    else
        tmp = q + ((abs(p) + abs(r)) * 0.5d0)
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double tmp;
	if (q <= 3.1e+66) {
		tmp = (r - ((p - Math.abs(r)) - Math.abs(p))) * 0.5;
	} else {
		tmp = q + ((Math.abs(p) + Math.abs(r)) * 0.5);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	tmp = 0.0;
	if (q <= 3.1e+66)
		tmp = (r - ((p - abs(r)) - abs(p))) * 0.5;
	else
		tmp = q + ((abs(p) + abs(r)) * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[q, 3.1e+66], N[(N[(r - N[(N[(p - N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(q + N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 3.10000000000000019e66

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

   if 3.10000000000000019e66 < q

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

      1. metadata-eval N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. sum-to-mult-rev N/A

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

      9. lower-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. metadata-eval 29.1

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

   6. Applied rewrites 29.1%

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

Alternative 4: 55.5% accurate, 2.9× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} t_0 := \left|p\right| + \left|r\right|\\ \mathbf{if}\;p \leq -1.65 \cdot 10^{+44}:\\ \;\;\;\;\left(t\_0 - p\right) \cdot 0.5\\ \mathbf{elif}\;p \leq 5 \cdot 10^{-166}:\\ \;\;\;\;q + t\_0 \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(r + t\_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (let* ((t_0 (+ (fabs p) (fabs r))))
   (if (<= p -1.65e+44)
     (* (- t_0 p) 0.5)
     (if (<= p 5e-166) (+ q (* t_0 0.5)) (* 0.5 (+ r t_0))))))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	double t_0 = fabs(p) + fabs(r);
	double tmp;
	if (p <= -1.65e+44) {
		tmp = (t_0 - p) * 0.5;
	} else if (p <= 5e-166) {
		tmp = q + (t_0 * 0.5);
	} else {
		tmp = 0.5 * (r + t_0);
	}
	return tmp;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: t_0
    real(8) :: tmp
    t_0 = abs(p) + abs(r)
    if (p <= (-1.65d+44)) then
        tmp = (t_0 - p) * 0.5d0
    else if (p <= 5d-166) then
        tmp = q + (t_0 * 0.5d0)
    else
        tmp = 0.5d0 * (r + t_0)
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double t_0 = Math.abs(p) + Math.abs(r);
	double tmp;
	if (p <= -1.65e+44) {
		tmp = (t_0 - p) * 0.5;
	} else if (p <= 5e-166) {
		tmp = q + (t_0 * 0.5);
	} else {
		tmp = 0.5 * (r + t_0);
	}
	return tmp;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	t_0 = math.fabs(p) + math.fabs(r)
	tmp = 0
	if p <= -1.65e+44:
		tmp = (t_0 - p) * 0.5
	elif p <= 5e-166:
		tmp = q + (t_0 * 0.5)
	else:
		tmp = 0.5 * (r + t_0)
	return tmp

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	t_0 = Float64(abs(p) + abs(r))
	tmp = 0.0
	if (p <= -1.65e+44)
		tmp = Float64(Float64(t_0 - p) * 0.5);
	elseif (p <= 5e-166)
		tmp = Float64(q + Float64(t_0 * 0.5));
	else
		tmp = Float64(0.5 * Float64(r + t_0));
	end
	return tmp
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	t_0 = abs(p) + abs(r);
	tmp = 0.0;
	if (p <= -1.65e+44)
		tmp = (t_0 - p) * 0.5;
	elseif (p <= 5e-166)
		tmp = q + (t_0 * 0.5);
	else
		tmp = 0.5 * (r + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := Block[{t$95$0 = N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[p, -1.65e+44], N[(N[(t$95$0 - p), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[p, 5e-166], N[(q + N[(t$95$0 * 0.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(r + t$95$0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if p < -1.65000000000000007e44

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

   10. Taylor expanded in r around 0

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

       1. lower--.f64 N/A

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

       2. lower-+.f64 N/A

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

       3. lower-fabs.f64 N/A

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

       4. lower-fabs.f64 41.1

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

   12. Applied rewrites 41.1%

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

   if -1.65000000000000007e44 < p < 5e-166

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

      1. metadata-eval N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. sum-to-mult-rev N/A

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

      9. lower-+.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. metadata-eval 29.1

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

   6. Applied rewrites 29.1%

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

   if 5e-166 < p

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

   4. Applied rewrites 58.4%

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

   5. Taylor expanded in p around 0

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

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. lower-+.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-fabs.f64 N/A

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

      7. lower-fabs.f64 39.7

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

   7. Applied rewrites 39.7%

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

Alternative 5: 54.9% accurate, 2.5× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} t_0 := \left|p\right| + \left|r\right|\\ t_1 := \left(t\_0 - p\right) \cdot 0.5\\ \mathbf{if}\;r \leq -1.6 \cdot 10^{-279}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;r \leq 1.12 \cdot 10^{-51}:\\ \;\;\;\;q \cdot 1\\ \mathbf{elif}\;r \leq 1.3 \cdot 10^{-19}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(r + t\_0\right)\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (let* ((t_0 (+ (fabs p) (fabs r))) (t_1 (* (- t_0 p) 0.5)))
   (if (<= r -1.6e-279)
     t_1
     (if (<= r 1.12e-51)
       (* q 1.0)
       (if (<= r 1.3e-19) t_1 (* 0.5 (+ r t_0)))))))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	double t_0 = fabs(p) + fabs(r);
	double t_1 = (t_0 - p) * 0.5;
	double tmp;
	if (r <= -1.6e-279) {
		tmp = t_1;
	} else if (r <= 1.12e-51) {
		tmp = q * 1.0;
	} else if (r <= 1.3e-19) {
		tmp = t_1;
	} else {
		tmp = 0.5 * (r + t_0);
	}
	return tmp;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = abs(p) + abs(r)
    t_1 = (t_0 - p) * 0.5d0
    if (r <= (-1.6d-279)) then
        tmp = t_1
    else if (r <= 1.12d-51) then
        tmp = q * 1.0d0
    else if (r <= 1.3d-19) then
        tmp = t_1
    else
        tmp = 0.5d0 * (r + t_0)
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double t_0 = Math.abs(p) + Math.abs(r);
	double t_1 = (t_0 - p) * 0.5;
	double tmp;
	if (r <= -1.6e-279) {
		tmp = t_1;
	} else if (r <= 1.12e-51) {
		tmp = q * 1.0;
	} else if (r <= 1.3e-19) {
		tmp = t_1;
	} else {
		tmp = 0.5 * (r + t_0);
	}
	return tmp;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	t_0 = math.fabs(p) + math.fabs(r)
	t_1 = (t_0 - p) * 0.5
	tmp = 0
	if r <= -1.6e-279:
		tmp = t_1
	elif r <= 1.12e-51:
		tmp = q * 1.0
	elif r <= 1.3e-19:
		tmp = t_1
	else:
		tmp = 0.5 * (r + t_0)
	return tmp

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	t_0 = Float64(abs(p) + abs(r))
	t_1 = Float64(Float64(t_0 - p) * 0.5)
	tmp = 0.0
	if (r <= -1.6e-279)
		tmp = t_1;
	elseif (r <= 1.12e-51)
		tmp = Float64(q * 1.0);
	elseif (r <= 1.3e-19)
		tmp = t_1;
	else
		tmp = Float64(0.5 * Float64(r + t_0));
	end
	return tmp
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	t_0 = abs(p) + abs(r);
	t_1 = (t_0 - p) * 0.5;
	tmp = 0.0;
	if (r <= -1.6e-279)
		tmp = t_1;
	elseif (r <= 1.12e-51)
		tmp = q * 1.0;
	elseif (r <= 1.3e-19)
		tmp = t_1;
	else
		tmp = 0.5 * (r + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := Block[{t$95$0 = N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 - p), $MachinePrecision] * 0.5), $MachinePrecision]}, If[LessEqual[r, -1.6e-279], t$95$1, If[LessEqual[r, 1.12e-51], N[(q * 1.0), $MachinePrecision], If[LessEqual[r, 1.3e-19], t$95$1, N[(0.5 * N[(r + t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if r < -1.5999999999999999e-279 or 1.11999999999999998e-51 < r < 1.30000000000000006e-19

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

   10. Taylor expanded in r around 0

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

       1. lower--.f64 N/A

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

       2. lower-+.f64 N/A

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

       3. lower-fabs.f64 N/A

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

       4. lower-fabs.f64 41.1

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

   12. Applied rewrites 41.1%

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

   if -1.5999999999999999e-279 < r < 1.11999999999999998e-51

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

   5. Taylor expanded in q around inf

      \[\leadsto q \cdot 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 18.4%

      \[\leadsto q \cdot 1 \]

   if 1.30000000000000006e-19 < r

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

   4. Applied rewrites 58.4%

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

   5. Taylor expanded in p around 0

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

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. lower-+.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-fabs.f64 N/A

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

      7. lower-fabs.f64 39.7

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

   7. Applied rewrites 39.7%

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

Alternative 6: 42.4% accurate, 3.7× speedup

Math

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

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (if (<= p -1.55e+44) (* (- (+ (fabs p) (fabs r)) p) 0.5) (* q 1.0)))

C

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

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: tmp
    if (p <= (-1.55d+44)) then
        tmp = ((abs(p) + abs(r)) - p) * 0.5d0
    else
        tmp = q * 1.0d0
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double tmp;
	if (p <= -1.55e+44) {
		tmp = ((Math.abs(p) + Math.abs(r)) - p) * 0.5;
	} else {
		tmp = q * 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	tmp = 0.0;
	if (p <= -1.55e+44)
		tmp = ((abs(p) + abs(r)) - p) * 0.5;
	else
		tmp = q * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[p, -1.55e+44], N[(N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - p), $MachinePrecision] * 0.5), $MachinePrecision], N[(q * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if p < -1.54999999999999998e44

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 58.1%

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

   5. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

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

      5. lower-*.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-fabs.f64 N/A

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

      11. lower-*.f64 67.5

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

   7. Applied rewrites 67.5%

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. lift-fma.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

   9. Applied rewrites 67.5%

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

   10. Taylor expanded in r around 0

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

       1. lower--.f64 N/A

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

       2. lower-+.f64 N/A

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

       3. lower-fabs.f64 N/A

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

       4. lower-fabs.f64 41.1

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

   12. Applied rewrites 41.1%

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

   if -1.54999999999999998e44 < p

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

   5. Taylor expanded in q around inf

      \[\leadsto q \cdot 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 18.4%

      \[\leadsto q \cdot 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 26.8% accurate, 4.4× speedup

Math

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

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q)
 :precision binary64
 (if (<= q 8.5e-91) (* 0.5 (+ (fabs p) (fabs r))) (* q 1.0)))

C

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

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: tmp
    if (q <= 8.5d-91) then
        tmp = 0.5d0 * (abs(p) + abs(r))
    else
        tmp = q * 1.0d0
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double tmp;
	if (q <= 8.5e-91) {
		tmp = 0.5 * (Math.abs(p) + Math.abs(r));
	} else {
		tmp = q * 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	tmp = 0.0;
	if (q <= 8.5e-91)
		tmp = 0.5 * (abs(p) + abs(r));
	else
		tmp = q * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[q, 8.5e-91], N[(0.5 * N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(q * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 8.49999999999999985e-91

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

   4. Applied rewrites 58.4%

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

   5. Taylor expanded in p around 0

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

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. lower-+.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-fabs.f64 N/A

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

      7. lower-fabs.f64 39.7

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

   7. Applied rewrites 39.7%

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

   8. Taylor expanded in r around 0

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

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. lower-+.f64 N/A

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

      5. lower-fabs.f64 N/A

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

      6. lower-fabs.f64 14.3

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

   10. Applied rewrites 14.3%

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

   if 8.49999999999999985e-91 < q

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

   5. Taylor expanded in q around inf

      \[\leadsto q \cdot 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 18.4%

      \[\leadsto q \cdot 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 22.6% accurate, 7.3× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} \mathbf{if}\;q \leq 2.15 \cdot 10^{-122}:\\ \;\;\;\;0.5 \cdot r\\ \mathbf{else}:\\ \;\;\;\;q \cdot 1\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q) :precision binary64 (if (<= q 2.15e-122) (* 0.5 r) (* q 1.0)))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	double tmp;
	if (q <= 2.15e-122) {
		tmp = 0.5 * r;
	} else {
		tmp = q * 1.0;
	}
	return tmp;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: tmp
    if (q <= 2.15d-122) then
        tmp = 0.5d0 * r
    else
        tmp = q * 1.0d0
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double tmp;
	if (q <= 2.15e-122) {
		tmp = 0.5 * r;
	} else {
		tmp = q * 1.0;
	}
	return tmp;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	tmp = 0
	if q <= 2.15e-122:
		tmp = 0.5 * r
	else:
		tmp = q * 1.0
	return tmp

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	tmp = 0.0
	if (q <= 2.15e-122)
		tmp = Float64(0.5 * r);
	else
		tmp = Float64(q * 1.0);
	end
	return tmp
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	tmp = 0.0;
	if (q <= 2.15e-122)
		tmp = 0.5 * r;
	else
		tmp = q * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[q, 2.15e-122], N[(0.5 * r), $MachinePrecision], N[(q * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 2.15000000000000009e-122

   1. Initial program 45.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. Taylor expanded in r around inf

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

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot r \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{r} \]

      3. metadata-eval 8.4

         \[\leadsto 0.5 \cdot r \]

   4. Applied rewrites 8.4%

      \[\leadsto \color{blue}{0.5 \cdot r} \]

   if 2.15000000000000009e-122 < q

   1. Initial program 45.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. 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)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-fabs.f64 N/A

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

      9. lower-fabs.f64 26.6

         \[\leadsto q \cdot \left(1 + 0.5 \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) \]

   4. Applied rewrites 26.6%

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

   5. Taylor expanded in q around inf

      \[\leadsto q \cdot 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 18.4%

      \[\leadsto q \cdot 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 18.6% accurate, 7.3× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ \begin{array}{l} \mathbf{if}\;r \leq 1.3 \cdot 10^{-19}:\\ \;\;\;\;-0.5 \cdot p\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot r\\ \end{array} \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q) :precision binary64 (if (<= r 1.3e-19) (* -0.5 p) (* 0.5 r)))

C

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

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    real(8) :: tmp
    if (r <= 1.3d-19) then
        tmp = (-0.5d0) * p
    else
        tmp = 0.5d0 * r
    end if
    code = tmp
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	double tmp;
	if (r <= 1.3e-19) {
		tmp = -0.5 * p;
	} else {
		tmp = 0.5 * r;
	}
	return tmp;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	tmp = 0
	if r <= 1.3e-19:
		tmp = -0.5 * p
	else:
		tmp = 0.5 * r
	return tmp

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	tmp = 0.0
	if (r <= 1.3e-19)
		tmp = Float64(-0.5 * p);
	else
		tmp = Float64(0.5 * r);
	end
	return tmp
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp_2 = code(p, r, q)
	tmp = 0.0;
	if (r <= 1.3e-19)
		tmp = -0.5 * p;
	else
		tmp = 0.5 * r;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := If[LessEqual[r, 1.3e-19], N[(-0.5 * p), $MachinePrecision], N[(0.5 * r), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if r < 1.30000000000000006e-19

   1. Initial program 45.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. Taylor expanded in p around -inf

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

      1. lower-*.f64 8.7

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

   4. Applied rewrites 8.7%

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

   if 1.30000000000000006e-19 < r

   1. Initial program 45.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. Taylor expanded in r around inf

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

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot r \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{r} \]

      3. metadata-eval 8.4

         \[\leadsto 0.5 \cdot r \]

   4. Applied rewrites 8.4%

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

Alternative 10: 13.0% accurate, 14.4× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ -0.5 \cdot p \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q) :precision binary64 (* -0.5 p))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	return -0.5 * p;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = (-0.5d0) * p
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	return -0.5 * p;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	return -0.5 * p

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	return Float64(-0.5 * p)
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp = code(p, r, q)
	tmp = -0.5 * p;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := N[(-0.5 * p), $MachinePrecision]

Derivation

1. Initial program 45.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. Taylor expanded in p around -inf

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

   1. lower-*.f64 8.7

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

4. Applied rewrites 8.7%

   \[\leadsto \color{blue}{-0.5 \cdot p} \]
5. Add Preprocessing

Alternative 11: 8.7% accurate, 28.9× speedup

Math

\[\begin{array}{l} [p, r, q] = \mathsf{sort}([p, r, q])\\ \\ -q \end{array} \]

FPCore

NOTE: p, r, and q should be sorted in increasing order before calling this function.
(FPCore (p r q) :precision binary64 (- q))

C

assert(p < r && r < q);
double code(double p, double r, double q) {
	return -q;
}

Fortran

NOTE: p, r, and q 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)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = -q
end function

Java

assert p < r && r < q;
public static double code(double p, double r, double q) {
	return -q;
}

Python

[p, r, q] = sort([p, r, q])
def code(p, r, q):
	return -q

Julia

p, r, q = sort([p, r, q])
function code(p, r, q)
	return Float64(-q)
end

MATLAB

p, r, q = num2cell(sort([p, r, q])){:}
function tmp = code(p, r, q)
	tmp = -q;
end

Wolfram

NOTE: p, r, and q should be sorted in increasing order before calling this function.
code[p_, r_, q_] := (-q)

Derivation

1. Initial program 45.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. Taylor expanded in q around -inf

   \[\leadsto \color{blue}{-1 \cdot q} \]
3. Step-by-step derivation

   1. lower-*.f64 18.6

      \[\leadsto -1 \cdot \color{blue}{q} \]

4. Applied rewrites 18.6%

   \[\leadsto \color{blue}{-1 \cdot q} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto -1 \cdot \color{blue}{q} \]

   2. mul-1-neg N/A

      \[\leadsto \mathsf{neg}\left(q\right) \]

   3. lower-neg.f64 18.6

      \[\leadsto -q \]

6. Applied rewrites 18.6%

   \[\leadsto -q \]
7. Add Preprocessing

Reproduce

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