|
| | SparseTable () |
| | Default constructor. Yields an empty SparseTable. More...
|
| |
| template<typename DataIter , typename IntegerIter > |
| | SparseTable (DataIter data_beg, DataIter data_end, IntegerIter rowsize_beg, IntegerIter rowsize_end) |
| |
| template<typename DataIter , typename IntegerIter > |
| void | assign (DataIter data_beg, DataIter data_end, IntegerIter rowsize_beg, IntegerIter rowsize_end) |
| |
| template<typename IntegerIter > |
| void | allocate (IntegerIter rowsize_beg, IntegerIter rowsize_end) |
| |
| template<typename DataIter > |
| void | appendRow (DataIter row_beg, DataIter row_end) |
| | Appends a row to the table. More...
|
| |
| bool | empty () const |
| | True if the table contains no rows. More...
|
| |
| int | size () const |
| | Returns the number of rows in the table. More...
|
| |
| void | reserve (int exptd_nrows, int exptd_ndata) |
| | Allocate storage for table of expected size. More...
|
| |
| void | swap (SparseTable< T > &other) |
| | Swap contents for other SparseTable<T> More...
|
| |
| int | dataSize () const |
| | Returns the number of data elements. More...
|
| |
| int | rowSize (int row) const |
| | Returns the size of a table row. More...
|
| |
| void | clear () |
| | Makes the table empty(). More...
|
| |
| row_type | operator[] (int row) const |
| | Returns a row of the table. More...
|
| |
| mutable_row_type | operator[] (int row) |
| | Returns a mutable row of the table. More...
|
| |
| bool | operator== (const SparseTable &other) const |
| | Equality. More...
|
| |
| template<class charT , class traits > |
| void | print (std::basic_ostream< charT, traits > &os) const |
| |
| const T | data (int i) const |
| |
template<typename T>
class Opm::SparseTable< T >
A SparseTable stores a table with rows of varying size as efficiently as possible. It is supposed to behave similarly to a vector of vectors. Its behaviour is similar to compressed row sparse matrices.