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

Percentage Accurate: 99.9% → 100.0%

Time: 5.7s

Alternatives: 3

Speedup: 1.5×

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, 1.5× 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. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

      \[\leadsto \color{blue}{\frac{3}{2} \cdot x + \frac{-1}{2} \cdot y} \]

   2. lower-fma.f64 N/A

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

   3. lower-*.f64 100.0

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

5. Applied rewrites 100.0%

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

Alternative 2: 74.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{+91} \lor \neg \left(x \leq 1.05 \cdot 10^{-39}\right):\\ \;\;\;\;1.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.1e+91) (not (<= x 1.05e-39))) (* 1.5 x) (* -0.5 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.1e+91) || !(x <= 1.05e-39)) {
		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 <= (-2.1d+91)) .or. (.not. (x <= 1.05d-39))) 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 <= -2.1e+91) || !(x <= 1.05e-39)) {
		tmp = 1.5 * x;
	} else {
		tmp = -0.5 * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.1e+91) or not (x <= 1.05e-39):
		tmp = 1.5 * x
	else:
		tmp = -0.5 * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.1e+91) || !(x <= 1.05e-39))
		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 <= -2.1e+91) || ~((x <= 1.05e-39)))
		tmp = 1.5 * x;
	else
		tmp = -0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.1e+91], N[Not[LessEqual[x, 1.05e-39]], $MachinePrecision]], N[(1.5 * x), $MachinePrecision], N[(-0.5 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.10000000000000008e91 or 1.04999999999999997e-39 < x

   1. Initial program 99.8%

      \[x + \frac{x - y}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 81.9

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

   5. Applied rewrites 81.9%

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

   if -2.10000000000000008e91 < x < 1.04999999999999997e-39

   1. Initial program 100.0%

      \[x + \frac{x - y}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

4. Final simplification 79.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{+91} \lor \neg \left(x \leq 1.05 \cdot 10^{-39}\right):\\ \;\;\;\;1.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 51.4% accurate, 3.0× 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. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. lower-*.f64 56.2

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

5. Applied rewrites 56.2%

   \[\leadsto \color{blue}{-0.5 \cdot y} \]
6. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.3× 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 2024339 
(FPCore (x y)
  :name "Graphics.Rendering.Chart.Axis.Types:hBufferRect from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* 3/2 x) (* 1/2 y)))

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