Changeset f802e46

Timestamp:

Oct 1, 2017, 9:59:17 AM (7 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

1033f5d, 72ae87c

Parents:

6e49f18

Message:

cleanup code

Location:

src/tests

Files:

• coroutine.c (modified) (4 diffs)
• gmp.c (modified) (2 diffs)

src/tests/coroutine.c

@@ -10 +10 @@
 // Created On       : Thu Jun  8 07:29:37 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Jun  8 07:37:12 2017
-// Update Count     : 5
+// Last Modified On : Sun Sep 17 21:38:15 2017
+// Update Count     : 7
 //
 
@@ -18 +18 @@
 
 coroutine Fibonacci {
-        int fn;                                         // used for communication
+        int fn;                                                                                         // used for communication
 };
 
@@ -26 +26 @@
 
 void main( Fibonacci & this ) {
-        int fn1, fn2;                                   // retained between resumes
-        this.fn = 0;                                    // case 0
+        int fn1, fn2;                                                                           // retained between resumes
+        this.fn = 0;                                                                            // case 0
         fn1 = this.fn;
-        suspend();                                              // return to last resume
+        suspend();                                                                                      // restart last resume
 
-        this.fn = 1;                                    // case 1
-        fn2 = fn1;
-        fn1 = this.fn;
-        suspend();                                              // return to last resume
+        this.fn = 1;                                                                            // case 1
+        fn2 = fn1;  fn1 = this.fn;
+        suspend();                                                                                      // restart last resume
 
-        for ( ;; ) {                                    // general case
+        for ( ;; ) {                                                                            // general case
                 this.fn = fn1 + fn2;
-                fn2 = fn1;
-                fn1 = this.fn;
-                suspend();                                      // return to last resume
+                fn2 = fn1;  fn1 = this.fn;
+                suspend();                                                                              // restart last resume
         } // for
 }
 
 int next( Fibonacci & this ) {
-        resume( this );                                 // transfer to last suspend
+        resume( this );                                                                         // restart last suspend
         return this.fn;
 }
@@ -52 +50 @@
         Fibonacci f1, f2;
         for ( int i = 1; i <= 10; i += 1 ) {
-                sout | next( f1 ) | ' ' | next( f2 ) | endl;
+                sout | next( f1 ) | next( f2 ) | endl;
         } // for
 }

src/tests/gmp.c

@@ -10 +10 @@
 // Created On       : Tue Apr 19 08:55:51 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Sep  4 09:51:18 2017
-// Update Count     : 550
+// Last Modified On : Thu Sep 28 18:33:51 2017
+// Update Count     : 555
 // 
 
@@ -97 +97 @@
 
         sout | "Factorial Numbers" | endl;
-        Int fact;
-        fact = 1;                                                                                       // 1st case
+        Int fact = 1;                                                                           // 1st case
         sout | (int)0 | fact | endl;
         for ( unsigned int i = 1; i <= 40; i += 1 ) {