Math FPCore C Fortran Java Python Julia MATLAB Wolfram TeX \[\left(x + y\right) \cdot \left(1 - z\right)
\]
↓
\[\left(1 - z\right) \cdot x + \left(1 - z\right) \cdot y
\]
(FPCore (x y z) :precision binary64 (* (+ x y) (- 1.0 z))) ↓
(FPCore (x y z) :precision binary64 (+ (* (- 1.0 z) x) (* (- 1.0 z) y))) double code(double x, double y, double z) {
return (x + y) * (1.0 - z);
}
↓
double code(double x, double y, double z) {
return ((1.0 - z) * x) + ((1.0 - z) * y);
}
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) * (1.0d0 - z)
end function
↓
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = ((1.0d0 - z) * x) + ((1.0d0 - z) * y)
end function
public static double code(double x, double y, double z) {
return (x + y) * (1.0 - z);
}
↓
public static double code(double x, double y, double z) {
return ((1.0 - z) * x) + ((1.0 - z) * y);
}
def code(x, y, z):
return (x + y) * (1.0 - z)
↓
def code(x, y, z):
return ((1.0 - z) * x) + ((1.0 - z) * y)
function code(x, y, z)
return Float64(Float64(x + y) * Float64(1.0 - z))
end
↓
function code(x, y, z)
return Float64(Float64(Float64(1.0 - z) * x) + Float64(Float64(1.0 - z) * y))
end
function tmp = code(x, y, z)
tmp = (x + y) * (1.0 - z);
end
↓
function tmp = code(x, y, z)
tmp = ((1.0 - z) * x) + ((1.0 - z) * y);
end
code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_] := N[(N[(N[(1.0 - z), $MachinePrecision] * x), $MachinePrecision] + N[(N[(1.0 - z), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot x + \left(1 - z\right) \cdot y
Alternatives Alternative 1 Error 12.6 Cost 1101
\[\begin{array}{l}
\mathbf{if}\;1 - z \leq -2 \cdot 10^{+135}:\\
\;\;\;\;z \cdot \left(-x\right)\\
\mathbf{elif}\;1 - z \leq 0.999999 \lor \neg \left(1 - z \leq 2\right):\\
\;\;\;\;\left(1 - z\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;x + y\\
\end{array}
\]
Alternative 2 Error 1.9 Cost 905
\[\begin{array}{l}
\mathbf{if}\;1 - z \leq -100000 \lor \neg \left(1 - z \leq 2\right):\\
\;\;\;\;z \cdot \left(\left(-x\right) - y\right)\\
\mathbf{else}:\\
\;\;\;\;x + y\\
\end{array}
\]
Alternative 3 Error 24.5 Cost 716
\[\begin{array}{l}
t_0 := \left(1 - z\right) \cdot x\\
\mathbf{if}\;x \leq -6.5 \cdot 10^{+28}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;x \leq -8.5 \cdot 10^{-91}:\\
\;\;\;\;x + y\\
\mathbf{elif}\;x \leq -1.7 \cdot 10^{-132}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;\left(1 - z\right) \cdot y\\
\end{array}
\]
Alternative 4 Error 24.5 Cost 716
\[\begin{array}{l}
\mathbf{if}\;x \leq -5.6 \cdot 10^{+31}:\\
\;\;\;\;\left(1 - z\right) \cdot x\\
\mathbf{elif}\;x \leq -1.75 \cdot 10^{-90}:\\
\;\;\;\;x + y\\
\mathbf{elif}\;x \leq -1.7 \cdot 10^{-132}:\\
\;\;\;\;x - z \cdot x\\
\mathbf{else}:\\
\;\;\;\;\left(1 - z\right) \cdot y\\
\end{array}
\]
Alternative 5 Error 12.9 Cost 521
\[\begin{array}{l}
\mathbf{if}\;z \leq -950000000000 \lor \neg \left(z \leq 1\right):\\
\;\;\;\;z \cdot \left(-x\right)\\
\mathbf{else}:\\
\;\;\;\;x + y\\
\end{array}
\]
Alternative 6 Error 13.0 Cost 520
\[\begin{array}{l}
\mathbf{if}\;z \leq -55:\\
\;\;\;\;z \cdot \left(-y\right)\\
\mathbf{elif}\;z \leq 1:\\
\;\;\;\;x + y\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(-x\right)\\
\end{array}
\]
Alternative 7 Error 38.2 Cost 460
\[\begin{array}{l}
\mathbf{if}\;x \leq -140000:\\
\;\;\;\;x\\
\mathbf{elif}\;x \leq -2.1 \cdot 10^{-42}:\\
\;\;\;\;y\\
\mathbf{elif}\;x \leq -1.16 \cdot 10^{-66}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;y\\
\end{array}
\]
Alternative 8 Error 0.0 Cost 448
\[\left(1 - z\right) \cdot \left(x + y\right)
\]
Alternative 9 Error 23.4 Cost 192
\[x + y
\]
Alternative 10 Error 43.4 Cost 64
\[x
\]