Like at(), but the search is performed in the range [start,end) */

Boundary Package Merge step, numpresent is the amount of leaves, and c is the current chain.*/

sort the leaves with stable mergesort*/

\returns a pointer to the SPQR workspace */

\returns a pointer to the SPQR workspace */

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

\returns the number of columns */

\returns the number of columns */

Simple classifier that is 50% certain that the annotation is correct

Simple classifier that is 50% certain that the annotation is correct

Resizes the matrix to a \a rows x \a cols matrix leaving old values untouched. * * If the sizes of the matrix are decreased, then the matr

Resizes the matrix to a \a rows x \a cols matrix leaving old values untouched. * * If the sizes of the matrix are decreased, then the matr

count. * Return the number of active pointers (i.e, pointers that * have been malloc but not freed). */

count. * Return the number of active pointers (i.e, pointers that * have been malloc but not freed). */

\returns a const pointer to the column major internal matrix */

\returns a const pointer to the column major internal matrix */

read a PNG, the result will be in the same color type as the PNG (hence "generic")*/

Deflate for a block of type "dynamic", that is, with freely, optimally, created huffman trees*/

\returns the first element \f$ a_0 \f$ in the sequence */