Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 4.3s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{x - 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(x + y) / Float64(x - y))
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{x - 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(x + y) / Float64(x - y))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{x - y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. +-commutative N/A

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

   4. div-add N/A

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

   5. lower-+.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. lower-/.f64 100.0

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

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\frac{y}{x - y} + \frac{x}{x - y}} \]
5. Add Preprocessing

Alternative 2: 98.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ x y) (- x y)) -0.5)
   (fma (/ x y) -2.0 -1.0)
   (fma (/ 2.0 x) y 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.5

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in y around -inf

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

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt1-in N/A

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

      4. metadata-eval N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. distribute-lft-neg-in N/A

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

      9. metadata-eval N/A

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

      10. *-commutative N/A

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

      11. associate-*l/ N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 98.5

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

   8. Applied rewrites 98.5%

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

   9. Taylor expanded in x around 0

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

       1. associate-*r/ N/A

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

       2. *-inverses N/A

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

       3. *-lft-identity N/A

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

       4. metadata-eval N/A

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

       5. div-sub N/A

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

       6. fp-cancel-sign-sub-inv N/A

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

       7. div-add N/A

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

       8. associate-*r/ N/A

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

       9. *-commutative N/A

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

       10. associate-/l* N/A

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

       11. *-inverses N/A

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

       12. metadata-eval N/A

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

       13. lower-fma.f64 N/A

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

       14. lower-/.f64 98.5

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

   11. Applied rewrites 98.5%

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

   if -0.5 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. associate-+r+ N/A

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

      5. count-2-rev N/A

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

      6. +-commutative N/A

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

      7. *-lft-identity N/A

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

      8. associate-*l/ N/A

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

      9. associate-*l* N/A

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

      10. lower-fma.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 98.3

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

   5. Applied rewrites 98.3%

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

Alternative 3: 98.3% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ x y) (- x y)) -0.5) (/ (+ x y) (- y)) (fma (/ 2.0 x) y 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.5

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -0.5 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. associate-+r+ N/A

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

      5. count-2-rev N/A

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

      6. +-commutative N/A

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

      7. *-lft-identity N/A

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

      8. associate-*l/ N/A

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

      9. associate-*l* N/A

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

      10. lower-fma.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 98.3

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

   5. Applied rewrites 98.3%

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

Alternative 4: 97.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x + y}{x - y} \leq -0.5:\\ \;\;\;\;\frac{x + y}{-y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ x y) (- x y)) -0.5) (/ (+ x y) (- y)) 1.0))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.5

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -0.5 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.9%

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

Alternative 5: 97.8% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ x y) (- x y)) -5e-311) -1.0 1.0))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -5.00000000000023e-311

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.7%

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

   if -5.00000000000023e-311 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.9%

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

Alternative 6: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{x - 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(x + y) / Float64(x - y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 7: 49.0% 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}{x - y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 47.8%

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

Developer Target 1: 100.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024320 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (- (/ x (+ x y)) (/ y (+ x y)))))

  (/ (+ x y) (- x y)))