\returns the current flags */

\internal * \brief Reallocates aligned memory. * Allows reallocation with aligned ptr types. This implementation will * always create a new memo

\internal Frees memory allocated with handmade_aligned_malloc */

Must be call first when calling Eigen from multiple threads */

\returns the inverse of the matrix of which *this is the LU decomposition. * * \note If this matrix is not invertible, the returned matrix

\internal \returns b if a<=0, and returns a otherwise. */

\returns the sparse triangular factor R. It is a sparse matrix */

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

\returns the absolute value of the biggest pivot, i.e. the biggest * diagonal coefficient of U. */

\returns the number of nonzero pivots in the QR decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\returns the number of singular values that are not exactly 0 */

\returns the size of the storage major dimension, * i.e., the number of columns for a columns major matrix, and the number of rows otherwise */

\sa MapBase::outerStride() */

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

\returns the rank of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pivots should be cons

Preallocates \a reserveSize non zeros. * * Precondition: the matrix must be in compressed mode. */

EIGEN_PARSED_BY_DOXYGEN

Forwards the resizing request to the nested expression * \sa DenseBase::resize(Index) */

* Return the location in \em rowvaluePtr() which starts each column */

Sets this matrix to be the identity matrix of the current size. */

* Return the array of supernode-to-column mapping */

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