Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, A

Percentage Accurate: 100.0% → 100.0%

Time: 1.2s

Alternatives: 3

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(x + y\right) + x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ x y) x))

C

double code(double x, double y) {
	return (x + y) + x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x + y) + x
end function

Java

public static double code(double x, double y) {
	return (x + y) + x;
}

Python

def code(x, y):
	return (x + y) + x

Julia

function code(x, y)
	return Float64(Float64(x + y) + x)
end

MATLAB

function tmp = code(x, y)
	tmp = (x + y) + x;
end

Wolfram

code[x_, y_] := N[(N[(x + y), $MachinePrecision] + x), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) + x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ x y) x))

C

double code(double x, double y) {
	return (x + y) + x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x + y) + x
end function

Java

public static double code(double x, double y) {
	return (x + y) + x;
}

Python

def code(x, y):
	return (x + y) + x

Julia

function code(x, y)
	return Float64(Float64(x + y) + x)
end

MATLAB

function tmp = code(x, y)
	tmp = (x + y) + x;
end

Wolfram

code[x_, y_] := N[(N[(x + y), $MachinePrecision] + x), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 2 \cdot x + y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (* 2.0 x) y))

C

double code(double x, double y) {
	return (2.0 * x) + y;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (2.0d0 * x) + y
end function

Java

public static double code(double x, double y) {
	return (2.0 * x) + y;
}

Python

def code(x, y):
	return (2.0 * x) + y

Julia

function code(x, y)
	return Float64(Float64(2.0 * x) + y)
end

MATLAB

function tmp = code(x, y)
	tmp = (2.0 * x) + y;
end

Wolfram

code[x_, y_] := N[(N[(2.0 * x), $MachinePrecision] + y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) + x \]

2. Taylor expanded in x around 0 100.0%

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

3. Final simplification 100.0%

   \[\leadsto 2 \cdot x + y \]

Alternative 2: 72.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+103}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq -9 \cdot 10^{+42}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-30}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{+63}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.45e+103)
   (+ x x)
   (if (<= x -9e+42)
     y
     (if (<= x -1.25e-30) (+ x x) (if (<= x 7.2e+63) y (+ x x))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+103) {
		tmp = x + x;
	} else if (x <= -9e+42) {
		tmp = y;
	} else if (x <= -1.25e-30) {
		tmp = x + x;
	} else if (x <= 7.2e+63) {
		tmp = y;
	} else {
		tmp = x + x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.45d+103)) then
        tmp = x + x
    else if (x <= (-9d+42)) then
        tmp = y
    else if (x <= (-1.25d-30)) then
        tmp = x + x
    else if (x <= 7.2d+63) then
        tmp = y
    else
        tmp = x + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+103) {
		tmp = x + x;
	} else if (x <= -9e+42) {
		tmp = y;
	} else if (x <= -1.25e-30) {
		tmp = x + x;
	} else if (x <= 7.2e+63) {
		tmp = y;
	} else {
		tmp = x + x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.45e+103:
		tmp = x + x
	elif x <= -9e+42:
		tmp = y
	elif x <= -1.25e-30:
		tmp = x + x
	elif x <= 7.2e+63:
		tmp = y
	else:
		tmp = x + x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.45e+103)
		tmp = Float64(x + x);
	elseif (x <= -9e+42)
		tmp = y;
	elseif (x <= -1.25e-30)
		tmp = Float64(x + x);
	elseif (x <= 7.2e+63)
		tmp = y;
	else
		tmp = Float64(x + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.45e+103)
		tmp = x + x;
	elseif (x <= -9e+42)
		tmp = y;
	elseif (x <= -1.25e-30)
		tmp = x + x;
	elseif (x <= 7.2e+63)
		tmp = y;
	else
		tmp = x + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.45e+103], N[(x + x), $MachinePrecision], If[LessEqual[x, -9e+42], y, If[LessEqual[x, -1.25e-30], N[(x + x), $MachinePrecision], If[LessEqual[x, 7.2e+63], y, N[(x + x), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.4499999999999999e103 or -9.00000000000000025e42 < x < -1.24999999999999993e-30 or 7.19999999999999998e63 < x

   1. Initial program 100.0%

      \[\left(x + y\right) + x \]

   2. Taylor expanded in x around inf 80.0%

      \[\leadsto \color{blue}{2 \cdot x} \]
   3. Step-by-step derivation

      1. count-2 80.0%

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

   4. Simplified 80.0%

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

   if -1.4499999999999999e103 < x < -9.00000000000000025e42 or -1.24999999999999993e-30 < x < 7.19999999999999998e63

   1. Initial program 100.0%

      \[\left(x + y\right) + x \]

   2. Taylor expanded in x around 0 78.4%

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

4. Final simplification 79.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+103}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq -9 \cdot 10^{+42}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-30}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{+63}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x + x\\ \end{array} \]

Alternative 3: 50.3% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 y)

C

double code(double x, double y) {
	return y;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y
end function

Java

public static double code(double x, double y) {
	return y;
}

Python

def code(x, y):
	return y

Julia

function code(x, y)
	return y
end

MATLAB

function tmp = code(x, y)
	tmp = y;
end

Wolfram

code[x_, y_] := y

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) + x \]

2. Taylor expanded in x around 0 52.4%

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

3. Final simplification 52.4%

   \[\leadsto y \]

Developer target: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ y + 2 \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ y (* 2.0 x)))

C

double code(double x, double y) {
	return y + (2.0 * x);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y + (2.0d0 * x)
end function

Java

public static double code(double x, double y) {
	return y + (2.0 * x);
}

Python

def code(x, y):
	return y + (2.0 * x)

Julia

function code(x, y)
	return Float64(y + Float64(2.0 * x))
end

MATLAB

function tmp = code(x, y)
	tmp = y + (2.0 * x);
end

Wolfram

code[x_, y_] := N[(y + N[(2.0 * x), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023192 
(FPCore (x y)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, A"
  :precision binary64

  :herbie-target
  (+ y (* 2.0 x))

  (+ (+ x y) x))