Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 76.5% → 99.4%

Time: 3.5s

Alternatives: 5

Speedup: 0.7×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (* (* x 2.0) y) (- x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return ((x * 2.0) * y) / (x - y)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 76.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (* (* x 2.0) y) (- x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return ((x * 2.0) * y) / (x - y)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{+55} \lor \neg \left(y \leq 1.4 \cdot 10^{+94}\right):\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(\frac{y}{x}, -0.5, 0.5\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2e+55) (not (<= y 1.4e+94)))
   (/ (* x 2.0) (/ (- x y) y))
   (/ y (fma (/ y x) -0.5 0.5))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2e+55) || !(y <= 1.4e+94)) {
		tmp = (x * 2.0) / ((x - y) / y);
	} else {
		tmp = y / fma((y / x), -0.5, 0.5);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2e+55) || !(y <= 1.4e+94))
		tmp = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y));
	else
		tmp = Float64(y / fma(Float64(y / x), -0.5, 0.5));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2e+55], N[Not[LessEqual[y, 1.4e+94]], $MachinePrecision]], N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y / N[(N[(y / x), $MachinePrecision] * -0.5 + 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.00000000000000002e55 or 1.39999999999999999e94 < y

   1. Initial program 64.2%

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

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

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

   if -2.00000000000000002e55 < y < 1.39999999999999999e94

   1. Initial program 82.2%

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

      1. *-commutative 82.2%

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

      2. associate-/l* 100.0%

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

      3. div-sub 100.0%

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

      4. sub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. distribute-neg-frac 100.0%

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

      7. neg-mul-1 100.0%

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

      8. *-commutative 100.0%

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

      9. times-frac 100.0%

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

      10. metadata-eval 100.0%

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

      11. metadata-eval 100.0%

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

      12. metadata-eval 100.0%

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

      13. *-inverses 100.0%

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

      14. associate-/r* 100.0%

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

      15. *-commutative 100.0%

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

      16. associate-/r* 100.0%

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

      17. *-inverses 100.0%

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

      18. *-inverses 100.0%

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

      19. associate-/r* 100.0%

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

      20. *-commutative 100.0%

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

      21. fma-def 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{+55} \lor \neg \left(y \leq 1.4 \cdot 10^{+94}\right):\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(\frac{y}{x}, -0.5, 0.5\right)}\\ \end{array} \]

Alternative 2: 99.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2e+29) || !(y <= 2e-12)) {
		tmp = (x * 2.0) / ((x - y) / y);
	} else {
		tmp = y * ((x * 2.0) / (x - y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-2d+29)) .or. (.not. (y <= 2d-12))) then
        tmp = (x * 2.0d0) / ((x - y) / y)
    else
        tmp = y * ((x * 2.0d0) / (x - y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.99999999999999983e29 or 1.99999999999999996e-12 < y

   1. Initial program 70.4%

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

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

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

   if -1.99999999999999983e29 < y < 1.99999999999999996e-12

   1. Initial program 79.5%

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

      1. associate-*l/ 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 3: 94.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+144}:\\ \;\;\;\;x \cdot -2\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+176}:\\ \;\;\;\;y \cdot \frac{x \cdot 2}{x - y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -7e+144)
   (* x -2.0)
   (if (<= y 2.7e+176) (* y (/ (* x 2.0) (- x y))) (* x -2.0))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -7e+144) {
		tmp = x * -2.0;
	} else if (y <= 2.7e+176) {
		tmp = y * ((x * 2.0) / (x - y));
	} else {
		tmp = x * -2.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 <= (-7d+144)) then
        tmp = x * (-2.0d0)
    else if (y <= 2.7d+176) then
        tmp = y * ((x * 2.0d0) / (x - y))
    else
        tmp = x * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -7e+144) {
		tmp = x * -2.0;
	} else if (y <= 2.7e+176) {
		tmp = y * ((x * 2.0) / (x - y));
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -7e+144:
		tmp = x * -2.0
	elif y <= 2.7e+176:
		tmp = y * ((x * 2.0) / (x - y))
	else:
		tmp = x * -2.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -7e+144)
		tmp = Float64(x * -2.0);
	elseif (y <= 2.7e+176)
		tmp = Float64(y * Float64(Float64(x * 2.0) / Float64(x - y)));
	else
		tmp = Float64(x * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -7e+144)
		tmp = x * -2.0;
	elseif (y <= 2.7e+176)
		tmp = y * ((x * 2.0) / (x - y));
	else
		tmp = x * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -7e+144], N[(x * -2.0), $MachinePrecision], If[LessEqual[y, 2.7e+176], N[(y * N[(N[(x * 2.0), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -6.9999999999999996e144 or 2.6999999999999998e176 < y

   1. Initial program 62.1%

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

      1. associate-*l/ 75.4%

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

   3. Simplified 75.4%

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

   4. Taylor expanded in x around 0 94.0%

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

   if -6.9999999999999996e144 < y < 2.6999999999999998e176

   1. Initial program 80.0%

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

      1. associate-*l/ 97.4%

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

   3. Simplified 97.4%

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

4. Final simplification 96.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+144}:\\ \;\;\;\;x \cdot -2\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+176}:\\ \;\;\;\;y \cdot \frac{x \cdot 2}{x - y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \]

Alternative 4: 75.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+14}:\\ \;\;\;\;x \cdot -2\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{+34}:\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -2.6e+14) (* x -2.0) (if (<= y 1.15e+34) (* y 2.0) (* x -2.0))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -2.6e+14) {
		tmp = x * -2.0;
	} else if (y <= 1.15e+34) {
		tmp = y * 2.0;
	} else {
		tmp = x * -2.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.6d+14)) then
        tmp = x * (-2.0d0)
    else if (y <= 1.15d+34) then
        tmp = y * 2.0d0
    else
        tmp = x * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -2.6e+14) {
		tmp = x * -2.0;
	} else if (y <= 1.15e+34) {
		tmp = y * 2.0;
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -2.6e+14:
		tmp = x * -2.0
	elif y <= 1.15e+34:
		tmp = y * 2.0
	else:
		tmp = x * -2.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -2.6e+14)
		tmp = Float64(x * -2.0);
	elseif (y <= 1.15e+34)
		tmp = Float64(y * 2.0);
	else
		tmp = Float64(x * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -2.6e+14)
		tmp = x * -2.0;
	elseif (y <= 1.15e+34)
		tmp = y * 2.0;
	else
		tmp = x * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -2.6e+14], N[(x * -2.0), $MachinePrecision], If[LessEqual[y, 1.15e+34], N[(y * 2.0), $MachinePrecision], N[(x * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.6e14 or 1.1499999999999999e34 < y

   1. Initial program 68.9%

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

      1. associate-*l/ 81.5%

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

   3. Simplified 81.5%

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

   4. Taylor expanded in x around 0 82.0%

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

   if -2.6e14 < y < 1.1499999999999999e34

   1. Initial program 80.4%

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

      1. associate-*l/ 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 79.3%

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

4. Final simplification 80.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+14}:\\ \;\;\;\;x \cdot -2\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{+34}:\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \]

Alternative 5: 50.8% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ x \cdot -2 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x -2.0))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x * -2.0

