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

Percentage Accurate: 100.0% → 100.0%

Time: 2.7s

Alternatives: 5

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. Taylor expanded in x around 0 100.0%

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

   1. +-commutative 100.0%

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

   2. *-commutative 100.0%

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

   3. fma-define 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 73.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.15 \cdot 10^{+71} \lor \neg \left(x \leq 1.7 \cdot 10^{-75} \lor \neg \left(x \leq 2.4 \cdot 10^{+47}\right) \land x \leq 2.7 \cdot 10^{+75}\right):\\ \;\;\;\;x \cdot 500\\ \mathbf{else}:\\ \;\;\;\;-500 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.15e+71)
         (not (or (<= x 1.7e-75) (and (not (<= x 2.4e+47)) (<= x 2.7e+75)))))
   (* x 500.0)
   (* -500.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.15e+71) || !((x <= 1.7e-75) || (!(x <= 2.4e+47) && (x <= 2.7e+75)))) {
		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 <= (-2.15d+71)) .or. (.not. (x <= 1.7d-75) .or. (.not. (x <= 2.4d+47)) .and. (x <= 2.7d+75))) 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 <= -2.15e+71) || !((x <= 1.7e-75) || (!(x <= 2.4e+47) && (x <= 2.7e+75)))) {
		tmp = x * 500.0;
	} else {
		tmp = -500.0 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.15e+71) or not ((x <= 1.7e-75) or (not (x <= 2.4e+47) and (x <= 2.7e+75))):
		tmp = x * 500.0
	else:
		tmp = -500.0 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.15e+71) || !((x <= 1.7e-75) || (!(x <= 2.4e+47) && (x <= 2.7e+75))))
		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 <= -2.15e+71) || ~(((x <= 1.7e-75) || (~((x <= 2.4e+47)) && (x <= 2.7e+75)))))
		tmp = x * 500.0;
	else
		tmp = -500.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.15e+71], N[Not[Or[LessEqual[x, 1.7e-75], And[N[Not[LessEqual[x, 2.4e+47]], $MachinePrecision], LessEqual[x, 2.7e+75]]]], $MachinePrecision]], N[(x * 500.0), $MachinePrecision], N[(-500.0 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.14999999999999992e71 or 1.70000000000000008e-75 < x < 2.40000000000000019e47 or 2.69999999999999998e75 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 78.4%

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

   if -2.14999999999999992e71 < x < 1.70000000000000008e-75 or 2.40000000000000019e47 < x < 2.69999999999999998e75

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 77.9%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.15 \cdot 10^{+71} \lor \neg \left(x \leq 1.7 \cdot 10^{-75} \lor \neg \left(x \leq 2.4 \cdot 10^{+47}\right) \land x \leq 2.7 \cdot 10^{+75}\right):\\ \;\;\;\;x \cdot 500\\ \mathbf{else}:\\ \;\;\;\;-500 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 100.0% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0 100.0%

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

4. Final simplification 100.0%

   \[\leadsto -500 \cdot y + x \cdot 500 \]
5. Add Preprocessing

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

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

Alternative 5: 50.2% 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 53.0%

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

4. Final simplification 53.0%

   \[\leadsto -500 \cdot y \]
5. Add Preprocessing

Reproduce

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