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

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

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(y, -500, 500 \cdot x\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[500 \cdot \left(x - y\right) \]

2. Taylor expanded in x around 0 100.0%

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

   1. +-commutative 100.0%

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

   2. *-commutative 100.0%

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

   3. fma-def 100.0%

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

4. Applied egg-rr 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 73.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -34:\\ \;\;\;\;500 \cdot x\\ \mathbf{elif}\;x \leq 4.6 \cdot 10^{+26} \lor \neg \left(x \leq 1.7 \cdot 10^{+78}\right) \land x \leq 1.76 \cdot 10^{+108}:\\ \;\;\;\;y \cdot -500\\ \mathbf{else}:\\ \;\;\;\;500 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -34.0)
   (* 500.0 x)
   (if (or (<= x 4.6e+26) (and (not (<= x 1.7e+78)) (<= x 1.76e+108)))
     (* y -500.0)
     (* 500.0 x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -34.0) {
		tmp = 500.0 * x;
	} else if ((x <= 4.6e+26) || (!(x <= 1.7e+78) && (x <= 1.76e+108))) {
		tmp = y * -500.0;
	} else {
		tmp = 500.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 (x <= (-34.0d0)) then
        tmp = 500.0d0 * x
    else if ((x <= 4.6d+26) .or. (.not. (x <= 1.7d+78)) .and. (x <= 1.76d+108)) then
        tmp = y * (-500.0d0)
    else
        tmp = 500.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -34.0) {
		tmp = 500.0 * x;
	} else if ((x <= 4.6e+26) || (!(x <= 1.7e+78) && (x <= 1.76e+108))) {
		tmp = y * -500.0;
	} else {
		tmp = 500.0 * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -34.0:
		tmp = 500.0 * x
	elif (x <= 4.6e+26) or (not (x <= 1.7e+78) and (x <= 1.76e+108)):
		tmp = y * -500.0
	else:
		tmp = 500.0 * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -34.0)
		tmp = Float64(500.0 * x);
	elseif ((x <= 4.6e+26) || (!(x <= 1.7e+78) && (x <= 1.76e+108)))
		tmp = Float64(y * -500.0);
	else
		tmp = Float64(500.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -34.0)
		tmp = 500.0 * x;
	elseif ((x <= 4.6e+26) || (~((x <= 1.7e+78)) && (x <= 1.76e+108)))
		tmp = y * -500.0;
	else
		tmp = 500.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -34.0], N[(500.0 * x), $MachinePrecision], If[Or[LessEqual[x, 4.6e+26], And[N[Not[LessEqual[x, 1.7e+78]], $MachinePrecision], LessEqual[x, 1.76e+108]]], N[(y * -500.0), $MachinePrecision], N[(500.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -34 or 4.6000000000000001e26 < x < 1.70000000000000004e78 or 1.76e108 < x

   1. Initial program 100.0%

      \[500 \cdot \left(x - y\right) \]

   2. Taylor expanded in x around inf 83.8%

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

   if -34 < x < 4.6000000000000001e26 or 1.70000000000000004e78 < x < 1.76e108

   1. Initial program 100.0%

      \[500 \cdot \left(x - y\right) \]

   2. Taylor expanded in x around 0 77.3%

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

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -34:\\ \;\;\;\;500 \cdot x\\ \mathbf{elif}\;x \leq 4.6 \cdot 10^{+26} \lor \neg \left(x \leq 1.7 \cdot 10^{+78}\right) \land x \leq 1.76 \cdot 10^{+108}:\\ \;\;\;\;y \cdot -500\\ \mathbf{else}:\\ \;\;\;\;500 \cdot x\\ \end{array} \]

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. Final simplification 100.0%

   \[\leadsto 500 \cdot \left(x - y\right) \]

Alternative 4: 51.1% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[500 \cdot \left(x - y\right) \]

2. Taylor expanded in x around 0 50.0%

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

3. Final simplification 50.0%

   \[\leadsto y \cdot -500 \]

Reproduce

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