src/common/string.cpp

   1 /////////////////////////////////////////////////////////////////////////////
   2 // Name:        string.cpp
   3 // Purpose:     wxString class
   4 // Author:      Vadim Zeitlin
   5 // Modified by:
   6 // Created:     29/01/98
   7 // RCS-ID:      $Id$
   8 // Copyright:   (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
   9 // Licence:     wxWindows license
  10 /////////////////////////////////////////////////////////////////////////////
  11
  12 #ifdef __GNUG__
  13   #pragma implementation "string.h"
  14 #endif
  15
  16 /*
  17  * About ref counting:
  18  *  1) all empty strings use g_strEmpty, nRefs = -1 (set in Init())
  19  *  2) AllocBuffer() sets nRefs to 1, Lock() increments it by one
  20  *  3) Unlock() decrements nRefs and frees memory if it goes to 0
  21  */
  22
  23 // ===========================================================================
  24 // headers, declarations, constants
  25 // ===========================================================================
  26
  27 // For compilers that support precompilation, includes "wx.h".
  28 #include "wx/wxprec.h"
  29
  30 #ifdef __BORLANDC__
  31   #pragma hdrstop
  32 #endif
  33
  34 #ifndef WX_PRECOMP
  35   #include "wx/defs.h"
  36   #include "wx/string.h"
  37   #include "wx/intl.h"
  38   #include "wx/thread.h"
  39 #endif
  40
  41 #include <ctype.h>
  42 #include <string.h>
  43 #include <stdlib.h>
  44
  45 #ifdef __SALFORDC__
  46   #include <clib.h>
  47 #endif
  48
  49 #if wxUSE_WCSRTOMBS
  50   #include <wchar.h>    // for wcsrtombs(), see comments where it's used
  51 #endif // GNU
  52
  53 #ifdef  WXSTRING_IS_WXOBJECT
  54   IMPLEMENT_DYNAMIC_CLASS(wxString, wxObject)
  55 #endif  //WXSTRING_IS_WXOBJECT
  56
  57 #if wxUSE_UNICODE
  58 #undef wxUSE_EXPERIMENTAL_PRINTF
  59 #define wxUSE_EXPERIMENTAL_PRINTF 1
  60 #endif
  61
  62 // allocating extra space for each string consumes more memory but speeds up
  63 // the concatenation operations (nLen is the current string's length)
  64 // NB: EXTRA_ALLOC must be >= 0!
  65 #define EXTRA_ALLOC       (19 - nLen % 16)
  66
  67 // ---------------------------------------------------------------------------
  68 // static class variables definition
  69 // ---------------------------------------------------------------------------
  70
  71 #ifdef  wxSTD_STRING_COMPATIBILITY
  72   const size_t wxString::npos = wxSTRING_MAXLEN;
  73 #endif // wxSTD_STRING_COMPATIBILITY
  74
  75 // ----------------------------------------------------------------------------
  76 // static data
  77 // ----------------------------------------------------------------------------
  78
  79 // for an empty string, GetStringData() will return this address: this
  80 // structure has the same layout as wxStringData and it's data() method will
  81 // return the empty string (dummy pointer)
  82 static const struct
  83 {
  84   wxStringData data;
  85   wxChar dummy;
  86 } g_strEmpty = { {-1, 0, 0}, wxT('\0') };
  87
  88 // empty C style string: points to 'string data' byte of g_strEmpty
  89 extern const wxChar WXDLLEXPORT *wxEmptyString = &g_strEmpty.dummy;
  90
  91 // ----------------------------------------------------------------------------
  92 // conditional compilation
  93 // ----------------------------------------------------------------------------
  94
  95 #if !defined(__WXSW__) && wxUSE_UNICODE
  96   #ifdef wxUSE_EXPERIMENTAL_PRINTF
  97     #undef wxUSE_EXPERIMENTAL_PRINTF
  98   #endif
  99   #define wxUSE_EXPERIMENTAL_PRINTF 1
 100 #endif
 101
 102 // we want to find out if the current platform supports vsnprintf()-like
 103 // function: for Unix this is done with configure, for Windows we test the
 104 // compiler explicitly.
 105 //
 106 // FIXME currently, this is only for ANSI (!Unicode) strings, so we call this
 107 //       function wxVsnprintfA (A for ANSI), should also find one for Unicode
 108 //       strings in Unicode build
 109 #ifdef __WXMSW__
 110     #if (defined(__VISUALC__) || defined(wxUSE_NORLANDER_HEADERS)) && !defined(__MINGW32__)
 111         #define wxVsnprintfA     _vsnprintf
 112     #endif
 113 #else   // !Windows
 114     #ifdef HAVE_VSNPRINTF
 115         #define wxVsnprintfA       vsnprintf
 116     #endif
 117 #endif  // Windows/!Windows
 118
 119 #ifndef wxVsnprintfA
 120     // in this case we'll use vsprintf() (which is ANSI and thus should be
 121     // always available), but it's unsafe because it doesn't check for buffer
 122     // size - so give a warning
 123     #define wxVsnprintfA(buf, len, format, arg) vsprintf(buf, format, arg)
 124
 125     #if defined(__VISUALC__)
 126         #pragma message("Using sprintf() because no snprintf()-like function defined")
 127     #elif defined(__GNUG__) && !defined(__UNIX__)
 128         #warning "Using sprintf() because no snprintf()-like function defined"
 129     #elif defined(__MWERKS__)
 130         #warning "Using sprintf() because no snprintf()-like function defined"
 131     #endif //compiler
 132 #endif // no vsnprintf
 133
 134 #ifdef _AIX
 135   // AIX has vsnprintf, but there's no prototype in the system headers.
 136   extern "C" int vsnprintf(char* str, size_t n, const char* format, va_list ap);
 137 #endif
 138
 139 // ----------------------------------------------------------------------------
 140 // global functions
 141 // ----------------------------------------------------------------------------
 142
 143 #if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM
 144
 145 // MS Visual C++ version 5.0 provides the new STL headers as well as the old
 146 // iostream ones.
 147 //
 148 // ATTN: you can _not_ use both of these in the same program!
 149
 150 istream& operator>>(istream& is, wxString& WXUNUSED(str))
 151 {
 152 #if 0
 153   int w = is.width(0);
 154   if ( is.ipfx(0) ) {
 155     streambuf *sb = is.rdbuf();
 156     str.erase();
 157     while ( true ) {
 158       int ch = sb->sbumpc ();
 159       if ( ch == EOF ) {
 160         is.setstate(ios::eofbit);
 161         break;
 162       }
 163       else if ( isspace(ch) ) {
 164         sb->sungetc();
 165         break;
 166       }
 167
 168       str += ch;
 169       if ( --w == 1 )
 170         break;
 171     }
 172   }
 173
 174   is.isfx();
 175   if ( str.length() == 0 )
 176     is.setstate(ios::failbit);
 177 #endif
 178   return is;
 179 }
 180
 181 ostream& operator<<(ostream& os, const wxString& str)
 182 {
 183   os << str.c_str();
 184   return os;
 185 }
 186
 187 #endif  //std::string compatibility
 188
 189 extern int WXDLLEXPORT wxVsnprintf(wxChar *buf, size_t len,
 190                                    const wxChar *format, va_list argptr)
 191 {
 192 #if wxUSE_UNICODE
 193     // FIXME should use wvsnprintf() or whatever if it's available
 194     wxString s;
 195     int iLen = s.PrintfV(format, argptr);
 196     if ( iLen != -1 )
 197     {
 198         wxStrncpy(buf, s.c_str(), iLen);
 199     }
 200
 201     return iLen;
 202 #else // ANSI
 203     // vsnprintf() will not terminate the string with '\0' if there is not
 204     // enough place, but we want the string to always be NUL terminated
 205     int rc = wxVsnprintfA(buf, len - 1, format, argptr);
 206     if ( rc == -1 )
 207     {
 208         buf[len] = 0;
 209     }
 210
 211     return rc;
 212 #endif // Unicode/ANSI
 213 }
 214
 215 extern int WXDLLEXPORT wxSnprintf(wxChar *buf, size_t len,
 216                                   const wxChar *format, ...)
 217 {
 218     va_list argptr;
 219     va_start(argptr, format);
 220
 221     int iLen = wxVsnprintf(buf, len, format, argptr);
 222
 223     va_end(argptr);
 224
 225     return iLen;
 226 }
 227
 228 // ----------------------------------------------------------------------------
 229 // private classes
 230 // ----------------------------------------------------------------------------
 231
 232 // this small class is used to gather statistics for performance tuning
 233 //#define WXSTRING_STATISTICS
 234 #ifdef  WXSTRING_STATISTICS
 235   class Averager
 236   {
 237   public:
 238     Averager(const char *sz) { m_sz = sz; m_nTotal = m_nCount = 0; }
 239    ~Averager()
 240    { printf("wxString: average %s = %f\n", m_sz, ((float)m_nTotal)/m_nCount); }
 241
 242     void Add(size_t n) { m_nTotal += n; m_nCount++; }
 243
 244   private:
 245     size_t m_nCount, m_nTotal;
 246     const char *m_sz;
 247   } g_averageLength("allocation size"),
 248     g_averageSummandLength("summand length"),
 249     g_averageConcatHit("hit probability in concat"),
 250     g_averageInitialLength("initial string length");
 251
 252   #define STATISTICS_ADD(av, val) g_average##av.Add(val)
 253 #else
 254   #define STATISTICS_ADD(av, val)
 255 #endif // WXSTRING_STATISTICS
 256
 257 // ===========================================================================
 258 // wxString class core
 259 // ===========================================================================
 260
 261 // ---------------------------------------------------------------------------
 262 // construction
 263 // ---------------------------------------------------------------------------
 264
 265 // constructs string of <nLength> copies of character <ch>
 266 wxString::wxString(wxChar ch, size_t nLength)
 267 {
 268   Init();
 269
 270   if ( nLength > 0 ) {
 271     AllocBuffer(nLength);
 272
 273 #if wxUSE_UNICODE
 274     // memset only works on char
 275     for (size_t n=0; n<nLength; n++) m_pchData[n] = ch;
 276 #else
 277     memset(m_pchData, ch, nLength);
 278 #endif
 279   }
 280 }
 281
 282 // takes nLength elements of psz starting at nPos
 283 void wxString::InitWith(const wxChar *psz, size_t nPos, size_t nLength)
 284 {
 285   Init();
 286
 287   wxASSERT( nPos <= wxStrlen(psz) );
 288
 289   if ( nLength == wxSTRING_MAXLEN )
 290     nLength = wxStrlen(psz + nPos);
 291
 292   STATISTICS_ADD(InitialLength, nLength);
 293
 294   if ( nLength > 0 ) {
 295     // trailing '\0' is written in AllocBuffer()
 296     AllocBuffer(nLength);
 297     memcpy(m_pchData, psz + nPos, nLength*sizeof(wxChar));
 298   }
 299 }
 300
 301 #ifdef  wxSTD_STRING_COMPATIBILITY
 302
 303 // poor man's iterators are "void *" pointers
 304 wxString::wxString(const void *pStart, const void *pEnd)
 305 {
 306   InitWith((const wxChar *)pStart, 0,
 307            (const wxChar *)pEnd - (const wxChar *)pStart);
 308 }
 309
 310 #endif  //std::string compatibility
 311
 312 #if wxUSE_UNICODE
 313
 314 // from multibyte string
 315 wxString::wxString(const char *psz, wxMBConv& conv, size_t nLength)
 316 {
 317   // first get necessary size
 318   size_t nLen = psz ? conv.MB2WC((wchar_t *) NULL, psz, 0) : 0;
 319
 320   // nLength is number of *Unicode* characters here!
 321   if ((nLen != (size_t)-1) && (nLen > nLength))
 322     nLen = nLength;
 323
 324   // empty?
 325   if ( (nLen != 0) && (nLen != (size_t)-1) ) {
 326     AllocBuffer(nLen);
 327     conv.MB2WC(m_pchData, psz, nLen);
 328   }
 329   else {
 330     Init();
 331   }
 332 }
 333
 334 #else // ANSI
 335
 336 #if wxUSE_WCHAR_T
 337 // from wide string
 338 wxString::wxString(const wchar_t *pwz)
 339 {
 340   // first get necessary size
 341   size_t nLen = pwz ? wxWC2MB((char *) NULL, pwz, 0) : 0;
 342
 343   // empty?
 344   if ( (nLen != 0) && (nLen != (size_t)-1) ) {
 345     AllocBuffer(nLen);
 346     wxWC2MB(m_pchData, pwz, nLen);
 347   }
 348   else {
 349     Init();
 350   }
 351 }
 352 #endif // wxUSE_WCHAR_T
 353
 354 #endif // Unicode/ANSI
 355
 356 // ---------------------------------------------------------------------------
 357 // memory allocation
 358 // ---------------------------------------------------------------------------
 359
 360 // allocates memory needed to store a C string of length nLen
 361 void wxString::AllocBuffer(size_t nLen)
 362 {
 363   // allocating 0 sized buffer doesn't make sense, all empty strings should
 364   // reuse g_strEmpty
 365   wxASSERT( nLen >  0 );
 366
 367   // make sure that we don't overflow
 368   wxASSERT( nLen < (INT_MAX / sizeof(wxChar)) -
 369                    (sizeof(wxStringData) + EXTRA_ALLOC + 1) );
 370
 371   STATISTICS_ADD(Length, nLen);
 372
 373   // allocate memory:
 374   // 1) one extra character for '\0' termination
 375   // 2) sizeof(wxStringData) for housekeeping info
 376   wxStringData* pData = (wxStringData*)
 377     malloc(sizeof(wxStringData) + (nLen + EXTRA_ALLOC + 1)*sizeof(wxChar));
 378   pData->nRefs        = 1;
 379   pData->nDataLength  = nLen;
 380   pData->nAllocLength = nLen + EXTRA_ALLOC;
 381   m_pchData           = pData->data();  // data starts after wxStringData
 382   m_pchData[nLen]     = wxT('\0');
 383 }
 384
 385 // must be called before changing this string
 386 void wxString::CopyBeforeWrite()
 387 {
 388   wxStringData* pData = GetStringData();
 389
 390   if ( pData->IsShared() ) {
 391     pData->Unlock();                // memory not freed because shared
 392     size_t nLen = pData->nDataLength;
 393     AllocBuffer(nLen);
 394     memcpy(m_pchData, pData->data(), nLen*sizeof(wxChar));
 395   }
 396
 397   wxASSERT( !GetStringData()->IsShared() );  // we must be the only owner
 398 }
 399
 400 // must be called before replacing contents of this string
 401 void wxString::AllocBeforeWrite(size_t nLen)
 402 {
 403   wxASSERT( nLen != 0 );  // doesn't make any sense
 404
 405   // must not share string and must have enough space
 406   wxStringData* pData = GetStringData();
 407   if ( pData->IsShared() || pData->IsEmpty() ) {
 408     // can't work with old buffer, get new one
 409     pData->Unlock();
 410     AllocBuffer(nLen);
 411   }
 412   else {
 413     if ( nLen > pData->nAllocLength ) {
 414       // realloc the buffer instead of calling malloc() again, this is more
 415       // efficient
 416       STATISTICS_ADD(Length, nLen);
 417
 418       nLen += EXTRA_ALLOC;
 419
 420       wxStringData *pDataOld = pData;
 421       pData = (wxStringData*)
 422           realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 423       if ( !pData ) {
 424         // out of memory
 425         free(pDataOld);
 426
 427         // FIXME we're going to crash...
 428         return;
 429       }
 430
 431       pData->nAllocLength = nLen;
 432       m_pchData = pData->data();
 433     }
 434
 435     // now we have enough space, just update the string length
 436     pData->nDataLength = nLen;
 437   }
 438
 439   wxASSERT( !GetStringData()->IsShared() );  // we must be the only owner
 440 }
 441
 442 // allocate enough memory for nLen characters
 443 void wxString::Alloc(size_t nLen)
 444 {
 445   wxStringData *pData = GetStringData();
 446   if ( pData->nAllocLength <= nLen ) {
 447     if ( pData->IsEmpty() ) {
 448       nLen += EXTRA_ALLOC;
 449
 450       wxStringData* pData = (wxStringData*)
 451         malloc(sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 452       pData->nRefs = 1;
 453       pData->nDataLength = 0;
 454       pData->nAllocLength = nLen;
 455       m_pchData = pData->data();  // data starts after wxStringData
 456       m_pchData[0u] = wxT('\0');
 457     }
 458     else if ( pData->IsShared() ) {
 459       pData->Unlock();                // memory not freed because shared
 460       size_t nOldLen = pData->nDataLength;
 461       AllocBuffer(nLen);
 462       memcpy(m_pchData, pData->data(), nOldLen*sizeof(wxChar));
 463     }
 464     else {
 465       nLen += EXTRA_ALLOC;
 466
 467       wxStringData *pDataOld = pData;
 468       wxStringData *p = (wxStringData *)
 469         realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 470
 471       if ( p == NULL ) {
 472         // don't leak memory
 473         free(pDataOld);
 474
 475         // FIXME what to do on memory error?
 476         return;
 477       }
 478
 479       // it's not important if the pointer changed or not (the check for this
 480       // is not faster than assigning to m_pchData in all cases)
 481       p->nAllocLength = nLen;
 482       m_pchData = p->data();
 483     }
 484   }
 485   //else: we've already got enough
 486 }
 487
 488 // shrink to minimal size (releasing extra memory)
 489 void wxString::Shrink()
 490 {
 491   wxStringData *pData = GetStringData();
 492
 493   // this variable is unused in release build, so avoid the compiler warning
 494   // by just not declaring it
 495 #ifdef __WXDEBUG__
 496   void *p =
 497 #endif
 498   realloc(pData, sizeof(wxStringData) + (pData->nDataLength + 1)*sizeof(wxChar));
 499
 500   // we rely on a reasonable realloc() implementation here - so far I haven't
 501   // seen any which wouldn't behave like this
 502
 503   wxASSERT( p != NULL );  // can't free memory?
 504   wxASSERT( p == pData ); // we're decrementing the size - block shouldn't move!
 505 }
 506
 507 // get the pointer to writable buffer of (at least) nLen bytes
 508 wxChar *wxString::GetWriteBuf(size_t nLen)
 509 {
 510   AllocBeforeWrite(nLen);
 511
 512   wxASSERT( GetStringData()->nRefs == 1 );
 513   GetStringData()->Validate(FALSE);
 514
 515   return m_pchData;
 516 }
 517
 518 // put string back in a reasonable state after GetWriteBuf
 519 void wxString::UngetWriteBuf()
 520 {
 521   GetStringData()->nDataLength = wxStrlen(m_pchData);
 522   GetStringData()->Validate(TRUE);
 523 }
 524
 525 // ---------------------------------------------------------------------------
 526 // data access
 527 // ---------------------------------------------------------------------------
 528
 529 // all functions are inline in string.h
 530
 531 // ---------------------------------------------------------------------------
 532 // assignment operators
 533 // ---------------------------------------------------------------------------
 534
 535 // helper function: does real copy
 536 void wxString::AssignCopy(size_t nSrcLen, const wxChar *pszSrcData)
 537 {
 538   if ( nSrcLen == 0 ) {
 539     Reinit();
 540   }
 541   else {
 542     AllocBeforeWrite(nSrcLen);
 543     memcpy(m_pchData, pszSrcData, nSrcLen*sizeof(wxChar));
 544     GetStringData()->nDataLength = nSrcLen;
 545     m_pchData[nSrcLen] = wxT('\0');
 546   }
 547 }
 548
 549 // assigns one string to another
 550 wxString& wxString::operator=(const wxString& stringSrc)
 551 {
 552   wxASSERT( stringSrc.GetStringData()->IsValid() );
 553
 554   // don't copy string over itself
 555   if ( m_pchData != stringSrc.m_pchData ) {
 556     if ( stringSrc.GetStringData()->IsEmpty() ) {
 557       Reinit();
 558     }
 559     else {
 560       // adjust references
 561       GetStringData()->Unlock();
 562       m_pchData = stringSrc.m_pchData;
 563       GetStringData()->Lock();
 564     }
 565   }
 566
 567   return *this;
 568 }
 569
 570 // assigns a single character
 571 wxString& wxString::operator=(wxChar ch)
 572 {
 573   AssignCopy(1, &ch);
 574   return *this;
 575 }
 576
 577 // assigns C string
 578 wxString& wxString::operator=(const wxChar *psz)
 579 {
 580   AssignCopy(wxStrlen(psz), psz);
 581   return *this;
 582 }
 583
 584 #if !wxUSE_UNICODE
 585
 586 // same as 'signed char' variant
 587 wxString& wxString::operator=(const unsigned char* psz)
 588 {
 589   *this = (const char *)psz;
 590   return *this;
 591 }
 592
 593 #if wxUSE_WCHAR_T
 594 wxString& wxString::operator=(const wchar_t *pwz)
 595 {
 596   wxString str(pwz);
 597   *this = str;
 598   return *this;
 599 }
 600 #endif
 601
 602 #endif
 603
 604 // ---------------------------------------------------------------------------
 605 // string concatenation
 606 // ---------------------------------------------------------------------------
 607
 608 // add something to this string
 609 void wxString::ConcatSelf(int nSrcLen, const wxChar *pszSrcData)
 610 {
 611   STATISTICS_ADD(SummandLength, nSrcLen);
 612
 613   // concatenating an empty string is a NOP
 614   if ( nSrcLen > 0 ) {
 615     wxStringData *pData = GetStringData();
 616     size_t nLen = pData->nDataLength;
 617     size_t nNewLen = nLen + nSrcLen;
 618
 619     // alloc new buffer if current is too small
 620     if ( pData->IsShared() ) {
 621       STATISTICS_ADD(ConcatHit, 0);
 622
 623       // we have to allocate another buffer
 624       wxStringData* pOldData = GetStringData();
 625       AllocBuffer(nNewLen);
 626       memcpy(m_pchData, pOldData->data(), nLen*sizeof(wxChar));
 627       pOldData->Unlock();
 628     }
 629     else if ( nNewLen > pData->nAllocLength ) {
 630       STATISTICS_ADD(ConcatHit, 0);
 631
 632       // we have to grow the buffer
 633       Alloc(nNewLen);
 634     }
 635     else {
 636       STATISTICS_ADD(ConcatHit, 1);
 637
 638       // the buffer is already big enough
 639     }
 640
 641     // should be enough space
 642     wxASSERT( nNewLen <= GetStringData()->nAllocLength );
 643
 644     // fast concatenation - all is done in our buffer
 645     memcpy(m_pchData + nLen, pszSrcData, nSrcLen*sizeof(wxChar));
 646
 647     m_pchData[nNewLen] = wxT('\0');          // put terminating '\0'
 648     GetStringData()->nDataLength = nNewLen; // and fix the length
 649   }
 650   //else: the string to append was empty
 651 }
 652
 653 /*
 654  * concatenation functions come in 5 flavours:
 655  *  string + string
 656  *  char   + string      and      string + char
 657  *  C str  + string      and      string + C str
 658  */
 659
 660 wxString operator+(const wxString& string1, const wxString& string2)
 661 {
 662   wxASSERT( string1.GetStringData()->IsValid() );
 663   wxASSERT( string2.GetStringData()->IsValid() );
 664
 665   wxString s = string1;
 666   s += string2;
 667
 668   return s;
 669 }
 670
 671 wxString operator+(const wxString& string, wxChar ch)
 672 {
 673   wxASSERT( string.GetStringData()->IsValid() );
 674
 675   wxString s = string;
 676   s += ch;
 677
 678   return s;
 679 }
 680
 681 wxString operator+(wxChar ch, const wxString& string)
 682 {
 683   wxASSERT( string.GetStringData()->IsValid() );
 684
 685   wxString s = ch;
 686   s += string;
 687
 688   return s;
 689 }
 690
 691 wxString operator+(const wxString& string, const wxChar *psz)
 692 {
 693   wxASSERT( string.GetStringData()->IsValid() );
 694
 695   wxString s;
 696   s.Alloc(wxStrlen(psz) + string.Len());
 697   s = string;
 698   s += psz;
 699
 700   return s;
 701 }
 702
 703 wxString operator+(const wxChar *psz, const wxString& string)
 704 {
 705   wxASSERT( string.GetStringData()->IsValid() );
 706
 707   wxString s;
 708   s.Alloc(wxStrlen(psz) + string.Len());
 709   s = psz;
 710   s += string;
 711
 712   return s;
 713 }
 714
 715 // ===========================================================================
 716 // other common string functions
 717 // ===========================================================================
 718
 719 // ---------------------------------------------------------------------------
 720 // simple sub-string extraction
 721 // ---------------------------------------------------------------------------
 722
 723 // helper function: clone the data attached to this string
 724 void wxString::AllocCopy(wxString& dest, int nCopyLen, int nCopyIndex) const
 725 {
 726   if ( nCopyLen == 0 ) {
 727     dest.Init();
 728   }
 729   else {
 730     dest.AllocBuffer(nCopyLen);
 731     memcpy(dest.m_pchData, m_pchData + nCopyIndex, nCopyLen*sizeof(wxChar));
 732   }
 733 }
 734
 735 // extract string of length nCount starting at nFirst
 736 wxString wxString::Mid(size_t nFirst, size_t nCount) const
 737 {
 738   wxStringData *pData = GetStringData();
 739   size_t nLen = pData->nDataLength;
 740
 741   // default value of nCount is wxSTRING_MAXLEN and means "till the end"
 742   if ( nCount == wxSTRING_MAXLEN )
 743   {
 744     nCount = nLen - nFirst;
 745   }
 746
 747   // out-of-bounds requests return sensible things
 748   if ( nFirst + nCount > nLen )
 749   {
 750     nCount = nLen - nFirst;
 751   }
 752
 753   if ( nFirst > nLen )
 754   {
 755     // AllocCopy() will return empty string
 756     nCount = 0;
 757   }
 758
 759   wxString dest;
 760   AllocCopy(dest, nCount, nFirst);
 761
 762   return dest;
 763 }
 764
 765 // extract nCount last (rightmost) characters
 766 wxString wxString::Right(size_t nCount) const
 767 {
 768   if ( nCount > (size_t)GetStringData()->nDataLength )
 769     nCount = GetStringData()->nDataLength;
 770
 771   wxString dest;
 772   AllocCopy(dest, nCount, GetStringData()->nDataLength - nCount);
 773   return dest;
 774 }
 775
 776 // get all characters after the last occurence of ch
 777 // (returns the whole string if ch not found)
 778 wxString wxString::AfterLast(wxChar ch) const
 779 {
 780   wxString str;
 781   int iPos = Find(ch, TRUE);
 782   if ( iPos == wxNOT_FOUND )
 783     str = *this;
 784   else
 785     str = c_str() + iPos + 1;
 786
 787   return str;
 788 }
 789
 790 // extract nCount first (leftmost) characters
 791 wxString wxString::Left(size_t nCount) const
 792 {
 793   if ( nCount > (size_t)GetStringData()->nDataLength )
 794     nCount = GetStringData()->nDataLength;
 795
 796   wxString dest;
 797   AllocCopy(dest, nCount, 0);
 798   return dest;
 799 }
 800
 801 // get all characters before the first occurence of ch
 802 // (returns the whole string if ch not found)
 803 wxString wxString::BeforeFirst(wxChar ch) const
 804 {
 805   wxString str;
 806   for ( const wxChar *pc = m_pchData; *pc != wxT('\0') && *pc != ch; pc++ )
 807     str += *pc;
 808
 809   return str;
 810 }
 811
 812 /// get all characters before the last occurence of ch
 813 /// (returns empty string if ch not found)
 814 wxString wxString::BeforeLast(wxChar ch) const
 815 {
 816   wxString str;
 817   int iPos = Find(ch, TRUE);
 818   if ( iPos != wxNOT_FOUND && iPos != 0 )
 819     str = wxString(c_str(), iPos);
 820
 821   return str;
 822 }
 823
 824 /// get all characters after the first occurence of ch
 825 /// (returns empty string if ch not found)
 826 wxString wxString::AfterFirst(wxChar ch) const
 827 {
 828   wxString str;
 829   int iPos = Find(ch);
 830   if ( iPos != wxNOT_FOUND )
 831     str = c_str() + iPos + 1;
 832
 833   return str;
 834 }
 835
 836 // replace first (or all) occurences of some substring with another one
 837 size_t wxString::Replace(const wxChar *szOld, const wxChar *szNew, bool bReplaceAll)
 838 {
 839   size_t uiCount = 0;   // count of replacements made
 840
 841   size_t uiOldLen = wxStrlen(szOld);
 842
 843   wxString strTemp;
 844   const wxChar *pCurrent = m_pchData;
 845   const wxChar *pSubstr;
 846   while ( *pCurrent != wxT('\0') ) {
 847     pSubstr = wxStrstr(pCurrent, szOld);
 848     if ( pSubstr == NULL ) {
 849       // strTemp is unused if no replacements were made, so avoid the copy
 850       if ( uiCount == 0 )
 851         return 0;
 852
 853       strTemp += pCurrent;    // copy the rest
 854       break;                  // exit the loop
 855     }
 856     else {
 857       // take chars before match
 858       strTemp.ConcatSelf(pSubstr - pCurrent, pCurrent);
 859       strTemp += szNew;
 860       pCurrent = pSubstr + uiOldLen;  // restart after match
 861
 862       uiCount++;
 863
 864       // stop now?
 865       if ( !bReplaceAll ) {
 866         strTemp += pCurrent;    // copy the rest
 867         break;                  // exit the loop
 868       }
 869     }
 870   }
 871
 872   // only done if there were replacements, otherwise would have returned above
 873   *this = strTemp;
 874
 875   return uiCount;
 876 }
 877
 878 bool wxString::IsAscii() const
 879 {
 880   const wxChar *s = (const wxChar*) *this;
 881   while(*s){
 882     if(!isascii(*s)) return(FALSE);
 883     s++;
 884   }
 885   return(TRUE);
 886 }
 887
 888 bool wxString::IsWord() const
 889 {
 890   const wxChar *s = (const wxChar*) *this;
 891   while(*s){
 892     if(!wxIsalpha(*s)) return(FALSE);
 893     s++;
 894   }
 895   return(TRUE);
 896 }
 897
 898 bool wxString::IsNumber() const
 899 {
 900   const wxChar *s = (const wxChar*) *this;
 901   while(*s){
 902     if(!wxIsdigit(*s)) return(FALSE);
 903     s++;
 904   }
 905   return(TRUE);
 906 }
 907
 908 wxString wxString::Strip(stripType w) const
 909 {
 910     wxString s = *this;
 911     if ( w & leading ) s.Trim(FALSE);
 912     if ( w & trailing ) s.Trim(TRUE);
 913     return s;
 914 }
 915
 916 // ---------------------------------------------------------------------------
 917 // case conversion
 918 // ---------------------------------------------------------------------------
 919
 920 wxString& wxString::MakeUpper()
 921 {
 922   CopyBeforeWrite();
 923
 924   for ( wxChar *p = m_pchData; *p; p++ )
 925     *p = (wxChar)wxToupper(*p);
 926
 927   return *this;
 928 }
 929
 930 wxString& wxString::MakeLower()
 931 {
 932   CopyBeforeWrite();
 933
 934   for ( wxChar *p = m_pchData; *p; p++ )
 935     *p = (wxChar)wxTolower(*p);
 936
 937   return *this;
 938 }
 939
 940 // ---------------------------------------------------------------------------
 941 // trimming and padding
 942 // ---------------------------------------------------------------------------
 943
 944 // trims spaces (in the sense of isspace) from left or right side
 945 wxString& wxString::Trim(bool bFromRight)
 946 {
 947   // first check if we're going to modify the string at all
 948   if ( !IsEmpty() &&
 949        (
 950         (bFromRight && wxIsspace(GetChar(Len() - 1))) ||
 951         (!bFromRight && wxIsspace(GetChar(0u)))
 952        )
 953      )
 954   {
 955     // ok, there is at least one space to trim
 956     CopyBeforeWrite();
 957
 958     if ( bFromRight )
 959     {
 960       // find last non-space character
 961       wxChar *psz = m_pchData + GetStringData()->nDataLength - 1;
 962       while ( wxIsspace(*psz) && (psz >= m_pchData) )
 963         psz--;
 964
 965       // truncate at trailing space start
 966       *++psz = wxT('\0');
 967       GetStringData()->nDataLength = psz - m_pchData;
 968     }
 969     else
 970     {
 971       // find first non-space character
 972       const wxChar *psz = m_pchData;
 973       while ( wxIsspace(*psz) )
 974         psz++;
 975
 976       // fix up data and length
 977       int nDataLength = GetStringData()->nDataLength - (psz - (const wxChar*) m_pchData);
 978       memmove(m_pchData, psz, (nDataLength + 1)*sizeof(wxChar));
 979       GetStringData()->nDataLength = nDataLength;
 980     }
 981   }
 982
 983   return *this;
 984 }
 985
 986 // adds nCount characters chPad to the string from either side
 987 wxString& wxString::Pad(size_t nCount, wxChar chPad, bool bFromRight)
 988 {
 989   wxString s(chPad, nCount);
 990
 991   if ( bFromRight )
 992     *this += s;
 993   else
 994   {
 995     s += *this;
 996     *this = s;
 997   }
 998
 999   return *this;
1000 }
1001
1002 // truncate the string
1003 wxString& wxString::Truncate(size_t uiLen)
1004 {
1005   if ( uiLen < Len() ) {
1006     CopyBeforeWrite();
1007
1008     *(m_pchData + uiLen) = wxT('\0');
1009     GetStringData()->nDataLength = uiLen;
1010   }
1011   //else: nothing to do, string is already short enough
1012
1013   return *this;
1014 }
1015
1016 // ---------------------------------------------------------------------------
1017 // finding (return wxNOT_FOUND if not found and index otherwise)
1018 // ---------------------------------------------------------------------------
1019
1020 // find a character
1021 int wxString::Find(wxChar ch, bool bFromEnd) const
1022 {
1023   const wxChar *psz = bFromEnd ? wxStrrchr(m_pchData, ch) : wxStrchr(m_pchData, ch);
1024
1025   return (psz == NULL) ? wxNOT_FOUND : psz - (const wxChar*) m_pchData;
1026 }
1027
1028 // find a sub-string (like strstr)
1029 int wxString::Find(const wxChar *pszSub) const
1030 {
1031   const wxChar *psz = wxStrstr(m_pchData, pszSub);
1032
1033   return (psz == NULL) ? wxNOT_FOUND : psz - (const wxChar*) m_pchData;
1034 }
1035
1036 // ----------------------------------------------------------------------------
1037 // conversion to numbers
1038 // ----------------------------------------------------------------------------
1039
1040 bool wxString::ToLong(long *val) const
1041 {
1042     wxCHECK_MSG( val, FALSE, _T("NULL pointer in wxString::ToLong") );
1043
1044     const wxChar *start = c_str();
1045     wxChar *end;
1046     *val = wxStrtol(start, &end, 10);
1047
1048     // return TRUE only if scan was stopped by the terminating NUL and if the
1049     // string was not empty to start with
1050     return !*end && (end != start);
1051 }
1052
1053 bool wxString::ToULong(unsigned long *val) const
1054 {
1055     wxCHECK_MSG( val, FALSE, _T("NULL pointer in wxString::ToULong") );
1056
1057     const wxChar *start = c_str();
1058     wxChar *end;
1059     *val = wxStrtoul(start, &end, 10);
1060
1061     // return TRUE only if scan was stopped by the terminating NUL and if the
1062     // string was not empty to start with
1063     return !*end && (end != start);
1064 }
1065
1066 bool wxString::ToDouble(double *val) const
1067 {
1068     wxCHECK_MSG( val, FALSE, _T("NULL pointer in wxString::ToDouble") );
1069
1070     const wxChar *start = c_str();
1071     wxChar *end;
1072     *val = wxStrtod(start, &end);
1073
1074     // return TRUE only if scan was stopped by the terminating NUL and if the
1075     // string was not empty to start with
1076     return !*end && (end != start);
1077 }
1078
1079 // ---------------------------------------------------------------------------
1080 // stream-like operators
1081 // ---------------------------------------------------------------------------
1082 wxString& wxString::operator<<(int i)
1083 {
1084     wxString res;
1085     res.Printf(wxT("%d"), i);
1086
1087     return (*this) << res;
1088 }
1089
1090 wxString& wxString::operator<<(float f)
1091 {
1092     wxString res;
1093     res.Printf(wxT("%f"), f);
1094
1095     return (*this) << res;
1096 }
1097
1098 wxString& wxString::operator<<(double d)
1099 {
1100     wxString res;
1101     res.Printf(wxT("%g"), d);
1102
1103     return (*this) << res;
1104 }
1105
1106 // ---------------------------------------------------------------------------
1107 // formatted output
1108 // ---------------------------------------------------------------------------
1109
1110 /* static */
1111 wxString wxString::Format(const wxChar *pszFormat, ...)
1112 {
1113     va_list argptr;
1114     va_start(argptr, pszFormat);
1115
1116     wxString s;
1117     s.PrintfV(pszFormat, argptr);
1118
1119     va_end(argptr);
1120
1121     return s;
1122 }
1123
1124 /* static */
1125 wxString wxString::FormatV(const wxChar *pszFormat, va_list argptr)
1126 {
1127     wxString s;
1128     s.Printf(pszFormat, argptr);
1129     return s;
1130 }
1131
1132 int wxString::Printf(const wxChar *pszFormat, ...)
1133 {
1134   va_list argptr;
1135   va_start(argptr, pszFormat);
1136
1137   int iLen = PrintfV(pszFormat, argptr);
1138
1139   va_end(argptr);
1140
1141   return iLen;
1142 }
1143
1144 int wxString::PrintfV(const wxChar* pszFormat, va_list argptr)
1145 {
1146 #if wxUSE_EXPERIMENTAL_PRINTF
1147   // the new implementation
1148
1149   // buffer to avoid dynamic memory allocation each time for small strings
1150   char szScratch[1024];
1151
1152   Reinit();
1153   for (size_t n = 0; pszFormat[n]; n++)
1154     if (pszFormat[n] == wxT('%')) {
1155       static char s_szFlags[256] = "%";
1156       size_t flagofs = 1;
1157       bool adj_left = FALSE, in_prec = FALSE,
1158            prec_dot = FALSE, done = FALSE;
1159       int ilen = 0;
1160       size_t min_width = 0, max_width = wxSTRING_MAXLEN;
1161       do {
1162 #define CHECK_PREC if (in_prec && !prec_dot) { s_szFlags[flagofs++] = '.'; prec_dot = TRUE; }
1163         switch (pszFormat[++n]) {
1164         case wxT('\0'):
1165           done = TRUE;
1166           break;
1167         case wxT('%'):
1168           *this += wxT('%');
1169           done = TRUE;
1170           break;
1171         case wxT('#'):
1172         case wxT('0'):
1173         case wxT(' '):
1174         case wxT('+'):
1175         case wxT('\''):
1176           CHECK_PREC
1177           s_szFlags[flagofs++] = pszFormat[n];
1178           break;
1179         case wxT('-'):
1180           CHECK_PREC
1181           adj_left = TRUE;
1182           s_szFlags[flagofs++] = pszFormat[n];
1183           break;
1184         case wxT('.'):
1185           CHECK_PREC
1186           in_prec = TRUE;
1187           prec_dot = FALSE;
1188           max_width = 0;
1189           // dot will be auto-added to s_szFlags if non-negative number follows
1190           break;
1191         case wxT('h'):
1192           ilen = -1;
1193           CHECK_PREC
1194           s_szFlags[flagofs++] = pszFormat[n];
1195           break;
1196         case wxT('l'):
1197           ilen = 1;
1198           CHECK_PREC
1199           s_szFlags[flagofs++] = pszFormat[n];
1200           break;
1201         case wxT('q'):
1202         case wxT('L'):
1203           ilen = 2;
1204           CHECK_PREC
1205           s_szFlags[flagofs++] = pszFormat[n];
1206           break;
1207         case wxT('Z'):
1208           ilen = 3;
1209           CHECK_PREC
1210           s_szFlags[flagofs++] = pszFormat[n];
1211           break;
1212         case wxT('*'):
1213           {
1214             int len = va_arg(argptr, int);
1215             if (in_prec) {
1216               if (len<0) break;
1217               CHECK_PREC
1218               max_width = len;
1219             } else {
1220               if (len<0) {
1221                 adj_left = !adj_left;
1222                 s_szFlags[flagofs++] = '-';
1223                 len = -len;
1224               }
1225               min_width = len;
1226             }
1227             flagofs += ::sprintf(s_szFlags+flagofs,"%d",len);
1228           }
1229           break;
1230         case wxT('1'): case wxT('2'): case wxT('3'):
1231         case wxT('4'): case wxT('5'): case wxT('6'):
1232         case wxT('7'): case wxT('8'): case wxT('9'):
1233           {
1234             int len = 0;
1235             CHECK_PREC
1236             while ((pszFormat[n]>=wxT('0')) && (pszFormat[n]<=wxT('9'))) {
1237               s_szFlags[flagofs++] = pszFormat[n];
1238               len = len*10 + (pszFormat[n] - wxT('0'));
1239               n++;
1240             }
1241             if (in_prec) max_width = len;
1242             else min_width = len;
1243             n--; // the main loop pre-increments n again
1244           }
1245           break;
1246         case wxT('d'):
1247         case wxT('i'):
1248         case wxT('o'):
1249         case wxT('u'):
1250         case wxT('x'):
1251         case wxT('X'):
1252           CHECK_PREC
1253           s_szFlags[flagofs++] = pszFormat[n];
1254           s_szFlags[flagofs] = '\0';
1255           if (ilen == 0 ) {
1256             int val = va_arg(argptr, int);
1257             ::sprintf(szScratch, s_szFlags, val);
1258           }
1259           else if (ilen == -1) {
1260             short int val = va_arg(argptr, short int);
1261             ::sprintf(szScratch, s_szFlags, val);
1262           }
1263           else if (ilen == 1) {
1264             long int val = va_arg(argptr, long int);
1265             ::sprintf(szScratch, s_szFlags, val);
1266           }
1267           else if (ilen == 2) {
1268 #if SIZEOF_LONG_LONG
1269             long long int val = va_arg(argptr, long long int);
1270             ::sprintf(szScratch, s_szFlags, val);
1271 #else
1272             long int val = va_arg(argptr, long int);
1273             ::sprintf(szScratch, s_szFlags, val);
1274 #endif
1275           }
1276           else if (ilen == 3) {
1277             size_t val = va_arg(argptr, size_t);
1278             ::sprintf(szScratch, s_szFlags, val);
1279           }
1280           *this += wxString(szScratch);
1281           done = TRUE;
1282           break;
1283         case wxT('e'):
1284         case wxT('E'):
1285         case wxT('f'):
1286         case wxT('g'):
1287         case wxT('G'):
1288           CHECK_PREC
1289           s_szFlags[flagofs++] = pszFormat[n];
1290           s_szFlags[flagofs] = '\0';
1291           if (ilen == 2) {
1292             long double val = va_arg(argptr, long double);
1293             ::sprintf(szScratch, s_szFlags, val);
1294           } else {
1295             double val = va_arg(argptr, double);
1296             ::sprintf(szScratch, s_szFlags, val);
1297           }
1298           *this += wxString(szScratch);
1299           done = TRUE;
1300           break;
1301         case wxT('p'):
1302           {
1303             void *val = va_arg(argptr, void *);
1304             CHECK_PREC
1305             s_szFlags[flagofs++] = pszFormat[n];
1306             s_szFlags[flagofs] = '\0';
1307             ::sprintf(szScratch, s_szFlags, val);
1308             *this += wxString(szScratch);
1309             done = TRUE;
1310           }
1311           break;
1312         case wxT('c'):
1313           {
1314             wxChar val = va_arg(argptr, int);
1315             // we don't need to honor padding here, do we?
1316             *this += val;
1317             done = TRUE;
1318           }
1319           break;
1320         case wxT('s'):
1321           if (ilen == -1) {
1322             // wx extension: we'll let %hs mean non-Unicode strings
1323             char *val = va_arg(argptr, char *);
1324 #if wxUSE_UNICODE
1325             // ASCII->Unicode constructor handles max_width right
1326             wxString s(val, wxConvLibc, max_width);
1327 #else
1328             size_t len = wxSTRING_MAXLEN;
1329             if (val) {
1330               for (len = 0; val[len] && (len<max_width); len++);
1331             } else val = wxT("(null)");
1332             wxString s(val, len);
1333 #endif
1334             if (s.Len() < min_width)
1335               s.Pad(min_width - s.Len(), wxT(' '), adj_left);
1336             *this += s;
1337           } else {
1338             wxChar *val = va_arg(argptr, wxChar *);
1339             size_t len = wxSTRING_MAXLEN;
1340             if (val) {
1341               for (len = 0; val[len] && (len<max_width); len++);
1342             } else val = wxT("(null)");
1343             wxString s(val, len);
1344             if (s.Len() < min_width)
1345               s.Pad(min_width - s.Len(), wxT(' '), adj_left);
1346             *this += s;
1347           }
1348           done = TRUE;
1349           break;
1350         case wxT('n'):
1351           if (ilen == 0) {
1352             int *val = va_arg(argptr, int *);
1353             *val = Len();
1354           }
1355           else if (ilen == -1) {
1356             short int *val = va_arg(argptr, short int *);
1357             *val = Len();
1358           }
1359           else if (ilen >= 1) {
1360             long int *val = va_arg(argptr, long int *);
1361             *val = Len();
1362           }
1363           done = TRUE;
1364           break;
1365         default:
1366           if (wxIsalpha(pszFormat[n]))
1367             // probably some flag not taken care of here yet
1368             s_szFlags[flagofs++] = pszFormat[n];
1369           else {
1370             // bad format
1371             *this += wxT('%'); // just to pass the glibc tst-printf.c
1372             n--;
1373             done = TRUE;
1374           }
1375           break;
1376         }
1377 #undef CHECK_PREC
1378       } while (!done);
1379     } else *this += pszFormat[n];
1380
1381 #else
1382   // buffer to avoid dynamic memory allocation each time for small strings
1383   char szScratch[1024];
1384
1385   // NB: wxVsnprintf() may return either less than the buffer size or -1 if
1386   //     there is not enough place depending on implementation
1387   int iLen = wxVsnprintfA(szScratch, WXSIZEOF(szScratch), pszFormat, argptr);
1388   if ( iLen != -1 ) {
1389     // the whole string is in szScratch
1390     *this = szScratch;
1391   }
1392   else {
1393       bool outOfMemory = FALSE;
1394       int size = 2*WXSIZEOF(szScratch);
1395       while ( !outOfMemory ) {
1396           char *buf = GetWriteBuf(size);
1397           if ( buf )
1398             iLen = wxVsnprintfA(buf, size, pszFormat, argptr);
1399           else
1400             outOfMemory = TRUE;
1401
1402           UngetWriteBuf();
1403
1404           if ( iLen != -1 ) {
1405               // ok, there was enough space
1406               break;
1407           }
1408
1409           // still not enough, double it again
1410           size *= 2;
1411       }
1412
1413       if ( outOfMemory ) {
1414           // out of memory
1415           return -1;
1416       }
1417   }
1418 #endif // wxUSE_EXPERIMENTAL_PRINTF/!wxUSE_EXPERIMENTAL_PRINTF
1419
1420   return Len();
1421 }
1422
1423 // ----------------------------------------------------------------------------
1424 // misc other operations
1425 // ----------------------------------------------------------------------------
1426
1427 // returns TRUE if the string matches the pattern which may contain '*' and
1428 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1429 // of them)
1430 bool wxString::Matches(const wxChar *pszMask) const
1431 {
1432   // check char by char
1433   const wxChar *pszTxt;
1434   for ( pszTxt = c_str(); *pszMask != wxT('\0'); pszMask++, pszTxt++ ) {
1435     switch ( *pszMask ) {
1436       case wxT('?'):
1437         if ( *pszTxt == wxT('\0') )
1438           return FALSE;
1439
1440         // pszText and pszMask will be incremented in the loop statement
1441
1442         break;
1443
1444       case wxT('*'):
1445         {
1446           // ignore special chars immediately following this one
1447           while ( *pszMask == wxT('*') || *pszMask == wxT('?') )
1448             pszMask++;
1449
1450           // if there is nothing more, match
1451           if ( *pszMask == wxT('\0') )
1452             return TRUE;
1453
1454           // are there any other metacharacters in the mask?
1455           size_t uiLenMask;
1456           const wxChar *pEndMask = wxStrpbrk(pszMask, wxT("*?"));
1457
1458           if ( pEndMask != NULL ) {
1459             // we have to match the string between two metachars
1460             uiLenMask = pEndMask - pszMask;
1461           }
1462           else {
1463             // we have to match the remainder of the string
1464             uiLenMask = wxStrlen(pszMask);
1465           }
1466
1467           wxString strToMatch(pszMask, uiLenMask);
1468           const wxChar* pMatch = wxStrstr(pszTxt, strToMatch);
1469           if ( pMatch == NULL )
1470             return FALSE;
1471
1472           // -1 to compensate "++" in the loop
1473           pszTxt = pMatch + uiLenMask - 1;
1474           pszMask += uiLenMask - 1;
1475         }
1476         break;
1477
1478       default:
1479         if ( *pszMask != *pszTxt )
1480           return FALSE;
1481         break;
1482     }
1483   }
1484
1485   // match only if nothing left
1486   return *pszTxt == wxT('\0');
1487 }
1488
1489 // Count the number of chars
1490 int wxString::Freq(wxChar ch) const
1491 {
1492     int count = 0;
1493     int len = Len();
1494     for (int i = 0; i < len; i++)
1495     {
1496         if (GetChar(i) == ch)
1497             count ++;
1498     }
1499     return count;
1500 }
1501
1502 // convert to upper case, return the copy of the string
1503 wxString wxString::Upper() const
1504 { wxString s(*this); return s.MakeUpper(); }
1505
1506 // convert to lower case, return the copy of the string
1507 wxString wxString::Lower() const { wxString s(*this); return s.MakeLower(); }
1508
1509 int wxString::sprintf(const wxChar *pszFormat, ...)
1510   {
1511     va_list argptr;
1512     va_start(argptr, pszFormat);
1513     int iLen = PrintfV(pszFormat, argptr);
1514     va_end(argptr);
1515     return iLen;
1516   }
1517
1518 // ---------------------------------------------------------------------------
1519 // standard C++ library string functions
1520 // ---------------------------------------------------------------------------
1521 #ifdef  wxSTD_STRING_COMPATIBILITY
1522
1523 wxString& wxString::insert(size_t nPos, const wxString& str)
1524 {
1525   wxASSERT( str.GetStringData()->IsValid() );
1526   wxASSERT( nPos <= Len() );
1527
1528   if ( !str.IsEmpty() ) {
1529     wxString strTmp;
1530     wxChar *pc = strTmp.GetWriteBuf(Len() + str.Len());
1531     wxStrncpy(pc, c_str(), nPos);
1532     wxStrcpy(pc + nPos, str);
1533     wxStrcpy(pc + nPos + str.Len(), c_str() + nPos);
1534     strTmp.UngetWriteBuf();
1535     *this = strTmp;
1536   }
1537
1538   return *this;
1539 }
1540
1541 size_t wxString::find(const wxString& str, size_t nStart) const
1542 {
1543   wxASSERT( str.GetStringData()->IsValid() );
1544   wxASSERT( nStart <= Len() );
1545
1546   const wxChar *p = wxStrstr(c_str() + nStart, str);
1547
1548   return p == NULL ? npos : p - c_str();
1549 }
1550
1551 // VC++ 1.5 can't cope with the default argument in the header.
1552 #if !defined(__VISUALC__) || defined(__WIN32__)
1553 size_t wxString::find(const wxChar* sz, size_t nStart, size_t n) const
1554 {
1555   return find(wxString(sz, n == npos ? 0 : n), nStart);
1556 }
1557 #endif // VC++ 1.5
1558
1559 // Gives a duplicate symbol (presumably a case-insensitivity problem)
1560 #if !defined(__BORLANDC__)
1561 size_t wxString::find(wxChar ch, size_t nStart) const
1562 {
1563   wxASSERT( nStart <= Len() );
1564
1565   const wxChar *p = wxStrchr(c_str() + nStart, ch);
1566
1567   return p == NULL ? npos : p - c_str();
1568 }
1569 #endif
1570
1571 size_t wxString::rfind(const wxString& str, size_t nStart) const
1572 {
1573   wxASSERT( str.GetStringData()->IsValid() );
1574   wxASSERT( nStart <= Len() );
1575
1576   // TODO could be made much quicker than that
1577   const wxChar *p = c_str() + (nStart == npos ? Len() : nStart);
1578   while ( p >= c_str() + str.Len() ) {
1579     if ( wxStrncmp(p - str.Len(), str, str.Len()) == 0 )
1580       return p - str.Len() - c_str();
1581     p--;
1582   }
1583
1584   return npos;
1585 }
1586
1587 // VC++ 1.5 can't cope with the default argument in the header.
1588 #if !defined(__VISUALC__) || defined(__WIN32__)
1589 size_t wxString::rfind(const wxChar* sz, size_t nStart, size_t n) const
1590 {
1591     return rfind(wxString(sz, n == npos ? 0 : n), nStart);
1592 }
1593
1594 size_t wxString::rfind(wxChar ch, size_t nStart) const
1595 {
1596     if ( nStart == npos )
1597     {
1598         nStart = Len();
1599     }
1600     else
1601     {
1602         wxASSERT( nStart <= Len() );
1603     }
1604
1605     const wxChar *p = wxStrrchr(c_str(), ch);
1606
1607     if ( p == NULL )
1608         return npos;
1609
1610     size_t result = p - c_str();
1611     return ( result > nStart ) ? npos : result;
1612 }
1613 #endif // VC++ 1.5
1614
1615 size_t wxString::find_first_of(const wxChar* sz, size_t nStart) const
1616 {
1617     const wxChar *start = c_str() + nStart;
1618     const wxChar *firstOf = wxStrpbrk(start, sz);
1619     if ( firstOf )
1620         return firstOf - start;
1621     else
1622         return npos;
1623 }
1624
1625 size_t wxString::find_last_of(const wxChar* sz, size_t nStart) const
1626 {
1627     if ( nStart == npos )
1628     {
1629         nStart = Len();
1630     }
1631     else
1632     {
1633         wxASSERT( nStart <= Len() );
1634     }
1635
1636     for ( const wxChar *p = c_str() + length() - 1; p >= c_str(); p-- )
1637     {
1638         if ( wxStrchr(sz, *p) )
1639             return p - c_str();
1640     }
1641
1642     return npos;
1643 }
1644
1645 size_t wxString::find_first_not_of(const wxChar* sz, size_t nStart) const
1646 {
1647     if ( nStart == npos )
1648     {
1649         nStart = Len();
1650     }
1651     else
1652     {
1653         wxASSERT( nStart <= Len() );
1654     }
1655
1656     size_t nAccept = wxStrspn(c_str() + nStart, sz);
1657     if ( nAccept >= length() - nStart )
1658         return npos;
1659     else
1660         return nAccept;
1661 }
1662
1663 size_t wxString::find_first_not_of(wxChar ch, size_t nStart) const
1664 {
1665     wxASSERT( nStart <= Len() );
1666
1667     for ( const wxChar *p = c_str() + nStart; *p; p++ )
1668     {
1669         if ( *p != ch )
1670             return p - c_str();
1671     }
1672
1673     return npos;
1674 }
1675
1676 size_t wxString::find_last_not_of(const wxChar* sz, size_t nStart) const
1677 {
1678     if ( nStart == npos )
1679     {
1680         nStart = Len();
1681     }
1682     else
1683     {
1684         wxASSERT( nStart <= Len() );
1685     }
1686
1687     for ( const wxChar *p = c_str() + nStart - 1; p >= c_str(); p-- )
1688     {
1689         if ( !wxStrchr(sz, *p) )
1690             return p - c_str();
1691     }
1692
1693     return npos;
1694 }
1695
1696 size_t wxString::find_last_not_of(wxChar ch, size_t nStart) const
1697 {
1698     if ( nStart == npos )
1699     {
1700         nStart = Len();
1701     }
1702     else
1703     {
1704         wxASSERT( nStart <= Len() );
1705     }
1706
1707     for ( const wxChar *p = c_str() + nStart - 1; p >= c_str(); p-- )
1708     {
1709         if ( *p != ch )
1710             return p - c_str();
1711     }
1712
1713     return npos;
1714 }
1715
1716 wxString& wxString::erase(size_t nStart, size_t nLen)
1717 {
1718   wxString strTmp(c_str(), nStart);
1719   if ( nLen != npos ) {
1720     wxASSERT( nStart + nLen <= Len() );
1721
1722     strTmp.append(c_str() + nStart + nLen);
1723   }
1724
1725   *this = strTmp;
1726   return *this;
1727 }
1728
1729 wxString& wxString::replace(size_t nStart, size_t nLen, const wxChar *sz)
1730 {
1731   wxASSERT( nStart + nLen <= wxStrlen(sz) );
1732
1733   wxString strTmp;
1734   if ( nStart != 0 )
1735     strTmp.append(c_str(), nStart);
1736   strTmp += sz;
1737   strTmp.append(c_str() + nStart + nLen);
1738
1739   *this = strTmp;
1740   return *this;
1741 }
1742
1743 wxString& wxString::replace(size_t nStart, size_t nLen, size_t nCount, wxChar ch)
1744 {
1745   return replace(nStart, nLen, wxString(ch, nCount));
1746 }
1747
1748 wxString& wxString::replace(size_t nStart, size_t nLen,
1749                             const wxString& str, size_t nStart2, size_t nLen2)
1750 {
1751   return replace(nStart, nLen, str.substr(nStart2, nLen2));
1752 }
1753
1754 wxString& wxString::replace(size_t nStart, size_t nLen,
1755                         const wxChar* sz, size_t nCount)
1756 {
1757   return replace(nStart, nLen, wxString(sz, nCount));
1758 }
1759
1760 #endif  //std::string compatibility
1761
1762 // ============================================================================
1763 // ArrayString
1764 // ============================================================================
1765
1766 // size increment = max(50% of current size, ARRAY_MAXSIZE_INCREMENT)
1767 #define   ARRAY_MAXSIZE_INCREMENT       4096
1768 #ifndef   ARRAY_DEFAULT_INITIAL_SIZE    // also defined in dynarray.h
1769   #define   ARRAY_DEFAULT_INITIAL_SIZE    (16)
1770 #endif
1771
1772 #define   STRING(p)   ((wxString *)(&(p)))
1773
1774 // ctor
1775 wxArrayString::wxArrayString(bool autoSort)
1776 {
1777   m_nSize  =
1778   m_nCount = 0;
1779   m_pItems = (wxChar **) NULL;
1780   m_autoSort = autoSort;
1781 }
1782
1783 // copy ctor
1784 wxArrayString::wxArrayString(const wxArrayString& src)
1785 {
1786   m_nSize  =
1787   m_nCount = 0;
1788   m_pItems = (wxChar **) NULL;
1789   m_autoSort = src.m_autoSort;
1790
1791   *this = src;
1792 }
1793
1794 // assignment operator
1795 wxArrayString& wxArrayString::operator=(const wxArrayString& src)
1796 {
1797   if ( m_nSize > 0 )
1798     Clear();
1799
1800   Copy(src);
1801
1802   return *this;
1803 }
1804
1805 void wxArrayString::Copy(const wxArrayString& src)
1806 {
1807   if ( src.m_nCount > ARRAY_DEFAULT_INITIAL_SIZE )
1808     Alloc(src.m_nCount);
1809
1810   for ( size_t n = 0; n < src.m_nCount; n++ )
1811     Add(src[n]);
1812 }
1813
1814 // grow the array
1815 void wxArrayString::Grow()
1816 {
1817   // only do it if no more place
1818   if( m_nCount == m_nSize ) {
1819     if( m_nSize == 0 ) {
1820       // was empty, alloc some memory
1821       m_nSize = ARRAY_DEFAULT_INITIAL_SIZE;
1822       m_pItems = new wxChar *[m_nSize];
1823     }
1824     else {
1825       // otherwise when it's called for the first time, nIncrement would be 0
1826       // and the array would never be expanded
1827 #if defined(__VISAGECPP__) && defined(__WXDEBUG__)
1828       int array_size = ARRAY_DEFAULT_INITIAL_SIZE;
1829       wxASSERT( array_size != 0 );
1830 #else
1831       wxASSERT( ARRAY_DEFAULT_INITIAL_SIZE != 0 );
1832 #endif
1833
1834       // add 50% but not too much
1835       size_t nIncrement = m_nSize < ARRAY_DEFAULT_INITIAL_SIZE
1836                           ? ARRAY_DEFAULT_INITIAL_SIZE : m_nSize >> 1;
1837       if ( nIncrement > ARRAY_MAXSIZE_INCREMENT )
1838         nIncrement = ARRAY_MAXSIZE_INCREMENT;
1839       m_nSize += nIncrement;
1840       wxChar **pNew = new wxChar *[m_nSize];
1841
1842       // copy data to new location
1843       memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
1844
1845       // delete old memory (but do not release the strings!)
1846       wxDELETEA(m_pItems);
1847
1848       m_pItems = pNew;
1849     }
1850   }
1851 }
1852
1853 void wxArrayString::Free()
1854 {
1855   for ( size_t n = 0; n < m_nCount; n++ ) {
1856     STRING(m_pItems[n])->GetStringData()->Unlock();
1857   }
1858 }
1859
1860 // deletes all the strings from the list
1861 void wxArrayString::Empty()
1862 {
1863   Free();
1864
1865   m_nCount = 0;
1866 }
1867
1868 // as Empty, but also frees memory
1869 void wxArrayString::Clear()
1870 {
1871   Free();
1872
1873   m_nSize  =
1874   m_nCount = 0;
1875
1876   wxDELETEA(m_pItems);
1877 }
1878
1879 // dtor
1880 wxArrayString::~wxArrayString()
1881 {
1882   Free();
1883
1884   wxDELETEA(m_pItems);
1885 }
1886
1887 // pre-allocates memory (frees the previous data!)
1888 void wxArrayString::Alloc(size_t nSize)
1889 {
1890   wxASSERT( nSize > 0 );
1891
1892   // only if old buffer was not big enough
1893   if ( nSize > m_nSize ) {
1894     Free();
1895     wxDELETEA(m_pItems);
1896     m_pItems = new wxChar *[nSize];
1897     m_nSize  = nSize;
1898   }
1899
1900   m_nCount = 0;
1901 }
1902
1903 // minimizes the memory usage by freeing unused memory
1904 void wxArrayString::Shrink()
1905 {
1906   // only do it if we have some memory to free
1907   if( m_nCount < m_nSize ) {
1908     // allocates exactly as much memory as we need
1909     wxChar **pNew = new wxChar *[m_nCount];
1910
1911     // copy data to new location
1912     memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
1913     delete [] m_pItems;
1914     m_pItems = pNew;
1915   }
1916 }
1917
1918 // searches the array for an item (forward or backwards)
1919 int wxArrayString::Index(const wxChar *sz, bool bCase, bool bFromEnd) const
1920 {
1921   if ( m_autoSort ) {
1922     // use binary search in the sorted array
1923     wxASSERT_MSG( bCase && !bFromEnd,
1924                   wxT("search parameters ignored for auto sorted array") );
1925
1926     size_t i,
1927            lo = 0,
1928            hi = m_nCount;
1929     int res;
1930     while ( lo < hi ) {
1931       i = (lo + hi)/2;
1932
1933       res = wxStrcmp(sz, m_pItems[i]);
1934       if ( res < 0 )
1935         hi = i;
1936       else if ( res > 0 )
1937         lo = i + 1;
1938       else
1939         return i;
1940     }
1941
1942     return wxNOT_FOUND;
1943   }
1944   else {
1945     // use linear search in unsorted array
1946     if ( bFromEnd ) {
1947       if ( m_nCount > 0 ) {
1948         size_t ui = m_nCount;
1949         do {
1950           if ( STRING(m_pItems[--ui])->IsSameAs(sz, bCase) )
1951             return ui;
1952         }
1953         while ( ui != 0 );
1954       }
1955     }
1956     else {
1957       for( size_t ui = 0; ui < m_nCount; ui++ ) {
1958         if( STRING(m_pItems[ui])->IsSameAs(sz, bCase) )
1959           return ui;
1960       }
1961     }
1962   }
1963
1964   return wxNOT_FOUND;
1965 }
1966
1967 // add item at the end
1968 size_t wxArrayString::Add(const wxString& str)
1969 {
1970   if ( m_autoSort ) {
1971     // insert the string at the correct position to keep the array sorted
1972     size_t i,
1973            lo = 0,
1974            hi = m_nCount;
1975     int res;
1976     while ( lo < hi ) {
1977       i = (lo + hi)/2;
1978
1979       res = wxStrcmp(str, m_pItems[i]);
1980       if ( res < 0 )
1981         hi = i;
1982       else if ( res > 0 )
1983         lo = i + 1;
1984       else {
1985         lo = hi = i;
1986         break;
1987       }
1988     }
1989
1990     wxASSERT_MSG( lo == hi, wxT("binary search broken") );
1991
1992     Insert(str, lo);
1993
1994     return (size_t)lo;
1995   }
1996   else {
1997     wxASSERT( str.GetStringData()->IsValid() );
1998
1999     Grow();
2000
2001     // the string data must not be deleted!
2002     str.GetStringData()->Lock();
2003
2004     // just append
2005     m_pItems[m_nCount] = (wxChar *)str.c_str(); // const_cast
2006
2007     return m_nCount++;
2008   }
2009 }
2010
2011 // add item at the given position
2012 void wxArrayString::Insert(const wxString& str, size_t nIndex)
2013 {
2014   wxASSERT( str.GetStringData()->IsValid() );
2015
2016   wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArrayString::Insert") );
2017
2018   Grow();
2019
2020   memmove(&m_pItems[nIndex + 1], &m_pItems[nIndex],
2021           (m_nCount - nIndex)*sizeof(wxChar *));
2022
2023   str.GetStringData()->Lock();
2024   m_pItems[nIndex] = (wxChar *)str.c_str();
2025
2026   m_nCount++;
2027 }
2028
2029 // removes item from array (by index)
2030 void wxArrayString::Remove(size_t nIndex)
2031 {
2032   wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArrayString::Remove") );
2033
2034   // release our lock
2035   Item(nIndex).GetStringData()->Unlock();
2036
2037   memmove(&m_pItems[nIndex], &m_pItems[nIndex + 1],
2038           (m_nCount - nIndex - 1)*sizeof(wxChar *));
2039   m_nCount--;
2040 }
2041
2042 // removes item from array (by value)
2043 void wxArrayString::Remove(const wxChar *sz)
2044 {
2045   int iIndex = Index(sz);
2046
2047   wxCHECK_RET( iIndex != wxNOT_FOUND,
2048                wxT("removing inexistent element in wxArrayString::Remove") );
2049
2050   Remove(iIndex);
2051 }
2052
2053 // ----------------------------------------------------------------------------
2054 // sorting
2055 // ----------------------------------------------------------------------------
2056
2057 // we can only sort one array at a time with the quick-sort based
2058 // implementation
2059 #if wxUSE_THREADS
2060   // need a critical section to protect access to gs_compareFunction and
2061   // gs_sortAscending variables
2062   static wxCriticalSection *gs_critsectStringSort = NULL;
2063
2064   // call this before the value of the global sort vars is changed/after
2065   // you're finished with them
2066   #define START_SORT()     wxASSERT( !gs_critsectStringSort );                \
2067                            gs_critsectStringSort = new wxCriticalSection;     \
2068                            gs_critsectStringSort->Enter()
2069   #define END_SORT()       gs_critsectStringSort->Leave();                    \
2070                            delete gs_critsectStringSort;                      \
2071                            gs_critsectStringSort = NULL
2072 #else // !threads
2073   #define START_SORT()
2074   #define END_SORT()
2075 #endif // wxUSE_THREADS
2076
2077 // function to use for string comparaison
2078 static wxArrayString::CompareFunction gs_compareFunction = NULL;
2079
2080 // if we don't use the compare function, this flag tells us if we sort the
2081 // array in ascending or descending order
2082 static bool gs_sortAscending = TRUE;
2083
2084 // function which is called by quick sort
2085 static int LINKAGEMODE wxStringCompareFunction(const void *first, const void *second)
2086 {
2087   wxString *strFirst = (wxString *)first;
2088   wxString *strSecond = (wxString *)second;
2089
2090   if ( gs_compareFunction ) {
2091     return gs_compareFunction(*strFirst, *strSecond);
2092   }
2093   else {
2094     // maybe we should use wxStrcoll
2095     int result = wxStrcmp(strFirst->c_str(), strSecond->c_str());
2096
2097     return gs_sortAscending ? result : -result;
2098   }
2099 }
2100
2101 // sort array elements using passed comparaison function
2102 void wxArrayString::Sort(CompareFunction compareFunction)
2103 {
2104   START_SORT();
2105
2106   wxASSERT( !gs_compareFunction );  // must have been reset to NULL
2107   gs_compareFunction = compareFunction;
2108
2109   DoSort();
2110
2111   END_SORT();
2112 }
2113
2114 void wxArrayString::Sort(bool reverseOrder)
2115 {
2116   START_SORT();
2117
2118   wxASSERT( !gs_compareFunction );  // must have been reset to NULL
2119   gs_sortAscending = !reverseOrder;
2120
2121   DoSort();
2122
2123   END_SORT();
2124 }
2125
2126 void wxArrayString::DoSort()
2127 {
2128   wxCHECK_RET( !m_autoSort, wxT("can't use this method with sorted arrays") );
2129
2130   // just sort the pointers using qsort() - of course it only works because
2131   // wxString() *is* a pointer to its data
2132   qsort(m_pItems, m_nCount, sizeof(wxChar *), wxStringCompareFunction);
2133 }
2134