Changeset 3aa1d22 for tests/concurrent/examples/quickSort.cfa

Timestamp:

Jun 21, 2019, 11:46:55 AM (5 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

49dee5e

Parents:

d38c4b4

Message:

change from C to CFA for statements in example programs

File:

• tests/concurrent/examples/quickSort.cfa (modified) (5 diffs)

tests/concurrent/examples/quickSort.cfa

@@ -11 +11 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Mar 22 13:42:01 2019
-// Update Count     : 170
+// Last Modified On : Fri Jun 21 08:27:45 2019
+// Update Count     : 172
 //
 
@@ -138 +138 @@
                   if ( eof( unsortedfile ) ) break;
                         int * values = alloc( size );                           // values to be sorted, too large to put on stack
-                        for ( int counter = 0; counter < size; counter += 1 ) { // read unsorted numbers
+                        for ( counter; size ) {                                         // read unsorted numbers
                                 unsortedfile | values[counter];
                                 if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
@@ -148 +148 @@
                                 Quicksort QS = { values, size - 1, 0 }; // sort values
                         } // wait until sort tasks terminate
-                        for ( int counter = 0; counter < size; counter += 1 ) { // print sorted list
+                        for ( counter; size ) {                                         // print sorted list
                                 if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
                                 sortedfile | values[counter];
@@ -163 +163 @@
 
                 int * values = alloc( size );                           // values to be sorted, too large to put on stack
-                for ( int counter = 0; counter < size; counter += 1 ) { // generate unsorted numbers
+                for ( counter; size ) {                                         // generate unsorted numbers
                         values[counter] = size - counter;                       // descending values
                 } // for
@@ -170 +170 @@
                 } // wait until sort tasks terminate
 
-                // for ( int counter = 0; counter < size - 1; counter += 1 ) { // check sorting
+                // for ( counter; size - 1 ) {                          // check sorting
                 //      if ( values[counter] > values[counter + 1] ) abort();
                 // } // for