* Return the array of supernode-to-column mapping */

\returns an expression of P H P^-1 where H is the matrix represented by \c *this */

\brief Adjoint (conjugate transpose) of the Householder sequence. */

* Empty the pointer list */

\sa MatrixBase::coeff() * \warning the coordinates must fit into the referenced triangular part */

\returns the size of the main diagonal, which is min(rows(),cols()). * \sa rows(), cols(), SizeAtCompileTime. */

\sa MatrixBase::fill() */

\returns a const pointer to the array of the number of non zeros of the inner vectors. * This function is aimed at interoperability with other l

\returns the number of non zero coefficients */

\returns the rank of the matrix of which *this is the complete orthogonal * decomposition. * * \note This method has to determine which pivot

\internal Allocates \a size bytes. The returned pointer is guaranteed to have 16 or 32 bytes alignment depending on the requirements. * On allocatio

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

\returns true if \a V (full or thin) is asked for in this SVD decomposition */

* @brief Construct clusters in IVF * * @param data Data objects (N*DIM) * @param centroids Centroid vectors (K*DIM) * @param clustter_ids Cluster

init config for faster quantization rabitq, for total_bits > 0, store const rescaling factor in RabitqConfig

inline Index row() const { return (ArgType::Flags&RowMajorBit ? Base::outer() : this->index()); } inline Index col() const { return (ArgType::Flags&Ro

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