Graphics.Rendering.Chart.Axis.Types:hBufferRect from Chart-1.5.3

Percentage Accurate: 99.9% → 100.0%

Time: 1.6s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x + \frac{x - y}{2} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + ((x - y) / 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{x - y}{2} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + ((x - y) / 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma 1.5 x (* -0.5 y)))

C

double code(double x, double y) {
	return fma(1.5, x, (-0.5 * y));
}

Julia

function code(x, y)
	return fma(1.5, x, Float64(-0.5 * y))
end

Wolfram

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

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in x around 0 99.9%

   \[\leadsto \color{blue}{-0.5 \cdot y + 1.5 \cdot x} \]
3. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. fma-def 100.0%

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

4. Simplified 100.0%

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

5. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(1.5, x, -0.5 \cdot y\right) \]

Alternative 2: 74.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+65} \lor \neg \left(x \leq 4 \cdot 10^{+71}\right):\\ \;\;\;\;1.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1e+65) (not (<= x 4e+71))) (* 1.5 x) (* -0.5 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1e+65) || !(x <= 4e+71)) {
		tmp = 1.5 * x;
	} else {
		tmp = -0.5 * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1d+65)) .or. (.not. (x <= 4d+71))) then
        tmp = 1.5d0 * x
    else
        tmp = (-0.5d0) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1e+65) || !(x <= 4e+71)) {
		tmp = 1.5 * x;
	} else {
		tmp = -0.5 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1e+65) or not (x <= 4e+71):
		tmp = 1.5 * x
	else:
		tmp = -0.5 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1e+65) || !(x <= 4e+71))
		tmp = Float64(1.5 * x);
	else
		tmp = Float64(-0.5 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1e+65) || ~((x <= 4e+71)))
		tmp = 1.5 * x;
	else
		tmp = -0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1e+65], N[Not[LessEqual[x, 4e+71]], $MachinePrecision]], N[(1.5 * x), $MachinePrecision], N[(-0.5 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.9999999999999999e64 or 4.0000000000000002e71 < x

   1. Initial program 99.8%

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

   2. Taylor expanded in x around inf 80.3%

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

   if -9.9999999999999999e64 < x < 4.0000000000000002e71

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 78.8%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+65} \lor \neg \left(x \leq 4 \cdot 10^{+71}\right):\\ \;\;\;\;1.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot y\\ \end{array} \]

Alternative 3: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{x - y}{2} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + ((x - y) / 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

2. Final simplification 99.9%

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

Alternative 4: 49.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ -0.5 \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* -0.5 y))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (-0.5d0) * y
end function

Java

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

Python

def code(x, y):
	return -0.5 * y

Julia

function code(x, y)
	return Float64(-0.5 * y)
end

MATLAB

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

Wolfram

code[x_, y_] := N[(-0.5 * y), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in x around 0 54.8%

   \[\leadsto \color{blue}{-0.5 \cdot y} \]

3. Final simplification 54.8%

   \[\leadsto -0.5 \cdot y \]

Developer target: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1.5 \cdot x - 0.5 \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (* 1.5 x) (* 0.5 y)))

C

double code(double x, double y) {
	return (1.5 * x) - (0.5 * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (1.5d0 * x) - (0.5d0 * y)
end function

Java

public static double code(double x, double y) {
	return (1.5 * x) - (0.5 * y);
}

Python

def code(x, y):
	return (1.5 * x) - (0.5 * y)

Julia

function code(x, y)
	return Float64(Float64(1.5 * x) - Float64(0.5 * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (1.5 * x) - (0.5 * y);
end

Wolfram

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

Reproduce

herbie shell --seed 2023301 
(FPCore (x y)
  :name "Graphics.Rendering.Chart.Axis.Types:hBufferRect from Chart-1.5.3"
  :precision binary64

  :herbie-target
  (- (* 1.5 x) (* 0.5 y))

  (+ x (/ (- x y) 2.0)))