Statistics.Sample:$swelfordMean from math-functions-0.1.5.2

Percentage Accurate: 100.0% → 100.0%

Time: 4.2s

Alternatives: 6

Speedup: 1.0×

• 21.0% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 98.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{y}{z}\\ \mathbf{if}\;z \leq -46000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.75 \cdot 10^{-13}:\\ \;\;\;\;\frac{y - x}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (/ y z))))
   (if (<= z -46000.0) t_0 (if (<= z 1.75e-13) (/ (- y x) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x + (y / z);
	double tmp;
	if (z <= -46000.0) {
		tmp = t_0;
	} else if (z <= 1.75e-13) {
		tmp = (y - x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x + (y / z)
    if (z <= (-46000.0d0)) then
        tmp = t_0
    else if (z <= 1.75d-13) then
        tmp = (y - x) / z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x + (y / z);
	double tmp;
	if (z <= -46000.0) {
		tmp = t_0;
	} else if (z <= 1.75e-13) {
		tmp = (y - x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x + (y / z)
	tmp = 0
	if z <= -46000.0:
		tmp = t_0
	elif z <= 1.75e-13:
		tmp = (y - x) / z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(y / z))
	tmp = 0.0
	if (z <= -46000.0)
		tmp = t_0;
	elseif (z <= 1.75e-13)
		tmp = Float64(Float64(y - x) / z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (y / z);
	tmp = 0.0;
	if (z <= -46000.0)
		tmp = t_0;
	elseif (z <= 1.75e-13)
		tmp = (y - x) / z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -46000.0], t$95$0, If[LessEqual[z, 1.75e-13], N[(N[(y - x), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -46000 or 1.7500000000000001e-13 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \mathsf{+.f64}\left(x, \color{blue}{\left(\frac{y}{z}\right)}\right) \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 98.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(y, \color{blue}{z}\right)\right) \]

   5. Simplified 98.5%

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

   if -46000 < z < 1.7500000000000001e-13

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. sub-neg N/A

         \[\leadsto \frac{y + \left(\mathsf{neg}\left(x\right)\right)}{z} \]

      2. +-commutative N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(x\right)\right) + y}{z} \]

      3. neg-sub0 N/A

         \[\leadsto \frac{\left(0 - x\right) + y}{z} \]

      4. associate-+l- N/A

         \[\leadsto \frac{0 - \left(x - y\right)}{z} \]

      5. sub0-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(\left(x - y\right)\right)}{z} \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(x - y\right)\right)\right), \color{blue}{z}\right) \]

      7. sub0-neg N/A

         \[\leadsto \mathsf{/.f64}\left(\left(0 - \left(x - y\right)\right), z\right) \]

      8. associate-+l- N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\left(0 - x\right) + y\right), z\right) \]

      9. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\left(\mathsf{neg}\left(x\right)\right) + y\right), z\right) \]

      10. +-commutative N/A

          \[\leadsto \mathsf{/.f64}\left(\left(y + \left(\mathsf{neg}\left(x\right)\right)\right), z\right) \]

      11. sub-neg N/A

          \[\leadsto \mathsf{/.f64}\left(\left(y - x\right), z\right) \]

      12. --lowering--.f64 99.0%

          \[\leadsto \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), z\right) \]

   5. Simplified 99.0%

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

