Data.Colour.RGB:hslsv from colour-2.3.3, C

Percentage Accurate: 100.0% → 100.0%

Time: 4.8s

Alternatives: 11

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x - y}{2 - \left(x + y\right)} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 2.0 (+ x y))))

C

double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (2.0d0 - (x + y))
end function

Java

public static double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

Python

def code(x, y):
	return (x - y) / (2.0 - (x + y))

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x - y) / (2.0 - (x + y));
end

Wolfram

code[x_, y_] := N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{2 - \left(x + y\right)} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 2.0 (+ x y))))

C

double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (2.0d0 - (x + y))
end function

Java

public static double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

Python

def code(x, y):
	return (x - y) / (2.0 - (x + y))

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x - y) / (2.0 - (x + y));
end

Wolfram

code[x_, y_] := N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 - \left(y + x\right)\\ \frac{x}{t\_0} - \frac{y}{t\_0} \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 2.0 (+ y x)))) (- (/ x t_0) (/ y t_0))))

C

double code(double x, double y) {
	double t_0 = 2.0 - (y + x);
	return (x / t_0) - (y / t_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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    t_0 = 2.0d0 - (y + x)
    code = (x / t_0) - (y / t_0)
end function

Java

public static double code(double x, double y) {
	double t_0 = 2.0 - (y + x);
	return (x / t_0) - (y / t_0);
}

Python

def code(x, y):
	t_0 = 2.0 - (y + x)
	return (x / t_0) - (y / t_0)

Julia

function code(x, y)
	t_0 = Float64(2.0 - Float64(y + x))
	return Float64(Float64(x / t_0) - Float64(y / t_0))
end

MATLAB

function tmp = code(x, y)
	t_0 = 2.0 - (y + x);
	tmp = (x / t_0) - (y / t_0);
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(2.0 - N[(y + x), $MachinePrecision]), $MachinePrecision]}, N[(N[(x / t$95$0), $MachinePrecision] - N[(y / t$95$0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{2 - \left(x + y\right)} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x - y}{2 - \left(x + y\right)}} \]

   2. lift--.f64 N/A

      \[\leadsto \frac{\color{blue}{x - y}}{2 - \left(x + y\right)} \]

   3. div-sub N/A

      \[\leadsto \color{blue}{\frac{x}{2 - \left(x + y\right)} - \frac{y}{2 - \left(x + y\right)}} \]

   4. lower--.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{2 - \left(x + y\right)} - \frac{y}{2 - \left(x + y\right)}} \]

   5. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{2 - \left(x + y\right)}} - \frac{y}{2 - \left(x + y\right)} \]

   6. lift-+.f64 N/A

      \[\leadsto \frac{x}{2 - \color{blue}{\left(x + y\right)}} - \frac{y}{2 - \left(x + y\right)} \]

   7. +-commutative N/A

      \[\leadsto \frac{x}{2 - \color{blue}{\left(y + x\right)}} - \frac{y}{2 - \left(x + y\right)} \]

   8. lower-+.f64 N/A

      \[\leadsto \frac{x}{2 - \color{blue}{\left(y + x\right)}} - \frac{y}{2 - \left(x + y\right)} \]

   9. lower-/.f64 100.0

      \[\leadsto \frac{x}{2 - \left(y + x\right)} - \color{blue}{\frac{y}{2 - \left(x + y\right)}} \]

   10. lift-+.f64 N/A

       \[\leadsto \frac{x}{2 - \left(y + x\right)} - \frac{y}{2 - \color{blue}{\left(x + y\right)}} \]

   11. +-commutative N/A

       \[\leadsto \frac{x}{2 - \left(y + x\right)} - \frac{y}{2 - \color{blue}{\left(y + x\right)}} \]

   12. lower-+.f64 100.0

       \[\leadsto \frac{x}{2 - \left(y + x\right)} - \frac{y}{2 - \color{blue}{\left(y + x\right)}} \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\frac{x}{2 - \left(y + x\right)} - \frac{y}{2 - \left(y + x\right)}} \]
5. Add Preprocessing

Alternative 2: 86.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x - y}{2 - \left(x + y\right)}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-48}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;\mathsf{fma}\left(-0.25, y, -0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 2.0 (+ x y)))))
   (if (<= t_0 -2e-48)
     (/ x (- 2.0 x))
     (if (<= t_0 2e-7) (* (fma -0.25 y -0.5) y) 1.0))))

C

