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

Average Error: 0.0 → 0.0

Time: 9.9s

Precision: binary64

Cost: 448

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 0.0

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

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	23.5
Cost	720

\[\begin{array}{l} \mathbf{if}\;z \leq -8.426274015626024 \cdot 10^{+42}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq -7.831601714165881 \cdot 10^{-12}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-55}:\\ \;\;\;\;\frac{-x}{z}\\ \mathbf{elif}\;z \leq 0.9621699446013643:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 2
Error	1.4
Cost	712

\[\begin{array}{l} t_0 := x + \frac{y}{z}\\ \mathbf{if}\;z \leq -1.3846425120067625 \cdot 10^{+20}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 3.3331573109122505 \cdot 10^{-20}:\\ \;\;\;\;\frac{y}{z} - \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	11.9
Cost	584

\[\begin{array}{l} \mathbf{if}\;z \leq -8.426274015626024 \cdot 10^{+42}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 0.9621699446013643:\\ \;\;\;\;\frac{y - x}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 4
Error	11.7
Cost	584

\[\begin{array}{l} \mathbf{if}\;z \leq -8.426274015626024 \cdot 10^{+42}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 0.9621699446013643:\\ \;\;\;\;\frac{y - x}{z}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{x}{z}\\ \end{array} \]

Alternative 5
Error	1.4
Cost	584

\[\begin{array}{l} t_0 := x + \frac{y}{z}\\ \mathbf{if}\;z \leq -1.3846425120067625 \cdot 10^{+20}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 3.3331573109122505 \cdot 10^{-20}:\\ \;\;\;\;\frac{y - x}{z}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 6
Error	23.0
Cost	456

\[\begin{array}{l} \mathbf{if}\;z \leq -8.426274015626024 \cdot 10^{+42}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 0.9621699446013643:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 7
Error	34.6
Cost	64

\[x \]

Reproduce

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