Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 6.0s

Alternatives: 6

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. clear-num 99.9%

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

   2. associate-/r/ 99.7%

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

4. Applied egg-rr 99.7%

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

   1. +-commutative 99.7%

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

   2. distribute-rgt-in 99.7%

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

   3. un-div-inv 99.9%

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

   4. un-div-inv 100.0%

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

6. Applied egg-rr 100.0%

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

Alternative 2: 74.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.7e-18) (not (<= x 2.05e-7)))
   (+ 1.0 (* 2.0 (/ y x)))
   (+ (* -2.0 (/ x y)) -1.0)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if (x <= -2.7e-18) or not (x <= 2.05e-7):
		tmp = 1.0 + (2.0 * (y / x))
	else:
		tmp = (-2.0 * (x / y)) + -1.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -2.7e-18) || ~((x <= 2.05e-7)))
		tmp = 1.0 + (2.0 * (y / x));
	else
		tmp = (-2.0 * (x / y)) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.69999999999999989e-18 or 2.05e-7 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 77.5%

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

   if -2.69999999999999989e-18 < x < 2.05e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 83.9%

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

4. Final simplification 80.5%

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

Alternative 3: 74.2% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -0.007) (not (<= x 2e-9))) (+ 1.0 (* 2.0 (/ y x))) -1.0))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.00700000000000000015 or 2.00000000000000012e-9 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 77.5%

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

   if -0.00700000000000000015 < x < 2.00000000000000012e-9

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 82.9%

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

4. Final simplification 80.0%

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

Alternative 4: 73.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 5 \cdot 10^{-8}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.3) 1.0 (if (<= x 5e-8) -1.0 1.0)))

C

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

Python

def code(x, y):
	tmp = 0
	if x <= -3.3:
		tmp = 1.0
	elif x <= 5e-8:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.3)
		tmp = 1.0;
	elseif (x <= 5e-8)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.3)
		tmp = 1.0;
	elseif (x <= 5e-8)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.3], 1.0, If[LessEqual[x, 5e-8], -1.0, 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -3.2999999999999998 or 4.9999999999999998e-8 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 76.2%

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

   if -3.2999999999999998 < x < 4.9999999999999998e-8

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 82.9%

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

Alternative 5: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

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

3. Taylor expanded in x around 0 51.3%

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

Developer target: 100.0% accurate, 0.5× 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 2024100 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (/ 1.0 (- (/ x (+ x y)) (/ y (+ x y))))

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