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

Percentage Accurate: 100.0% → 100.0%

Time: 2.3s

Alternatives: 3

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot 2 - y \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 74.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.92 \cdot 10^{+37}:\\ \;\;\;\;0 - y\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+52}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;0 - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.92e+37) (- 0.0 y) (if (<= y 2.4e+52) (* x 2.0) (- 0.0 y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.92e+37) {
		tmp = 0.0 - y;
	} else if (y <= 2.4e+52) {
		tmp = x * 2.0;
	} else {
		tmp = 0.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 (y <= (-1.92d+37)) then
        tmp = 0.0d0 - y
    else if (y <= 2.4d+52) then
        tmp = x * 2.0d0
    else
        tmp = 0.0d0 - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.92e+37) {
		tmp = 0.0 - y;
	} else if (y <= 2.4e+52) {
		tmp = x * 2.0;
	} else {
		tmp = 0.0 - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.92e+37:
		tmp = 0.0 - y
	elif y <= 2.4e+52:
		tmp = x * 2.0
	else:
		tmp = 0.0 - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.92e+37)
		tmp = Float64(0.0 - y);
	elseif (y <= 2.4e+52)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(0.0 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.92e+37)
		tmp = 0.0 - y;
	elseif (y <= 2.4e+52)
		tmp = x * 2.0;
	else
		tmp = 0.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.92e+37], N[(0.0 - y), $MachinePrecision], If[LessEqual[y, 2.4e+52], N[(x * 2.0), $MachinePrecision], N[(0.0 - y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.91999999999999994e37 or 2.4e52 < y

   1. Initial program 100.0%

      \[x \cdot 2 - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(y\right) \]

      2. neg-sub0 N/A

         \[\leadsto 0 - \color{blue}{y} \]

      3. --lowering--.f64 81.3%

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

   5. Simplified 81.3%

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

      1. sub0-neg N/A

         \[\leadsto \mathsf{neg}\left(y\right) \]

      2. neg-lowering-neg.f64 81.3%

         \[\leadsto \mathsf{neg.f64}\left(y\right) \]

   7. Applied egg-rr 81.3%

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

   if -1.91999999999999994e37 < y < 2.4e52

   1. Initial program 100.0%

      \[x \cdot 2 - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 79.5%

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

   5. Simplified 79.5%

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

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.92 \cdot 10^{+37}:\\ \;\;\;\;0 - y\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+52}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;0 - y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ 0 - y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- 0.0 y))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.0 - y

Julia

function code(x, y)
	return Float64(0.0 - y)
end

MATLAB

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

Wolfram

code[x_, y_] := N[(0.0 - y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x \cdot 2 - y \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. mul-1-neg N/A

      \[\leadsto \mathsf{neg}\left(y\right) \]

   2. neg-sub0 N/A

      \[\leadsto 0 - \color{blue}{y} \]

   3. --lowering--.f64 49.3%

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

5. Simplified 49.3%

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

   1. sub0-neg N/A

      \[\leadsto \mathsf{neg}\left(y\right) \]

   2. neg-lowering-neg.f64 49.3%

      \[\leadsto \mathsf{neg.f64}\left(y\right) \]

7. Applied egg-rr 49.3%

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

8. Final simplification 49.3%

   \[\leadsto 0 - y \]
9. Add Preprocessing

Reproduce

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