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

Percentage Accurate: 99.9% → 99.9%

Time: 1.9s

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

Math

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.6e-41) {
		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.6d-41)) 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.6e-41) {
		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.6e-41:
		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.6e-41)
		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.6e-41)
		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.6e-41], 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.60000000000000006e-41

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0 72.9%

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

   if -1.60000000000000006e-41 < 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.2%

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

      5. fabs-sqr 67.2%

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

      6. add-sqr-sqrt 72.8%

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

      7. metadata-eval 72.8%

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

   3. Applied egg-rr 72.8%

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

   4. Taylor expanded in y around 0 72.8%

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

      1. +-commutative 72.8%

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

      2. associate-+r+ 72.8%

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

      3. distribute-lft1-in 72.8%

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

      4. metadata-eval 72.8%

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

      5. distribute-lft-out 72.8%

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

   6. Simplified 72.8%

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

4. Final simplification 72.8%

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

Alternative 3: 31.4% accurate, 21.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.22e-245) x (* y 0.5)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.22e-245

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf 13.1%

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

   if 1.22e-245 < 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 82.0%

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

      5. fabs-sqr 82.0%

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

      6. add-sqr-sqrt 85.8%

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

      7. metadata-eval 85.8%

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

   3. Applied egg-rr 85.8%

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

   4. Taylor expanded in y around inf 57.6%

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

4. Final simplification 32.2%

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

Alternative 4: 45.2% accurate, 21.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3200000000:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;y \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 3200000000.0) (* x 0.5) (* y 0.5)))

C

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

Python

def code(x, y):
	tmp = 0
	if y <= 3200000000.0:
		tmp = x * 0.5
	else:
		tmp = y * 0.5
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 3.2e9

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

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

      5. fabs-sqr 39.4%

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

      6. add-sqr-sqrt 45.3%

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

      7. metadata-eval 45.3%

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

   3. Applied egg-rr 45.3%

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

   4. Taylor expanded in y around 0 38.5%

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

      1. distribute-lft1-in 38.5%

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

      2. metadata-eval 38.5%

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

      3. *-commutative 38.5%

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

   6. Simplified 38.5%

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

   if 3.2e9 < 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 85.0%

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

      5. fabs-sqr 85.0%

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

      6. add-sqr-sqrt 88.3%

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

      7. metadata-eval 88.3%

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

   3. Applied egg-rr 88.3%

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

   4. Taylor expanded in y around inf 71.0%

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

4. Final simplification 47.4%

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

Alternative 5: 54.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 51.9%

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

   5. fabs-sqr 51.9%

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

   6. add-sqr-sqrt 57.0%

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

   7. metadata-eval 57.0%

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

3. Applied egg-rr 57.0%

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

4. Taylor expanded in y around 0 57.0%

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

   1. +-commutative 57.0%

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

   2. associate-+r+ 57.0%

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

   3. distribute-lft1-in 57.0%

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

   4. metadata-eval 57.0%

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

   5. distribute-lft-out 57.0%

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

6. Simplified 57.0%

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

7. Final simplification 57.0%

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

Alternative 6: 11.5% 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.9%

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

3. Final simplification 11.9%

   \[\leadsto x \]

Reproduce

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