Public Member Functions
	CompressedStorage (size_t size)

	CompressedStorage (const CompressedStorage &other)

CompressedStorage &	operator= (const CompressedStorage &other)

void	swap (CompressedStorage &other)

void	reserve (size_t size)

void	squeeze ()

void	resize (size_t size, double reserveSizeFactor=0)

void	append (const Scalar &v, Index i)

size_t	size () const

size_t	allocatedSize () const

void	clear ()

Scalar &	value (size_t i)

const Scalar &	value (size_t i) const

Index &	index (size_t i)

const Index &	index (size_t i) const

Index	searchLowerIndex (Index key) const

Index	searchLowerIndex (size_t start, size_t end, Index key) const

Scalar	at (Index key, const Scalar &defaultValue=Scalar(0)) const

Scalar	atInRange (size_t start, size_t end, Index key, const Scalar &defaultValue=Scalar(0)) const
	Like at(), but the search is performed in the range [start,end)

Scalar &	atWithInsertion (Index key, const Scalar &defaultValue=Scalar(0))

void	prune (const Scalar &reference, const RealScalar &epsilon=NumTraits< RealScalar >::dummy_precision())

Static Public Member Functions
static CompressedStorage	Map (Index indices, Scalar values, size_t size)

Protected Types
typedef NumTraits< Scalar >::Real	RealScalar

Member Function Documentation

§ at()

template<typename _Scalar, typename _Index>

Scalar Eigen::internal::CompressedStorage< _Scalar, _Index >::at	(	Index	key,
		const Scalar &	defaultValue = `Scalar(0)`
	)		const

inline

Returns: the stored value at index key If the value does not exist, then the value defaultValue is returned without any insertion.

template<typename _Scalar, typename _Index>

Scalar& Eigen::internal::CompressedStorage< _Scalar, _Index >::atWithInsertion	(	Index	key,
		const Scalar &	defaultValue = `Scalar(0)`
	)

inline

Returns: a reference to the value at index key If the value does not exist, then the value defaultValue is inserted such that the keys are sorted.

template<typename _Scalar, typename _Index>

Index Eigen::internal::CompressedStorage< _Scalar, _Index >::searchLowerIndex ( Index key ) const

inline

template<typename _Scalar, typename _Index>

Index Eigen::internal::CompressedStorage< _Scalar, _Index >::searchLowerIndex	(	size_t	start,
		size_t	end,
		Index	key
	)		const

inline

Returns: the largest k in [start,end) such that for all j in [start,k) index[j]<key

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