]>
Commit | Line | Data |
---|---|---|
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 licence | |
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 | // allocating extra space for each string consumes more memory but speeds up | |
50 | // the concatenation operations (nLen is the current string's length) | |
51 | // NB: EXTRA_ALLOC must be >= 0! | |
52 | #define EXTRA_ALLOC (19 - nLen % 16) | |
53 | ||
54 | // --------------------------------------------------------------------------- | |
55 | // static class variables definition | |
56 | // --------------------------------------------------------------------------- | |
57 | ||
58 | #if defined(__VISAGECPP__) && __IBMCPP__ >= 400 | |
59 | // must define this static for VA or else you get multiply defined symbols | |
60 | // everywhere | |
61 | const unsigned int wxSTRING_MAXLEN = UINT_MAX - 100; | |
62 | #endif // Visual Age | |
63 | ||
64 | #ifdef wxSTD_STRING_COMPATIBILITY | |
65 | const size_t wxString::npos = wxSTRING_MAXLEN; | |
66 | #endif // wxSTD_STRING_COMPATIBILITY | |
67 | ||
68 | // ---------------------------------------------------------------------------- | |
69 | // static data | |
70 | // ---------------------------------------------------------------------------- | |
71 | ||
72 | // for an empty string, GetStringData() will return this address: this | |
73 | // structure has the same layout as wxStringData and it's data() method will | |
74 | // return the empty string (dummy pointer) | |
75 | static const struct | |
76 | { | |
77 | wxStringData data; | |
78 | wxChar dummy; | |
79 | } g_strEmpty = { {-1, 0, 0}, wxT('\0') }; | |
80 | ||
81 | // empty C style string: points to 'string data' byte of g_strEmpty | |
82 | extern const wxChar WXDLLIMPEXP_BASE *wxEmptyString = &g_strEmpty.dummy; | |
83 | ||
84 | // ---------------------------------------------------------------------------- | |
85 | // global functions | |
86 | // ---------------------------------------------------------------------------- | |
87 | ||
88 | #if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM | |
89 | ||
90 | // MS Visual C++ version 5.0 provides the new STL headers as well as the old | |
91 | // iostream ones. | |
92 | // | |
93 | // ATTN: you can _not_ use both of these in the same program! | |
94 | ||
95 | wxSTD istream& operator>>(wxSTD istream& is, wxString& WXUNUSED(str)) | |
96 | { | |
97 | #if 0 | |
98 | int w = is.width(0); | |
99 | if ( is.ipfx(0) ) { | |
100 | streambuf *sb = is.rdbuf(); | |
101 | str.erase(); | |
102 | while ( true ) { | |
103 | int ch = sb->sbumpc (); | |
104 | if ( ch == EOF ) { | |
105 | is.setstate(ios::eofbit); | |
106 | break; | |
107 | } | |
108 | else if ( isspace(ch) ) { | |
109 | sb->sungetc(); | |
110 | break; | |
111 | } | |
112 | ||
113 | str += ch; | |
114 | if ( --w == 1 ) | |
115 | break; | |
116 | } | |
117 | } | |
118 | ||
119 | is.isfx(); | |
120 | if ( str.length() == 0 ) | |
121 | is.setstate(ios::failbit); | |
122 | #endif | |
123 | return is; | |
124 | } | |
125 | ||
126 | wxSTD ostream& operator<<(wxSTD ostream& os, const wxString& str) | |
127 | { | |
128 | os << str.c_str(); | |
129 | return os; | |
130 | } | |
131 | ||
132 | #endif //std::string compatibility | |
133 | ||
134 | // ---------------------------------------------------------------------------- | |
135 | // private classes | |
136 | // ---------------------------------------------------------------------------- | |
137 | ||
138 | // this small class is used to gather statistics for performance tuning | |
139 | //#define WXSTRING_STATISTICS | |
140 | #ifdef WXSTRING_STATISTICS | |
141 | class Averager | |
142 | { | |
143 | public: | |
144 | Averager(const wxChar *sz) { m_sz = sz; m_nTotal = m_nCount = 0; } | |
145 | ~Averager() | |
146 | { wxPrintf("wxString: average %s = %f\n", m_sz, ((float)m_nTotal)/m_nCount); } | |
147 | ||
148 | void Add(size_t n) { m_nTotal += n; m_nCount++; } | |
149 | ||
150 | private: | |
151 | size_t m_nCount, m_nTotal; | |
152 | const wxChar *m_sz; | |
153 | } g_averageLength("allocation size"), | |
154 | g_averageSummandLength("summand length"), | |
155 | g_averageConcatHit("hit probability in concat"), | |
156 | g_averageInitialLength("initial string length"); | |
157 | ||
158 | #define STATISTICS_ADD(av, val) g_average##av.Add(val) | |
159 | #else | |
160 | #define STATISTICS_ADD(av, val) | |
161 | #endif // WXSTRING_STATISTICS | |
162 | ||
163 | // =========================================================================== | |
164 | // wxStringData class deallocation | |
165 | // =========================================================================== | |
166 | ||
167 | #if defined(__VISUALC__) && defined(_MT) && !defined(_DLL) | |
168 | # pragma message (__FILE__ ": building with Multithreaded non DLL runtime has a performance impact on wxString!") | |
169 | void wxStringData::Free() | |
170 | { | |
171 | free(this); | |
172 | } | |
173 | #endif | |
174 | ||
175 | // =========================================================================== | |
176 | // wxString class core | |
177 | // =========================================================================== | |
178 | ||
179 | // --------------------------------------------------------------------------- | |
180 | // construction | |
181 | // --------------------------------------------------------------------------- | |
182 | ||
183 | // constructs string of <nLength> copies of character <ch> | |
184 | wxString::wxString(wxChar ch, size_t nLength) | |
185 | { | |
186 | Init(); | |
187 | ||
188 | if ( nLength > 0 ) { | |
189 | if ( !AllocBuffer(nLength) ) { | |
190 | wxFAIL_MSG( _T("out of memory in wxString::wxString") ); | |
191 | return; | |
192 | } | |
193 | ||
194 | #if wxUSE_UNICODE | |
195 | // memset only works on chars | |
196 | for ( size_t n = 0; n < nLength; n++ ) | |
197 | m_pchData[n] = ch; | |
198 | #else | |
199 | memset(m_pchData, ch, nLength); | |
200 | #endif | |
201 | } | |
202 | } | |
203 | ||
204 | // takes nLength elements of psz starting at nPos | |
205 | void wxString::InitWith(const wxChar *psz, size_t nPos, size_t nLength) | |
206 | { | |
207 | Init(); | |
208 | ||
209 | // if the length is not given, assume the string to be NUL terminated | |
210 | if ( nLength == wxSTRING_MAXLEN ) { | |
211 | wxASSERT_MSG( nPos <= wxStrlen(psz), _T("index out of bounds") ); | |
212 | ||
213 | nLength = wxStrlen(psz + nPos); | |
214 | } | |
215 | ||
216 | STATISTICS_ADD(InitialLength, nLength); | |
217 | ||
218 | if ( nLength > 0 ) { | |
219 | // trailing '\0' is written in AllocBuffer() | |
220 | if ( !AllocBuffer(nLength) ) { | |
221 | wxFAIL_MSG( _T("out of memory in wxString::InitWith") ); | |
222 | return; | |
223 | } | |
224 | memcpy(m_pchData, psz + nPos, nLength*sizeof(wxChar)); | |
225 | } | |
226 | } | |
227 | ||
228 | #ifdef wxSTD_STRING_COMPATIBILITY | |
229 | ||
230 | // poor man's iterators are "void *" pointers | |
231 | wxString::wxString(const void *pStart, const void *pEnd) | |
232 | { | |
233 | InitWith((const wxChar *)pStart, 0, | |
234 | (const wxChar *)pEnd - (const wxChar *)pStart); | |
235 | } | |
236 | ||
237 | #endif //std::string compatibility | |
238 | ||
239 | #if wxUSE_UNICODE | |
240 | ||
241 | // from multibyte string | |
242 | wxString::wxString(const char *psz, wxMBConv& conv, size_t nLength) | |
243 | { | |
244 | // first get the size of the buffer we need | |
245 | size_t nLen; | |
246 | if ( psz ) | |
247 | { | |
248 | // calculate the needed size ourselves or use the provided one | |
249 | nLen = nLength == wxSTRING_MAXLEN ? conv.MB2WC(NULL, psz, 0) : nLength; | |
250 | } | |
251 | else | |
252 | { | |
253 | // nothing to convert | |
254 | nLen = 0; | |
255 | } | |
256 | ||
257 | // anything to do? | |
258 | if ( (nLen != 0) && (nLen != (size_t)-1) ) | |
259 | { | |
260 | if ( !AllocBuffer(nLen) ) | |
261 | { | |
262 | wxFAIL_MSG( _T("out of memory in wxString::wxString") ); | |
263 | } | |
264 | else | |
265 | { | |
266 | // MB2WC wants the buffer size, not the string length hence +1 | |
267 | nLen = conv.MB2WC(m_pchData, psz, nLen + 1); | |
268 | ||
269 | if ( nLen != (size_t)-1 ) | |
270 | { | |
271 | // initialized ok, set the real length as nLength specified by | |
272 | // the caller could be greater than the real string length | |
273 | GetStringData()->nDataLength = nLen; | |
274 | m_pchData[nLen] = 0; | |
275 | return; | |
276 | } | |
277 | //else: the conversion failed -- leave the string empty (what else?) | |
278 | } | |
279 | } | |
280 | ||
281 | Init(); | |
282 | } | |
283 | ||
284 | #else // ANSI | |
285 | ||
286 | #if wxUSE_WCHAR_T | |
287 | // from wide string | |
288 | wxString::wxString(const wchar_t *pwz, wxMBConv& conv, size_t nLength) | |
289 | { | |
290 | // first get the size of the buffer we need | |
291 | size_t nLen; | |
292 | if ( pwz ) | |
293 | { | |
294 | // calculate the needed size ourselves or use the provided one | |
295 | nLen = nLength == wxSTRING_MAXLEN ? conv.WC2MB(NULL, pwz, 0) : nLength; | |
296 | } | |
297 | else | |
298 | { | |
299 | // nothing to convert | |
300 | nLen = 0; | |
301 | } | |
302 | ||
303 | // anything to do? | |
304 | if ( (nLen != 0) && (nLen != (size_t)-1) ) | |
305 | { | |
306 | if ( !AllocBuffer(nLen) ) | |
307 | { | |
308 | wxFAIL_MSG( _T("out of memory in wxString::wxString") ); | |
309 | } | |
310 | else | |
311 | { | |
312 | // WC2MB wants the buffer size, not the string length | |
313 | if ( conv.WC2MB(m_pchData, pwz, nLen + 1) != (size_t)-1 ) | |
314 | { | |
315 | // initialized ok | |
316 | return; | |
317 | } | |
318 | //else: the conversion failed -- leave the string empty (what else?) | |
319 | } | |
320 | } | |
321 | ||
322 | Init(); | |
323 | } | |
324 | #endif // wxUSE_WCHAR_T | |
325 | ||
326 | #endif // Unicode/ANSI | |
327 | ||
328 | // --------------------------------------------------------------------------- | |
329 | // memory allocation | |
330 | // --------------------------------------------------------------------------- | |
331 | ||
332 | // allocates memory needed to store a C string of length nLen | |
333 | bool wxString::AllocBuffer(size_t nLen) | |
334 | { | |
335 | // allocating 0 sized buffer doesn't make sense, all empty strings should | |
336 | // reuse g_strEmpty | |
337 | wxASSERT( nLen > 0 ); | |
338 | ||
339 | // make sure that we don't overflow | |
340 | wxASSERT( nLen < (INT_MAX / sizeof(wxChar)) - | |
341 | (sizeof(wxStringData) + EXTRA_ALLOC + 1) ); | |
342 | ||
343 | STATISTICS_ADD(Length, nLen); | |
344 | ||
345 | // allocate memory: | |
346 | // 1) one extra character for '\0' termination | |
347 | // 2) sizeof(wxStringData) for housekeeping info | |
348 | wxStringData* pData = (wxStringData*) | |
349 | malloc(sizeof(wxStringData) + (nLen + EXTRA_ALLOC + 1)*sizeof(wxChar)); | |
350 | ||
351 | if ( pData == NULL ) { | |
352 | // allocation failures are handled by the caller | |
353 | return FALSE; | |
354 | } | |
355 | ||
356 | pData->nRefs = 1; | |
357 | pData->nDataLength = nLen; | |
358 | pData->nAllocLength = nLen + EXTRA_ALLOC; | |
359 | m_pchData = pData->data(); // data starts after wxStringData | |
360 | m_pchData[nLen] = wxT('\0'); | |
361 | return TRUE; | |
362 | } | |
363 | ||
364 | // must be called before changing this string | |
365 | bool wxString::CopyBeforeWrite() | |
366 | { | |
367 | wxStringData* pData = GetStringData(); | |
368 | ||
369 | if ( pData->IsShared() ) { | |
370 | pData->Unlock(); // memory not freed because shared | |
371 | size_t nLen = pData->nDataLength; | |
372 | if ( !AllocBuffer(nLen) ) { | |
373 | // allocation failures are handled by the caller | |
374 | return FALSE; | |
375 | } | |
376 | memcpy(m_pchData, pData->data(), nLen*sizeof(wxChar)); | |
377 | } | |
378 | ||
379 | wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner | |
380 | ||
381 | return TRUE; | |
382 | } | |
383 | ||
384 | // must be called before replacing contents of this string | |
385 | bool wxString::AllocBeforeWrite(size_t nLen) | |
386 | { | |
387 | wxASSERT( nLen != 0 ); // doesn't make any sense | |
388 | ||
389 | // must not share string and must have enough space | |
390 | wxStringData* pData = GetStringData(); | |
391 | if ( pData->IsShared() || pData->IsEmpty() ) { | |
392 | // can't work with old buffer, get new one | |
393 | pData->Unlock(); | |
394 | if ( !AllocBuffer(nLen) ) { | |
395 | // allocation failures are handled by the caller | |
396 | return FALSE; | |
397 | } | |
398 | } | |
399 | else { | |
400 | if ( nLen > pData->nAllocLength ) { | |
401 | // realloc the buffer instead of calling malloc() again, this is more | |
402 | // efficient | |
403 | STATISTICS_ADD(Length, nLen); | |
404 | ||
405 | nLen += EXTRA_ALLOC; | |
406 | ||
407 | pData = (wxStringData*) | |
408 | realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); | |
409 | ||
410 | if ( pData == NULL ) { | |
411 | // allocation failures are handled by the caller | |
412 | // keep previous data since reallocation failed | |
413 | return FALSE; | |
414 | } | |
415 | ||
416 | pData->nAllocLength = nLen; | |
417 | m_pchData = pData->data(); | |
418 | } | |
419 | ||
420 | // now we have enough space, just update the string length | |
421 | pData->nDataLength = nLen; | |
422 | } | |
423 | ||
424 | wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner | |
425 | ||
426 | return TRUE; | |
427 | } | |
428 | ||
429 | // allocate enough memory for nLen characters | |
430 | bool wxString::Alloc(size_t nLen) | |
431 | { | |
432 | wxStringData *pData = GetStringData(); | |
433 | if ( pData->nAllocLength <= nLen ) { | |
434 | if ( pData->IsEmpty() ) { | |
435 | nLen += EXTRA_ALLOC; | |
436 | ||
437 | wxStringData* pData = (wxStringData*) | |
438 | malloc(sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); | |
439 | ||
440 | if ( pData == NULL ) { | |
441 | // allocation failure handled by caller | |
442 | return FALSE; | |
443 | } | |
444 | ||
445 | pData->nRefs = 1; | |
446 | pData->nDataLength = 0; | |
447 | pData->nAllocLength = nLen; | |
448 | m_pchData = pData->data(); // data starts after wxStringData | |
449 | m_pchData[0u] = wxT('\0'); | |
450 | } | |
451 | else if ( pData->IsShared() ) { | |
452 | pData->Unlock(); // memory not freed because shared | |
453 | size_t nOldLen = pData->nDataLength; | |
454 | if ( !AllocBuffer(nLen) ) { | |
455 | // allocation failure handled by caller | |
456 | return FALSE; | |
457 | } | |
458 | memcpy(m_pchData, pData->data(), nOldLen*sizeof(wxChar)); | |
459 | } | |
460 | else { | |
461 | nLen += EXTRA_ALLOC; | |
462 | ||
463 | pData = (wxStringData *) | |
464 | realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); | |
465 | ||
466 | if ( pData == NULL ) { | |
467 | // allocation failure handled by caller | |
468 | // keep previous data since reallocation failed | |
469 | return FALSE; | |
470 | } | |
471 | ||
472 | // it's not important if the pointer changed or not (the check for this | |
473 | // is not faster than assigning to m_pchData in all cases) | |
474 | pData->nAllocLength = nLen; | |
475 | m_pchData = pData->data(); | |
476 | } | |
477 | } | |
478 | //else: we've already got enough | |
479 | return TRUE; | |
480 | } | |
481 | ||
482 | // shrink to minimal size (releasing extra memory) | |
483 | bool wxString::Shrink() | |
484 | { | |
485 | wxStringData *pData = GetStringData(); | |
486 | ||
487 | size_t nLen = pData->nDataLength; | |
488 | void *p = realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); | |
489 | ||
490 | if ( p == NULL) { | |
491 | wxFAIL_MSG( _T("out of memory reallocating wxString data") ); | |
492 | // keep previous data since reallocation failed | |
493 | return FALSE; | |
494 | } | |
495 | ||
496 | if ( p != pData ) | |
497 | { | |
498 | // contrary to what one might believe, some realloc() implementation do | |
499 | // move the memory block even when its size is reduced | |
500 | pData = (wxStringData *)p; | |
501 | ||
502 | m_pchData = pData->data(); | |
503 | } | |
504 | ||
505 | pData->nAllocLength = nLen; | |
506 | ||
507 | return TRUE; | |
508 | } | |
509 | ||
510 | // get the pointer to writable buffer of (at least) nLen bytes | |
511 | wxChar *wxString::GetWriteBuf(size_t nLen) | |
512 | { | |
513 | if ( !AllocBeforeWrite(nLen) ) { | |
514 | // allocation failure handled by caller | |
515 | return NULL; | |
516 | } | |
517 | ||
518 | wxASSERT( GetStringData()->nRefs == 1 ); | |
519 | GetStringData()->Validate(FALSE); | |
520 | ||
521 | return m_pchData; | |
522 | } | |
523 | ||
524 | // put string back in a reasonable state after GetWriteBuf | |
525 | void wxString::UngetWriteBuf() | |
526 | { | |
527 | GetStringData()->nDataLength = wxStrlen(m_pchData); | |
528 | GetStringData()->Validate(TRUE); | |
529 | } | |
530 | ||
531 | void wxString::UngetWriteBuf(size_t nLen) | |
532 | { | |
533 | GetStringData()->nDataLength = nLen; | |
534 | GetStringData()->Validate(TRUE); | |
535 | } | |
536 | ||
537 | // --------------------------------------------------------------------------- | |
538 | // data access | |
539 | // --------------------------------------------------------------------------- | |
540 | ||
541 | // all functions are inline in string.h | |
542 | ||
543 | // --------------------------------------------------------------------------- | |
544 | // assignment operators | |
545 | // --------------------------------------------------------------------------- | |
546 | ||
547 | // helper function: does real copy | |
548 | bool wxString::AssignCopy(size_t nSrcLen, const wxChar *pszSrcData) | |
549 | { | |
550 | if ( nSrcLen == 0 ) { | |
551 | Reinit(); | |
552 | } | |
553 | else { | |
554 | if ( !AllocBeforeWrite(nSrcLen) ) { | |
555 | // allocation failure handled by caller | |
556 | return FALSE; | |
557 | } | |
558 | memcpy(m_pchData, pszSrcData, nSrcLen*sizeof(wxChar)); | |
559 | GetStringData()->nDataLength = nSrcLen; | |
560 | m_pchData[nSrcLen] = wxT('\0'); | |
561 | } | |
562 | return TRUE; | |
563 | } | |
564 | ||
565 | // assigns one string to another | |
566 | wxString& wxString::operator=(const wxString& stringSrc) | |
567 | { | |
568 | wxASSERT( stringSrc.GetStringData()->IsValid() ); | |
569 | ||
570 | // don't copy string over itself | |
571 | if ( m_pchData != stringSrc.m_pchData ) { | |
572 | if ( stringSrc.GetStringData()->IsEmpty() ) { | |
573 | Reinit(); | |
574 | } | |
575 | else { | |
576 | // adjust references | |
577 | GetStringData()->Unlock(); | |
578 | m_pchData = stringSrc.m_pchData; | |
579 | GetStringData()->Lock(); | |
580 | } | |
581 | } | |
582 | ||
583 | return *this; | |
584 | } | |
585 | ||
586 | // assigns a single character | |
587 | wxString& wxString::operator=(wxChar ch) | |
588 | { | |
589 | if ( !AssignCopy(1, &ch) ) { | |
590 | wxFAIL_MSG( _T("out of memory in wxString::operator=(wxChar)") ); | |
591 | } | |
592 | return *this; | |
593 | } | |
594 | ||
595 | ||
596 | // assigns C string | |
597 | wxString& wxString::operator=(const wxChar *psz) | |
598 | { | |
599 | if ( !AssignCopy(wxStrlen(psz), psz) ) { | |
600 | wxFAIL_MSG( _T("out of memory in wxString::operator=(const wxChar *)") ); | |
601 | } | |
602 | return *this; | |
603 | } | |
604 | ||
605 | #if !wxUSE_UNICODE | |
606 | ||
607 | // same as 'signed char' variant | |
608 | wxString& wxString::operator=(const unsigned char* psz) | |
609 | { | |
610 | *this = (const char *)psz; | |
611 | return *this; | |
612 | } | |
613 | ||
614 | #if wxUSE_WCHAR_T | |
615 | wxString& wxString::operator=(const wchar_t *pwz) | |
616 | { | |
617 | wxString str(pwz); | |
618 | *this = str; | |
619 | return *this; | |
620 | } | |
621 | #endif | |
622 | ||
623 | #endif | |
624 | ||
625 | // --------------------------------------------------------------------------- | |
626 | // string concatenation | |
627 | // --------------------------------------------------------------------------- | |
628 | ||
629 | // add something to this string | |
630 | bool wxString::ConcatSelf(size_t nSrcLen, const wxChar *pszSrcData) | |
631 | { | |
632 | STATISTICS_ADD(SummandLength, nSrcLen); | |
633 | ||
634 | // concatenating an empty string is a NOP | |
635 | if ( nSrcLen > 0 ) { | |
636 | wxStringData *pData = GetStringData(); | |
637 | size_t nLen = pData->nDataLength; | |
638 | size_t nNewLen = nLen + nSrcLen; | |
639 | ||
640 | // alloc new buffer if current is too small | |
641 | if ( pData->IsShared() ) { | |
642 | STATISTICS_ADD(ConcatHit, 0); | |
643 | ||
644 | // we have to allocate another buffer | |
645 | wxStringData* pOldData = GetStringData(); | |
646 | if ( !AllocBuffer(nNewLen) ) { | |
647 | // allocation failure handled by caller | |
648 | return FALSE; | |
649 | } | |
650 | memcpy(m_pchData, pOldData->data(), nLen*sizeof(wxChar)); | |
651 | pOldData->Unlock(); | |
652 | } | |
653 | else if ( nNewLen > pData->nAllocLength ) { | |
654 | STATISTICS_ADD(ConcatHit, 0); | |
655 | ||
656 | // we have to grow the buffer | |
657 | if ( !Alloc(nNewLen) ) { | |
658 | // allocation failure handled by caller | |
659 | return FALSE; | |
660 | } | |
661 | } | |
662 | else { | |
663 | STATISTICS_ADD(ConcatHit, 1); | |
664 | ||
665 | // the buffer is already big enough | |
666 | } | |
667 | ||
668 | // should be enough space | |
669 | wxASSERT( nNewLen <= GetStringData()->nAllocLength ); | |
670 | ||
671 | // fast concatenation - all is done in our buffer | |
672 | memcpy(m_pchData + nLen, pszSrcData, nSrcLen*sizeof(wxChar)); | |
673 | ||
674 | m_pchData[nNewLen] = wxT('\0'); // put terminating '\0' | |
675 | GetStringData()->nDataLength = nNewLen; // and fix the length | |
676 | } | |
677 | //else: the string to append was empty | |
678 | return TRUE; | |
679 | } | |
680 | ||
681 | /* | |
682 | * concatenation functions come in 5 flavours: | |
683 | * string + string | |
684 | * char + string and string + char | |
685 | * C str + string and string + C str | |
686 | */ | |
687 | ||
688 | wxString operator+(const wxString& str1, const wxString& str2) | |
689 | { | |
690 | wxASSERT( str1.GetStringData()->IsValid() ); | |
691 | wxASSERT( str2.GetStringData()->IsValid() ); | |
692 | ||
693 | wxString s = str1; | |
694 | s += str2; | |
695 | ||
696 | return s; | |
697 | } | |
698 | ||
699 | wxString operator+(const wxString& str, wxChar ch) | |
700 | { | |
701 | wxASSERT( str.GetStringData()->IsValid() ); | |
702 | ||
703 | wxString s = str; | |
704 | s += ch; | |
705 | ||
706 | return s; | |
707 | } | |
708 | ||
709 | wxString operator+(wxChar ch, const wxString& str) | |
710 | { | |
711 | wxASSERT( str.GetStringData()->IsValid() ); | |
712 | ||
713 | wxString s = ch; | |
714 | s += str; | |
715 | ||
716 | return s; | |
717 | } | |
718 | ||
719 | wxString operator+(const wxString& str, const wxChar *psz) | |
720 | { | |
721 | wxASSERT( str.GetStringData()->IsValid() ); | |
722 | ||
723 | wxString s; | |
724 | if ( !s.Alloc(wxStrlen(psz) + str.Len()) ) { | |
725 | wxFAIL_MSG( _T("out of memory in wxString::operator+") ); | |
726 | } | |
727 | s = str; | |
728 | s += psz; | |
729 | ||
730 | return s; | |
731 | } | |
732 | ||
733 | wxString operator+(const wxChar *psz, const wxString& str) | |
734 | { | |
735 | wxASSERT( str.GetStringData()->IsValid() ); | |
736 | ||
737 | wxString s; | |
738 | if ( !s.Alloc(wxStrlen(psz) + str.Len()) ) { | |
739 | wxFAIL_MSG( _T("out of memory in wxString::operator+") ); | |
740 | } | |
741 | s = psz; | |
742 | s += str; | |
743 | ||
744 | return s; | |
745 | } | |
746 | ||
747 | // =========================================================================== | |
748 | // other common string functions | |
749 | // =========================================================================== | |
750 | ||
751 | #if wxUSE_UNICODE | |
752 | ||
753 | wxString wxString::FromAscii(const char *ascii) | |
754 | { | |
755 | if (!ascii) | |
756 | return wxEmptyString; | |
757 | ||
758 | size_t len = strlen( ascii ); | |
759 | wxString res; | |
760 | ||
761 | if ( len ) | |
762 | { | |
763 | wxStringBuffer buf(res, len); | |
764 | ||
765 | wchar_t *dest = buf; | |
766 | ||
767 | for ( ;; ) | |
768 | { | |
769 | if ( (*dest++ = (wchar_t)(unsigned char)*ascii++) == L'\0' ) | |
770 | break; | |
771 | } | |
772 | } | |
773 | ||
774 | return res; | |
775 | } | |
776 | ||
777 | wxString wxString::FromAscii(const char ascii) | |
778 | { | |
779 | // What do we do with '\0' ? | |
780 | ||
781 | wxString res; | |
782 | res += (wchar_t)(unsigned char) ascii; | |
783 | ||
784 | return res; | |
785 | } | |
786 | ||
787 | const wxCharBuffer wxString::ToAscii() const | |
788 | { | |
789 | // this will allocate enough space for the terminating NUL too | |
790 | wxCharBuffer buffer(length()); | |
791 | ||
792 | signed char *dest = (signed char *)buffer.data(); | |
793 | ||
794 | const wchar_t *pwc = c_str(); | |
795 | for ( ;; ) | |
796 | { | |
797 | *dest++ = *pwc > SCHAR_MAX ? '_' : *pwc; | |
798 | ||
799 | // the output string can't have embedded NULs anyhow, so we can safely | |
800 | // stop at first of them even if we do have any | |
801 | if ( !*pwc++ ) | |
802 | break; | |
803 | } | |
804 | ||
805 | return buffer; | |
806 | } | |
807 | ||
808 | #endif // Unicode | |
809 | ||
810 | // --------------------------------------------------------------------------- | |
811 | // simple sub-string extraction | |
812 | // --------------------------------------------------------------------------- | |
813 | ||
814 | // helper function: clone the data attached to this string | |
815 | bool wxString::AllocCopy(wxString& dest, int nCopyLen, int nCopyIndex) const | |
816 | { | |
817 | if ( nCopyLen == 0 ) { | |
818 | dest.Init(); | |
819 | } | |
820 | else { | |
821 | if ( !dest.AllocBuffer(nCopyLen) ) { | |
822 | // allocation failure handled by caller | |
823 | return FALSE; | |
824 | } | |
825 | memcpy(dest.m_pchData, m_pchData + nCopyIndex, nCopyLen*sizeof(wxChar)); | |
826 | } | |
827 | return TRUE; | |
828 | } | |
829 | ||
830 | // extract string of length nCount starting at nFirst | |
831 | wxString wxString::Mid(size_t nFirst, size_t nCount) const | |
832 | { | |
833 | wxStringData *pData = GetStringData(); | |
834 | size_t nLen = pData->nDataLength; | |
835 | ||
836 | // default value of nCount is wxSTRING_MAXLEN and means "till the end" | |
837 | if ( nCount == wxSTRING_MAXLEN ) | |
838 | { | |
839 | nCount = nLen - nFirst; | |
840 | } | |
841 | ||
842 | // out-of-bounds requests return sensible things | |
843 | if ( nFirst + nCount > nLen ) | |
844 | { | |
845 | nCount = nLen - nFirst; | |
846 | } | |
847 | ||
848 | if ( nFirst > nLen ) | |
849 | { | |
850 | // AllocCopy() will return empty string | |
851 | nCount = 0; | |
852 | } | |
853 | ||
854 | wxString dest; | |
855 | if ( !AllocCopy(dest, nCount, nFirst) ) { | |
856 | wxFAIL_MSG( _T("out of memory in wxString::Mid") ); | |
857 | } | |
858 | ||
859 | return dest; | |
860 | } | |
861 | ||
862 | // check that the tring starts with prefix and return the rest of the string | |
863 | // in the provided pointer if it is not NULL, otherwise return FALSE | |
864 | bool wxString::StartsWith(const wxChar *prefix, wxString *rest) const | |
865 | { | |
866 | wxASSERT_MSG( prefix, _T("invalid parameter in wxString::StartsWith") ); | |
867 | ||
868 | // first check if the beginning of the string matches the prefix: note | |
869 | // that we don't have to check that we don't run out of this string as | |
870 | // when we reach the terminating NUL, either prefix string ends too (and | |
871 | // then it's ok) or we break out of the loop because there is no match | |
872 | const wxChar *p = c_str(); | |
873 | while ( *prefix ) | |
874 | { | |
875 | if ( *prefix++ != *p++ ) | |
876 | { | |
877 | // no match | |
878 | return FALSE; | |
879 | } | |
880 | } | |
881 | ||
882 | if ( rest ) | |
883 | { | |
884 | // put the rest of the string into provided pointer | |
885 | *rest = p; | |
886 | } | |
887 | ||
888 | return TRUE; | |
889 | } | |
890 | ||
891 | // extract nCount last (rightmost) characters | |
892 | wxString wxString::Right(size_t nCount) const | |
893 | { | |
894 | if ( nCount > (size_t)GetStringData()->nDataLength ) | |
895 | nCount = GetStringData()->nDataLength; | |
896 | ||
897 | wxString dest; | |
898 | if ( !AllocCopy(dest, nCount, GetStringData()->nDataLength - nCount) ) { | |
899 | wxFAIL_MSG( _T("out of memory in wxString::Right") ); | |
900 | } | |
901 | return dest; | |
902 | } | |
903 | ||
904 | // get all characters after the last occurence of ch | |
905 | // (returns the whole string if ch not found) | |
906 | wxString wxString::AfterLast(wxChar ch) const | |
907 | { | |
908 | wxString str; | |
909 | int iPos = Find(ch, TRUE); | |
910 | if ( iPos == wxNOT_FOUND ) | |
911 | str = *this; | |
912 | else | |
913 | str = c_str() + iPos + 1; | |
914 | ||
915 | return str; | |
916 | } | |
917 | ||
918 | // extract nCount first (leftmost) characters | |
919 | wxString wxString::Left(size_t nCount) const | |
920 | { | |
921 | if ( nCount > (size_t)GetStringData()->nDataLength ) | |
922 | nCount = GetStringData()->nDataLength; | |
923 | ||
924 | wxString dest; | |
925 | if ( !AllocCopy(dest, nCount, 0) ) { | |
926 | wxFAIL_MSG( _T("out of memory in wxString::Left") ); | |
927 | } | |
928 | return dest; | |
929 | } | |
930 | ||
931 | // get all characters before the first occurence of ch | |
932 | // (returns the whole string if ch not found) | |
933 | wxString wxString::BeforeFirst(wxChar ch) const | |
934 | { | |
935 | wxString str; | |
936 | for ( const wxChar *pc = m_pchData; *pc != wxT('\0') && *pc != ch; pc++ ) | |
937 | str += *pc; | |
938 | ||
939 | return str; | |
940 | } | |
941 | ||
942 | /// get all characters before the last occurence of ch | |
943 | /// (returns empty string if ch not found) | |
944 | wxString wxString::BeforeLast(wxChar ch) const | |
945 | { | |
946 | wxString str; | |
947 | int iPos = Find(ch, TRUE); | |
948 | if ( iPos != wxNOT_FOUND && iPos != 0 ) | |
949 | str = wxString(c_str(), iPos); | |
950 | ||
951 | return str; | |
952 | } | |
953 | ||
954 | /// get all characters after the first occurence of ch | |
955 | /// (returns empty string if ch not found) | |
956 | wxString wxString::AfterFirst(wxChar ch) const | |
957 | { | |
958 | wxString str; | |
959 | int iPos = Find(ch); | |
960 | if ( iPos != wxNOT_FOUND ) | |
961 | str = c_str() + iPos + 1; | |
962 | ||
963 | return str; | |
964 | } | |
965 | ||
966 | // replace first (or all) occurences of some substring with another one | |
967 | size_t | |
968 | wxString::Replace(const wxChar *szOld, const wxChar *szNew, bool bReplaceAll) | |
969 | { | |
970 | // if we tried to replace an empty string we'd enter an infinite loop below | |
971 | wxCHECK_MSG( szOld && *szOld && szNew, 0, | |
972 | _T("wxString::Replace(): invalid parameter") ); | |
973 | ||
974 | size_t uiCount = 0; // count of replacements made | |
975 | ||
976 | size_t uiOldLen = wxStrlen(szOld); | |
977 | ||
978 | wxString strTemp; | |
979 | const wxChar *pCurrent = m_pchData; | |
980 | const wxChar *pSubstr; | |
981 | while ( *pCurrent != wxT('\0') ) { | |
982 | pSubstr = wxStrstr(pCurrent, szOld); | |
983 | if ( pSubstr == NULL ) { | |
984 | // strTemp is unused if no replacements were made, so avoid the copy | |
985 | if ( uiCount == 0 ) | |
986 | return 0; | |
987 | ||
988 | strTemp += pCurrent; // copy the rest | |
989 | break; // exit the loop | |
990 | } | |
991 | else { | |
992 | // take chars before match | |
993 | if ( !strTemp.ConcatSelf(pSubstr - pCurrent, pCurrent) ) { | |
994 | wxFAIL_MSG( _T("out of memory in wxString::Replace") ); | |
995 | return 0; | |
996 | } | |
997 | strTemp += szNew; | |
998 | pCurrent = pSubstr + uiOldLen; // restart after match | |
999 | ||
1000 | uiCount++; | |
1001 | ||
1002 | // stop now? | |
1003 | if ( !bReplaceAll ) { | |
1004 | strTemp += pCurrent; // copy the rest | |
1005 | break; // exit the loop | |
1006 | } | |
1007 | } | |
1008 | } | |
1009 | ||
1010 | // only done if there were replacements, otherwise would have returned above | |
1011 | *this = strTemp; | |
1012 | ||
1013 | return uiCount; | |
1014 | } | |
1015 | ||
1016 | #ifdef __WXWINCE__ | |
1017 | inline int isascii(wxChar c) { return (c >= 0) && (c <=127); } | |
1018 | #endif | |
1019 | ||
1020 | bool wxString::IsAscii() const | |
1021 | { | |
1022 | const wxChar *s = (const wxChar*) *this; | |
1023 | while(*s){ | |
1024 | if(!isascii(*s)) return(FALSE); | |
1025 | s++; | |
1026 | } | |
1027 | return(TRUE); | |
1028 | } | |
1029 | ||
1030 | bool wxString::IsWord() const | |
1031 | { | |
1032 | const wxChar *s = (const wxChar*) *this; | |
1033 | while(*s){ | |
1034 | if(!wxIsalpha(*s)) return(FALSE); | |
1035 | s++; | |
1036 | } | |
1037 | return(TRUE); | |
1038 | } | |
1039 | ||
1040 | bool wxString::IsNumber() const | |
1041 | { | |
1042 | const wxChar *s = (const wxChar*) *this; | |
1043 | if (wxStrlen(s)) | |
1044 | if ((s[0] == '-') || (s[0] == '+')) s++; | |
1045 | while(*s){ | |
1046 | if(!wxIsdigit(*s)) return(FALSE); | |
1047 | s++; | |
1048 | } | |
1049 | return(TRUE); | |
1050 | } | |
1051 | ||
1052 | wxString wxString::Strip(stripType w) const | |
1053 | { | |
1054 | wxString s = *this; | |
1055 | if ( w & leading ) s.Trim(FALSE); | |
1056 | if ( w & trailing ) s.Trim(TRUE); | |
1057 | return s; | |
1058 | } | |
1059 | ||
1060 | // --------------------------------------------------------------------------- | |
1061 | // case conversion | |
1062 | // --------------------------------------------------------------------------- | |
1063 | ||
1064 | wxString& wxString::MakeUpper() | |
1065 | { | |
1066 | if ( !CopyBeforeWrite() ) { | |
1067 | wxFAIL_MSG( _T("out of memory in wxString::MakeUpper") ); | |
1068 | return *this; | |
1069 | } | |
1070 | ||
1071 | for ( wxChar *p = m_pchData; *p; p++ ) | |
1072 | *p = (wxChar)wxToupper(*p); | |
1073 | ||
1074 | return *this; | |
1075 | } | |
1076 | ||
1077 | wxString& wxString::MakeLower() | |
1078 | { | |
1079 | if ( !CopyBeforeWrite() ) { | |
1080 | wxFAIL_MSG( _T("out of memory in wxString::MakeLower") ); | |
1081 | return *this; | |
1082 | } | |
1083 | ||
1084 | for ( wxChar *p = m_pchData; *p; p++ ) | |
1085 | *p = (wxChar)wxTolower(*p); | |
1086 | ||
1087 | return *this; | |
1088 | } | |
1089 | ||
1090 | // --------------------------------------------------------------------------- | |
1091 | // trimming and padding | |
1092 | // --------------------------------------------------------------------------- | |
1093 | ||
1094 | // some compilers (VC++ 6.0 not to name them) return TRUE for a call to | |
1095 |