\returns an expression of the coefficient-wise tan of *this. * * Example: \include Cwise_tan.cpp * Output: \verbinclude Cwise_tan.out * * \s

* \internal * \brief Reallocates an aligned block of memory. * \throws std::bad_alloc on allocation failure **/

\returns the value of the rotation angle in radian */

\returns the rotation angle */

\returns the rotation angle */

\returns an expression of the coefficient-wise arc sine of *this. * * Example: \include Cwise_asin.cpp * Output: \verbinclude Cwise_asin.out *

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

\internal */

Resizes the matrix to a \a rows x \a cols matrix leaving old values untouched. * \sa resizeNonZeros(Index), reserve(), setZero() */

* @brief Construct a rectangle with coordinates in the map frame. * * @param centre_x x-coordinate of the rectangle center in the map frame * @par

\returns The determinant of the matrix. * * \sa absDeterminant(), logAbsDeterminant() */

\internal * \brief Reallocates aligned memory. * Allows reallocation with aligned ptr types. This implementation will * always create a new memo

\internal Frees memory allocated with handmade_aligned_malloc */

\returns the size of the inner dimension according to the storage order, * i.e., the number of rows for a columns major matrix, and the number o

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

Check if a value is legal (not nan or inf)

Limit the value within [lower_bound, upper_bound]

Calculate the Euclideam distance between two points

\internal \returns b if a<=0, and returns a otherwise. */

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

\returns an expression of the matrix U, * The only operation available with this expression is the triangular solve * \code * y = b;

\returns the absolute value of the biggest pivot, i.e. the biggest * diagonal coefficient of U. */

\returns the number of non zero coefficients */

\returns the number of nonzero pivots in the QR decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\returns the number of nonzero pivots in the LU decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

\sa MapBase::outerStride() */

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

Convert radians to degrees

Preallocates \a reserveSize non zeros. * * Precondition: the matrix must be in compressed mode. */

EIGEN_PARSED_BY_DOXYGEN

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

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

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

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