Index: libcfa/src/bits/algorithm.hfa
===================================================================
--- libcfa/src/bits/algorithm.hfa	(revision f898983e2ff20b90d4e53f1a8cac372538fd7b0e)
+++ libcfa/src/bits/algorithm.hfa	(revision d9b7b6680779da5d44599d82435d9ddbf7e30081)
@@ -9,7 +9,7 @@
 // Author           : Thierry Delisle
 // Created On       : Mon Oct 30 13:37:34 2017
-// Last Modified By : --
-// Last Modified On : --
-// Update Count     : 0
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Sat Jul 22 08:25:29 2023
+// Update Count     : 3
 //
 
@@ -17,12 +17,12 @@
 
 #ifdef SAFE_SORT
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort2( T * arr );
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort3( T * arr );
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort4( T * arr );
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort5( T * arr );
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort6( T * arr );
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sortN( T * arr, size_t dim );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort2( T * arr );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort3( T * arr );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort4( T * arr );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort5( T * arr );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sort6( T * arr );
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } ) static inline void __libcfa_small_sortN( T * arr, size_t dim );
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort( T * arr, size_t dim ) {
 	switch( dim ) {
@@ -41,10 +41,10 @@
 #define SWAP(x,y) { T a = min(arr[x], arr[y]); T b = max(arr[x], arr[y]); arr[x] = a; arr[y] = b;}
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort2( T * arr ) {
 	SWAP(0, 1);
 }
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort3( T * arr ) {
 	SWAP(1, 2);
@@ -53,5 +53,5 @@
 }
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort4( T * arr ) {
 	SWAP(0, 1);
@@ -62,5 +62,5 @@
 }
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort5( T * arr ) {
 	SWAP(0, 1);
@@ -75,5 +75,5 @@
 }
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sort6( T * arr ) {
 	SWAP(1, 2);
@@ -91,10 +91,10 @@
 }
 
-forall( T | {  int ?<?( T, T ); int ?>?( T, T ); } )
+forall( T | { int ?<?( T, T ); int ?>?( T, T ); } )
 static inline void __libcfa_small_sortN( T * arr, size_t dim ) {
-	int i, j;
-	for (i = 1; i < dim; i++) {
+	for ( i; 1 ~ dim ) {
 		T tmp = arr[i];
-		for (j = i; j >= 1 && tmp < arr[j-1]; j--) {
+		int j;
+		for ( j = i; j >= 1 && tmp < arr[j-1]; j--) {
 			arr[j] = arr[j-1];
 		}
@@ -175,7 +175,7 @@
 
 static inline void __libcfa_small_sortN( void* * arr, size_t dim ) {
-	int i, j;
-	for (i = 1; i < dim; i++) {
-		void* tmp = arr[i];
+	for ( i; 1 ~ dim ) {
+		void * tmp = arr[i];
+		int j;
 		for (j = i; j >= 1 && tmp < arr[j-1]; j--) {
 			arr[j] = arr[j-1];
Index: libcfa/src/bits/debug.cfa
===================================================================
--- libcfa/src/bits/debug.cfa	(revision f898983e2ff20b90d4e53f1a8cac372538fd7b0e)
+++ libcfa/src/bits/debug.cfa	(revision d9b7b6680779da5d44599d82435d9ddbf7e30081)
@@ -10,6 +10,6 @@
 // Created On       : Thu Mar 30 12:30:01 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Apr 22 18:20:26 2022
-// Update Count     : 13
+// Last Modified On : Sat Jul 22 08:17:27 2023
+// Update Count     : 14
 //
 
@@ -33,5 +33,5 @@
 			in_buffer += count;
 
-			for ( ;; ) {
+			for () {
 				retcode = write( fd, in_buffer, len - count );
 
Index: libcfa/src/bits/queue.hfa
===================================================================
--- libcfa/src/bits/queue.hfa	(revision f898983e2ff20b90d4e53f1a8cac372538fd7b0e)
+++ libcfa/src/bits/queue.hfa	(revision d9b7b6680779da5d44599d82435d9ddbf7e30081)
@@ -91,5 +91,5 @@
 			T * prev = 0p;
 			T * curr = (T *)root;
-			for ( ;; ) {
+			for () {
 				if ( &n == curr ) {						// found => remove
 					if ( (T *)root == &n ) {