#include <CompressedStorage.h>
|
| | CompressedStorage () |
| |
| | CompressedStorage (Index size) |
| |
| | CompressedStorage (const CompressedStorage &other) |
| |
| CompressedStorage & | operator= (const CompressedStorage &other) |
| |
| void | swap (CompressedStorage &other) |
| |
| | ~CompressedStorage () |
| |
| void | reserve (Index size) |
| |
| void | squeeze () |
| |
| void | resize (Index size, double reserveSizeFactor=0) |
| |
| void | append (const Scalar &v, Index i) |
| |
| Index | size () const |
| |
| Index | allocatedSize () const |
| |
| void | clear () |
| |
| const Scalar * | valuePtr () const |
| |
| Scalar * | valuePtr () |
| |
| const StorageIndex * | indexPtr () const |
| |
| StorageIndex * | indexPtr () |
| |
| Scalar & | value (Index i) |
| |
| const Scalar & | value (Index i) const |
| |
| StorageIndex & | index (Index i) |
| |
| const StorageIndex & | index (Index i) const |
| |
| Index | searchLowerIndex (Index key) const |
| |
| Index | searchLowerIndex (Index start, Index end, Index key) const |
| |
| Scalar | at (Index key, const Scalar &defaultValue=Scalar(0)) const |
| |
| Scalar | atInRange (Index start, Index end, Index key, const Scalar &defaultValue=Scalar(0)) const |
| |
| Scalar & | atWithInsertion (Index key, const Scalar &defaultValue=Scalar(0)) |
| |
| void | moveChunk (Index from, Index to, Index chunkSize) |
| |
| void | prune (const Scalar &reference, const RealScalar &epsilon=NumTraits< RealScalar >::dummy_precision()) |
| |
◆ RealScalar
template<typename _Scalar , typename _StorageIndex >
◆ Scalar
template<typename _Scalar , typename _StorageIndex >
◆ StorageIndex
template<typename _Scalar , typename _StorageIndex >
◆ CompressedStorage() [1/3]
template<typename _Scalar , typename _StorageIndex >
◆ CompressedStorage() [2/3]
template<typename _Scalar , typename _StorageIndex >
◆ CompressedStorage() [3/3]
template<typename _Scalar , typename _StorageIndex >
◆ ~CompressedStorage()
template<typename _Scalar , typename _StorageIndex >
◆ allocatedSize()
template<typename _Scalar , typename _StorageIndex >
◆ append()
template<typename _Scalar , typename _StorageIndex >
◆ at()
template<typename _Scalar , typename _StorageIndex >
- Returns
- the stored value at index key If the value does not exist, then the value defaultValue is returned without any insertion.
◆ atInRange()
template<typename _Scalar , typename _StorageIndex >
Like at(), but the search is performed in the range [start,end)
◆ atWithInsertion()
template<typename _Scalar , typename _StorageIndex >
- 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.
◆ clear()
template<typename _Scalar , typename _StorageIndex >
◆ index() [1/2]
template<typename _Scalar , typename _StorageIndex >
◆ index() [2/2]
template<typename _Scalar , typename _StorageIndex >
◆ indexPtr() [1/2]
template<typename _Scalar , typename _StorageIndex >
◆ indexPtr() [2/2]
template<typename _Scalar , typename _StorageIndex >
◆ moveChunk()
template<typename _Scalar , typename _StorageIndex >
◆ operator=()
template<typename _Scalar , typename _StorageIndex >
◆ prune()
template<typename _Scalar , typename _StorageIndex >
◆ reallocate()
template<typename _Scalar , typename _StorageIndex >
◆ reserve()
template<typename _Scalar , typename _StorageIndex >
◆ resize()
template<typename _Scalar , typename _StorageIndex >
◆ searchLowerIndex() [1/2]
template<typename _Scalar , typename _StorageIndex >
- Returns
- the largest
k such that for all j in [0,k) index[j]<key
◆ searchLowerIndex() [2/2]
template<typename _Scalar , typename _StorageIndex >
- Returns
- the largest
k in [start,end) such that for all j in [start,k) index[j]<key
◆ size()
template<typename _Scalar , typename _StorageIndex >
◆ squeeze()
template<typename _Scalar , typename _StorageIndex >
◆ swap()
template<typename _Scalar , typename _StorageIndex >
◆ value() [1/2]
template<typename _Scalar , typename _StorageIndex >
◆ value() [2/2]
template<typename _Scalar , typename _StorageIndex >
◆ valuePtr() [1/2]
template<typename _Scalar , typename _StorageIndex >
◆ valuePtr() [2/2]
template<typename _Scalar , typename _StorageIndex >
◆ m_allocatedSize
template<typename _Scalar , typename _StorageIndex >
◆ m_indices
template<typename _Scalar , typename _StorageIndex >
◆ m_size
template<typename _Scalar , typename _StorageIndex >
◆ m_values
template<typename _Scalar , typename _StorageIndex >
The documentation for this class was generated from the following file: