Diagrams.TwoD.Arc:arcBetween from diagrams-lib-1.3.0.3

Percentage Accurate: 51.0% → 81.2%

Time: 5.3s

Alternatives: 7

Speedup: 2.6×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot 4\right) \cdot y\\ \frac{x \cdot x - t_0}{x \cdot x + t_0} \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* y 4.0) y))) (/ (- (* x x) t_0) (+ (* x x) t_0))))

C

double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}

Fortran

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

Java

public static double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}

Python

def code(x, y):
	t_0 = (y * 4.0) * y
	return ((x * x) - t_0) / ((x * x) + t_0)

Julia

function code(x, y)
	t_0 = Float64(Float64(y * 4.0) * y)
	return Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0))
end

MATLAB

function tmp = code(x, y)
	t_0 = (y * 4.0) * y;
	tmp = ((x * x) - t_0) / ((x * x) + t_0);
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]

Initial Program: 51.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot 4\right) \cdot y\\ \frac{x \cdot x - t_0}{x \cdot x + t_0} \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* y 4.0) y))) (/ (- (* x x) t_0) (+ (* x x) t_0))))

C

double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}

Fortran

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

Java

public static double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}

Python

def code(x, y):
	t_0 = (y * 4.0) * y
	return ((x * x) - t_0) / ((x * x) + t_0)

Julia

function code(x, y)
	t_0 = Float64(Float64(y * 4.0) * y)
	return Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0))
end

MATLAB

function tmp = code(x, y)
	t_0 = (y * 4.0) * y;
	tmp = ((x * x) - t_0) / ((x * x) + t_0);
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 81.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;x \leq 6.2 \cdot 10^{-153}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{x}{y} \cdot \frac{x}{y}, -1\right)\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+116}:\\ \;\;\;\;\frac{x \cdot x - t_0}{x \cdot x + t_0}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{x} \cdot \frac{y}{x}, -8, 1\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= x 6.2e-153)
     (fma 0.5 (* (/ x y) (/ x y)) -1.0)
     (if (<= x 5.5e+116)
       (/ (- (* x x) t_0) (+ (* x x) t_0))
       (fma (* (/ y x) (/ y x)) -8.0 1.0)))))

C

x = abs(x);
double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if (x <= 6.2e-153) {
		tmp = fma(0.5, ((x / y) * (x / y)), -1.0);
	} else if (x <= 5.5e+116) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = fma(((y / x) * (y / x)), -8.0, 1.0);
	}
	return tmp;
}

Julia

x = abs(x)
function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (x <= 6.2e-153)
		tmp = fma(0.5, Float64(Float64(x / y) * Float64(x / y)), -1.0);
	elseif (x <= 5.5e+116)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0));
	else
		tmp = fma(Float64(Float64(y / x) * Float64(y / x)), -8.0, 1.0);
	end
	return tmp
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 6.2e-153], N[(0.5 * N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], If[LessEqual[x, 5.5e+116], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / x), $MachinePrecision] * N[(y / x), $MachinePrecision]), $MachinePrecision] * -8.0 + 1.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < 6.1999999999999999e-153

   1. Initial program 51.9%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 47.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{{x}^{2}}{{y}^{2}} - 1} \]
   3. Step-by-step derivation

      1. fma-neg 47.4%

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

      2. unpow2 47.4%

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

      3. unpow2 47.4%

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

      4. times-frac 60.7%

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

      5. metadata-eval 60.7%

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

   4. Simplified 60.7%

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

   if 6.1999999999999999e-153 < x < 5.50000000000000035e116

   1. Initial program 81.8%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   if 5.50000000000000035e116 < x

   1. Initial program 11.6%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 81.5%

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

      1. associate--l+ 81.5%

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

      2. distribute-rgt-out-- 81.5%

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

      3. metadata-eval 81.5%

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

      4. *-commutative 81.5%

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

      5. +-commutative 81.5%

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

      6. *-commutative 81.5%

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

      7. fma-def 81.5%

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

      8. unpow2 81.5%

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

      9. unpow2 81.5%

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

      10. times-frac 86.8%

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

   4. Simplified 86.8%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 6.2 \cdot 10^{-153}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{x}{y} \cdot \frac{x}{y}, -1\right)\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+116}:\\ \;\;\;\;\frac{x \cdot x - y \cdot \left(y \cdot 4\right)}{x \cdot x + y \cdot \left(y \cdot 4\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{x} \cdot \frac{y}{x}, -8, 1\right)\\ \end{array} \]

