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

Percentage Accurate: 100.0% → 100.0%
Time: 1.4s
Alternatives: 3
Speedup: 1.0×

Specification

?
\[\left(x + x\right) - 1 \]
(FPCore (x)
  :precision binary64
  :pre TRUE
  (- (+ x x) 1.0))
double code(double x) {
	return (x + x) - 1.0;
}

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = (x + x) - 1.0d0
end function

public static double code(double x) {
	return (x + x) - 1.0;
}

def code(x):
	return (x + x) - 1.0

function code(x)
	return Float64(Float64(x + x) - 1.0)
end

function tmp = code(x)
	tmp = (x + x) - 1.0;
end

code[x_] := N[(N[(x + x), $MachinePrecision] - 1.0), $MachinePrecision]

f(x):
	x in [-inf, +inf]
code: THEORY
BEGIN
f(x: real): real =
	(x + x) - (1)
END code
\left(x + x\right) - 1

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 3 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 100.0% accurate, 1.0× speedup?

\[\left(x + x\right) - 1 \]
(FPCore (x)
  :precision binary64
  :pre TRUE
  (- (+ x x) 1.0))
double code(double x) {
	return (x + x) - 1.0;
}

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = (x + x) - 1.0d0
end function

public static double code(double x) {
	return (x + x) - 1.0;
}

def code(x):
	return (x + x) - 1.0

function code(x)
	return Float64(Float64(x + x) - 1.0)
end

function tmp = code(x)
	tmp = (x + x) - 1.0;
end

code[x_] := N[(N[(x + x), $MachinePrecision] - 1.0), $MachinePrecision]

f(x):
	x in [-inf, +inf]
code: THEORY
BEGIN
f(x: real): real =
	(x + x) - (1)
END code
\left(x + x\right) - 1

Alternative 1: 100.0% accurate, 1.0× speedup?

\[\mathsf{fma}\left(2, x, -1\right) \]
(FPCore (x)
  :precision binary64
  :pre TRUE
  (fma 2.0 x -1.0))
double code(double x) {
	return fma(2.0, x, -1.0);
}

function code(x)
	return fma(2.0, x, -1.0)
end

code[x_] := N[(2.0 * x + -1.0), $MachinePrecision]

f(x):
	x in [-inf, +inf]
code: THEORY
BEGIN
f(x: real): real =
	((2) * x) + (-1)
END code
\mathsf{fma}\left(2, x, -1\right)
Derivation

  1. Initial program 100.0%

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

    1. Applied rewrites100.0%

      \[\leadsto \mathsf{fma}\left(2, x, -1\right) \]
    2. Add Preprocessing

    Alternative 2: 98.0% accurate, 0.4× speedup?

    \[\begin{array}{l} \mathbf{if}\;x + x \leq -33.059492225077506:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x + x \leq 1169.9967764307803:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;x + x\\ \end{array} \]
    (FPCore (x)
  :precision binary64
  :pre TRUE
  (if (<= (+ x x) -33.059492225077506)
  (+ x x)
  (if (<= (+ x x) 1169.9967764307803) -1.0 (+ x x))))
    double code(double x) {
	double tmp;
	if ((x + x) <= -33.059492225077506) {
		tmp = x + x;
	} else if ((x + x) <= 1169.9967764307803) {
		tmp = -1.0;
	} else {
		tmp = x + x;
	}
	return tmp;
}

    real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x + x) <= (-33.059492225077506d0)) then
        tmp = x + x
    else if ((x + x) <= 1169.9967764307803d0) then
        tmp = -1.0d0
    else
        tmp = x + x
    end if
    code = tmp