double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -2e-48) {
		tmp = x / (2.0 - x);
	} else if (t_0 <= 2e-7) {
		tmp = fma(-0.25, y, -0.5) * y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
	tmp = 0.0
	if (t_0 <= -2e-48)
		tmp = Float64(x / Float64(2.0 - x));
	elseif (t_0 <= 2e-7)
		tmp = Float64(fma(-0.25, y, -0.5) * y);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-48], N[(x / N[(2.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e-7], N[(N[(-0.25 * y + -0.5), $MachinePrecision] * y), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -1.9999999999999999e-48

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{2 - x}} \]

      2. lower--.f64 94.9

         \[\leadsto \frac{x}{2 - \color{blue}{x}} \]

   5. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\frac{x}{2 - x}} \]

   if -1.9999999999999999e-48 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 1.9999999999999999e-7

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{y}{2 - y}\right) \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      4. *-lft-identity N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - 1 \cdot y\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - \left(\mathsf{neg}\left(-1\right)\right) \cdot y\right)\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 + -1 \cdot y\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(-1 \cdot y + 2\right)\right)} \]

      8. distribute-neg-in N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(-1 \cdot y\right)\right) + \color{blue}{\left(\mathsf{neg}\left(2\right)\right)}} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right) + \left(\mathsf{neg}\left(2\right)\right)} \]

      10. remove-double-neg N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(\color{blue}{2}\right)\right)} \]

      11. *-rgt-identity N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(2\right)\right) \cdot \color{blue}{1}} \]

      12. fp-cancel-sub-sign-inv N/A

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

      13. metadata-eval N/A

          \[\leadsto \frac{y}{y - 2} \]

      14. lower--.f64 58.0

          \[\leadsto \frac{y}{y - \color{blue}{2}} \]

   5. Applied rewrites 58.0%

      \[\leadsto \color{blue}{\frac{y}{y - 2}} \]

   6. Taylor expanded in y around 0

      \[\leadsto y \cdot \color{blue}{\left(\frac{-1}{4} \cdot y - \frac{1}{2}\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2}\right) \cdot y \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2}\right) \cdot y \]

      3. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2} \cdot 1\right) \cdot y \]

      4. fp-cancel-sub-sign-inv N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot 1\right) \cdot y \]

      5. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \frac{-1}{2} \cdot 1\right) \cdot y \]

      6. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \frac{-1}{2}\right) \cdot y \]

      7. lower-fma.f64 57.8

         \[\leadsto \mathsf{fma}\left(-0.25, y, -0.5\right) \cdot y \]

   8. Applied rewrites 57.8%

      \[\leadsto \mathsf{fma}\left(-0.25, y, -0.5\right) \cdot \color{blue}{y} \]

   if 1.9999999999999999e-7 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 98.2%

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

Alternative 3: 85.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x - y}{2 - \left(x + y\right)}\\ \mathbf{if}\;t\_0 \leq -0.0002:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;\mathsf{fma}\left(-0.25, y, -0.5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 2.0 (+ x y)))))
   (if (<= t_0 -0.0002) -1.0 (if (<= t_0 2e-7) (* (fma -0.25 y -0.5) y) 1.0))))

C

