Changes in tests/concurrent/examples/boundedBufferINT.cfa [3aa1d22:f8cd310]

File:

• tests/concurrent/examples/boundedBufferINT.cfa (modified) (4 diffs)

tests/concurrent/examples/boundedBufferINT.cfa

@@ -10 +10 @@
 // Created On       : Mon Oct 30 12:45:13 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Jun 21 08:20:46 2019
-// Update Count     : 90
+// Last Modified On : Fri Mar 22 13:41:52 2019
+// Update Count     : 88
 //
 
@@ -53 +53 @@
 }
 
-enum { Sentinel = -1 };
+const int Sentinel = -1;
 
 thread Producer {
@@ -60 +60 @@
 };
 void main( Producer & prod ) with( prod ) {
-        for ( i; 1 ~= N ) {
+        for ( int i = 1; i <= N; i += 1 ) {
                 yield( random( 5 ) );
                 insert( buffer, 1 );
@@ -100 +100 @@
         srandom( 1003 );
 
-        for ( i; Cons ) {                                                                       // create consumers
+        for ( i = 0; i < Cons; i += 1 ) {                                       // create consumers
                 cons[i] = new( &buffer, sums[i] );
         } // for
-        for ( i; Prods ) {                                                                      // create producers
+        for ( i = 0; i < Prods; i += 1 ) {                                      // create producers
                 prods[i] = new( &buffer, 100000 );
         } // for
 
-        for ( i; Prods ) {                                                                      // wait for producers to finish
+        for ( i = 0; i < Prods; i += 1 ) {                                      // wait for producers to finish
                 delete( prods[i] );
         } // for
-        for ( i; Cons ) {                                                                       // generate sentinal values to stop consumers
+        for ( i = 0; i < Cons; i += 1 ) {                                       // generate sentinal values to stop consumers
                 insert( buffer, Sentinel );
         } // for
         int sum = 0;
-        for ( i; Cons ) {                                                                       // wait for consumers to finish
+        for ( i = 0; i < Cons; i += 1 ) {                                       // wait for consumers to finish
                 delete( cons[i] );
                 sum += sums[i];