Changeset cdbab55 for tests/coroutine/fibonacci.c

Timestamp:

Aug 21, 2018, 2:24:29 PM (7 years ago)

Author:

Rob Schluntz <rschlunt@…>

Branches:

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

Children:

2a6292d

Parents:

2b79a70 (diff), efa8b6a (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:/u/cforall/software/cfa/cfa-cc

File:

• tests/coroutine/fibonacci.c (moved) (moved from src/tests/coroutine/fibonacci.c ) (3 diffs)

tests/coroutine/fibonacci.c

@@ -6 +6 @@
 //
 // fibonacci.c -- 3-state finite-state machine
-
 //
 // Author           : Thierry Delisle
 // Created On       : Thu Jun  8 07:29:37 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Apr 27 08:55:31 2018
-// Update Count     : 19
+// Last Modified On : Sat Aug 18 11:21:58 2018
+// Update Count     : 24
 //
 
-#include <fstream>
-#include <coroutine>
+#include <fstream.hfa>
+#include <coroutine.hfa>
 
 coroutine Fibonacci { int fn; };                                                // used for communication
@@ -26 +25 @@
         fn = 1;  fn2 = fn1;  fn1 = fn;                                          // 2nd case
         suspend();                                                                                      // restart last resume
-        for ( ;; ) {
+        for () {
                 fn = fn1 + fn2;  fn2 = fn1;  fn1 = fn;                  // general case
                 suspend();                                                                              // restart last resume
@@ -39 +38 @@
 int main() {
         Fibonacci f1, f2;
-        for ( int i = 1; i <= 10; i += 1 ) {
+        for ( 10 ) {                                                                            // print N Fibonacci values
                 sout | next( f1 ) | next( f2 ) | endl;
         } // for