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

Percentage Accurate: 100.0% → 100.0%

Time: 8.7s

Alternatives: 8

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

real(8) function code(x, y)
    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

real(8) function code(x, y)
    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, 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

real(8) function code(x, y)
    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 2: 98.2% 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 -1 \cdot 10^{-7}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-6}:\\ \;\;\;\;\left(y - x\right) \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{y + -2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    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 <= (-1d-7)) then
        tmp = x / (2.0d0 - x)
    else if (t_0 <= 2d-6) then
        tmp = (y - x) * (-0.5d0)
    else
        tmp = y / (y + (-2.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 <= -1e-7) {
		tmp = x / (2.0 - x);
	} else if (t_0 <= 2e-6) {
		tmp = (y - x) * -0.5;
	} else {
		tmp = y / (y + -2.0);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x - y) / (2.0 - (x + y))
	tmp = 0
	if t_0 <= -1e-7:
		tmp = x / (2.0 - x)
	elif t_0 <= 2e-6:
		tmp = (y - x) * -0.5
	else:
		tmp = y / (y + -2.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 <= -1e-7)
		tmp = Float64(x / Float64(2.0 - x));
	elseif (t_0 <= 2e-6)
		tmp = Float64(Float64(y - x) * -0.5);
	else
		tmp = Float64(y / Float64(y + -2.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 <= -1e-7)
		tmp = x / (2.0 - x);
	elseif (t_0 <= 2e-6)
		tmp = (y - x) * -0.5;
	else
		tmp = y / (y + -2.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, -1e-7], N[(x / N[(2.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e-6], N[(N[(y - x), $MachinePrecision] * -0.5), $MachinePrecision], N[(y / N[(y + -2.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.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 \color{blue}{\frac{x}{2 - x}} \]

      2. lower--.f64 97.5

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

   5. Simplified 97.5%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 99.0

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

   5. Simplified 99.0%

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

   6. Taylor expanded in y around 0

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

   8. Simplified 98.0%

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

      1. lift--.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. neg-sub0 N/A

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

      8. lift--.f64 N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. associate--r+ N/A

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

      12. neg-sub0 N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 98.0

          \[\leadsto \color{blue}{\left(y - x\right)} \cdot -0.5 \]

   10. Applied egg-rr 98.0%

       \[\leadsto \color{blue}{\left(y - x\right) \cdot -0.5} \]

   if 1.99999999999999991e-6 < (/.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 \color{blue}{\mathsf{neg}\left(\frac{y}{2 - y}\right)} \]

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. mul-1-neg N/A

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

      11. associate-*r* N/A

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

      12. metadata-eval N/A

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

      13. *-lft-identity N/A

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

      14. lower-+.f64 N/A

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

      15. metadata-eval 99.7

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

   5. Simplified 99.7%

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

Alternative 3: 97.6% 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 -1 \cdot 10^{-7}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-6}:\\ \;\;\;\;\left(y - x\right) \cdot -0.5\\ \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 -1e-7)
     (/ x (- 2.0 x))
     (if (<= t_0 2e-6) (* (- y x) -0.5) 1.0))))

C

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

Fortran

real(8) function code(x, y)
    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 <= (-1d-7)) then
        tmp = x / (2.0d0 - x)
    else if (t_0 <= 2d-6) then
        tmp = (y - x) * (-0.5d0)
    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 <= -1e-7) {
		tmp = x / (2.0 - x);
	} else if (t_0 <= 2e-6) {
		tmp = (y - x) * -0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x - y) / (2.0 - (x + y))
	tmp = 0
	if t_0 <= -1e-7:
		tmp = x / (2.0 - x)
	elif t_0 <= 2e-6:
		tmp = (y - x) * -0.5
	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 <= -1e-7)
		tmp = Float64(x / Float64(2.0 - x));
	elseif (t_0 <= 2e-6)
		tmp = Float64(Float64(y - x) * -0.5);
	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 <= -1e-7)
		tmp = x / (2.0 - x);
	elseif (t_0 <= 2e-6)
		tmp = (y - x) * -0.5;
	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, -1e-7], N[(x / N[(2.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e-6], N[(N[(y - x), $MachinePrecision] * -0.5), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.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 \color{blue}{\frac{x}{2 - x}} \]

      2. lower--.f64 97.5

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

   5. Simplified 97.5%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 99.0

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

   5. Simplified 99.0%

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

   6. Taylor expanded in y around 0

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

   8. Simplified 98.0%

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

      1. lift--.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. neg-sub0 N/A

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

      8. lift--.f64 N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. associate--r+ N/A

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

      12. neg-sub0 N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 98.0

          \[\leadsto \color{blue}{\left(y - x\right)} \cdot -0.5 \]

   10. Applied egg-rr 98.0%

       \[\leadsto \color{blue}{\left(y - x\right) \cdot -0.5} \]

   if 1.99999999999999991e-6 < (/.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. Simplified 96.2%

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

Alternative 4: 97.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 -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-6}:\\ \;\;\;\;\left(y - x\right) \cdot -0.5\\ \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.5) -1.0 (if (<= t_0 2e-6) (* (- y x) -0.5) 1.0))))