double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -0.0002) {
		tmp = -1.0;
	} else if (t_0 <= 2e-7) {
		tmp = fma(-0.25, y, -0.5) * y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
	tmp = 0.0
	if (t_0 <= -0.0002)
		tmp = -1.0;
	elseif (t_0 <= 2e-7)
		tmp = Float64(fma(-0.25, y, -0.5) * y);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.0002], -1.0, If[LessEqual[t$95$0, 2e-7], N[(N[(-0.25 * y + -0.5), $MachinePrecision] * y), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -2.0000000000000001e-4

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.0%

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

   if -2.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 1.9999999999999999e-7

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{y}{2 - y}\right) \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      4. *-lft-identity N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - 1 \cdot y\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - \left(\mathsf{neg}\left(-1\right)\right) \cdot y\right)\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 + -1 \cdot y\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(-1 \cdot y + 2\right)\right)} \]

      8. distribute-neg-in N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(-1 \cdot y\right)\right) + \color{blue}{\left(\mathsf{neg}\left(2\right)\right)}} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right) + \left(\mathsf{neg}\left(2\right)\right)} \]

      10. remove-double-neg N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(\color{blue}{2}\right)\right)} \]

      11. *-rgt-identity N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(2\right)\right) \cdot \color{blue}{1}} \]

      12. fp-cancel-sub-sign-inv N/A

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

      13. metadata-eval N/A

          \[\leadsto \frac{y}{y - 2} \]

      14. lower--.f64 56.1

          \[\leadsto \frac{y}{y - \color{blue}{2}} \]

   5. Applied rewrites 56.1%

      \[\leadsto \color{blue}{\frac{y}{y - 2}} \]

   6. Taylor expanded in y around 0

      \[\leadsto y \cdot \color{blue}{\left(\frac{-1}{4} \cdot y - \frac{1}{2}\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2}\right) \cdot y \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2}\right) \cdot y \]

      3. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y - \frac{1}{2} \cdot 1\right) \cdot y \]

      4. fp-cancel-sub-sign-inv N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot 1\right) \cdot y \]

      5. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \frac{-1}{2} \cdot 1\right) \cdot y \]

      6. metadata-eval N/A

         \[\leadsto \left(\frac{-1}{4} \cdot y + \frac{-1}{2}\right) \cdot y \]

      7. lower-fma.f64 55.9

         \[\leadsto \mathsf{fma}\left(-0.25, y, -0.5\right) \cdot y \]

   8. Applied rewrites 55.9%

      \[\leadsto \mathsf{fma}\left(-0.25, y, -0.5\right) \cdot \color{blue}{y} \]

   if 1.9999999999999999e-7 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 98.2%

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

Alternative 4: 85.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x - y}{2 - \left(x + y\right)}\\ \mathbf{if}\;t\_0 \leq -0.0002:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;-0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 2.0 (+ x y)))))
   (if (<= t_0 -0.0002) -1.0 (if (<= t_0 2e-7) (* -0.5 y) 1.0))))

C

double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -0.0002) {
		tmp = -1.0;
	} else if (t_0 <= 2e-7) {
		tmp = -0.5 * y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x - y) / (2.0d0 - (x + y))
    if (t_0 <= (-0.0002d0)) then
        tmp = -1.0d0
    else if (t_0 <= 2d-7) then
        tmp = (-0.5d0) * y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -0.0002) {
		tmp = -1.0;
	} else if (t_0 <= 2e-7) {
		tmp = -0.5 * y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x - y) / (2.0 - (x + y))
	tmp = 0
	if t_0 <= -0.0002:
		tmp = -1.0
	elif t_0 <= 2e-7:
		tmp = -0.5 * y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
	tmp = 0.0
	if (t_0 <= -0.0002)
		tmp = -1.0;
	elseif (t_0 <= 2e-7)
		tmp = Float64(-0.5 * y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x - y) / (2.0 - (x + y));
	tmp = 0.0;
	if (t_0 <= -0.0002)
		tmp = -1.0;
	elseif (t_0 <= 2e-7)
		tmp = -0.5 * y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.0002], -1.0, If[LessEqual[t$95$0, 2e-7], N[(-0.5 * y), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -2.0000000000000001e-4

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.0%

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

   if -2.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 1.9999999999999999e-7

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{y}{2 - y}\right) \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      4. *-lft-identity N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - 1 \cdot y\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - \left(\mathsf{neg}\left(-1\right)\right) \cdot y\right)\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 + -1 \cdot y\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(-1 \cdot y + 2\right)\right)} \]

      8. distribute-neg-in N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(-1 \cdot y\right)\right) + \color{blue}{\left(\mathsf{neg}\left(2\right)\right)}} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right) + \left(\mathsf{neg}\left(2\right)\right)} \]

      10. remove-double-neg N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(\color{blue}{2}\right)\right)} \]

      11. *-rgt-identity N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(2\right)\right) \cdot \color{blue}{1}} \]

      12. fp-cancel-sub-sign-inv N/A

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

      13. metadata-eval N/A

          \[\leadsto \frac{y}{y - 2} \]

      14. lower--.f64 56.1

          \[\leadsto \frac{y}{y - \color{blue}{2}} \]

   5. Applied rewrites 56.1%

      \[\leadsto \color{blue}{\frac{y}{y - 2}} \]

   6. Taylor expanded in y around 0

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

      1. lower-*.f64 54.7

         \[\leadsto -0.5 \cdot y \]

   8. Applied rewrites 54.7%

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

   if 1.9999999999999999e-7 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 98.2%

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

