Index: libcfa/src/collections/string.cfa
===================================================================
--- libcfa/src/collections/string.cfa	(revision 2f1656963c856b0273be7b573bf11a9e411e68a4)
+++ libcfa/src/collections/string.cfa	(revision bc547d37653baaa8e7fac63a33cc9fe1fd2a3b0f)
@@ -10,6 +10,6 @@
 // Created On       : Fri Sep 03 11:00:00 2021
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri May  8 07:41:00 2026
-// Update Count     : 409
+// Last Modified On : Fri May  8 08:38:51 2026
+// Update Count     : 413
 //
 
@@ -57,10 +57,10 @@
 }
 
-void ?{}( string & s, const char * cs ) {
+void ?{}( string & s, const char cs[] ) {
 	(s.inner) { malloc() };
 	?{}( *s.inner, cs );
 }
 
-void ?{}( string & s, const char * cs , size_t size ) {
+void ?{}( string & s, const char cs[] , size_t size ) {
 	(s.inner) { malloc() };
 	?{}( *s.inner, cs, size );
@@ -128,5 +128,5 @@
 }
 
-string & ?=?( string & s, const char * rhs ) {
+string & ?=?( string & s, const char rhs[] ) {
 	(*s.inner) = rhs;
 	return s;
@@ -138,5 +138,5 @@
 }
 
-string & assign( string & s, const char * rhs, size_t n ) {
+string & assign( string & s, const char rhs[], size_t n ) {
 	assign( *s.inner, rhs, n );
 	return s;
@@ -177,5 +177,5 @@
 
 // safe conversion from string to char *
-char * strncpy( char * dst, string & src, size_t n ) {
+char * strncpy( char dst[], string & src, size_t n ) {
 	size_t l = min( n - 1, len( src ) );				// ensure null terminated
 	for ( i; l ) dst[i] = src[i];
@@ -273,9 +273,9 @@
 }
 
-void ?+=?( string & s, const char * cs ) {
+void ?+=?( string & s, const char cs[] ) {
 	(*s.inner) += cs;
 }
 
-void append( string & s, const char * buffer, size_t bsize ) {
+void append( string & s, const char buffer[], size_t bsize ) {
 	append( (*s.inner), buffer, bsize );
 }
@@ -299,5 +299,5 @@
 }
 
-string ?+?( const char * cs,  char c ) {
+string ?+?( const char cs[],  char c ) {
 	string ret = cs;
 	ret += c;
@@ -305,5 +305,5 @@
 }
 
-string ?+?( char c, const char * cs ) {
+string ?+?( char c, const char cs[] ) {
 	string ret = c;
 	ret += cs;
@@ -311,5 +311,5 @@
 }
 
-string ?+?( const char * cs1, const char * cs2 ) {
+string ?+?( const char cs1[], const char cs2[] ) {
 	string ret = cs1;
 	ret += cs2;
@@ -317,5 +317,5 @@
 }
 
-string ?+?( const char * cs, string s ) {
+string ?+?( const char cs[], string s ) {
 	string ret = cs;
 	ret += s;
@@ -323,5 +323,5 @@
 }
 
-string ?+?( string s, const char * cs ) {
+string ?+?( string s, const char cs[] ) {
 	string ret = s;
 	ret += cs;
@@ -354,5 +354,5 @@
 }
 
-string ?*?( const char * cs, strmul_factor_t factor ) {
+string ?*?( const char cs[], strmul_factor_t factor ) {
 	string ret = cs;
 	ret *= factor;
@@ -384,5 +384,5 @@
 }
 
-int strncmp( const string & s, const char * cs, size_t maxlen ) {
+int strncmp( const string & s, const char cs[], size_t maxlen ) {
 	size_t cslen = len( cs );
 	if ( maxlen > len( s ) || maxlen > cslen ) {
@@ -392,10 +392,10 @@
 }
 
-int strncmp( const char * s, const string & cs, size_t maxlen ) {
-	size_t slen = len( s );
-	if ( maxlen > slen || maxlen > len( cs ) ) {
-		abort( STRNCPY_FMT, maxlen, slen, len( cs ) );
+int strncmp( const char cs[], const string & s, size_t maxlen ) {
+	size_t slen = len( cs );
+	if ( maxlen > slen || maxlen > len( s ) ) {
+		abort( STRNCPY_FMT, maxlen, slen, len( s ) );
 	} // if
-	return strcmp$( s, maxlen, cs.inner->Handle.s, maxlen );
+	return strcmp$( cs, maxlen, s.inner->Handle.s, maxlen );
 }
 
@@ -425,9 +425,9 @@
 }
 
-size_t find( const string & s, const char * key ) {
+size_t find( const string & s, const char key[] ) {
 	return find( *s.inner, key );
 }
 
-size_t find( const string & s, const char * key, size_t keysize ) {
+size_t find( const string & s, const char key[], size_t keysize ) {
 	return find( *s.inner, key, keysize );
 }
@@ -437,9 +437,9 @@
 }
 
-size_t find( const string & s, size_t start, const char * key ) {
+size_t find( const string & s, size_t start, const char key[] ) {
 	return findFrom( *s.inner, start, key );
 }
 
-size_t find( const string & s, size_t start, const char * key, size_t keysize ) {
+size_t find( const string & s, size_t start, const char key[], size_t keysize ) {
 	return findFrom( *s.inner, start, key, keysize );
 }
@@ -449,9 +449,9 @@
 // }
 
-// bool includes( const string & s, const char * search ) {
+// bool includes( const string & s, const char search[] ) {
 // 	return includes( *s.inner, search );
 // }
 
-// bool includes( const string & s, const char * search, size_t searchsize ) {
+// bool includes( const string & s, const char search[], size_t searchsize ) {
 // 	return includes( *s.inner, search, searchsize );
 // }
@@ -461,9 +461,9 @@
 }
 
-bool startsWith( const string & s, const char * prefix ) {
+bool startsWith( const string & s, const char prefix[] ) {
 	return startsWith( *s.inner, prefix );
 }
 
-bool startsWith( const string & s, const char * prefix, size_t prefixsize ) {
+bool startsWith( const string & s, const char prefix[], size_t prefixsize ) {
 	return startsWith( *s.inner, prefix, prefixsize );
 }
@@ -473,9 +473,9 @@
 }
 
-bool endsWith( const string & s, const char * suffix ) {
+bool endsWith( const string & s, const char suffix[] ) {
 	return endsWith( *s.inner, suffix );
 }
 
-bool endsWith( const string & s, const char * suffix, size_t suffixsize ) {
+bool endsWith( const string & s, const char suffix[], size_t suffixsize ) {
 	return endsWith( *s.inner, suffix, suffixsize );
 }
@@ -490,10 +490,10 @@
 }
 
-void ?{}( charclass & s, const char * chars ) {
+void ?{}( charclass & s, const char chars[] ) {
 	(s.inner) { malloc() };
 	?{}( *s.inner, chars );
 }
 
-void ?{}( charclass & s, const char * chars, size_t charssize ) {
+void ?{}( charclass & s, const char chars[], size_t charssize ) {
 	(s.inner) { malloc() };
 	?{}( *s.inner, chars, charssize );