this helper function takes a plain C array and prints it in one line

\internal * \returns the size in Bytes of the L1 data cache */

\internal * \returns the size in Bytes of the L2 or L3 cache if this later is present */

Visual studio doesn't implement a rand_r() function since its implementation of rand() is already thread safe

Visual studio doesn't implement a rand_r() function since its implementation of rand() is already thread safe

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

* \brief Allocate the internal array of pointers to blocks and their inner indices * * \note For fixed-size blocks, call setBlockSize() to

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

Resize the matrix without preserving the data (the matrix is set to zero) */

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

\returns the number of rows */

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

Removes all non zeros but keep allocated memory * * This function does not free the currently allocated memory. To release as much as memo

\returns the signed distance between the plane \c *this and a point \a p. * \sa absDistance() */

create a reference spline */

Does nothing: provided for compatibility with SparseMatrix */

Start a series of r trials to determine baseline time:

Returns the threshold that will be used by certain methods such as rank(). * * See the documentation of setThreshold(const RealScalar&).

\brief %Transpose of the Householder sequence. */

\returns an expression of P H P^-1 */ TODO implement twists in a more evaluator friendly fashion

\returns the coefficients of the diagonal matrix D */

\returns the volume of the bounding box */