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

Percentage Accurate: 100.0% → 100.0%

Time: 5.7s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x - y}{x + y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (x + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{x + y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (x + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} - \frac{1}{\frac{x + y}{y}} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x / (x + y)) - (1.0d0 / ((x + y) / y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. div-sub 100.0%

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

3. Applied egg-rr 100.0%

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

   1. clear-num 100.0%

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

   2. inv-pow 100.0%

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

5. Applied egg-rr 100.0%

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

   1. unpow-1 100.0%

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

7. Simplified 100.0%

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

8. Final simplification 100.0%

   \[\leadsto \frac{x}{x + y} - \frac{1}{\frac{x + y}{y}} \]

Alternative 2: 75.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{-34} \lor \neg \left(y \leq 9.5 \cdot 10^{-36}\right):\\ \;\;\;\;2 \cdot \frac{x}{y} + -1\\ \mathbf{else}:\\ \;\;\;\;1 + -2 \cdot \frac{y}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.2e-34) (not (<= y 9.5e-36)))
   (+ (* 2.0 (/ x y)) -1.0)
   (+ 1.0 (* -2.0 (/ y x)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.2e-34) || !(y <= 9.5e-36)) {
		tmp = (2.0 * (x / y)) + -1.0;
	} else {
		tmp = 1.0 + (-2.0 * (y / 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 <= (-2.2d-34)) .or. (.not. (y <= 9.5d-36))) then
        tmp = (2.0d0 * (x / y)) + (-1.0d0)
    else
        tmp = 1.0d0 + ((-2.0d0) * (y / x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -2.2e-34) || !(y <= 9.5e-36)) {
		tmp = (2.0 * (x / y)) + -1.0;
	} else {
		tmp = 1.0 + (-2.0 * (y / x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.2e-34) or not (y <= 9.5e-36):
		tmp = (2.0 * (x / y)) + -1.0
	else:
		tmp = 1.0 + (-2.0 * (y / x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.2e-34) || !(y <= 9.5e-36))
		tmp = Float64(Float64(2.0 * Float64(x / y)) + -1.0);
	else
		tmp = Float64(1.0 + Float64(-2.0 * Float64(y / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.2e-34) || ~((y <= 9.5e-36)))
		tmp = (2.0 * (x / y)) + -1.0;
	else
		tmp = 1.0 + (-2.0 * (y / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.2e-34], N[Not[LessEqual[y, 9.5e-36]], $MachinePrecision]], N[(N[(2.0 * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(1.0 + N[(-2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1999999999999999e-34 or 9.5000000000000003e-36 < y

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in x around 0 77.8%

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

   if -2.1999999999999999e-34 < y < 9.5000000000000003e-36

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in y around 0 80.7%

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

4. Final simplification 79.0%

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

Alternative 3: 75.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.75:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{-35}:\\ \;\;\;\;1 + -2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -0.75) -1.0 (if (<= y 1.3e-35) (+ 1.0 (* -2.0 (/ y x))) -1.0)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= -0.75:
		tmp = -1.0
	elif y <= 1.3e-35:
		tmp = 1.0 + (-2.0 * (y / x))
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -0.75)
		tmp = -1.0;
	elseif (y <= 1.3e-35)
		tmp = Float64(1.0 + Float64(-2.0 * Float64(y / x)));
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -0.75)
		tmp = -1.0;
	elseif (y <= 1.3e-35)
		tmp = 1.0 + (-2.0 * (y / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -0.75], -1.0, If[LessEqual[y, 1.3e-35], N[(1.0 + N[(-2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -0.75 or 1.30000000000000002e-35 < y

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in x around 0 78.5%

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

   if -0.75 < y < 1.30000000000000002e-35

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in y around 0 78.7%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.75:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{-35}:\\ \;\;\;\;1 + -2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 4: 100.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} - \frac{y}{x + y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x / (x + y)) - (y / (x + y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. div-sub 100.0%

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

3. Applied egg-rr 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \frac{x}{x + y} - \frac{y}{x + y} \]

Alternative 5: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{x + y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x - y) / (x + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\frac{x - y}{x + y} \]

2. Final simplification 99.9%

   \[\leadsto \frac{x - y}{x + y} \]

Alternative 6: 74.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{-35}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{-36}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -3.4e-35) -1.0 (if (<= y 2.1e-36) 1.0 -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -3.4e-35) {
		tmp = -1.0;
	} else if (y <= 2.1e-36) {
		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 (y <= (-3.4d-35)) then
        tmp = -1.0d0
    else if (y <= 2.1d-36) 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 (y <= -3.4e-35) {
		tmp = -1.0;
	} else if (y <= 2.1e-36) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -3.4e-35:
		tmp = -1.0
	elif y <= 2.1e-36:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -3.4e-35)
		tmp = -1.0;
	elseif (y <= 2.1e-36)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -3.4e-35)
		tmp = -1.0;
	elseif (y <= 2.1e-36)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -3.4e-35], -1.0, If[LessEqual[y, 2.1e-36], 1.0, -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -3.4000000000000003e-35 or 2.09999999999999991e-36 < y

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in x around 0 77.0%

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

   if -3.4000000000000003e-35 < y < 2.09999999999999991e-36

   1. Initial program 99.9%

      \[\frac{x - y}{x + y} \]

   2. Taylor expanded in x around inf 79.5%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{-35}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{-36}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 7: 49.6% accurate, 7.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 99.9%

   \[\frac{x - y}{x + y} \]

2. Taylor expanded in x around 0 51.7%

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

3. Final simplification 51.7%

   \[\leadsto -1 \]

Developer target: 100.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} - \frac{y}{x + y} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x / (x + y)) - (y / (x + y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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