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

Percentage Accurate: 50.7% → 81.2%

Time: 10.8s

Alternatives: 5

Speedup: 19.0×

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: 50.7% 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.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;x \cdot x \leq 10^{-268}:\\ \;\;\;\;\mathsf{fma}\left(e^{\mathsf{log1p}\left({\left(\sqrt[3]{\mathsf{fma}\left(0.5, {\left(\frac{y}{x}\right)}^{-2}, 1\right)}\right)}^{2}\right)} + -1, \sqrt[3]{\mathsf{fma}\left({\left(\frac{x}{y}\right)}^{2}, 0.5, 1\right)}, -1\right) + -1\\ \mathbf{elif}\;x \cdot x \leq 10^{+275}:\\ \;\;\;\;\frac{x \cdot x - t\_0}{x \cdot x + t\_0}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= (* x x) 1e-268)
     (+
      (fma
       (+ (exp (log1p (pow (cbrt (fma 0.5 (pow (/ y x) -2.0) 1.0)) 2.0))) -1.0)
       (cbrt (fma (pow (/ x y) 2.0) 0.5 1.0))
       -1.0)
      -1.0)
     (if (<= (* x x) 1e+275) (/ (- (* x x) t_0) (+ (* x x) t_0)) 1.0))))

C

double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((x * x) <= 1e-268) {
		tmp = fma((exp(log1p(pow(cbrt(fma(0.5, pow((y / x), -2.0), 1.0)), 2.0))) + -1.0), cbrt(fma(pow((x / y), 2.0), 0.5, 1.0)), -1.0) + -1.0;
	} else if ((x * x) <= 1e+275) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (Float64(x * x) <= 1e-268)
		tmp = Float64(fma(Float64(exp(log1p((cbrt(fma(0.5, (Float64(y / x) ^ -2.0), 1.0)) ^ 2.0))) + -1.0), cbrt(fma((Float64(x / y) ^ 2.0), 0.5, 1.0)), -1.0) + -1.0);
	elseif (Float64(x * x) <= 1e+275)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0));
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * x), $MachinePrecision], 1e-268], N[(N[(N[(N[Exp[N[Log[1 + N[Power[N[Power[N[(0.5 * N[Power[N[(y / x), $MachinePrecision], -2.0], $MachinePrecision] + 1.0), $MachinePrecision], 1/3], $MachinePrecision], 2.0], $MachinePrecision]], $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision] * N[Power[N[(N[Power[N[(x / y), $MachinePrecision], 2.0], $MachinePrecision] * 0.5 + 1.0), $MachinePrecision], 1/3], $MachinePrecision] + -1.0), $MachinePrecision] + -1.0), $MachinePrecision], If[LessEqual[N[(x * x), $MachinePrecision], 1e+275], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x x) < 9.99999999999999958e-269

   1. Initial program 42.4%

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

   3. Taylor expanded in x around 0 84.8%

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

      1. expm1-log1p-u 84.8%

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

      2. expm1-undefine 84.8%

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

      3. log1p-undefine 84.8%

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

      4. +-commutative 84.8%

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

      5. add-exp-log 84.8%

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

      6. add-cube-cbrt 84.8%

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

      7. fma-neg 84.8%

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

   5. Applied egg-rr 95.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt[3]{\mathsf{fma}\left({\left(\frac{x}{y}\right)}^{2}, 0.5, 1\right)} \cdot \sqrt[3]{\mathsf{fma}\left({\left(\frac{x}{y}\right)}^{2}, 0.5, 1\right)}, \sqrt[3]{\mathsf{fma}\left({\left(\frac{x}{y}\right)}^{2}, 0.5, 1\right)}, -1\right)} - 1 \]
   6. Step-by-step derivation

      1. expm1-log1p-u 95.1%

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

      2. expm1-undefine 95.1%

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

   7. Applied egg-rr 95.1%

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

   if 9.99999999999999958e-269 < (*.f64 x x) < 9.9999999999999996e274

   1. Initial program 83.6%

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

   if 9.9999999999999996e274 < (*.f64 x x)

   1. Initial program 7.0%

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

   3. Taylor expanded in x around inf 89.7%

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

4. Final simplification 88.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 10^{-268}:\\ \;\;\;\;\mathsf{fma}\left(e^{\mathsf{log1p}\left({\left(\sqrt[3]{\mathsf{fma}\left(0.5, {\left(\frac{y}{x}\right)}^{-2}, 1\right)}\right)}^{2}\right)} + -1, \sqrt[3]{\mathsf{fma}\left({\left(\frac{x}{y}\right)}^{2}, 0.5, 1\right)}, -1\right) + -1\\ \mathbf{elif}\;x \cdot x \leq 10^{+275}:\\ \;\;\;\;\frac{x \cdot x - y \cdot \left(y \cdot 4\right)}{x \cdot x + y \cdot \left(y \cdot 4\right)}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 81.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;x \cdot x \leq 10^{-268}:\\ \;\;\;\;0.5 \cdot \left(\frac{x}{y} \cdot \frac{x}{y}\right) + -1\\ \mathbf{elif}\;x \cdot x \leq 10^{+275}:\\ \;\;\;\;\frac{x \cdot x - t\_0}{x \cdot x + t\_0}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= (* x x) 1e-268)
     (+ (* 0.5 (* (/ x y) (/ x y))) -1.0)
     (if (<= (* x x) 1e+275) (/ (- (* x x) t_0) (+ (* x x) t_0)) 1.0))))

