Data.Colour.SRGB:invTransferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 5.7s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

   \[\leadsto \frac{y + x}{1 + y} \]
4. Add Preprocessing

Alternative 2: 97.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{1 + y}\\ t_1 := \frac{x}{1 + y}\\ \mathbf{if}\;t\_0 \leq -200:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 10^{-23}:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;\frac{y}{1 + y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (+ y x) (+ 1.0 y))) (t_1 (/ x (+ 1.0 y))))
   (if (<= t_0 -200.0)
     t_1
     (if (<= t_0 1e-23) (fma 1.0 y x) (if (<= t_0 2.0) (/ y (+ 1.0 y)) t_1)))))

C

double code(double x, double y) {
	double t_0 = (y + x) / (1.0 + y);
	double t_1 = x / (1.0 + y);
	double tmp;
	if (t_0 <= -200.0) {
		tmp = t_1;
	} else if (t_0 <= 1e-23) {
		tmp = fma(1.0, y, x);
	} else if (t_0 <= 2.0) {
		tmp = y / (1.0 + y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(y + x) / Float64(1.0 + y))
	t_1 = Float64(x / Float64(1.0 + y))
	tmp = 0.0
	if (t_0 <= -200.0)
		tmp = t_1;
	elseif (t_0 <= 1e-23)
		tmp = fma(1.0, y, x);
	elseif (t_0 <= 2.0)
		tmp = Float64(y / Float64(1.0 + y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < -200 or 2 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 97.9

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

   5. Applied rewrites 97.9%

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

   if -200 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 9.9999999999999996e-24

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 98.7

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

   5. Applied rewrites 98.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 98.7%

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

   if 9.9999999999999996e-24 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 97.3

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

   5. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\frac{y}{1 + y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 + y} \leq -200:\\ \;\;\;\;\frac{x}{1 + y}\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 10^{-23}:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 2:\\ \;\;\;\;\frac{y}{1 + y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (+ y x) (+ 1.0 y))) (t_1 (/ x (+ 1.0 y))))
   (if (<= t_0 -200.0)
     t_1
     (if (<= t_0 2e-17) (fma 1.0 y x) (if (<= t_0 2.0) 1.0 t_1)))))

C

double code(double x, double y) {
	double t_0 = (y + x) / (1.0 + y);
	double t_1 = x / (1.0 + y);
	double tmp;
	if (t_0 <= -200.0) {
		tmp = t_1;
	} else if (t_0 <= 2e-17) {
		tmp = fma(1.0, y, x);
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(y + x) / Float64(1.0 + y))
	t_1 = Float64(x / Float64(1.0 + y))
	tmp = 0.0
	if (t_0 <= -200.0)
		tmp = t_1;
	elseif (t_0 <= 2e-17)
		tmp = fma(1.0, y, x);
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < -200 or 2 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 97.9

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

   5. Applied rewrites 97.9%

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

   if -200 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2.00000000000000014e-17

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 98.7

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

   5. Applied rewrites 98.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 98.7%

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

   if 2.00000000000000014e-17 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 95.9%

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

4. Final simplification 97.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 + y} \leq -200:\\ \;\;\;\;\frac{x}{1 + y}\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 2 \cdot 10^{-17}:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{1 + y}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-19}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-17}:\\ \;\;\;\;1 \cdot y\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (+ y x) (+ 1.0 y))))
   (if (<= t_0 -5e-19)
     (* 1.0 x)
     (if (<= t_0 2e-17) (* 1.0 y) (if (<= t_0 2.0) 1.0 (* 1.0 x))))))

C

double code(double x, double y) {
	double t_0 = (y + x) / (1.0 + y);
	double tmp;
	if (t_0 <= -5e-19) {
		tmp = 1.0 * x;
	} else if (t_0 <= 2e-17) {
		tmp = 1.0 * y;
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = 1.0 * x;
	}
	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 + x) / (1.0d0 + y)
    if (t_0 <= (-5d-19)) then
        tmp = 1.0d0 * x
    else if (t_0 <= 2d-17) then
        tmp = 1.0d0 * y
    else if (t_0 <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y + x) / (1.0 + y);
	double tmp;
	if (t_0 <= -5e-19) {
		tmp = 1.0 * x;
	} else if (t_0 <= 2e-17) {
		tmp = 1.0 * y;
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y + x) / (1.0 + y)
	tmp = 0
	if t_0 <= -5e-19:
		tmp = 1.0 * x
	elif t_0 <= 2e-17:
		tmp = 1.0 * y
	elif t_0 <= 2.0:
		tmp = 1.0
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y + x) / Float64(1.0 + y))
	tmp = 0.0
	if (t_0 <= -5e-19)
		tmp = Float64(1.0 * x);
	elseif (t_0 <= 2e-17)
		tmp = Float64(1.0 * y);
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y + x) / (1.0 + y);
	tmp = 0.0;
	if (t_0 <= -5e-19)
		tmp = 1.0 * x;
	elseif (t_0 <= 2e-17)
		tmp = 1.0 * y;
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < -5.0000000000000004e-19 or 2 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 95.8

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

   5. Applied rewrites 95.8%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 67.2%

       \[\leadsto 1 \cdot x \]

   if -5.0000000000000004e-19 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2.00000000000000014e-17

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 54.8

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

   5. Applied rewrites 54.8%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 54.8%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 \cdot y \]
   10. Step-by-step derivation

   11. Applied rewrites 54.8%

       \[\leadsto 1 \cdot y \]

   if 2.00000000000000014e-17 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 95.9%

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

4. Final simplification 75.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 + y} \leq -5 \cdot 10^{-19}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 2 \cdot 10^{-17}:\\ \;\;\;\;1 \cdot y\\ \mathbf{elif}\;\frac{y + x}{1 + y} \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 86.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\mathsf{fma}\left(1 - x, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 73.3%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 98.7

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

   5. Applied rewrites 98.7%

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

Alternative 6: 86.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1900:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = 1.0;
	} else if (y <= 1900.0) {
		tmp = fma(1.0, y, x);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1900 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 73.8%

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

   if -1 < y < 1900

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 97.7%

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

Alternative 7: 74.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1900 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 73.8%

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

   if -1 < y < 1900

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 73.2

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

   5. Applied rewrites 73.2%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 71.8%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 71.5%

       \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 38.9% accurate, 18.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around inf

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

5. Applied rewrites 37.8%

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

Reproduce

herbie shell --seed 2024270 
(FPCore (x y)
  :name "Data.Colour.SRGB:invTransferFunction from colour-2.3.3"
  :precision binary64
  (/ (+ x y) (+ y 1.0)))