Data.Colour.CIE:cieLABView from colour-2.3.3, B

Percentage Accurate: 100.0% → 100.0%

Time: 2.8s

Alternatives: 4

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (* 500.0 (- x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 500.0 * (x - y)

Julia

function code(x, y)
	return Float64(500.0 * Float64(x - y))
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* 500.0 (- x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 500.0 * (x - y)

Julia

function code(x, y)
	return Float64(500.0 * Float64(x - y))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, 500, -500 \cdot y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fma x 500.0 (* -500.0 y)))

C

double code(double x, double y) {
	return fma(x, 500.0, (-500.0 * y));
}

Julia

function code(x, y)
	return fma(x, 500.0, Float64(-500.0 * y))
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[500 \cdot \left(x - y\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. distribute-rgt-in 100.0%

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

   3. fma-define 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 500, \left(-y\right) \cdot 500\right)} \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, 500, \left(-y\right) \cdot 500\right)} \]

5. Taylor expanded in x around 0 100.0%

   \[\leadsto \color{blue}{-500 \cdot y + 500 \cdot x} \]
6. Step-by-step derivation

   1. metadata-eval 100.0%

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

   2. distribute-lft-neg-in 100.0%

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

   3. *-commutative 100.0%

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

   4. +-commutative 100.0%

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

   5. fma-define 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 500, -500 \cdot y\right)} \]

   6. distribute-lft-neg-in 100.0%

      \[\leadsto \mathsf{fma}\left(x, 500, \color{blue}{\left(-500\right) \cdot y}\right) \]

   7. metadata-eval 100.0%

      \[\leadsto \mathsf{fma}\left(x, 500, \color{blue}{-500} \cdot y\right) \]

7. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, 500, -500 \cdot y\right)} \]
8. Add Preprocessing

Alternative 2: 73.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{-93} \lor \neg \left(x \leq 1.75 \cdot 10^{+31}\right):\\ \;\;\;\;x \cdot 500\\ \mathbf{else}:\\ \;\;\;\;-500 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -3e-93) (not (<= x 1.75e+31))) (* x 500.0) (* -500.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -3e-93) || !(x <= 1.75e+31)) {
		tmp = x * 500.0;
	} else {
		tmp = -500.0 * 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 <= (-3d-93)) .or. (.not. (x <= 1.75d+31))) then
        tmp = x * 500.0d0
    else
        tmp = (-500.0d0) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -3e-93) || !(x <= 1.75e+31)) {
		tmp = x * 500.0;
	} else {
		tmp = -500.0 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -3e-93) or not (x <= 1.75e+31):
		tmp = x * 500.0
	else:
		tmp = -500.0 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -3e-93) || !(x <= 1.75e+31))
		tmp = Float64(x * 500.0);
	else
		tmp = Float64(-500.0 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -3e-93) || ~((x <= 1.75e+31)))
		tmp = x * 500.0;
	else
		tmp = -500.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -3e-93], N[Not[LessEqual[x, 1.75e+31]], $MachinePrecision]], N[(x * 500.0), $MachinePrecision], N[(-500.0 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.0000000000000001e-93 or 1.75e31 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 78.6%

      \[\leadsto \color{blue}{500 \cdot x} \]

   if -3.0000000000000001e-93 < x < 1.75e31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 82.0%

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

4. Final simplification 80.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{-93} \lor \neg \left(x \leq 1.75 \cdot 10^{+31}\right):\\ \;\;\;\;x \cdot 500\\ \mathbf{else}:\\ \;\;\;\;-500 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* 500.0 (- x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 500.0 * (x - y)

Julia

function code(x, y)
	return Float64(500.0 * Float64(x - y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 4: 50.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ -500 \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* -500.0 y))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return -500.0 * y

Julia

function code(x, y)
	return Float64(-500.0 * y)
end

MATLAB

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

Wolfram

code[x_, y_] := N[(-500.0 * y), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0 50.8%

   \[\leadsto \color{blue}{-500 \cdot y} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024160 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500.0 (- x y)))