Boost.uBlas 1.49
Linear Algebra in C++: matrices, vectors and numeric algorithms

boost::numeric::ublas::fill_policy::sparse_insert Class Reference

The sparse insert fill policy. More...

#include <assignment.hpp>

Inheritance diagram for boost::numeric::ublas::fill_policy::sparse_insert:
Collaboration diagram for boost::numeric::ublas::fill_policy::sparse_insert:

List of all members.

Public Types

typedef sparse_insert 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)

Detailed Description

The sparse insert fill policy.

This policy is adequate for sparse types, when fast filling is required, where indexing assign is pretty slow. It is slower than sparse_push_back fill policy, but it can be used to insert elements anywhere inside the container.

Definition at line 700 of file assignment.hpp.


Member Typedef Documentation


Member Function Documentation

template<class T , class S , class V >
static BOOST_UBLAS_INLINE void boost::numeric::ublas::fill_policy::sparse_insert::apply ( T &  e,
const S &  i,
const V &  v 
) [inline, static]

Definition at line 704 of file assignment.hpp.

template<class T , class S , class V >
static BOOST_UBLAS_INLINE void boost::numeric::ublas::fill_policy::sparse_insert::apply ( T &  e,
const S &  i,
const S &  j,
const V &  v 
) [inline, static]

Definition at line 709 of file assignment.hpp.


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