Changeset 3ac5fd8 for tests/concurrency

Timestamp:

Aug 17, 2024, 3:15:21 PM (4 months ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Children:

df2e00f

Parents:

afb15cf

Message:

first attempt changing end-of-file to an exception

File:

• tests/concurrency/examples/quickSort.cfa (modified) (2 diffs)

tests/concurrency/examples/quickSort.cfa

@@ -11 +11 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Jan  1 12:07:59 2024
-// Update Count     : 188
+// Last Modified On : Sat Aug 17 13:59:15 2024
+// Update Count     : 199
 //
 
@@ -145 +145 @@
 
         if ( size == -1 ) {                                                                     // generate output ?
-                for () {
-                        unsortedfile | size;                                            // read number of elements in the list
-                  if ( eof( unsortedfile ) ) break;
-
-                        int * values = aalloc( size );                          // values to be sorted, too large to put on stack
-                        for ( counter; size ) {                                         // read unsorted numbers
-                                unsortedfile | values[counter];
-                                if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
-                                sortedfile | values[counter];
-                                if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
+                int * values = 0p;
+                try {
+                        for () {
+                                unsortedfile | size;                                    // read number of elements in the list
+                                values = aalloc( size );                                // values to be sorted, too large to put on stack
+                                for ( counter; size ) {                                 // read unsorted numbers
+                                        unsortedfile | values[counter];
+                                        if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
+                                        sortedfile | values[counter];
+                                        if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
+                                } // for
+                                sortedfile | nl;
+
+                                if ( size > 0 ) {                                               // values to sort ?
+                                        Quicksort QS = { values, size - 1, 0 }; // sort values
+                                } // wait until sort tasks terminate
+                                for ( counter; size ) {                                 // print sorted list
+                                        if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
+                                        sortedfile | values[counter];
+                                        if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
+                                } // for
+                                sortedfile | nl | nl;
+
+                                delete( values );
+                                values = 0p;
                         } // for
-                        sortedfile | nl;
-
-                        if ( size > 0 ) {                                                       // values to sort ?
-                                Quicksort QS = { values, size - 1, 0 }; // sort values
-                        } // wait until sort tasks terminate
-                        for ( counter; size ) {                                         // print sorted list
-                                if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
-                                sortedfile | values[counter];
-                                if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
-                        } // for
-                        sortedfile | nl | nl;
-
+                } catch( end_of_file * ) {
                         delete( values );
-                } // for
+                } // try
         } else {                                                                                        // timing
                 PRNG prng;