|
std::size_t | allocatedSize () const |
|
void | append (const Scalar &v, int i) |
|
Scalar | at (int key, Scalar defaultValue=Scalar(0)) const |
|
Scalar | atInRange (std::size_t start, std::size_t end, int key, Scalar defaultValue=Scalar(0)) const |
|
Scalar & | atWithInsertion (int key, Scalar defaultValue=Scalar(0)) |
|
void | clear () |
|
| CompressedStorage (std::size_t size) |
|
| CompressedStorage (const CompressedStorage &other) |
|
int & | index (std::size_t i) |
|
const int & | index (std::size_t i) const |
|
CompressedStorage & | operator= (const CompressedStorage &other) |
|
void | prune (Scalar reference, RealScalar epsilon=precision< RealScalar >()) |
|
void | reserve (std::size_t size) |
|
void | resize (std::size_t size, float reserveSizeFactor=0) |
|
int | searchLowerIndex (int key) const |
|
int | searchLowerIndex (std::size_t start, std::size_t end, int key) const |
|
std::size_t | size () const |
|
void | squeeze () |
|
void | swap (CompressedStorage &other) |
|
Scalar & | value (std::size_t i) |
|
const Scalar & | value (std::size_t i) const |
|
template<typename Scalar>
class Eigen::CompressedStorage< Scalar >
Stores a sparse set of values as a list of values and a list of indices.