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

Percentage Accurate: 100.0% → 100.0%

Time: 2.8s

Alternatives: 3

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. div-sub 100.0%

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

   2. *-inverses 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 74.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{+37} \lor \neg \left(y \leq 5.4 \cdot 10^{-17}\right):\\ \;\;\;\;\frac{-y}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -4.1e+37) (not (<= y 5.4e-17))) (/ (- y) x) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -4.1e+37) || !(y <= 5.4e-17)) {
		tmp = -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 <= (-4.1d+37)) .or. (.not. (y <= 5.4d-17))) then
        tmp = -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 <= -4.1e+37) || !(y <= 5.4e-17)) {
		tmp = -y / x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -4.1e+37) or not (y <= 5.4e-17):
		tmp = -y / x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -4.1e+37) || !(y <= 5.4e-17))
		tmp = Float64(Float64(-y) / x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -4.1e+37) || ~((y <= 5.4e-17)))
		tmp = -y / x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -4.1e+37], N[Not[LessEqual[y, 5.4e-17]], $MachinePrecision]], N[((-y) / x), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if y < -4.0999999999999998e37 or 5.4000000000000002e-17 < y

   1. Initial program 100.0%

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

      1. div-sub 100.0%

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

      2. *-inverses 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 81.3%

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

      1. mul-1-neg 81.3%

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

      2. distribute-frac-neg 81.3%

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

   6. Simplified 81.3%

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

   if -4.0999999999999998e37 < y < 5.4000000000000002e-17

   1. Initial program 100.0%

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

      1. div-sub 100.0%

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

      2. *-inverses 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 75.9%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.1 \cdot 10^{+37} \lor \neg \left(y \leq 5.4 \cdot 10^{-17}\right):\\ \;\;\;\;\frac{-y}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 3: 50.5% accurate, 5.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}{x} \]
2. Step-by-step derivation

   1. div-sub 100.0%

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

   2. *-inverses 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in y around 0 47.1%

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

5. Final simplification 47.1%

   \[\leadsto 1 \]

Developer target: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

  (/ (- x y) x))