\return the equivalent permutation matrix */

* Returns an iterator to the node that stores the information * of the given virtual pointer from the given pointer map structure. * If pointer

\internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. * Fast, but wastes 16 additional bytes of memory. Does not thro

ip16: this function is used to compute inner product of vectors padded to multiple of 16 fxu1: the inner product is computed between float and 1-bit u

\returns an expression of the matrix L, internally stored as supernodes * The only operation available with this expression is the triangular so

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

\returns the matrix \b Z. */

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

return candidate id for next pop()

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

* Return the number of supernodes */

* @brief Packing ex_bits code to save space. For example, two 4-bit code will be * stored as 1 uint8. To compute inner product with the support of SI

get padding requirement for different rotator

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

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

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

* Number of rows */

\returns the number of rows */

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

Shifts [A, B, C, D] to [B, 0, D, 0]. Used to implement left shifts for Packet2l.

Shifts [A, B, C, D] to [0, A, 0, C]. Used to implement right shifts for Packet2l.