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

Percentage Accurate: 100.0% → 100.0%

Time: 2.2s

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: 75.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+35} \lor \neg \left(y \leq 5.8 \cdot 10^{+25}\right):\\ \;\;\;\;\frac{-y}{200}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.6e+35) (not (<= y 5.8e+25))) (/ (- y) 200.0) x))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.6e+35) || !(y <= 5.8e+25)) {
		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 ((y <= (-2.6d+35)) .or. (.not. (y <= 5.8d+25))) 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 ((y <= -2.6e+35) || !(y <= 5.8e+25)) {
		tmp = -y / 200.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.6e+35) or not (y <= 5.8e+25):
		tmp = -y / 200.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.6e+35) || !(y <= 5.8e+25))
		tmp = Float64(Float64(-y) / 200.0);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.6e+35) || ~((y <= 5.8e+25)))
		tmp = -y / 200.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.6e+35], N[Not[LessEqual[y, 5.8e+25]], $MachinePrecision]], N[((-y) / 200.0), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -2.60000000000000007e35 or 5.7999999999999998e25 < y

   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-frac-neg 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.7%

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

      5. associate-/r/ 99.8%

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

      6. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 83.9%

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

      1. *-commutative 83.9%

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

      2. metadata-eval 83.9%

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

      3. metadata-eval 83.9%

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

      4. distribute-rgt-neg-in 83.9%

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

      5. div-inv 84.1%

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

      6. distribute-neg-frac 84.1%

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

   6. Applied egg-rr 84.1%

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

   if -2.60000000000000007e35 < y < 5.7999999999999998e25

   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-frac-neg 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/ 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 77.4%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+35} \lor \neg \left(y \leq 5.8 \cdot 10^{+25}\right):\\ \;\;\;\;\frac{-y}{200}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3: 75.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+38} \lor \neg \left(y \leq 4.5 \cdot 10^{+23}\right):\\ \;\;\;\;y \cdot -0.005\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -5e+38) (not (<= y 4.5e+23))) (* y -0.005) x))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -5e+38) || !(y <= 4.5e+23)) {
		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 ((y <= (-5d+38)) .or. (.not. (y <= 4.5d+23))) 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 ((y <= -5e+38) || !(y <= 4.5e+23)) {
		tmp = y * -0.005;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -5e+38) or not (y <= 4.5e+23):
		tmp = y * -0.005
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -5e+38) || !(y <= 4.5e+23))
		tmp = Float64(y * -0.005);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -5e+38) || ~((y <= 4.5e+23)))
		tmp = y * -0.005;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -5e+38], N[Not[LessEqual[y, 4.5e+23]], $MachinePrecision]], N[(y * -0.005), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999997e38 or 4.49999999999999979e23 < y

   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-frac-neg 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.7%

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

      5. associate-/r/ 99.8%

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

      6. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 83.9%

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

   if -4.9999999999999997e38 < y < 4.49999999999999979e23

   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-frac-neg 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/ 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 77.4%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+38} \lor \neg \left(y \leq 4.5 \cdot 10^{+23}\right):\\ \;\;\;\;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-frac-neg 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. Final simplification 99.9%

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

Alternative 5: 50.7% 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-frac-neg 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 inf 48.1%

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

5. Final simplification 48.1%

   \[\leadsto x \]

Reproduce

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