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

Percentage Accurate: 99.9% → 99.9%

Time: 5.5s

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.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.1 \cdot 10^{-132}:\\ \;\;\;\;\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 -5.1e-132) (* (fabs (- y x)) 0.5) (* 0.5 (+ x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.1e-132) {
		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 <= (-5.1d-132)) 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 <= -5.1e-132) {
		tmp = Math.abs((y - x)) * 0.5;
	} else {
		tmp = 0.5 * (x + y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -5.1e-132:
		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 <= -5.1e-132)
		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 <= -5.1e-132)
		tmp = abs((y - x)) * 0.5;
	else
		tmp = 0.5 * (x + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -5.1e-132], 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 < -5.10000000000000005e-132

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 69.2%

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

   if -5.10000000000000005e-132 < y

   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 67.5%

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

      5. fabs-sqr 67.5%

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

      6. add-sqr-sqrt 73.1%

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

      7. metadata-eval 73.1%

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

   3. Applied egg-rr 73.1%

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

   4. Taylor expanded in y around 0 73.1%

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

      1. +-commutative 73.1%

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

      2. associate-+r+ 73.2%

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

      3. +-commutative 73.2%

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

      4. distribute-lft1-in 73.2%

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

      5. metadata-eval 73.2%

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

      6. distribute-lft-out 73.2%

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

   6. Simplified 73.2%

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

4. Final simplification 71.7%

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

Alternative 3: 31.6% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.55e-162) x (* y 0.5)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.5499999999999999e-162

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf 12.8%

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

   if 1.5499999999999999e-162 < y

   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 83.2%

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

      5. fabs-sqr 83.2%

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

      6. add-sqr-sqrt 86.7%

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

      7. metadata-eval 86.7%

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

   3. Applied egg-rr 86.7%

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

   4. Taylor expanded in y around inf 64.4%

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

4. Final simplification 31.5%

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

Alternative 4: 45.9% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.08e-106) (* x 0.5) (* y 0.5)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.08e-106

   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 29.9%

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

      5. fabs-sqr 29.9%

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

      6. add-sqr-sqrt 36.3%

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

      7. metadata-eval 36.3%

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

   3. Applied egg-rr 36.3%

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

   4. Taylor expanded in y around 0 33.5%

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

      1. distribute-lft1-in 33.5%

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

      2. metadata-eval 33.5%

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

      3. *-commutative 33.5%

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

   6. Simplified 33.5%

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

   if 1.08e-106 < y

   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 86.3%

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

      5. fabs-sqr 86.3%

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

      6. add-sqr-sqrt 89.3%

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

      7. metadata-eval 89.3%

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

   3. Applied egg-rr 89.3%

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

   4. Taylor expanded in y around inf 73.0%

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

4. Final simplification 45.4%

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

Alternative 5: 54.9% 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 46.9%

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

   5. fabs-sqr 46.9%

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

   6. add-sqr-sqrt 52.3%

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

   7. metadata-eval 52.3%

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

3. Applied egg-rr 52.3%

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

4. Taylor expanded in y around 0 52.3%

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

   1. +-commutative 52.3%

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

   2. associate-+r+ 52.3%

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

   3. +-commutative 52.3%

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

   4. distribute-lft1-in 52.3%

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

   5. metadata-eval 52.3%

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

   6. distribute-lft-out 52.3%

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

6. Simplified 52.3%

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

7. Final simplification 52.3%

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

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.4%

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

3. Final simplification 11.4%

   \[\leadsto x \]

Reproduce

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