Changeset 80e83b6c for doc/theses/mike_brooks_MMath/programs
- Timestamp:
- Dec 21, 2025, 1:35:46 PM (2 days ago)
- Branches:
- master
- Children:
- 4904b05
- Parents:
- eb0d9b7
- Location:
- doc/theses/mike_brooks_MMath/programs/ar-bchk
- Files:
-
- 6 edited
-
control.c (modified) (2 diffs)
-
control.cc (modified) (2 diffs)
-
control.cfa (modified) (1 diff)
-
treatment.c (modified) (4 diffs)
-
treatment.cc (modified) (4 diffs)
-
treatment.cfa (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/mike_brooks_MMath/programs/ar-bchk/control.c
reb0d9b7 r80e83b6c 22 22 size_t n, float x[] ) { 23 23 double sum = 0; 24 for ( size_t i = 0;24 for ( size_t i = 0; 25 25 i < BND( n ); i++ ) 26 sum += x[i];26 sum += @x[i]@; 27 27 return sum; 28 28 } … … 43 43 int main() { 44 44 float x[EXPSZ]; 45 for ( size_t i = 0; i < EXPSZ; i++ ) x[i] = 0.1 * (i + 1);46 for ( size_t i = 0; i < EXPSZ; i++ ) printf("elm %zd %g\n", i, x[i]);45 for ( size_t i = 0; i < EXPSZ; i++ ) x[i] = 0.1 * (i + 1); 46 for ( size_t i = 0; i < EXPSZ; i++ ) printf("elm %zd %g\n", i, x[i]); 47 47 double sum_ret = sum( EXPSZ, x ); 48 48 printf( "sum %2g\n", sum_ret ); -
doc/theses/mike_brooks_MMath/programs/ar-bchk/control.cc
reb0d9b7 r80e83b6c 22 22 vector<float> & x ) { 23 23 double sum = 0; 24 for ( size_t i = 0;24 for ( size_t i = 0; 25 25 i < BND( x.size() ); i++ ) 26 sum += x.at(i);26 sum += @x.at(i)@; 27 27 return sum; 28 28 } … … 43 43 int main() { 44 44 vector<float> x( EXPSZ ); 45 for ( size_t i = 0; i < EXPSZ; i++ ) x.at(i) = 0.1 * (i + 1);46 for ( size_t i = 0; i < EXPSZ; i++ ) cout << "elm " << i << " " << x[i] << endl;45 for ( size_t i = 0; i < EXPSZ; i++ ) x.at(i) = 0.1 * (i + 1); 46 for ( size_t i = 0; i < EXPSZ; i++ ) cout << "elm " << i << " " << x[i] << endl; 47 47 double sum_ret = sum( x ); 48 48 cout << "sum " << sum_ret << endl; -
doc/theses/mike_brooks_MMath/programs/ar-bchk/control.cfa
reb0d9b7 r80e83b6c 22 22 array(float, N) & x ) { 23 23 double sum = 0; 24 for ( i;24 for ( i; 25 25 BND( N ) ) 26 sum += x[i];26 sum += @x[i]@; 27 27 return sum; 28 28 } -
doc/theses/mike_brooks_MMath/programs/ar-bchk/treatment.c
reb0d9b7 r80e83b6c 24 24 float lhs[m][p], 25 25 float rhs[p][n] ) { 26 for ( size_t i = 0;26 for ( size_t i = 0; 27 27 i < m; i++ ) 28 for ( size_t j = 0;28 for ( size_t j = 0; 29 29 j < n; j++ ) { 30 30 res[i][j] = 0.0; 31 for ( size_t k = 0;31 for ( size_t k = 0; 32 32 k < p; k++ ) 33 res[i][j] +=34 lhs[i][k] *35 rhs[k][j];33 @res[i][j] +=@ 34 @lhs[i][k] *@ 35 @rhs[k][j];@ 36 36 } 37 37 } … … 49 49 50 50 static void zero( size_t r, size_t c, float mat[r][c] ) { 51 for ( size_t i = 0; i < r; i++ )52 for ( size_t j = 0; j < c; j++ )51 for ( size_t i = 0; i < r; i++ ) 52 for ( size_t j = 0; j < c; j++ ) 53 53 mat[i][j] = 0.0; 54 54 } … … 56 56 57 57 static void fill( size_t r, size_t c, float mat[r][c] ) { 58 for ( size_t i = 0; i < r; i++ )59 for ( size_t j = 0; j < c; j++ )58 for ( size_t i = 0; i < r; i++ ) 59 for ( size_t j = 0; j < c; j++ ) 60 60 mat[i][j] = 1.0 * (i + 1) + 0.1 * (j+1); 61 61 } … … 63 63 64 64 static void print( size_t r, size_t c, float mat[r][c] ) { 65 for ( size_t i = 0; i < r; i++ ) {66 for ( size_t j = 0; j < c; j++ )65 for ( size_t i = 0; i < r; i++ ) { 66 for ( size_t j = 0; j < c; j++ ) 67 67 printf("%2g ", mat[i][j]); 68 68 printf("\n"); -
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; -
doc/theses/mike_brooks_MMath/programs/ar-bchk/treatment.cfa
reb0d9b7 r80e83b6c 24 24 array(float, M, P) & lhs, 25 25 array(float, P, N) & rhs ) { 26 for ( i; M )26 for ( i; M ) 27 27 28 for ( j; N ) {28 for ( j; N ) { 29 29 30 30 res[i, j] = 0.0; 31 for ( k; P )31 for ( k; P ) 32 32 33 res[i, j] +=34 lhs[i, k] *35 rhs[k, j];33 @res[i, j] +=@ 34 @lhs[i, k] *@ 35 @rhs[k, j];@ 36 36 } 37 37 }
Note:
See TracChangeset
for help on using the changeset viewer.