Alternative 2: 81.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;x \leq 1.5 \cdot 10^{-152}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{x}{y} \cdot \frac{x}{y}, -1\right)\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+116}:\\ \;\;\;\;\frac{x \cdot x - t_0}{x \cdot x + t_0}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= x 1.5e-152)
     (fma 0.5 (* (/ x y) (/ x y)) -1.0)
     (if (<= x 8.8e+116)
       (/ (- (* x x) t_0) (+ (* x x) t_0))
       (+ 1.0 (* -4.0 (/ (/ y x) (/ x y))))))))

C

x = abs(x);
double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if (x <= 1.5e-152) {
		tmp = fma(0.5, ((x / y) * (x / y)), -1.0);
	} else if (x <= 8.8e+116) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	}
	return tmp;
}

Julia

x = abs(x)
function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (x <= 1.5e-152)
		tmp = fma(0.5, Float64(Float64(x / y) * Float64(x / y)), -1.0);
	elseif (x <= 8.8e+116)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0));
	else
		tmp = Float64(1.0 + Float64(-4.0 * Float64(Float64(y / x) / Float64(x / y))));
	end
	return tmp
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.5e-152], N[(0.5 * N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], If[LessEqual[x, 8.8e+116], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-4.0 * N[(N[(y / x), $MachinePrecision] / N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < 1.5e-152

   1. Initial program 51.9%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 47.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{{x}^{2}}{{y}^{2}} - 1} \]
   3. Step-by-step derivation

      1. fma-neg 47.4%

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

      2. unpow2 47.4%

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

      3. unpow2 47.4%

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

      4. times-frac 60.7%

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

      5. metadata-eval 60.7%

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

   4. Simplified 60.7%

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

   if 1.5e-152 < x < 8.799999999999999e116

   1. Initial program 81.8%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   if 8.799999999999999e116 < x

   1. Initial program 11.6%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 11.7%

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

      1. unpow2 11.7%

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

   4. Simplified 11.7%

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

   5. Taylor expanded in x around inf 81.5%

      \[\leadsto \color{blue}{1 + -4 \cdot \frac{{y}^{2}}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. unpow2 81.5%

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

      2. unpow2 81.5%

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

      3. times-frac 86.8%

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

      4. unpow2 86.8%

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

   7. Simplified 86.8%

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

      1. unpow2 86.8%

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

      2. clear-num 86.8%

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

      3. un-div-inv 86.8%

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

   9. Applied egg-rr 86.8%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.5 \cdot 10^{-152}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{x}{y} \cdot \frac{x}{y}, -1\right)\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+116}:\\ \;\;\;\;\frac{x \cdot x - y \cdot \left(y \cdot 4\right)}{x \cdot x + y \cdot \left(y \cdot 4\right)}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \]

Alternative 3: 81.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;x \cdot x \leq 5 \cdot 10^{-305}:\\ \;\;\;\;-1 + \frac{\frac{\frac{x}{y}}{\frac{y}{x}}}{4}\\ \mathbf{elif}\;x \cdot x \leq 10^{+231}:\\ \;\;\;\;\frac{x \cdot x - t_0}{x \cdot x + t_0}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= (* x x) 5e-305)
     (+ -1.0 (/ (/ (/ x y) (/ y x)) 4.0))
     (if (<= (* x x) 1e+231)
       (/ (- (* x x) t_0) (+ (* x x) t_0))
       (+ 1.0 (* -4.0 (/ (/ y x) (/ x y))))))))

C

