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

Percentage Accurate: 50.4% → 80.2%

Time: 5.5s

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: 50.4% 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: 80.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 4.0 y) y)))
   (if (<= t_0 4e-154)
     (fma (/ (* (/ -8.0 x) y) x) y 1.0)
     (if (<= t_0 1e+216)
       (/ (fma -4.0 (* y y) (* x x)) (fma (* 4.0 y) y (* x x)))
       -1.0))))

C

double code(double x, double y) {
	double t_0 = (4.0 * y) * y;
	double tmp;
	if (t_0 <= 4e-154) {
		tmp = fma((((-8.0 / x) * y) / x), y, 1.0);
	} else if (t_0 <= 1e+216) {
		tmp = fma(-4.0, (y * y), (x * x)) / fma((4.0 * y), y, (x * x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(4.0 * y) * y)
	tmp = 0.0
	if (t_0 <= 4e-154)
		tmp = fma(Float64(Float64(Float64(-8.0 / x) * y) / x), y, 1.0);
	elseif (t_0 <= 1e+216)
		tmp = Float64(fma(-4.0, Float64(y * y), Float64(x * x)) / fma(Float64(4.0 * y), y, Float64(x * x)));
	else
		tmp = -1.0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 3.9999999999999999e-154

   1. Initial program 55.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 y around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*l/ N/A

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

      4. metadata-eval N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. associate-*r/ N/A

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

      13. metadata-eval N/A

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

      14. distribute-neg-frac N/A

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

      15. metadata-eval N/A

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

      16. lower-/.f64 N/A

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

      17. unpow2 N/A

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

      18. lower-*.f64 83.2

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

   5. Applied rewrites 83.2%

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

   7. Applied rewrites 90.9%

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

   if 3.9999999999999999e-154 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 1e216

   1. Initial program 77.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
   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. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. distribute-lft-neg-in N/A

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

      9. lower-fma.f64 N/A

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

      10. metadata-eval N/A

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

      11. lower-*.f64 77.6

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

      12. lift-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lift-*.f64 N/A

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

      15. lower-fma.f64 77.6

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 77.6

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

   4. Applied rewrites 77.6%

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

   if 1e216 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

   1. Initial program 13.3%

      \[\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 y around inf

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

   5. Applied rewrites 78.2%

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

4. Final simplification 83.3%

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

Alternative 2: 75.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(4 \cdot y\right) \cdot y \leq 100000000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{-8}{x} \cdot y}{x}, y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* (* 4.0 y) y) 100000000000.0)
   (fma (/ (* (/ -8.0 x) y) x) y 1.0)
   -1.0))

C

double code(double x, double y) {
	double tmp;
	if (((4.0 * y) * y) <= 100000000000.0) {
		tmp = fma((((-8.0 / x) * y) / x), y, 1.0);
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(4.0 * y) * y) <= 100000000000.0)
		tmp = fma(Float64(Float64(Float64(-8.0 / x) * y) / x), y, 1.0);
	else
		tmp = -1.0;
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(4.0 * y), $MachinePrecision] * y), $MachinePrecision], 100000000000.0], N[(N[(N[(N[(-8.0 / x), $MachinePrecision] * y), $MachinePrecision] / x), $MachinePrecision] * y + 1.0), $MachinePrecision], -1.0]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 59.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 y around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*l/ N/A

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

      4. metadata-eval N/A

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

      5. distribute-neg-frac N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. associate-*r/ N/A

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

      13. metadata-eval N/A

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

      14. distribute-neg-frac N/A

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

      15. metadata-eval N/A

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

      16. lower-/.f64 N/A

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

      17. unpow2 N/A

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

      18. lower-*.f64 79.6

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

   5. Applied rewrites 79.6%

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

   7. Applied rewrites 85.6%

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

   if 1e11 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

   1. Initial program 35.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 y around inf

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

   5. Applied rewrites 73.9%

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

4. Final simplification 80.0%

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

Alternative 3: 74.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(4 \cdot y\right) \cdot y \leq 100000000000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* (* 4.0 y) y) 100000000000.0) 1.0 -1.0))

C

double code(double x, double y) {
	double tmp;
	if (((4.0 * y) * y) <= 100000000000.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) :: tmp
    if (((4.0d0 * y) * y) <= 100000000000.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 tmp;
	if (((4.0 * y) * y) <= 100000000000.0) {
		tmp = 1.0;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((4.0 * y) * y) <= 100000000000.0:
		tmp = 1.0
	else:
		tmp = -1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(4.0 * y) * y) <= 100000000000.0)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((4.0 * y) * y) <= 100000000000.0)
		tmp = 1.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(4.0 * y), $MachinePrecision] * y), $MachinePrecision], 100000000000.0], 1.0, -1.0]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 59.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 y around 0

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

   5. Applied rewrites 84.7%

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

   if 1e11 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

   1. Initial program 35.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 y around inf

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

   5. Applied rewrites 73.9%

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

4. Final simplification 79.6%

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

Alternative 4: 50.7% 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 47.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 y around inf

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

5. Applied rewrites 43.7%

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

Developer Target 1: 50.9% 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 2024271 
(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))))