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

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

Alternatives: 4

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ x (/ y 500.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x + (y / 500.0)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ x (/ y 500.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x + (y / 500.0)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ x (/ y 500.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x + (y / 500.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + \frac{y}{500} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 73.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-34}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 7.1 \cdot 10^{+30}:\\ \;\;\;\;\frac{y}{500}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -2.2e-34) x (if (<= x 7.1e+30) (/ y 500.0) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.2e-34) {
		tmp = x;
	} else if (x <= 7.1e+30) {
		tmp = y / 500.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 <= (-2.2d-34)) then
        tmp = x
    else if (x <= 7.1d+30) then
        tmp = y / 500.0d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -2.2e-34) {
		tmp = x;
	} else if (x <= 7.1e+30) {
		tmp = y / 500.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -2.2e-34:
		tmp = x
	elif x <= 7.1e+30:
		tmp = y / 500.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.2e-34)
		tmp = x;
	elseif (x <= 7.1e+30)
		tmp = Float64(y / 500.0);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.2e-34)
		tmp = x;
	elseif (x <= 7.1e+30)
		tmp = y / 500.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.2e-34], x, If[LessEqual[x, 7.1e+30], N[(y / 500.0), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -2.1999999999999999e-34 or 7.09999999999999983e30 < x

   1. Initial program 100.0%

      \[x + \frac{y}{500} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 76.2%

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

   if -2.1999999999999999e-34 < x < 7.09999999999999983e30

   1. Initial program 100.0%

      \[x + \frac{y}{500} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 79.4%

         \[\leadsto \mathsf{*.f64}\left(\frac{1}{500}, \color{blue}{y}\right) \]

   5. Simplified 79.4%

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

      1. metadata-eval N/A

         \[\leadsto \frac{1}{500} \cdot y \]

      2. associate-/r/ N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{500}{y}}} \]

      3. clear-num N/A

         \[\leadsto \frac{y}{\color{blue}{500}} \]

      4. /-lowering-/.f64 79.6%

         \[\leadsto \mathsf{/.f64}\left(y, \color{blue}{500}\right) \]

   7. Applied egg-rr 79.6%

      \[\leadsto \color{blue}{\frac{y}{500}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 73.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.8 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.02 \cdot 10^{+40}:\\ \;\;\;\;y \cdot 0.002\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -5.8e-33) x (if (<= x 1.02e+40) (* y 0.002) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -5.8e-33) {
		tmp = x;
	} else if (x <= 1.02e+40) {
		tmp = y * 0.002;
	} 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 <= (-5.8d-33)) then
        tmp = x
    else if (x <= 1.02d+40) then
        tmp = y * 0.002d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -5.8e-33) {
		tmp = x;
	} else if (x <= 1.02e+40) {
		tmp = y * 0.002;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -5.8e-33:
		tmp = x
	elif x <= 1.02e+40:
		tmp = y * 0.002
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -5.8e-33)
		tmp = x;
	elseif (x <= 1.02e+40)
		tmp = Float64(y * 0.002);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -5.8e-33)
		tmp = x;
	elseif (x <= 1.02e+40)
		tmp = y * 0.002;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -5.8e-33], x, If[LessEqual[x, 1.02e+40], N[(y * 0.002), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -5.80000000000000005e-33 or 1.02e40 < x

   1. Initial program 100.0%

      \[x + \frac{y}{500} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 76.2%

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

   if -5.80000000000000005e-33 < x < 1.02e40

   1. Initial program 100.0%

      \[x + \frac{y}{500} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 79.4%

         \[\leadsto \mathsf{*.f64}\left(\frac{1}{500}, \color{blue}{y}\right) \]

   5. Simplified 79.4%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.8 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.02 \cdot 10^{+40}:\\ \;\;\;\;y \cdot 0.002\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 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}{500} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

5. Simplified 48.4%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024149 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLAB from colour-2.3.3, C"
  :precision binary64
  (+ x (/ y 500.0)))