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

Percentage Accurate: 100.0% → 100.0%

Time: 2.9s

Alternatives: 4

Speedup: 1.0×

Specification

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]

Initial Program: 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]

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}{x + y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 74.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-26}:\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-37}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.1e-26) (- 1.0 (/ y x)) (if (<= x 8e-37) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.1e-26) {
		tmp = 1.0 - (y / x);
	} else if (x <= 8e-37) {
		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.1d-26)) then
        tmp = 1.0d0 - (y / x)
    else if (x <= 8d-37) 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.1e-26) {
		tmp = 1.0 - (y / x);
	} else if (x <= 8e-37) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.1e-26:
		tmp = 1.0 - (y / x)
	elif x <= 8e-37:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.1e-26)
		tmp = Float64(1.0 - Float64(y / x));
	elseif (x <= 8e-37)
		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.1e-26)
		tmp = 1.0 - (y / x);
	elseif (x <= 8e-37)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.1e-26], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8e-37], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 3 regimes

2. if x < -3.09999999999999983e-26

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 80.8%

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

      1. mul-1-neg 80.8%

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

      2. unsub-neg 80.8%

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

   5. Simplified 80.8%

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

   if -3.09999999999999983e-26 < x < 8.00000000000000053e-37

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 76.8%

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

   if 8.00000000000000053e-37 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 84.8%

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

Alternative 3: 74.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-26}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 5.1 \cdot 10^{-36}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.1e-26) 1.0 (if (<= x 5.1e-36) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.1e-26) {
		tmp = 1.0;
	} else if (x <= 5.1e-36) {
		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.1d-26)) then
        tmp = 1.0d0
    else if (x <= 5.1d-36) 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.1e-26) {
		tmp = 1.0;
	} else if (x <= 5.1e-36) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.1e-26:
		tmp = 1.0
	elif x <= 5.1e-36:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.1e-26)
		tmp = 1.0;
	elseif (x <= 5.1e-36)
		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.1e-26)
		tmp = 1.0;
	elseif (x <= 5.1e-36)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.1e-26], 1.0, If[LessEqual[x, 5.1e-36], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -3.09999999999999983e-26 or 5.09999999999999973e-36 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 82.6%

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

   if -3.09999999999999983e-26 < x < 5.09999999999999973e-36

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 76.8%

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

Alternative 4: 51.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}{x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 59.0%

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

Reproduce

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