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

Percentage Accurate: 99.9% → 99.9%

Time: 3.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. Add Preprocessing

3. Final simplification 99.9%

   \[\leadsto x + \frac{\left|y - x\right|}{2} \]
4. Add Preprocessing

Alternative 2: 70.1% accurate, 1.0× speedup

Math

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

C

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

Python

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

Wolfram

code[x_, y_] := If[LessEqual[y, -2.7e+14], 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 < -2.7e14

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 84.1%

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

   if -2.7e14 < y

   1. Initial program 99.9%

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

      1. *-un-lft-identity 99.9%

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

      2. fma-define 99.9%

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

      3. add-sqr-sqrt 55.4%

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

      4. fabs-sqr 55.4%

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

      5. add-sqr-sqrt 62.4%

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

      6. frac-2neg 62.4%

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

      7. distribute-frac-neg 62.4%

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

      8. fmm-undef 62.4%

         \[\leadsto \color{blue}{1 \cdot x - \frac{y - x}{-2}} \]

      9. *-un-lft-identity 62.4%

         \[\leadsto \color{blue}{x} - \frac{y - x}{-2} \]

      10. metadata-eval 62.4%

          \[\leadsto x - \frac{y - x}{\color{blue}{-2}} \]

   4. Applied egg-rr 62.4%

      \[\leadsto \color{blue}{x - \frac{y - x}{-2}} \]

   5. Taylor expanded in x around 0 62.4%

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

      1. cancel-sign-sub-inv 62.4%

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

      2. metadata-eval 62.4%

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

      3. distribute-lft-out 62.4%

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

      4. +-commutative 62.4%

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

   7. Simplified 62.4%

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

4. Final simplification 67.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+14}:\\ \;\;\;\;\left|y - x\right| \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x + y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 45.1% accurate, 13.3× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.25e+14) (* x 0.5) (* y 0.5)))

C

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

Python

def code(x, y):
	tmp = 0
	if y <= 1.25e+14:
		tmp = x * 0.5
	else:
		tmp = y * 0.5
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1.25e+14)
		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.25e+14)
		tmp = x * 0.5;
	else
		tmp = y * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1.25e+14], N[(x * 0.5), $MachinePrecision], N[(y * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.25e14

   1. Initial program 99.9%

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

      1. *-un-lft-identity 99.9%

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

      2. fma-define 99.9%

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

      3. add-sqr-sqrt 30.2%

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

      4. fabs-sqr 30.2%

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

      5. add-sqr-sqrt 37.5%

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

      6. frac-2neg 37.5%

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

      7. distribute-frac-neg 37.5%

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

      8. fmm-undef 37.5%

         \[\leadsto \color{blue}{1 \cdot x - \frac{y - x}{-2}} \]

      9. *-un-lft-identity 37.5%

         \[\leadsto \color{blue}{x} - \frac{y - x}{-2} \]

      10. metadata-eval 37.5%

          \[\leadsto x - \frac{y - x}{\color{blue}{-2}} \]

   4. Applied egg-rr 37.5%

      \[\leadsto \color{blue}{x - \frac{y - x}{-2}} \]

   5. Taylor expanded in x around inf 33.9%

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

   if 1.25e14 < y

   1. Initial program 100.0%

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

      1. *-un-lft-identity 100.0%

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

      2. fma-define 100.0%

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

      3. add-sqr-sqrt 90.5%

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

      4. fabs-sqr 90.5%

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

      5. add-sqr-sqrt 92.6%

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

      6. frac-2neg 92.6%

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

      7. distribute-frac-neg 92.6%

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

      8. fmm-undef 92.6%

         \[\leadsto \color{blue}{1 \cdot x - \frac{y - x}{-2}} \]

      9. *-un-lft-identity 92.6%

         \[\leadsto \color{blue}{x} - \frac{y - x}{-2} \]

      10. metadata-eval 92.6%

          \[\leadsto x - \frac{y - x}{\color{blue}{-2}} \]

   4. Applied egg-rr 92.6%

      \[\leadsto \color{blue}{x - \frac{y - x}{-2}} \]

   5. Taylor expanded in x around 0 85.0%

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

4. Final simplification 45.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.25 \cdot 10^{+14}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;y \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 54.8% 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. Add Preprocessing
3. Step-by-step derivation

   1. *-un-lft-identity 99.9%

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

   2. fma-define 99.9%

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

   3. add-sqr-sqrt 43.4%

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

   4. fabs-sqr 43.4%

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

   5. add-sqr-sqrt 49.6%

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

   6. frac-2neg 49.6%

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

   7. distribute-frac-neg 49.6%

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

   8. fmm-undef 49.6%

      \[\leadsto \color{blue}{1 \cdot x - \frac{y - x}{-2}} \]

   9. *-un-lft-identity 49.6%

      \[\leadsto \color{blue}{x} - \frac{y - x}{-2} \]

   10. metadata-eval 49.6%

       \[\leadsto x - \frac{y - x}{\color{blue}{-2}} \]

4. Applied egg-rr 49.6%

   \[\leadsto \color{blue}{x - \frac{y - x}{-2}} \]

5. Taylor expanded in x around 0 49.6%

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

   1. cancel-sign-sub-inv 49.6%

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

   2. metadata-eval 49.6%

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

   3. distribute-lft-out 49.6%

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

   4. +-commutative 49.6%

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

7. Simplified 49.6%

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

8. Final simplification 49.6%

   \[\leadsto 0.5 \cdot \left(x + y\right) \]
9. Add Preprocessing

Alternative 5: 30.7% 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. Add Preprocessing
3. Step-by-step derivation

   1. *-un-lft-identity 99.9%

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

   2. fma-define 99.9%

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

   3. add-sqr-sqrt 43.4%

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

   4. fabs-sqr 43.4%

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

   5. add-sqr-sqrt 49.6%

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

   6. frac-2neg 49.6%

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

   7. distribute-frac-neg 49.6%

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

   8. fmm-undef 49.6%

      \[\leadsto \color{blue}{1 \cdot x - \frac{y - x}{-2}} \]

   9. *-un-lft-identity 49.6%

      \[\leadsto \color{blue}{x} - \frac{y - x}{-2} \]

   10. metadata-eval 49.6%

       \[\leadsto x - \frac{y - x}{\color{blue}{-2}} \]

4. Applied egg-rr 49.6%

   \[\leadsto \color{blue}{x - \frac{y - x}{-2}} \]

5. Taylor expanded in x around inf 28.5%

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

6. Final simplification 28.5%

   \[\leadsto x \cdot 0.5 \]
7. Add Preprocessing

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. Add Preprocessing

3. Taylor expanded in x around inf 11.8%

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

4. Final simplification 11.8%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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