Index: libcfa/src/iostream.cfa
===================================================================
--- libcfa/src/iostream.cfa	(revision cd3fc46637821f740cdb83c3afaf218deb572dc4)
+++ libcfa/src/iostream.cfa	(revision f6a491719a5bbae5add16905dadacfda4e964d30)
@@ -10,6 +10,6 @@
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Jan 19 08:15:53 2022
-// Update Count     : 1352
+// Last Modified On : Thu Aug 25 18:05:49 2022
+// Update Count     : 1354
 //
 
@@ -197,5 +197,5 @@
 			fmt( os, "%s", buf ); \
 			if ( isfinite( val ) ) { /* if number, print decimal point when no fraction or exponent */ \
-				for ( int i = 0;; i += 1 ) { \
+				for ( i; 0 ~ @ ) { \
 					if ( i == len ) { fmt( os, "." ); break; } \
 					if ( buf[i] == '.' || buf[i] == 'e' || buf[i] == 'E' ) break; /* decimal point or scientific ? */ \
Index: libcfa/src/rational.cfa
===================================================================
--- libcfa/src/rational.cfa	(revision cd3fc46637821f740cdb83c3afaf218deb572dc4)
+++ libcfa/src/rational.cfa	(revision f6a491719a5bbae5add16905dadacfda4e964d30)
@@ -10,6 +10,6 @@
 // Created On       : Wed Apr  6 17:54:28 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jul 20 16:30:06 2021
-// Update Count     : 193
+// Last Modified On : Thu Aug 25 18:09:58 2022
+// Update Count     : 194
 //
 
@@ -26,5 +26,5 @@
 	// rationals.  alternative: https://en.wikipedia.org/wiki/Binary_GCD_algorithm
 	static T gcd( T a, T b ) {
-		for ( ;; ) {									// Euclid's algorithm
+		for () {										// Euclid's algorithm
 			T r = a % b;
 		  if ( r == (T){0} ) break;
@@ -246,5 +246,5 @@
 
 	// find terms until denom gets too big
-	for ( ;; ) {
+	for () {
 		ai = convert( f );
 	  if ( ! (m10 * ai + m11 <= md) ) break;
Index: libcfa/src/stdlib.cfa
===================================================================
--- libcfa/src/stdlib.cfa	(revision cd3fc46637821f740cdb83c3afaf218deb572dc4)
+++ libcfa/src/stdlib.cfa	(revision f6a491719a5bbae5add16905dadacfda4e964d30)
@@ -10,6 +10,6 @@
 // Created On       : Thu Jan 28 17:10:29 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Feb 10 22:41:39 2022
-// Update Count     : 602
+// Last Modified On : Thu Aug 25 22:41:14 2022
+// Update Count     : 604
 //
 
@@ -35,5 +35,5 @@
 T * anew( size_t dim, TT p ) {
 	T * arr = alloc( dim );
-	for ( unsigned int i = 0; i < dim; i += 1 ) {
+	for ( i; dim ) {
 		(arr[i]){ p };									// run constructor
 	} // for
@@ -45,5 +45,5 @@
 	if ( arr ) {										// ignore null
 		size_t dim = malloc_size( arr ) / sizeof( T );
-		for ( int i = dim - 1; i >= 0; i -= 1 ) {		// reverse allocation order, must be unsigned
+		for ( i; 0 -~= dim - 1 ) {						// reverse allocation order, must be unsigned
 			^(arr[i]){};								// run destructor
 		} // for
@@ -56,5 +56,5 @@
 	if ( arr ) {										// ignore null
 		size_t dim = malloc_size( arr ) / sizeof( T );
-		for ( int i = dim - 1; i >= 0; i -= 1 ) {		// reverse allocation order, must be unsigned
+		for ( i; 0 -~= dim - 1 ) {						// reverse allocation order, must be unsigned
 			^(arr[i]){};								// run destructor
 		} // for
Index: libcfa/src/stdlib.hfa
===================================================================
--- libcfa/src/stdlib.hfa	(revision cd3fc46637821f740cdb83c3afaf218deb572dc4)
+++ libcfa/src/stdlib.hfa	(revision f6a491719a5bbae5add16905dadacfda4e964d30)
@@ -10,6 +10,6 @@
 // Created On       : Thu Jan 28 17:12:35 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Apr 18 17:57:36 2022
-// Update Count     : 644
+// Last Modified On : Thu Aug 25 18:07:06 2022
+// Update Count     : 645
 //
 
@@ -192,5 +192,5 @@
 			memset( (char *)ptr + copy_end, (int)Fill.c, Dim * size - copy_end );
 		} else if ( Fill.tag == 't' ) {
-			for ( int i = copy_end; i < Dim * size; i += size ) {
+			for ( i; copy_end ~ Dim * size ~ size ) {
 				#pragma GCC diagnostic push
 				#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"