\returns the number of columns */

\returns an expression of the complex conjugate of \c *this. * * \sa adjoint() */

\returns a vector expression of the main diagonal */

\internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. * Fast, but wastes 16 additional bytes of memory. Does not thro

\returns the inner stride */

\internal */

\brief Constructs the Hessenberg matrix H in the decomposition * * \returns expression object representing the matrix H * * \p

\brief Returns the unitary matrix Q in the decomposition * * \returns object representing the matrix Q * * \pre Either the con

Returns an AlignedBox that is the union of \a b and \c *this */

\returns the number of non zero coefficients */

\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

\returns the outer stride */

* Get the number of rows of the input matrix and the Q matrix */

\returns the number of columns */

\returns the number of rows */

Sets *this to the identity matrix */

\sa MatrixBase::setIdentity() */

\returns the number of transpositions */

level may actually range from [0,10] (10 is a "hidden" max level, where we want a bit more compression and it's fine if throughput to fall off a cliff

Builds a BVH tree for an entire model/scene

Clear the string - reset its length to zero */

Returns the final monte-carlo weighting factor using the PDF of a cosine-weighted hemisphere

--------------------------------------------------------------------------------------

---------------------------------------------------------------------------------

Retursn true if a directory exists