end function

    public static double code(double x) {
	double tmp;
	if ((x + x) <= -33.059492225077506) {
		tmp = x + x;
	} else if ((x + x) <= 1169.9967764307803) {
		tmp = -1.0;
	} else {
		tmp = x + x;
	}
	return tmp;
}

    def code(x):
	tmp = 0
	if (x + x) <= -33.059492225077506:
		tmp = x + x
	elif (x + x) <= 1169.9967764307803:
		tmp = -1.0
	else:
		tmp = x + x
	return tmp

    function code(x)
	tmp = 0.0
	if (Float64(x + x) <= -33.059492225077506)
		tmp = Float64(x + x);
	elseif (Float64(x + x) <= 1169.9967764307803)
		tmp = -1.0;
	else
		tmp = Float64(x + x);
	end
	return tmp
end

    function tmp_2 = code(x)
	tmp = 0.0;
	if ((x + x) <= -33.059492225077506)
		tmp = x + x;
	elseif ((x + x) <= 1169.9967764307803)
		tmp = -1.0;
	else
		tmp = x + x;
	end
	tmp_2 = tmp;
end

    code[x_] := If[LessEqual[N[(x + x), $MachinePrecision], -33.059492225077506], N[(x + x), $MachinePrecision], If[LessEqual[N[(x + x), $MachinePrecision], 1169.9967764307803], -1.0, N[(x + x), $MachinePrecision]]]

    f(x):
	x in [-inf, +inf]
code: THEORY
BEGIN
f(x: real): real =
	LET tmp_1 = IF ((x + x) <= (116999677643078030087053775787353515625e-35)) THEN (-1) ELSE (x + x) ENDIF IN
	LET tmp = IF ((x + x) <= (-330594922250775056227212189696729183197021484375e-46)) THEN (x + x) ELSE tmp_1 ENDIF IN
	tmp
END code
    \begin{array}{l}
\mathbf{if}\;x + x \leq -33.059492225077506:\\
\;\;\;\;x + x\\

\mathbf{elif}\;x + x \leq 1169.9967764307803:\\
\;\;\;\;-1\\

\mathbf{else}:\\
\;\;\;\;x + x\\


\end{array}
    Derivation
    1. Split input into 2 regimes

    2. if (+.f64 x x) < -33.059492225077506 or 1169.9967764307803 < (+.f64 x x)

      1. Initial program 100.0%

        \[\left(x + x\right) - 1 \]

      2. Taylor expanded in x around 0

        \[\leadsto -1 \]
      3. Step-by-step derivation

        1. Applied rewrites50.9%

          \[\leadsto -1 \]

        2. Taylor expanded in x around inf

          \[\leadsto 2 \cdot x \]
        3. Step-by-step derivation

          1. Applied rewrites50.6%

            \[\leadsto 2 \cdot x \]
          2. Step-by-step derivation

            1. Applied rewrites50.6%

              \[\leadsto x + x \]

            if -33.059492225077506 < (+.f64 x x) < 1169.9967764307803

            1. Initial program 100.0%

              \[\left(x + x\right) - 1 \]

            2. Taylor expanded in x around 0

              \[\leadsto -1 \]
            3. Step-by-step derivation

              1. Applied rewrites50.9%

                \[\leadsto -1 \]
            4. Recombined 2 regimes into one program.
            5. Add Preprocessing

            Alternative 3: 50.9% accurate, 6.2× speedup?

            \[-1 \]
            (FPCore (x)
  :precision binary64
  :pre TRUE
  -1.0)
            double code(double x) {
	return -1.0;
}

            real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = -1.0d0
end function

            public static double code(double x) {
	return -1.0;
}

            def code(x):
	return -1.0

            function code(x)
	return -1.0
end

            function tmp = code(x)
	tmp = -1.0;
end

            code[x_] := -1.0

            f(x):
	x in [-inf, +inf]
code: THEORY
BEGIN
f(x: real): real =
	-1
END code
            -1
            Derivation

            1. Initial program 100.0%

              \[\left(x + x\right) - 1 \]

            2. Taylor expanded in x around 0

              \[\leadsto -1 \]
            3. Step-by-step derivation

              1. Applied rewrites50.9%

                \[\leadsto -1 \]
              2. Add Preprocessing

              Reproduce

              ?
              herbie shell --seed 2026092 
(FPCore (x)
  :name "Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2"
  :precision binary64
  (- (+ x x) 1.0))