Data.Colour.SRGB:invTransferFunction from colour-2.3.3

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

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{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]

Derivation

1. Initial program 100.0%

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

Alternative 2: 98.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 + \frac{x + -1}{y}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (+ 1.0 (/ (+ x -1.0) y))
   (+ x (* y (- 1.0 x)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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 99.0%

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

      1. associate--l+ 99.0%

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

      2. div-sub 99.0%

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

      3. sub-neg 99.0%

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

      4. metadata-eval 99.0%

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

   5. Simplified 99.0%

      \[\leadsto \color{blue}{1 + \frac{x + -1}{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 98.9%

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

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 + \frac{x + -1}{y}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3000 \lor \neg \left(y \leq 8000000000000\right):\\ \;\;\;\;1 + \frac{x + -1}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3000.0) (not (<= y 8000000000000.0)))
   (+ 1.0 (/ (+ x -1.0) y))
   (/ x (+ y 1.0))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3000.0) || !(y <= 8000000000000.0)) {
		tmp = 1.0 + ((x + -1.0) / y);
	} else {
		tmp = x / (y + 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 <= (-3000.0d0)) .or. (.not. (y <= 8000000000000.0d0))) then
        tmp = 1.0d0 + ((x + (-1.0d0)) / y)
    else
        tmp = x / (y + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -3000.0) || !(y <= 8000000000000.0)) {
		tmp = 1.0 + ((x + -1.0) / y);
	} else {
		tmp = x / (y + 1.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3000.0) or not (y <= 8000000000000.0):
		tmp = 1.0 + ((x + -1.0) / y)
	else:
		tmp = x / (y + 1.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3000.0) || !(y <= 8000000000000.0))
		tmp = Float64(1.0 + Float64(Float64(x + -1.0) / y));
	else
		tmp = Float64(x / Float64(y + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -3000.0) || ~((y <= 8000000000000.0)))
		tmp = 1.0 + ((x + -1.0) / y);
	else
		tmp = x / (y + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3000.0], N[Not[LessEqual[y, 8000000000000.0]], $MachinePrecision]], N[(1.0 + N[(N[(x + -1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3e3 or 8e12 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 99.3%

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

      1. associate--l+ 99.3%

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

      2. div-sub 99.3%

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

      3. sub-neg 99.3%

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

      4. metadata-eval 99.3%

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

   5. Simplified 99.3%

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

   if -3e3 < y < 8e12

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 84.7%

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

      1. +-commutative 84.7%

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

   5. Simplified 84.7%

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

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3000 \lor \neg \left(y \leq 8000000000000\right):\\ \;\;\;\;1 + \frac{x + -1}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{-13}:\\ \;\;\;\;\frac{y}{y + 1}\\ \mathbf{elif}\;y \leq 1.28 \cdot 10^{+23}:\\ \;\;\;\;\frac{x}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -7.8e-13) (/ y (+ y 1.0)) (if (<= y 1.28e+23) (/ x (+ y 1.0)) 1.0)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -7.8e-13) {
		tmp = y / (y + 1.0);
	} else if (y <= 1.28e+23) {
		tmp = x / (y + 1.0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -7.8e-13:
		tmp = y / (y + 1.0)
	elif y <= 1.28e+23:
		tmp = x / (y + 1.0)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -7.8e-13)
		tmp = Float64(y / Float64(y + 1.0));
	elseif (y <= 1.28e+23)
		tmp = Float64(x / Float64(y + 1.0));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -7.8e-13)
		tmp = y / (y + 1.0);
	elseif (y <= 1.28e+23)
		tmp = x / (y + 1.0);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -7.8e-13], N[(y / N[(y + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.28e+23], N[(x / N[(y + 1.0), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 3 regimes

2. if y < -7.80000000000000009e-13

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 81.1%

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

      1. +-commutative 81.1%

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

   5. Simplified 81.1%

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

   if -7.80000000000000009e-13 < y < 1.28e23

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 84.8%

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

      1. +-commutative 84.8%

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

   5. Simplified 84.8%

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

   if 1.28e23 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 87.0%

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

Alternative 5: 75.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -2.6e+17) 1.0 (if (<= y 3.5e+24) (/ x (+ y 1.0)) 1.0)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= -2.6e+17:
		tmp = 1.0
	elif y <= 3.5e+24:
		tmp = x / (y + 1.0)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -2.6e+17)
		tmp = 1.0;
	elseif (y <= 3.5e+24)
		tmp = Float64(x / Float64(y + 1.0));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -2.6e+17)
		tmp = 1.0;
	elseif (y <= 3.5e+24)
		tmp = x / (y + 1.0);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.6e17 or 3.5000000000000002e24 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 85.1%

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

   if -2.6e17 < y < 3.5000000000000002e24

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 82.7%

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

      1. +-commutative 82.7%

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

   5. Simplified 82.7%

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

Alternative 6: 74.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = 1.0;
	elseif (y <= 0.3)
		tmp = Float64(x - Float64(x * y));
	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 <= 0.3)
		tmp = x - (x * y);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.299999999999999989 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 80.3%

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

   if -1 < y < 0.299999999999999989

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 85.1%

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

      1. +-commutative 85.1%

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

   5. Simplified 85.1%

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

   6. Taylor expanded in y around 0 85.2%

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

      1. associate-*r* 85.2%

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

      2. neg-mul-1 85.2%

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

      3. cancel-sign-sub-inv 85.2%

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

   8. Simplified 85.2%

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

Alternative 7: 74.5% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = 1.0;
	elseif (y <= 8000000000000.0)
		tmp = 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 <= 8000000000000.0)
		tmp = x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], 1.0, If[LessEqual[y, 8000000000000.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 8e12 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 81.9%

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

   if -1 < y < 8e12

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 83.1%

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

Alternative 8: 39.1% accurate, 7.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 45.3%

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

Reproduce

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