]>
Commit | Line | Data |
---|---|---|
c801d85f KB |
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> | |
55d99c7a | 9 | // Licence: wxWindows licence |
c801d85f KB |
10 | ///////////////////////////////////////////////////////////////////////////// |
11 | ||
12 | #ifdef __GNUG__ | |
30b21f9a | 13 | #pragma implementation "string.h" |
c801d85f KB |
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__ | |
30b21f9a | 31 | #pragma hdrstop |
c801d85f KB |
32 | #endif |
33 | ||
34 | #ifndef WX_PRECOMP | |
3c024cc2 VZ |
35 | #include "wx/defs.h" |
36 | #include "wx/string.h" | |
37 | #include "wx/intl.h" | |
3096bd2f | 38 | #include "wx/thread.h" |
6b769f3d | 39 | #endif |
c801d85f KB |
40 | |
41 | #include <ctype.h> | |
42 | #include <string.h> | |
43 | #include <stdlib.h> | |
44 | ||
ce3ed50d | 45 | #ifdef __SALFORDC__ |
30b21f9a | 46 | #include <clib.h> |
ce3ed50d JS |
47 | #endif |
48 | ||
3168a13f VZ |
49 | // allocating extra space for each string consumes more memory but speeds up |
50 | // the concatenation operations (nLen is the current string's length) | |
77ca46e7 VZ |
51 | // NB: EXTRA_ALLOC must be >= 0! |
52 | #define EXTRA_ALLOC (19 - nLen % 16) | |
3168a13f | 53 | |
c801d85f KB |
54 | // --------------------------------------------------------------------------- |
55 | // static class variables definition | |
56 | // --------------------------------------------------------------------------- | |
57 | ||
75ad8feb DW |
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 | ||
e87b7833 MB |
64 | #if !wxUSE_STL |
65 | const size_t wxStringBase::npos = wxSTRING_MAXLEN; | |
66 | #endif | |
c801d85f | 67 | |
3168a13f VZ |
68 | // ---------------------------------------------------------------------------- |
69 | // static data | |
70 | // ---------------------------------------------------------------------------- | |
c801d85f | 71 | |
e87b7833 MB |
72 | #if wxUSE_STL |
73 | ||
74 | extern const wxChar WXDLLIMPEXP_BASE *wxEmptyString = _T(""); | |
75 | ||
76 | #else | |
77 | ||
3c024cc2 VZ |
78 | // for an empty string, GetStringData() will return this address: this |
79 | // structure has the same layout as wxStringData and it's data() method will | |
80 | // return the empty string (dummy pointer) | |
81 | static const struct | |
82 | { | |
83 | wxStringData data; | |
2bb67b80 | 84 | wxChar dummy; |
223d09f6 | 85 | } g_strEmpty = { {-1, 0, 0}, wxT('\0') }; |
3c024cc2 | 86 | |
c801d85f | 87 | // empty C style string: points to 'string data' byte of g_strEmpty |
fd242375 | 88 | extern const wxChar WXDLLIMPEXP_BASE *wxEmptyString = &g_strEmpty.dummy; |
c801d85f | 89 | |
e87b7833 MB |
90 | #endif |
91 | ||
3168a13f | 92 | // ---------------------------------------------------------------------------- |
c801d85f | 93 | // global functions |
3168a13f | 94 | // ---------------------------------------------------------------------------- |
c801d85f | 95 | |
e87b7833 | 96 | #if wxUSE_STD_IOSTREAM |
c801d85f KB |
97 | |
98 | // MS Visual C++ version 5.0 provides the new STL headers as well as the old | |
99 | // iostream ones. | |
100 | // | |
101 | // ATTN: you can _not_ use both of these in the same program! | |
a38b83c3 | 102 | |
dd107c50 | 103 | wxSTD istream& operator>>(wxSTD istream& is, wxString& WXUNUSED(str)) |
c801d85f KB |
104 | { |
105 | #if 0 | |
106 | int w = is.width(0); | |
107 | if ( is.ipfx(0) ) { | |
3f4a0c5b | 108 | streambuf *sb = is.rdbuf(); |
c801d85f KB |
109 | str.erase(); |
110 | while ( true ) { | |
111 | int ch = sb->sbumpc (); | |
112 | if ( ch == EOF ) { | |
3f4a0c5b | 113 | is.setstate(ios::eofbit); |
c801d85f KB |
114 | break; |
115 | } | |
116 | else if ( isspace(ch) ) { | |
117 | sb->sungetc(); | |
118 | break; | |
119 | } | |
dd1eaa89 | 120 | |
c801d85f KB |
121 | str += ch; |
122 | if ( --w == 1 ) | |
123 | break; | |
124 | } | |
125 | } | |
126 | ||
127 | is.isfx(); | |
128 | if ( str.length() == 0 ) | |
3f4a0c5b | 129 | is.setstate(ios::failbit); |
c801d85f KB |
130 | #endif |
131 | return is; | |
132 | } | |
133 | ||
dd107c50 | 134 | wxSTD ostream& operator<<(wxSTD ostream& os, const wxString& str) |
825ba8f0 SB |
135 | { |
136 | os << str.c_str(); | |
137 | return os; | |
138 | } | |
139 | ||
e87b7833 | 140 | #endif // wxUSE_STD_IOSTREAM |
c801d85f | 141 | |
3168a13f VZ |
142 | // ---------------------------------------------------------------------------- |
143 | // private classes | |
144 | // ---------------------------------------------------------------------------- | |
145 | ||
146 | // this small class is used to gather statistics for performance tuning | |
147 | //#define WXSTRING_STATISTICS | |
148 | #ifdef WXSTRING_STATISTICS | |
149 | class Averager | |
150 | { | |
151 | public: | |
f6f5941b | 152 | Averager(const wxChar *sz) { m_sz = sz; m_nTotal = m_nCount = 0; } |
2c3b684c | 153 | ~Averager() |
f6f5941b | 154 | { wxPrintf("wxString: average %s = %f\n", m_sz, ((float)m_nTotal)/m_nCount); } |
3168a13f | 155 | |
c86f1403 | 156 | void Add(size_t n) { m_nTotal += n; m_nCount++; } |
3168a13f VZ |
157 | |
158 | private: | |
c86f1403 | 159 | size_t m_nCount, m_nTotal; |
f6f5941b | 160 | const wxChar *m_sz; |
3168a13f VZ |
161 | } g_averageLength("allocation size"), |
162 | g_averageSummandLength("summand length"), | |
163 | g_averageConcatHit("hit probability in concat"), | |
164 | g_averageInitialLength("initial string length"); | |
165 | ||
166 | #define STATISTICS_ADD(av, val) g_average##av.Add(val) | |
167 | #else | |
168 | #define STATISTICS_ADD(av, val) | |
169 | #endif // WXSTRING_STATISTICS | |
170 | ||
ca5e07c7 GD |
171 | // =========================================================================== |
172 | // wxStringData class deallocation | |
173 | // =========================================================================== | |
174 | ||
8ecf21b7 GD |
175 | #if defined(__VISUALC__) && defined(_MT) && !defined(_DLL) |
176 | # pragma message (__FILE__ ": building with Multithreaded non DLL runtime has a performance impact on wxString!") | |
ca5e07c7 GD |
177 | void wxStringData::Free() |
178 | { | |
179 | free(this); | |
180 | } | |
8ecf21b7 | 181 | #endif |
ca5e07c7 | 182 | |
e87b7833 MB |
183 | #if !wxUSE_STL |
184 | ||
c801d85f | 185 | // =========================================================================== |
e87b7833 | 186 | // wxStringBase |
c801d85f KB |
187 | // =========================================================================== |
188 | ||
c801d85f | 189 | // takes nLength elements of psz starting at nPos |
e87b7833 | 190 | void wxStringBase::InitWith(const wxChar *psz, size_t nPos, size_t nLength) |
c801d85f KB |
191 | { |
192 | Init(); | |
193 | ||
f6bcfd97 | 194 | // if the length is not given, assume the string to be NUL terminated |
e87b7833 | 195 | if ( nLength == npos ) { |
f6bcfd97 | 196 | wxASSERT_MSG( nPos <= wxStrlen(psz), _T("index out of bounds") ); |
c801d85f | 197 | |
f6bcfd97 BP |
198 | nLength = wxStrlen(psz + nPos); |
199 | } | |
6c68273f | 200 | |
3168a13f VZ |
201 | STATISTICS_ADD(InitialLength, nLength); |
202 | ||
c801d85f KB |
203 | if ( nLength > 0 ) { |
204 | // trailing '\0' is written in AllocBuffer() | |
b1801e0e | 205 | if ( !AllocBuffer(nLength) ) { |
e87b7833 | 206 | wxFAIL_MSG( _T("out of memory in wxStringBase::InitWith") ); |
b1801e0e GD |
207 | return; |
208 | } | |
2bb67b80 | 209 | memcpy(m_pchData, psz + nPos, nLength*sizeof(wxChar)); |
c801d85f KB |
210 | } |
211 | } | |
dd1eaa89 | 212 | |
c801d85f | 213 | // poor man's iterators are "void *" pointers |
e87b7833 | 214 | wxStringBase::wxStringBase(const void *pStart, const void *pEnd) |
c801d85f | 215 | { |
2bb67b80 OK |
216 | InitWith((const wxChar *)pStart, 0, |
217 | (const wxChar *)pEnd - (const wxChar *)pStart); | |
c801d85f KB |
218 | } |
219 | ||
e87b7833 | 220 | wxStringBase::wxStringBase(size_type n, wxChar ch) |
c801d85f | 221 | { |
e87b7833 MB |
222 | Init(); |
223 | append(n, ch); | |
c801d85f | 224 | } |
2bb67b80 | 225 | |
c801d85f KB |
226 | // --------------------------------------------------------------------------- |
227 | // memory allocation | |
228 | // --------------------------------------------------------------------------- | |
229 | ||
230 | // allocates memory needed to store a C string of length nLen | |
e87b7833 | 231 | bool wxStringBase::AllocBuffer(size_t nLen) |
c801d85f | 232 | { |
13111b2a VZ |
233 | // allocating 0 sized buffer doesn't make sense, all empty strings should |
234 | // reuse g_strEmpty | |
235 | wxASSERT( nLen > 0 ); | |
236 | ||
237 | // make sure that we don't overflow | |
238 | wxASSERT( nLen < (INT_MAX / sizeof(wxChar)) - | |
239 | (sizeof(wxStringData) + EXTRA_ALLOC + 1) ); | |
c801d85f | 240 | |
3168a13f VZ |
241 | STATISTICS_ADD(Length, nLen); |
242 | ||
c801d85f KB |
243 | // allocate memory: |
244 | // 1) one extra character for '\0' termination | |
245 | // 2) sizeof(wxStringData) for housekeeping info | |
3168a13f | 246 | wxStringData* pData = (wxStringData*) |
2bb67b80 | 247 | malloc(sizeof(wxStringData) + (nLen + EXTRA_ALLOC + 1)*sizeof(wxChar)); |
e015c2a3 | 248 | |
b1801e0e GD |
249 | if ( pData == NULL ) { |
250 | // allocation failures are handled by the caller | |
251 | return FALSE; | |
252 | } | |
e015c2a3 | 253 | |
c801d85f | 254 | pData->nRefs = 1; |
c801d85f | 255 | pData->nDataLength = nLen; |
3168a13f | 256 | pData->nAllocLength = nLen + EXTRA_ALLOC; |
c801d85f | 257 | m_pchData = pData->data(); // data starts after wxStringData |
223d09f6 | 258 | m_pchData[nLen] = wxT('\0'); |
b1801e0e | 259 | return TRUE; |
c801d85f KB |
260 | } |
261 | ||
c801d85f | 262 | // must be called before changing this string |
e87b7833 | 263 | bool wxStringBase::CopyBeforeWrite() |
c801d85f KB |
264 | { |
265 | wxStringData* pData = GetStringData(); | |
266 | ||
267 | if ( pData->IsShared() ) { | |
268 | pData->Unlock(); // memory not freed because shared | |
c86f1403 | 269 | size_t nLen = pData->nDataLength; |
b1801e0e GD |
270 | if ( !AllocBuffer(nLen) ) { |
271 | // allocation failures are handled by the caller | |
272 | return FALSE; | |
273 | } | |
2bb67b80 | 274 | memcpy(m_pchData, pData->data(), nLen*sizeof(wxChar)); |
c801d85f KB |
275 | } |
276 | ||
3bbb630a | 277 | wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner |
b1801e0e GD |
278 | |
279 | return TRUE; | |
c801d85f KB |
280 | } |
281 | ||
282 | // must be called before replacing contents of this string | |
e87b7833 | 283 | bool wxStringBase::AllocBeforeWrite(size_t nLen) |
c801d85f KB |
284 | { |
285 | wxASSERT( nLen != 0 ); // doesn't make any sense | |
286 | ||
287 | // must not share string and must have enough space | |
3168a13f | 288 | wxStringData* pData = GetStringData(); |
fbf0c83d | 289 | if ( pData->IsShared() || pData->IsEmpty() ) { |
c801d85f KB |
290 | // can't work with old buffer, get new one |
291 | pData->Unlock(); | |
b1801e0e GD |
292 | if ( !AllocBuffer(nLen) ) { |
293 | // allocation failures are handled by the caller | |
294 | return FALSE; | |
295 | } | |
c801d85f | 296 | } |
471aebdd | 297 | else { |
fbf0c83d VZ |
298 | if ( nLen > pData->nAllocLength ) { |
299 | // realloc the buffer instead of calling malloc() again, this is more | |
300 | // efficient | |
301 | STATISTICS_ADD(Length, nLen); | |
302 | ||
303 | nLen += EXTRA_ALLOC; | |
304 | ||
fbf0c83d VZ |
305 | pData = (wxStringData*) |
306 | realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); | |
e015c2a3 | 307 | |
b1801e0e GD |
308 | if ( pData == NULL ) { |
309 | // allocation failures are handled by the caller | |
310 | // keep previous data since reallocation failed | |
311 | return FALSE; | |
fbf0c83d VZ |
312 | } |
313 | ||
314 | pData->nAllocLength = nLen; | |
315 | m_pchData = pData->data(); | |
316 | } | |
317 | ||
318 | // now we have enough space, just update the string length | |
471aebdd VZ |
319 | pData->nDataLength = nLen; |
320 | } | |
c801d85f | 321 | |
f1da2f03 | 322 | wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner |
b1801e0e GD |
323 | |
324 | return TRUE; | |
c801d85f KB |
325 | } |
326 | ||
e87b7833 MB |
327 | wxStringBase& wxStringBase::append(size_t n, wxChar ch) |
328 | { | |
329 | size_type len = length(); | |
330 | ||
331 | if ( !CopyBeforeWrite() || !Alloc(len + n) ) { | |
332 | wxFAIL_MSG( _T("out of memory in wxStringBase::append") ); | |
333 | } | |
334 | GetStringData()->nDataLength = len + n; | |
335 | m_pchData[len + n] = '\0'; | |
336 | for ( size_t i = 0; i < n; ++i ) | |
337 | m_pchData[len + i] = ch; | |
338 | return *this; | |
339 | } | |
340 | ||
341 | void wxStringBase::resize(size_t nSize, wxChar ch) | |
342 | { | |
343 | size_t len = length(); | |
344 | ||
345 | if ( nSize < len ) | |
346 | { | |
347 | erase(begin() + nSize, end()); | |
348 | } | |
349 | else if ( nSize > len ) | |
350 | { | |
351 | append(nSize - len, ch); | |
352 | } | |
353 | //else: we have exactly the specified length, nothing to do | |
354 | } | |
355 | ||
dd1eaa89 | 356 | // allocate enough memory for nLen characters |
e87b7833 | 357 | bool wxStringBase::Alloc(size_t nLen) |
dd1eaa89 VZ |
358 | { |
359 | wxStringData *pData = GetStringData(); | |
360 | if ( pData->nAllocLength <= nLen ) { | |
9fbd8b8d VZ |
361 | if ( pData->IsEmpty() ) { |
362 | nLen += EXTRA_ALLOC; | |
363 | ||
364 | wxStringData* pData = (wxStringData*) | |
b1801e0e GD |
365 | malloc(sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); |
366 | ||
367 | if ( pData == NULL ) { | |
368 | // allocation failure handled by caller | |
369 | return FALSE; | |
370 | } | |
e015c2a3 | 371 | |
9fbd8b8d VZ |
372 | pData->nRefs = 1; |
373 | pData->nDataLength = 0; | |
374 | pData->nAllocLength = nLen; | |
375 | m_pchData = pData->data(); // data starts after wxStringData | |
223d09f6 | 376 | m_pchData[0u] = wxT('\0'); |
9fbd8b8d | 377 | } |
3168a13f VZ |
378 | else if ( pData->IsShared() ) { |
379 | pData->Unlock(); // memory not freed because shared | |
c86f1403 | 380 | size_t nOldLen = pData->nDataLength; |
b1801e0e GD |
381 | if ( !AllocBuffer(nLen) ) { |
382 | // allocation failure handled by caller | |
383 | return FALSE; | |
384 | } | |
2bb67b80 | 385 | memcpy(m_pchData, pData->data(), nOldLen*sizeof(wxChar)); |
3168a13f | 386 | } |
dd1eaa89 | 387 | else { |
3168a13f VZ |
388 | nLen += EXTRA_ALLOC; |
389 | ||
b1801e0e | 390 | pData = (wxStringData *) |
2bb67b80 | 391 | realloc(pData, sizeof(wxStringData) + (nLen + 1)*sizeof(wxChar)); |
3168a13f | 392 | |
b1801e0e GD |
393 | if ( pData == NULL ) { |
394 | // allocation failure handled by caller | |
395 | // keep previous data since reallocation failed | |
396 | return FALSE; | |
dd1eaa89 | 397 | } |
3168a13f VZ |
398 | |
399 | // it's not important if the pointer changed or not (the check for this | |
400 | // is not faster than assigning to m_pchData in all cases) | |
b1801e0e GD |
401 | pData->nAllocLength = nLen; |
402 | m_pchData = pData->data(); | |
dd1eaa89 VZ |
403 | } |
404 | } | |
405 | //else: we've already got enough | |
b1801e0e | 406 | return TRUE; |
dd1eaa89 VZ |
407 | } |
408 | ||
e87b7833 | 409 | wxStringBase::iterator wxStringBase::erase(iterator it) |
dd1eaa89 | 410 | { |
e87b7833 MB |
411 | size_type idx = it - begin(); |
412 | erase(idx, 1); | |
413 | return begin() + idx; | |
414 | } | |
3bbb630a | 415 | |
e87b7833 MB |
416 | wxStringBase& wxStringBase::erase(size_t nStart, size_t nLen) |
417 | { | |
418 | wxASSERT(nStart <= length()); | |
419 | size_t strLen = length() - nStart; | |
420 | // delete nLen or up to the end of the string characters | |
421 | nLen = strLen < nLen ? strLen : nLen; | |
422 | wxString strTmp(c_str(), nStart); | |
423 | strTmp.append(c_str() + nStart + nLen, length() - nStart - nLen); | |
337a0010 | 424 | |
e87b7833 MB |
425 | swap(strTmp); |
426 | return *this; | |
427 | } | |
337a0010 | 428 | |
e87b7833 MB |
429 | wxStringBase& wxStringBase::insert(size_t nPos, const wxChar *sz, size_t n) |
430 | { | |
431 | wxASSERT( nPos <= length() ); | |
3bbb630a | 432 | |
e87b7833 MB |
433 | if ( n == npos ) n = wxStrlen(sz); |
434 | if ( n == 0 ) return *this; | |
435 | ||
436 | if ( !CopyBeforeWrite() || !Alloc(length() + n) ) { | |
437 | wxFAIL_MSG( _T("out of memory in wxStringBase::insert") ); | |
337a0010 | 438 | } |
fbf0c83d | 439 | |
e87b7833 MB |
440 | memmove(m_pchData + nPos + n, m_pchData + nPos, |
441 | (length() - nPos) * sizeof(wxChar)); | |
442 | memcpy(m_pchData + nPos, sz, n * sizeof(wxChar)); | |
443 | GetStringData()->nDataLength = length() + n; | |
444 | m_pchData[length()] = '\0'; | |
b1801e0e | 445 | |
e87b7833 | 446 | return *this; |
dd1eaa89 VZ |
447 | } |
448 | ||
e87b7833 | 449 | void wxStringBase::swap(wxStringBase& str) |
c801d85f | 450 | { |
e87b7833 MB |
451 | wxChar* tmp = str.m_pchData; |
452 | str.m_pchData = m_pchData; | |
453 | m_pchData = tmp; | |
c801d85f KB |
454 | } |
455 | ||
e87b7833 | 456 | size_t wxStringBase::find(const wxStringBase& str, size_t nStart) const |
097c080b | 457 | { |
e87b7833 MB |
458 | wxASSERT( str.GetStringData()->IsValid() ); |
459 | wxASSERT( nStart <= length() ); | |
460 | ||
461 | const wxChar *p = wxStrstr(c_str() + nStart, str.c_str()); | |
462 | ||
463 | return p == NULL ? npos : p - c_str(); | |
097c080b VZ |
464 | } |
465 | ||
e87b7833 | 466 | size_t wxStringBase::find(const wxChar* sz, size_t nStart, size_t n) const |
8f06a017 | 467 | { |
e87b7833 | 468 | return find(wxStringBase(sz, n), nStart); |
8f06a017 RD |
469 | } |
470 | ||
e87b7833 MB |
471 | size_t wxStringBase::find(wxChar ch, size_t nStart) const |
472 | { | |
473 | wxASSERT( nStart <= length() ); | |
c801d85f | 474 | |
e87b7833 | 475 | const wxChar *p = wxStrchr(c_str() + nStart, ch); |
c801d85f | 476 | |
e87b7833 | 477 | return p == NULL ? npos : p - c_str(); |
c801d85f KB |
478 | } |
479 | ||
e87b7833 | 480 | size_t wxStringBase::rfind(const wxStringBase& str, size_t nStart) const |
c801d85f | 481 | { |
e87b7833 MB |
482 | wxASSERT( str.GetStringData()->IsValid() ); |
483 | wxASSERT( nStart == npos || nStart <= length() ); | |
097c080b | 484 | |
e87b7833 MB |
485 | // TODO could be made much quicker than that |
486 | const wxChar *p = c_str() + (nStart == npos ? length() : nStart); | |
487 | while ( p >= c_str() + str.length() ) { | |
488 | if ( wxStrncmp(p - str.length(), str.c_str(), str.length()) == 0 ) | |
489 | return p - str.length() - c_str(); | |
490 | p--; | |
c801d85f KB |
491 | } |
492 | ||
e87b7833 | 493 | return npos; |
c801d85f KB |
494 | } |
495 | ||
e87b7833 | 496 | size_t wxStringBase::rfind(const wxChar* sz, size_t nStart, size_t n) const |
c801d85f | 497 | { |
e87b7833 | 498 | return rfind(wxStringBase(sz, n), nStart); |
c801d85f KB |
499 | } |
500 | ||
e87b7833 | 501 | size_t wxStringBase::rfind(wxChar ch, size_t nStart) const |
c801d85f | 502 | { |
e87b7833 MB |
503 | if ( nStart == npos ) |
504 | { | |
505 | nStart = length(); | |
506 | } | |
507 | else | |
508 | { | |
509 | wxASSERT( nStart <= length() ); | |
510 | } | |
c801d85f | 511 | |
e87b7833 | 512 | const wxChar *p = wxStrrchr(c_str(), ch); |
2bb67b80 | 513 | |
e87b7833 MB |
514 | if ( p == NULL ) |
515 | return npos; | |
516 | ||
517 | size_t result = p - c_str(); | |
518 | return ( result > nStart ) ? npos : result; | |
c801d85f KB |
519 | } |
520 | ||
e87b7833 | 521 | size_t wxStringBase::find_first_of(const wxChar* sz, size_t nStart) const |
c801d85f | 522 | { |
e87b7833 MB |
523 | const wxChar *start = c_str() + nStart; |
524 | const wxChar *firstOf = wxStrpbrk(start, sz); | |
525 | if ( firstOf ) | |
526 | return firstOf - c_str(); | |
527 | else | |
528 | return npos; | |
c801d85f | 529 | } |
e87b7833 MB |
530 | |
531 | size_t wxStringBase::find_last_of(const wxChar* sz, size_t nStart) const | |
532 | { | |
533 | if ( nStart == npos ) | |
534 | { | |
535 | nStart = length(); | |
536 | } | |
537 | else | |
538 | { | |
539 | wxASSERT( nStart <= length() ); | |
540 | } | |
541 | ||
542 | for ( const wxChar *p = c_str() + length() - 1; p >= c_str(); p-- ) | |
543 | { | |
544 | if ( wxStrchr(sz, *p) ) | |
545 | return p - c_str(); | |
546 | } | |
547 | ||
548 | return npos; | |
549 | } | |
550 | ||
551 | size_t wxStringBase::find_first_not_of(const wxChar* sz, size_t nStart) const | |
552 | { | |
553 | if ( nStart == npos ) | |
554 | { | |
555 | nStart = length(); | |
556 | } | |
557 | else | |
558 | { | |
559 | wxASSERT( nStart <= length() ); | |
560 | } | |
561 | ||
562 | size_t nAccept = wxStrspn(c_str() + nStart, sz); | |
563 | if ( nAccept >= length() - nStart ) | |
564 | return npos; | |
565 | else | |
566 | return nAccept; | |
567 | } | |
568 | ||
569 | size_t wxStringBase::find_first_not_of(wxChar ch, size_t nStart) const | |
570 | { | |
571 | wxASSERT( nStart <= length() ); | |
572 | ||
573 | for ( const wxChar *p = c_str() + nStart; *p; p++ ) | |
574 | { | |
575 | if ( *p != ch ) | |
576 | return p - c_str(); | |
577 | } | |
578 | ||
579 | return npos; | |
580 | } | |
581 | ||
582 | size_t wxStringBase::find_last_not_of(const wxChar* sz, size_t nStart) const | |
583 | { | |
584 | if ( nStart == npos ) | |
585 | { | |
586 | nStart = length(); | |
587 | } | |
588 | else | |
589 | { | |
590 | wxASSERT( nStart <= length() ); | |
591 | } | |
592 | ||
593 | for ( const wxChar *p = c_str() + nStart - 1; p >= c_str(); p-- ) | |
594 | { | |
595 | if ( !wxStrchr(sz, *p) ) | |
596 | return p - c_str(); | |
597 | } | |
598 | ||
599 | return npos; | |
600 | } | |
601 | ||
602 | size_t wxStringBase::find_last_not_of(wxChar ch, size_t nStart) const | |
603 | { | |
604 | if ( nStart == npos ) | |
605 | { | |
606 | nStart = length(); | |
607 | } | |
608 | else | |
609 | { | |
610 | wxASSERT( nStart <= length() ); | |
611 | } | |
612 | ||
613 | for ( const wxChar *p = c_str() + nStart - 1; p >= c_str(); p-- ) | |
614 | { | |
615 | if ( *p != ch ) | |
616 | return p - c_str(); | |
617 | } | |
618 | ||
619 | return npos; | |
620 | } | |
621 | ||
622 | wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen, | |
623 | const wxChar *sz) | |
624 | { | |
625 | wxASSERT_MSG( nStart <= length(), | |
626 | _T("index out of bounds in wxStringBase::replace") ); | |
627 | size_t strLen = length() - nStart; | |
628 | nLen = strLen < nLen ? strLen : nLen; | |
629 | ||
630 | wxStringBase strTmp; | |
631 | strTmp.reserve(length()); // micro optimisation to avoid multiple mem allocs | |
632 | ||
633 | if ( nStart != 0 ) | |
634 | strTmp.append(c_str(), nStart); | |
635 | strTmp.append(sz); | |
636 | strTmp.append(c_str() + nStart + nLen); | |
637 | ||
638 | swap(strTmp); | |
639 | return *this; | |
640 | } | |
641 | ||
642 | wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen, | |
643 | size_t nCount, wxChar ch) | |
644 | { | |
645 | return replace(nStart, nLen, wxStringBase(ch, nCount).c_str()); | |
646 | } | |
647 | ||
648 | wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen, | |
649 | const wxStringBase& str, | |
650 | size_t nStart2, size_t nLen2) | |
651 | { | |
652 | return replace(nStart, nLen, str.substr(nStart2, nLen2)); | |
653 | } | |
654 | ||
655 | wxStringBase& wxStringBase::replace(size_t nStart, size_t nLen, | |
656 | const wxChar* sz, size_t nCount) | |
657 | { | |
658 | return replace(nStart, nLen, wxStringBase(sz, nCount).c_str()); | |
659 | } | |
660 | ||
661 | wxStringBase wxStringBase::substr(size_t nStart, size_t nLen) const | |
662 | { | |
663 | if ( nLen == npos ) | |
664 | nLen = length() - nStart; | |
665 | return wxStringBase(*this, nStart, nLen); | |
666 | } | |
667 | ||
668 | // assigns one string to another | |
669 | wxStringBase& wxStringBase::operator=(const wxStringBase& stringSrc) | |
670 | { | |
671 | wxASSERT( stringSrc.GetStringData()->IsValid() ); | |
672 | ||
673 | // don't copy string over itself | |
674 | if ( m_pchData != stringSrc.m_pchData ) { | |
675 | if ( stringSrc.GetStringData()->IsEmpty() ) { | |
676 | Reinit(); | |
677 | } | |
678 | else { | |
679 | // adjust references | |
680 | GetStringData()->Unlock(); | |
681 | m_pchData = stringSrc.m_pchData; | |
682 | GetStringData()->Lock(); | |
683 | } | |
684 | } | |
685 | ||
686 | return *this; | |
687 | } | |
688 | ||
689 | // assigns a single character | |
690 | wxStringBase& wxStringBase::operator=(wxChar ch) | |
691 | { | |
692 | if ( !AssignCopy(1, &ch) ) { | |
693 | wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(wxChar)") ); | |
694 | } | |
695 | return *this; | |
696 | } | |
697 | ||
698 | // assigns C string | |
699 | wxStringBase& wxStringBase::operator=(const wxChar *psz) | |
700 | { | |
701 | if ( !AssignCopy(wxStrlen(psz), psz) ) { | |
702 | wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(const wxChar *)") ); | |
703 | } | |
704 | return *this; | |
705 | } | |
706 | ||
707 | // helper function: does real copy | |
708 | bool wxStringBase::AssignCopy(size_t nSrcLen, const wxChar *pszSrcData) | |
709 | { | |
710 | if ( nSrcLen == 0 ) { | |
711 | Reinit(); | |
712 | } | |
713 | else { | |
714 | if ( !AllocBeforeWrite(nSrcLen) ) { | |
715 | // allocation failure handled by caller | |
716 | return FALSE; | |
717 | } | |
718 | memcpy(m_pchData, pszSrcData, nSrcLen*sizeof(wxChar)); | |
719 | GetStringData()->nDataLength = nSrcLen; | |
720 | m_pchData[nSrcLen] = wxT('\0'); | |
721 | } | |
722 | return TRUE; | |
723 | } | |
724 | ||
725 | // --------------------------------------------------------------------------- | |
726 | // string concatenation | |
727 | // --------------------------------------------------------------------------- | |
c801d85f | 728 | |
c801d85f | 729 | // add something to this string |
e87b7833 MB |
730 | bool wxStringBase::ConcatSelf(size_t nSrcLen, const wxChar *pszSrcData, |
731 | size_t nMaxLen) | |
c801d85f | 732 | { |
3168a13f | 733 | STATISTICS_ADD(SummandLength, nSrcLen); |
c801d85f | 734 | |
e87b7833 MB |
735 | nSrcLen = nSrcLen < nMaxLen ? nSrcLen : nMaxLen; |
736 | ||
05488905 VZ |
737 | // concatenating an empty string is a NOP |
738 | if ( nSrcLen > 0 ) { | |
739 | wxStringData *pData = GetStringData(); | |
740 | size_t nLen = pData->nDataLength; | |
741 | size_t nNewLen = nLen + nSrcLen; | |
c801d85f | 742 | |
05488905 VZ |
743 | // alloc new buffer if current is too small |
744 | if ( pData->IsShared() ) { | |
745 | STATISTICS_ADD(ConcatHit, 0); | |
3168a13f | 746 | |
05488905 VZ |
747 | // we have to allocate another buffer |
748 | wxStringData* pOldData = GetStringData(); | |
b1801e0e GD |
749 | if ( !AllocBuffer(nNewLen) ) { |
750 | // allocation failure handled by caller | |
751 | return FALSE; | |
752 | } | |
2bb67b80 | 753 | memcpy(m_pchData, pOldData->data(), nLen*sizeof(wxChar)); |
05488905 VZ |
754 | pOldData->Unlock(); |
755 | } | |
756 | else if ( nNewLen > pData->nAllocLength ) { | |
757 | STATISTICS_ADD(ConcatHit, 0); | |
3168a13f | 758 | |
e87b7833 | 759 | reserve(nNewLen); |
05488905 | 760 | // we have to grow the buffer |
e87b7833 | 761 | if ( capacity() < nNewLen ) { |
b1801e0e GD |
762 | // allocation failure handled by caller |
763 | return FALSE; | |
764 | } | |
05488905 VZ |
765 | } |
766 | else { | |
767 | STATISTICS_ADD(ConcatHit, 1); | |
3168a13f | 768 | |
05488905 VZ |
769 | // the buffer is already big enough |
770 | } | |
3168a13f | 771 | |
05488905 VZ |
772 | // should be enough space |
773 | wxASSERT( nNewLen <= GetStringData()->nAllocLength ); | |
3168a13f | 774 | |
05488905 | 775 | // fast concatenation - all is done in our buffer |
2bb67b80 | 776 | memcpy(m_pchData + nLen, pszSrcData, nSrcLen*sizeof(wxChar)); |
3168a13f | 777 | |
e87b7833 MB |
778 | m_pchData[nNewLen] = wxT('\0'); // put terminating '\0' |
779 | GetStringData()->nDataLength = nNewLen; // and fix the length | |
780 | } | |
781 | //else: the string to append was empty | |
782 | return TRUE; | |
783 | } | |
784 | ||
785 | // --------------------------------------------------------------------------- | |
786 | // simple sub-string extraction | |
787 | // --------------------------------------------------------------------------- | |
788 | ||
789 | // helper function: clone the data attached to this string | |
790 | bool wxStringBase::AllocCopy(wxString& dest, int nCopyLen, int nCopyIndex) const | |
791 | { | |
792 | if ( nCopyLen == 0 ) { | |
793 | dest.Init(); | |
794 | } | |
795 | else { | |
796 | if ( !dest.AllocBuffer(nCopyLen) ) { | |
797 | // allocation failure handled by caller | |
798 | return FALSE; | |
799 | } | |
800 | memcpy(dest.m_pchData, m_pchData + nCopyIndex, nCopyLen*sizeof(wxChar)); | |
801 | } | |
802 | return TRUE; | |
803 | } | |
804 | ||
805 | #endif // !wxUSE_STL | |
806 | ||
807 | #if !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE) | |
808 | ||
809 | #if !wxUSE_STL | |
810 | #define STRINGCLASS wxStringBase | |
811 | #else | |
812 | #define STRINGCLASS wxString | |
813 | #endif | |
814 | ||
815 | static inline int wxDoCmp(const wxChar* s1, size_t l1, | |
816 | const wxChar* s2, size_t l2) | |
817 | { | |
818 | if( l1 == l2 ) | |
819 | return wxStrncmp(s1, s2, l1); | |
820 | else if( l1 < l2 ) | |
821 | { | |
822 | int ret = wxStrncmp(s1, s2, l1); | |
823 | return ret == 0 ? -1 : ret; | |
824 | } | |
825 | else if( l1 > l2 ) | |
826 | { | |
827 | int ret = wxStrncmp(s1, s2, l2); | |
828 | return ret == 0 ? +1 : ret; | |
829 | } | |
830 | ||
831 | wxFAIL; // must never get there | |
832 | return 0; // quiet compilers | |
833 | } | |
834 | ||
835 | #if wxUSE_STL | |
836 | ||
837 | int STRINGCLASS::compare(const wxStringBase& str) const | |
838 | { | |
839 | return ::wxDoCmp(data(), length(), str.data(), str.length()); | |
840 | } | |
841 | ||
842 | #endif | |
843 | ||
844 | int STRINGCLASS::compare(size_t nStart, size_t nLen, | |
845 | const wxStringBase& str) const | |
846 | { | |
847 | wxASSERT(nStart <= length()); | |
848 | size_type strLen = length() - nStart; | |
849 | nLen = strLen < nLen ? strLen : nLen; | |
850 | return ::wxDoCmp(data() + nStart, nLen, str.data(), str.length()); | |
851 | } | |
852 | ||
853 | int STRINGCLASS::compare(size_t nStart, size_t nLen, | |
854 | const wxStringBase& str, | |
855 | size_t nStart2, size_t nLen2) const | |
856 | { | |
857 | wxASSERT(nStart <= length()); | |
858 | wxASSERT(nStart2 <= str.length()); | |
859 | size_type strLen = length() - nStart, | |
860 | strLen2 = str.length() - nStart2; | |
861 | nLen = strLen < nLen ? strLen : nLen; | |
862 | nLen2 = strLen2 < nLen2 ? strLen2 : nLen2; | |
863 | return ::wxDoCmp(data() + nStart, nLen, str.data() + nStart2, nLen2); | |
864 | } | |
865 | ||
866 | #if wxUSE_STL | |
867 | ||
868 | int STRINGCLASS::compare(const wxChar* sz) const | |
869 | { | |
870 | size_t nLen = wxStrlen(sz); | |
871 | return ::wxDoCmp(data(), length(), sz, nLen); | |
872 | } | |
873 | ||
874 | #endif | |
875 | ||
876 | int STRINGCLASS::compare(size_t nStart, size_t nLen, | |
877 | const wxChar* sz, size_t nCount) const | |
878 | { | |
879 | wxASSERT(nStart <= length()); | |
880 | size_type strLen = length() - nStart; | |
881 | nLen = strLen < nLen ? strLen : nLen; | |
882 | if( nCount == npos ) | |
883 | nCount = wxStrlen(sz); | |
884 | ||
885 | return ::wxDoCmp(data() + nStart, nLen, sz, nCount); | |
886 | } | |
887 | ||
888 | #undef STRINGCLASS | |
889 | ||
890 | #endif // !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE) | |
891 | ||
892 | // =========================================================================== | |
893 | // wxString class core | |
894 | // =========================================================================== | |
895 | ||
896 | // --------------------------------------------------------------------------- | |
897 | // construction | |
898 | // --------------------------------------------------------------------------- | |
899 | ||
900 | #if wxUSE_UNICODE | |
901 | ||
902 | // from multibyte string | |
903 | wxString::wxString(const char *psz, wxMBConv& conv, size_t nLength) | |
904 | { | |
905 | // first get the size of the buffer we need | |
906 | size_t nLen; | |
907 | if ( psz ) | |
908 | { | |
909 | // calculate the needed size ourselves or use the provided one | |
910 | nLen = nLength == npos ? conv.MB2WC(NULL, psz, 0) : nLength; | |
911 | } | |
912 | else | |
913 | { | |
914 | // nothing to convert | |
915 | nLen = 0; | |
916 | } | |
917 | ||
918 | // anything to do? | |
919 | if ( (nLen != 0) && (nLen != (size_t)-1) ) | |
920 | { | |
921 | if ( !Alloc(nLen) ) | |
922 | { | |
923 | wxFAIL_MSG( _T("out of memory in wxString::wxString") ); | |
924 | } | |
925 | else | |
926 | { | |
927 | wxWCharBuffer buf(nLen + 1); | |
928 | // MB2WC wants the buffer size, not the string length hence +1 | |
929 | nLen = conv.MB2WC(buf.data(), psz, nLen + 1); | |
930 | ||
931 | if ( nLen != (size_t)-1 ) | |
932 | { | |
933 | // initialized ok, set the real length as nLength specified by | |
934 | // the caller could be greater than the real string length | |
935 | assign(buf.data(), nLen); | |
936 | return; | |
937 | } | |
938 | //else: the conversion failed -- leave the string empty (what else?) | |
939 | } | |
940 | } | |
941 | } | |
942 | ||
943 | #else // ANSI | |
944 | ||
945 | #if wxUSE_WCHAR_T | |
946 | // from wide string | |
947 | wxString::wxString(const wchar_t *pwz, wxMBConv& conv, size_t nLength) | |
948 | { | |
949 | // first get the size of the buffer we need | |
950 | size_t nLen; | |
951 | if ( pwz ) | |
952 | { | |
953 | // calculate the needed size ourselves or use the provided one | |
954 | nLen = nLength == npos ? conv.WC2MB(NULL, pwz, 0) : nLength; | |
955 | } | |
956 | else | |
957 | { | |
958 | // nothing to convert | |
959 | nLen = 0; | |
960 | } | |
961 | ||
962 | // anything to do? | |
963 | if ( (nLen != 0) && (nLen != (size_t)-1) ) | |
964 | { | |
965 | if ( !Alloc(nLen) ) | |
966 | { | |
967 | wxFAIL_MSG( _T("out of memory in wxString::wxString") ); | |
968 | } | |
969 | else | |
970 | { | |
971 | wxCharBuffer buf(nLen); | |
972 | // WC2MB wants the buffer size, not the string length | |
973 | if ( conv.WC2MB(buf.data(), pwz, nLen + 1) != (size_t)-1 ) | |
974 | { | |
975 | // initialized ok | |
976 | assign(buf.data(), nLen); | |
977 | return; | |
978 | } | |
979 | //else: the conversion failed -- leave the string empty (what else?) | |
980 | } | |
981 | } | |
982 | ||
983 | // leave empty | |
984 | } | |
985 | #endif // wxUSE_WCHAR_T | |
986 | ||
987 | #endif // Unicode/ANSI | |
988 | ||
989 | // shrink to minimal size (releasing extra memory) | |
990 | bool wxString::Shrink() | |
991 | { | |
992 | wxString tmp(begin(), end()); | |
993 | swap(tmp); | |
994 | return tmp.length() == length(); | |
995 | } | |
996 | ||
997 | #if !wxUSE_STL | |
998 | // get the pointer to writable buffer of (at least) nLen bytes | |
999 | wxChar *wxString::GetWriteBuf(size_t nLen) | |
1000 | { | |
1001 | if ( !AllocBeforeWrite(nLen) ) { | |
1002 | // allocation failure handled by caller | |
1003 | return NULL; | |
1004 | } | |
1005 | ||
1006 | wxASSERT( GetStringData()->nRefs == 1 ); | |
1007 | GetStringData()->Validate(FALSE); | |
1008 | ||
1009 | return m_pchData; | |
1010 | } | |
1011 | ||
1012 | // put string back in a reasonable state after GetWriteBuf | |
1013 | void wxString::UngetWriteBuf() | |
1014 | { | |
1015 | GetStringData()->nDataLength = wxStrlen(m_pchData); | |
1016 | GetStringData()->Validate(TRUE); | |
1017 | } | |
1018 | ||
1019 | void wxString::UngetWriteBuf(size_t nLen) | |
1020 | { | |
1021 | GetStringData()->nDataLength = nLen; | |
1022 | GetStringData()->Validate(TRUE); | |
1023 | } | |
1024 | #endif | |
1025 | ||
1026 | // --------------------------------------------------------------------------- | |
1027 | // data access | |
1028 | // --------------------------------------------------------------------------- | |
1029 | ||
1030 | // all functions are inline in string.h | |
1031 | ||
1032 | // --------------------------------------------------------------------------- | |
1033 | // assignment operators | |
1034 | // --------------------------------------------------------------------------- | |
1035 | ||
1036 | #if !wxUSE_UNICODE | |
1037 | ||
1038 | // same as 'signed char' variant | |
1039 | wxString& wxString::operator=(const unsigned char* psz) | |
1040 | { | |
1041 | *this = (const char *)psz; | |
1042 | return *this; | |
1043 | } | |
1044 | ||
1045 | #if wxUSE_WCHAR_T | |
1046 | wxString& wxString::operator=(const wchar_t *pwz) | |
1047 | { | |
1048 | wxString str(pwz); | |
1049 | swap(str); | |
1050 | return *this; | |
c801d85f | 1051 | } |
e87b7833 MB |
1052 | #endif |
1053 | ||
1054 | #endif | |
c801d85f KB |
1055 | |
1056 | /* | |
c801d85f KB |
1057 | * concatenation functions come in 5 flavours: |
1058 | * string + string | |
1059 | * char + string and string + char | |
1060 | * C str + string and string + C str | |
1061 | */ | |
1062 | ||
b1801e0e | 1063 | wxString operator+(const wxString& str1, const wxString& str2) |
c801d85f | 1064 | { |
e87b7833 | 1065 | #if !wxUSE_STL |
b1801e0e GD |
1066 | wxASSERT( str1.GetStringData()->IsValid() ); |
1067 | wxASSERT( str2.GetStringData()->IsValid() ); | |
e87b7833 | 1068 | #endif |
097c080b | 1069 | |
b1801e0e GD |
1070 | wxString s = str1; |
1071 | s += str2; | |
3168a13f | 1072 | |
c801d85f KB |
1073 | return s; |
1074 | } | |
1075 | ||
b1801e0e | 1076 | wxString operator+(const wxString& str, wxChar ch) |
c801d85f | 1077 | { |
e87b7833 | 1078 | #if !wxUSE_STL |
b1801e0e | 1079 | wxASSERT( str.GetStringData()->IsValid() ); |
e87b7833 | 1080 | #endif |
3168a13f | 1081 | |
b1801e0e | 1082 | wxString s = str; |
3168a13f | 1083 | s += ch; |
097c080b | 1084 | |
c801d85f KB |
1085 | return s; |
1086 | } | |
1087 | ||
b1801e0e | 1088 | wxString operator+(wxChar ch, const wxString& str) |
c801d85f | 1089 | { |
e87b7833 | 1090 | #if !wxUSE_STL |
b1801e0e | 1091 | wxASSERT( str.GetStringData()->IsValid() ); |
e87b7833 | 1092 | #endif |
097c080b | 1093 | |
3168a13f | 1094 | wxString s = ch; |
b1801e0e | 1095 | s += str; |
3168a13f | 1096 | |
c801d85f KB |
1097 | return s; |
1098 | } | |
1099 | ||
b1801e0e | 1100 | wxString operator+(const wxString& str, const wxChar *psz) |
c801d85f | 1101 | { |
e87b7833 | 1102 | #if !wxUSE_STL |
b1801e0e | 1103 | wxASSERT( str.GetStringData()->IsValid() ); |
e87b7833 | 1104 | #endif |
097c080b | 1105 | |
c801d85f | 1106 | wxString s; |
b1801e0e GD |
1107 | if ( !s.Alloc(wxStrlen(psz) + str.Len()) ) { |
1108 | wxFAIL_MSG( _T("out of memory in wxString::operator+") ); | |
1109 | } | |
1110 | s = str; | |
3168a13f VZ |
1111 | s += psz; |
1112 | ||
c801d85f KB |
1113 | return s; |
1114 | } | |
1115 | ||
b1801e0e | 1116 | wxString operator+(const wxChar *psz, const wxString& str) |
c801d85f | 1117 | { |
e87b7833 | 1118 | #if !wxUSE_STL |
b1801e0e | 1119 | wxASSERT( str.GetStringData()->IsValid() ); |
e87b7833 | 1120 | #endif |
097c080b | 1121 | |
c801d85f | 1122 | wxString s; |
b1801e0e GD |
1123 | if ( !s.Alloc(wxStrlen(psz) + str.Len()) ) { |
1124 | wxFAIL_MSG( _T("out of memory in wxString::operator+") ); | |
1125 | } | |
3168a13f | 1126 | s = psz; |
b1801e0e | 1127 | s += str; |
3168a13f | 1128 | |
c801d85f KB |
1129 | return s; |
1130 | } | |
1131 | ||
1132 | // =========================================================================== | |
1133 | // other common string functions | |
1134 | // =========================================================================== | |
1135 | ||
b1ac3b56 | 1136 | #if wxUSE_UNICODE |
e015c2a3 VZ |
1137 | |
1138 | wxString wxString::FromAscii(const char *ascii) | |
b1ac3b56 RR |
1139 | { |
1140 | if (!ascii) | |
1141 | return wxEmptyString; | |
e015c2a3 | 1142 | |
b1ac3b56 RR |
1143 | size_t len = strlen( ascii ); |
1144 | wxString res; | |
e015c2a3 VZ |
1145 | |
1146 | if ( len ) | |
1147 | { | |
1148 | wxStringBuffer buf(res, len); | |
1149 | ||
1150 | wchar_t *dest = buf; | |
1151 | ||
1152 | for ( ;; ) | |
1153 | { | |
1154 | if ( (*dest++ = (wchar_t)(unsigned char)*ascii++) == L'\0' ) | |
1155 | break; | |
1156 | } | |
1157 | } | |
1158 | ||
b1ac3b56 RR |
1159 | return res; |
1160 | } | |
1161 | ||
2b5f62a0 VZ |
1162 | wxString wxString::FromAscii(const char ascii) |
1163 | { | |
1164 | // What do we do with '\0' ? | |
1165 | ||
1166 | wxString res; | |
1167 | res += (wchar_t)(unsigned char) ascii; | |
8760bc65 | 1168 | |
2b5f62a0 VZ |
1169 | return res; |
1170 | } | |
1171 | ||
b1ac3b56 RR |
1172 | const wxCharBuffer wxString::ToAscii() const |
1173 | { | |
e015c2a3 VZ |
1174 | // this will allocate enough space for the terminating NUL too |
1175 | wxCharBuffer buffer(length()); | |
b1ac3b56 | 1176 | |
e015c2a3 VZ |
1177 | signed char *dest = (signed char *)buffer.data(); |
1178 | ||
1179 | const wchar_t *pwc = c_str(); | |
1180 | for ( ;; ) | |
b1ac3b56 | 1181 | { |
e015c2a3 VZ |
1182 | *dest++ = *pwc > SCHAR_MAX ? '_' : *pwc; |
1183 | ||
1184 | // the output string can't have embedded NULs anyhow, so we can safely | |
1185 | // stop at first of them even if we do have any | |
1186 | if ( !*pwc++ ) | |
1187 | break; | |
b1ac3b56 | 1188 | } |
e015c2a3 | 1189 | |
b1ac3b56 RR |
1190 | return buffer; |
1191 | } | |
e015c2a3 VZ |
1192 | |
1193 | #endif // Unicode | |
b1ac3b56 | 1194 | |
c801d85f | 1195 | // extract string of length nCount starting at nFirst |
c801d85f KB |
1196 | wxString wxString::Mid(size_t nFirst, size_t nCount) const |
1197 | { | |
e87b7833 | 1198 | size_t nLen = length(); |
30d9011f | 1199 | |
e87b7833 MB |
1200 | // default value of nCount is npos and means "till the end" |
1201 | if ( nCount == npos ) | |
30d9011f VZ |
1202 | { |
1203 | nCount = nLen - nFirst; | |
1204 | } | |
1205 | ||
c801d85f | 1206 | // out-of-bounds requests return sensible things |
30d9011f VZ |
1207 | if ( nFirst + nCount > nLen ) |
1208 | { | |
1209 | nCount = nLen - nFirst; | |
1210 | } | |
c801d85f | 1211 | |
30d9011f VZ |
1212 | if ( nFirst > nLen ) |
1213 | { | |
1214 | // AllocCopy() will return empty string | |
c801d85f | 1215 | nCount = 0; |
30d9011f | 1216 | } |
c801d85f | 1217 | |
e87b7833 MB |
1218 | wxString dest(*this, nFirst, nCount); |
1219 | if ( dest.length() != nCount ) { | |
b1801e0e GD |
1220 | wxFAIL_MSG( _T("out of memory in wxString::Mid") ); |
1221 | } | |
30d9011f | 1222 | |
c801d85f KB |
1223 | return dest; |
1224 | } | |
1225 | ||
e87b7833 | 1226 | // check that the string starts with prefix and return the rest of the string |
f6bcfd97 BP |
1227 | // in the provided pointer if it is not NULL, otherwise return FALSE |
1228 | bool wxString::StartsWith(const wxChar *prefix, wxString *rest) const | |
1229 | { | |
1230 | wxASSERT_MSG( prefix, _T("invalid parameter in wxString::StartsWith") ); | |
1231 | ||
1232 | // first check if the beginning of the string matches the prefix: note | |
1233 | // that we don't have to check that we don't run out of this string as | |
1234 | // when we reach the terminating NUL, either prefix string ends too (and | |
1235 | // then it's ok) or we break out of the loop because there is no match | |
1236 | const wxChar *p = c_str(); | |
1237 | while ( *prefix ) | |
1238 | { | |
1239 | if ( *prefix++ != *p++ ) | |
1240 | { | |
1241 | // no match | |
1242 | return FALSE; | |
1243 | } | |
1244 | } | |
1245 | ||
1246 | if ( rest ) | |
1247 | { | |
1248 | // put the rest of the string into provided pointer | |
1249 | *rest = p; | |
1250 | } | |
1251 | ||
1252 | return TRUE; | |
1253 | } | |
1254 | ||
c801d85f KB |
1255 | // extract nCount last (rightmost) characters |
1256 | wxString wxString::Right(size_t nCount) const | |
1257 | { | |
e87b7833 MB |
1258 | if ( nCount > length() ) |
1259 | nCount = length(); | |
c801d85f | 1260 | |
e87b7833 MB |
1261 | wxString dest(*this, length() - nCount, nCount); |
1262 | if ( dest.length() != nCount ) { | |
b1801e0e GD |
1263 | wxFAIL_MSG( _T("out of memory in wxString::Right") ); |
1264 | } | |
c801d85f KB |
1265 | return dest; |
1266 | } | |
1267 | ||
1268 | // get all characters after the last occurence of ch | |
1269 | // (returns the whole string if ch not found) | |
2bb67b80 | 1270 | wxString wxString::AfterLast(wxChar ch) const |
c801d85f KB |
1271 | { |
1272 | wxString str; | |
1273 | int iPos = Find(ch, TRUE); | |
3c67202d | 1274 | if ( iPos == wxNOT_FOUND ) |
c801d85f KB |
1275 | str = *this; |
1276 | else | |
c8cfb486 | 1277 | str = c_str() + iPos + 1; |
c801d85f KB |
1278 | |
1279 | return str; | |
1280 | } | |
1281 | ||
1282 | // extract nCount first (leftmost) characters | |
1283 | wxString wxString::Left(size_t nCount) const | |
1284 | { | |
e87b7833 MB |
1285 | if ( nCount > length() ) |
1286 | nCount = length(); | |
c801d85f | 1287 | |
e87b7833 MB |
1288 | wxString dest(*this, 0, nCount); |
1289 | if ( dest.length() != nCount ) { | |
b1801e0e GD |
1290 | wxFAIL_MSG( _T("out of memory in wxString::Left") ); |
1291 | } | |
c801d85f KB |
1292 | return dest; |
1293 | } | |
1294 | ||
1295 | // get all characters before the first occurence of ch | |
1296 | // (returns the whole string if ch not found) | |
2bb67b80 | 1297 | wxString wxString::BeforeFirst(wxChar ch) const |
c801d85f | 1298 | { |
e87b7833 MB |
1299 | int iPos = Find(ch); |
1300 | if ( iPos == wxNOT_FOUND ) iPos = length(); | |
1301 | return wxString(*this, 0, iPos); | |
c801d85f KB |
1302 | } |
1303 | ||
1304 | /// get all characters before the last occurence of ch | |
1305 | /// (returns empty string if ch not found) | |
2bb67b80 | 1306 | wxString wxString::BeforeLast(wxChar ch) const |
c801d85f KB |
1307 | { |
1308 | wxString str; | |
1309 | int iPos = Find(ch, TRUE); | |
3c67202d | 1310 | if ( iPos != wxNOT_FOUND && iPos != 0 ) |
d1c9bbf6 | 1311 | str = wxString(c_str(), iPos); |
c801d85f KB |
1312 | |
1313 | return str; | |
1314 | } | |
1315 | ||
1316 | /// get all characters after the first occurence of ch | |
1317 | /// (returns empty string if ch not found) | |
2bb67b80 | 1318 | wxString wxString::AfterFirst(wxChar ch) const |
c801d85f KB |
1319 | { |
1320 | wxString str; | |
1321 | int iPos = Find(ch); | |
3c67202d | 1322 | if ( iPos != wxNOT_FOUND ) |
c801d85f KB |
1323 | str = c_str() + iPos + 1; |
1324 | ||
1325 | return str; | |
1326 | } | |
1327 | ||
1328 | // replace first (or all) occurences of some substring with another one | |
a8f1f1b2 VZ |
1329 | size_t |
1330 | wxString::Replace(const wxChar *szOld, const wxChar *szNew, bool bReplaceAll) | |
c801d85f | 1331 | { |
a8f1f1b2 VZ |
1332 | // if we tried to replace an empty string we'd enter an infinite loop below |
1333 | wxCHECK_MSG( szOld && *szOld && szNew, 0, | |
1334 | _T("wxString::Replace(): invalid parameter") ); | |
1335 | ||
c86f1403 | 1336 | size_t uiCount = 0; // count of replacements made |
c801d85f | 1337 | |
2bb67b80 | 1338 | size_t uiOldLen = wxStrlen(szOld); |
c801d85f KB |
1339 | |
1340 | wxString strTemp; | |
e87b7833 | 1341 | const wxChar *pCurrent = c_str(); |
2bb67b80 | 1342 | const wxChar *pSubstr; |
223d09f6 | 1343 | while ( *pCurrent != wxT('\0') ) { |
2bb67b80 | 1344 | pSubstr = wxStrstr(pCurrent, szOld); |
c801d85f KB |
1345 | if ( pSubstr == NULL ) { |
1346 | // strTemp is unused if no replacements were made, so avoid the copy | |
1347 | if ( uiCount == 0 ) | |
1348 | return 0; | |
1349 | ||
1350 | strTemp += pCurrent; // copy the rest | |
1351 | break; // exit the loop | |
1352 | } | |
1353 | else { | |
1354 | // take chars before match | |
e87b7833 MB |
1355 | size_type len = strTemp.length(); |
1356 | strTemp.append(pCurrent, pSubstr - pCurrent); | |
1357 | if ( strTemp.length() != (size_t)(len + pSubstr - pCurrent) ) { | |
b1801e0e GD |
1358 | wxFAIL_MSG( _T("out of memory in wxString::Replace") ); |
1359 | return 0; | |
1360 | } | |
c801d85f KB |
1361 | strTemp += szNew; |
1362 | pCurrent = pSubstr + uiOldLen; // restart after match | |
1363 | ||
1364 | uiCount++; | |
1365 | ||
1366 | // stop now? | |
1367 | if ( !bReplaceAll ) { | |
1368 | strTemp += pCurrent; // copy the rest | |
1369 | break; // exit the loop | |
1370 | } | |
1371 | } | |
1372 | } | |
1373 | ||
1374 | // only done if there were replacements, otherwise would have returned above | |
e87b7833 | 1375 | swap(strTemp); |
c801d85f KB |
1376 | |
1377 | return uiCount; | |
1378 | } | |
1379 | ||
1380 | bool wxString::IsAscii() const | |
1381 | { | |
2bb67b80 | 1382 | const wxChar *s = (const wxChar*) *this; |
c801d85f | 1383 | while(*s){ |
b1e4e7cc | 1384 | if(!isascii(*s)) return(FALSE); |
c801d85f KB |
1385 | s++; |
1386 | } | |
1387 | return(TRUE); | |
1388 | } | |
dd1eaa89 | 1389 | |
c801d85f KB |
1390 | bool wxString::IsWord() const |
1391 | { | |
2bb67b80 | 1392 | const wxChar *s = (const wxChar*) *this; |
c801d85f | 1393 | while(*s){ |
2bb67b80 | 1394 | if(!wxIsalpha(*s)) return(FALSE); |
c801d85f KB |
1395 | s++; |
1396 | } | |
1397 | return(TRUE); | |
1398 | } | |
dd1eaa89 | 1399 | |
c801d85f KB |
1400 | bool wxString::IsNumber() const |
1401 | { | |
2bb67b80 | 1402 | const wxChar *s = (const wxChar*) *this; |
2f74ed28 GT |
1403 | if (wxStrlen(s)) |
1404 | if ((s[0] == '-') || (s[0] == '+')) s++; | |
c801d85f | 1405 | while(*s){ |
2bb67b80 | 1406 | if(!wxIsdigit(*s)) return(FALSE); |
c801d85f KB |
1407 | s++; |
1408 | } | |
1409 | return(TRUE); | |
1410 | } | |
1411 | ||
c801d85f KB |
1412 | wxString wxString::Strip(stripType w) const |
1413 | { | |
1414 | wxString s = *this; | |
1415 | if ( w & leading ) s.Trim(FALSE); | |
1416 | if ( w & trailing ) s.Trim(TRUE); | |
1417 | return s; | |
1418 | } | |
1419 | ||
c801d85f KB |
1420 | // --------------------------------------------------------------------------- |
1421 | // case conversion | |
1422 | // --------------------------------------------------------------------------- | |
1423 | ||
1424 | wxString& wxString::MakeUpper() | |
1425 | { | |
e87b7833 MB |
1426 | for ( iterator it = begin(), en = end(); it != en; ++it ) |
1427 | *it = (wxChar)wxToupper(*it); | |
c801d85f KB |
1428 | |
1429 | return *this; | |
1430 | } | |
1431 | ||
1432 | wxString& wxString::MakeLower() | |
1433 | { | |
e87b7833 MB |
1434 | for ( iterator it = begin(), en = end(); it != en; ++it ) |
1435 | *it = (wxChar)wxTolower(*it); | |
c801d85f KB |
1436 | |
1437 | return *this; | |
1438 | } | |
1439 | ||
1440 | // --------------------------------------------------------------------------- | |
1441 | // trimming and padding | |
1442 | // --------------------------------------------------------------------------- | |
1443 | ||
576c608d VZ |
1444 | // some compilers (VC++ 6.0 not to name them) return TRUE for a call to |
1445 |