Optimisation.CirclePacking:place from circle-packing-0.1.0.4, C

Percentage Accurate: 100.0% → 100.0%

Time: 5.4s

Alternatives: 3

Speedup: 2.0×

Specification

Math

\[\begin{array}{l} \\ \sqrt{\left|x - y\right|} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(abs((x - y)))
end function

Java

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

Python

def code(x, y):
	return math.sqrt(math.fabs((x - y)))

Julia

function code(x, y)
	return sqrt(abs(Float64(x - y)))
end

MATLAB

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

Wolfram

code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{\left|x - y\right|} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (fabs (- x y))))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(abs((x - y)))
end function

Java

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

Python

def code(x, y):
	return math.sqrt(math.fabs((x - y)))

Julia

function code(x, y)
	return sqrt(abs(Float64(x - y)))
end

MATLAB

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

Wolfram

code[x_, y_] := N[Sqrt[N[Abs[N[(x - y), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]

Alternative 1: 100.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \sqrt{y - x} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (sqrt (- y x)))

C

assert(x < y);
double code(double x, double y) {
	return sqrt((y - x));
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt((y - x))
end function

Java

assert x < y;
public static double code(double x, double y) {
	return Math.sqrt((y - x));
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return math.sqrt((y - x))

Julia

x, y = sort([x, y])
function code(x, y)
	return sqrt(Float64(y - x))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = sqrt((y - x));
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[Sqrt[N[(y - x), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\sqrt{\left|x - y\right|} \]
2. Step-by-step derivation

   1. fabs-sub 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\sqrt{\left|y - x\right|}} \]
4. Add Preprocessing

5. Taylor expanded in y around -inf 100.0%

   \[\leadsto \color{blue}{\sqrt{\left|-\left(x + -1 \cdot y\right)\right|}} \]
6. Step-by-step derivation

   1. fabs-neg 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|x + -1 \cdot y\right|}} \]

   2. neg-mul-1 100.0%

      \[\leadsto \sqrt{\left|x + \color{blue}{\left(-y\right)}\right|} \]

   3. sub-neg 100.0%

      \[\leadsto \sqrt{\left|\color{blue}{x - y}\right|} \]

   4. fabs-sub 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

   5. rem-square-sqrt 48.0%

      \[\leadsto \sqrt{\left|\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}\right|} \]

   6. fabs-sqr 48.0%

      \[\leadsto \sqrt{\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}} \]

   7. rem-square-sqrt 48.0%

      \[\leadsto \sqrt{\color{blue}{y - x}} \]

7. Simplified 48.0%

   \[\leadsto \color{blue}{\sqrt{y - x}} \]
8. Add Preprocessing

