src/common/string.cpp

   1 /////////////////////////////////////////////////////////////////////////////
   2 // Name:        src/common/string.cpp
   3 // Purpose:     wxString class
   4 // Author:      Vadim Zeitlin, Ryan Norton
   5 // Modified by:
   6 // Created:     29/01/98
   7 // RCS-ID:      $Id$
   8 // Copyright:   (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
   9 //              (c) 2004 Ryan Norton <wxprojects@comcast.net>
  10 // Licence:     wxWindows licence
  11 /////////////////////////////////////////////////////////////////////////////
  12
  13 /*
  14  * About ref counting:
  15  *  1) all empty strings use g_strEmpty, nRefs = -1 (set in Init())
  16  *  2) AllocBuffer() sets nRefs to 1, Lock() increments it by one
  17  *  3) Unlock() decrements nRefs and frees memory if it goes to 0
  18  */
  19
  20 // ===========================================================================
  21 // headers, declarations, constants
  22 // ===========================================================================
  23
  24 // For compilers that support precompilation, includes "wx.h".
  25 #include "wx/wxprec.h"
  26
  27 #ifdef __BORLANDC__
  28     #pragma hdrstop
  29 #endif
  30
  31 #ifndef WX_PRECOMP
  32     #include "wx/string.h"
  33     #include "wx/intl.h"
  34     #include "wx/thread.h"
  35 #endif
  36
  37 #include <ctype.h>
  38 #include <string.h>
  39 #include <stdlib.h>
  40
  41 #ifdef __SALFORDC__
  42     #include <clib.h>
  43 #endif
  44
  45 // allocating extra space for each string consumes more memory but speeds up
  46 // the concatenation operations (nLen is the current string's length)
  47 // NB: EXTRA_ALLOC must be >= 0!
  48 #define EXTRA_ALLOC       (19 - nLen % 16)
  49
  50 // ---------------------------------------------------------------------------
  51 // static class variables definition
  52 // ---------------------------------------------------------------------------
  53
  54 #if !wxUSE_STL
  55   //According to STL _must_ be a -1 size_t
  56   const size_t wxStringBase::npos = (size_t) -1;
  57 #endif
  58
  59 // ----------------------------------------------------------------------------
  60 // static data
  61 // ----------------------------------------------------------------------------
  62
  63 #if wxUSE_STL
  64
  65 extern const wxChar WXDLLIMPEXP_BASE *wxEmptyString = _T("");
  66
  67 #else
  68
  69 // for an empty string, GetStringData() will return this address: this
  70 // structure has the same layout as wxStringData and it's data() method will
  71 // return the empty string (dummy pointer)
  72 static const struct
  73 {
  74   wxStringData data;
  75   wxChar dummy;
  76 } g_strEmpty = { {-1, 0, 0}, wxT('\0') };
  77
  78 // empty C style string: points to 'string data' byte of g_strEmpty
  79 extern const wxChar WXDLLIMPEXP_BASE *wxEmptyString = &g_strEmpty.dummy;
  80
  81 #endif
  82
  83 // ----------------------------------------------------------------------------
  84 // global functions
  85 // ----------------------------------------------------------------------------
  86
  87 #if wxUSE_STD_IOSTREAM
  88
  89 #include <iostream>
  90
  91 wxSTD ostream& operator<<(wxSTD ostream& os, const wxString& str)
  92 {
  93 #ifdef __BORLANDC__
  94     os << str.mb_str();
  95 #else
  96     os << str.c_str();
  97 #endif
  98     return os;
  99 }
 100
 101 #endif // wxUSE_STD_IOSTREAM
 102
 103 // ----------------------------------------------------------------------------
 104 // private classes
 105 // ----------------------------------------------------------------------------
 106
 107 // this small class is used to gather statistics for performance tuning
 108 //#define WXSTRING_STATISTICS
 109 #ifdef  WXSTRING_STATISTICS
 110   class Averager
 111   {
 112   public:
 113     Averager(const wxChar *sz) { m_sz = sz; m_nTotal = m_nCount = 0; }
 114    ~Averager()
 115    { wxPrintf("wxString: average %s = %f\n", m_sz, ((float)m_nTotal)/m_nCount); }
 116
 117     void Add(size_t n) { m_nTotal += n; m_nCount++; }
 118
 119   private:
 120     size_t m_nCount, m_nTotal;
 121     const wxChar *m_sz;
 122   } g_averageLength("allocation size"),
 123     g_averageSummandLength("summand length"),
 124     g_averageConcatHit("hit probability in concat"),
 125     g_averageInitialLength("initial string length");
 126
 127   #define STATISTICS_ADD(av, val) g_average##av.Add(val)
 128 #else
 129   #define STATISTICS_ADD(av, val)
 130 #endif // WXSTRING_STATISTICS
 131
 132 #if !wxUSE_STL
 133
 134 // ===========================================================================
 135 // wxStringData class deallocation
 136 // ===========================================================================
 137
 138 #if defined(__VISUALC__) && defined(_MT) && !defined(_DLL)
 139 #  pragma message (__FILE__ ": building with Multithreaded non DLL runtime has a performance impact on wxString!")
 140 void wxStringData::Free()
 141 {
 142     free(this);
 143 }
 144 #endif
 145
 146 // ===========================================================================
 147 // wxStringBase
 148 // ===========================================================================
 149
 150 // takes nLength elements of psz starting at nPos
 151 void wxStringBase::InitWith(const wxChar *psz, size_t nPos, size_t nLength)
 152 {
 153   Init();
 154
 155   // if the length is not given, assume the string to be NUL terminated
 156   if ( nLength == npos ) {
 157     wxASSERT_MSG( nPos <= wxStrlen(psz), _T("index out of bounds") );
 158
 159     nLength = wxStrlen(psz + nPos);
 160   }
 161
 162   STATISTICS_ADD(InitialLength, nLength);
 163
 164   if ( nLength > 0 ) {
 165     // trailing '\0' is written in AllocBuffer()
 166     if ( !AllocBuffer(nLength) ) {
 167       wxFAIL_MSG( _T("out of memory in wxStringBase::InitWith") );
 168       return;
 169     }
 170     wxTmemcpy(m_pchData, psz + nPos, nLength);
 171   }
 172 }
 173
 174 // poor man's iterators are "void *" pointers
 175 wxStringBase::wxStringBase(const void *pStart, const void *pEnd)
 176 {
 177   if ( pEnd > pStart )
 178   {
 179     InitWith((const wxChar *)pStart, 0,
 180              (const wxChar *)pEnd - (const wxChar *)pStart);
 181   }
 182   else
 183   {
 184     wxFAIL_MSG( _T("pStart is not before pEnd") );
 185     Init();
 186   }
 187 }
 188
 189 wxStringBase::wxStringBase(size_type n, wxChar ch)
 190 {
 191   Init();
 192   append(n, ch);
 193 }
 194
 195 // ---------------------------------------------------------------------------
 196 // memory allocation
 197 // ---------------------------------------------------------------------------
 198
 199 // allocates memory needed to store a C string of length nLen
 200 bool wxStringBase::AllocBuffer(size_t nLen)
 201 {
 202   // allocating 0 sized buffer doesn't make sense, all empty strings should
 203   // reuse g_strEmpty
 204   wxASSERT( nLen >  0 );
 205
 206   // make sure that we don't overflow
 207   wxASSERT( nLen < (INT_MAX / sizeof(wxChar)) -
 208                    (sizeof(wxStringData) + EXTRA_ALLOC + 1) );
 209
 210   STATISTICS_ADD(Length, nLen);
 211
 212   // allocate memory:
 213   // 1) one extra character for '\0' termination
 214   // 2) sizeof(wxStringData) for housekeeping info
 215   wxStringData* pData = (wxStringData*)
 216     malloc(sizeof(wxStringData) + (nLen + EXTRA_ALLOC + 1)*sizeof(wxChar));
 217
 218   if ( pData == NULL ) {
 219     // allocation failures are handled by the caller
 220     return false;
 221   }
 222
 223   pData->nRefs        = 1;
 224   pData->nDataLength  = nLen;
 225   pData->nAllocLength = nLen + EXTRA_ALLOC;
 226   m_pchData           = pData->data();  // data starts after wxStringData
 227   m_pchData[nLen]     = wxT('\0');
 228   return true;
 229 }
 230
 231 // must be called before changing this string
 232 bool wxStringBase::CopyBeforeWrite()
 233 {
 234   wxStringData* pData = GetStringData();
 235
 236   if ( pData->IsShared() ) {
 237     pData->Unlock();                // memory not freed because shared
 238     size_t nLen = pData->nDataLength;
 239     if ( !AllocBuffer(nLen) ) {
 240       // allocation failures are handled by the caller
 241       return false;
 242     }
 243     wxTmemcpy(m_pchData, pData->data(), nLen);
 244   }
 245
 246   wxASSERT( !GetStringData()->IsShared() );  // we must be the only owner
 247
 248   return true;
 249 }
 250
 251 // must be called before replacing contents of this string
 252 bool wxStringBase::AllocBeforeWrite(size_t nLen)
 253 {
 254   wxASSERT( nLen != 0 );  // doesn't make any sense
 255
 256   // must not share string and must have enough space
 257   wxStringData* pData = GetStringData();
 258   if ( pData->IsShared() || pData->IsEmpty() ) {
 259     // can't work with old buffer, get new one
 260     pData->Unlock();
 261     if ( !AllocBuffer(nLen) ) {
 262       // allocation failures are handled by the caller
 263       return false;
 264     }
 265   }
 266   else {
 267     if ( nLen > pData->nAllocLength ) {
 268       // realloc the buffer instead of calling malloc() again, this is more
 269       // efficient
 270       STATISTICS_ADD(Length, nLen);
 271
 272       nLen += EXTRA_ALLOC;
 273
 274       pData = (wxStringData*)
 275           realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 276
 277       if ( pData == NULL ) {
 278         // allocation failures are handled by the caller
 279         // keep previous data since reallocation failed
 280         return false;
 281       }
 282
 283       pData->nAllocLength = nLen;
 284       m_pchData = pData->data();
 285     }
 286   }
 287
 288   wxASSERT( !GetStringData()->IsShared() );  // we must be the only owner
 289
 290   // it doesn't really matter what the string length is as it's going to be
 291   // overwritten later but, for extra safety, set it to 0 for now as we may
 292   // have some junk in m_pchData
 293   GetStringData()->nDataLength = 0;
 294
 295   return true;
 296 }
 297
 298 wxStringBase& wxStringBase::append(size_t n, wxChar ch)
 299 {
 300     size_type len = length();
 301
 302     if ( !Alloc(len + n) || !CopyBeforeWrite() ) {
 303       wxFAIL_MSG( _T("out of memory in wxStringBase::append") );
 304     }
 305     GetStringData()->nDataLength = len + n;
 306     m_pchData[len + n] = '\0';
 307     for ( size_t i = 0; i < n; ++i )
 308         m_pchData[len + i] = ch;
 309     return *this;
 310 }
 311
 312 void wxStringBase::resize(size_t nSize, wxChar ch)
 313 {
 314     size_t len = length();
 315
 316     if ( nSize < len )
 317     {
 318         erase(begin() + nSize, end());
 319     }
 320     else if ( nSize > len )
 321     {
 322         append(nSize - len, ch);
 323     }
 324     //else: we have exactly the specified length, nothing to do
 325 }
 326
 327 // allocate enough memory for nLen characters
 328 bool wxStringBase::Alloc(size_t nLen)
 329 {
 330   wxStringData *pData = GetStringData();
 331   if ( pData->nAllocLength <= nLen ) {
 332     if ( pData->IsEmpty() ) {
 333       nLen += EXTRA_ALLOC;
 334
 335       pData = (wxStringData *)
 336                 malloc(sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 337
 338       if ( pData == NULL ) {
 339         // allocation failure handled by caller
 340         return false;
 341       }
 342
 343       pData->nRefs = 1;
 344       pData->nDataLength = 0;
 345       pData->nAllocLength = nLen;
 346       m_pchData = pData->data();  // data starts after wxStringData
 347       m_pchData[0u] = wxT('\0');
 348     }
 349     else if ( pData->IsShared() ) {
 350       pData->Unlock();                // memory not freed because shared
 351       size_t nOldLen = pData->nDataLength;
 352       if ( !AllocBuffer(nLen) ) {
 353         // allocation failure handled by caller
 354         return false;
 355       }
 356       // +1 to copy the terminator, too
 357       memcpy(m_pchData, pData->data(), (nOldLen+1)*sizeof(wxChar));
 358       GetStringData()->nDataLength = nOldLen;
 359     }
 360     else {
 361       nLen += EXTRA_ALLOC;
 362
 363       pData = (wxStringData *)
 364         realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar));
 365
 366       if ( pData == NULL ) {
 367         // allocation failure handled by caller
 368         // keep previous data since reallocation failed
 369         return false;
 370       }
 371
 372       // it's not important if the pointer changed or not (the check for this
 373       // is not faster than assigning to m_pchData in all cases)
 374       pData->nAllocLength = nLen;
 375       m_pchData = pData->data();
 376     }
 377   }
 378   //else: we've already got enough
 379   return true;
 380 }
 381
 382 wxStringBase::iterator wxStringBase::begin()
 383 {
 384     if (length() > 0)
 385         CopyBeforeWrite();
 386     return m_pchData;
 387 }
 388
 389 wxStringBase::iterator wxStringBase::end()
 390 {
 391     if (length() > 0)
 392         CopyBeforeWrite();
 393     return m_pchData + length();
 394 }
 395
 396 wxStringBase::iterator wxStringBase::erase(iterator it)
 397 {
 398     size_type idx = it - begin();
 399     erase(idx, 1);
 400     return begin() + idx;
 401 }
 402
 403 wxStringBase& wxStringBase::erase(size_t nStart, size_t nLen)
 404 {
 405     wxASSERT(nStart <= length());
 406     size_t strLen = length() - nStart;
 407     // delete nLen or up to the end of the string characters
 408     nLen = strLen < nLen ? strLen : nLen;
 409     wxString strTmp(c_str(), nStart);
 410     strTmp.append(c_str() + nStart + nLen, length() - nStart - nLen);
 411
 412     swap(strTmp);
 413     return *this;
 414 }
 415
 416 wxStringBase& wxStringBase::insert(size_t nPos, const wxChar *sz, size_t n)
 417 {
 418     wxASSERT( nPos <= length() );
 419
 420     if ( n == npos ) n = wxStrlen(sz);
 421     if ( n == 0 ) return *this;
 422
 423     if ( !Alloc(length() + n) || !CopyBeforeWrite() ) {
 424         wxFAIL_MSG( _T("out of memory in wxStringBase::insert") );
 425     }
 426
 427     memmove(m_pchData + nPos + n, m_pchData + nPos,
 428             (length() - nPos) * sizeof(wxChar));
 429     memcpy(m_pchData + nPos, sz, n * sizeof(wxChar));
 430     GetStringData()->nDataLength = length() + n;
 431     m_pchData[length()] = '\0';
 432
 433     return *this;
 434 }
 435
 436 void wxStringBase::swap(wxStringBase& str)
 437 {
 438     wxChar* tmp = str.m_pchData;
 439     str.m_pchData = m_pchData;
 440     m_pchData = tmp;
 441 }
 442
 443 size_t wxStringBase::find(const wxStringBase& str, size_t nStart) const
 444 {
 445     // deal with the special case of empty string first
 446     const size_t nLen = length();
 447     const size_t nLenOther = str.length();
 448
 449     if ( !nLenOther )
 450     {
 451         // empty string is a substring of anything
 452         return 0;
 453     }
 454
 455     if ( !nLen )
 456     {
 457         // the other string is non empty so can't be our substring
 458         return npos;
 459     }
 460
 461     wxASSERT( str.GetStringData()->IsValid() );
 462     wxASSERT( nStart <= nLen );
 463
 464     const wxChar * const other = str.c_str();
 465
 466     // anchor
 467     const wxChar* p = (const wxChar*)wxTmemchr(c_str() + nStart,
 468                                                *other,
 469                                                nLen - nStart);
 470
 471     if ( !p )
 472         return npos;
 473
 474     while ( p - c_str() + nLenOther <= nLen && wxTmemcmp(p, other, nLenOther) )
 475     {
 476         p++;
 477
 478         // anchor again
 479         p = (const wxChar*)wxTmemchr(p, *other, nLen - (p - c_str()));
 480
 481         if ( !p )
 482             return npos;
 483     }
 484
 485     return p - c_str() + nLenOther <= nLen ? p - c_str() : npos;
 486 }
 487
 488 size_t wxStringBase::find(const wxChar* sz, size_t nStart, size_t n) const
 489 {
 490     return find(wxStringBase(sz, n), nStart);
 491 }
 492
 493 size_t wxStringBase::find(wxChar ch, size_t nStart) const
 494 {
 495     wxASSERT( nStart <= length() );
 496
 497     const wxChar *p = (const wxChar*)wxTmemchr(c_str() + nStart, ch, length() - nStart);
 498
 499     return p == NULL ? npos : p - c_str();
 500 }
 501
 502 size_t wxStringBase::rfind(const wxStringBase& str, size_t nStart) const
 503 {
 504     wxASSERT( str.GetStringData()->IsValid() );
 505     wxASSERT( nStart == npos || nStart <= length() );
 506
 507     if ( length() >= str.length() )
 508     {
 509         // avoids a corner case later
 510         if ( length() == 0 && str.length() == 0 )
 511             return 0;
 512
 513         // "top" is the point where search starts from
 514         size_t top = length() - str.length();
 515
 516         if ( nStart == npos )
 517             nStart = length() - 1;
 518         if ( nStart < top )
 519             top = nStart;
 520
 521         const wxChar *cursor = c_str() + top;
 522         do
 523         {
 524             if ( wxTmemcmp(cursor, str.c_str(),
 525                         str.length()) == 0 )
 526             {
 527                 return cursor - c_str();
 528             }
 529         } while ( cursor-- > c_str() );
 530     }
 531
 532     return npos;
 533 }
 534
 535 size_t wxStringBase::rfind(const wxChar* sz, size_t nStart, size_t n) const
 536 {
 537     return rfind(wxStringBase(sz, n), nStart);
 538 }
 539
 540 size_t wxStringBase::rfind(wxChar ch, size_t nStart) const
 541 {
 542     if ( nStart == npos )
 543     {
 544         nStart = length();
 545     }
 546     else
 547     {
 548         wxASSERT( nStart <= length() );
 549     }
 550
 551     const wxChar *actual;
 552     for ( actual = c_str() + ( nStart == npos ? length() : nStart + 1 );
 553           actual > c_str(); --actual )
 554     {
 555         if ( *(actual - 1) == ch )
 556             return (actual - 1) - c_str();
 557     }
 558
 559     return npos;
 560 }
 561
 562 size_t wxStringBase::find_first_of(const wxChar* sz, size_t nStart) const
 563 {
 564     wxASSERT(nStart <= length());
 565
 566     size_t len = wxStrlen(sz);
 567
 568     size_t i;
 569     for(i = nStart; i < this->length(); ++i)
 570     {
 571         if (wxTmemchr(sz, *(c_str() + i), len))
 572             break;
 573     }
 574
 575     if(i == this->length())
 576         return npos;
 577     else
 578         return i;
 579 }
 580
 581 size_t wxStringBase::find_first_of(const wxChar* sz, size_t nStart,
 582                                    size_t n) const
 583 {
 584     return find_first_of(wxStringBase(sz, n), nStart);
 585 }
 586
 587 size_t wxStringBase::find_last_of(const wxChar* sz, size_t nStart) const
 588 {
 589     if ( nStart == npos )
 590     {
 591         nStart = length() - 1;
 592     }
 593     else
 594     {
 595         wxASSERT_MSG( nStart <= length(),
 596                         _T("invalid index in find_last_of()") );
 597     }
 598
 599     size_t len = wxStrlen(sz);
 600
 601     for ( const wxChar *p = c_str() + nStart; p >= c_str(); --p )
 602     {
 603         if ( wxTmemchr(sz, *p, len) )
 604             return p - c_str();
 605     }
 606
 607     return npos;
 608 }
 609
 610 size_t wxStringBase::find_last_of(const wxChar* sz, size_t nStart,
 611                                    size_t n) const
 612 {
 613     return find_last_of(wxStringBase(sz, n), nStart);
 614 }
 615
 616 size_t wxStringBase::find_first_not_of(const wxChar* sz, size_t nStart) const
 617 {
 618     if ( nStart == npos )
 619     {
 620         nStart = length();
 621     }
 622     else
 623     {
 624         wxASSERT( nStart <= length() );
 625     }
 626
 627     size_t len = wxStrlen(sz);
 628
 629     size_t i;
 630     for(i = nStart; i < this->length(); ++i)
 631     {
 632         if (!wxTmemchr(sz, *(c_str() + i), len))
 633             break;
 634     }
 635
 636     if(i == this->length())
 637          return npos;
 638      else
 639         return i;
 640 }
 641
 642 size_t wxStringBase::find_first_not_of(const wxChar* sz, size_t nStart,
 643                                        size_t n) const
 644 {
 645     return find_first_not_of(wxStringBase(sz, n), nStart);
 646 }
 647
 648 size_t wxStringBase::find_first_not_of(wxChar ch, size_t nStart) const
 649 {
 650     wxASSERT( nStart <= length() );
 651
 652     for ( const wxChar *p = c_str() + nStart; *p; p++ )
 653     {
 654         if ( *p != ch )
 655             return p - c_str();
 656     }
 657
 658     return npos;
 659 }
 660
 661 size_t wxStringBase::find_last_not_of(const wxChar* sz, size_t nStart) const
 662 {
 663     if ( nStart == npos )
 664     {
 665         nStart = length() - 1;
 666     }
 667     else
 668     {
 669         wxASSERT( nStart <= length() );
 670     }
 671
 672     size_t len = wxStrlen(sz);
 673
 674     for ( const wxChar *p = c_str() + nStart; p >= c_str(); --p )
 675     {
 676         if ( !wxTmemchr(sz, *p,len) )
 677              return p - c_str();
 678     }
 679
 680     return npos;
 681 }
 682
 683 size_t wxStringBase::find_last_not_of(const wxChar* sz, size_t nStart,
 684                                       size_t n) const
 685 {
 686     return find_last_not_of(wxStringBase(sz, n), nStart);
 687 }
 688
 689 size_t wxStringBase::find_last_not_of(wxChar ch, size_t nStart) const
 690 {
 691     if ( nStart == npos )
 692     {
 693         nStart = length() - 1;
 694     }
 695     else
 696     {
 697         wxASSERT( nStart <= length() );
 698     }
 699
 700     for ( const wxChar *p = c_str() + nStart; p >= c_str(); --p )
 701     {
 702         if ( *p != ch )
 703             return p - c_str();
 704     }
 705
 706     return npos;
 707 }
 708
 709 wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen,
 710                                     const wxChar *sz)
 711 {
 712   wxASSERT_MSG( nStart <= length(),
 713                 _T("index out of bounds in wxStringBase::replace") );
 714   size_t strLen = length() - nStart;
 715   nLen = strLen < nLen ? strLen : nLen;
 716
 717   wxStringBase strTmp;
 718   strTmp.reserve(length()); // micro optimisation to avoid multiple mem allocs
 719
 720   //This is kind of inefficient, but its pretty good considering...
 721   //we don't want to use character access operators here because on STL
 722   //it will freeze the reference count of strTmp, which means a deep copy
 723   //at the end when swap is called
 724   //
 725   //Also, we can't use append with the full character pointer and must
 726   //do it manually because this string can contain null characters
 727   for(size_t i1 = 0; i1 < nStart; ++i1)
 728       strTmp.append(1, this->c_str()[i1]);
 729
 730   //its safe to do the full version here because
 731   //sz must be a normal c string
 732   strTmp.append(sz);
 733
 734   for(size_t i2 = nStart + nLen; i2 < length(); ++i2)
 735       strTmp.append(1, this->c_str()[i2]);
 736
 737   swap(strTmp);
 738   return *this;
 739 }
 740
 741 wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen,
 742                                     size_t nCount, wxChar ch)
 743 {
 744   return replace(nStart, nLen, wxStringBase(nCount, ch).c_str());
 745 }
 746
 747 wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen,
 748                                     const wxStringBase& str,
 749                                     size_t nStart2, size_t nLen2)
 750 {
 751   return replace(nStart, nLen, str.substr(nStart2, nLen2));
 752 }
 753
 754 wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen,
 755                                     const wxChar* sz, size_t nCount)
 756 {
 757   return replace(nStart, nLen, wxStringBase(sz, nCount).c_str());
 758 }
 759
 760 wxStringBase wxStringBase::substr(size_t nStart, size_t nLen) const
 761 {
 762   if ( nLen == npos )
 763     nLen = length() - nStart;
 764   return wxStringBase(*this, nStart, nLen);
 765 }
 766
 767 // assigns one string to another
 768 wxStringBase& wxStringBase::operator=(const wxStringBase& stringSrc)
 769 {
 770   wxASSERT( stringSrc.GetStringData()->IsValid() );
 771
 772   // don't copy string over itself
 773   if ( m_pchData != stringSrc.m_pchData ) {
 774     if ( stringSrc.GetStringData()->IsEmpty() ) {
 775       Reinit();
 776     }
 777     else {
 778       // adjust references
 779       GetStringData()->Unlock();
 780       m_pchData = stringSrc.m_pchData;
 781       GetStringData()->Lock();
 782     }
 783   }
 784
 785   return *this;
 786 }
 787
 788 // assigns a single character
 789 wxStringBase& wxStringBase::operator=(wxChar ch)
 790 {
 791   if ( !AssignCopy(1, &ch) ) {
 792     wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(wxChar)") );
 793   }
 794   return *this;
 795 }
 796
 797 // assigns C string
 798 wxStringBase& wxStringBase::operator=(const wxChar *psz)
 799 {
 800   if ( !AssignCopy(wxStrlen(psz), psz) ) {
 801     wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(const wxChar *)") );
 802   }
 803   return *this;
 804 }
 805
 806 // helper function: does real copy
 807 bool wxStringBase::AssignCopy(size_t nSrcLen, const wxChar *pszSrcData)
 808 {
 809   if ( nSrcLen == 0 ) {
 810     Reinit();
 811   }
 812   else {
 813     if ( !AllocBeforeWrite(nSrcLen) ) {
 814       // allocation failure handled by caller
 815       return false;
 816     }
 817     memcpy(m_pchData, pszSrcData, nSrcLen*sizeof(wxChar));
 818     GetStringData()->nDataLength = nSrcLen;
 819     m_pchData[nSrcLen] = wxT('\0');
 820   }
 821   return true;
 822 }
 823
 824 // ---------------------------------------------------------------------------
 825 // string concatenation
 826 // ---------------------------------------------------------------------------
 827
 828 // add something to this string
 829 bool wxStringBase::ConcatSelf(size_t nSrcLen, const wxChar *pszSrcData,
 830                               size_t nMaxLen)
 831 {
 832   STATISTICS_ADD(SummandLength, nSrcLen);
 833
 834   nSrcLen = nSrcLen < nMaxLen ? nSrcLen : nMaxLen;
 835
 836   // concatenating an empty string is a NOP
 837   if ( nSrcLen > 0 ) {
 838     wxStringData *pData = GetStringData();
 839     size_t nLen = pData->nDataLength;
 840     size_t nNewLen = nLen + nSrcLen;
 841
 842     // alloc new buffer if current is too small
 843     if ( pData->IsShared() ) {
 844       STATISTICS_ADD(ConcatHit, 0);
 845
 846       // we have to allocate another buffer
 847       wxStringData* pOldData = GetStringData();
 848       if ( !AllocBuffer(nNewLen) ) {
 849           // allocation failure handled by caller
 850           return false;
 851       }
 852       memcpy(m_pchData, pOldData->data(), nLen*sizeof(wxChar));
 853       pOldData->Unlock();
 854     }
 855     else if ( nNewLen > pData->nAllocLength ) {
 856       STATISTICS_ADD(ConcatHit, 0);
 857
 858       reserve(nNewLen);
 859       // we have to grow the buffer
 860       if ( capacity() < nNewLen ) {
 861           // allocation failure handled by caller
 862           return false;
 863       }
 864     }
 865     else {
 866       STATISTICS_ADD(ConcatHit, 1);
 867
 868       // the buffer is already big enough
 869     }
 870
 871     // should be enough space
 872     wxASSERT( nNewLen <= GetStringData()->nAllocLength );
 873
 874     // fast concatenation - all is done in our buffer
 875     memcpy(m_pchData + nLen, pszSrcData, nSrcLen*sizeof(wxChar));
 876
 877     m_pchData[nNewLen] = wxT('\0');          // put terminating '\0'
 878     GetStringData()->nDataLength = nNewLen; // and fix the length
 879   }
 880   //else: the string to append was empty
 881   return true;
 882 }
 883
 884 // ---------------------------------------------------------------------------
 885 // simple sub-string extraction
 886 // ---------------------------------------------------------------------------
 887
 888 // helper function: clone the data attached to this string
 889 bool wxStringBase::AllocCopy(wxString& dest, int nCopyLen, int nCopyIndex) const
 890 {
 891   if ( nCopyLen == 0 ) {
 892     dest.Init();
 893   }
 894   else {
 895     if ( !dest.AllocBuffer(nCopyLen) ) {
 896       // allocation failure handled by caller
 897       return false;
 898     }
 899     memcpy(dest.m_pchData, m_pchData + nCopyIndex, nCopyLen*sizeof(wxChar));
 900   }
 901   return true;
 902 }
 903
 904 #endif // !wxUSE_STL
 905
 906 #if !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
 907
 908 #if !wxUSE_STL
 909     #define STRINGCLASS wxStringBase
 910 #else
 911     #define STRINGCLASS wxString
 912 #endif
 913
 914 static inline int wxDoCmp(const wxChar* s1, size_t l1,
 915                           const wxChar* s2, size_t l2)
 916 {
 917     if( l1 == l2 )
 918         return wxTmemcmp(s1, s2, l1);
 919     else if( l1 < l2 )
 920     {
 921         int ret = wxTmemcmp(s1, s2, l1);
 922         return ret == 0 ? -1 : ret;
 923     }
 924     else
 925     {
 926         int ret = wxTmemcmp(s1, s2, l2);
 927         return ret == 0 ? +1 : ret;
 928     }
 929 }
 930
 931 int STRINGCLASS::compare(const wxStringBase& str) const
 932 {
 933     return ::wxDoCmp(data(), length(), str.data(), str.length());
 934 }
 935
 936 int STRINGCLASS::compare(size_t nStart, size_t nLen,
 937                          const wxStringBase& str) const
 938 {
 939     wxASSERT(nStart <= length());
 940     size_type strLen = length() - nStart;
 941     nLen = strLen < nLen ? strLen : nLen;
 942     return ::wxDoCmp(data() + nStart, nLen, str.data(), str.length());
 943 }
 944
 945 int STRINGCLASS::compare(size_t nStart, size_t nLen,
 946                          const wxStringBase& str,
 947                          size_t nStart2, size_t nLen2) const
 948 {
 949     wxASSERT(nStart <= length());
 950     wxASSERT(nStart2 <= str.length());
 951     size_type strLen  =     length() - nStart,
 952               strLen2 = str.length() - nStart2;
 953     nLen  = strLen  < nLen  ? strLen  : nLen;
 954     nLen2 = strLen2 < nLen2 ? strLen2 : nLen2;
 955     return ::wxDoCmp(data() + nStart, nLen, str.data() + nStart2, nLen2);
 956 }
 957
 958 int STRINGCLASS::compare(const wxChar* sz) const
 959 {
 960     size_t nLen = wxStrlen(sz);
 961     return ::wxDoCmp(data(), length(), sz, nLen);
 962 }
 963
 964 int STRINGCLASS::compare(size_t nStart, size_t nLen,
 965                          const wxChar* sz, size_t nCount) const
 966 {
 967     wxASSERT(nStart <= length());
 968     size_type strLen = length() - nStart;
 969     nLen = strLen < nLen ? strLen : nLen;
 970     if( nCount == npos )
 971         nCount = wxStrlen(sz);
 972
 973     return ::wxDoCmp(data() + nStart, nLen, sz, nCount);
 974 }
 975
 976 #undef STRINGCLASS
 977
 978 #endif // !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
 979
 980 // ===========================================================================
 981 // wxString class core
 982 // ===========================================================================
 983
 984 // ---------------------------------------------------------------------------
 985 // construction and conversion
 986 // ---------------------------------------------------------------------------
 987
 988 #if wxUSE_UNICODE
 989
 990 // from multibyte string
 991 wxString::wxString(const char *psz, const wxMBConv& conv, size_t nLength)
 992 {
 993     // anything to do?
 994     if ( psz && nLength != 0 )
 995     {
 996         if ( nLength == npos )
 997         {
 998             nLength = wxNO_LEN;
 999         }
1000
1001         size_t nLenWide;
1002         wxWCharBuffer wbuf = conv.cMB2WC(psz, nLength, &nLenWide);
1003
1004         if ( nLenWide )
1005             assign(wbuf, nLenWide);
1006     }
1007 }
1008
1009 //Convert wxString in Unicode mode to a multi-byte string
1010 const wxCharBuffer wxString::mb_str(const wxMBConv& conv) const
1011 {
1012     return conv.cWC2MB(c_str(), length() + 1 /* size, not length */, NULL);
1013 }
1014
1015 #else // ANSI
1016
1017 #if wxUSE_WCHAR_T
1018
1019 // from wide string
1020 wxString::wxString(const wchar_t *pwz, const wxMBConv& conv, size_t nLength)
1021 {
1022     // anything to do?
1023     if ( pwz && nLength != 0 )
1024     {
1025         if ( nLength == npos )
1026         {
1027             nLength = wxNO_LEN;
1028         }
1029
1030         size_t nLenMB;
1031         wxCharBuffer buf = conv.cWC2MB(pwz, nLength, &nLenMB);
1032
1033         if ( nLenMB )
1034             assign(buf, nLenMB);
1035     }
1036 }
1037
1038 //Converts this string to a wide character string if unicode
1039 //mode is not enabled and wxUSE_WCHAR_T is enabled
1040 const wxWCharBuffer wxString::wc_str(const wxMBConv& conv) const
1041 {
1042     return conv.cMB2WC(c_str(), length() + 1 /* size, not length */, NULL);
1043 }
1044
1045 #endif // wxUSE_WCHAR_T
1046
1047 #endif // Unicode/ANSI
1048
1049 // shrink to minimal size (releasing extra memory)
1050 bool wxString::Shrink()
1051 {
1052   wxString tmp(begin(), end());
1053   swap(tmp);
1054   return tmp.length() == length();
1055 }
1056
1057 #if !wxUSE_STL
1058 // get the pointer to writable buffer of (at least) nLen bytes
1059 wxChar *wxString::GetWriteBuf(size_t nLen)
1060 {
1061   if ( !AllocBeforeWrite(nLen) ) {
1062     // allocation failure handled by caller
1063     return NULL;
1064   }
1065
1066   wxASSERT( GetStringData()->nRefs == 1 );
1067   GetStringData()->Validate(false);
1068
1069   return m_pchData;
1070 }
1071
1072 // put string back in a reasonable state after GetWriteBuf
1073 void wxString::UngetWriteBuf()
1074 {
1075   GetStringData()->nDataLength = wxStrlen(m_pchData);
1076   GetStringData()->Validate(true);
1077 }
1078
1079 void wxString::UngetWriteBuf(size_t nLen)
1080 {
1081   GetStringData()->nDataLength = nLen;
1082   GetStringData()->Validate(true);
1083 }
1084 #endif
1085
1086 // ---------------------------------------------------------------------------
1087 // data access
1088 // ---------------------------------------------------------------------------
1089
1090 // all functions are inline in string.h
1091
1092 // ---------------------------------------------------------------------------
1093 // assignment operators
1094 // ---------------------------------------------------------------------------
1095
1096 #if !wxUSE_UNICODE
1097
1098 // same as 'signed char' variant
1099 wxString& wxString::operator=(const unsigned char* psz)
1100 {
1101   *this = (const char *)psz;
1102   return *this;
1103 }
1104
1105 #if wxUSE_WCHAR_T
1106 wxString& wxString::operator=(const wchar_t *pwz)
1107 {
1108   wxString str(pwz);
1109   swap(str);
1110   return *this;
1111 }
1112 #endif
1113
1114 #endif
1115
1116 /*
1117  * concatenation functions come in 5 flavours:
1118  *  string + string
1119  *  char   + string      and      string + char
1120  *  C str  + string      and      string + C str
1121  */
1122
1123 wxString operator+(const wxString& str1, const wxString& str2)
1124 {
1125 #if !wxUSE_STL
1126     wxASSERT( str1.GetStringData()->IsValid() );
1127     wxASSERT( str2.GetStringData()->IsValid() );
1128 #endif
1129
1130     wxString s = str1;
1131     s += str2;
1132
1133     return s;
1134 }
1135
1136 wxString operator+(const wxString& str, wxChar ch)
1137 {
1138 #if !wxUSE_STL
1139     wxASSERT( str.GetStringData()->IsValid() );
1140 #endif
1141
1142     wxString s = str;
1143     s += ch;
1144
1145     return s;
1146 }
1147
1148 wxString operator+(wxChar ch, const wxString& str)
1149 {
1150 #if !wxUSE_STL
1151     wxASSERT( str.GetStringData()->IsValid() );
1152 #endif
1153
1154     wxString s = ch;
1155     s += str;
1156
1157     return s;
1158 }
1159
1160 wxString operator+(const wxString& str, const wxChar *psz)
1161 {
1162 #if !wxUSE_STL
1163     wxASSERT( str.GetStringData()->IsValid() );
1164 #endif
1165
1166     wxString s;
1167     if ( !s.Alloc(wxStrlen(psz) + str.length()) ) {
1168         wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1169     }
1170     s += str;
1171     s += psz;
1172
1173     return s;
1174 }
1175
1176 wxString operator+(const wxChar *psz, const wxString& str)
1177 {
1178 #if !wxUSE_STL
1179     wxASSERT( str.GetStringData()->IsValid() );
1180 #endif
1181
1182     wxString s;
1183     if ( !s.Alloc(wxStrlen(psz) + str.length()) ) {
1184         wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1185     }
1186     s = psz;
1187     s += str;
1188
1189     return s;
1190 }
1191
1192 // ===========================================================================
1193 // other common string functions
1194 // ===========================================================================
1195
1196 int wxString::Cmp(const wxString& s) const
1197 {
1198     return compare(s);
1199 }
1200
1201 int wxString::Cmp(const wxChar* psz) const
1202 {
1203     return compare(psz);
1204 }
1205
1206 static inline int wxDoCmpNoCase(const wxChar* s1, size_t l1,
1207                                 const wxChar* s2, size_t l2)
1208 {
1209     size_t i;
1210
1211     if( l1 == l2 )
1212     {
1213         for(i = 0; i < l1; ++i)
1214         {
1215             if(wxTolower(s1[i]) != wxTolower(s2[i]))
1216                 break;
1217         }
1218         return i == l1 ? 0 : wxTolower(s1[i]) < wxTolower(s2[i]) ? -1 : 1;
1219     }
1220     else if( l1 < l2 )
1221     {
1222         for(i = 0; i < l1; ++i)
1223         {
1224             if(wxTolower(s1[i]) != wxTolower(s2[i]))
1225                 break;
1226         }
1227         return i == l1 ? -1 : wxTolower(s1[i]) < wxTolower(s2[i]) ? -1 : 1;
1228     }
1229     else
1230     {
1231         for(i = 0; i < l2; ++i)
1232         {
1233             if(wxTolower(s1[i]) != wxTolower(s2[i]))
1234                 break;
1235         }
1236         return i == l2 ? 1 : wxTolower(s1[i]) < wxTolower(s2[i]) ? -1 : 1;
1237     }
1238 }
1239
1240 int wxString::CmpNoCase(const wxString& s) const
1241 {
1242     return wxDoCmpNoCase(data(), length(), s.data(), s.length());
1243 }
1244
1245 int wxString::CmpNoCase(const wxChar* psz) const
1246 {
1247     int nLen = wxStrlen(psz);
1248
1249     return wxDoCmpNoCase(data(), length(), psz, nLen);
1250 }
1251
1252
1253 #if wxUSE_UNICODE
1254
1255 #ifdef __MWERKS__
1256 #ifndef __SCHAR_MAX__
1257 #define __SCHAR_MAX__ 127
1258 #endif
1259 #endif
1260
1261 wxString wxString::FromAscii(const char *ascii)
1262 {
1263     if (!ascii)
1264        return wxEmptyString;
1265
1266     size_t len = strlen( ascii );
1267     wxString res;
1268
1269     if ( len )
1270     {
1271         wxStringBuffer buf(res, len);
1272
1273         wchar_t *dest = buf;
1274
1275         for ( ;; )
1276         {
1277            if ( (*dest++ = (wchar_t)(unsigned char)*ascii++) == L'\0' )
1278                break;
1279         }
1280     }
1281
1282     return res;
1283 }
1284
1285 wxString wxString::FromAscii(const char ascii)
1286 {
1287     // What do we do with '\0' ?
1288
1289     wxString res;
1290     res += (wchar_t)(unsigned char) ascii;
1291
1292     return res;
1293 }
1294
1295 const wxCharBuffer wxString::ToAscii() const
1296 {
1297     // this will allocate enough space for the terminating NUL too
1298     wxCharBuffer buffer(length());
1299
1300
1301     char *dest = buffer.data();
1302
1303     const wchar_t *pwc = c_str();
1304     for ( ;; )
1305     {
1306         *dest++ = (char)(*pwc > SCHAR_MAX ? wxT('_') : *pwc);
1307
1308         // the output string can't have embedded NULs anyhow, so we can safely
1309         // stop at first of them even if we do have any
1310         if ( !*pwc++ )
1311             break;
1312     }
1313
1314     return buffer;
1315 }
1316
1317 #endif // Unicode
1318
1319 // extract string of length nCount starting at nFirst
1320 wxString wxString::Mid(size_t nFirst, size_t nCount) const
1321 {
1322     size_t nLen = length();
1323
1324     // default value of nCount is npos and means "till the end"
1325     if ( nCount == npos )
1326     {
1327         nCount = nLen - nFirst;
1328     }
1329
1330     // out-of-bounds requests return sensible things
1331     if ( nFirst + nCount > nLen )
1332     {
1333         nCount = nLen - nFirst;
1334     }
1335
1336     if ( nFirst > nLen )
1337     {
1338         // AllocCopy() will return empty string
1339         return wxEmptyString;
1340     }
1341
1342     wxString dest(*this, nFirst, nCount);
1343     if ( dest.length() != nCount )
1344     {
1345         wxFAIL_MSG( _T("out of memory in wxString::Mid") );
1346     }
1347
1348     return dest;
1349 }
1350
1351 // check that the string starts with prefix and return the rest of the string
1352 // in the provided pointer if it is not NULL, otherwise return false
1353 bool wxString::StartsWith(const wxChar *prefix, wxString *rest) const
1354 {
1355     wxASSERT_MSG( prefix, _T("invalid parameter in wxString::StartsWith") );
1356
1357     // first check if the beginning of the string matches the prefix: note
1358     // that we don't have to check that we don't run out of this string as
1359     // when we reach the terminating NUL, either prefix string ends too (and
1360     // then it's ok) or we break out of the loop because there is no match
1361     const wxChar *p = c_str();
1362     while ( *prefix )
1363     {
1364         if ( *prefix++ != *p++ )
1365         {
1366             // no match
1367             return false;
1368         }
1369     }
1370
1371     if ( rest )
1372     {
1373         // put the rest of the string into provided pointer
1374         *rest = p;
1375     }
1376
1377     return true;
1378 }
1379
1380
1381 // check that the string ends with suffix and return the rest of it in the
1382 // provided pointer if it is not NULL, otherwise return false
1383 bool wxString::EndsWith(const wxChar *suffix, wxString *rest) const
1384 {
1385     wxASSERT_MSG( suffix, _T("invalid parameter in wxString::EndssWith") );
1386
1387     int start = length() - wxStrlen(suffix);
1388     if ( start < 0 || wxStrcmp(c_str() + start, suffix) != 0 )
1389         return false;
1390
1391     if ( rest )
1392     {
1393         // put the rest of the string into provided pointer
1394         rest->assign(*this, 0, start);
1395     }
1396
1397     return true;
1398 }
1399
1400
1401 // extract nCount last (rightmost) characters
1402 wxString wxString::Right(size_t nCount) const
1403 {
1404   if ( nCount > length() )
1405     nCount = length();
1406
1407   wxString dest(*this, length() - nCount, nCount);
1408   if ( dest.length() != nCount ) {
1409     wxFAIL_MSG( _T("out of memory in wxString::Right") );
1410   }
1411   return dest;
1412 }
1413
1414 // get all characters after the last occurence of ch
1415 // (returns the whole string if ch not found)
1416 wxString wxString::AfterLast(wxChar ch) const
1417 {
1418   wxString str;
1419   int iPos = Find(ch, true);
1420   if ( iPos == wxNOT_FOUND )
1421     str = *this;
1422   else
1423     str = c_str() + iPos + 1;
1424
1425   return str;
1426 }
1427
1428 // extract nCount first (leftmost) characters
1429 wxString wxString::Left(size_t nCount) const
1430 {
1431   if ( nCount > length() )
1432     nCount = length();
1433
1434   wxString dest(*this, 0, nCount);
1435   if ( dest.length() != nCount ) {
1436     wxFAIL_MSG( _T("out of memory in wxString::Left") );
1437   }
1438   return dest;
1439 }
1440
1441 // get all characters before the first occurence of ch
1442 // (returns the whole string if ch not found)
1443 wxString wxString::BeforeFirst(wxChar ch) const
1444 {
1445   int iPos = Find(ch);
1446   if ( iPos == wxNOT_FOUND ) iPos = length();
1447   return wxString(*this, 0, iPos);
1448 }
1449
1450 /// get all characters before the last occurence of ch
1451 /// (returns empty string if ch not found)
1452 wxString wxString::BeforeLast(wxChar ch) const
1453 {
1454   wxString str;
1455   int iPos = Find(ch, true);
1456   if ( iPos != wxNOT_FOUND && iPos != 0 )
1457     str = wxString(c_str(), iPos);
1458
1459   return str;
1460 }
1461
1462 /// get all characters after the first occurence of ch
1463 /// (returns empty string if ch not found)
1464 wxString wxString::AfterFirst(wxChar ch) const
1465 {
1466   wxString str;
1467   int iPos = Find(ch);
1468   if ( iPos != wxNOT_FOUND )
1469     str = c_str() + iPos + 1;
1470
1471   return str;
1472 }
1473
1474 // replace first (or all) occurences of some substring with another one
1475 size_t wxString::Replace(const wxChar *szOld,
1476                   const wxChar *szNew, bool bReplaceAll)
1477 {
1478     // if we tried to replace an empty string we'd enter an infinite loop below
1479     wxCHECK_MSG( szOld && *szOld && szNew, 0,
1480                  _T("wxString::Replace(): invalid parameter") );
1481
1482     size_t uiCount = 0;   // count of replacements made
1483
1484     size_t uiOldLen = wxStrlen(szOld);
1485     size_t uiNewLen = wxStrlen(szNew);
1486
1487     size_t dwPos = 0;
1488
1489     while ( this->c_str()[dwPos] != wxT('\0') )
1490     {
1491         //DO NOT USE STRSTR HERE
1492         //this string can contain embedded null characters,
1493         //so strstr will function incorrectly
1494         dwPos = find(szOld, dwPos);
1495         if ( dwPos == npos )
1496             break;                  // exit the loop
1497         else
1498         {
1499             //replace this occurance of the old string with the new one
1500             replace(dwPos, uiOldLen, szNew, uiNewLen);
1501
1502             //move up pos past the string that was replaced
1503             dwPos += uiNewLen;
1504
1505             //increase replace count
1506             ++uiCount;
1507
1508             // stop now?
1509             if ( !bReplaceAll )
1510                 break;                  // exit the loop
1511         }
1512     }
1513
1514     return uiCount;
1515 }
1516
1517 bool wxString::IsAscii() const
1518 {
1519   const wxChar *s = (const wxChar*) *this;
1520   while(*s){
1521     if(!isascii(*s)) return(false);
1522     s++;
1523   }
1524   return(true);
1525 }
1526
1527 bool wxString::IsWord() const
1528 {
1529   const wxChar *s = (const wxChar*) *this;
1530   while(*s){
1531     if(!wxIsalpha(*s)) return(false);
1532     s++;
1533   }
1534   return(true);
1535 }
1536
1537 bool wxString::IsNumber() const
1538 {
1539   const wxChar *s = (const wxChar*) *this;
1540   if (wxStrlen(s))
1541      if ((s[0] == wxT('-')) || (s[0] == wxT('+'))) s++;
1542   while(*s){
1543     if(!wxIsdigit(*s)) return(false);
1544     s++;
1545   }
1546   return(true);
1547 }
1548
1549 wxString wxString::Strip(stripType w) const
1550 {
1551     wxString s = *this;
1552     if ( w & leading ) s.Trim(false);
1553     if ( w & trailing ) s.Trim(true);
1554     return s;
1555 }
1556
1557 // ---------------------------------------------------------------------------
1558 // case conversion
1559 // ---------------------------------------------------------------------------
1560
1561 wxString& wxString::MakeUpper()
1562 {
1563   for ( iterator it = begin(), en = end(); it != en; ++it )
1564     *it = (wxChar)wxToupper(*it);
1565
1566   return *this;
1567 }
1568
1569 wxString& wxString::MakeLower()
1570 {
1571   for ( iterator it = begin(), en = end(); it != en; ++it )
1572     *it = (wxChar)wxTolower(*it);
1573
1574   return *this;
1575 }
1576
1577 // ---------------------------------------------------------------------------
1578 // trimming and padding
1579 // ---------------------------------------------------------------------------
1580
1581 // some compilers (VC++ 6.0 not to name them) return true for a call to
1582 // isspace('ê') in the C locale which seems to be broken to me, but we have to
1583 // live with this by checking that the character is a 7 bit one - even if this
1584 // may fail to detect some spaces (I don't know if Unicode doesn't have
1585 // space-like symbols somewhere except in the first 128 chars), it is arguably
1586 // still better than trimming away accented letters
1587 inline int wxSafeIsspace(wxChar ch) { return (ch < 127) && wxIsspace(ch); }
1588
1589 // trims spaces (in the sense of isspace) from left or right side
1590 wxString& wxString::Trim(bool bFromRight)
1591 {
1592     // first check if we're going to modify the string at all
1593     if ( !empty() &&
1594          (
1595           (bFromRight && wxSafeIsspace(GetChar(length() - 1))) ||
1596           (!bFromRight && wxSafeIsspace(GetChar(0u)))
1597          )
1598        )
1599     {
1600         if ( bFromRight )
1601         {
1602             // find last non-space character
1603             reverse_iterator psz = rbegin();
1604             while ( (psz != rend()) && wxSafeIsspace(*psz) )
1605                 psz++;
1606
1607             // truncate at trailing space start
1608             erase(psz.base(), end());
1609         }
1610         else
1611         {
1612             // find first non-space character
1613             iterator psz = begin();
1614             while ( (psz != end()) && wxSafeIsspace(*psz) )
1615                 psz++;
1616
1617             // fix up data and length
1618             erase(begin(), psz);
1619         }
1620     }
1621
1622     return *this;
1623 }
1624
1625 // adds nCount characters chPad to the string from either side
1626 wxString& wxString::Pad(size_t nCount, wxChar chPad, bool bFromRight)
1627 {
1628     wxString s(chPad, nCount);
1629
1630     if ( bFromRight )
1631         *this += s;
1632     else
1633     {
1634         s += *this;
1635         swap(s);
1636     }
1637
1638     return *this;
1639 }
1640
1641 // truncate the string
1642 wxString& wxString::Truncate(size_t uiLen)
1643 {
1644     if ( uiLen < length() )
1645     {
1646         erase(begin() + uiLen, end());
1647     }
1648     //else: nothing to do, string is already short enough
1649
1650     return *this;
1651 }
1652
1653 // ---------------------------------------------------------------------------
1654 // finding (return wxNOT_FOUND if not found and index otherwise)
1655 // ---------------------------------------------------------------------------
1656
1657 // find a character
1658 int wxString::Find(wxChar ch, bool bFromEnd) const
1659 {
1660     size_type idx = bFromEnd ? find_last_of(ch) : find_first_of(ch);
1661
1662     return (idx == npos) ? wxNOT_FOUND : (int)idx;
1663 }
1664
1665 // find a sub-string (like strstr)
1666 int wxString::Find(const wxChar *pszSub) const
1667 {
1668     size_type idx = find(pszSub);
1669
1670     return (idx == npos) ? wxNOT_FOUND : (int)idx;
1671 }
1672
1673 // ----------------------------------------------------------------------------
1674 // conversion to numbers
1675 // ----------------------------------------------------------------------------
1676
1677 bool wxString::ToLong(long *val, int base) const
1678 {
1679     wxCHECK_MSG( val, false, _T("NULL pointer in wxString::ToLong") );
1680     wxASSERT_MSG( !base || (base > 1 && base <= 36), _T("invalid base") );
1681
1682     const wxChar *start = c_str();
1683     wxChar *end;
1684     *val = wxStrtol(start, &end, base);
1685
1686     // return true only if scan was stopped by the terminating NUL and if the
1687     // string was not empty to start with
1688     return !*end && (end != start);
1689 }
1690
1691 bool wxString::ToULong(unsigned long *val, int base) const
1692 {
1693     wxCHECK_MSG( val, false, _T("NULL pointer in wxString::ToULong") );
1694     wxASSERT_MSG( !base || (base > 1 && base <= 36), _T("invalid base") );
1695
1696     const wxChar *start = c_str();
1697     wxChar *end;
1698     *val = wxStrtoul(start, &end, base);
1699
1700     // return true only if scan was stopped by the terminating NUL and if the
1701     // string was not empty to start with
1702     return !*end && (end != start);
1703 }
1704
1705 bool wxString::ToDouble(double *val) const
1706 {
1707     wxCHECK_MSG( val, false, _T("NULL pointer in wxString::ToDouble") );
1708
1709     const wxChar *start = c_str();
1710     wxChar *end;
1711     *val = wxStrtod(start, &end);
1712
1713     // return true only if scan was stopped by the terminating NUL and if the
1714     // string was not empty to start with
1715     return !*end && (end != start);
1716 }
1717
1718 // ---------------------------------------------------------------------------
1719 // formatted output
1720 // ---------------------------------------------------------------------------
1721
1722 /* static */
1723 wxString wxString::Format(const wxChar *pszFormat, ...)
1724 {
1725     va_list argptr;
1726     va_start(argptr, pszFormat);
1727
1728     wxString s;
1729     s.PrintfV(pszFormat, argptr);
1730
1731     va_end(argptr);
1732
1733     return s;
1734 }
1735
1736 /* static */
1737 wxString wxString::FormatV(const wxChar *pszFormat, va_list argptr)
1738 {
1739     wxString s;
1740     s.PrintfV(pszFormat, argptr);
1741     return s;
1742 }
1743
1744 int wxString::Printf(const wxChar *pszFormat, ...)
1745 {
1746     va_list argptr;
1747     va_start(argptr, pszFormat);
1748
1749     int iLen = PrintfV(pszFormat, argptr);
1750
1751     va_end(argptr);
1752
1753     return iLen;
1754 }
1755
1756 int wxString::PrintfV(const wxChar* pszFormat, va_list argptr)
1757 {
1758     int size = 1024;
1759
1760     for ( ;; )
1761     {
1762         wxStringBuffer tmp(*this, size + 1);
1763         wxChar *buf = tmp;
1764
1765         if ( !buf )
1766         {
1767             // out of memory
1768             return -1;
1769         }
1770
1771         // wxVsnprintf() may modify the original arg pointer, so pass it
1772         // only a copy
1773         va_list argptrcopy;
1774         wxVaCopy(argptrcopy, argptr);
1775         int len = wxVsnprintf(buf, size, pszFormat, argptrcopy);
1776         va_end(argptrcopy);
1777
1778         // some implementations of vsnprintf() don't NUL terminate
1779         // the string if there is not enough space for it so
1780         // always do it manually
1781         buf[size] = _T('\0');
1782
1783         // vsnprintf() may return either -1 (traditional Unix behaviour) or the
1784         // total number of characters which would have been written if the
1785         // buffer were large enough (newer standards such as Unix98)
1786         if ( len < 0 )
1787         {
1788             // still not enough, as we don't know how much we need, double the
1789             // current size of the buffer
1790             size *= 2;
1791         }
1792         else if ( len > size )
1793         {
1794             size = len;
1795         }
1796         else // ok, there was enough space
1797         {
1798             break;
1799         }
1800     }
1801
1802     // we could have overshot
1803     Shrink();
1804
1805     return length();
1806 }
1807
1808 // ----------------------------------------------------------------------------
1809 // misc other operations
1810 // ----------------------------------------------------------------------------
1811
1812 // returns true if the string matches the pattern which may contain '*' and
1813 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1814 // of them)
1815 bool wxString::Matches(const wxChar *pszMask) const
1816 {
1817     // I disable this code as it doesn't seem to be faster (in fact, it seems
1818     // to be much slower) than the old, hand-written code below and using it
1819     // here requires always linking with libregex even if the user code doesn't
1820     // use it
1821 #if 0 // wxUSE_REGEX
1822     // first translate the shell-like mask into a regex
1823     wxString pattern;
1824     pattern.reserve(wxStrlen(pszMask));
1825
1826     pattern += _T('^');
1827     while ( *pszMask )
1828     {
1829         switch ( *pszMask )
1830         {
1831             case _T('?'):
1832                 pattern += _T('.');
1833                 break;
1834
1835             case _T('*'):
1836                 pattern += _T(".*");
1837                 break;
1838
1839             case _T('^'):
1840             case _T('.'):
1841             case _T('$'):
1842             case _T('('):
1843             case _T(')'):
1844             case _T('|'):
1845             case _T('+'):
1846             case _T('\\'):
1847                 // these characters are special in a RE, quote them
1848                 // (however note that we don't quote '[' and ']' to allow
1849                 // using them for Unix shell like matching)
1850                 pattern += _T('\\');
1851                 // fall through
1852
1853             default:
1854                 pattern += *pszMask;
1855         }
1856
1857         pszMask++;
1858     }
1859     pattern += _T('$');
1860
1861     // and now use it
1862     return wxRegEx(pattern, wxRE_NOSUB | wxRE_EXTENDED).Matches(c_str());
1863 #else // !wxUSE_REGEX
1864   // TODO: this is, of course, awfully inefficient...
1865
1866   // the char currently being checked
1867   const wxChar *pszTxt = c_str();
1868
1869   // the last location where '*' matched
1870   const wxChar *pszLastStarInText = NULL;
1871   const wxChar *pszLastStarInMask = NULL;
1872
1873 match:
1874   for ( ; *pszMask != wxT('\0'); pszMask++, pszTxt++ ) {
1875     switch ( *pszMask ) {
1876       case wxT('?'):
1877         if ( *pszTxt == wxT('\0') )
1878           return false;
1879
1880         // pszTxt and pszMask will be incremented in the loop statement
1881
1882         break;
1883
1884       case wxT('*'):
1885         {
1886           // remember where we started to be able to backtrack later
1887           pszLastStarInText = pszTxt;
1888           pszLastStarInMask = pszMask;
1889
1890           // ignore special chars immediately following this one
1891           // (should this be an error?)
1892           while ( *pszMask == wxT('*') || *pszMask == wxT('?') )
1893             pszMask++;
1894
1895           // if there is nothing more, match
1896           if ( *pszMask == wxT('\0') )
1897             return true;
1898
1899           // are there any other metacharacters in the mask?
1900           size_t uiLenMask;
1901           const wxChar *pEndMask = wxStrpbrk(pszMask, wxT("*?"));
1902
1903           if ( pEndMask != NULL ) {
1904             // we have to match the string between two metachars
1905             uiLenMask = pEndMask - pszMask;
1906           }
1907           else {
1908             // we have to match the remainder of the string
1909             uiLenMask = wxStrlen(pszMask);
1910           }
1911
1912           wxString strToMatch(pszMask, uiLenMask);
1913           const wxChar* pMatch = wxStrstr(pszTxt, strToMatch);
1914           if ( pMatch == NULL )
1915             return false;
1916
1917           // -1 to compensate "++" in the loop
1918           pszTxt = pMatch + uiLenMask - 1;
1919           pszMask += uiLenMask - 1;
1920         }
1921         break;
1922
1923       default:
1924         if ( *pszMask != *pszTxt )
1925           return false;
1926         break;
1927     }
1928   }
1929
1930   // match only if nothing left
1931   if ( *pszTxt == wxT('\0') )
1932     return true;
1933
1934   // if we failed to match, backtrack if we can
1935   if ( pszLastStarInText ) {
1936     pszTxt = pszLastStarInText + 1;
1937     pszMask = pszLastStarInMask;
1938
1939     pszLastStarInText = NULL;
1940
1941     // don't bother resetting pszLastStarInMask, it's unnecessary
1942
1943     goto match;
1944   }
1945
1946   return false;
1947 #endif // wxUSE_REGEX/!wxUSE_REGEX
1948 }
1949
1950 // Count the number of chars
1951 int wxString::Freq(wxChar ch) const
1952 {
1953     int count = 0;
1954     int len = length();
1955     for (int i = 0; i < len; i++)
1956     {
1957         if (GetChar(i) == ch)
1958             count ++;
1959     }
1960     return count;
1961 }
1962
1963 // convert to upper case, return the copy of the string
1964 wxString wxString::Upper() const
1965 { wxString s(*this); return s.MakeUpper(); }
1966
1967 // convert to lower case, return the copy of the string
1968 wxString wxString::Lower() const { wxString s(*this); return s.MakeLower(); }
1969
1970 int wxString::sprintf(const wxChar *pszFormat, ...)
1971   {
1972     va_list argptr;
1973     va_start(argptr, pszFormat);
1974     int iLen = PrintfV(pszFormat, argptr);
1975     va_end(argptr);
1976     return iLen;
1977   }
1978
1979 // ============================================================================
1980 // ArrayString
1981 // ============================================================================
1982
1983 #include "wx/arrstr.h"
1984
1985 wxArrayString::wxArrayString(size_t sz, const wxChar** a)
1986 {
1987 #if !wxUSE_STL
1988     Init(false);
1989 #endif
1990     for (size_t i=0; i < sz; i++)
1991         Add(a[i]);
1992 }
1993
1994 wxArrayString::wxArrayString(size_t sz, const wxString* a)
1995 {
1996 #if !wxUSE_STL
1997     Init(false);
1998 #endif
1999     for (size_t i=0; i < sz; i++)
2000         Add(a[i]);
2001 }
2002
2003 #if !wxUSE_STL
2004
2005 // size increment = min(50% of current size, ARRAY_MAXSIZE_INCREMENT)
2006 #define   ARRAY_MAXSIZE_INCREMENT       4096
2007
2008 #ifndef   ARRAY_DEFAULT_INITIAL_SIZE    // also defined in dynarray.h
2009 #define   ARRAY_DEFAULT_INITIAL_SIZE    (16)
2010 #endif
2011
2012 #define   STRING(p)   ((wxString *)(&(p)))
2013
2014 // ctor
2015 void wxArrayString::Init(bool autoSort)
2016 {
2017   m_nSize  =
2018   m_nCount = 0;
2019   m_pItems = (wxChar **) NULL;
2020   m_autoSort = autoSort;
2021 }
2022
2023 // copy ctor
2024 wxArrayString::wxArrayString(const wxArrayString& src)
2025 {
2026   Init(src.m_autoSort);
2027
2028   *this = src;
2029 }
2030
2031 // assignment operator
2032 wxArrayString& wxArrayString::operator=(const wxArrayString& src)
2033 {
2034   if ( m_nSize > 0 )
2035     Clear();
2036
2037   Copy(src);
2038
2039   m_autoSort = src.m_autoSort;
2040
2041   return *this;
2042 }
2043
2044 void wxArrayString::Copy(const wxArrayString& src)
2045 {
2046   if ( src.m_nCount > ARRAY_DEFAULT_INITIAL_SIZE )
2047     Alloc(src.m_nCount);
2048
2049   for ( size_t n = 0; n < src.m_nCount; n++ )
2050     Add(src[n]);
2051 }
2052
2053 // grow the array
2054 void wxArrayString::Grow(size_t nIncrement)
2055 {
2056   // only do it if no more place
2057   if ( (m_nSize - m_nCount) < nIncrement ) {
2058     // if ARRAY_DEFAULT_INITIAL_SIZE were set to 0, the initially empty would
2059     // be never resized!
2060     #if ARRAY_DEFAULT_INITIAL_SIZE == 0
2061       #error "ARRAY_DEFAULT_INITIAL_SIZE must be > 0!"
2062     #endif
2063
2064     if ( m_nSize == 0 ) {
2065       // was empty, alloc some memory
2066       m_nSize = ARRAY_DEFAULT_INITIAL_SIZE;
2067       if (m_nSize < nIncrement)
2068           m_nSize = nIncrement;
2069       m_pItems = new wxChar *[m_nSize];
2070     }
2071     else {
2072       // otherwise when it's called for the first time, nIncrement would be 0
2073       // and the array would never be expanded
2074       // add 50% but not too much
2075       size_t ndefIncrement = m_nSize < ARRAY_DEFAULT_INITIAL_SIZE
2076                           ? ARRAY_DEFAULT_INITIAL_SIZE : m_nSize >> 1;
2077       if ( ndefIncrement > ARRAY_MAXSIZE_INCREMENT )
2078         ndefIncrement = ARRAY_MAXSIZE_INCREMENT;
2079       if ( nIncrement < ndefIncrement )
2080         nIncrement = ndefIncrement;
2081       m_nSize += nIncrement;
2082       wxChar **pNew = new wxChar *[m_nSize];
2083
2084       // copy data to new location
2085       memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
2086
2087       // delete old memory (but do not release the strings!)
2088       wxDELETEA(m_pItems);
2089
2090       m_pItems = pNew;
2091     }
2092   }
2093 }
2094
2095 void wxArrayString::Free()
2096 {
2097   for ( size_t n = 0; n < m_nCount; n++ ) {
2098     STRING(m_pItems[n])->GetStringData()->Unlock();
2099   }
2100 }
2101
2102 // deletes all the strings from the list
2103 void wxArrayString::Empty()
2104 {
2105   Free();
2106
2107   m_nCount = 0;
2108 }
2109
2110 // as Empty, but also frees memory
2111 void wxArrayString::Clear()
2112 {
2113   Free();
2114
2115   m_nSize  =
2116   m_nCount = 0;
2117
2118   wxDELETEA(m_pItems);
2119 }
2120
2121 // dtor
2122 wxArrayString::~wxArrayString()
2123 {
2124   Free();
2125
2126   wxDELETEA(m_pItems);
2127 }
2128
2129 void wxArrayString::reserve(size_t nSize)
2130 {
2131     Alloc(nSize);
2132 }
2133
2134 // pre-allocates memory (frees the previous data!)
2135 void wxArrayString::Alloc(size_t nSize)
2136 {
2137   // only if old buffer was not big enough
2138   if ( nSize > m_nSize ) {
2139     Free();
2140     wxDELETEA(m_pItems);
2141     m_pItems = new wxChar *[nSize];
2142     m_nSize  = nSize;
2143   }
2144
2145   m_nCount = 0;
2146 }
2147
2148 // minimizes the memory usage by freeing unused memory
2149 void wxArrayString::Shrink()
2150 {
2151   // only do it if we have some memory to free
2152   if( m_nCount < m_nSize ) {
2153     // allocates exactly as much memory as we need
2154     wxChar **pNew = new wxChar *[m_nCount];
2155
2156     // copy data to new location
2157     memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
2158     delete [] m_pItems;
2159     m_pItems = pNew;
2160   }
2161 }
2162
2163 #if WXWIN_COMPATIBILITY_2_4
2164
2165 // return a wxString[] as required for some control ctors.
2166 wxString* wxArrayString::GetStringArray() const
2167 {
2168     wxString *array = 0;
2169
2170     if( m_nCount > 0 )
2171     {
2172         array = new wxString[m_nCount];
2173         for( size_t i = 0; i < m_nCount; i++ )
2174             array[i] = m_pItems[i];
2175     }
2176
2177     return array;
2178 }
2179
2180 void wxArrayString::Remove(size_t nIndex, size_t nRemove)
2181 {
2182     RemoveAt(nIndex, nRemove);
2183 }
2184
2185 #endif // WXWIN_COMPATIBILITY_2_4
2186
2187 // searches the array for an item (forward or backwards)
2188 int wxArrayString::Index(const wxChar *sz, bool bCase, bool bFromEnd) const
2189 {
2190   if ( m_autoSort ) {
2191     // use binary search in the sorted array
2192     wxASSERT_MSG( bCase && !bFromEnd,
2193                   wxT("search parameters ignored for auto sorted array") );
2194
2195     size_t i,
2196            lo = 0,
2197            hi = m_nCount;
2198     int res;
2199     while ( lo < hi ) {
2200       i = (lo + hi)/2;
2201
2202       res = wxStrcmp(sz, m_pItems[i]);
2203       if ( res < 0 )
2204         hi = i;
2205       else if ( res > 0 )
2206         lo = i + 1;
2207       else
2208         return i;
2209     }
2210
2211     return wxNOT_FOUND;
2212   }
2213   else {
2214     // use linear search in unsorted array
2215     if ( bFromEnd ) {
2216       if ( m_nCount > 0 ) {
2217         size_t ui = m_nCount;
2218         do {
2219           if ( STRING(m_pItems[--ui])->IsSameAs(sz, bCase) )
2220             return ui;
2221         }
2222         while ( ui != 0 );
2223       }
2224     }
2225     else {
2226       for( size_t ui = 0; ui < m_nCount; ui++ ) {
2227         if( STRING(m_pItems[ui])->IsSameAs(sz, bCase) )
2228           return ui;
2229       }
2230     }
2231   }
2232
2233   return wxNOT_FOUND;
2234 }
2235
2236 // add item at the end
2237 size_t wxArrayString::Add(const wxString& str, size_t nInsert)
2238 {
2239   if ( m_autoSort ) {
2240     // insert the string at the correct position to keep the array sorted
2241     size_t i,
2242            lo = 0,
2243            hi = m_nCount;
2244     int res;
2245     while ( lo < hi ) {
2246       i = (lo + hi)/2;
2247
2248       res = str.Cmp(m_pItems[i]);
2249       if ( res < 0 )
2250         hi = i;
2251       else if ( res > 0 )
2252         lo = i + 1;
2253       else {
2254         lo = hi = i;
2255         break;
2256       }
2257     }
2258
2259     wxASSERT_MSG( lo == hi, wxT("binary search broken") );
2260
2261     Insert(str, lo, nInsert);
2262
2263     return (size_t)lo;
2264   }
2265   else {
2266     wxASSERT( str.GetStringData()->IsValid() );
2267
2268     Grow(nInsert);
2269
2270     for (size_t i = 0; i < nInsert; i++)
2271     {
2272         // the string data must not be deleted!
2273         str.GetStringData()->Lock();
2274
2275         // just append
2276         m_pItems[m_nCount + i] = (wxChar *)str.c_str(); // const_cast
2277     }
2278     size_t ret = m_nCount;
2279     m_nCount += nInsert;
2280     return ret;
2281   }
2282 }
2283
2284 // add item at the given position
2285 void wxArrayString::Insert(const wxString& str, size_t nIndex, size_t nInsert)
2286 {
2287   wxASSERT( str.GetStringData()->IsValid() );
2288
2289   wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArrayString::Insert") );
2290   wxCHECK_RET( m_nCount <= m_nCount + nInsert,
2291                wxT("array size overflow in wxArrayString::Insert") );
2292
2293   Grow(nInsert);
2294
2295   memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex],
2296           (m_nCount - nIndex)*sizeof(wxChar *));
2297
2298   for (size_t i = 0; i < nInsert; i++)
2299   {
2300       str.GetStringData()->Lock();
2301       m_pItems[nIndex + i] = (wxChar *)str.c_str();
2302   }
2303   m_nCount += nInsert;
2304 }
2305
2306 // range insert (STL 23.2.4.3)
2307 void
2308 wxArrayString::insert(iterator it, const_iterator first, const_iterator last)
2309 {
2310     const int idx = it - begin();
2311
2312     // grow it once
2313     Grow(last - first);
2314
2315     // reset "it" since it can change inside Grow()
2316     it = begin() + idx;
2317
2318     while ( first != last )
2319     {
2320         it = insert(it, *first);
2321
2322         // insert returns an iterator to the last element inserted but we need
2323         // insert the next after this one, that is before the next one
2324         ++it;
2325
2326         ++first;
2327     }
2328 }
2329
2330 // expand the array
2331 void wxArrayString::SetCount(size_t count)
2332 {
2333     Alloc(count);
2334
2335     wxString s;
2336     while ( m_nCount < count )
2337         m_pItems[m_nCount++] = (wxChar *)s.c_str();
2338 }
2339
2340 // removes item from array (by index)
2341 void wxArrayString::RemoveAt(size_t nIndex, size_t nRemove)
2342 {
2343   wxCHECK_RET( nIndex < m_nCount, wxT("bad index in wxArrayString::Remove") );
2344   wxCHECK_RET( nIndex + nRemove <= m_nCount,
2345                wxT("removing too many elements in wxArrayString::Remove") );
2346
2347   // release our lock
2348   for (size_t i = 0; i < nRemove; i++)
2349       Item(nIndex + i).GetStringData()->Unlock();
2350
2351   memmove(&m_pItems[nIndex], &m_pItems[nIndex + nRemove],
2352           (m_nCount - nIndex - nRemove)*sizeof(wxChar *));
2353   m_nCount -= nRemove;
2354 }
2355
2356 // removes item from array (by value)
2357 void wxArrayString::Remove(const wxChar *sz)
2358 {
2359   int iIndex = Index(sz);
2360
2361   wxCHECK_RET( iIndex != wxNOT_FOUND,
2362                wxT("removing inexistent element in wxArrayString::Remove") );
2363
2364   RemoveAt(iIndex);
2365 }
2366
2367 void wxArrayString::assign(const_iterator first, const_iterator last)
2368 {
2369     reserve(last - first);
2370     for(; first != last; ++first)
2371         push_back(*first);
2372 }
2373
2374 // ----------------------------------------------------------------------------
2375 // sorting
2376 // ----------------------------------------------------------------------------
2377
2378 // we can only sort one array at a time with the quick-sort based
2379 // implementation
2380 #if wxUSE_THREADS
2381   // need a critical section to protect access to gs_compareFunction and
2382   // gs_sortAscending variables
2383   static wxCriticalSection gs_critsectStringSort;
2384 #endif // wxUSE_THREADS
2385
2386 // function to use for string comparaison
2387 static wxArrayString::CompareFunction gs_compareFunction = NULL;
2388
2389 // if we don't use the compare function, this flag tells us if we sort the
2390 // array in ascending or descending order
2391 static bool gs_sortAscending = true;
2392
2393 // function which is called by quick sort
2394 extern "C" int wxC_CALLING_CONV     // LINKAGEMODE
2395 wxStringCompareFunction(const void *first, const void *second)
2396 {
2397   wxString *strFirst = (wxString *)first;
2398   wxString *strSecond = (wxString *)second;
2399
2400   if ( gs_compareFunction ) {
2401     return gs_compareFunction(*strFirst, *strSecond);
2402   }
2403   else {
2404     // maybe we should use wxStrcoll
2405     int result = strFirst->Cmp(*strSecond);
2406
2407     return gs_sortAscending ? result : -result;
2408   }
2409 }
2410
2411 // sort array elements using passed comparaison function
2412 void wxArrayString::Sort(CompareFunction compareFunction)
2413 {
2414   wxCRIT_SECT_LOCKER(lockCmpFunc, gs_critsectStringSort);
2415
2416   wxASSERT( !gs_compareFunction );  // must have been reset to NULL
2417   gs_compareFunction = compareFunction;
2418
2419   DoSort();
2420
2421   // reset it to NULL so that Sort(bool) will work the next time
2422   gs_compareFunction = NULL;
2423 }
2424
2425 extern "C"
2426 {
2427     typedef int (wxC_CALLING_CONV * wxStringCompareFn)(const void *first,
2428                                                        const void *second);
2429 }
2430
2431 void wxArrayString::Sort(CompareFunction2 compareFunction)
2432 {
2433   qsort(m_pItems, m_nCount, sizeof(wxChar *), (wxStringCompareFn)compareFunction);
2434 }
2435
2436 void wxArrayString::Sort(bool reverseOrder)
2437 {
2438   Sort(reverseOrder ? wxStringSortDescending : wxStringSortAscending);
2439 }
2440
2441 void wxArrayString::DoSort()
2442 {
2443   wxCHECK_RET( !m_autoSort, wxT("can't use this method with sorted arrays") );
2444
2445   // just sort the pointers using qsort() - of course it only works because
2446   // wxString() *is* a pointer to its data
2447   qsort(m_pItems, m_nCount, sizeof(wxChar *), wxStringCompareFunction);
2448 }
2449
2450 bool wxArrayString::operator==(const wxArrayString& a) const
2451 {
2452     if ( m_nCount != a.m_nCount )
2453         return false;
2454
2455     for ( size_t n = 0; n < m_nCount; n++ )
2456     {
2457         if ( Item(n) != a[n] )
2458             return false;
2459     }
2460
2461     return true;
2462 }
2463
2464 #endif // !wxUSE_STL
2465
2466 int wxCMPFUNC_CONV wxStringSortAscending(wxString* s1, wxString* s2)
2467 {
2468     return  s1->Cmp(*s2);
2469 }
2470
2471 int wxCMPFUNC_CONV wxStringSortDescending(wxString* s1, wxString* s2)
2472 {
2473     return -s1->Cmp(*s2);
2474 }