Alternative 5: 85.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x - y}{2 - \left(x + y\right)}\\ \mathbf{if}\;t\_0 \leq -0.2:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 10^{-7}:\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (- x y) (- 2.0 (+ x y)))))
   (if (<= t_0 -0.2) -1.0 (if (<= t_0 1e-7) (* 0.5 x) 1.0))))

C

double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -0.2) {
		tmp = -1.0;
	} else if (t_0 <= 1e-7) {
		tmp = 0.5 * x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x - y) / (2.0d0 - (x + y))
    if (t_0 <= (-0.2d0)) then
        tmp = -1.0d0
    else if (t_0 <= 1d-7) then
        tmp = 0.5d0 * x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (x - y) / (2.0 - (x + y));
	double tmp;
	if (t_0 <= -0.2) {
		tmp = -1.0;
	} else if (t_0 <= 1e-7) {
		tmp = 0.5 * x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x - y) / (2.0 - (x + y))
	tmp = 0
	if t_0 <= -0.2:
		tmp = -1.0
	elif t_0 <= 1e-7:
		tmp = 0.5 * x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
	tmp = 0.0
	if (t_0 <= -0.2)
		tmp = -1.0;
	elseif (t_0 <= 1e-7)
		tmp = Float64(0.5 * x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x - y) / (2.0 - (x + y));
	tmp = 0.0;
	if (t_0 <= -0.2)
		tmp = -1.0;
	elseif (t_0 <= 1e-7)
		tmp = 0.5 * x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.2], -1.0, If[LessEqual[t$95$0, 1e-7], N[(0.5 * x), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -0.20000000000000001

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 97.7%

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

   if -0.20000000000000001 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 9.9999999999999995e-8

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{2 - x}} \]

      2. lower--.f64 49.7

         \[\leadsto \frac{x}{2 - \color{blue}{x}} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{\frac{x}{2 - x}} \]

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 46.6

         \[\leadsto 0.5 \cdot x \]

   8. Applied rewrites 46.6%

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

   if 9.9999999999999995e-8 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 97.4%

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

Alternative 6: 98.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 - \left(x + y\right)\\ \mathbf{if}\;\frac{x - y}{t\_0} \leq -0.0002:\\ \;\;\;\;\frac{x}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{2 - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 2.0 (+ x y))))
   (if (<= (/ (- x y) t_0) -0.0002) (/ x t_0) (/ (- x y) (- 2.0 y)))))

C

