Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 5.2s

Alternatives: 5

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(x + y\right) - x \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) - x \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) - x \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 84.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - x\right)\\ \mathbf{if}\;y \leq -2.4 \cdot 10^{-9}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1.16 \cdot 10^{-132}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 x))))
   (if (<= y -2.4e-9) t_0 (if (<= y 1.16e-132) x t_0))))

C

double code(double x, double y) {
	double t_0 = y * (1.0 - x);
	double tmp;
	if (y <= -2.4e-9) {
		tmp = t_0;
	} else if (y <= 1.16e-132) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y * (1.0d0 - x)
    if (y <= (-2.4d-9)) then
        tmp = t_0
    else if (y <= 1.16d-132) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * (1.0 - x);
	double tmp;
	if (y <= -2.4e-9) {
		tmp = t_0;
	} else if (y <= 1.16e-132) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * (1.0 - x)
	tmp = 0
	if y <= -2.4e-9:
		tmp = t_0
	elif y <= 1.16e-132:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * Float64(1.0 - x))
	tmp = 0.0
	if (y <= -2.4e-9)
		tmp = t_0;
	elseif (y <= 1.16e-132)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * (1.0 - x);
	tmp = 0.0;
	if (y <= -2.4e-9)
		tmp = t_0;
	elseif (y <= 1.16e-132)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.4e-9], t$95$0, If[LessEqual[y, 1.16e-132], x, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.4e-9 or 1.1599999999999999e-132 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(1 - x\right)} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto y \cdot \left(1 + \color{blue}{\left(\mathsf{neg}\left(x\right)\right)}\right) \]

      2. mul-1-neg N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left(1 + -1 \cdot x\right)}\right) \]

      4. mul-1-neg N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(1 + \left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      5. sub-neg N/A

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

      6. --lowering--.f64 89.5%

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

   5. Simplified 89.5%

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

   if -2.4e-9 < y < 1.1599999999999999e-132

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

   5. Simplified 77.7%

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

Alternative 3: 73.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.95 \cdot 10^{-117}:\\ \;\;\;\;x - x \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.95e-117) (- x (* x y)) (* y (- 1.0 x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.95e-117) {
		tmp = x - (x * y);
	} else {
		tmp = y * (1.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 <= (-1.95d-117)) then
        tmp = x - (x * y)
    else
        tmp = y * (1.0d0 - x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.95e-117) {
		tmp = x - (x * y);
	} else {
		tmp = y * (1.0 - x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.95e-117:
		tmp = x - (x * y)
	else:
		tmp = y * (1.0 - x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.95e-117)
		tmp = Float64(x - Float64(x * y));
	else
		tmp = Float64(y * Float64(1.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.95e-117)
		tmp = x - (x * y);
	else
		tmp = y * (1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.95e-117], N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.94999999999999996e-117

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \mathsf{\_.f64}\left(\color{blue}{x}, \mathsf{*.f64}\left(x, y\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 80.1%

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

   if -1.94999999999999996e-117 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(1 - x\right)} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto y \cdot \left(1 + \color{blue}{\left(\mathsf{neg}\left(x\right)\right)}\right) \]

      2. mul-1-neg N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left(1 + -1 \cdot x\right)}\right) \]

      4. mul-1-neg N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(1 + \left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      5. sub-neg N/A

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

      6. --lowering--.f64 60.6%

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

   5. Simplified 60.6%

      \[\leadsto \color{blue}{y \cdot \left(1 - x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 49.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{-103}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x -2.9e-103) x y))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.9e-103) {
		tmp = x;
	} else {
		tmp = 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.9d-103)) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -2.9e-103) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -2.9e-103:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.9e-103)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.9e-103)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.9e-103], x, y]

Derivation

1. Split input into 2 regimes

2. if x < -2.8999999999999999e-103

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

   5. Simplified 46.1%

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

   if -2.8999999999999999e-103 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 46.0%

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

Alternative 5: 38.2% accurate, 7.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%

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

3. Taylor expanded in y around 0

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

5. Simplified 42.3%

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

Reproduce

herbie shell --seed 2024191 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, A"
  :precision binary64
  (- (+ x y) (* x y)))