The following is needed for std::complex<Real>:

\returns the number of rows of the represented matrix. */

\returns an expression of the transposed of the factored matrix. * * A typical usage is to solve for the transposed problem A^T x = b:

Sets all coefficients to zero. */

\returns true if the matrix of which *this is the LU decomposition is invertible. * * \note This method has to determine which pivots shou

Resizes the sparse vector to \a rows x \a cols * * This method is provided for compatibility with matrices. * For a column vector, \

\internal * Must be called after inserting a set of non zero entries using the low level compressed API. */

\returns the inner size. * * \note For a vector, this is just the size. For a matrix (non-vector), this is the minor dimension * wit

fuctionally equivalent to _mm_shuffle_pd in SSE (i.e. shuffle(m, n, mask) equals _mm_shuffle_pd(m,n,mask)) Currently used in LU/arch/InverseSize4.h to

Swaps the content of two sparse matrices of the same type. * This is a fast operation that simply swaps the underlying pointers and parameters.

Constructs a read-write Map to a sparse matrix of size \a rows x \a cols, containing \a nnz non-zero coefficients, * stored as a sparse format a

\returns a const expression of the diagonal coefficients. */

\internal * Resize the nonzero vector to \a size */