Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 4.9s

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.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return math.pow(((1.0 / (x + y)) * (x - y)), -1.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. clear-num 100.0%

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

   2. inv-pow 100.0%

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

3. Applied egg-rr 100.0%

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

   1. clear-num 100.0%

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

   2. associate-/r/ 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 74.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.45e+104) (not (<= y 4.4e-31)))
   (+ -1.0 (* -2.0 (/ x y)))
   (+ 1.0 (* 2.0 (/ y x)))))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -2.45e+104) or not (y <= 4.4e-31):
		tmp = -1.0 + (-2.0 * (x / y))
	else:
		tmp = 1.0 + (2.0 * (y / x))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.45e+104) || ~((y <= 4.4e-31)))
		tmp = -1.0 + (-2.0 * (x / y));
	else
		tmp = 1.0 + (2.0 * (y / x));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.44999999999999993e104 or 4.40000000000000019e-31 < y

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 82.5%

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

   if -2.44999999999999993e104 < y < 4.40000000000000019e-31

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in y around 0 75.8%

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

4. Final simplification 78.8%

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

Alternative 3: 73.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -4.8e+104) -1.0 (if (<= y 4.4e-31) (+ 1.0 (* 2.0 (/ y x))) -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -4.8e+104) {
		tmp = -1.0;
	} else if (y <= 4.4e-31) {
		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 (y <= (-4.8d+104)) then
        tmp = -1.0d0
    else if (y <= 4.4d-31) 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 (y <= -4.8e+104) {
		tmp = -1.0;
	} else if (y <= 4.4e-31) {
		tmp = 1.0 + (2.0 * (y / x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -4.8e+104:
		tmp = -1.0
	elif y <= 4.4e-31:
		tmp = 1.0 + (2.0 * (y / x))
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -4.8e+104)
		tmp = -1.0;
	elseif (y <= 4.4e-31)
		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 (y <= -4.8e+104)
		tmp = -1.0;
	elseif (y <= 4.4e-31)
		tmp = 1.0 + (2.0 * (y / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -4.8e+104], -1.0, If[LessEqual[y, 4.4e-31], N[(1.0 + N[(2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -4.8e104 or 4.40000000000000019e-31 < y

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 82.0%

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

   if -4.8e104 < y < 4.40000000000000019e-31

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in y around 0 75.8%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{+104}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 4.4 \cdot 10^{-31}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 4: 100.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. clear-num 100.0%

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

   2. inv-pow 100.0%

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

3. Applied egg-rr 100.0%

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

   1. unpow-1 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 5: 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 99.9%

   \[\frac{x + y}{x - y} \]

2. Final simplification 99.9%

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

Alternative 6: 73.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.05 \cdot 10^{+104}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 3.9 \cdot 10^{-31}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -2.05e+104) -1.0 (if (<= y 3.9e-31) 1.0 -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -2.05e+104) {
		tmp = -1.0;
	} else if (y <= 3.9e-31) {
		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 (y <= (-2.05d+104)) then
        tmp = -1.0d0
    else if (y <= 3.9d-31) 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 (y <= -2.05e+104) {
		tmp = -1.0;
	} else if (y <= 3.9e-31) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -2.05e+104:
		tmp = -1.0
	elif y <= 3.9e-31:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -2.05e+104)
		tmp = -1.0;
	elseif (y <= 3.9e-31)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -2.05e+104)
		tmp = -1.0;
	elseif (y <= 3.9e-31)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -2.05e+104], -1.0, If[LessEqual[y, 3.9e-31], 1.0, -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -2.04999999999999992e104 or 3.9000000000000001e-31 < y

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 82.0%

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

   if -2.04999999999999992e104 < y < 3.9000000000000001e-31

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around inf 74.9%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.05 \cdot 10^{+104}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 3.9 \cdot 10^{-31}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 7: 48.7% 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 99.9%

   \[\frac{x + y}{x - y} \]

2. Taylor expanded in x around 0 50.4%

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

3. Final simplification 50.4%

   \[\leadsto -1 \]

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 2023257 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (/ 1.0 (- (/ x (+ x y)) (/ y (+ x y))))

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