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

Percentage Accurate: 99.9% → 99.9%

Time: 2.4s

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

Math

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

C

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

Python

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

Wolfram

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

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 74.2%

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

   if -7.5e-74 < 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 69.7%

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

      5. fabs-sqr 69.7%

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

      6. add-sqr-sqrt 75.2%

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

      7. metadata-eval 75.2%

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

   3. Applied egg-rr 75.2%

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

   4. Taylor expanded in y around 0 75.2%

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

      1. +-commutative 75.2%

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

      2. associate-+r+ 75.2%

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

      3. distribute-lft1-in 75.2%

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

      4. metadata-eval 75.2%

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

      5. distribute-lft-out 75.2%

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

   6. Simplified 75.2%

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

4. Final simplification 74.9%

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

Alternative 3: 45.6% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 6e-10) (* x 0.5) (* y 0.5)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6e-10

   1. Initial program 99.9%

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

      1. add-cube-cbrt 98.0%

         \[\leadsto \color{blue}{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}} \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right) \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}} \]

      2. pow3 98.0%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right)}^{3}} \]

      3. +-commutative 98.0%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\frac{\left|y - x\right|}{2} + x}}\right)}^{3} \]

      4. div-inv 98.0%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\left|y - x\right| \cdot \frac{1}{2}} + x}\right)}^{3} \]

      5. fma-def 98.0%

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

      6. add-sqr-sqrt 36.1%

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

      7. fabs-sqr 36.1%

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

      8. add-sqr-sqrt 41.2%

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

      9. metadata-eval 41.2%

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

   3. Applied egg-rr 41.2%

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

   4. Taylor expanded in y around 0 38.7%

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

      1. pow-base-1 38.7%

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

      2. *-lft-identity 38.7%

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

      3. distribute-lft1-in 38.7%

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

      4. metadata-eval 38.7%

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

      5. *-commutative 38.7%

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

   6. Simplified 38.7%

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

   if 6e-10 < y

   1. Initial program 99.9%

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

      1. add-cube-cbrt 97.8%

         \[\leadsto \color{blue}{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}} \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right) \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}} \]

      2. pow3 97.9%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right)}^{3}} \]

      3. +-commutative 97.9%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\frac{\left|y - x\right|}{2} + x}}\right)}^{3} \]

      4. div-inv 97.9%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\left|y - x\right| \cdot \frac{1}{2}} + x}\right)}^{3} \]

      5. fma-def 97.9%

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

      6. add-sqr-sqrt 83.3%

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

      7. fabs-sqr 83.3%

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

      8. add-sqr-sqrt 85.9%

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

      9. metadata-eval 85.9%

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

   3. Applied egg-rr 85.9%

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

   4. Taylor expanded in x around 0 70.8%

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

      1. *-commutative 70.8%

         \[\leadsto \color{blue}{\left({1}^{0.3333333333333333} \cdot y\right) \cdot 0.5} \]

      2. pow-base-1 70.8%

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

      3. *-lft-identity 70.8%

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

   6. Simplified 70.8%

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

4. Final simplification 48.0%

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

Alternative 4: 54.7% 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 50.4%

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

   5. fabs-sqr 50.4%

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

   6. add-sqr-sqrt 55.2%

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

   7. metadata-eval 55.2%

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

3. Applied egg-rr 55.2%

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

4. Taylor expanded in y around 0 55.2%

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

   1. +-commutative 55.2%

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

   2. associate-+r+ 55.2%

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

   3. distribute-lft1-in 55.2%

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

   4. metadata-eval 55.2%

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

   5. distribute-lft-out 55.2%

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

6. Simplified 55.2%

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

7. Final simplification 55.2%

   \[\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. add-cube-cbrt 98.0%

      \[\leadsto \color{blue}{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}} \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right) \cdot \sqrt[3]{x + \frac{\left|y - x\right|}{2}}} \]

   2. pow3 98.0%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{x + \frac{\left|y - x\right|}{2}}\right)}^{3}} \]

   3. +-commutative 98.0%

      \[\leadsto {\left(\sqrt[3]{\color{blue}{\frac{\left|y - x\right|}{2} + x}}\right)}^{3} \]

   4. div-inv 98.0%

      \[\leadsto {\left(\sqrt[3]{\color{blue}{\left|y - x\right| \cdot \frac{1}{2}} + x}\right)}^{3} \]

   5. fma-def 98.0%

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

   6. add-sqr-sqrt 49.7%

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

   7. fabs-sqr 49.7%

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

   8. add-sqr-sqrt 54.2%

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

   9. metadata-eval 54.2%

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

3. Applied egg-rr 54.2%

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

4. Taylor expanded in y around 0 32.8%

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

   1. pow-base-1 32.8%

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

   2. *-lft-identity 32.8%

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

   3. distribute-lft1-in 32.8%

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

   4. metadata-eval 32.8%

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

   5. *-commutative 32.8%

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

6. Simplified 32.8%

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

7. Final simplification 32.8%

   \[\leadsto x \cdot 0.5 \]

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

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

3. Final simplification 11.5%

   \[\leadsto x \]

Reproduce

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