Data.Histogram.Bin.BinF:$cfromIndex from histogram-fill-0.8.4.1

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 6

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \left(\frac{x}{2} + y \cdot x\right) + z \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return ((x / 2.0) + (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 / 2.0d0) + (y * x)) + z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{x}{2} + y \cdot x\right) + z \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return ((x / 2.0) + (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 / 2.0d0) + (y * x)) + z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, x, \mathsf{fma}\left(x, 0.5, z\right)\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(\frac{x}{2} + y \cdot x\right) + z \]
2. Add Preprocessing
3. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\left(y \cdot x + \frac{x}{2}\right)} + z \]

   2. associate-+l+ N/A

      \[\leadsto \color{blue}{y \cdot x + \left(\frac{x}{2} + z\right)} \]

   3. accelerator-lowering-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, \frac{x}{2} + z\right)} \]

   4. div-inv N/A

      \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{x \cdot \frac{1}{2}} + z\right) \]

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

      \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{\mathsf{fma}\left(x, \frac{1}{2}, z\right)}\right) \]

   6. metadata-eval 100.0

      \[\leadsto \mathsf{fma}\left(y, x, \mathsf{fma}\left(x, \color{blue}{0.5}, z\right)\right) \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, \mathsf{fma}\left(x, 0.5, z\right)\right)} \]
5. Add Preprocessing

