Index: tests/concurrent/examples/quickSort.cfa
===================================================================
--- tests/concurrent/examples/quickSort.cfa	(revision fdf4efb2f3a19b3b5689c86eb0a72de59d827d72)
+++ tests/concurrent/examples/quickSort.cfa	(revision 3d5701e14a6d4f307682f895f813314afe663a4d)
@@ -11,6 +11,6 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Oct 10 13:58:18 2019
-// Update Count     : 176
+// Last Modified On : Wed Feb 12 18:24:47 2020
+// Update Count     : 177
 //
 
@@ -27,5 +27,5 @@
 
 void ?{}( Quicksort & qs, int values[], int size, int depth ) {
-	qs.values = values;  qs.low = 0;  qs.high = size;  qs.depth = depth;
+	qs.[values, low, high, depth] = [values, 0, size, depth];
 } // Quicksort
 
@@ -167,5 +167,5 @@
 			values[counter] = size - counter;			// descending values
 		} // for
-		for ( int i = 0; i < 200; i +=1 ) {				// random shuffle a few values
+		for ( i; 200 ) {								// random shuffle a few values
 			swap( values[rand() % size], values[rand() % size] );
 		} // for