double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	double tmp;
	if (((x - y) / t_0) <= -0.0002) {
		tmp = x / t_0;
	} else {
		tmp = (x - y) / (2.0 - y);
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 - (x + y)
    if (((x - y) / t_0) <= (-0.0002d0)) then
        tmp = x / t_0
    else
        tmp = (x - y) / (2.0d0 - y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	double tmp;
	if (((x - y) / t_0) <= -0.0002) {
		tmp = x / t_0;
	} else {
		tmp = (x - y) / (2.0 - y);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 2.0 - (x + y)
	tmp = 0
	if ((x - y) / t_0) <= -0.0002:
		tmp = x / t_0
	else:
		tmp = (x - y) / (2.0 - y)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(2.0 - Float64(x + y))
	tmp = 0.0
	if (Float64(Float64(x - y) / t_0) <= -0.0002)
		tmp = Float64(x / t_0);
	else
		tmp = Float64(Float64(x - y) / Float64(2.0 - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 2.0 - (x + y);
	tmp = 0.0;
	if (((x - y) / t_0) <= -0.0002)
		tmp = x / t_0;
	else
		tmp = (x - y) / (2.0 - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(x - y), $MachinePrecision] / t$95$0), $MachinePrecision], -0.0002], N[(x / t$95$0), $MachinePrecision], N[(N[(x - y), $MachinePrecision] / N[(2.0 - y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -2.0000000000000001e-4

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x}}{2 - \left(x + y\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.5%

      \[\leadsto \frac{\color{blue}{x}}{2 - \left(x + y\right)} \]

   if -2.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \frac{x - y}{2 - \color{blue}{y}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.0%

      \[\leadsto \frac{x - y}{2 - \color{blue}{y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 86.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 - \left(x + y\right)\\ \mathbf{if}\;\frac{x - y}{t\_0} \leq -2 \cdot 10^{-48}:\\ \;\;\;\;\frac{x}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{y - 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 2.0 (+ x y))))
   (if (<= (/ (- x y) t_0) -2e-48) (/ x t_0) (/ y (- y 2.0)))))

C

double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	double tmp;
	if (((x - y) / t_0) <= -2e-48) {
		tmp = x / t_0;
	} else {
		tmp = y / (y - 2.0);
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 - (x + y)
    if (((x - y) / t_0) <= (-2d-48)) then
        tmp = x / t_0
    else
        tmp = y / (y - 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	double tmp;
	if (((x - y) / t_0) <= -2e-48) {
		tmp = x / t_0;
	} else {
		tmp = y / (y - 2.0);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 2.0 - (x + y)
	tmp = 0
	if ((x - y) / t_0) <= -2e-48:
		tmp = x / t_0
	else:
		tmp = y / (y - 2.0)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(2.0 - Float64(x + y))
	tmp = 0.0
	if (Float64(Float64(x - y) / t_0) <= -2e-48)
		tmp = Float64(x / t_0);
	else
		tmp = Float64(y / Float64(y - 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 2.0 - (x + y);
	tmp = 0.0;
	if (((x - y) / t_0) <= -2e-48)
		tmp = x / t_0;
	else
		tmp = y / (y - 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(x - y), $MachinePrecision] / t$95$0), $MachinePrecision], -2e-48], N[(x / t$95$0), $MachinePrecision], N[(y / N[(y - 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -1.9999999999999999e-48

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x}}{2 - \left(x + y\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.0%

      \[\leadsto \frac{\color{blue}{x}}{2 - \left(x + y\right)} \]

   if -1.9999999999999999e-48 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{y}{2 - y}\right) \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      4. *-lft-identity N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - 1 \cdot y\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - \left(\mathsf{neg}\left(-1\right)\right) \cdot y\right)\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 + -1 \cdot y\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(-1 \cdot y + 2\right)\right)} \]

      8. distribute-neg-in N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(-1 \cdot y\right)\right) + \color{blue}{\left(\mathsf{neg}\left(2\right)\right)}} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right) + \left(\mathsf{neg}\left(2\right)\right)} \]

      10. remove-double-neg N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(\color{blue}{2}\right)\right)} \]

      11. *-rgt-identity N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(2\right)\right) \cdot \color{blue}{1}} \]

      12. fp-cancel-sub-sign-inv N/A

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

      13. metadata-eval N/A

          \[\leadsto \frac{y}{y - 2} \]

      14. lower--.f64 85.6

          \[\leadsto \frac{y}{y - \color{blue}{2}} \]

   5. Applied rewrites 85.6%

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

Alternative 8: 86.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x - y}{2 - \left(x + y\right)} \leq -2 \cdot 10^{-48}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{y - 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (- x y) (- 2.0 (+ x y))) -2e-48) (/ x (- 2.0 x)) (/ y (- y 2.0))))

C

double code(double x, double y) {
	double tmp;
	if (((x - y) / (2.0 - (x + y))) <= -2e-48) {
		tmp = x / (2.0 - x);
	} else {
		tmp = y / (y - 2.0);
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x - y) / (2.0d0 - (x + y))) <= (-2d-48)) then
        tmp = x / (2.0d0 - x)
    else
        tmp = y / (y - 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (((x - y) / (2.0 - (x + y))) <= -2e-48) {
		tmp = x / (2.0 - x);
	} else {
		tmp = y / (y - 2.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((x - y) / (2.0 - (x + y))) <= -2e-48:
		tmp = x / (2.0 - x)
	else:
		tmp = y / (y - 2.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x - y) / Float64(2.0 - Float64(x + y))) <= -2e-48)
		tmp = Float64(x / Float64(2.0 - x));
	else
		tmp = Float64(y / Float64(y - 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x - y) / (2.0 - (x + y))) <= -2e-48)
		tmp = x / (2.0 - x);
	else
		tmp = y / (y - 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-48], N[(x / N[(2.0 - x), $MachinePrecision]), $MachinePrecision], N[(y / N[(y - 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -1.9999999999999999e-48

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{2 - x}} \]

      2. lower--.f64 94.9

         \[\leadsto \frac{x}{2 - \color{blue}{x}} \]

   5. Applied rewrites 94.9%

      \[\leadsto \color{blue}{\frac{x}{2 - x}} \]

   if -1.9999999999999999e-48 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{y}{2 - y}\right) \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{y}{\color{blue}{\mathsf{neg}\left(\left(2 - y\right)\right)}} \]

      4. *-lft-identity N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - 1 \cdot y\right)\right)} \]

      5. metadata-eval N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 - \left(\mathsf{neg}\left(-1\right)\right) \cdot y\right)\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(2 + -1 \cdot y\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \frac{y}{\mathsf{neg}\left(\left(-1 \cdot y + 2\right)\right)} \]

      8. distribute-neg-in N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(-1 \cdot y\right)\right) + \color{blue}{\left(\mathsf{neg}\left(2\right)\right)}} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{y}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right) + \left(\mathsf{neg}\left(2\right)\right)} \]

      10. remove-double-neg N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(\color{blue}{2}\right)\right)} \]

      11. *-rgt-identity N/A

          \[\leadsto \frac{y}{y + \left(\mathsf{neg}\left(2\right)\right) \cdot \color{blue}{1}} \]

      12. fp-cancel-sub-sign-inv N/A

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

      13. metadata-eval N/A

          \[\leadsto \frac{y}{y - 2} \]

      14. lower--.f64 85.6

          \[\leadsto \frac{y}{y - \color{blue}{2}} \]

   5. Applied rewrites 85.6%

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

