Changeset 5546f50b for doc/theses/mike_brooks_MMath/programs/array-boundcheck-removal-stdvec.cpp

Timestamp:

Mar 10, 2024, 11:21:18 AM (7 months ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Children:

9398177

Parents:

b64d0f4

Message:

more switch to tabs

File:

• doc/theses/mike_brooks_MMath/programs/array-boundcheck-removal-stdvec.cpp (modified) (5 diffs)

doc/theses/mike_brooks_MMath/programs/array-boundcheck-removal-stdvec.cpp

@@ -3 +3 @@
 forall( [M], [N], [P] )
 void matmul( array(float, M, P) & src1,
-             array(float, P, N) & src2, 
-             array(float, M, N) & tgt ) {
-    for (i; M) for (j; N) {
-        tgt[i][j] = 0;
-        for (k; P)
-            tgt[i][j] += src1[i][k] * src2[k][j];
-    }
+                         array(float, P, N) & src2, 
+                         array(float, M, N) & tgt ) {
+        for (i; M) for (j; N) {
+                tgt[i][j] = 0;
+                for (k; P)
+                        tgt[i][j] += src1[i][k] * src2[k][j];
+        }
 }
 */
@@ -30 +30 @@
 
 float f( vector<float> & a ) {
-    float result = 0;
-    for( int i = 0; i < BOUND(a.size()); i++ ) {
-        result += a.at(i);
-        // hillarious that, while writing THIS VERY DEMO, on first go, I actaully wrote it a[i]
-    }
-    return result;
+        float result = 0;
+        for( int i = 0; i < BOUND(a.size()); i++ ) {
+                result += a.at(i);
+                // hillarious that, while writing THIS VERY DEMO, on first go, I actaully wrote it a[i]
+        }
+        return result;
 }
 
@@ -41 +41 @@
 #include <iostream>
 int main( int argc, char ** argv ) {
-    vector<float> v(5);
-    v.at(0) = 3.14;
-    v.at(1) = 3.14;
-    v.at(2) = 3.14;
-    v.at(3) = 3.14;
-    v.at(4) = 3.14;
+        vector<float> v(5);
+        v.at(0) = 3.14;
+        v.at(1) = 3.14;
+        v.at(2) = 3.14;
+        v.at(3) = 3.14;
+        v.at(4) = 3.14;
 
-    float answer = f(v);
+        float answer = f(v);
 
-    cout << "answer: " << answer << endl;
+        cout << "answer: " << answer << endl;
 
 }
@@ -80 +80 @@
 
 void matmul( mat & a, mat & b, mat & rslt ) {
-    size_t m = rslt.size();
-    assert( m == a.size() );
-    size_t p = b.size();
-    for ( int i = 0; i < BOUND(m); i++ ) {
-        assert( p == a.at(i).size() );
-        size_t n = rslt.at(i).size();
-        for ( int j = 0; j < BOUND(n); j++ ) {
-            rslt.at(i).at(j) = 0.0;
-            for ( int k = 0; k < BOUND(p); k++ ) {
-                assert(b.at(k).size() == n); // asking to check it too often
-                rslt.at(i).at(j) += a.at(i).at(k) * b.at(k).at(j);
-            }
-        }
-    }
+        size_t m = rslt.size();
+        assert( m == a.size() );
+        size_t p = b.size();
+        for ( int i = 0; i < BOUND(m); i++ ) {
+                assert( p == a.at(i).size() );
+                size_t n = rslt.at(i).size();
+                for ( int j = 0; j < BOUND(n); j++ ) {
+                        rslt.at(i).at(j) = 0.0;
+                        for ( int k = 0; k < BOUND(p); k++ ) {
+                                assert(b.at(k).size() == n); // asking to check it too often
+                                rslt.at(i).at(j) += a.at(i).at(k) * b.at(k).at(j);
+                        }
+                }
+        }
 }
 
@@ -99 +99 @@
 #include <iostream>
 int main( int argc, char ** argv ) {
-    mat a(5, vector<float>(6));
-    mat b(6, vector<float>(7));
-    mat r(5, vector<float>(7));
-    matmul(a, b, r);
+        mat a(5, vector<float>(6));
+        mat b(6, vector<float>(7));
+        mat r(5, vector<float>(7));
+        matmul(a, b, r);
 }
 #endif