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

Percentage Accurate: 100.0% → 100.0%

Time: 4.4s

Alternatives: 5

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, 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 2: 74.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{+19} \lor \neg \left(x \leq 2.75 \cdot 10^{-14}\right):\\ \;\;\;\;1 + -2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.1e+19) (not (<= x 2.75e-14))) (+ 1.0 (* -2.0 (/ y x))) -1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.1e+19) || !(x <= 2.75e-14)) {
		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 ((x <= (-2.1d+19)) .or. (.not. (x <= 2.75d-14))) 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 ((x <= -2.1e+19) || !(x <= 2.75e-14)) {
		tmp = 1.0 + (-2.0 * (y / x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.1e+19) or not (x <= 2.75e-14):
		tmp = 1.0 + (-2.0 * (y / x))
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.1e+19) || !(x <= 2.75e-14))
		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 ((x <= -2.1e+19) || ~((x <= 2.75e-14)))
		tmp = 1.0 + (-2.0 * (y / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.1e+19], N[Not[LessEqual[x, 2.75e-14]], $MachinePrecision]], N[(1.0 + N[(-2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]

Derivation

1. Split input into 2 regimes

2. if x < -2.1e19 or 2.74999999999999996e-14 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 79.1%

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

   if -2.1e19 < x < 2.74999999999999996e-14

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 81.5%

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

4. Final simplification 80.3%

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

Alternative 3: 74.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6 \cdot 10^{+19} \lor \neg \left(x \leq 2.75 \cdot 10^{-14}\right):\\ \;\;\;\;1 + -2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{x}{y} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -6e+19) (not (<= x 2.75e-14)))
   (+ 1.0 (* -2.0 (/ y x)))
   (+ (* 2.0 (/ x y)) -1.0)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -6e+19) || !(x <= 2.75e-14)) {
		tmp = 1.0 + (-2.0 * (y / x));
	} else {
		tmp = (2.0 * (x / y)) + -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -6e+19) or not (x <= 2.75e-14):
		tmp = 1.0 + (-2.0 * (y / x))
	else:
		tmp = (2.0 * (x / y)) + -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -6e+19) || !(x <= 2.75e-14))
		tmp = Float64(1.0 + Float64(-2.0 * Float64(y / x)));
	else
		tmp = Float64(Float64(2.0 * Float64(x / y)) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -6e+19) || ~((x <= 2.75e-14)))
		tmp = 1.0 + (-2.0 * (y / x));
	else
		tmp = (2.0 * (x / y)) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -6e+19], N[Not[LessEqual[x, 2.75e-14]], $MachinePrecision]], N[(1.0 + N[(-2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -6e19 or 2.74999999999999996e-14 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 79.1%

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

   if -6e19 < x < 2.74999999999999996e-14

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 82.6%

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

4. Final simplification 80.9%

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

Alternative 4: 73.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{+18}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 2.75 \cdot 10^{-14}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.8e+18) 1.0 (if (<= x 2.75e-14) -1.0 1.0)))

C

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

Python

def code(x, y):
	tmp = 0
	if x <= -4.8e+18:
		tmp = 1.0
	elif x <= 2.75e-14:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.8e+18)
		tmp = 1.0;
	elseif (x <= 2.75e-14)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.8e+18)
		tmp = 1.0;
	elseif (x <= 2.75e-14)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.8e+18], 1.0, If[LessEqual[x, 2.75e-14], -1.0, 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -4.8e18 or 2.74999999999999996e-14 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf 78.3%

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

   if -4.8e18 < x < 2.74999999999999996e-14

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 81.5%

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

4. Final simplification 79.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{+18}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 2.75 \cdot 10^{-14}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 5: 50.8% 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.6%

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

3. Final simplification 51.6%

   \[\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 2023230 
(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)))