Data.Colour.SRGB:invTransferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 5.9s

Alternatives: 9

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}{y - -1} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(N[(y + x), $MachinePrecision] / N[(y - -1.0), $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}{y - -1} \]
4. Add Preprocessing

Alternative 2: 98.5% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < -500 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 96.8

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

   5. Applied rewrites 96.8%

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

   if -500 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 5.00000000000000024e-5

   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.2

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

   5. Applied rewrites 98.2%

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

   if 5.00000000000000024e-5 < (/.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 98.8

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

   5. Applied rewrites 98.8%

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

4. Final simplification 97.8%

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

Alternative 3: 98.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{y - -1}\\ t_1 := \frac{x}{y - -1}\\ \mathbf{if}\;t\_0 \leq -500:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0.02:\\ \;\;\;\;\mathsf{fma}\left(1 - x, 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) (- y -1.0))) (t_1 (/ x (- y -1.0))))
   (if (<= t_0 -500.0)
     t_1
     (if (<= t_0 0.02) (fma (- 1.0 x) y x) (if (<= t_0 2.0) 1.0 t_1)))))

C

double code(double x, double y) {
	double t_0 = (y + x) / (y - -1.0);
	double t_1 = x / (y - -1.0);
	double tmp;
	if (t_0 <= -500.0) {
		tmp = t_1;
	} else if (t_0 <= 0.02) {
		tmp = fma((1.0 - x), 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(y - -1.0))
	t_1 = Float64(x / Float64(y - -1.0))
	tmp = 0.0
	if (t_0 <= -500.0)
		tmp = t_1;
	elseif (t_0 <= 0.02)
		tmp = fma(Float64(1.0 - x), 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[(y - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x / N[(y - -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -500.0], t$95$1, If[LessEqual[t$95$0, 0.02], N[(N[(1.0 - x), $MachinePrecision] * 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))) < -500 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 96.8

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

   5. Applied rewrites 96.8%

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

   if -500 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 0.0200000000000000004

   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 97.0

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

   5. Applied rewrites 97.0%

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

   if 0.0200000000000000004 < (/.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 96.4%

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

4. Final simplification 96.7%

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

Alternative 4: 86.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{y - -1}\\ \mathbf{if}\;t\_0 \leq 0.02:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \mathbf{elif}\;t\_0 \leq 20000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(1, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (+ y x) (- y -1.0))))
   (if (<= t_0 0.02) (fma 1.0 y x) (if (<= t_0 20000.0) 1.0 (fma 1.0 y x)))))

C

double code(double x, double y) {
	double t_0 = (y + x) / (y - -1.0);
	double tmp;
	if (t_0 <= 0.02) {
		tmp = fma(1.0, y, x);
	} else if (t_0 <= 20000.0) {
		tmp = 1.0;
	} else {
		tmp = fma(1.0, y, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 0.0200000000000000004 or 2e4 < (/.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 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 77.7

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

   5. Applied rewrites 77.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 78.1%

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

   if 0.0200000000000000004 < (/.f64 (+.f64 x y) (+.f64 y #s(literal 1 binary64))) < 2e4

   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.4%

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

4. Final simplification 84.3%

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

Alternative 5: 98.5% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.0], t$95$0, If[LessEqual[y, 1.0], N[(N[(1.0 - x), $MachinePrecision] * y + x), $MachinePrecision], t$95$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}{\left(1 + \frac{x}{y}\right) - \frac{1}{y}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. lower--.f64 98.2

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

   5. Applied rewrites 98.2%

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

   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.6

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

   5. Applied rewrites 98.6%

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

Alternative 6: 98.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (/ (- x) y))))
   (if (<= y -1.0) t_0 (if (<= y 0.82) (fma (- 1.0 x) y x) t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.819999999999999951 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. lower--.f64 98.2

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

   5. Applied rewrites 98.2%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 97.6%

      \[\leadsto 1 - \frac{-x}{y} \]

   if -1 < y < 0.819999999999999951

   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.6

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

   5. Applied rewrites 98.6%

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

Alternative 7: 49.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{y + x}{y - -1} \leq 2 \cdot 10^{-24}:\\ \;\;\;\;1 \cdot y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ y x) (- y -1.0)) 2e-24) (* 1.0 y) 1.0))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if ((y + x) / (y - -1.0)) <= 2e-24:
		tmp = 1.0 * y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(y + x) / Float64(y - -1.0)) <= 2e-24)
		tmp = Float64(1.0 * y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((y + x) / (y - -1.0)) <= 2e-24)
		tmp = 1.0 * y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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 30.0

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

   5. Applied rewrites 30.0%

      \[\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 30.6%

      \[\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 29.8%

       \[\leadsto 1 \cdot y \]

   if 1.99999999999999985e-24 < (/.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 y around inf

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

   5. Applied rewrites 62.3%

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

4. Final simplification 48.3%

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

Alternative 8: 86.9% 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 70.0%

      \[\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.6

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

   5. Applied rewrites 98.6%

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

Alternative 9: 38.4% 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 36.6%

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

Reproduce

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