![]() |
Boost.uBlas 1.49
Linear Algebra in C++: matrices, vectors and numeric algorithms
|
The sparse push_back fill policy. More...
#include <assignment.hpp>
Public Types | |
typedef sparse_push_back | type |
Static Public Member Functions | |
template<class T , class S , class V > | |
static BOOST_UBLAS_INLINE void | apply (T &e, const S &i, const V &v) |
template<class T , class S , class V > | |
static BOOST_UBLAS_INLINE void | apply (T &e, const S &i, const S &j, const V &v) |
The sparse push_back fill policy.
This policy is adequate for sparse types, when fast filling is required, where indexing assign is pretty slow.
It is important to note that push_back assign cannot be used to add elements before elements already existing in a sparse container. To achieve that please use the sparse_insert fill policy.
Definition at line 679 of file assignment.hpp.
typedef sparse_push_back boost::numeric::ublas::fill_policy_wrapper< sparse_push_back >::type [inherited] |
Definition at line 598 of file assignment.hpp.
static BOOST_UBLAS_INLINE void boost::numeric::ublas::fill_policy::sparse_push_back::apply | ( | T & | e, |
const S & | i, | ||
const V & | v | ||
) | [inline, static] |
Definition at line 683 of file assignment.hpp.
static BOOST_UBLAS_INLINE void boost::numeric::ublas::fill_policy::sparse_push_back::apply | ( | T & | e, |
const S & | i, | ||
const S & | j, | ||
const V & | v | ||
) | [inline, static] |
Definition at line 688 of file assignment.hpp.