Changes in doc/papers/concurrency/examples/Fib2.cfa [1e5d0f0c:600d7be]

File:

• doc/papers/concurrency/examples/Fib2.cfa (modified) (5 diffs)

doc/papers/concurrency/examples/Fib2.cfa

@@ -10 +10 @@
 // Created On       : Thu Apr 26 23:20:08 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Mar 22 17:26:41 2019
-// Update Count     : 28
+// Last Modified On : Sat May 18 08:55:59 2019
+// Update Count     : 36
 // 
 
@@ -17 +17 @@
 #include <coroutine.hfa>
 
-coroutine Fibonacci { int fn1; };                                               // used for communication
+coroutine Fibonacci { int fn1, fn; };                                   // used for communication
 
 void main( Fibonacci & fib ) with( fib ) {                              // called on first resume
-        int fn;
-        [fn1, fn] = [0, 1];                                                                     // precompute first two states
+        [fn1, fn] = [1, 0];                                                                     // precompute first two states
         for () {
                 suspend();                                                                              // restart last resume
@@ -29 +28 @@
 
 int ?()( Fibonacci & fib ) with( fib ) {                                // function call operator
-        resume( fib );                                                                          // restart last suspend
-        return fn1;
+        return resume( fib ).fn1;                                                       // restart last suspend
 }
 
@@ -36 +34 @@
         Fibonacci f1, f2;
         for ( 10 ) {                                                                            // print N Fibonacci values
-                sout | f1() | f2();
+                sout | resume( f1 ).fn | resume( f2 ).fn;
         } // for
 }
@@ -42 +40 @@
 // Local Variables: //
 // tab-width: 4 //
-// compile-command: "cfa fibonacci_1.cfa" //
+// compile-command: "cfa Fib2.cfa" //
 // End: //