Data.Colour.CIE.Chromaticity:chromaCoords from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 2.2s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(1 - x\right) - y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - x\right) - y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - x\right) - y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(1 - x\right) - y \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 49.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq -7.4 \cdot 10^{-267}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.0) (- x) (if (<= x -7.4e-267) 1.0 (- y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = -x;
	} else if (x <= -7.4e-267) {
		tmp = 1.0;
	} else {
		tmp = -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 <= (-1.0d0)) then
        tmp = -x
    else if (x <= (-7.4d-267)) then
        tmp = 1.0d0
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = -x;
	} else if (x <= -7.4e-267) {
		tmp = 1.0;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.0:
		tmp = -x
	elif x <= -7.4e-267:
		tmp = 1.0
	else:
		tmp = -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(-x);
	elseif (x <= -7.4e-267)
		tmp = 1.0;
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = -x;
	elseif (x <= -7.4e-267)
		tmp = 1.0;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.0], (-x), If[LessEqual[x, -7.4e-267], 1.0, (-y)]]

Derivation

1. Split input into 3 regimes

2. if x < -1

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 74.9%

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

      1. neg-mul-1 74.9%

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

   5. Simplified 74.9%

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

   if -1 < x < -7.39999999999999971e-267

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.7%

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

   4. Taylor expanded in y around 0 51.6%

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

   if -7.39999999999999971e-267 < x

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 46.1%

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

      1. neg-mul-1 46.1%

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

   5. Simplified 46.1%

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

Alternative 3: 73.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - x \leq 1.0002:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (- 1.0 x) 1.0002) (- 1.0 y) (- 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((1.0 - x) <= 1.0002) {
		tmp = 1.0 - y;
	} else {
		tmp = 1.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 ((1.0d0 - x) <= 1.0002d0) then
        tmp = 1.0d0 - y
    else
        tmp = 1.0d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((1.0 - x) <= 1.0002) {
		tmp = 1.0 - y;
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (1.0 - x) <= 1.0002:
		tmp = 1.0 - y
	else:
		tmp = 1.0 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(1.0 - x) <= 1.0002)
		tmp = Float64(1.0 - y);
	else
		tmp = Float64(1.0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((1.0 - x) <= 1.0002)
		tmp = 1.0 - y;
	else
		tmp = 1.0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) x) < 1.0002

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 77.9%

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

   if 1.0002 < (-.f64 #s(literal 1 binary64) x)

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 76.6%

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

Alternative 4: 74.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 240:\\ \;\;\;\;1 - x\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 240.0) (- 1.0 x) (- y)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 240.0) {
		tmp = 1.0 - x;
	} else {
		tmp = -y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 240.0d0) then
        tmp = 1.0d0 - x
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 240.0) {
		tmp = 1.0 - x;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 240.0:
		tmp = 1.0 - x
	else:
		tmp = -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 240.0)
		tmp = Float64(1.0 - x);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 240.0)
		tmp = 1.0 - x;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 240

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 70.4%

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

   if 240 < y

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 70.7%

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

      1. neg-mul-1 70.7%

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

   5. Simplified 70.7%

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

Alternative 5: 43.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x -1.0) (- x) 1.0))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = -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 <= (-1.0d0)) then
        tmp = -x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = -x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.0:
		tmp = -x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(-x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = -x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.0], (-x), 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 74.9%

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

      1. neg-mul-1 74.9%

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

   5. Simplified 74.9%

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

   if -1 < x

   1. Initial program 100.0%

      \[\left(1 - x\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 77.7%

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

   4. Taylor expanded in y around 0 32.4%

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

Alternative 6: 26.0% 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%

   \[\left(1 - x\right) - y \]
2. Add Preprocessing

3. Taylor expanded in x around 0 66.0%

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

4. Taylor expanded in y around 0 25.8%

   \[\leadsto \color{blue}{1} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024144 
(FPCore (x y)
  :name "Data.Colour.CIE.Chromaticity:chromaCoords from colour-2.3.3"
  :precision binary64
  (- (- 1.0 x) y))