\returns The determinant of the matrix. * * \sa absDeterminant(), logAbsDeterminant() */

Emit signals

This function populates the given VAC at the given time with new vertices and edges based on samples, nodes, pa, ctm, and closed. If samples.size() =

Export Layers

\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 */

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

Insert the new cell just below the lowest boundary cell

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

Returns whether the given character is a [a-zA-Z] character.

Highlighting and Selecting

File Version Conversion

\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 non zero coefficients */

\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 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() */