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

Percentage Accurate: 99.9% → 99.9%

Time: 6.3s

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: 69.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -9e-19) {
		tmp = 0.5 * (x + y);
	} else {
		tmp = fabs((y - x)) * 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 (x <= (-9d-19)) then
        tmp = 0.5d0 * (x + y)
    else
        tmp = abs((y - x)) * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -9.00000000000000026e-19

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. div-inv 100.0%

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

      3. fma-def 100.0%

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

      4. add-sqr-sqrt 88.7%

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

      5. fabs-sqr 88.7%

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

      6. add-sqr-sqrt 89.6%

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

      7. metadata-eval 89.6%

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

   3. Applied egg-rr 89.6%

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

   4. Taylor expanded in y around 0 89.6%

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

      1. associate-+r+ 89.6%

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

      2. distribute-rgt1-in 89.6%

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

      3. metadata-eval 89.6%

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

      4. distribute-lft-out 89.6%

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

   6. Simplified 89.6%

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

   if -9.00000000000000026e-19 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 61.4%

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

4. Final simplification 68.8%

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

Alternative 3: 32.2% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 6.6e-240) x (* y 0.5)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 6.6e-240) {
		tmp = x;
	} 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 <= 6.6d-240) then
        tmp = x
    else
        tmp = y * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.6000000000000003e-240

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf 13.3%

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

   if 6.6000000000000003e-240 < y

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. div-inv 100.0%

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

      3. fma-def 100.0%

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

      4. add-sqr-sqrt 73.0%

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

      5. fabs-sqr 73.0%

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

      6. add-sqr-sqrt 78.3%

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

      7. metadata-eval 78.3%

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

   3. Applied egg-rr 78.3%

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

   4. Taylor expanded in y around inf 57.8%

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

4. Final simplification 35.7%

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

Alternative 4: 46.0% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 5.5e-27) (* x 0.5) (* y 0.5)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 5.5e-27) {
		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 <= 5.5d-27) 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 <= 5.5e-27) {
		tmp = x * 0.5;
	} else {
		tmp = y * 0.5;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 5.5e-27)
		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 <= 5.5e-27)
		tmp = x * 0.5;
	else
		tmp = y * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.5000000000000002e-27

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. div-inv 99.9%

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

      3. fma-def 99.9%

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

      4. add-sqr-sqrt 36.4%

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

      5. fabs-sqr 36.4%

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

      6. add-sqr-sqrt 43.2%

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

      7. metadata-eval 43.2%

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

   3. Applied egg-rr 43.2%

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

   4. Taylor expanded in y around 0 37.2%

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

      1. distribute-rgt1-in 37.2%

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

      2. metadata-eval 37.2%

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

      3. *-commutative 37.2%

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

   6. Simplified 37.2%

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

   if 5.5000000000000002e-27 < y

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. div-inv 100.0%

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

      3. fma-def 100.0%

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

      4. add-sqr-sqrt 89.2%

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

      5. fabs-sqr 89.2%

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

      6. add-sqr-sqrt 91.6%

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

      7. metadata-eval 91.6%

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

   3. Applied egg-rr 91.6%

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

   4. Taylor expanded in y around inf 77.5%

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

4. Final simplification 49.6%

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

Alternative 5: 55.2% 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. +-commutative 99.9%

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

   2. div-inv 99.9%

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

   3. fma-def 99.9%

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

   4. add-sqr-sqrt 52.7%

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

   5. fabs-sqr 52.7%

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

   6. add-sqr-sqrt 58.2%

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

   7. metadata-eval 58.2%

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

3. Applied egg-rr 58.2%

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

4. Taylor expanded in y around 0 58.2%

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

   1. associate-+r+ 58.2%

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

   2. distribute-rgt1-in 58.2%

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

   3. metadata-eval 58.2%

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

   4. distribute-lft-out 58.2%

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

6. Simplified 58.2%

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

7. Final simplification 58.2%

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

Alternative 6: 11.3% 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.8%

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

3. Final simplification 11.8%

   \[\leadsto x \]

Reproduce

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