Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 76.3% → 99.2%

Time: 7.9s

Alternatives: 5

Speedup: 0.5×

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.3% 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.2% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ t_1 := \frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+31}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq -5 \cdot 10^{-307}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;x \cdot \left(2 \cdot \frac{y}{x - y}\right)\\ \mathbf{elif}\;t\_0 \leq 2.5 \cdot 10^{-5}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (* x 2.0) y) (- x y))) (t_1 (/ (* x 2.0) (/ (- x y) y))))
   (if (<= t_0 -5e+31)
     t_1
     (if (<= t_0 -5e-307)
       t_0
       (if (<= t_0 0.0)
         (* x (* 2.0 (/ y (- x y))))
         (if (<= t_0 2.5e-5) t_0 t_1))))))

C

double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double t_1 = (x * 2.0) / ((x - y) / y);
	double tmp;
	if (t_0 <= -5e+31) {
		tmp = t_1;
	} else if (t_0 <= -5e-307) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = x * (2.0 * (y / (x - y)));
	} else if (t_0 <= 2.5e-5) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = ((x * 2.0d0) * y) / (x - y)
    t_1 = (x * 2.0d0) / ((x - y) / y)
    if (t_0 <= (-5d+31)) then
        tmp = t_1
    else if (t_0 <= (-5d-307)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = x * (2.0d0 * (y / (x - y)))
    else if (t_0 <= 2.5d-5) then
        tmp = t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double t_1 = (x * 2.0) / ((x - y) / y);
	double tmp;
	if (t_0 <= -5e+31) {
		tmp = t_1;
	} else if (t_0 <= -5e-307) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = x * (2.0 * (y / (x - y)));
	} else if (t_0 <= 2.5e-5) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x * 2.0) * y) / (x - y)
	t_1 = (x * 2.0) / ((x - y) / y)
	tmp = 0
	if t_0 <= -5e+31:
		tmp = t_1
	elif t_0 <= -5e-307:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = x * (2.0 * (y / (x - y)))
	elif t_0 <= 2.5e-5:
		tmp = t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x * 2.0) * y) / Float64(x - y))
	t_1 = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y))
	tmp = 0.0
	if (t_0 <= -5e+31)
		tmp = t_1;
	elseif (t_0 <= -5e-307)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	elseif (t_0 <= 2.5e-5)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((x * 2.0) * y) / (x - y);
	t_1 = (x * 2.0) / ((x - y) / y);
	tmp = 0.0;
	if (t_0 <= -5e+31)
		tmp = t_1;
	elseif (t_0 <= -5e-307)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = x * (2.0 * (y / (x - y)));
	elseif (t_0 <= 2.5e-5)
		tmp = t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+31], t$95$1, If[LessEqual[t$95$0, -5e-307], t$95$0, If[LessEqual[t$95$0, 0.0], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.5e-5], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -5.00000000000000027e31 or 2.50000000000000012e-5 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y))

   1. Initial program 42.1%

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

      1. associate-/l* 99.8%

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

      2. associate-*l* 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \left(2 \cdot \frac{y}{x - y}\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-*r* 99.8%

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

      2. clear-num 99.7%

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

      3. un-div-inv 99.9%

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

   6. Applied egg-rr 99.9%

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

   if -5.00000000000000027e31 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -5.00000000000000014e-307 or 0.0 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < 2.50000000000000012e-5

   1. Initial program 99.7%

      \[\frac{\left(x \cdot 2\right) \cdot y}{x - y} \]
   2. Add Preprocessing

   if -5.00000000000000014e-307 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < 0.0

   1. Initial program 8.0%

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

      1. associate-/l* 99.8%

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

      2. associate-*l* 99.8%

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

   3. Simplified 99.8%

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

Alternative 2: 93.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -9.5e-106) (not (<= y 3.5e-174)))
   (* x (* 2.0 (/ y (- x y))))
   (* y (+ 2.0 (* 2.0 (/ y x))))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -9.5e-106) || !(y <= 3.5e-174)) {
		tmp = x * (2.0 * (y / (x - y)));
	} else {
		tmp = y * (2.0 + (2.0 * (y / x)));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -9.5e-106) or not (y <= 3.5e-174):
		tmp = x * (2.0 * (y / (x - y)))
	else:
		tmp = y * (2.0 + (2.0 * (y / x)))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -9.5e-106) || !(y <= 3.5e-174))
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	else
		tmp = Float64(y * Float64(2.0 + Float64(2.0 * Float64(y / x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -9.5e-106) || ~((y <= 3.5e-174)))
		tmp = x * (2.0 * (y / (x - y)));
	else
		tmp = y * (2.0 + (2.0 * (y / x)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -9.5e-106], N[Not[LessEqual[y, 3.5e-174]], $MachinePrecision]], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 + N[(2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.4999999999999994e-106 or 3.49999999999999987e-174 < y

   1. Initial program 77.2%

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

      1. associate-/l* 96.4%

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

      2. associate-*l* 96.4%

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

   3. Simplified 96.4%

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

   if -9.4999999999999994e-106 < y < 3.49999999999999987e-174

   1. Initial program 81.7%

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

      1. associate-/l* 59.5%

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

      2. associate-*l* 59.5%

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

   3. Simplified 59.5%

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

   5. Taylor expanded in y around 0 95.9%

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

4. Final simplification 96.2%

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

Alternative 3: 93.6% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -4e-104) (not (<= y 3.5e-174)))
   (* x (* 2.0 (/ y (- x y))))
   (* 2.0 y)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -4e-104) || !(y <= 3.5e-174)) {
		tmp = x * (2.0 * (y / (x - y)));
	} else {
		tmp = 2.0 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -4e-104) or not (y <= 3.5e-174):
		tmp = x * (2.0 * (y / (x - y)))
	else:
		tmp = 2.0 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -4e-104) || !(y <= 3.5e-174))
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	else
		tmp = Float64(2.0 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -4e-104) || ~((y <= 3.5e-174)))
		tmp = x * (2.0 * (y / (x - y)));
	else
		tmp = 2.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -4e-104], N[Not[LessEqual[y, 3.5e-174]], $MachinePrecision]], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.99999999999999971e-104 or 3.49999999999999987e-174 < y

   1. Initial program 77.2%

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

      1. associate-/l* 96.4%

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

      2. associate-*l* 96.4%

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

   3. Simplified 96.4%

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

   if -3.99999999999999971e-104 < y < 3.49999999999999987e-174

   1. Initial program 81.7%

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

      1. associate-/l* 59.5%

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

      2. associate-*l* 59.5%

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

   3. Simplified 59.5%

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

   5. Taylor expanded in x around inf 95.3%

      \[\leadsto \color{blue}{2 \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 95.3%

         \[\leadsto \color{blue}{y \cdot 2} \]

   7. Simplified 95.3%

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

4. Final simplification 96.1%

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

Alternative 4: 75.1% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.65e-15) (not (<= x 3.8e+15))) (* 2.0 y) (* x -2.0)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.65e-15) || !(x <= 3.8e+15)) {
		tmp = 2.0 * y;
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.65e-15) or not (x <= 3.8e+15):
		tmp = 2.0 * y
	else:
		tmp = x * -2.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.65e-15) || !(x <= 3.8e+15))
		tmp = Float64(2.0 * y);
	else
		tmp = Float64(x * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.65e-15) || ~((x <= 3.8e+15)))
		tmp = 2.0 * y;
	else
		tmp = x * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.65e-15], N[Not[LessEqual[x, 3.8e+15]], $MachinePrecision]], N[(2.0 * y), $MachinePrecision], N[(x * -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.65e-15 or 3.8e15 < x

   1. Initial program 76.9%

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

      1. associate-/l* 73.6%

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

      2. associate-*l* 73.6%

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

   3. Simplified 73.6%

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

   5. Taylor expanded in x around inf 82.1%

      \[\leadsto \color{blue}{2 \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 82.1%

         \[\leadsto \color{blue}{y \cdot 2} \]

   7. Simplified 82.1%

      \[\leadsto \color{blue}{y \cdot 2} \]

   if -1.65e-15 < x < 3.8e15

   1. Initial program 80.5%

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

      1. associate-/l* 99.9%

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

      2. associate-*l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 78.2%

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

4. Final simplification 80.3%

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

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 78.5%

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

   1. associate-/l* 85.4%

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

   2. associate-*l* 85.4%

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

3. Simplified 85.4%

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

5. Taylor expanded in y around inf 45.8%

   \[\leadsto x \cdot \color{blue}{-2} \]
6. Add Preprocessing

Developer Target 1: 99.5% accurate, 0.5× 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 2024139 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x -1721044263414944700000000000000000000000000000000000000000000000000000000000000000) (* (/ (* 2 x) (- x y)) y) (if (< x 83645045635564430) (/ (* x 2) (/ (- x y) y)) (* (/ (* 2 x) (- x y)) y))))

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