Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 5

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, 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 2: 75.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.4e+38) (not (<= y 9.8e+57)))
   (+ (* -2.0 (/ x y)) -1.0)
   (+ 1.0 (* 2.0 (/ y x)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.4e+38) || !(y <= 9.8e+57)) {
		tmp = (-2.0 * (x / y)) + -1.0;
	} 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 <= (-1.4d+38)) .or. (.not. (y <= 9.8d+57))) then
        tmp = ((-2.0d0) * (x / y)) + (-1.0d0)
    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 <= -1.4e+38) || !(y <= 9.8e+57)) {
		tmp = (-2.0 * (x / y)) + -1.0;
	} else {
		tmp = 1.0 + (2.0 * (y / x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.4e+38) or not (y <= 9.8e+57):
		tmp = (-2.0 * (x / y)) + -1.0
	else:
		tmp = 1.0 + (2.0 * (y / x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.4e+38) || !(y <= 9.8e+57))
		tmp = Float64(Float64(-2.0 * Float64(x / y)) + -1.0);
	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 <= -1.4e+38) || ~((y <= 9.8e+57)))
		tmp = (-2.0 * (x / y)) + -1.0;
	else
		tmp = 1.0 + (2.0 * (y / x));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.4e38 or 9.7999999999999998e57 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 77.4%

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

   if -1.4e38 < y < 9.7999999999999998e57

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 76.4%

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

4. Final simplification 76.8%

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

Alternative 3: 74.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{+37}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 4.1 \cdot 10^{+58}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -2.3e+37) -1.0 (if (<= y 4.1e+58) (+ 1.0 (* 2.0 (/ y x))) -1.0)))

C

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

Python

def code(x, y):
	tmp = 0
	if y <= -2.3e+37:
		tmp = -1.0
	elif y <= 4.1e+58:
		tmp = 1.0 + (2.0 * (y / x))
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -2.3e+37)
		tmp = -1.0;
	elseif (y <= 4.1e+58)
		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 <= -2.3e+37)
		tmp = -1.0;
	elseif (y <= 4.1e+58)
		tmp = 1.0 + (2.0 * (y / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -2.3e+37], -1.0, If[LessEqual[y, 4.1e+58], N[(1.0 + N[(2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -2.30000000000000002e37 or 4.1e58 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 76.3%

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

   if -2.30000000000000002e37 < y < 4.1e58

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 76.4%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{+37}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 4.1 \cdot 10^{+58}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 4: 74.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{+28}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 1.4 \cdot 10^{+58}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -3e+28) -1.0 (if (<= y 1.4e+58) 1.0 -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -3e+28) {
		tmp = -1.0;
	} else if (y <= 1.4e+58) {
		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 <= (-3d+28)) then
        tmp = -1.0d0
    else if (y <= 1.4d+58) 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 <= -3e+28) {
		tmp = -1.0;
	} else if (y <= 1.4e+58) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -3e+28:
		tmp = -1.0
	elif y <= 1.4e+58:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -3e+28)
		tmp = -1.0;
	elseif (y <= 1.4e+58)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -3e+28)
		tmp = -1.0;
	elseif (y <= 1.4e+58)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -3e+28], -1.0, If[LessEqual[y, 1.4e+58], 1.0, -1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -3.0000000000000001e28 or 1.3999999999999999e58 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 75.1%

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

   if -3.0000000000000001e28 < y < 1.3999999999999999e58

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf 75.7%

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

4. Final simplification 75.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{+28}:\\ \;\;\;\;-1\\ \mathbf{elif}\;y \leq 1.4 \cdot 10^{+58}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

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

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

3. Final simplification 47.7%

   \[\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 2023224 
(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)))