\returns the stored value at index \a key * If the value does not exist, then the value \a defaultValue is returned without any insertion. */

workaround MSVC std::list implementation

\returns a vector expression of the \a i -th column, * only the meaningful part is returned. * \warning the internal storage must be colum

Adjust the parameters to the size of the image indicated */

\returns the row index of the current coefficient.

\returns the value of the current coefficient.

\brief Retruns the z-translation by value. **/

Clear any existing decomposition * \sa rankUpdate(w,sigma) */

\returns the number of coefficients, which is rows()*cols(). * \sa rows(), cols(), SizeAtCompileTime. */

\internal */

These just provide access to the point data in a clean way

\returns the value of the matrix at position \a i, \a j * This function returns Scalar(0) if the element is an explicit \em zero */

\returns a read-only view of the stored coefficients as a 1D array expression. * * \warning this method is for \b compressed \b storage \b

\returns a const pointer to the array of the starting positions of the inner vectors. * This function is aimed at interoperability with other li

To use for operations with the transpose of Q FIXME this is the same as adjoint at the moment