x = abs(x);
double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((x * x) <= 5e-305) {
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	} else if ((x * x) <= 1e+231) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	}
	return tmp;
}

Fortran

NOTE: x should be positive before calling this function
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 = y * (y * 4.0d0)
    if ((x * x) <= 5d-305) then
        tmp = (-1.0d0) + (((x / y) / (y / x)) / 4.0d0)
    else if ((x * x) <= 1d+231) then
        tmp = ((x * x) - t_0) / ((x * x) + t_0)
    else
        tmp = 1.0d0 + ((-4.0d0) * ((y / x) / (x / y)))
    end if
    code = tmp
end function

Java

x = Math.abs(x);
public static double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((x * x) <= 5e-305) {
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	} else if ((x * x) <= 1e+231) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	}
	return tmp;
}

Python

x = abs(x)
def code(x, y):
	t_0 = y * (y * 4.0)
	tmp = 0
	if (x * x) <= 5e-305:
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0)
	elif (x * x) <= 1e+231:
		tmp = ((x * x) - t_0) / ((x * x) + t_0)
	else:
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)))
	return tmp

Julia

x = abs(x)
function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (Float64(x * x) <= 5e-305)
		tmp = Float64(-1.0 + Float64(Float64(Float64(x / y) / Float64(y / x)) / 4.0));
	elseif (Float64(x * x) <= 1e+231)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0));
	else
		tmp = Float64(1.0 + Float64(-4.0 * Float64(Float64(y / x) / Float64(x / y))));
	end
	return tmp
end

MATLAB

x = abs(x)
function tmp_2 = code(x, y)
	t_0 = y * (y * 4.0);
	tmp = 0.0;
	if ((x * x) <= 5e-305)
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	elseif ((x * x) <= 1e+231)
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	else
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * x), $MachinePrecision], 5e-305], N[(-1.0 + N[(N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * x), $MachinePrecision], 1e+231], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-4.0 * N[(N[(y / x), $MachinePrecision] / N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x x) < 4.99999999999999985e-305

   1. Initial program 52.9%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 52.9%

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

      1. *-commutative 52.9%

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

      2. unpow2 52.9%

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

      3. associate-*r* 52.9%

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

   4. Simplified 52.9%

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

      1. div-sub 52.9%

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

      2. associate-*r* 52.9%

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

      3. associate-/r* 52.9%

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

      4. frac-times 52.9%

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

      5. pow2 52.9%

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

      6. *-commutative 52.9%

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

      7. *-inverses 89.9%

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

   6. Applied egg-rr 89.9%

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

      1. unpow2 89.9%

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

      2. clear-num 89.9%

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

      3. un-div-inv 89.9%

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

   8. Applied egg-rr 89.9%

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

   if 4.99999999999999985e-305 < (*.f64 x x) < 1.0000000000000001e231

   1. Initial program 84.5%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   if 1.0000000000000001e231 < (*.f64 x x)

   1. Initial program 9.6%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 9.7%

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

      1. unpow2 9.7%

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

   4. Simplified 9.7%

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

   5. Taylor expanded in x around inf 74.8%

      \[\leadsto \color{blue}{1 + -4 \cdot \frac{{y}^{2}}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. unpow2 74.8%

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

      2. unpow2 74.8%

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

      3. times-frac 82.5%

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

      4. unpow2 82.5%

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

   7. Simplified 82.5%

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

      1. unpow2 82.5%

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

      2. clear-num 82.5%

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

      3. un-div-inv 82.5%

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

   9. Applied egg-rr 82.5%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 5 \cdot 10^{-305}:\\ \;\;\;\;-1 + \frac{\frac{\frac{x}{y}}{\frac{y}{x}}}{4}\\ \mathbf{elif}\;x \cdot x \leq 10^{+231}:\\ \;\;\;\;\frac{x \cdot x - y \cdot \left(y \cdot 4\right)}{x \cdot x + y \cdot \left(y \cdot 4\right)}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \]

Alternative 4: 73.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2 \cdot 10^{-201} \lor \neg \left(x \cdot x \leq 5 \cdot 10^{-26}\right) \land x \cdot x \leq 5 \cdot 10^{+41}:\\ \;\;\;\;-1 + \frac{\frac{\frac{x}{y}}{\frac{y}{x}}}{4}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (if (or (<= (* x x) 2e-201) (and (not (<= (* x x) 5e-26)) (<= (* x x) 5e+41)))
   (+ -1.0 (/ (/ (/ x y) (/ y x)) 4.0))
   (+ 1.0 (* -4.0 (/ (/ y x) (/ x y))))))

C

x = abs(x);
double code(double x, double y) {
	double tmp;
	if (((x * x) <= 2e-201) || (!((x * x) <= 5e-26) && ((x * x) <= 5e+41))) {
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	} else {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	}
	return tmp;
}

Fortran

NOTE: x should be positive before calling this function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x * x) <= 2d-201) .or. (.not. ((x * x) <= 5d-26)) .and. ((x * x) <= 5d+41)) then
        tmp = (-1.0d0) + (((x / y) / (y / x)) / 4.0d0)
    else
        tmp = 1.0d0 + ((-4.0d0) * ((y / x) / (x / y)))
    end if
    code = tmp
