Index: tests/concurrent/examples/boundedBufferEXT.c
===================================================================
--- tests/concurrent/examples/boundedBufferEXT.c	(revision dc8511c89e456024f8e634c472b1ebc5d96cc56e)
+++ tests/concurrent/examples/boundedBufferEXT.c	(revision 5ebb1368ce901ac858c76deab9b26440e99beb46)
@@ -8,6 +8,6 @@
 // Created On       : Wed Apr 18 22:52:12 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Aug 16 08:17:03 2018
-// Update Count     : 8
+// Last Modified On : Tue Dec 11 21:55:02 2018
+// Update Count     : 9
 //
 
@@ -115,5 +115,5 @@
 		sum += sums[i];
 	} // for
-	sout | "total:" | sum | endl;
+	sout | "total:" | sum;
 }
 
Index: tests/concurrent/examples/boundedBufferINT.c
===================================================================
--- tests/concurrent/examples/boundedBufferINT.c	(revision dc8511c89e456024f8e634c472b1ebc5d96cc56e)
+++ tests/concurrent/examples/boundedBufferINT.c	(revision 5ebb1368ce901ac858c76deab9b26440e99beb46)
@@ -8,6 +8,6 @@
 // Created On       : Mon Oct 30 12:45:13 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Aug 16 08:17:58 2018
-// Update Count     : 83
+// Last Modified On : Tue Dec 11 21:55:45 2018
+// Update Count     : 84
 //
 
@@ -116,5 +116,5 @@
 		sum += sums[i];
 	} // for
-	sout | "total:" | sum | endl;
+	sout | "total:" | sum;
 }
 
Index: tests/concurrent/examples/datingService.c
===================================================================
--- tests/concurrent/examples/datingService.c	(revision dc8511c89e456024f8e634c472b1ebc5d96cc56e)
+++ tests/concurrent/examples/datingService.c	(revision 5ebb1368ce901ac858c76deab9b26440e99beb46)
@@ -8,6 +8,6 @@
 // Created On       : Mon Oct 30 12:56:20 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sun May 27 09:05:18 2018
-// Update Count     : 26
+// Last Modified On : Tue Dec 11 21:55:34 2018
+// Update Count     : 28
 //
 
@@ -58,5 +58,5 @@
 	yield( random( 100 ) );								// don't all start at the same time
 	unsigned int partner = girl( TheExchange, id, ccode );
-	sout | "Girl:" | id | "is dating Boy at" | partner | "with ccode" | ccode | endl;
+	sout | "Girl:" | id | "is dating Boy at" | partner | "with ccode" | ccode;
 	girlck[id] = partner;
 } // Girl main
@@ -69,5 +69,5 @@
 
 thread Boy {
-	DatingService &TheExchange;
+	DatingService & TheExchange;
 	unsigned int id, ccode;
 }; // Boy
@@ -76,5 +76,5 @@
 	yield( random( 100 ) );								// don't all start at the same time
 	unsigned int partner = boy( TheExchange, id, ccode );
-	sout | " Boy:" | id | "is dating Girl" | partner | "with ccode" | ccode | endl;
+	sout | " Boy:" | id | "is dating Girl" | partner | "with ccode" | ccode;
 	boyck[id] = partner;
 } // Boy main
Index: tests/concurrent/examples/matrixSum.c
===================================================================
--- tests/concurrent/examples/matrixSum.c	(revision dc8511c89e456024f8e634c472b1ebc5d96cc56e)
+++ tests/concurrent/examples/matrixSum.c	(revision 5ebb1368ce901ac858c76deab9b26440e99beb46)
@@ -11,6 +11,6 @@
 // Created On       : Mon Oct  9 08:29:28 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Nov  6 17:51:32 2018
-// Update Count     : 14
+// Last Modified On : Tue Dec 11 21:54:55 2018
+// Update Count     : 15
 //
 
@@ -54,5 +54,5 @@
 		total += subtotals[r];							// total subtotals
 	} // for
-	sout | total | endl;
+	sout | total;
 }
 
Index: tests/concurrent/examples/quickSort.c
===================================================================
--- tests/concurrent/examples/quickSort.c	(revision dc8511c89e456024f8e634c472b1ebc5d96cc56e)
+++ tests/concurrent/examples/quickSort.c	(revision 5ebb1368ce901ac858c76deab9b26440e99beb46)
@@ -9,6 +9,6 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Aug 16 08:17:41 2018
-// Update Count     : 163
+// Last Modified On : Tue Dec  4 18:00:27 2018
+// Update Count     : 167
 //
 
@@ -88,5 +88,5 @@
 
 void usage( char * argv[] ) {
-	sout | "Usage:" | argv[0] | "( -s unsorted-file [ sorted-file ] | -t size (>= 0) [ depth (>= 0) ] )" | endl;
+	sout | "Usage:" | argv[0] | "( -s unsorted-file [ sorted-file ] | -t size (>= 0) [ depth (>= 0) ] )";
 	exit( EXIT_FAILURE );								// TERMINATE!
 } // usage
@@ -114,5 +114,5 @@
 				&sortedfile = new( (const char *)argv[2] ); // open the output file
 				if ( fail( sortedfile ) ) {
-					serr | "Error! Could not open sorted output file \"" | argv[2] | "\"" | endl;
+					serr | "Error! Could not open sorted output file \"" | argv[2] | "\"";
 					usage( argv );
 				} // if
@@ -121,5 +121,5 @@
 				&unsortedfile = new( (const char *)argv[1] ); // open the input file
 				if ( fail( unsortedfile ) ) {
-					serr | "Error! Could not open unsorted input file \"" | argv[1] | "\"" | endl;
+					serr | "Error! Could not open unsorted input file \"" | argv[1] | "\"";
 					usage( argv );
 				} // if
@@ -127,4 +127,5 @@
 		} // if
 	} // if
+	sortedfile | nlOff;									// turn off auto newline
 
 	enum { ValuesPerLine = 22 };						// number of values printed per line
@@ -137,18 +138,18 @@
 			for ( int counter = 0; counter < size; counter += 1 ) { // read unsorted numbers
 				unsortedfile | values[counter];
-				if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | endl | "  ";
+				if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
 				sortedfile | values[counter];
 				if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
 			} // for
-			sortedfile | endl;
+			sortedfile | nl;
 			if ( size > 0 ) {							// values to sort ?
 				Quicksort QS = { values, size - 1, 0 }; // sort values
 			} // wait until sort tasks terminate
 			for ( int counter = 0; counter < size; counter += 1 ) { // print sorted list
-				if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | endl | "  ";
+				if ( counter != 0 && counter % ValuesPerLine == 0 ) sortedfile | nl | "  ";
 				sortedfile | values[counter];
 				if ( counter < size - 1 && (counter + 1) % ValuesPerLine != 0 ) sortedfile | ' ';
 			} // for
-			sortedfile | endl | endl;
+			sortedfile | nl;
 
 			delete( values );