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

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 3

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: 74.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+73} \lor \neg \left(y \leq 2.05 \cdot 10^{-25}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.65e+73) (not (<= y 2.05e-25))) (/ x y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.65e+73) || !(y <= 2.05e-25)) {
		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 ((y <= (-2.65d+73)) .or. (.not. (y <= 2.05d-25))) 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 ((y <= -2.65e+73) || !(y <= 2.05e-25)) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.65e+73) or not (y <= 2.05e-25):
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.65e+73) || !(y <= 2.05e-25))
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.65e+73) || ~((y <= 2.05e-25)))
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.65e+73], N[Not[LessEqual[y, 2.05e-25]], $MachinePrecision]], N[(x / y), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if y < -2.64999999999999998e73 or 2.04999999999999994e-25 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 84.2%

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

   if -2.64999999999999998e73 < y < 2.04999999999999994e-25

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 78.5%

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

4. Final simplification 81.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+73} \lor \neg \left(y \leq 2.05 \cdot 10^{-25}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 51.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 50.2%

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

Reproduce

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