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

Percentage Accurate: 49.1% → 78.8%

Time: 5.0s

Alternatives: 4

Speedup: 48.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: 49.1% 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: 78.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+172}:\\ \;\;\;\;\frac{x \cdot x - t\_0}{t\_0 + x \cdot x}\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+231}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, \frac{-8}{x \cdot x}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= t_0 0.0)
     1.0
     (if (<= t_0 2e+172)
       (/ (- (* x x) t_0) (+ t_0 (* x x)))
       (if (<= t_0 5e+231) (fma (* y y) (/ -8.0 (* x x)) 1.0) -1.0)))))

C

double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = 1.0;
	} else if (t_0 <= 2e+172) {
		tmp = ((x * x) - t_0) / (t_0 + (x * x));
	} else if (t_0 <= 5e+231) {
		tmp = fma((y * y), (-8.0 / (x * x)), 1.0);
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = 1.0;
	elseif (t_0 <= 2e+172)
		tmp = Float64(Float64(Float64(x * x) - t_0) / Float64(t_0 + Float64(x * x)));
	elseif (t_0 <= 5e+231)
		tmp = fma(Float64(y * y), Float64(-8.0 / Float64(x * x)), 1.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[t$95$0, 0.0], 1.0, If[LessEqual[t$95$0, 2e+172], N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(t$95$0 + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+231], N[(N[(y * y), $MachinePrecision] * N[(-8.0 / N[(x * x), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], -1.0]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 0.0

   1. Initial program 56.5%

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

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.0%

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

   if 0.0 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 2.0000000000000002e172

   1. Initial program 84.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

   if 2.0000000000000002e172 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 5.00000000000000028e231

   1. Initial program 40.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

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

      1. associate--l+ N/A

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

      2. distribute-rgt-out-- N/A

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

      3. metadata-eval N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. associate-*l/ N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. associate-*r/ N/A

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

      13. lower-fma.f64 N/A

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

   5. Applied rewrites 67.9%

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

   if 5.00000000000000028e231 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

   1. Initial program 15.5%

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

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 86.1%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 2 \cdot 10^{+172}:\\ \;\;\;\;\frac{x \cdot x - y \cdot \left(y \cdot 4\right)}{y \cdot \left(y \cdot 4\right) + x \cdot x}\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{+231}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, \frac{-8}{x \cdot x}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 78.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+172}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+231}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, \frac{-8}{x \cdot x}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= t_0 0.0)
     1.0
     (if (<= t_0 2e+172)
       (/ (fma x x (* (* y y) -4.0)) (fma y (* y 4.0) (* x x)))
       (if (<= t_0 5e+231) (fma (* y y) (/ -8.0 (* x x)) 1.0) -1.0)))))

C

double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = 1.0;
	} else if (t_0 <= 2e+172) {
		tmp = fma(x, x, ((y * y) * -4.0)) / fma(y, (y * 4.0), (x * x));
	} else if (t_0 <= 5e+231) {
		tmp = fma((y * y), (-8.0 / (x * x)), 1.0);
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = 1.0;
	elseif (t_0 <= 2e+172)
		tmp = Float64(fma(x, x, Float64(Float64(y * y) * -4.0)) / fma(y, Float64(y * 4.0), Float64(x * x)));
	elseif (t_0 <= 5e+231)
		tmp = fma(Float64(y * y), Float64(-8.0 / Float64(x * x)), 1.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[t$95$0, 0.0], 1.0, If[LessEqual[t$95$0, 2e+172], N[(N[(x * x + N[(N[(y * y), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / N[(y * N[(y * 4.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+231], N[(N[(y * y), $MachinePrecision] * N[(-8.0 / N[(x * x), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], -1.0]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 0.0

   1. Initial program 56.5%

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

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.0%

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

   if 0.0 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 2.0000000000000002e172

   1. Initial program 84.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. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*r* N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. metadata-eval 84.1

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

      13. lift-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 84.1

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

   4. Applied rewrites 84.1%

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

   if 2.0000000000000002e172 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 5.00000000000000028e231

   1. Initial program 40.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

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

      1. associate--l+ N/A

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

      2. distribute-rgt-out-- N/A

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

      3. metadata-eval N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. associate-*l/ N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. associate-*r/ N/A

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

      13. lower-fma.f64 N/A

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

   5. Applied rewrites 67.9%

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

   if 5.00000000000000028e231 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

   1. Initial program 15.5%

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

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 86.1%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 2 \cdot 10^{+172}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{+231}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, \frac{-8}{x \cdot x}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 73.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= (/ (- (* x x) t_0) (+ t_0 (* x x))) -1.0) -1.0 1.0)))

C

double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if ((((x * x) - t_0) / (t_0 + (x * x))) <= -1.0) {
		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) :: t_0
    real(8) :: tmp
    t_0 = y * (y * 4.0d0)
    if ((((x * x) - t_0) / (t_0 + (x * x))) <= (-1.0d0)) then
        tmp = -1.0d0
    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) - t_0) / (t_0 + (x * x))) <= -1.0) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * (y * 4.0)
	tmp = 0
	if (((x * x) - t_0) / (t_0 + (x * x))) <= -1.0:
		tmp = -1.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(Float64(Float64(x * x) - t_0) / Float64(t_0 + Float64(x * x))) <= -1.0)
		tmp = -1.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) - t_0) / (t_0 + (x * x))) <= -1.0)
		tmp = -1.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[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(t$95$0 + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], -1.0, 1.0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) y)) (+.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) y))) < -1

   1. Initial program 100.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 0

      \[\leadsto \color{blue}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

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

   if -1 < (/.f64 (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) y)) (+.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) y)))

   1. Initial program 39.8%

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

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 69.5%

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

4. Final simplification 77.3%

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

Alternative 4: 50.3% accurate, 48.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 55.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

   \[\leadsto \color{blue}{-1} \]
4. Step-by-step derivation

5. Applied rewrites 48.1%

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

Developer Target 1: 49.6% accurate, 0.2× 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 2024221 
(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))))