Data.Colour.CIE:cieLAB from colour-2.3.3, D

Percentage Accurate: 100.0% → 100.0%

Time: 3.0s

Alternatives: 5

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x - \frac{y}{200} \]

2. Final simplification 100.0%

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

Alternative 2: 72.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -2.9 \cdot 10^{+47} \lor \neg \left(x \leq -2.6 \cdot 10^{-18}\right) \land x \leq 4.5 \cdot 10^{+64}:\\ \;\;\;\;\frac{-y}{200}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.45e+103)
   x
   (if (or (<= x -2.9e+47) (and (not (<= x -2.6e-18)) (<= x 4.5e+64)))
     (/ (- y) 200.0)
     x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+103) {
		tmp = x;
	} else if ((x <= -2.9e+47) || (!(x <= -2.6e-18) && (x <= 4.5e+64))) {
		tmp = -y / 200.0;
	} else {
		tmp = 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 <= (-1.45d+103)) then
        tmp = x
    else if ((x <= (-2.9d+47)) .or. (.not. (x <= (-2.6d-18))) .and. (x <= 4.5d+64)) then
        tmp = -y / 200.0d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+103) {
		tmp = x;
	} else if ((x <= -2.9e+47) || (!(x <= -2.6e-18) && (x <= 4.5e+64))) {
		tmp = -y / 200.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.45e+103:
		tmp = x
	elif (x <= -2.9e+47) or (not (x <= -2.6e-18) and (x <= 4.5e+64)):
		tmp = -y / 200.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.45e+103)
		tmp = x;
	elseif ((x <= -2.9e+47) || (!(x <= -2.6e-18) && (x <= 4.5e+64)))
		tmp = Float64(Float64(-y) / 200.0);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.45e+103)
		tmp = x;
	elseif ((x <= -2.9e+47) || (~((x <= -2.6e-18)) && (x <= 4.5e+64)))
		tmp = -y / 200.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.45e+103], x, If[Or[LessEqual[x, -2.9e+47], And[N[Not[LessEqual[x, -2.6e-18]], $MachinePrecision], LessEqual[x, 4.5e+64]]], N[((-y) / 200.0), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.4499999999999999e103 or -2.8999999999999998e47 < x < -2.6e-18 or 4.49999999999999973e64 < x

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. neg-mul-1 100.0%

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

      4. associate-/l* 100.0%

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

      5. associate-/r/ 100.0%

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

      6. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 81.0%

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

   if -1.4499999999999999e103 < x < -2.8999999999999998e47 or -2.6e-18 < x < 4.49999999999999973e64

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. neg-mul-1 100.0%

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

      4. associate-/l* 99.8%

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

      5. associate-/r/ 99.9%

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

      6. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 78.0%

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

      1. *-commutative 78.0%

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

      2. metadata-eval 78.0%

         \[\leadsto y \cdot \color{blue}{\left(-0.005\right)} \]

      3. metadata-eval 78.0%

         \[\leadsto y \cdot \left(-\color{blue}{\frac{1}{200}}\right) \]

      4. distribute-rgt-neg-in 78.0%

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

      5. div-inv 78.1%

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

      6. distribute-neg-frac 78.1%

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

   6. Applied egg-rr 78.1%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -2.9 \cdot 10^{+47} \lor \neg \left(x \leq -2.6 \cdot 10^{-18}\right) \land x \leq 4.5 \cdot 10^{+64}:\\ \;\;\;\;\frac{-y}{200}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3: 72.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -6.6 \cdot 10^{+51}:\\ \;\;\;\;y \cdot -0.005\\ \mathbf{elif}\;x \leq -1.65 \cdot 10^{-18}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+63}:\\ \;\;\;\;y \cdot -0.005\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e+103)
   x
   (if (<= x -6.6e+51)
     (* y -0.005)
     (if (<= x -1.65e-18) x (if (<= x 4.2e+63) (* y -0.005) x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+103) {
		tmp = x;
	} else if (x <= -6.6e+51) {
		tmp = y * -0.005;
	} else if (x <= -1.65e-18) {
		tmp = x;
	} else if (x <= 4.2e+63) {
		tmp = y * -0.005;
	} else {
		tmp = 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 <= (-4.4d+103)) then
        tmp = x
    else if (x <= (-6.6d+51)) then
        tmp = y * (-0.005d0)
    else if (x <= (-1.65d-18)) then
        tmp = x
    else if (x <= 4.2d+63) then
        tmp = y * (-0.005d0)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+103) {
		tmp = x;
	} else if (x <= -6.6e+51) {
		tmp = y * -0.005;
	} else if (x <= -1.65e-18) {
		tmp = x;
	} else if (x <= 4.2e+63) {
		tmp = y * -0.005;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e+103:
		tmp = x
	elif x <= -6.6e+51:
		tmp = y * -0.005
	elif x <= -1.65e-18:
		tmp = x
	elif x <= 4.2e+63:
		tmp = y * -0.005
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e+103)
		tmp = x;
	elseif (x <= -6.6e+51)
		tmp = Float64(y * -0.005);
	elseif (x <= -1.65e-18)
		tmp = x;
	elseif (x <= 4.2e+63)
		tmp = Float64(y * -0.005);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e+103)
		tmp = x;
	elseif (x <= -6.6e+51)
		tmp = y * -0.005;
	elseif (x <= -1.65e-18)
		tmp = x;
	elseif (x <= 4.2e+63)
		tmp = y * -0.005;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e+103], x, If[LessEqual[x, -6.6e+51], N[(y * -0.005), $MachinePrecision], If[LessEqual[x, -1.65e-18], x, If[LessEqual[x, 4.2e+63], N[(y * -0.005), $MachinePrecision], x]]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.39999999999999985e103 or -6.5999999999999994e51 < x < -1.6500000000000001e-18 or 4.2000000000000004e63 < x

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. neg-mul-1 100.0%

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

      4. associate-/l* 100.0%

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

      5. associate-/r/ 100.0%

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

      6. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 81.0%

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

   if -4.39999999999999985e103 < x < -6.5999999999999994e51 or -1.6500000000000001e-18 < x < 4.2000000000000004e63

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. neg-mul-1 100.0%

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

      4. associate-/l* 99.8%

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

      5. associate-/r/ 99.9%

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

      6. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 78.0%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -6.6 \cdot 10^{+51}:\\ \;\;\;\;y \cdot -0.005\\ \mathbf{elif}\;x \leq -1.65 \cdot 10^{-18}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+63}:\\ \;\;\;\;y \cdot -0.005\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 4: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. sub-neg 100.0%

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

   2. distribute-neg-frac 100.0%

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

   3. neg-mul-1 100.0%

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

   4. associate-/l* 99.9%

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

   5. associate-/r/ 99.9%

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

   6. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Final simplification 99.9%

   \[\leadsto x + y \cdot -0.005 \]

Alternative 5: 51.2% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 100.0%

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

   1. sub-neg 100.0%

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

   2. distribute-neg-frac 100.0%

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

   3. neg-mul-1 100.0%

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

   4. associate-/l* 99.9%

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

   5. associate-/r/ 99.9%

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

   6. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in x around inf 49.1%

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

5. Final simplification 49.1%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023192 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLAB from colour-2.3.3, D"
  :precision binary64
  (- x (/ y 200.0)))