Alternative 3: 86.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{y}{z}\\ \mathbf{if}\;y \leq -2.05 \cdot 10^{-109}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-44}:\\ \;\;\;\;x - \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (/ y z))))
   (if (<= y -2.05e-109) t_0 (if (<= y 3e-44) (- x (/ x z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x + (y / z);
	double tmp;
	if (y <= -2.05e-109) {
		tmp = t_0;
	} else if (y <= 3e-44) {
		tmp = x - (x / z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x + (y / z)
    if (y <= (-2.05d-109)) then
        tmp = t_0
    else if (y <= 3d-44) then
        tmp = x - (x / z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x + (y / z);
	double tmp;
	if (y <= -2.05e-109) {
		tmp = t_0;
	} else if (y <= 3e-44) {
		tmp = x - (x / z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x + (y / z)
	tmp = 0
	if y <= -2.05e-109:
		tmp = t_0
	elif y <= 3e-44:
		tmp = x - (x / z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(y / z))
	tmp = 0.0
	if (y <= -2.05e-109)
		tmp = t_0;
	elseif (y <= 3e-44)
		tmp = Float64(x - Float64(x / z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (y / z);
	tmp = 0.0;
	if (y <= -2.05e-109)
		tmp = t_0;
	elseif (y <= 3e-44)
		tmp = x - (x / z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.05e-109], t$95$0, If[LessEqual[y, 3e-44], N[(x - N[(x / z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.0500000000000001e-109 or 3.0000000000000002e-44 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \mathsf{+.f64}\left(x, \color{blue}{\left(\frac{y}{z}\right)}\right) \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 88.7%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(y, \color{blue}{z}\right)\right) \]

   5. Simplified 88.7%

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

   if -2.0500000000000001e-109 < y < 3.0000000000000002e-44

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 - \frac{1}{z}\right)} \]
   4. Step-by-step derivation

      1. distribute-lft-out-- N/A

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

      2. *-rgt-identity N/A

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

      3. associate-*r/ N/A

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

      4. *-rgt-identity N/A

         \[\leadsto x - \frac{x}{z} \]

      5. --lowering--.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(x, \color{blue}{\left(\frac{x}{z}\right)}\right) \]

      6. /-lowering-/.f64 89.9%

         \[\leadsto \mathsf{\_.f64}\left(x, \mathsf{/.f64}\left(x, \color{blue}{z}\right)\right) \]

   5. Simplified 89.9%

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

Alternative 4: 61.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.6 \cdot 10^{+44}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{+52}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.6e+44) x (if (<= z 2.5e+52) (/ y z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.6e+44) {
		tmp = x;
	} else if (z <= 2.5e+52) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1.6d+44)) then
        tmp = x
    else if (z <= 2.5d+52) then
        tmp = y / z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.6e+44) {
		tmp = x;
	} else if (z <= 2.5e+52) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.6e+44:
		tmp = x
	elif z <= 2.5e+52:
		tmp = y / z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.6e+44)
		tmp = x;
	elseif (z <= 2.5e+52)
		tmp = Float64(y / z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.6e+44)
		tmp = x;
	elseif (z <= 2.5e+52)
		tmp = y / z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.6e+44], x, If[LessEqual[z, 2.5e+52], N[(y / z), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if z < -1.60000000000000002e44 or 2.5e52 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 80.9%

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

   if -1.60000000000000002e44 < z < 2.5e52

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{y}{z}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 54.1%

         \[\leadsto \mathsf{/.f64}\left(y, \color{blue}{z}\right) \]

   5. Simplified 54.1%

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

Alternative 5: 75.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in y around inf

   \[\leadsto \mathsf{+.f64}\left(x, \color{blue}{\left(\frac{y}{z}\right)}\right) \]
4. Step-by-step derivation

   1. /-lowering-/.f64 74.9%

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(y, \color{blue}{z}\right)\right) \]

5. Simplified 74.9%

   \[\leadsto x + \color{blue}{\frac{y}{z}} \]
6. Add Preprocessing

Alternative 6: 36.0% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 x)

C

double code(double x, double y, double z) {
	return x;
}

Fortran

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

Java

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

Python

def code(x, y, z):
	return x

Julia

function code(x, y, z)
	return x
end

MATLAB

function tmp = code(x, y, z)
	tmp = x;
end

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in z around inf

   \[\leadsto \color{blue}{x} \]
4. Step-by-step derivation

5. Simplified 36.9%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024155 
(FPCore (x y z)
  :name "Statistics.Sample:$swelfordMean from math-functions-0.1.5.2"
  :precision binary64
  (+ x (/ (- y x) z)))