Alternative 2: 59.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.4 \cdot 10^{+81}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-149}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 0.5:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -8.4e+81)
   (* y x)
   (if (<= y 1.25e-149) z (if (<= y 0.5) (* x 0.5) (* y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.4e+81) {
		tmp = y * x;
	} else if (y <= 1.25e-149) {
		tmp = z;
	} else if (y <= 0.5) {
		tmp = x * 0.5;
	} else {
		tmp = y * 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 (y <= (-8.4d+81)) then
        tmp = y * x
    else if (y <= 1.25d-149) then
        tmp = z
    else if (y <= 0.5d0) then
        tmp = x * 0.5d0
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.4e+81) {
		tmp = y * x;
	} else if (y <= 1.25e-149) {
		tmp = z;
	} else if (y <= 0.5) {
		tmp = x * 0.5;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -8.4e+81:
		tmp = y * x
	elif y <= 1.25e-149:
		tmp = z
	elif y <= 0.5:
		tmp = x * 0.5
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -8.4e+81)
		tmp = Float64(y * x);
	elseif (y <= 1.25e-149)
		tmp = z;
	elseif (y <= 0.5)
		tmp = Float64(x * 0.5);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -8.4e+81)
		tmp = y * x;
	elseif (y <= 1.25e-149)
		tmp = z;
	elseif (y <= 0.5)
		tmp = x * 0.5;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -8.4e+81], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.25e-149], z, If[LessEqual[y, 0.5], N[(x * 0.5), $MachinePrecision], N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.3999999999999994e81 or 0.5 < y

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 75.9

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

   5. Simplified 75.9%

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

   if -8.3999999999999994e81 < y < 1.24999999999999992e-149

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 58.1%

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

   if 1.24999999999999992e-149 < y < 0.5

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 N/A

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

      2. +-lowering-+.f64 66.4

         \[\leadsto x \cdot \color{blue}{\left(0.5 + y\right)} \]

   5. Simplified 66.4%

      \[\leadsto \color{blue}{x \cdot \left(0.5 + y\right)} \]

   6. Taylor expanded in y around 0

      \[\leadsto x \cdot \color{blue}{\frac{1}{2}} \]
   7. Step-by-step derivation

   8. Simplified 60.8%

      \[\leadsto x \cdot \color{blue}{0.5} \]
3. Recombined 3 regimes into one program.

4. Final simplification 66.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8.4 \cdot 10^{+81}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-149}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 0.5:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.5:\\ \;\;\;\;\mathsf{fma}\left(y, x, z\right)\\ \mathbf{elif}\;y \leq 0.5:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -0.5) (fma y x z) (if (<= y 0.5) (fma x 0.5 z) (fma y x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.5) {
		tmp = fma(y, x, z);
	} else if (y <= 0.5) {
		tmp = fma(x, 0.5, z);
	} else {
		tmp = fma(y, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -0.5)
		tmp = fma(y, x, z);
	elseif (y <= 0.5)
		tmp = fma(x, 0.5, z);
	else
		tmp = fma(y, x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -0.5], N[(y * x + z), $MachinePrecision], If[LessEqual[y, 0.5], N[(x * 0.5 + z), $MachinePrecision], N[(y * x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.5 or 0.5 < y

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot x + \frac{x}{2}\right)} + z \]

      2. associate-+l+ N/A

         \[\leadsto \color{blue}{y \cdot x + \left(\frac{x}{2} + z\right)} \]

      3. accelerator-lowering-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, \frac{x}{2} + z\right)} \]

      4. div-inv N/A

         \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{x \cdot \frac{1}{2}} + z\right) \]

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

         \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{\mathsf{fma}\left(x, \frac{1}{2}, z\right)}\right) \]

      6. metadata-eval 100.0

         \[\leadsto \mathsf{fma}\left(y, x, \mathsf{fma}\left(x, \color{blue}{0.5}, z\right)\right) \]

   4. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, \mathsf{fma}\left(x, 0.5, z\right)\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{z}\right) \]
   6. Step-by-step derivation

   7. Simplified 97.8%

      \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{z}\right) \]

   if -0.5 < y < 0.5

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 98.5

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, z\right)} \]

   5. Simplified 98.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, z\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 83.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.5 \cdot 10^{+81}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 0.94:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.5e+81) (* y x) (if (<= y 0.94) (fma x 0.5 z) (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.5e+81) {
		tmp = y * x;
	} else if (y <= 0.94) {
		tmp = fma(x, 0.5, z);
	} else {
		tmp = y * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.5e+81)
		tmp = Float64(y * x);
	elseif (y <= 0.94)
		tmp = fma(x, 0.5, z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.5e+81], N[(y * x), $MachinePrecision], If[LessEqual[y, 0.94], N[(x * 0.5 + z), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.49999999999999999e81 or 0.93999999999999995 < y

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 75.9

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

   5. Simplified 75.9%

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

   if -1.49999999999999999e81 < y < 0.93999999999999995

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 93.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, z\right)} \]

   5. Simplified 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, z\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.5 \cdot 10^{+81}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 0.94:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 51.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{-71}:\\ \;\;\;\;z\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{-95}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.7e-71) z (if (<= z 1.15e-95) (* x 0.5) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.7e-71) {
		tmp = z;
	} else if (z <= 1.15e-95) {
		tmp = x * 0.5;
	} else {
		tmp = z;
	}
	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.7d-71)) then
        tmp = z
    else if (z <= 1.15d-95) then
        tmp = x * 0.5d0
    else
        tmp = z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.7e-71) {
		tmp = z;
	} else if (z <= 1.15e-95) {
		tmp = x * 0.5;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.7e-71:
		tmp = z
	elif z <= 1.15e-95:
		tmp = x * 0.5
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.7e-71)
		tmp = z;
	elseif (z <= 1.15e-95)
		tmp = Float64(x * 0.5);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.7e-71)
		tmp = z;
	elseif (z <= 1.15e-95)
		tmp = x * 0.5;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.7e-71], z, If[LessEqual[z, 1.15e-95], N[(x * 0.5), $MachinePrecision], z]]

Derivation

1. Split input into 2 regimes

2. if z < -1.70000000000000002e-71 or 1.15e-95 < z

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 57.9%

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

   if -1.70000000000000002e-71 < z < 1.15e-95

   1. Initial program 100.0%

      \[\left(\frac{x}{2} + y \cdot x\right) + z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 N/A

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

      2. +-lowering-+.f64 89.3

         \[\leadsto x \cdot \color{blue}{\left(0.5 + y\right)} \]

   5. Simplified 89.3%

      \[\leadsto \color{blue}{x \cdot \left(0.5 + y\right)} \]

   6. Taylor expanded in y around 0

      \[\leadsto x \cdot \color{blue}{\frac{1}{2}} \]
   7. Step-by-step derivation

   8. Simplified 47.4%

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

Alternative 6: 40.6% accurate, 23.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return 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 = z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 100.0%

   \[\left(\frac{x}{2} + y \cdot x\right) + z \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Simplified 40.5%

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

Reproduce

herbie shell --seed 2024204 
(FPCore (x y z)
  :name "Data.Histogram.Bin.BinF:$cfromIndex from histogram-fill-0.8.4.1"
  :precision binary64
  (+ (+ (/ x 2.0) (* y x)) z))