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

Percentage Accurate: 100.0% → 100.0%

Time: 4.5s

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, 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]]

Derivation

1. Initial program 100.0%

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

   1. associate--r+ 100.0%

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

3. Simplified 100.0%

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

   1. div-sub 100.0%

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

   2. associate--l- 100.0%

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

   3. associate--l- 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 61.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y}{x} + -1\\ \mathbf{if}\;x \leq -225000:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -5.1 \cdot 10^{-216}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.4 \cdot 10^{-283}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 5.8 \cdot 10^{+56}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (/ y x) -1.0)))
   (if (<= x -225000.0)
     t_0
     (if (<= x -5.1e-216)
       1.0
       (if (<= x 1.4e-283) (* y -0.5) (if (<= x 5.8e+56) 1.0 t_0))))))

C

double code(double x, double y) {
	double t_0 = (y / x) + -1.0;
	double tmp;
	if (x <= -225000.0) {
		tmp = t_0;
	} else if (x <= -5.1e-216) {
		tmp = 1.0;
	} else if (x <= 1.4e-283) {
		tmp = y * -0.5;
	} else if (x <= 5.8e+56) {
		tmp = 1.0;
	} else {
		tmp = t_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 = (y / x) + (-1.0d0)
    if (x <= (-225000.0d0)) then
        tmp = t_0
    else if (x <= (-5.1d-216)) then
        tmp = 1.0d0
    else if (x <= 1.4d-283) then
        tmp = y * (-0.5d0)
    else if (x <= 5.8d+56) then
        tmp = 1.0d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y / x) + -1.0;
	double tmp;
	if (x <= -225000.0) {
		tmp = t_0;
	} else if (x <= -5.1e-216) {
		tmp = 1.0;
	} else if (x <= 1.4e-283) {
		tmp = y * -0.5;
	} else if (x <= 5.8e+56) {
		tmp = 1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y / x) + -1.0
	tmp = 0
	if x <= -225000.0:
		tmp = t_0
	elif x <= -5.1e-216:
		tmp = 1.0
	elif x <= 1.4e-283:
		tmp = y * -0.5
	elif x <= 5.8e+56:
		tmp = 1.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y / x) + -1.0)
	tmp = 0.0
	if (x <= -225000.0)
		tmp = t_0;
	elseif (x <= -5.1e-216)
		tmp = 1.0;
	elseif (x <= 1.4e-283)
		tmp = Float64(y * -0.5);
	elseif (x <= 5.8e+56)
		tmp = 1.0;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y / x) + -1.0;
	tmp = 0.0;
	if (x <= -225000.0)
		tmp = t_0;
	elseif (x <= -5.1e-216)
		tmp = 1.0;
	elseif (x <= 1.4e-283)
		tmp = y * -0.5;
	elseif (x <= 5.8e+56)
		tmp = 1.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y / x), $MachinePrecision] + -1.0), $MachinePrecision]}, If[LessEqual[x, -225000.0], t$95$0, If[LessEqual[x, -5.1e-216], 1.0, If[LessEqual[x, 1.4e-283], N[(y * -0.5), $MachinePrecision], If[LessEqual[x, 5.8e+56], 1.0, t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -225000 or 5.80000000000000014e56 < x

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

      1. clear-num 100.0%

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

      2. associate-/r/ 99.8%

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

      3. associate--l- 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in x around inf 76.8%

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

   7. Taylor expanded in x around 0 77.0%

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

   if -225000 < x < -5.1000000000000003e-216 or 1.3999999999999999e-283 < x < 5.80000000000000014e56

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 56.4%

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

   if -5.1000000000000003e-216 < x < 1.3999999999999999e-283

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

   6. Simplified 100.0%

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

   7. Taylor expanded in y around 0 69.6%

      \[\leadsto \color{blue}{-0.5 \cdot y} \]
   8. Step-by-step derivation

      1. *-commutative 69.6%

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

   9. Simplified 69.6%

      \[\leadsto \color{blue}{y \cdot -0.5} \]
3. Recombined 3 regimes into one program.

4. Final simplification 65.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -225000:\\ \;\;\;\;\frac{y}{x} + -1\\ \mathbf{elif}\;x \leq -5.1 \cdot 10^{-216}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.4 \cdot 10^{-283}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 5.8 \cdot 10^{+56}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x} + -1\\ \end{array} \]

Alternative 3: 75.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6.7e+31) (not (<= y 3.1e+48)))
   (+ 1.0 (/ (* x -2.0) y))
   (/ x (- 2.0 x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6.7e+31) || !(y <= 3.1e+48)) {
		tmp = 1.0 + ((x * -2.0) / y);
	} else {
		tmp = x / (2.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-6.7d+31)) .or. (.not. (y <= 3.1d+48))) then
        tmp = 1.0d0 + ((x * (-2.0d0)) / y)
    else
        tmp = x / (2.0d0 - x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6.7e+31) || !(y <= 3.1e+48)) {
		tmp = 1.0 + ((x * -2.0) / y);
	} else {
		tmp = x / (2.0 - x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6.7e+31) or not (y <= 3.1e+48):
		tmp = 1.0 + ((x * -2.0) / y)
	else:
		tmp = x / (2.0 - x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6.7e+31) || !(y <= 3.1e+48))
		tmp = Float64(1.0 + Float64(Float64(x * -2.0) / y));
	else
		tmp = Float64(x / Float64(2.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6.7e+31) || ~((y <= 3.1e+48)))
		tmp = 1.0 + ((x * -2.0) / y);
	else
		tmp = x / (2.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6.7e+31], N[Not[LessEqual[y, 3.1e+48]], $MachinePrecision]], N[(1.0 + N[(N[(x * -2.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x / N[(2.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.70000000000000016e31 or 3.10000000000000005e48 < y

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 82.5%

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

      1. associate--l+ 82.5%

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

      2. associate-*r/ 82.5%

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

      3. associate-*r/ 82.5%

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

      4. div-sub 82.5%

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

      5. cancel-sign-sub-inv 82.5%

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

      6. metadata-eval 82.5%

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

      7. *-lft-identity 82.5%

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

      8. +-commutative 82.5%

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

      9. mul-1-neg 82.5%

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

      10. unsub-neg 82.5%

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

   6. Simplified 82.5%

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

   7. Taylor expanded in x around inf 82.5%

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

      1. *-commutative 82.5%

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

   9. Simplified 82.5%

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

   if -6.70000000000000016e31 < y < 3.10000000000000005e48

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 71.9%

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

4. Final simplification 76.9%

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

Alternative 4: 61.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -300000:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq -2.35 \cdot 10^{-216}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{-283}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 2.7 \cdot 10^{+57}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -300000.0)
   -1.0
   (if (<= x -2.35e-216)
     1.0
     (if (<= x 1.55e-283) (* y -0.5) (if (<= x 2.7e+57) 1.0 -1.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -300000.0) {
		tmp = -1.0;
	} else if (x <= -2.35e-216) {
		tmp = 1.0;
	} else if (x <= 1.55e-283) {
		tmp = y * -0.5;
	} else if (x <= 2.7e+57) {
		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 <= (-300000.0d0)) then
        tmp = -1.0d0
    else if (x <= (-2.35d-216)) then
        tmp = 1.0d0
    else if (x <= 1.55d-283) then
        tmp = y * (-0.5d0)
    else if (x <= 2.7d+57) 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 <= -300000.0) {
		tmp = -1.0;
	} else if (x <= -2.35e-216) {
		tmp = 1.0;
	} else if (x <= 1.55e-283) {
		tmp = y * -0.5;
	} else if (x <= 2.7e+57) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -300000.0:
		tmp = -1.0
	elif x <= -2.35e-216:
		tmp = 1.0
	elif x <= 1.55e-283:
		tmp = y * -0.5
	elif x <= 2.7e+57:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -300000.0)
		tmp = -1.0;
	elseif (x <= -2.35e-216)
		tmp = 1.0;
	elseif (x <= 1.55e-283)
		tmp = Float64(y * -0.5);
	elseif (x <= 2.7e+57)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -300000.0)
		tmp = -1.0;
	elseif (x <= -2.35e-216)
		tmp = 1.0;
	elseif (x <= 1.55e-283)
		tmp = y * -0.5;
	elseif (x <= 2.7e+57)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -300000.0], -1.0, If[LessEqual[x, -2.35e-216], 1.0, If[LessEqual[x, 1.55e-283], N[(y * -0.5), $MachinePrecision], If[LessEqual[x, 2.7e+57], 1.0, -1.0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3e5 or 2.6999999999999998e57 < x

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 76.5%

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

   if -3e5 < x < -2.35e-216 or 1.55000000000000002e-283 < x < 2.6999999999999998e57

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 56.4%

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

   if -2.35e-216 < x < 1.55000000000000002e-283

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

   6. Simplified 100.0%

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

   7. Taylor expanded in y around 0 69.6%

      \[\leadsto \color{blue}{-0.5 \cdot y} \]
   8. Step-by-step derivation

      1. *-commutative 69.6%

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

   9. Simplified 69.6%

      \[\leadsto \color{blue}{y \cdot -0.5} \]
3. Recombined 3 regimes into one program.

4. Final simplification 65.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -300000:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq -2.35 \cdot 10^{-216}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{-283}:\\ \;\;\;\;y \cdot -0.5\\ \mathbf{elif}\;x \leq 2.7 \cdot 10^{+57}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 5: 75.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.9 \cdot 10^{+30}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+48}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -5.9e+30) 1.0 (if (<= y 2.9e+48) (/ x (- 2.0 x)) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.9e+30) {
		tmp = 1.0;
	} else if (y <= 2.9e+48) {
		tmp = x / (2.0 - x);
	} 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 (y <= (-5.9d+30)) then
        tmp = 1.0d0
    else if (y <= 2.9d+48) then
        tmp = x / (2.0d0 - x)
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= -5.9e+30:
		tmp = 1.0
	elif y <= 2.9e+48:
		tmp = x / (2.0 - x)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -5.9e+30)
		tmp = 1.0;
	elseif (y <= 2.9e+48)
		tmp = Float64(x / Float64(2.0 - x));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -5.9e+30)
		tmp = 1.0;
	elseif (y <= 2.9e+48)
		tmp = x / (2.0 - x);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -5.90000000000000015e30 or 2.8999999999999999e48 < y

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 81.6%

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

   if -5.90000000000000015e30 < y < 2.8999999999999999e48

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 71.9%

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

4. Final simplification 76.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.9 \cdot 10^{+30}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{+48}:\\ \;\;\;\;\frac{x}{2 - x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 6: 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. Final simplification 100.0%

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

Alternative 7: 62.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -16000:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+57}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -16000.0) -1.0 (if (<= x 2e+57) 1.0 -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -16000.0) {
		tmp = -1.0;
	} else if (x <= 2e+57) {
		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 <= (-16000.0d0)) then
        tmp = -1.0d0
    else if (x <= 2d+57) 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 <= -16000.0) {
		tmp = -1.0;
	} else if (x <= 2e+57) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -16000.0:
		tmp = -1.0
	elif x <= 2e+57:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -16000.0)
		tmp = -1.0;
	elseif (x <= 2e+57)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -16000.0)
		tmp = -1.0;
	elseif (x <= 2e+57)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -16000.0], -1.0, If[LessEqual[x, 2e+57], 1.0, -1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -16000 or 2.0000000000000001e57 < x

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 76.5%

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

   if -16000 < x < 2.0000000000000001e57

   1. Initial program 100.0%

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

      1. associate--r+ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 53.1%

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

4. Final simplification 62.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -16000:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+57}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 8: 37.8% accurate, 9.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. Step-by-step derivation

   1. associate--r+ 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around inf 34.2%

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

5. Final simplification 34.2%

   \[\leadsto -1 \]

Developer target: 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 2023240 
(FPCore (x y)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, C"
  :precision binary64

  :herbie-target
  (- (/ x (- 2.0 (+ x y))) (/ y (- 2.0 (+ x y))))

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