Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \mathsf{fma}\left(y + 1, x, y\right) \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (fma (+ y 1.0) x y))

C

assert(x < y);
double code(double x, double y) {
	return fma((y + 1.0), x, y);
}

Julia

x, y = sort([x, y])
function code(x, y)
	return fma(Float64(y + 1.0), x, y)
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(N[(y + 1.0), $MachinePrecision] * x + y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot y + x\right) + y \]
2. Step-by-step derivation

   1. *-commutative 100.0%

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

   2. distribute-lft1-in 100.0%

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

   3. fma-define 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y + 1, x, y\right)} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(y + 1, x, y\right) \]
6. Add Preprocessing

Alternative 2: 68.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.05 \cdot 10^{+58}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 4.6 \cdot 10^{+95}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y -1.0)
   (* y x)
   (if (<= y 1.3e-91) x (if (<= y 1.05e+58) y (if (<= y 4.6e+95) (* y x) y)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = y * x;
	} else if (y <= 1.3e-91) {
		tmp = x;
	} else if (y <= 1.05e+58) {
		tmp = y;
	} else if (y <= 4.6e+95) {
		tmp = y * x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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.3d-91) then
        tmp = x
    else if (y <= 1.05d+58) then
        tmp = y
    else if (y <= 4.6d+95) then
        tmp = y * x
    else
        tmp = y
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = y * x;
	} else if (y <= 1.3e-91) {
		tmp = x;
	} else if (y <= 1.05e+58) {
		tmp = y;
	} else if (y <= 4.6e+95) {
		tmp = y * x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= -1.0:
		tmp = y * x
	elif y <= 1.3e-91:
		tmp = x
	elif y <= 1.05e+58:
		tmp = y
	elif y <= 4.6e+95:
		tmp = y * x
	else:
		tmp = y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = Float64(y * x);
	elseif (y <= 1.3e-91)
		tmp = x;
	elseif (y <= 1.05e+58)
		tmp = y;
	elseif (y <= 4.6e+95)
		tmp = Float64(y * x);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.0)
		tmp = y * x;
	elseif (y <= 1.3e-91)
		tmp = x;
	elseif (y <= 1.05e+58)
		tmp = y;
	elseif (y <= 4.6e+95)
		tmp = y * x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, -1.0], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.3e-91], x, If[LessEqual[y, 1.05e+58], y, If[LessEqual[y, 4.6e+95], N[(y * x), $MachinePrecision], y]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1 or 1.05000000000000006e58 < y < 4.59999999999999994e95

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 99.2%

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

      1. +-commutative 99.2%

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

   5. Simplified 99.2%

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

   6. Taylor expanded in x around inf 44.0%

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

      1. *-commutative 44.0%

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

   8. Simplified 44.0%

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

   if -1 < y < 1.30000000000000007e-91

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 84.3%

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

   if 1.30000000000000007e-91 < y < 1.05000000000000006e58 or 4.59999999999999994e95 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 55.4%

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

4. Final simplification 63.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.3 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.05 \cdot 10^{+58}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 4.6 \cdot 10^{+95}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-120}:\\ \;\;\;\;\left(y + 1\right) \cdot x\\ \mathbf{elif}\;x \leq -1.8 \cdot 10^{-146}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq -1.3 \cdot 10^{-195}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= x -3.8e-120)
   (* (+ y 1.0) x)
   (if (<= x -1.8e-146) y (if (<= x -1.3e-195) x (if (<= x 1.0) y (* y x))))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -3.8e-120) {
		tmp = (y + 1.0) * x;
	} else if (x <= -1.8e-146) {
		tmp = y;
	} else if (x <= -1.3e-195) {
		tmp = x;
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-3.8d-120)) then
        tmp = (y + 1.0d0) * x
    else if (x <= (-1.8d-146)) then
        tmp = y
    else if (x <= (-1.3d-195)) then
        tmp = x
    else if (x <= 1.0d0) then
        tmp = y
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (x <= -3.8e-120) {
		tmp = (y + 1.0) * x;
	} else if (x <= -1.8e-146) {
		tmp = y;
	} else if (x <= -1.3e-195) {
		tmp = x;
	} else if (x <= 1.0) {
		tmp = y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -3.8e-120:
		tmp = (y + 1.0) * x
	elif x <= -1.8e-146:
		tmp = y
	elif x <= -1.3e-195:
		tmp = x
	elif x <= 1.0:
		tmp = y
	else:
		tmp = y * x
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -3.8e-120)
		tmp = Float64(Float64(y + 1.0) * x);
	elseif (x <= -1.8e-146)
		tmp = y;
	elseif (x <= -1.3e-195)
		tmp = x;
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.8e-120)
		tmp = (y + 1.0) * x;
	elseif (x <= -1.8e-146)
		tmp = y;
	elseif (x <= -1.3e-195)
		tmp = x;
	elseif (x <= 1.0)
		tmp = y;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -3.8e-120], N[(N[(y + 1.0), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[x, -1.8e-146], y, If[LessEqual[x, -1.3e-195], x, If[LessEqual[x, 1.0], y, N[(y * x), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -3.7999999999999997e-120

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 87.5%

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

      1. +-commutative 87.5%

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

   5. Simplified 87.5%

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

   if -3.7999999999999997e-120 < x < -1.79999999999999989e-146 or -1.3000000000000001e-195 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 83.1%

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

   if -1.79999999999999989e-146 < x < -1.3000000000000001e-195

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 45.5%

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

   if 1 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 51.8%

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

      1. +-commutative 51.8%

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

   5. Simplified 51.8%

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

   6. Taylor expanded in x around inf 48.1%

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

      1. *-commutative 48.1%

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

   8. Simplified 48.1%

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

4. Final simplification 76.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-120}:\\ \;\;\;\;\left(y + 1\right) \cdot x\\ \mathbf{elif}\;x \leq -1.8 \cdot 10^{-146}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq -1.3 \cdot 10^{-195}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 6.2 \cdot 10^{-141}:\\ \;\;\;\;\left(y + 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 + x\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y 6.2e-141) (* (+ y 1.0) x) (* y (+ 1.0 x))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 6.2e-141) {
		tmp = (y + 1.0) * x;
	} else {
		tmp = y * (1.0 + x);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 6.2d-141) then
        tmp = (y + 1.0d0) * x
    else
        tmp = y * (1.0d0 + x)
    end if
    code = tmp
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 6.2e-141:
		tmp = (y + 1.0) * x
	else:
		tmp = y * (1.0 + x)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 6.2e-141)
		tmp = Float64(Float64(y + 1.0) * x);
	else
		tmp = Float64(y * Float64(1.0 + x));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 6.2e-141)
		tmp = (y + 1.0) * x;
	else
		tmp = y * (1.0 + x);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 6.2e-141], N[(N[(y + 1.0), $MachinePrecision] * x), $MachinePrecision], N[(y * N[(1.0 + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 6.20000000000000055e-141

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 66.8%

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

      1. +-commutative 66.8%

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

   5. Simplified 66.8%

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

   if 6.20000000000000055e-141 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 83.3%

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

      1. +-commutative 83.3%

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

   5. Simplified 83.3%

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

4. Final simplification 72.2%

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

Alternative 5: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ y + \left(x + y \cdot x\right) \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (+ y (+ x (* y x))))

C

assert(x < y);
double code(double x, double y) {
	return y + (x + (y * x));
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y + (x + (y * x))
end function

Java

assert x < y;
public static double code(double x, double y) {
	return y + (x + (y * x));
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return y + (x + (y * x))

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(y + Float64(x + Float64(y * x)))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = y + (x + (y * x));
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y + N[(x + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 6: 64.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1.3 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (if (<= y 1.3e-91) x y))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 1.3e-91) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 1.3d-91) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 1.3e-91) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 1.3e-91:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 1.3e-91)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.3e-91)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 1.3e-91], x, y]

Derivation

1. Split input into 2 regimes

2. if y < 1.30000000000000007e-91

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 50.7%

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

   if 1.30000000000000007e-91 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 53.7%

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

4. Final simplification 51.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.3 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 39.4% accurate, 7.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ x \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 x)

C

assert(x < y);
double code(double x, double y) {
	return x;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x
end function

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	return x

Julia

x, y = sort([x, y])
function code(x, y)
	return x
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = x;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := x

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around 0 39.4%

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

4. Final simplification 39.4%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024076 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))