Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2

Percentage Accurate: 100.0% → 100.0%

Time: 1.4s

Alternatives: 6

Speedup: 1.0×

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

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x x) y) y))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return ((x * x) + y) + y

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x x) y) y))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return ((x * x) + y) + y

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma x x (+ y y)))

C

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

Julia

function code(x, y)
	return fma(x, x, Float64(y + y))
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x \cdot x + y\right) + y \]
2. Step-by-step derivation

   1. associate-+l+ 100.0%

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

   2. fma-def 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x, x, y + y\right) \]

Alternative 2: 86.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 3.7 \cdot 10^{-31} \lor \neg \left(x \cdot x \leq 7 \cdot 10^{+84}\right) \land x \cdot x \leq 1.9 \cdot 10^{+130}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= (* x x) 3.7e-31)
         (and (not (<= (* x x) 7e+84)) (<= (* x x) 1.9e+130)))
   (+ y y)
   (* x x)))

C

double code(double x, double y) {
	double tmp;
	if (((x * x) <= 3.7e-31) || (!((x * x) <= 7e+84) && ((x * x) <= 1.9e+130))) {
		tmp = y + y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x * x) <= 3.7d-31) .or. (.not. ((x * x) <= 7d+84)) .and. ((x * x) <= 1.9d+130)) then
        tmp = y + y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (((x * x) <= 3.7e-31) || (!((x * x) <= 7e+84) && ((x * x) <= 1.9e+130))) {
		tmp = y + y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((x * x) <= 3.7e-31) or (not ((x * x) <= 7e+84) and ((x * x) <= 1.9e+130)):
		tmp = y + y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((Float64(x * x) <= 3.7e-31) || (!(Float64(x * x) <= 7e+84) && (Float64(x * x) <= 1.9e+130)))
		tmp = Float64(y + y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x * x) <= 3.7e-31) || (~(((x * x) <= 7e+84)) && ((x * x) <= 1.9e+130)))
		tmp = y + y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[N[(x * x), $MachinePrecision], 3.7e-31], And[N[Not[LessEqual[N[(x * x), $MachinePrecision], 7e+84]], $MachinePrecision], LessEqual[N[(x * x), $MachinePrecision], 1.9e+130]]], N[(y + y), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 3.6999999999999998e-31 or 6.9999999999999998e84 < (*.f64 x x) < 1.9000000000000001e130

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around 0 90.5%

      \[\leadsto \color{blue}{y} + y \]

   if 3.6999999999999998e-31 < (*.f64 x x) < 6.9999999999999998e84 or 1.9000000000000001e130 < (*.f64 x x)

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around inf 91.0%

      \[\leadsto \color{blue}{{x}^{2}} + y \]
   3. Step-by-step derivation

      1. unpow2 91.0%

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

   4. Simplified 91.0%

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

   5. Taylor expanded in x around inf 89.4%

      \[\leadsto \color{blue}{{x}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 91.0%

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

   7. Simplified 89.4%

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

4. Final simplification 90.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 3.7 \cdot 10^{-31} \lor \neg \left(x \cdot x \leq 7 \cdot 10^{+84}\right) \land x \cdot x \leq 1.9 \cdot 10^{+130}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 3: 88.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2.45 \cdot 10^{-36}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;y + x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* x x) 2.45e-36) (+ y y) (+ y (* x x))))

C

double code(double x, double y) {
	double tmp;
	if ((x * x) <= 2.45e-36) {
		tmp = y + y;
	} else {
		tmp = y + (x * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x * x) <= 2.45d-36) then
        tmp = y + y
    else
        tmp = y + (x * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x * x) <= 2.45e-36) {
		tmp = y + y;
	} else {
		tmp = y + (x * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x * x) <= 2.45e-36:
		tmp = y + y
	else:
		tmp = y + (x * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(x * x) <= 2.45e-36)
		tmp = Float64(y + y);
	else
		tmp = Float64(y + Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x * x) <= 2.45e-36)
		tmp = y + y;
	else
		tmp = y + (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(x * x), $MachinePrecision], 2.45e-36], N[(y + y), $MachinePrecision], N[(y + N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.4499999999999998e-36

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around 0 90.9%

      \[\leadsto \color{blue}{y} + y \]

   if 2.4499999999999998e-36 < (*.f64 x x)

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around inf 87.6%

      \[\leadsto \color{blue}{{x}^{2}} + y \]
   3. Step-by-step derivation

      1. unpow2 87.6%

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

   4. Simplified 87.6%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 2.45 \cdot 10^{-36}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;y + x \cdot x\\ \end{array} \]

Alternative 4: 55.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 6.8 \cdot 10^{-178}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* x x) 6.8e-178) y (* x x)))

C

double code(double x, double y) {
	double tmp;
	if ((x * x) <= 6.8e-178) {
		tmp = y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x * x) <= 6.8d-178) then
        tmp = y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x * x) <= 6.8e-178) {
		tmp = y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x * x) <= 6.8e-178:
		tmp = y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(x * x) <= 6.8e-178)
		tmp = y;
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x * x) <= 6.8e-178)
		tmp = y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(x * x), $MachinePrecision], 6.8e-178], y, N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 6.79999999999999945e-178

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around inf 20.1%

      \[\leadsto \color{blue}{{x}^{2}} + y \]
   3. Step-by-step derivation

      1. unpow2 20.1%

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

   4. Simplified 20.1%

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

   5. Taylor expanded in x around 0 18.5%

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

   if 6.79999999999999945e-178 < (*.f64 x x)

   1. Initial program 100.0%

      \[\left(x \cdot x + y\right) + y \]

   2. Taylor expanded in x around inf 77.4%

      \[\leadsto \color{blue}{{x}^{2}} + y \]
   3. Step-by-step derivation

      1. unpow2 77.4%

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

   4. Simplified 77.4%

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

   5. Taylor expanded in x around inf 73.3%

      \[\leadsto \color{blue}{{x}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 77.4%

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

   7. Simplified 73.3%

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

4. Final simplification 52.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 6.8 \cdot 10^{-178}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 5: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ y (+ y (* x x))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return y + (y + (x * x))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x \cdot x + y\right) + y \]

2. Final simplification 100.0%

   \[\leadsto y + \left(y + x \cdot x\right) \]

Alternative 6: 10.8% accurate, 7.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 y)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return y

Julia

function code(x, y)
	return y
end

MATLAB

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

Wolfram

code[x_, y_] := y

Derivation

1. Initial program 100.0%

   \[\left(x \cdot x + y\right) + y \]

2. Taylor expanded in x around inf 55.7%

   \[\leadsto \color{blue}{{x}^{2}} + y \]
3. Step-by-step derivation

   1. unpow2 55.7%

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

4. Simplified 55.7%

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

5. Taylor expanded in x around 0 11.4%

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

6. Final simplification 11.4%

   \[\leadsto y \]

Developer target: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (+ (+ y y) (* x x)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (y + y) + (x * x)

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023185 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"
  :precision binary64

  :herbie-target
  (+ (+ y y) (* x x))

  (+ (+ (* x x) y) y))