end function

Java

x = Math.abs(x);
public static double code(double x, double y) {
	double tmp;
	if (((x * x) <= 2e-201) || (!((x * x) <= 5e-26) && ((x * x) <= 5e+41))) {
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	} else {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	}
	return tmp;
}

Python

x = abs(x)
def code(x, y):
	tmp = 0
	if ((x * x) <= 2e-201) or (not ((x * x) <= 5e-26) and ((x * x) <= 5e+41)):
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0)
	else:
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)))
	return tmp

Julia

x = abs(x)
function code(x, y)
	tmp = 0.0
	if ((Float64(x * x) <= 2e-201) || (!(Float64(x * x) <= 5e-26) && (Float64(x * x) <= 5e+41)))
		tmp = Float64(-1.0 + Float64(Float64(Float64(x / y) / Float64(y / x)) / 4.0));
	else
		tmp = Float64(1.0 + Float64(-4.0 * Float64(Float64(y / x) / Float64(x / y))));
	end
	return tmp
end

MATLAB

x = abs(x)
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x * x) <= 2e-201) || (~(((x * x) <= 5e-26)) && ((x * x) <= 5e+41)))
		tmp = -1.0 + (((x / y) / (y / x)) / 4.0);
	else
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := If[Or[LessEqual[N[(x * x), $MachinePrecision], 2e-201], And[N[Not[LessEqual[N[(x * x), $MachinePrecision], 5e-26]], $MachinePrecision], LessEqual[N[(x * x), $MachinePrecision], 5e+41]]], N[(-1.0 + N[(N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-4.0 * N[(N[(y / x), $MachinePrecision] / N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 1.99999999999999989e-201 or 5.00000000000000019e-26 < (*.f64 x x) < 5.00000000000000022e41

   1. Initial program 60.0%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 49.1%

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

      1. *-commutative 49.1%

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

      2. unpow2 49.1%

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

      3. associate-*r* 49.1%

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

   4. Simplified 49.1%

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

      1. div-sub 48.8%

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

      2. associate-*r* 48.8%

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

      3. associate-/r* 48.8%

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

      4. frac-times 48.8%

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

      5. pow2 48.8%

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

      6. *-commutative 48.8%

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

      7. *-inverses 82.5%

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

   6. Applied egg-rr 82.5%

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

      1. unpow2 82.5%

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

      2. clear-num 82.5%

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

      3. un-div-inv 82.5%

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

   8. Applied egg-rr 82.5%

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

   if 1.99999999999999989e-201 < (*.f64 x x) < 5.00000000000000019e-26 or 5.00000000000000022e41 < (*.f64 x x)

   1. Initial program 45.7%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 35.5%

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

      1. unpow2 35.5%

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

   4. Simplified 35.5%

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

   5. Taylor expanded in x around inf 71.6%

      \[\leadsto \color{blue}{1 + -4 \cdot \frac{{y}^{2}}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. unpow2 71.6%

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

      2. unpow2 71.6%

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

      3. times-frac 75.9%

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

      4. unpow2 75.9%

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

   7. Simplified 75.9%

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

      1. unpow2 75.9%

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

      2. clear-num 75.9%

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

      3. un-div-inv 75.9%

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

   9. Applied egg-rr 75.9%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2 \cdot 10^{-201} \lor \neg \left(x \cdot x \leq 5 \cdot 10^{-26}\right) \land x \cdot x \leq 5 \cdot 10^{+41}:\\ \;\;\;\;-1 + \frac{\frac{\frac{x}{y}}{\frac{y}{x}}}{4}\\ \mathbf{else}:\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \end{array} \]

Alternative 5: 72.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-102}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 3.5 \cdot 10^{-13} \lor \neg \left(x \leq 5.4 \cdot 10^{+20}\right):\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (if (<= x 2e-102)
   -1.0
   (if (or (<= x 3.5e-13) (not (<= x 5.4e+20)))
     (+ 1.0 (* -4.0 (/ (/ y x) (/ x y))))
     -1.0)))

C

x = abs(x);
double code(double x, double y) {
	double tmp;
	if (x <= 2e-102) {
		tmp = -1.0;
	} else if ((x <= 3.5e-13) || !(x <= 5.4e+20)) {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

NOTE: x should be positive before calling this function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= 2d-102) then
        tmp = -1.0d0
    else if ((x <= 3.5d-13) .or. (.not. (x <= 5.4d+20))) then
        tmp = 1.0d0 + ((-4.0d0) * ((y / x) / (x / y)))
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

x = Math.abs(x);
public static double code(double x, double y) {
	double tmp;
	if (x <= 2e-102) {
		tmp = -1.0;
	} else if ((x <= 3.5e-13) || !(x <= 5.4e+20)) {
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

x = abs(x)
def code(x, y):
	tmp = 0
	if x <= 2e-102:
		tmp = -1.0
	elif (x <= 3.5e-13) or not (x <= 5.4e+20):
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)))
	else:
		tmp = -1.0
	return tmp

Julia

x = abs(x)
function code(x, y)
	tmp = 0.0
	if (x <= 2e-102)
		tmp = -1.0;
	elseif ((x <= 3.5e-13) || !(x <= 5.4e+20))
		tmp = Float64(1.0 + Float64(-4.0 * Float64(Float64(y / x) / Float64(x / y))));
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

x = abs(x)
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 2e-102)
		tmp = -1.0;
	elseif ((x <= 3.5e-13) || ~((x <= 5.4e+20)))
		tmp = 1.0 + (-4.0 * ((y / x) / (x / y)));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := If[LessEqual[x, 2e-102], -1.0, If[Or[LessEqual[x, 3.5e-13], N[Not[LessEqual[x, 5.4e+20]], $MachinePrecision]], N[(1.0 + N[(-4.0 * N[(N[(y / x), $MachinePrecision] / N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]

Derivation

1. Split input into 2 regimes

2. if x < 1.99999999999999987e-102 or 3.5000000000000002e-13 < x < 5.4e20

   1. Initial program 53.7%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 59.2%

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

   if 1.99999999999999987e-102 < x < 3.5000000000000002e-13 or 5.4e20 < x

   1. Initial program 47.0%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 35.5%

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

      1. unpow2 35.5%

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

   4. Simplified 35.5%

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

   5. Taylor expanded in x around inf 71.9%

      \[\leadsto \color{blue}{1 + -4 \cdot \frac{{y}^{2}}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. unpow2 71.9%

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

      2. unpow2 71.9%

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

      3. times-frac 74.7%

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

      4. unpow2 74.7%

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

   7. Simplified 74.7%

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

      1. unpow2 74.7%

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

      2. clear-num 74.7%

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

      3. un-div-inv 74.7%

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

   9. Applied egg-rr 74.7%

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

4. Final simplification 64.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-102}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 3.5 \cdot 10^{-13} \lor \neg \left(x \leq 5.4 \cdot 10^{+20}\right):\\ \;\;\;\;1 + -4 \cdot \frac{\frac{y}{x}}{\frac{x}{y}}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 6: 72.4% accurate, 2.6× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ \begin{array}{l} \mathbf{if}\;x \leq 1.5 \cdot 10^{-99}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 5 \cdot 10^{-16}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 10^{+21}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y)
 :precision binary64
 (if (<= x 1.5e-99) -1.0 (if (<= x 5e-16) 1.0 (if (<= x 1e+21) -1.0 1.0))))

C

x = abs(x);
double code(double x, double y) {
	double tmp;
	if (x <= 1.5e-99) {
		tmp = -1.0;
	} else if (x <= 5e-16) {
		tmp = 1.0;
	} else if (x <= 1e+21) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

NOTE: x should be positive before calling this function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= 1.5d-99) then
        tmp = -1.0d0
    else if (x <= 5d-16) then
        tmp = 1.0d0
    else if (x <= 1d+21) then
        tmp = -1.0d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

x = Math.abs(x);
public static double code(double x, double y) {
	double tmp;
	if (x <= 1.5e-99) {
		tmp = -1.0;
	} else if (x <= 5e-16) {
		tmp = 1.0;
	} else if (x <= 1e+21) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

x = abs(x)
def code(x, y):
	tmp = 0
	if x <= 1.5e-99:
		tmp = -1.0
	elif x <= 5e-16:
		tmp = 1.0
	elif x <= 1e+21:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

x = abs(x)
function code(x, y)
	tmp = 0.0
	if (x <= 1.5e-99)
		tmp = -1.0;
	elseif (x <= 5e-16)
		tmp = 1.0;
	elseif (x <= 1e+21)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

x = abs(x)
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 1.5e-99)
		tmp = -1.0;
	elseif (x <= 5e-16)
		tmp = 1.0;
	elseif (x <= 1e+21)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := If[LessEqual[x, 1.5e-99], -1.0, If[LessEqual[x, 5e-16], 1.0, If[LessEqual[x, 1e+21], -1.0, 1.0]]]

Derivation

1. Split input into 2 regimes

2. if x < 1.50000000000000003e-99 or 5.0000000000000004e-16 < x < 1e21

   1. Initial program 54.0%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around 0 59.4%

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

   if 1.50000000000000003e-99 < x < 5.0000000000000004e-16 or 1e21 < x

   1. Initial program 46.3%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

   2. Taylor expanded in x around inf 75.4%

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

4. Final simplification 64.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.5 \cdot 10^{-99}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 5 \cdot 10^{-16}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 10^{+21}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 7: 50.8% accurate, 19.0× speedup

Math

\[\begin{array}{l} x = |x|\\ \\ -1 \end{array} \]

FPCore

NOTE: x should be positive before calling this function
(FPCore (x y) :precision binary64 -1.0)

C

x = abs(x);
double code(double x, double y) {
	return -1.0;
}

Fortran

NOTE: x should be positive before calling this function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = -1.0d0
end function

Java

x = Math.abs(x);
public static double code(double x, double y) {
	return -1.0;
}

Python

x = abs(x)
def code(x, y):
	return -1.0

Julia

x = abs(x)
function code(x, y)
	return -1.0
end

MATLAB

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

Wolfram

NOTE: x should be positive before calling this function
code[x_, y_] := -1.0

Derivation

1. Initial program 51.6%

   \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]

2. Taylor expanded in x around 0 49.0%

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

3. Final simplification 49.0%

   \[\leadsto -1 \]

Developer target: 51.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot y\right) \cdot 4\\ t_1 := x \cdot x + t_0\\ t_2 := \frac{t_0}{t_1}\\ t_3 := \left(y \cdot 4\right) \cdot y\\ \mathbf{if}\;\frac{x \cdot x - t_3}{x \cdot x + t_3} < 0.9743233849626781:\\ \;\;\;\;\frac{x \cdot x}{t_1} - t_2\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{x}{\sqrt{t_1}}\right)}^{2} - t_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* y y) 4.0))
        (t_1 (+ (* x x) t_0))
        (t_2 (/ t_0 t_1))
        (t_3 (* (* y 4.0) y)))
   (if (< (/ (- (* x x) t_3) (+ (* x x) t_3)) 0.9743233849626781)
     (- (/ (* x x) t_1) t_2)
     (- (pow (/ x (sqrt t_1)) 2.0) t_2))))

C

double code(double x, double y) {
	double t_0 = (y * y) * 4.0;
	double t_1 = (x * x) + t_0;
	double t_2 = t_0 / t_1;
	double t_3 = (y * 4.0) * y;
	double tmp;
	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781) {
		tmp = ((x * x) / t_1) - t_2;
	} else {
		tmp = pow((x / sqrt(t_1)), 2.0) - t_2;
	}
	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) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (y * y) * 4.0d0
    t_1 = (x * x) + t_0
    t_2 = t_0 / t_1
    t_3 = (y * 4.0d0) * y
    if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781d0) then
        tmp = ((x * x) / t_1) - t_2
    else
        tmp = ((x / sqrt(t_1)) ** 2.0d0) - t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y * y) * 4.0;
	double t_1 = (x * x) + t_0;
	double t_2 = t_0 / t_1;
	double t_3 = (y * 4.0) * y;
	double tmp;
	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781) {
		tmp = ((x * x) / t_1) - t_2;
	} else {
		tmp = Math.pow((x / Math.sqrt(t_1)), 2.0) - t_2;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y * y) * 4.0
	t_1 = (x * x) + t_0
	t_2 = t_0 / t_1
	t_3 = (y * 4.0) * y
	tmp = 0
	if (((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781:
		tmp = ((x * x) / t_1) - t_2
	else:
		tmp = math.pow((x / math.sqrt(t_1)), 2.0) - t_2
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y * y) * 4.0)
	t_1 = Float64(Float64(x * x) + t_0)
	t_2 = Float64(t_0 / t_1)
	t_3 = Float64(Float64(y * 4.0) * y)
	tmp = 0.0
	if (Float64(Float64(Float64(x * x) - t_3) / Float64(Float64(x * x) + t_3)) < 0.9743233849626781)
		tmp = Float64(Float64(Float64(x * x) / t_1) - t_2);
	else
		tmp = Float64((Float64(x / sqrt(t_1)) ^ 2.0) - t_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y * y) * 4.0;
	t_1 = (x * x) + t_0;
	t_2 = t_0 / t_1;
	t_3 = (y * 4.0) * y;
	tmp = 0.0;
	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781)
		tmp = ((x * x) / t_1) - t_2;
	else
		tmp = ((x / sqrt(t_1)) ^ 2.0) - t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y * y), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, If[Less[N[(N[(N[(x * x), $MachinePrecision] - t$95$3), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision], 0.9743233849626781], N[(N[(N[(x * x), $MachinePrecision] / t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[Power[N[(x / N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]

Reproduce

herbie shell --seed 2023230 
(FPCore (x y)
  :name "Diagrams.TwoD.Arc:arcBetween from diagrams-lib-1.3.0.3"
  :precision binary64

  :herbie-target
  (if (< (/ (- (* x x) (* (* y 4.0) y)) (+ (* x x) (* (* y 4.0) y))) 0.9743233849626781) (- (/ (* x x) (+ (* x x) (* (* y y) 4.0))) (/ (* (* y y) 4.0) (+ (* x x) (* (* y y) 4.0)))) (- (pow (/ x (sqrt (+ (* x x) (* (* y y) 4.0)))) 2.0) (/ (* (* y y) 4.0) (+ (* x x) (* (* y y) 4.0)))))

  (/ (- (* x x) (* (* y 4.0) y)) (+ (* x x) (* (* y 4.0) y))))