out must be buffer big enough to contain uncompressed IDAT chunk data, and in must contain the full image. return value is error**/

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

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

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

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

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

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

* Number of rows */

\returns the number of rows */

* Number of rows */

\returns the number of rows */

search the index in the array, that has the largest value smaller than or equal to the given value, given array must be sorted (if no value is smalle

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

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

Shifts [A, B, C, D] to [B, 0, D, 0]. Used to implement left shifts for Packet2l.

Shifts [A, B, C, D] to [B, 0, D, 0]. Used to implement left shifts for Packet2l.

Shifts [A, B, C, D] to [0, A, 0, C]. Used to implement right shifts for Packet2l.

Shifts [A, B, C, D] to [0, A, 0, C]. Used to implement right shifts for Packet2l.

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

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

returns 1 if success, 0 if failure ==> nothing done*/