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

get if data_id is in the hashset

\returns a const pointer to the array of inner indices. * This function is aimed at interoperability with other libraries. * \sa valuePtr(

\brief Returns an expression of the tridiagonal matrix T in the decomposition * * \returns expression object representing the matrix T

\returns the number of rows of the matrix */

\returns the size of a side of the respective square matrix, i.e., the number of indices */

\returns a const pointer to the array of values. * This function is aimed at interoperability with other libraries. * \sa innerIndexPtr(),

* Get the number of columns of the input matrix. */

\returns true if \a U (full or thin) is asked for in this SVD decomposition */

Turns the matrix into the \em compressed format. */

\internal */

\internal * \sa insertBack, insertBackByOuterInner */

* Return the array of nonzero values packed by column * * The size is nnz */

\internal Frees memory allocated with aligned_malloc. */

Get the permutation that was applied to columns of A

* Compute the symbolic and numeric factorization of the input sparse matrix. * The input matrix should be in column-major storage. */

Replace symbolic last/end "keywords" by their true runtime value

\returns an expression of the matrix Q as products of sparse Householder reflectors. * The common usage of this function is to apply it to a dense

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

\returns the outer-stride of the underlying dense matrix * \sa DenseCoeffsBase::outerStride() */