Numeric.Log:$clog1p from log-domain-0.10.2.1, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.1s

Alternatives: 6

Speedup: 1.2×

• Unsound rule application detected in e-graph. Results may not be sound.

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. distribute-lft-out 100.0%

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

3. Simplified 100.0%

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

   1. +-commutative 100.0%

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

   2. fma-def 100.0%

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

   3. +-commutative 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 83.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 6.2 \cdot 10^{-86}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{elif}\;y \cdot y \leq 1.16 \cdot 10^{+20}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;y \cdot y \leq 1.8 \cdot 10^{+124}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 6.2e-86)
   (* x (+ x 2.0))
   (if (<= (* y y) 1.16e+20)
     (* y y)
     (if (<= (* y y) 1.8e+124) (* x x) (* y y)))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 6.2e-86) {
		tmp = x * (x + 2.0);
	} else if ((y * y) <= 1.16e+20) {
		tmp = y * y;
	} else if ((y * y) <= 1.8e+124) {
		tmp = x * x;
	} else {
		tmp = y * 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 * y) <= 6.2d-86) then
        tmp = x * (x + 2.0d0)
    else if ((y * y) <= 1.16d+20) then
        tmp = y * y
    else if ((y * y) <= 1.8d+124) then
        tmp = x * x
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 6.2e-86) {
		tmp = x * (x + 2.0);
	} else if ((y * y) <= 1.16e+20) {
		tmp = y * y;
	} else if ((y * y) <= 1.8e+124) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 6.2e-86:
		tmp = x * (x + 2.0)
	elif (y * y) <= 1.16e+20:
		tmp = y * y
	elif (y * y) <= 1.8e+124:
		tmp = x * x
	else:
		tmp = y * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 6.2e-86)
		tmp = Float64(x * Float64(x + 2.0));
	elseif (Float64(y * y) <= 1.16e+20)
		tmp = Float64(y * y);
	elseif (Float64(y * y) <= 1.8e+124)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 6.2e-86)
		tmp = x * (x + 2.0);
	elseif ((y * y) <= 1.16e+20)
		tmp = y * y;
	elseif ((y * y) <= 1.8e+124)
		tmp = x * x;
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 6.2e-86], N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * y), $MachinePrecision], 1.16e+20], N[(y * y), $MachinePrecision], If[LessEqual[N[(y * y), $MachinePrecision], 1.8e+124], N[(x * x), $MachinePrecision], N[(y * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y y) < 6.19999999999999977e-86

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 95.8%

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

   if 6.19999999999999977e-86 < (*.f64 y y) < 1.16e20 or 1.79999999999999993e124 < (*.f64 y y)

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 82.6%

      \[\leadsto \color{blue}{{y}^{2}} \]
   5. Step-by-step derivation

      1. unpow2 82.6%

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

   6. Simplified 82.6%

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

   if 1.16e20 < (*.f64 y y) < 1.79999999999999993e124

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 70.2%

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

      1. unpow2 70.2%

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

   6. Simplified 70.2%

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

4. Final simplification 87.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 6.2 \cdot 10^{-86}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{elif}\;y \cdot y \leq 1.16 \cdot 10^{+20}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;y \cdot y \leq 1.8 \cdot 10^{+124}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 3: 89.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+28}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 4.7 \cdot 10^{-26}:\\ \;\;\;\;y \cdot y + \left(x + x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.2e+28)
   (* x x)
   (if (<= x 4.7e-26) (+ (* y y) (+ x x)) (* x (+ x 2.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.2e+28) {
		tmp = x * x;
	} else if (x <= 4.7e-26) {
		tmp = (y * y) + (x + x);
	} else {
		tmp = x * (x + 2.0);
	}
	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.2d+28)) then
        tmp = x * x
    else if (x <= 4.7d-26) then
        tmp = (y * y) + (x + x)
    else
        tmp = x * (x + 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.2e+28) {
		tmp = x * x;
	} else if (x <= 4.7e-26) {
		tmp = (y * y) + (x + x);
	} else {
		tmp = x * (x + 2.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.2e+28:
		tmp = x * x
	elif x <= 4.7e-26:
		tmp = (y * y) + (x + x)
	else:
		tmp = x * (x + 2.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.2e+28)
		tmp = Float64(x * x);
	elseif (x <= 4.7e-26)
		tmp = Float64(Float64(y * y) + Float64(x + x));
	else
		tmp = Float64(x * Float64(x + 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.2e+28)
		tmp = x * x;
	elseif (x <= 4.7e-26)
		tmp = (y * y) + (x + x);
	else
		tmp = x * (x + 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.2e+28], N[(x * x), $MachinePrecision], If[LessEqual[x, 4.7e-26], N[(N[(y * y), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.19999999999999991e28

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 86.2%

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

      1. unpow2 86.2%

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

   6. Simplified 86.2%

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

   if -1.19999999999999991e28 < x < 4.69999999999999989e-26

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 97.3%

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

      1. count-2 97.3%

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

   6. Simplified 97.3%

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

   if 4.69999999999999989e-26 < x

   1. Initial program 99.9%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 85.2%

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

4. Final simplification 91.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+28}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 4.7 \cdot 10^{-26}:\\ \;\;\;\;y \cdot y + \left(x + x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \end{array} \]

Alternative 4: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. distribute-lft-out 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 5: 71.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+23}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 4.7 \cdot 10^{-26}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.38e+23) (* x x) (if (<= x 4.7e-26) (* y y) (* x x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.38e+23) {
		tmp = x * x;
	} else if (x <= 4.7e-26) {
		tmp = y * 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.38d+23)) then
        tmp = x * x
    else if (x <= 4.7d-26) then
        tmp = y * 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.38e+23) {
		tmp = x * x;
	} else if (x <= 4.7e-26) {
		tmp = y * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.38e+23:
		tmp = x * x
	elif x <= 4.7e-26:
		tmp = y * y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.38e+23)
		tmp = Float64(x * x);
	elseif (x <= 4.7e-26)
		tmp = Float64(y * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.38e+23)
		tmp = x * x;
	elseif (x <= 4.7e-26)
		tmp = y * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.38e+23], N[(x * x), $MachinePrecision], If[LessEqual[x, 4.7e-26], N[(y * y), $MachinePrecision], N[(x * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.38e23 or 4.69999999999999989e-26 < x

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 81.5%

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

      1. unpow2 81.5%

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

   6. Simplified 81.5%

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

   if -1.38e23 < x < 4.69999999999999989e-26

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 62.8%

      \[\leadsto \color{blue}{{y}^{2}} \]
   5. Step-by-step derivation

      1. unpow2 62.8%

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

   6. Simplified 62.8%

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

4. Final simplification 72.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+23}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 4.7 \cdot 10^{-26}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 6: 41.7% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ x \cdot x \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. distribute-lft-out 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around inf 43.5%

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

   1. unpow2 43.5%

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

6. Simplified 43.5%

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

7. Final simplification 43.5%

   \[\leadsto x \cdot x \]

Developer target: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023171 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

  (+ (+ (* x 2.0) (* x x)) (* y y)))