\returns the pointer increment between two consecutive elements within a slice in the inner direction. * * \sa outerStride(), rowStride(),

Returns an AlignedBox that is the intersection of \a b and \c *this * \note If the boxes don't intersect, the resulting box is empty. * \sa inte

\returns the intersection of *this with \a other. * * \warning The ambient space must be a plane, i.e. have dimension 2, so that \c *this and

\returns the intersection of *this with \a other. * * \warning The ambient space must be a plane, i.e. have dimension 2, so that \c *this and

\returns true if the box \a b is intersecting the box \c *this. * \sa intersection, clamp */

\returns an expression of the coefficient-wise inverse of *this. * * Example: \include Cwise_inverse.cpp * Output: \verbinclude Cwise_inverse.ou

\returns the inverse rotation, i.e., an angle-axis with opposite rotation angle */

\returns the inverse scaling */

\returns the inverse translation (opposite) */

\returns the inverse rotation */

\returns the inverse rotation */

\brief Inverse of the Householder sequence (equals the adjoint). */

\returns the inverse transformation */

\returns the inverse permutation matrix. * * \note \note_try_to_help_rvo */

\returns the inverse of the matrix of which *this is the QR decomposition. * * \note If this matrix is not invertible, the returned matrix

\returns the inverse of the matrix of which *this is the QR decomposition. * * \note If this matrix is not invertible, the returned matrix

\returns the inverse rotation, i.e., an angle-axis with opposite rotation angle */

\returns the inverse scaling */

\returns the inverse translation (opposite) */

\returns the inverse rotation */

\returns the inverse rotation */

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns \c true if \c *this is approximately equal to \a other, within the precision * determined by \a prec. * * \sa MatrixBase::isAppro

\returns true if the box is empty. * \sa setEmpty */

\returns true if the matrix of which *this is the QR decomposition represents an injective * linear map, i.e. has trivial kernel; false

\returns true if the matrix of which *this is the QR decomposition represents an injective * linear map, i.e. has trivial kernel; false

\returns true if the matrix of which *this is the LU decomposition represents an injective * linear map, i.e. has trivial kernel; false

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

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

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

\returns true if the matrix is negative (semidefinite) */

\deprecated use isEmpty() */

\returns true if the box is null, i.e, empty. */

\returns true if the matrix is positive (semidefinite) */