Go to the source code of this file.
|
void | makeFullMatrix (const vector< TreeNodeStruct > &tree, double dt, vector< vector< double > > &matrix) |
|
template<class T > |
void | permute (vector< T > &g, const vector< unsigned int > &permutation) |
|
void makeFullMatrix |
( |
const vector< TreeNodeStruct > & |
tree, |
|
|
double |
dt, |
|
|
vector< vector< double > > & |
matrix |
|
) |
| |
template<class T >
void permute |
( |
vector< T > & |
g, |
|
|
const vector< unsigned int > & |
permutation |
|
) |
| |
Definition at line 19 of file TestHSolve.h.
23 assert( g.size() == permutation.size() );
25 vector< T > copy( g.size() );
27 for (
unsigned int i = 0; i < g.size(); i++ )
28 copy[ permutation[ i ] ] = g[ i ];
30 for (
unsigned int i = 0; i < g.size(); i++ )