Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 77.3% → 98.9%

Time: 4.3s

Alternatives: 4

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: 77.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: 98.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ \mathbf{if}\;t\_0 \leq -4 \cdot 10^{-20} \lor \neg \left(t\_0 \leq -2 \cdot 10^{-296}\right) \land \left(t\_0 \leq 0 \lor \neg \left(t\_0 \leq 2 \cdot 10^{+129}\right)\right):\\ \;\;\;\;x \cdot \left(2 \cdot \frac{y}{x - y}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (* x 2.0) y) (- x y))))
   (if (or (<= t_0 -4e-20)
           (and (not (<= t_0 -2e-296))
                (or (<= t_0 0.0) (not (<= t_0 2e+129)))))
     (* x (* 2.0 (/ y (- x y))))
     t_0)))

C

double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double tmp;
	if ((t_0 <= -4e-20) || (!(t_0 <= -2e-296) && ((t_0 <= 0.0) || !(t_0 <= 2e+129)))) {
		tmp = x * (2.0 * (y / (x - 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 = ((x * 2.0d0) * y) / (x - y)
    if ((t_0 <= (-4d-20)) .or. (.not. (t_0 <= (-2d-296))) .and. (t_0 <= 0.0d0) .or. (.not. (t_0 <= 2d+129))) then
        tmp = x * (2.0d0 * (y / (x - y)))
    else
        tmp = t_0
    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 tmp;
	if ((t_0 <= -4e-20) || (!(t_0 <= -2e-296) && ((t_0 <= 0.0) || !(t_0 <= 2e+129)))) {
		tmp = x * (2.0 * (y / (x - y)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x * 2.0) * y) / (x - y)
	tmp = 0
	if (t_0 <= -4e-20) or (not (t_0 <= -2e-296) and ((t_0 <= 0.0) or not (t_0 <= 2e+129))):
		tmp = x * (2.0 * (y / (x - y)))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x * 2.0) * y) / Float64(x - y))
	tmp = 0.0
	if ((t_0 <= -4e-20) || (!(t_0 <= -2e-296) && ((t_0 <= 0.0) || !(t_0 <= 2e+129))))
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((x * 2.0) * y) / (x - y);
	tmp = 0.0;
	if ((t_0 <= -4e-20) || (~((t_0 <= -2e-296)) && ((t_0 <= 0.0) || ~((t_0 <= 2e+129)))))
		tmp = x * (2.0 * (y / (x - y)));
	else
		tmp = t_0;
	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]}, If[Or[LessEqual[t$95$0, -4e-20], And[N[Not[LessEqual[t$95$0, -2e-296]], $MachinePrecision], Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, 2e+129]], $MachinePrecision]]]], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (*.f64 x 2) y) (-.f64 x y)) < -3.99999999999999978e-20 or -2e-296 < (/.f64 (*.f64 (*.f64 x 2) y) (-.f64 x y)) < 0.0 or 2e129 < (/.f64 (*.f64 (*.f64 x 2) y) (-.f64 x y))

   1. Initial program 29.2%

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

      1. associate-/l* 97.6%

         \[\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

   if -3.99999999999999978e-20 < (/.f64 (*.f64 (*.f64 x 2) y) (-.f64 x y)) < -2e-296 or 0.0 < (/.f64 (*.f64 (*.f64 x 2) y) (-.f64 x y)) < 2e129

   1. Initial program 98.7%

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

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq -4 \cdot 10^{-20} \lor \neg \left(\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq -2 \cdot 10^{-296}\right) \land \left(\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq 0 \lor \neg \left(\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq 2 \cdot 10^{+129}\right)\right):\\ \;\;\;\;x \cdot \left(2 \cdot \frac{y}{x - y}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 94.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{-202} \lor \neg \left(y \leq 4.8 \cdot 10^{-157}\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 -7e-202) (not (<= y 4.8e-157)))
   (* x (* 2.0 (/ y (- x y))))
   (* 2.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -7e-202) || !(y <= 4.8e-157)) {
		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 <= (-7d-202)) .or. (.not. (y <= 4.8d-157))) 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 <= -7e-202) || !(y <= 4.8e-157)) {
		tmp = x * (2.0 * (y / (x - y)));
	} else {
		tmp = 2.0 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -7e-202) or not (y <= 4.8e-157):
		tmp = x * (2.0 * (y / (x - y)))
	else:
		tmp = 2.0 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -7e-202) || !(y <= 4.8e-157))
		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 <= -7e-202) || ~((y <= 4.8e-157)))
		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, -7e-202], N[Not[LessEqual[y, 4.8e-157]], $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 < -6.9999999999999998e-202 or 4.8e-157 < y

   1. Initial program 77.8%

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

      1. associate-/l* 94.5%

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

      2. associate-*l* 95.4%

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

   3. Simplified 95.4%

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

   if -6.9999999999999998e-202 < y < 4.8e-157

   1. Initial program 71.4%

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

      1. associate-/l* 59.7%

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

      2. associate-*l* 59.7%

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

   3. Simplified 59.7%

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

   5. Taylor expanded in x around inf 93.7%

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

4. Final simplification 95.1%

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

Alternative 3: 74.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-23} \lor \neg \left(x \leq 3.4 \cdot 10^{-40}\right):\\ \;\;\;\;2 \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.2e-23) (not (<= x 3.4e-40))) (* 2.0 y) (* x -2.0)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.2e-23) || !(x <= 3.4e-40)) {
		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 <= (-2.2d-23)) .or. (.not. (x <= 3.4d-40))) 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 <= -2.2e-23) || !(x <= 3.4e-40)) {
		tmp = 2.0 * y;
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.2e-23) or not (x <= 3.4e-40):
		tmp = 2.0 * y
	else:
		tmp = x * -2.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.2e-23) || !(x <= 3.4e-40))
		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 <= -2.2e-23) || ~((x <= 3.4e-40)))
		tmp = 2.0 * y;
	else
		tmp = x * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.2e-23], N[Not[LessEqual[x, 3.4e-40]], $MachinePrecision]], N[(2.0 * y), $MachinePrecision], N[(x * -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.1999999999999999e-23 or 3.39999999999999984e-40 < x

   1. Initial program 76.9%

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

      1. associate-/l* 77.4%

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

      2. associate-*l* 78.7%

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

   3. Simplified 78.7%

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

   5. Taylor expanded in x around inf 77.1%

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

   if -2.1999999999999999e-23 < x < 3.39999999999999984e-40

   1. Initial program 75.9%

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

      1. associate-/l* 100.0%

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

      2. associate-*l* 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 84.8%

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

4. Final simplification 80.5%

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

Alternative 4: 51.0% 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 76.5%

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

   1. associate-/l* 87.3%

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

   2. associate-*l* 88.0%

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

3. Simplified 88.0%

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

5. Taylor expanded in x around 0 50.8%

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

6. Final simplification 50.8%

   \[\leadsto x \cdot -2 \]
7. Add Preprocessing

Developer target: 99.4% 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 2024039 
(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)))