]> git.saurik.com Git - wxWidgets.git/blob - src/common/string.cpp
projects / wxWidgets.git / blob
? search:


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