\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y
\]
↓
\[\left(x \cdot x + x \cdot 2\right) + y \cdot y
\]
(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))
↓
(FPCore (x y) :precision binary64 (+ (+ (* x x) (* x 2.0)) (* y y)))
double code(double x, double y) {
return ((x * 2.0) + (x * x)) + (y * y);
}
↓
double code(double x, double y) {
return ((x * x) + (x * 2.0)) + (y * y);
}
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
↓
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((x * x) + (x * 2.0d0)) + (y * y)
end function
public static double code(double x, double y) {
return ((x * 2.0) + (x * x)) + (y * y);
}
↓
public static double code(double x, double y) {
return ((x * x) + (x * 2.0)) + (y * y);
}
def code(x, y):
return ((x * 2.0) + (x * x)) + (y * y)
↓
def code(x, y):
return ((x * x) + (x * 2.0)) + (y * y)
function code(x, y)
return Float64(Float64(Float64(x * 2.0) + Float64(x * x)) + Float64(y * y))
end
↓
function code(x, y)
return Float64(Float64(Float64(x * x) + Float64(x * 2.0)) + Float64(y * y))
end
function tmp = code(x, y)
tmp = ((x * 2.0) + (x * x)) + (y * y);
end
↓
function tmp = code(x, y)
tmp = ((x * x) + (x * 2.0)) + (y * y);
end
code[x_, y_] := N[(N[(N[(x * 2.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
↓
\left(x \cdot x + x \cdot 2\right) + y \cdot y
Alternatives
| Alternative 1 |
|---|
| Error | 25.9 |
|---|
| Cost | 1512 |
|---|
\[\begin{array}{l}
\mathbf{if}\;x \leq -2:\\
\;\;\;\;x \cdot x\\
\mathbf{elif}\;x \leq -3.5 \cdot 10^{-49}:\\
\;\;\;\;x + x\\
\mathbf{elif}\;x \leq -1.75 \cdot 10^{-94}:\\
\;\;\;\;y \cdot y\\
\mathbf{elif}\;x \leq -1.8 \cdot 10^{-107}:\\
\;\;\;\;x + x\\
\mathbf{elif}\;x \leq -2.5 \cdot 10^{-164}:\\
\;\;\;\;y \cdot y\\
\mathbf{elif}\;x \leq -9.5 \cdot 10^{-179}:\\
\;\;\;\;x + x\\
\mathbf{elif}\;x \leq -6 \cdot 10^{-235}:\\
\;\;\;\;y \cdot y\\
\mathbf{elif}\;x \leq 5.2 \cdot 10^{-161}:\\
\;\;\;\;x + x\\
\mathbf{elif}\;x \leq 7.4 \cdot 10^{-131}:\\
\;\;\;\;y \cdot y\\
\mathbf{elif}\;x \leq 2:\\
\;\;\;\;x + x\\
\mathbf{else}:\\
\;\;\;\;x \cdot x\\
\end{array}
\]
| Alternative 2 |
|---|
| Error | 4.2 |
|---|
| Cost | 713 |
|---|
\[\begin{array}{l}
\mathbf{if}\;x \leq -0.0031 \lor \neg \left(x \leq 1750\right):\\
\;\;\;\;x \cdot \left(x + 2\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot y + x \cdot 2\\
\end{array}
\]
| Alternative 3 |
|---|
| Error | 1.2 |
|---|
| Cost | 713 |
|---|
\[\begin{array}{l}
\mathbf{if}\;x \leq -2 \lor \neg \left(x \leq 2\right):\\
\;\;\;\;x \cdot x + y \cdot y\\
\mathbf{else}:\\
\;\;\;\;y \cdot y + x \cdot 2\\
\end{array}
\]
| Alternative 4 |
|---|
| Error | 10.0 |
|---|
| Cost | 584 |
|---|
\[\begin{array}{l}
\mathbf{if}\;y \leq -25:\\
\;\;\;\;y \cdot y\\
\mathbf{elif}\;y \leq 5.3 \cdot 10^{-64}:\\
\;\;\;\;x \cdot \left(x + 2\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot y\\
\end{array}
\]
| Alternative 5 |
|---|
| Error | 0.0 |
|---|
| Cost | 576 |
|---|
\[y \cdot y + x \cdot \left(x + 2\right)
\]
| Alternative 6 |
|---|
| Error | 24.7 |
|---|
| Cost | 456 |
|---|
\[\begin{array}{l}
\mathbf{if}\;x \leq -32000:\\
\;\;\;\;x \cdot x\\
\mathbf{elif}\;x \leq 2100:\\
\;\;\;\;y \cdot y\\
\mathbf{else}:\\
\;\;\;\;x \cdot x\\
\end{array}
\]
| Alternative 7 |
|---|
| Error | 44.9 |
|---|
| Cost | 192 |
|---|
\[x \cdot x
\]