Destructor

Returns

a reference to the coefficient value at given index i This operation involes a log(rho*size) binary search. If the coefficient does not exist yet, then a sorted insertion into a sequential buffer is performed.

This insertion might be very costly if the number of nonzeros above i is large.

Resizes the sparse vector to newSize, while leaving old values untouched.

If the size of the vector is decreased, then the storage of the out-of bounds coefficients is kept and reserved. Call .data().squeeze() to free extra memory.

See also

reserve(), setZero()

Returns

the number of non zero coefficients

Suppresses all nonzeros which are much smaller than reference under the tolerance epsilon

Resizes the sparse vector to newSize This method deletes all entries, thus leaving an empty sparse vector

See also

conservativeResize(), setZero()

Resizes the sparse vector to rows x cols

This method is provided for compatibility with matrices. For a column vector, cols must be equal to 1. For a row vector, rows must be equal to 1.

See also

resize(Index)

Overloaded for performance

Swaps the values of *this and other. Overloaded for performance: this version performs a shallow swap by swapping pointers and attributes only.

See also

SparseMatrixBase::swap()