- Timestamp:
- Dec 21, 2025, 1:35:46 PM (3 months ago)
- Branches:
- master, stuck-waitfor-destruct
- Children:
- 4904b05
- Parents:
- eb0d9b7
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/mike_brooks_MMath/programs/ar-bchk/treatment.cc
reb0d9b7 r80e83b6c 24 24 vector<vector<float>> & lhs, 25 25 vector<vector<float>> & rhs ) { 26 for ( size_t i = 0;26 for ( size_t i = 0; 27 27 i < res.size(); i++ ) 28 for ( size_t j = 0;28 for ( size_t j = 0; 29 29 j < res.at(i).size(); j++ ) { 30 30 res.at(i).at(j) = 0.0; 31 for ( size_t k = 0;31 for ( size_t k = 0; 32 32 k < rhs.size(); k++ ) 33 res.at(i).at(j) +=34 lhs.at(i).at(k) *35 rhs.at(k).at(j);33 @res.at(i).at(j) +=@ 34 @lhs.at(i).at(k) *@ 35 @rhs.at(k).at(j);@ 36 36 } 37 37 } … … 49 49 50 50 static void zero( vector<vector<float>> & mat ) { 51 for ( size_t i = 0; i < mat.size(); i++ )52 for ( size_t j = 0; j < mat.at(i).size(); j++ )51 for ( size_t i = 0; i < mat.size(); i++ ) 52 for ( size_t j = 0; j < mat.at(i).size(); j++ ) 53 53 mat.at(i).at(j) = 0.0; 54 54 } … … 56 56 57 57 static void fill( vector<vector<float>> & mat ) { 58 for ( size_t i = 0; i < mat.size(); i++ )59 for ( size_t j = 0; j < mat.at(i).size(); j++ )58 for ( size_t i = 0; i < mat.size(); i++ ) 59 for ( size_t j = 0; j < mat.at(i).size(); j++ ) 60 60 mat.at(i).at(j) = 1.0 * (i + 1) + 0.1 * (j+1); 61 61 } … … 63 63 64 64 static void print( vector<vector<float>> & mat ) { 65 for ( size_t i = 0; i < mat.size(); i++ ) {66 for ( size_t j = 0; j < mat.at(i).size(); j++ )65 for ( size_t i = 0; i < mat.size(); i++ ) { 66 for ( size_t j = 0; j < mat.at(i).size(); j++ ) 67 67 cout << mat.at(i).at(j) << " "; 68 68 cout << endl;
Note:
See TracChangeset
for help on using the changeset viewer.