\returns the size of the inner dimension according to the storage order, * i.e., the number of rows for a columns major matrix, and the number o

\returns the pointer increment between two consecutive elements within a slice in the inner direction. * * \sa outerStride(), rowStride(),

\returns the inverse of the matrix of which *this is the LU decomposition. * * \warning The matrix being decomposed here is assumed to be

Returns true if the current process is being debugged (either running under the debugger or has a debugger attached post facto).

Returns true if the current process is being debugged (either running under the debugger or has a debugger attached post facto).

Log base 2 for 32 bits positive integers. Conveniently returns 0 for x==0.

>>> make_immutable(5) == 5 True >>> make_immutable('a') == 'a' True >>> make_immutable((1, 2)) == (1, 2) True >>> make_im

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

\returns an expression of the factor L */

\returns an expression of the factor U (= L^*) */

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

* Return the number of supernodes */

\returns the pointer increment between two consecutive inner slices (for example, between two consecutive columns * in a column-major m