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

Percentage Accurate: 100.0% → 100.0%

Time: 3.0s

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. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \frac{x}{x + y} \]
4. Add Preprocessing

Alternative 2: 73.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{-46}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+34}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{y}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3e-46) 1.0 (if (<= x 4.5e+34) (/ x y) (- 1.0 (/ y x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3e-46) {
		tmp = 1.0;
	} else if (x <= 4.5e+34) {
		tmp = x / y;
	} else {
		tmp = 1.0 - (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-3d-46)) then
        tmp = 1.0d0
    else if (x <= 4.5d+34) then
        tmp = x / y
    else
        tmp = 1.0d0 - (y / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -3e-46) {
		tmp = 1.0;
	} else if (x <= 4.5e+34) {
		tmp = x / y;
	} else {
		tmp = 1.0 - (y / x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3e-46:
		tmp = 1.0
	elif x <= 4.5e+34:
		tmp = x / y
	else:
		tmp = 1.0 - (y / x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3e-46)
		tmp = 1.0;
	elseif (x <= 4.5e+34)
		tmp = Float64(x / y);
	else
		tmp = Float64(1.0 - Float64(y / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3e-46)
		tmp = 1.0;
	elseif (x <= 4.5e+34)
		tmp = x / y;
	else
		tmp = 1.0 - (y / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3e-46], 1.0, If[LessEqual[x, 4.5e+34], N[(x / y), $MachinePrecision], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.99999999999999987e-46

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 79.9%

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

   if -2.99999999999999987e-46 < x < 4.5e34

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 75.4%

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

   if 4.5e34 < x

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 78.0%

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

      1. mul-1-neg 78.0%

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

      2. unsub-neg 78.0%

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

   5. Simplified 78.0%

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

Alternative 3: 73.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-48}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{+34}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.5e-48) 1.0 (if (<= x 8.5e+34) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-48) {
		tmp = 1.0;
	} else if (x <= 8.5e+34) {
		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 <= (-3.5d-48)) then
        tmp = 1.0d0
    else if (x <= 8.5d+34) 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 <= -3.5e-48) {
		tmp = 1.0;
	} else if (x <= 8.5e+34) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.5e-48:
		tmp = 1.0
	elif x <= 8.5e+34:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.5e-48)
		tmp = 1.0;
	elseif (x <= 8.5e+34)
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.5e-48)
		tmp = 1.0;
	elseif (x <= 8.5e+34)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.5e-48], 1.0, If[LessEqual[x, 8.5e+34], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -3.49999999999999991e-48 or 8.5000000000000003e34 < x

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 78.9%

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

   if -3.49999999999999991e-48 < x < 8.5000000000000003e34

   1. Initial program 100.0%

      \[\frac{x}{y + x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 75.4%

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

Alternative 4: 50.1% 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. Add Preprocessing

3. Taylor expanded in x around inf 49.5%

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

Reproduce

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