RavEngine
Loading...
Searching...
No Matches
Eigen::internal::AmbiVector< _Scalar, _StorageIndex > Class Template Reference

Classes

class  Iterator
 
struct  ListEl
 

Public Types

typedef _Scalar Scalar
 
typedef _StorageIndex StorageIndex
 
typedef NumTraits< Scalar >::Real RealScalar
 

Public Member Functions

 AmbiVector (Index size)
 
void init (double estimatedDensity)
 
void init (int mode)
 
Index nonZeros () const
 
void setBounds (Index start, Index end)
 
void setZero ()
 
void restart ()
 
Scalar & coeffRef (Index i)
 
Scalar & coeff (Index i)
 
void resize (Index size)
 
StorageIndex size () const
 

Protected Member Functions

StorageIndex convert_index (Index idx)
 
void reallocate (Index size)
 
void reallocateSparse ()
 

Protected Attributes

Scalar * m_buffer
 
Scalar m_zero
 
StorageIndex m_size
 
StorageIndex m_start
 
StorageIndex m_end
 
StorageIndex m_allocatedSize
 
StorageIndex m_allocatedElements
 
StorageIndex m_mode
 
StorageIndex m_llStart
 
StorageIndex m_llCurrent
 
StorageIndex m_llSize
 

Member Function Documentation

◆ nonZeros()

template<typename _Scalar , typename _StorageIndex >
Index Eigen::internal::AmbiVector< _Scalar, _StorageIndex >::nonZeros ( ) const
Returns
the number of non zeros in the current sub vector

◆ restart()

template<typename _Scalar , typename _StorageIndex >
void Eigen::internal::AmbiVector< _Scalar, _StorageIndex >::restart ( )

Must be called whenever we might perform a write access with an index smaller than the previous one.

Don't worry, this function is extremely cheap.

◆ setBounds()

template<typename _Scalar , typename _StorageIndex >
void Eigen::internal::AmbiVector< _Scalar, _StorageIndex >::setBounds ( Index  start,
Index  end 
)
inline

Specifies a sub-vector to work on

◆ setZero()

template<typename _Scalar , typename _StorageIndex >
void Eigen::internal::AmbiVector< _Scalar, _StorageIndex >::setZero ( )

Set all coefficients of current subvector to zero


The documentation for this class was generated from the following file: