#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <iostream>
#include "SparseMatrix.h"
Variables | |
const unsigned int | SM_MAX_ROWS = 200000 |
const unsigned int | SM_MAX_COLUMNS = 200000 |
const unsigned int | SM_RESERVE = 8 |
const unsigned int SM_MAX_COLUMNS = 200000 |
Referenced by SparseMatrix< unsigned int >::setSize().
const unsigned int SM_MAX_ROWS = 200000 |
Template for specialized SparseMatrix. Used both for the Kinetic solver and for handling certain kinds of messages. Speciality is that it can extract entire rows efficiently, for marching through a specified row for a matrix multiplication or for traversing messages.
Requires that type T have an equality operator ==
Referenced by SparseMatrix< unsigned int >::setSize().
const unsigned int SM_RESERVE = 8 |
Referenced by SparseMatrix< unsigned int >::SparseMatrix().