C

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

Fortran

real(8) function code(x, y)
    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.5d0)) then
        tmp = -1.0d0
    else if (t_0 <= 2d-6) then
        tmp = (y - x) * (-0.5d0)
    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.5) {
		tmp = -1.0;
	} else if (t_0 <= 2e-6) {
		tmp = (y - x) * -0.5;
	} 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.5:
		tmp = -1.0
	elif t_0 <= 2e-6:
		tmp = (y - x) * -0.5
	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.5)
		tmp = -1.0;
	elseif (t_0 <= 2e-6)
		tmp = Float64(Float64(y - x) * -0.5);
	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.5)
		tmp = -1.0;
	elseif (t_0 <= 2e-6)
		tmp = (y - x) * -0.5;
	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.5], -1.0, If[LessEqual[t$95$0, 2e-6], N[(N[(y - x), $MachinePrecision] * -0.5), $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.5

   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. Simplified 96.2%

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

   if -0.5 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 1.99999999999999991e-6

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 97.1

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

   5. Simplified 97.1%

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

   6. Taylor expanded in y around 0

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

   8. Simplified 95.4%

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

      1. lift--.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower-*.f64 N/A

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

      7. neg-sub0 N/A

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

      8. lift--.f64 N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. associate--r+ N/A

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

      12. neg-sub0 N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 95.4

          \[\leadsto \color{blue}{\left(y - x\right)} \cdot -0.5 \]

   10. Applied egg-rr 95.4%

       \[\leadsto \color{blue}{\left(y - x\right) \cdot -0.5} \]

   if 1.99999999999999991e-6 < (/.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. Simplified 96.2%

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

Alternative 5: 85.6% 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.05:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{-12}:\\ \;\;\;\;y \cdot -0.5\\ \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.05) -1.0 (if (<= t_0 5e-12) (* y -0.5) 1.0))))

C

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

Fortran

real(8) function code(x, y)
    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.05d0)) then
        tmp = -1.0d0
    else if (t_0 <= 5d-12) then
        tmp = y * (-0.5d0)
    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.05) {
		tmp = -1.0;
	} else if (t_0 <= 5e-12) {
		tmp = y * -0.5;
	} 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.05:
		tmp = -1.0
	elif t_0 <= 5e-12:
		tmp = y * -0.5
	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.05)
		tmp = -1.0;
	elseif (t_0 <= 5e-12)
		tmp = Float64(y * -0.5);
	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.05)
		tmp = -1.0;
	elseif (t_0 <= 5e-12)
		tmp = y * -0.5;
	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.05], -1.0, If[LessEqual[t$95$0, 5e-12], N[(y * -0.5), $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.050000000000000003

   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. Simplified 95.4%

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

   if -0.050000000000000003 < (/.f64 (-.f64 x y) (-.f64 #s(literal 2 binary64) (+.f64 x y))) < 4.9999999999999997e-12

   1. Initial program 99.9%

      \[\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 \color{blue}{\mathsf{neg}\left(\frac{y}{2 - y}\right)} \]

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. mul-1-neg N/A

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

      11. associate-*r* N/A

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

      12. metadata-eval N/A

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

      13. *-lft-identity N/A

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

      14. lower-+.f64 N/A

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

      15. metadata-eval 51.3

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

   5. Simplified 51.3%

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

   6. Taylor expanded in y around 0

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

      1. lower-*.f64 49.4

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

   8. Simplified 49.4%

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

   if 4.9999999999999997e-12 < (/.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. Simplified 95.4%

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

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - y}{2 - \left(x + y\right)} \leq -0.05:\\ \;\;\;\;-1\\ \mathbf{elif}\;\frac{x - y}{2 - \left(x + y\right)} \leq 5 \cdot 10^{-12}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (- x y) (- 2.0 (+ x y))) -0.05)
   (/ x (- 2.0 x))
   (/ (- x y) (- 2.0 y))))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x - y) / (2.0d0 - (x + y))) <= (-0.05d0)) then
        tmp = x / (2.0d0 - x)
    else
        tmp = (x - y) / (2.0d0 - y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x - y) / (2.0 - (x + y))) <= -0.05)
		tmp = x / (2.0 - x);
	else
		tmp = (x - y) / (2.0 - y);
	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], -0.05], N[(x / N[(2.0 - x), $MachinePrecision]), $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))) < -0.050000000000000003

   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 \color{blue}{\frac{x}{2 - x}} \]

      2. lower--.f64 98.4

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

   5. Simplified 98.4%

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

   if -0.050000000000000003 < (/.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}{\color{blue}{2 - y}} \]
   4. Step-by-step derivation

      1. lower--.f64 99.2

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

   5. Simplified 99.2%

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

Alternative 7: 74.8% 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

real(8) function code(x, y)
    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. Simplified 72.6%

      \[\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. Simplified 75.7%

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

Alternative 8: 38.0% 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

real(8) function code(x, y)
    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. Simplified 37.4%

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

real(8) function code(x, y)
    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 2024208 
(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))))