C

double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((x * x) <= 1e-268) {
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	} else if ((x * x) <= 1e+275) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y * (y * 4.0d0)
    if ((x * x) <= 1d-268) then
        tmp = (0.5d0 * ((x / y) * (x / y))) + (-1.0d0)
    else if ((x * x) <= 1d+275) then
        tmp = ((x * x) - t_0) / ((x * x) + t_0)
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((x * x) <= 1e-268) {
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	} else if ((x * x) <= 1e+275) {
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * (y * 4.0)
	tmp = 0
	if (x * x) <= 1e-268:
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0
	elif (x * x) <= 1e+275:
		tmp = ((x * x) - t_0) / ((x * x) + t_0)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (Float64(x * x) <= 1e-268)
		tmp = Float64(Float64(0.5 * Float64(Float64(x / y) * Float64(x / y))) + -1.0);
	elseif (Float64(x * x) <= 1e+275)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * (y * 4.0);
	tmp = 0.0;
	if ((x * x) <= 1e-268)
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	elseif ((x * x) <= 1e+275)
		tmp = ((x * x) - t_0) / ((x * x) + t_0);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * x), $MachinePrecision], 1e-268], N[(N[(0.5 * N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], If[LessEqual[N[(x * x), $MachinePrecision], 1e+275], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x x) < 9.99999999999999958e-269

   1. Initial program 42.4%

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

   3. Taylor expanded in x around 0 84.8%

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

      1. unpow2 84.8%

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

      2. unpow2 84.8%

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

      3. times-frac 95.1%

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

   5. Applied egg-rr 95.1%

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

   if 9.99999999999999958e-269 < (*.f64 x x) < 9.9999999999999996e274

   1. Initial program 83.6%

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

   if 9.9999999999999996e274 < (*.f64 x x)

   1. Initial program 7.0%

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

   3. Taylor expanded in x around inf 89.7%

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

4. Final simplification 88.6%

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

Alternative 3: 62.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 6.8 \cdot 10^{+39}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\frac{x}{y} \cdot \frac{x}{y}\right) + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 6.8e+39) 1.0 (+ (* 0.5 (* (/ x y) (/ x y))) -1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 6.8e+39) {
		tmp = 1.0;
	} else {
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 6.8d+39) then
        tmp = 1.0d0
    else
        tmp = (0.5d0 * ((x / y) * (x / y))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 6.8e+39) {
		tmp = 1.0;
	} else {
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 6.8e+39:
		tmp = 1.0
	else:
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 6.8e+39)
		tmp = 1.0;
	else
		tmp = Float64(Float64(0.5 * Float64(Float64(x / y) * Float64(x / y))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 6.8e+39)
		tmp = 1.0;
	else
		tmp = (0.5 * ((x / y) * (x / y))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 6.8e+39], 1.0, N[(N[(0.5 * N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 6.7999999999999998e39

   1. Initial program 50.7%

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

   3. Taylor expanded in x around inf 65.6%

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

   if 6.7999999999999998e39 < y

   1. Initial program 33.9%

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

   3. Taylor expanded in x around 0 79.6%

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

      1. unpow2 79.6%

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

      2. unpow2 79.6%

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

      3. times-frac 87.4%

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

   5. Applied egg-rr 87.4%

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

4. Final simplification 70.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 6.8 \cdot 10^{+39}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\frac{x}{y} \cdot \frac{x}{y}\right) + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 61.9% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.5 \cdot 10^{+63}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 7.5e+63) 1.0 -1.0))

C

double code(double x, double y) {
	double tmp;
	if (y <= 7.5e+63) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 7.5d+63) then
        tmp = 1.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 7.5e+63) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 7.5e+63:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 7.5e+63)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 7.5e+63)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 7.5e+63], 1.0, -1.0]

Derivation

1. Split input into 2 regimes

2. if y < 7.5000000000000005e63

   1. Initial program 51.4%

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

   3. Taylor expanded in x around inf 65.5%

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

   if 7.5000000000000005e63 < y

   1. Initial program 29.1%

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

   3. Taylor expanded in x around 0 91.6%

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

Alternative 5: 50.9% accurate, 19.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return -1.0

Julia

function code(x, y)
	return -1.0
end

MATLAB

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

Wolfram

code[x_, y_] := -1.0

Derivation

1. Initial program 47.2%

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

3. Taylor expanded in x around 0 46.0%

   \[\leadsto \color{blue}{-1} \]
4. Add Preprocessing

Developer Target 1: 51.1% 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 2024123 
(FPCore (x y)
  :name "Diagrams.TwoD.Arc:arcBetween from diagrams-lib-1.3.0.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (/ (- (* x x) (* (* y 4) y)) (+ (* x x) (* (* y 4) y))) 9743233849626781/10000000000000000) (- (/ (* x x) (+ (* x x) (* (* y y) 4))) (/ (* (* y y) 4) (+ (* x x) (* (* y y) 4)))) (- (pow (/ x (sqrt (+ (* x x) (* (* y y) 4)))) 2) (/ (* (* y y) 4) (+ (* x x) (* (* y y) 4))))))

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