Must be called after inserting a set of non zero entries. */

r"""Predict survival function. Parameters ---------- linear_predictor : array-like, shape = (n_samples,) Linear pr

--- CAN BE RE-IMPLEMENTED IN CHILD CLASS --- */

\internal Frees memory allocated with handmade_aligned_malloc */

\internal * \brief Reallocates aligned memory. * Since we know that our handmade version is based on std::malloc * we can use std::realloc to im

\brief Reports whether previous computation was successful. * * \returns \c Success if computation was succesful, \c NoConvergence otherwi

\returns NumericalIssue if the input contains INF or NaN values or overflow occured. Returns Success otherwise. */

\brief Reports whether previous computation was successful. * * \returns \c Success if computation was succesful, \c NoConvergence otherwise.

Returns the status of the computation. The full list of enumeration values can be found in \ref Enumerations.

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

\returns the inverse of the matrix of which *this is the LU decomposition. * * \warning The matrix being decomposed here is assumed to be

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

\deprecated use isEmpty() */

\returns the currently set level 2 cpu cache size (in bytes) used to estimate the ideal blocking size parameters. * \sa setCpuCacheSize */

Log base 2 for 32 bits positive integers. * Conveniently returns 0 for x==0. */

Performs the lower triangular solving operation \f$y=L^{-1}x\f$. \param x_in Pointer to the \f$x\f$ vector. \param y_out Pointer to the \f$y\f$ vect

\returns an expression of the matrix L, internally stored as supernodes * The only operation available with this expression is the triangular so

\returns an expression of the factor L */

\returns an expression of the factor U (= L^*) */

\returns the matrix \b Z. */