00001
00002
00003
00004
00005
00006
00007
00008
00009
00010 #ifndef _TEST_HSOLVE_H
00011 #define _TEST_HSOLVE_H
00012
00013 void makeFullMatrix(
00014 const vector< TreeNodeStruct >& tree,
00015 double dt,
00016 vector< vector< double > >& matrix );
00017
00018 template< class T >
00019 void permute(
00020 vector< T >& g,
00021 const vector< unsigned int >& permutation )
00022 {
00023 assert( g.size() == permutation.size() );
00024
00025 vector< T > copy( g.size() );
00026
00027 for ( unsigned int i = 0; i < g.size(); i++ )
00028 copy[ permutation[ i ] ] = g[ i ];
00029
00030 for ( unsigned int i = 0; i < g.size(); i++ )
00031 g[ i ] = copy[ i ];
00032 }
00033
00034 #endif // _TEST_HSOLVE_H