Alternative 2: 82.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 2.45 \cdot 10^{-135}:\\ \;\;\;\;\sqrt{-x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{y}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (if (<= y 2.45e-135) (sqrt (- x)) (sqrt y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 2.45e-135) {
		tmp = sqrt(-x);
	} else {
		tmp = sqrt(y);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 2.45d-135) then
        tmp = sqrt(-x)
    else
        tmp = sqrt(y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= 2.45e-135) {
		tmp = Math.sqrt(-x);
	} else {
		tmp = Math.sqrt(y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= 2.45e-135:
		tmp = math.sqrt(-x)
	else:
		tmp = math.sqrt(y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= 2.45e-135)
		tmp = sqrt(Float64(-x));
	else
		tmp = sqrt(y);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.45e-135)
		tmp = sqrt(-x);
	else
		tmp = sqrt(y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, 2.45e-135], N[Sqrt[(-x)], $MachinePrecision], N[Sqrt[y], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.4500000000000001e-135

   1. Initial program 100.0%

      \[\sqrt{\left|x - y\right|} \]
   2. Step-by-step derivation

      1. fabs-sub 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\sqrt{\left|y - x\right|}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around -inf 100.0%

      \[\leadsto \color{blue}{\sqrt{\left|-\left(x + -1 \cdot y\right)\right|}} \]
   6. Step-by-step derivation

      1. fabs-neg 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|x + -1 \cdot y\right|}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \sqrt{\left|x + \color{blue}{\left(-y\right)}\right|} \]

      3. sub-neg 100.0%

         \[\leadsto \sqrt{\left|\color{blue}{x - y}\right|} \]

      4. fabs-sub 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

      5. rem-square-sqrt 30.2%

         \[\leadsto \sqrt{\left|\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}\right|} \]

      6. fabs-sqr 30.2%

         \[\leadsto \sqrt{\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}} \]

      7. rem-square-sqrt 30.2%

         \[\leadsto \sqrt{\color{blue}{y - x}} \]

   7. Simplified 30.2%

      \[\leadsto \color{blue}{\sqrt{y - x}} \]

   8. Taylor expanded in y around 0 27.1%

      \[\leadsto \sqrt{\color{blue}{-1 \cdot x}} \]
   9. Step-by-step derivation

      1. neg-mul-1 27.1%

         \[\leadsto \sqrt{\color{blue}{-x}} \]

   10. Simplified 27.1%

       \[\leadsto \sqrt{\color{blue}{-x}} \]

   if 2.4500000000000001e-135 < y

   1. Initial program 100.0%

      \[\sqrt{\left|x - y\right|} \]
   2. Step-by-step derivation

      1. fabs-sub 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\sqrt{\left|y - x\right|}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around -inf 100.0%

      \[\leadsto \color{blue}{\sqrt{\left|-\left(x + -1 \cdot y\right)\right|}} \]
   6. Step-by-step derivation

      1. fabs-neg 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|x + -1 \cdot y\right|}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \sqrt{\left|x + \color{blue}{\left(-y\right)}\right|} \]

      3. sub-neg 100.0%

         \[\leadsto \sqrt{\left|\color{blue}{x - y}\right|} \]

      4. fabs-sub 100.0%

         \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

      5. rem-square-sqrt 82.7%

         \[\leadsto \sqrt{\left|\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}\right|} \]

      6. fabs-sqr 82.7%

         \[\leadsto \sqrt{\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}} \]

      7. rem-square-sqrt 82.7%

         \[\leadsto \sqrt{\color{blue}{y - x}} \]

   7. Simplified 82.7%

      \[\leadsto \color{blue}{\sqrt{y - x}} \]

   8. Taylor expanded in y around inf 67.4%

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

Alternative 3: 50.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \sqrt{y} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (sqrt y))

C

assert(x < y);
double code(double x, double y) {
	return sqrt(y);
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(y)
end function

Java

assert x < y;
public static double code(double x, double y) {
	return Math.sqrt(y);
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return math.sqrt(y)

Julia

x, y = sort([x, y])
function code(x, y)
	return sqrt(y)
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = sqrt(y);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[Sqrt[y], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\sqrt{\left|x - y\right|} \]
2. Step-by-step derivation

   1. fabs-sub 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\sqrt{\left|y - x\right|}} \]
4. Add Preprocessing

5. Taylor expanded in y around -inf 100.0%

   \[\leadsto \color{blue}{\sqrt{\left|-\left(x + -1 \cdot y\right)\right|}} \]
6. Step-by-step derivation

   1. fabs-neg 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|x + -1 \cdot y\right|}} \]

   2. neg-mul-1 100.0%

      \[\leadsto \sqrt{\left|x + \color{blue}{\left(-y\right)}\right|} \]

   3. sub-neg 100.0%

      \[\leadsto \sqrt{\left|\color{blue}{x - y}\right|} \]

   4. fabs-sub 100.0%

      \[\leadsto \sqrt{\color{blue}{\left|y - x\right|}} \]

   5. rem-square-sqrt 48.0%

      \[\leadsto \sqrt{\left|\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}\right|} \]

   6. fabs-sqr 48.0%

      \[\leadsto \sqrt{\color{blue}{\sqrt{y - x} \cdot \sqrt{y - x}}} \]

   7. rem-square-sqrt 48.0%

      \[\leadsto \sqrt{\color{blue}{y - x}} \]

7. Simplified 48.0%

   \[\leadsto \color{blue}{\sqrt{y - x}} \]

8. Taylor expanded in y around inf 26.0%

   \[\leadsto \color{blue}{\sqrt{y}} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024110 
(FPCore (x y)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, C"
  :precision binary64
  (sqrt (fabs (- x y))))