Alternative 9: 74.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x - y}{2 - \left(x + y\right)} \leq -5 \cdot 10^{-310}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (- x y) (- 2.0 (+ x y))) -5e-310) -1.0 1.0))

C

double code(double x, double y) {
	double tmp;
	if (((x - y) / (2.0 - (x + y))) <= -5e-310) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x - y) / (2.0d0 - (x + y))) <= (-5d-310)) then
        tmp = -1.0d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (((x - y) / (2.0 - (x + y))) <= -5e-310) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((x - y) / (2.0 - (x + y))) <= -5e-310:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x - y) / Float64(2.0 - Float64(x + y))) <= -5e-310)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x - y) / (2.0 - (x + y))) <= -5e-310)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-310], -1.0, 1.0]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < -4.999999999999985e-310

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 79.3%

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

   if -4.999999999999985e-310 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y)))

   1. Initial program 100.0%

      \[\frac{x - y}{2 - \left(x + y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 74.2%

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

Alternative 10: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{2 - \left(x + y\right)} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 2.0 (+ x y))))

C

double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (2.0d0 - (x + y))
end function

Java

public static double code(double x, double y) {
	return (x - y) / (2.0 - (x + y));
}

Python

def code(x, y):
	return (x - y) / (2.0 - (x + y))

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(2.0 - Float64(x + y)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x - y) / (2.0 - (x + y));
end

Wolfram

code[x_, y_] := N[(N[(x - y), $MachinePrecision] / N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{2 - \left(x + y\right)} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 11: 37.7% accurate, 21.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 -1.0)

C

double code(double x, double y) {
	return -1.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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = -1.0d0
end function

Java

public static double code(double x, double y) {
	return -1.0;
}

Python

def code(x, y):
	return -1.0

Julia

function code(x, y)
	return -1.0
end

MATLAB

function tmp = code(x, y)
	tmp = -1.0;
end

Wolfram

code[x_, y_] := -1.0

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{2 - \left(x + y\right)} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

5. Applied rewrites 37.5%

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

Developer Target 1: 100.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 - \left(x + y\right)\\ \frac{x}{t\_0} - \frac{y}{t\_0} \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 2.0 (+ x y)))) (- (/ x t_0) (/ y t_0))))

C

double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	return (x / t_0) - (y / t_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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    t_0 = 2.0d0 - (x + y)
    code = (x / t_0) - (y / t_0)
end function

Java

public static double code(double x, double y) {
	double t_0 = 2.0 - (x + y);
	return (x / t_0) - (y / t_0);
}

Python

def code(x, y):
	t_0 = 2.0 - (x + y)
	return (x / t_0) - (y / t_0)

Julia

function code(x, y)
	t_0 = Float64(2.0 - Float64(x + y))
	return Float64(Float64(x / t_0) - Float64(y / t_0))
end

MATLAB

function tmp = code(x, y)
	t_0 = 2.0 - (x + y);
	tmp = (x / t_0) - (y / t_0);
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(2.0 - N[(x + y), $MachinePrecision]), $MachinePrecision]}, N[(N[(x / t$95$0), $MachinePrecision] - N[(y / t$95$0), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2025026 
(FPCore (x y)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, C"
  :precision binary64

  :alt
  (! :herbie-platform default (- (/ x (- 2 (+ x y))) (/ y (- 2 (+ x y)))))

  (/ (- x y) (- 2.0 (+ x y))))