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

Percentage Accurate: 99.9% → 100.0%

Time: 5.5s

Alternatives: 7

Speedup: 1.0×

• 22.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (+ y z)) (* z 5.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return (x * (y + z)) + (z * 5.0)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (+ y z)) (* z 5.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return (x * (y + z)) + (z * 5.0)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z, 5, x \cdot \left(z + y\right)\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma z 5.0 (* x (+ z y))))

C

double code(double x, double y, double z) {
	return fma(z, 5.0, (x * (z + y)));
}

Julia

function code(x, y, z)
	return fma(z, 5.0, Float64(x * Float64(z + y)))
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \left(y + z\right) + z \cdot 5 \]
2. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. fma-def 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, 5, x \cdot \left(y + z\right)\right)} \]

3. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, 5, x \cdot \left(y + z\right)\right)} \]

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(z, 5, x \cdot \left(z + y\right)\right) \]

Alternative 2: 62.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{-38}:\\ \;\;\;\;z \cdot 5\\ \mathbf{elif}\;x \leq 1.15 \cdot 10^{+48} \lor \neg \left(x \leq 2.7 \cdot 10^{+164}\right) \land x \leq 7.6 \cdot 10^{+239}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.0)
   (* z x)
   (if (<= x 4.2e-38)
     (* z 5.0)
     (if (or (<= x 1.15e+48) (and (not (<= x 2.7e+164)) (<= x 7.6e+239)))
       (* x y)
       (* z x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.0) {
		tmp = z * x;
	} else if (x <= 4.2e-38) {
		tmp = z * 5.0;
	} else if ((x <= 1.15e+48) || (!(x <= 2.7e+164) && (x <= 7.6e+239))) {
		tmp = x * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-5.0d0)) then
        tmp = z * x
    else if (x <= 4.2d-38) then
        tmp = z * 5.0d0
    else if ((x <= 1.15d+48) .or. (.not. (x <= 2.7d+164)) .and. (x <= 7.6d+239)) then
        tmp = x * y
    else
        tmp = z * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.0) {
		tmp = z * x;
	} else if (x <= 4.2e-38) {
		tmp = z * 5.0;
	} else if ((x <= 1.15e+48) || (!(x <= 2.7e+164) && (x <= 7.6e+239))) {
		tmp = x * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -5.0:
		tmp = z * x
	elif x <= 4.2e-38:
		tmp = z * 5.0
	elif (x <= 1.15e+48) or (not (x <= 2.7e+164) and (x <= 7.6e+239)):
		tmp = x * y
	else:
		tmp = z * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.0)
		tmp = Float64(z * x);
	elseif (x <= 4.2e-38)
		tmp = Float64(z * 5.0);
	elseif ((x <= 1.15e+48) || (!(x <= 2.7e+164) && (x <= 7.6e+239)))
		tmp = Float64(x * y);
	else
		tmp = Float64(z * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -5.0)
		tmp = z * x;
	elseif (x <= 4.2e-38)
		tmp = z * 5.0;
	elseif ((x <= 1.15e+48) || (~((x <= 2.7e+164)) && (x <= 7.6e+239)))
		tmp = x * y;
	else
		tmp = z * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.0], N[(z * x), $MachinePrecision], If[LessEqual[x, 4.2e-38], N[(z * 5.0), $MachinePrecision], If[Or[LessEqual[x, 1.15e+48], And[N[Not[LessEqual[x, 2.7e+164]], $MachinePrecision], LessEqual[x, 7.6e+239]]], N[(x * y), $MachinePrecision], N[(z * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -5 or 1.15e48 < x < 2.70000000000000006e164 or 7.6000000000000003e239 < x

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around 0 62.0%

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

      1. +-commutative 62.0%

         \[\leadsto \color{blue}{5 \cdot z + z \cdot x} \]

      2. *-commutative 62.0%

         \[\leadsto 5 \cdot z + \color{blue}{x \cdot z} \]

      3. distribute-rgt-in 62.0%

         \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]

   4. Simplified 62.0%

      \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]

   5. Taylor expanded in x around inf 61.5%

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

   if -5 < x < 4.20000000000000026e-38

   1. Initial program 99.8%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around 0 73.0%

      \[\leadsto \color{blue}{5 \cdot z} \]

   if 4.20000000000000026e-38 < x < 1.15e48 or 2.70000000000000006e164 < x < 7.6000000000000003e239

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around inf 61.9%

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

4. Final simplification 66.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{-38}:\\ \;\;\;\;z \cdot 5\\ \mathbf{elif}\;x \leq 1.15 \cdot 10^{+48} \lor \neg \left(x \leq 2.7 \cdot 10^{+164}\right) \land x \leq 7.6 \cdot 10^{+239}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \]

Alternative 3: 73.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{-71} \lor \neg \left(z \leq 6 \cdot 10^{+28}\right):\\ \;\;\;\;z \cdot \left(5 + x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.6e-71) (not (<= z 6e+28))) (* z (+ 5.0 x)) (* x y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.6e-71) || !(z <= 6e+28)) {
		tmp = z * (5.0 + x);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-3.6d-71)) .or. (.not. (z <= 6d+28))) then
        tmp = z * (5.0d0 + x)
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.6e-71) || !(z <= 6e+28)) {
		tmp = z * (5.0 + x);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.6e-71) or not (z <= 6e+28):
		tmp = z * (5.0 + x)
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.6e-71) || !(z <= 6e+28))
		tmp = Float64(z * Float64(5.0 + x));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.6e-71) || ~((z <= 6e+28)))
		tmp = z * (5.0 + x);
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.6e-71], N[Not[LessEqual[z, 6e+28]], $MachinePrecision]], N[(z * N[(5.0 + x), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6e-71 or 6.0000000000000002e28 < z

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around 0 88.5%

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

      1. +-commutative 88.5%

         \[\leadsto \color{blue}{5 \cdot z + z \cdot x} \]

      2. *-commutative 88.5%

         \[\leadsto 5 \cdot z + \color{blue}{x \cdot z} \]

      3. distribute-rgt-in 88.5%

         \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]

   4. Simplified 88.5%

      \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]

   if -3.6e-71 < z < 6.0000000000000002e28

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around inf 66.2%

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

4. Final simplification 78.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{-71} \lor \neg \left(z \leq 6 \cdot 10^{+28}\right):\\ \;\;\;\;z \cdot \left(5 + x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 4: 85.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{+15} \lor \neg \left(x \leq 4.1 \cdot 10^{-38}\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(5 + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.9e+15) (not (<= x 4.1e-38))) (* x (+ z y)) (* z (+ 5.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.9e+15) || !(x <= 4.1e-38)) {
		tmp = x * (z + y);
	} else {
		tmp = z * (5.0 + x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.9d+15)) .or. (.not. (x <= 4.1d-38))) then
        tmp = x * (z + y)
    else
        tmp = z * (5.0d0 + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.9e+15) || !(x <= 4.1e-38)) {
		tmp = x * (z + y);
	} else {
		tmp = z * (5.0 + x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.9e+15) or not (x <= 4.1e-38):
		tmp = x * (z + y)
	else:
		tmp = z * (5.0 + x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.9e+15) || !(x <= 4.1e-38))
		tmp = Float64(x * Float64(z + y));
	else
		tmp = Float64(z * Float64(5.0 + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.9e+15) || ~((x <= 4.1e-38)))
		tmp = x * (z + y);
	else
		tmp = z * (5.0 + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.9e+15], N[Not[LessEqual[x, 4.1e-38]], $MachinePrecision]], N[(x * N[(z + y), $MachinePrecision]), $MachinePrecision], N[(z * N[(5.0 + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.9e15 or 4.0999999999999998e-38 < x

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around inf 95.5%

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

      1. +-commutative 95.5%

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

   4. Simplified 95.5%

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

   if -1.9e15 < x < 4.0999999999999998e-38

   1. Initial program 99.8%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around 0 74.7%

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

      1. +-commutative 74.7%

         \[\leadsto \color{blue}{5 \cdot z + z \cdot x} \]

      2. *-commutative 74.7%

         \[\leadsto 5 \cdot z + \color{blue}{x \cdot z} \]

      3. distribute-rgt-in 74.7%

         \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]

   4. Simplified 74.7%

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

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{+15} \lor \neg \left(x \leq 4.1 \cdot 10^{-38}\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(5 + x\right)\\ \end{array} \]

Alternative 5: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (+ z y)) (* z 5.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return (x * (z + y)) + (z * 5.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \left(y + z\right) + z \cdot 5 \]

2. Final simplification 99.9%

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

Alternative 6: 60.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.31:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.05 \cdot 10^{-37}:\\ \;\;\;\;z \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -0.31) (* x y) (if (<= x 1.05e-37) (* z 5.0) (* x y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -0.31) {
		tmp = x * y;
	} else if (x <= 1.05e-37) {
		tmp = z * 5.0;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-0.31d0)) then
        tmp = x * y
    else if (x <= 1.05d-37) then
        tmp = z * 5.0d0
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -0.31) {
		tmp = x * y;
	} else if (x <= 1.05e-37) {
		tmp = z * 5.0;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -0.31:
		tmp = x * y
	elif x <= 1.05e-37:
		tmp = z * 5.0
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -0.31)
		tmp = Float64(x * y);
	elseif (x <= 1.05e-37)
		tmp = Float64(z * 5.0);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -0.31)
		tmp = x * y;
	elseif (x <= 1.05e-37)
		tmp = z * 5.0;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -0.31], N[(x * y), $MachinePrecision], If[LessEqual[x, 1.05e-37], N[(z * 5.0), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -0.309999999999999998 or 1.05e-37 < x

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around inf 47.5%

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

   if -0.309999999999999998 < x < 1.05e-37

   1. Initial program 99.8%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around 0 73.0%

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

4. Final simplification 59.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.31:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.05 \cdot 10^{-37}:\\ \;\;\;\;z \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 7: 36.0% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ z \cdot 5 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* z 5.0))

C

double code(double x, double y, double z) {
	return z * 5.0;
}

Fortran

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

Java

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

Python

def code(x, y, z):
	return z * 5.0

Julia

function code(x, y, z)
	return Float64(z * 5.0)
end

MATLAB

function tmp = code(x, y, z)
	tmp = z * 5.0;
end

Wolfram

code[x_, y_, z_] := N[(z * 5.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot \left(y + z\right) + z \cdot 5 \]

2. Taylor expanded in x around 0 36.3%

   \[\leadsto \color{blue}{5 \cdot z} \]

3. Final simplification 36.3%

   \[\leadsto z \cdot 5 \]

Developer target: 97.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (* (+ x 5.0) z) (* x y)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return ((x + 5.0) * z) + (x * y)

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :herbie-target
  (+ (* (+ x 5.0) z) (* x y))

  (+ (* x (+ y z)) (* z 5.0)))