Graphics.Rendering.Chart.Plot.AreaSpots:renderSpotLegend from Chart-1.5.3

Percentage Accurate: 99.9% → 99.9%

Time: 4.8s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x + \frac{\left|y - x\right|}{2} \]

2. Final simplification 99.9%

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

Alternative 2: 70.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.1 \cdot 10^{-63}:\\ \;\;\;\;\left|y - x\right| \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x + y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.1e-63) (* (fabs (- y x)) 0.5) (* 0.5 (+ x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.1e-63) {
		tmp = fabs((y - x)) * 0.5;
	} else {
		tmp = 0.5 * (x + y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.1d-63)) then
        tmp = abs((y - x)) * 0.5d0
    else
        tmp = 0.5d0 * (x + y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.1e-63) {
		tmp = Math.abs((y - x)) * 0.5;
	} else {
		tmp = 0.5 * (x + y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.1e-63:
		tmp = math.fabs((y - x)) * 0.5
	else:
		tmp = 0.5 * (x + y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.1e-63)
		tmp = Float64(abs(Float64(y - x)) * 0.5);
	else
		tmp = Float64(0.5 * Float64(x + y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.1e-63)
		tmp = abs((y - x)) * 0.5;
	else
		tmp = 0.5 * (x + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.1e-63], N[(N[Abs[N[(y - x), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], N[(0.5 * N[(x + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.1e-63

   1. Initial program 100.0%

      \[x + \frac{\left|y - x\right|}{2} \]

   2. Taylor expanded in x around 0 67.6%

      \[\leadsto \color{blue}{0.5 \cdot \left|y - x\right|} \]

   if -1.1e-63 < y

   1. Initial program 99.9%

      \[x + \frac{\left|y - x\right|}{2} \]
   2. Step-by-step derivation

      1. flip-+ 57.5%

         \[\leadsto \color{blue}{\frac{x \cdot x - \frac{\left|y - x\right|}{2} \cdot \frac{\left|y - x\right|}{2}}{x - \frac{\left|y - x\right|}{2}}} \]

   3. Applied egg-rr 39.8%

      \[\leadsto \color{blue}{\frac{x \cdot x - {\left(y - x\right)}^{2} \cdot 0.25}{x - \left(y - x\right) \cdot 0.5}} \]

   4. Taylor expanded in x around 0 73.5%

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

      1. distribute-lft-out 73.5%

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

      2. +-commutative 73.5%

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

   6. Simplified 73.5%

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

4. Final simplification 71.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.1 \cdot 10^{-63}:\\ \;\;\;\;\left|y - x\right| \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x + y\right)\\ \end{array} \]

Alternative 3: 45.7% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 3.6e-103) (* x 0.5) (* y 0.5)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 3.6e-103) {
		tmp = x * 0.5;
	} else {
		tmp = y * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 3.6d-103) then
        tmp = x * 0.5d0
    else
        tmp = y * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 3.6e-103:
		tmp = x * 0.5
	else:
		tmp = y * 0.5
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 3.6e-103)
		tmp = x * 0.5;
	else
		tmp = y * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 3.5999999999999998e-103

   1. Initial program 99.9%

      \[x + \frac{\left|y - x\right|}{2} \]
   2. Step-by-step derivation

      1. flip-+ 58.0%

         \[\leadsto \color{blue}{\frac{x \cdot x - \frac{\left|y - x\right|}{2} \cdot \frac{\left|y - x\right|}{2}}{x - \frac{\left|y - x\right|}{2}}} \]

   3. Applied egg-rr 25.7%

      \[\leadsto \color{blue}{\frac{x \cdot x - {\left(y - x\right)}^{2} \cdot 0.25}{x - \left(y - x\right) \cdot 0.5}} \]

   4. Taylor expanded in x around inf 38.1%

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

   if 3.5999999999999998e-103 < y

   1. Initial program 99.9%

      \[x + \frac{\left|y - x\right|}{2} \]
   2. Step-by-step derivation

      1. flip-+ 44.5%

         \[\leadsto \color{blue}{\frac{x \cdot x - \frac{\left|y - x\right|}{2} \cdot \frac{\left|y - x\right|}{2}}{x - \frac{\left|y - x\right|}{2}}} \]

   3. Applied egg-rr 43.5%

      \[\leadsto \color{blue}{\frac{x \cdot x - {\left(y - x\right)}^{2} \cdot 0.25}{x - \left(y - x\right) \cdot 0.5}} \]

   4. Taylor expanded in x around 0 81.0%

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

4. Final simplification 51.0%

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

Alternative 4: 54.4% accurate, 21.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x + \frac{\left|y - x\right|}{2} \]
2. Step-by-step derivation

   1. flip-+ 53.9%

      \[\leadsto \color{blue}{\frac{x \cdot x - \frac{\left|y - x\right|}{2} \cdot \frac{\left|y - x\right|}{2}}{x - \frac{\left|y - x\right|}{2}}} \]

3. Applied egg-rr 31.1%

   \[\leadsto \color{blue}{\frac{x \cdot x - {\left(y - x\right)}^{2} \cdot 0.25}{x - \left(y - x\right) \cdot 0.5}} \]

4. Taylor expanded in x around 0 57.1%

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

   1. distribute-lft-out 57.1%

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

   2. +-commutative 57.1%

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

6. Simplified 57.1%

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

7. Final simplification 57.1%

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

Alternative 5: 30.4% accurate, 35.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x + \frac{\left|y - x\right|}{2} \]
2. Step-by-step derivation

   1. flip-+ 53.9%

      \[\leadsto \color{blue}{\frac{x \cdot x - \frac{\left|y - x\right|}{2} \cdot \frac{\left|y - x\right|}{2}}{x - \frac{\left|y - x\right|}{2}}} \]

3. Applied egg-rr 31.1%

   \[\leadsto \color{blue}{\frac{x \cdot x - {\left(y - x\right)}^{2} \cdot 0.25}{x - \left(y - x\right) \cdot 0.5}} \]

4. Taylor expanded in x around inf 31.2%

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

5. Final simplification 31.2%

   \[\leadsto x \cdot 0.5 \]

Alternative 6: 11.4% accurate, 107.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.9%

   \[x + \frac{\left|y - x\right|}{2} \]

2. Taylor expanded in x around inf 11.1%

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

3. Final simplification 11.1%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023297 
(FPCore (x y)
  :name "Graphics.Rendering.Chart.Plot.AreaSpots:renderSpotLegend from Chart-1.5.3"
  :precision binary64
  (+ x (/ (fabs (- y x)) 2.0)))