Ignore:
Timestamp:
May 8, 2026, 6:09:22 PM (9 hours ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
master
Parents:
2f16569
Message:

formatting

File:
1 edited

Legend:

Unmodified
Added
Removed
  • libcfa/src/collections/string.cfa

    r2f16569 rbc547d3  
    1010// Created On       : Fri Sep 03 11:00:00 2021
    1111// Last Modified By : Peter A. Buhr
    12 // Last Modified On : Fri May  8 07:41:00 2026
    13 // Update Count     : 409
     12// Last Modified On : Fri May  8 08:38:51 2026
     13// Update Count     : 413
    1414//
    1515
     
    5757}
    5858
    59 void ?{}( string & s, const char * cs ) {
     59void ?{}( string & s, const char cs[] ) {
    6060        (s.inner) { malloc() };
    6161        ?{}( *s.inner, cs );
    6262}
    6363
    64 void ?{}( string & s, const char * cs , size_t size ) {
     64void ?{}( string & s, const char cs[] , size_t size ) {
    6565        (s.inner) { malloc() };
    6666        ?{}( *s.inner, cs, size );
     
    128128}
    129129
    130 string & ?=?( string & s, const char * rhs ) {
     130string & ?=?( string & s, const char rhs[] ) {
    131131        (*s.inner) = rhs;
    132132        return s;
     
    138138}
    139139
    140 string & assign( string & s, const char * rhs, size_t n ) {
     140string & assign( string & s, const char rhs[], size_t n ) {
    141141        assign( *s.inner, rhs, n );
    142142        return s;
     
    177177
    178178// safe conversion from string to char *
    179 char * strncpy( char * dst, string & src, size_t n ) {
     179char * strncpy( char dst[], string & src, size_t n ) {
    180180        size_t l = min( n - 1, len( src ) );                            // ensure null terminated
    181181        for ( i; l ) dst[i] = src[i];
     
    273273}
    274274
    275 void ?+=?( string & s, const char * cs ) {
     275void ?+=?( string & s, const char cs[] ) {
    276276        (*s.inner) += cs;
    277277}
    278278
    279 void append( string & s, const char * buffer, size_t bsize ) {
     279void append( string & s, const char buffer[], size_t bsize ) {
    280280        append( (*s.inner), buffer, bsize );
    281281}
     
    299299}
    300300
    301 string ?+?( const char * cs,  char c ) {
     301string ?+?( const char cs[],  char c ) {
    302302        string ret = cs;
    303303        ret += c;
     
    305305}
    306306
    307 string ?+?( char c, const char * cs ) {
     307string ?+?( char c, const char cs[] ) {
    308308        string ret = c;
    309309        ret += cs;
     
    311311}
    312312
    313 string ?+?( const char * cs1, const char * cs2 ) {
     313string ?+?( const char cs1[], const char cs2[] ) {
    314314        string ret = cs1;
    315315        ret += cs2;
     
    317317}
    318318
    319 string ?+?( const char * cs, string s ) {
     319string ?+?( const char cs[], string s ) {
    320320        string ret = cs;
    321321        ret += s;
     
    323323}
    324324
    325 string ?+?( string s, const char * cs ) {
     325string ?+?( string s, const char cs[] ) {
    326326        string ret = s;
    327327        ret += cs;
     
    354354}
    355355
    356 string ?*?( const char * cs, strmul_factor_t factor ) {
     356string ?*?( const char cs[], strmul_factor_t factor ) {
    357357        string ret = cs;
    358358        ret *= factor;
     
    384384}
    385385
    386 int strncmp( const string & s, const char * cs, size_t maxlen ) {
     386int strncmp( const string & s, const char cs[], size_t maxlen ) {
    387387        size_t cslen = len( cs );
    388388        if ( maxlen > len( s ) || maxlen > cslen ) {
     
    392392}
    393393
    394 int strncmp( const char * s, const string & cs, size_t maxlen ) {
    395         size_t slen = len( s );
    396         if ( maxlen > slen || maxlen > len( cs ) ) {
    397                 abort( STRNCPY_FMT, maxlen, slen, len( cs ) );
     394int strncmp( const char cs[], const string & s, size_t maxlen ) {
     395        size_t slen = len( cs );
     396        if ( maxlen > slen || maxlen > len( s ) ) {
     397                abort( STRNCPY_FMT, maxlen, slen, len( s ) );
    398398        } // if
    399         return strcmp$( s, maxlen, cs.inner->Handle.s, maxlen );
     399        return strcmp$( cs, maxlen, s.inner->Handle.s, maxlen );
    400400}
    401401
     
    425425}
    426426
    427 size_t find( const string & s, const char * key ) {
     427size_t find( const string & s, const char key[] ) {
    428428        return find( *s.inner, key );
    429429}
    430430
    431 size_t find( const string & s, const char * key, size_t keysize ) {
     431size_t find( const string & s, const char key[], size_t keysize ) {
    432432        return find( *s.inner, key, keysize );
    433433}
     
    437437}
    438438
    439 size_t find( const string & s, size_t start, const char * key ) {
     439size_t find( const string & s, size_t start, const char key[] ) {
    440440        return findFrom( *s.inner, start, key );
    441441}
    442442
    443 size_t find( const string & s, size_t start, const char * key, size_t keysize ) {
     443size_t find( const string & s, size_t start, const char key[], size_t keysize ) {
    444444        return findFrom( *s.inner, start, key, keysize );
    445445}
     
    449449// }
    450450
    451 // bool includes( const string & s, const char * search ) {
     451// bool includes( const string & s, const char search[] ) {
    452452//      return includes( *s.inner, search );
    453453// }
    454454
    455 // bool includes( const string & s, const char * search, size_t searchsize ) {
     455// bool includes( const string & s, const char search[], size_t searchsize ) {
    456456//      return includes( *s.inner, search, searchsize );
    457457// }
     
    461461}
    462462
    463 bool startsWith( const string & s, const char * prefix ) {
     463bool startsWith( const string & s, const char prefix[] ) {
    464464        return startsWith( *s.inner, prefix );
    465465}
    466466
    467 bool startsWith( const string & s, const char * prefix, size_t prefixsize ) {
     467bool startsWith( const string & s, const char prefix[], size_t prefixsize ) {
    468468        return startsWith( *s.inner, prefix, prefixsize );
    469469}
     
    473473}
    474474
    475 bool endsWith( const string & s, const char * suffix ) {
     475bool endsWith( const string & s, const char suffix[] ) {
    476476        return endsWith( *s.inner, suffix );
    477477}
    478478
    479 bool endsWith( const string & s, const char * suffix, size_t suffixsize ) {
     479bool endsWith( const string & s, const char suffix[], size_t suffixsize ) {
    480480        return endsWith( *s.inner, suffix, suffixsize );
    481481}
     
    490490}
    491491
    492 void ?{}( charclass & s, const char * chars ) {
     492void ?{}( charclass & s, const char chars[] ) {
    493493        (s.inner) { malloc() };
    494494        ?{}( *s.inner, chars );
    495495}
    496496
    497 void ?{}( charclass & s, const char * chars, size_t charssize ) {
     497void ?{}( charclass & s, const char chars[], size_t charssize ) {
    498498        (s.inner) { malloc() };
    499499        ?{}( *s.inner, chars, charssize );
Note: See TracChangeset for help on using the changeset viewer.