Julia

function code(x, y)
	return Float64(x * -2.0)
end

MATLAB

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

Wolfram

code[x_, y_] := N[(x * -2.0), $MachinePrecision]

Derivation

1. Initial program 74.9%

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

   1. associate-*l/ 91.1%

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

3. Simplified 91.1%

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

4. Taylor expanded in x around 0 51.6%

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

5. Final simplification 51.6%

   \[\leadsto x \cdot -2 \]

Developer target: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2 \cdot x}{x - y} \cdot y\\ \mathbf{if}\;x < -1.7210442634149447 \cdot 10^{+81}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x < 83645045635564430:\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (/ (* 2.0 x) (- x y)) y)))
   (if (< x -1.7210442634149447e+81)
     t_0
     (if (< x 83645045635564430.0) (/ (* x 2.0) (/ (- x y) y)) t_0))))

C

double code(double x, double y) {
	double t_0 = ((2.0 * x) / (x - y)) * y;
	double tmp;
	if (x < -1.7210442634149447e+81) {
		tmp = t_0;
	} else if (x < 83645045635564430.0) {
		tmp = (x * 2.0) / ((x - y) / y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((2.0d0 * x) / (x - y)) * y
    if (x < (-1.7210442634149447d+81)) then
        tmp = t_0
    else if (x < 83645045635564430.0d0) then
        tmp = (x * 2.0d0) / ((x - y) / y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((2.0 * x) / (x - y)) * y;
	double tmp;
	if (x < -1.7210442634149447e+81) {
		tmp = t_0;
	} else if (x < 83645045635564430.0) {
		tmp = (x * 2.0) / ((x - y) / y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((2.0 * x) / (x - y)) * y
	tmp = 0
	if x < -1.7210442634149447e+81:
		tmp = t_0
	elif x < 83645045635564430.0:
		tmp = (x * 2.0) / ((x - y) / y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(2.0 * x) / Float64(x - y)) * y)
	tmp = 0.0
	if (x < -1.7210442634149447e+81)
		tmp = t_0;
	elseif (x < 83645045635564430.0)
		tmp = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((2.0 * x) / (x - y)) * y;
	tmp = 0.0;
	if (x < -1.7210442634149447e+81)
		tmp = t_0;
	elseif (x < 83645045635564430.0)
		tmp = (x * 2.0) / ((x - y) / y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(2.0 * x), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, If[Less[x, -1.7210442634149447e+81], t$95$0, If[Less[x, 83645045635564430.0], N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

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

  :herbie-target
  (if (< x -1.7210442634149447e+81) (* (/ (* 2.0 x) (- x y)) y) (if (< x 83645045635564430.0) (/ (* x 2.0) (/ (- x y) y)) (* (/ (* 2.0 x) (- x y)) y)))

  (/ (* (* x 2.0) y) (- x y)))