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

Sets all coefficients to zero. */

FixedArray::begin() Returns an iterator to the beginning of the fixed array.

\returns the number of columns. \sa rows(), ColsAtCompileTime*/

FixedArray::end() Returns an iterator to the end of the fixed array.

FixedArray::size() Returns the length of the fixed array.

Evaluate the polynomial at x using the Horner scheme.

\returns true if the matrix of which *this is the LU decomposition is invertible. * * \note This method has to determine which pivots shou

Resizes the sparse vector to \a rows x \a cols * * This method is provided for compatibility with matrices. * For a column vector, \

\returns the number of rows. \sa cols(), RowsAtCompileTime */

Calling EdgeWeight on a pair of vertices where either one of the vertices is not present in the graph will result in undefined behaviour. If there is

Returns true iff the listener is interested in an explanation of the match result. A matcher's MatchAndExplain() method can use this information to a

\internal * Must be called after inserting a set of non zero entries using the low level compressed API. */

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

Constructs a read-write Map to a sparse matrix of size \a rows x \a cols, containing \a nnz non-zero coefficients, * stored as a sparse format a

Returns true iff the given arguments match the matchers.

See ParallelFor (below) for more details.

If the explanation is not empty, prints it to the ostream.

Atomically push an element onto the queue. If a thread was waiting for an element, wake it up.