AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, B

Percentage Accurate: 100.0% → 100.0%

Time: 2.5s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{y + x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ y x)))

C

double code(double x, double y) {
	return x / (y + x);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (y + x)
end function

Java

public static double code(double x, double y) {
	return x / (y + x);
}

Python

def code(x, y):
	return x / (y + x)

Julia

function code(x, y)
	return Float64(x / Float64(y + x))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (y + x);
end

Wolfram

code[x_, y_] := N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y + x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ y x)))

C

double code(double x, double y) {
	return x / (y + x);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (y + x)
end function

Java

public static double code(double x, double y) {
	return x / (y + x);
}

Python

def code(x, y):
	return x / (y + x)

Julia

function code(x, y)
	return Float64(x / Float64(y + x))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (y + x);
end

Wolfram

code[x_, y_] := N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ x y)))

C

double code(double x, double y) {
	return x / (x + y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (x + y)
end function

Java

public static double code(double x, double y) {
	return x / (x + y);
}

Python

def code(x, y):
	return x / (x + y)

Julia

function code(x, y)
	return Float64(x / Float64(x + y))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (x + y);
end

Wolfram

code[x_, y_] := N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x}{y + x} \]

2. Final simplification 100.0%

   \[\leadsto \frac{x}{x + y} \]

Alternative 2: 74.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -3.4e-39) (not (<= x 9.2e+26))) (- 1.0 (/ y x)) (/ x y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -3.4e-39) || !(x <= 9.2e+26)) {
		tmp = 1.0 - (y / x);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-3.4d-39)) .or. (.not. (x <= 9.2d+26))) then
        tmp = 1.0d0 - (y / x)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -3.4e-39) || !(x <= 9.2e+26)) {
		tmp = 1.0 - (y / x);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -3.4e-39) or not (x <= 9.2e+26):
		tmp = 1.0 - (y / x)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -3.4e-39) || !(x <= 9.2e+26))
		tmp = Float64(1.0 - Float64(y / x));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -3.4e-39) || ~((x <= 9.2e+26)))
		tmp = 1.0 - (y / x);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -3.4e-39], N[Not[LessEqual[x, 9.2e+26]], $MachinePrecision]], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.3999999999999999e-39 or 9.2000000000000002e26 < x

   1. Initial program 99.9%

      \[\frac{x}{y + x} \]

   2. Taylor expanded in x around inf 78.6%

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

      1. mul-1-neg 78.6%

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

      2. unsub-neg 78.6%

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

   4. Simplified 78.6%

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

   if -3.3999999999999999e-39 < x < 9.2000000000000002e26

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]

   2. Taylor expanded in x around 0 80.2%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.4 \cdot 10^{-39} \lor \neg \left(x \leq 9.2 \cdot 10^{+26}\right):\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 3: 74.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{-38}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+26}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -2.4e-38) 1.0 (if (<= x 4e+26) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.4e-38) {
		tmp = 1.0;
	} else if (x <= 4e+26) {
		tmp = x / y;
	} 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 (x <= (-2.4d-38)) then
        tmp = 1.0d0
    else if (x <= 4d+26) then
        tmp = x / y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -2.4e-38) {
		tmp = 1.0;
	} else if (x <= 4e+26) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -2.4e-38:
		tmp = 1.0
	elif x <= 4e+26:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.4e-38)
		tmp = 1.0;
	elseif (x <= 4e+26)
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.4e-38)
		tmp = 1.0;
	elseif (x <= 4e+26)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.4e-38], 1.0, If[LessEqual[x, 4e+26], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -2.40000000000000022e-38 or 4.00000000000000019e26 < x

   1. Initial program 99.9%

      \[\frac{x}{y + x} \]

   2. Taylor expanded in x around inf 78.4%

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

   if -2.40000000000000022e-38 < x < 4.00000000000000019e26

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]

   2. Taylor expanded in x around 0 80.2%

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

4. Final simplification 79.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{-38}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+26}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 4: 50.2% accurate, 5.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 100.0%

   \[\frac{x}{y + x} \]

2. Taylor expanded in x around inf 51.6%

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

3. Final simplification 51.6%

   \[\leadsto 1 \]

Reproduce

herbie shell --seed 2023229 
(FPCore (x y)
  :name "AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, B"
  :precision binary64
  (/ x (+ y x)))