\returns the number of columns of the represented matrix. */

\returns the vertex of the bounding box at the corner defined by * the corner-id corner. It works only for a 1D, 2D or 3D bounding box. * For

\returns the dimension in which the plane holds */

\returns the step bound for the diagonal shift */

\brief Returns number of performed QR-like iterations. */

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

action name

\returns a const pointer to the array of the starting positions of the inner vectors. * This function is aimed at interoperability with other li

Preallocates \a reserveSize non zeros */

\brief Number of rows of transformation viewed as a matrix. * \returns Number of rows * \details This equals the dimension of the space t

* \returns the number of rows */

Sets the tolerance for the norm of the vector function*/

Sets the tolerance for the norm of the solution vector*/

Notify wakes one or all waiting threads. Must be called after changing the associated wait predicate.

PopBackHalf removes and returns half last elements in the queue. Returns number of elements removed. But can also fail spuriously.

* \returns the starting index of the bi row block */

\brief Number of columns of transformation viewed as a matrix. * \returns Number of columns * \details This equals the dimension of the sp

\returns the tolerance error reached during the last solve. * It is a close approximation of the true relative residual error |Ax-b|/|b|. */

\returns the matrix or vector obtained by evaluating this expression. * * Notice that in the case of a plain matrix or vector (not an expr

The following is needed for std::complex<Real>:

complex-to-complex forward FFT

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