Data.Colour.SRGB:transferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

   \[\leadsto y \cdot \left(1 + x\right) - x \]
4. Add Preprocessing

Alternative 2: 98.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (fma x y (- x))))
   (if (<= x -1.0) t_0 (if (<= x 9e-17) (- (* 1.0 y) x) t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 8.99999999999999957e-17 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. distribute-lft-out-- N/A

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

      2. *-rgt-identity N/A

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

      3. sub-neg N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, \mathsf{neg}\left(x\right)\right)} \]

      5. lower-neg.f64 98.4

         \[\leadsto \mathsf{fma}\left(x, y, \color{blue}{-x}\right) \]

   5. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, -x\right)} \]

   if -1 < x < 8.99999999999999957e-17

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.3%

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

Alternative 3: 86.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(x, y, -x\right)\\ \mathbf{if}\;x \leq -6.6 \cdot 10^{-34}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.05 \cdot 10^{-96}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (fma x y (- x))))
   (if (<= x -6.6e-34) t_0 (if (<= x 1.05e-96) (fma x y y) t_0))))

C

double code(double x, double y) {
	double t_0 = fma(x, y, -x);
	double tmp;
	if (x <= -6.6e-34) {
		tmp = t_0;
	} else if (x <= 1.05e-96) {
		tmp = fma(x, y, y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = fma(x, y, Float64(-x))
	tmp = 0.0
	if (x <= -6.6e-34)
		tmp = t_0;
	elseif (x <= 1.05e-96)
		tmp = fma(x, y, y);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x * y + (-x)), $MachinePrecision]}, If[LessEqual[x, -6.6e-34], t$95$0, If[LessEqual[x, 1.05e-96], N[(x * y + y), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.59999999999999965e-34 or 1.05000000000000001e-96 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. distribute-lft-out-- N/A

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

      2. *-rgt-identity N/A

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

      3. sub-neg N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, \mathsf{neg}\left(x\right)\right)} \]

      5. lower-neg.f64 93.5

         \[\leadsto \mathsf{fma}\left(x, y, \color{blue}{-x}\right) \]

   5. Applied rewrites 93.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, -x\right)} \]

   if -6.59999999999999965e-34 < x < 1.05000000000000001e-96

   1. Initial program 100.0%

      \[\left(x + 1\right) \cdot y - x \]
   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. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 85.9

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]

   5. Applied rewrites 85.9%

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

Alternative 4: 86.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.8 \cdot 10^{-10}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{-76}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -8.8e-10) (fma x y y) (if (<= y 1.3e-76) (- x) (fma x y y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -8.8e-10) {
		tmp = fma(x, y, y);
	} else if (y <= 1.3e-76) {
		tmp = -x;
	} else {
		tmp = fma(x, y, y);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -8.8e-10)
		tmp = fma(x, y, y);
	elseif (y <= 1.3e-76)
		tmp = Float64(-x);
	else
		tmp = fma(x, y, y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -8.8e-10], N[(x * y + y), $MachinePrecision], If[LessEqual[y, 1.3e-76], (-x), N[(x * y + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -8.7999999999999996e-10 or 1.3e-76 < y

   1. Initial program 99.9%

      \[\left(x + 1\right) \cdot y - x \]
   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. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 92.5

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]

   5. Applied rewrites 92.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]

   if -8.7999999999999996e-10 < y < 1.3e-76

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. lower-neg.f64 83.2

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

   5. Applied rewrites 83.2%

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

Alternative 5: 61.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. distribute-lft-out-- N/A

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

      2. *-rgt-identity N/A

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

      3. sub-neg N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, \mathsf{neg}\left(x\right)\right)} \]

      5. lower-neg.f64 50.9

         \[\leadsto \mathsf{fma}\left(x, y, \color{blue}{-x}\right) \]

   5. Applied rewrites 50.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, -x\right)} \]

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 50.0%

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

   if -1 < y < 1

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. lower-neg.f64 75.1

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

   5. Applied rewrites 75.1%

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

Alternative 6: 38.5% accurate, 4.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 Float64(-x)
end

MATLAB

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

Wolfram

code[x_, y_] := (-x)

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around 0

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. lower-neg.f64 41.0

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

5. Applied rewrites 41.0%

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

Alternative 7: 2.6% accurate, 12.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 + 1\right) \cdot y - x \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. lower-neg.f64 41.0

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

5. Applied rewrites 41.0%

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

7. Applied rewrites 2.4%

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

Reproduce

herbie shell --seed 2024255 
(FPCore (x y)
  :name "Data.Colour.SRGB:transferFunction from colour-2.3.3"
  :precision binary64
  (- (* (+ x 1.0) y) x))