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

Percentage Accurate: 100.0% → 100.0%

Time: 7.7s

Precision: binary64

Cost: 448

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

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

↓

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);
}

↓

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)

↓

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

↓

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

↓

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]

↓

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. Final simplification 100.0%

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

Alternatives

Alternative 1
Accuracy	100.0%
Cost	448

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

Alternative 2
Accuracy	62.2%
Cost	984

\[\begin{array}{l} t_0 := \frac{-x}{z}\\ \mathbf{if}\;z \leq -6.5 \cdot 10^{+18}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq -3.5 \cdot 10^{-105}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq -1.9 \cdot 10^{-307}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 2.05 \cdot 10^{-269}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 5.5 \cdot 10^{-31}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{+22}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3
Accuracy	76.5%
Cost	850

\[\begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{-106} \lor \neg \left(z \leq -5.1 \cdot 10^{-260} \lor \neg \left(z \leq 1.4 \cdot 10^{-270}\right) \land z \leq 4.2 \cdot 10^{-32}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{z}\\ \end{array} \]

Alternative 4
Accuracy	86.3%
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -7.5 \cdot 10^{+47} \lor \neg \left(x \leq 0.0112\right):\\ \;\;\;\;x - \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{z}\\ \end{array} \]

Alternative 5
Accuracy	98.3%
Cost	585

\[\begin{array}{l} \mathbf{if}\;z \leq -61 \lor \neg \left(z \leq 1.5 \cdot 10^{-21}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - x}{z}\\ \end{array} \]

Alternative 6
Accuracy	61.6%
Cost	456

\[\begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+18}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{+22}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 7
Accuracy	36.5%
Cost	64

\[x \]

Reproduce

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