]>
Commit | Line | Data |
---|---|---|
3c67202d | 1 | /////////////////////////////////////////////////////////////////////////////// |
c801d85f | 2 | // Name: string.h |
3c67202d | 3 | // Purpose: wxString and wxArrayString classes |
c801d85f KB |
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> | |
dd1eaa89 | 9 | // Licence: wxWindows license |
3c67202d | 10 | /////////////////////////////////////////////////////////////////////////////// |
c801d85f | 11 | |
e90c1d2a VZ |
12 | /* |
13 | Efficient string class [more or less] compatible with MFC CString, | |
14 | wxWindows version 1 wxString and std::string and some handy functions | |
15 | missing from string.h. | |
16 | */ | |
17 | ||
34138703 JS |
18 | #ifndef _WX_WXSTRINGH__ |
19 | #define _WX_WXSTRINGH__ | |
c801d85f KB |
20 | |
21 | #ifdef __GNUG__ | |
e90c1d2a VZ |
22 | #pragma interface "string.h" |
23 | #endif | |
24 | ||
25 | // ---------------------------------------------------------------------------- | |
26 | // conditinal compilation | |
27 | // ---------------------------------------------------------------------------- | |
28 | ||
29 | // compile the std::string compatibility functions if defined | |
30 | #define wxSTD_STRING_COMPATIBILITY | |
31 | ||
e90c1d2a VZ |
32 | // ---------------------------------------------------------------------------- |
33 | // headers | |
34 | // ---------------------------------------------------------------------------- | |
35 | ||
5737d05f VZ |
36 | #include "wx/defs.h" // everybody should include this |
37 | ||
9dea36ef | 38 | #if defined(__WXMAC__) || defined(__VISAGECPP__) |
3f4a0c5b | 39 | #include <ctype.h> |
17dff81c | 40 | #endif |
3f4a0c5b | 41 | |
91b8de8d RR |
42 | #ifdef __EMX__ |
43 | #include <std.h> | |
44 | #endif | |
45 | ||
9dea36ef DW |
46 | #if defined(__VISAGECPP__) && __IBMCPP__ >= 400 |
47 | // problem in VACPP V4 with including stdlib.h multiple times | |
48 | // strconv includes it anyway | |
49 | # include <stdio.h> | |
50 | # include <string.h> | |
51 | # include <stdarg.h> | |
52 | # include <limits.h> | |
53 | #else | |
54 | # include <string.h> | |
55 | # include <stdio.h> | |
56 | # include <stdarg.h> | |
57 | # include <limits.h> | |
58 | # include <stdlib.h> | |
59 | #endif | |
c801d85f | 60 | |
57493f9f | 61 | #ifdef HAVE_STRINGS_H |
1bfcb0b6 | 62 | #include <strings.h> // for strcasecmp() |
d739313f | 63 | #endif // HAVE_STRINGS_H |
1bfcb0b6 | 64 | |
e90c1d2a VZ |
65 | #include "wx/wxchar.h" // for wxChar |
66 | #include "wx/buffer.h" // for wxCharBuffer | |
67 | #include "wx/strconv.h" // for wxConvertXXX() macros and wxMBConv classes | |
3f4a0c5b | 68 | |
c801d85f KB |
69 | // --------------------------------------------------------------------------- |
70 | // macros | |
71 | // --------------------------------------------------------------------------- | |
72 | ||
5737d05f VZ |
73 | // casts [unfortunately!] needed to call some broken functions which require |
74 | // "char *" instead of "const char *" | |
2bb67b80 | 75 | #define WXSTRINGCAST (wxChar *)(const wxChar *) |
e90c1d2a VZ |
76 | #define wxCSTRINGCAST (wxChar *)(const wxChar *) |
77 | #define wxMBSTRINGCAST (char *)(const char *) | |
78 | #define wxWCSTRINGCAST (wchar_t *)(const wchar_t *) | |
c801d85f | 79 | |
3c67202d | 80 | // implementation only |
5737d05f VZ |
81 | #define wxASSERT_VALID_INDEX(i) \ |
82 | wxASSERT_MSG( (size_t)(i) <= Len(), _T("invaid index in wxString") ) | |
c801d85f | 83 | |
e90c1d2a VZ |
84 | // ---------------------------------------------------------------------------- |
85 | // constants | |
86 | // ---------------------------------------------------------------------------- | |
87 | ||
66b6b045 | 88 | #if defined(__VISAGECPP__) && __IBMCPP__ >= 400 |
67b81440 | 89 | // must define this static for VA or else you get multiply defined symbols everywhere |
5d33ed2c | 90 | extern const unsigned int wxSTRING_MAXLEN; |
66b6b045 DW |
91 | |
92 | #else | |
e90c1d2a VZ |
93 | // maximum possible length for a string means "take all string" everywhere |
94 | // (as sizeof(StringData) is unknown here, we substract 100) | |
95 | const unsigned int wxSTRING_MAXLEN = UINT_MAX - 100; | |
96 | ||
66b6b045 DW |
97 | #endif |
98 | ||
e90c1d2a VZ |
99 | // ---------------------------------------------------------------------------- |
100 | // global data | |
101 | // ---------------------------------------------------------------------------- | |
102 | ||
103 | // global pointer to empty string | |
104 | WXDLLEXPORT_DATA(extern const wxChar*) wxEmptyString; | |
6001e347 | 105 | |
c801d85f | 106 | // --------------------------------------------------------------------------- |
e90c1d2a | 107 | // global functions complementing standard C string library replacements for |
3c67202d VZ |
108 | // strlen() and portable strcasecmp() |
109 | //--------------------------------------------------------------------------- | |
e90c1d2a VZ |
110 | |
111 | // Use wxXXX() functions from wxchar.h instead! These functions are for | |
112 | // backwards compatibility only. | |
88150e60 | 113 | |
3c67202d | 114 | // checks whether the passed in pointer is NULL and if the string is empty |
6d56eb5c | 115 | inline bool IsEmpty(const char *p) { return (!p || !*p); } |
c801d85f | 116 | |
3c67202d | 117 | // safe version of strlen() (returns 0 if passed NULL pointer) |
6d56eb5c | 118 | inline size_t Strlen(const char *psz) |
c801d85f KB |
119 | { return psz ? strlen(psz) : 0; } |
120 | ||
3c67202d | 121 | // portable strcasecmp/_stricmp |
6d56eb5c | 122 | inline int Stricmp(const char *psz1, const char *psz2) |
dd1eaa89 | 123 | { |
91b8de8d | 124 | #if defined(__VISUALC__) || ( defined(__MWERKS__) && defined(__INTEL__) ) |
dd1eaa89 | 125 | return _stricmp(psz1, psz2); |
91b8de8d | 126 | #elif defined(__SC__) |
2432b92d | 127 | return _stricmp(psz1, psz2); |
91b8de8d | 128 | #elif defined(__SALFORDC__) |
a3ef5bf5 | 129 | return stricmp(psz1, psz2); |
dd1eaa89 VZ |
130 | #elif defined(__BORLANDC__) |
131 | return stricmp(psz1, psz2); | |
7be1f0d9 JS |
132 | #elif defined(__WATCOMC__) |
133 | return stricmp(psz1, psz2); | |
14704334 VS |
134 | #elif defined(__DJGPP__) |
135 | return stricmp(psz1, psz2); | |
91b8de8d RR |
136 | #elif defined(__EMX__) |
137 | return stricmp(psz1, psz2); | |
e2c87f4c | 138 | #elif defined(__WXPM__) |
1777b9bb | 139 | return stricmp(psz1, psz2); |
91b8de8d | 140 | #elif defined(__UNIX__) || defined(__GNUWIN32__) |
dd1eaa89 | 141 | return strcasecmp(psz1, psz2); |
8be97d65 | 142 | #elif defined(__MWERKS__) && !defined(__INTEL__) |
17dff81c SC |
143 | register char c1, c2; |
144 | do { | |
145 | c1 = tolower(*psz1++); | |
146 | c2 = tolower(*psz2++); | |
147 | } while ( c1 && (c1 == c2) ); | |
148 | ||
149 | return c1 - c2; | |
dd1eaa89 VZ |
150 | #else |
151 | // almost all compilers/libraries provide this function (unfortunately under | |
152 | // different names), that's why we don't implement our own which will surely | |
153 | // be more efficient than this code (uncomment to use): | |
154 | /* | |
155 | register char c1, c2; | |
156 | do { | |
157 | c1 = tolower(*psz1++); | |
158 | c2 = tolower(*psz2++); | |
159 | } while ( c1 && (c1 == c2) ); | |
160 | ||
161 | return c1 - c2; | |
162 | */ | |
163 | ||
164 | #error "Please define string case-insensitive compare for your OS/compiler" | |
165 | #endif // OS/compiler | |
166 | } | |
c801d85f | 167 | |
378b05f7 VZ |
168 | // wxSnprintf() is like snprintf() if it's available and sprintf() (always |
169 | // available, but dangerous!) if not | |
170 | extern int WXDLLEXPORT wxSnprintf(wxChar *buf, size_t len, | |
171 | const wxChar *format, ...); | |
172 | ||
173 | // and wxVsnprintf() is like vsnprintf() or vsprintf() | |
174 | extern int WXDLLEXPORT wxVsnprintf(wxChar *buf, size_t len, | |
175 | const wxChar *format, va_list argptr); | |
176 | ||
f04f3991 | 177 | // return an empty wxString |
f7bd2698 | 178 | class WXDLLEXPORT wxString; // not yet defined |
e90c1d2a | 179 | inline const wxString& wxGetEmptyString() { return *(wxString *)&wxEmptyString; } |
f04f3991 | 180 | |
c801d85f | 181 | // --------------------------------------------------------------------------- |
f04f3991 | 182 | // string data prepended with some housekeeping info (used by wxString class), |
c801d85f KB |
183 | // is never used directly (but had to be put here to allow inlining) |
184 | // --------------------------------------------------------------------------- | |
e90c1d2a | 185 | |
c801d85f KB |
186 | struct WXDLLEXPORT wxStringData |
187 | { | |
188 | int nRefs; // reference count | |
3c024cc2 | 189 | size_t nDataLength, // actual string length |
c801d85f KB |
190 | nAllocLength; // allocated memory size |
191 | ||
2bb67b80 OK |
192 | // mimics declaration 'wxChar data[nAllocLength]' |
193 | wxChar* data() const { return (wxChar*)(this + 1); } | |
c801d85f KB |
194 | |
195 | // empty string has a special ref count so it's never deleted | |
dbda9e86 JS |
196 | bool IsEmpty() const { return (nRefs == -1); } |
197 | bool IsShared() const { return (nRefs > 1); } | |
c801d85f KB |
198 | |
199 | // lock/unlock | |
dd1eaa89 | 200 | void Lock() { if ( !IsEmpty() ) nRefs++; } |
f6bcfd97 BP |
201 | |
202 | // VC++ will refuse to inline this function but profiling shows that it | |
203 | // is wrong | |
204 | #if defined(__VISUALC__) && (__VISUALC__ >= 1200) | |
205 | __forceinline | |
206 | #endif | |
dd1eaa89 | 207 | void Unlock() { if ( !IsEmpty() && --nRefs == 0) free(this); } |
8fd0f20b | 208 | |
dd1eaa89 | 209 | // if we had taken control over string memory (GetWriteBuf), it's |
8fd0f20b | 210 | // intentionally put in invalid state |
dbda9e86 JS |
211 | void Validate(bool b) { nRefs = (b ? 1 : 0); } |
212 | bool IsValid() const { return (nRefs != 0); } | |
c801d85f KB |
213 | }; |
214 | ||
c801d85f | 215 | // --------------------------------------------------------------------------- |
3c67202d VZ |
216 | // This is (yet another one) String class for C++ programmers. It doesn't use |
217 | // any of "advanced" C++ features (i.e. templates, exceptions, namespaces...) | |
218 | // thus you should be able to compile it with practicaly any C++ compiler. | |
219 | // This class uses copy-on-write technique, i.e. identical strings share the | |
220 | // same memory as long as neither of them is changed. | |
221 | // | |
222 | // This class aims to be as compatible as possible with the new standard | |
223 | // std::string class, but adds some additional functions and should be at | |
224 | // least as efficient than the standard implementation. | |
225 | // | |
226 | // Performance note: it's more efficient to write functions which take "const | |
227 | // String&" arguments than "const char *" if you assign the argument to | |
228 | // another string. | |
229 | // | |
230 | // It was compiled and tested under Win32, Linux (libc 5 & 6), Solaris 5.5. | |
231 | // | |
232 | // To do: | |
233 | // - ressource support (string tables in ressources) | |
234 | // - more wide character (UNICODE) support | |
235 | // - regular expressions support | |
c801d85f | 236 | // --------------------------------------------------------------------------- |
3c67202d | 237 | |
3c67202d VZ |
238 | class WXDLLEXPORT wxString |
239 | { | |
fbcb4166 | 240 | friend class WXDLLEXPORT wxArrayString; |
c801d85f | 241 | |
3c67202d VZ |
242 | // NB: special care was taken in arranging the member functions in such order |
243 | // that all inline functions can be effectively inlined, verify that all | |
244 | // performace critical functions are still inlined if you change order! | |
dd1eaa89 VZ |
245 | private: |
246 | // points to data preceded by wxStringData structure with ref count info | |
2bb67b80 | 247 | wxChar *m_pchData; |
dd1eaa89 VZ |
248 | |
249 | // accessor to string data | |
250 | wxStringData* GetStringData() const { return (wxStringData*)m_pchData - 1; } | |
251 | ||
6b95b20d VZ |
252 | // string (re)initialization functions |
253 | // initializes the string to the empty value (must be called only from | |
254 | // ctors, use Reinit() otherwise) | |
e90c1d2a | 255 | void Init() { m_pchData = (wxChar *)wxEmptyString; } |
6b95b20d | 256 | // initializaes the string with (a part of) C-string |
2bb67b80 | 257 | void InitWith(const wxChar *psz, size_t nPos = 0, size_t nLen = wxSTRING_MAXLEN); |
6b95b20d VZ |
258 | // as Init, but also frees old data |
259 | void Reinit() { GetStringData()->Unlock(); Init(); } | |
260 | ||
261 | // memory allocation | |
262 | // allocates memory for string of lenght nLen | |
263 | void AllocBuffer(size_t nLen); | |
264 | // copies data to another string | |
265 | void AllocCopy(wxString&, int, int) const; | |
266 | // effectively copies data to string | |
2bb67b80 | 267 | void AssignCopy(size_t, const wxChar *); |
6b95b20d VZ |
268 | |
269 | // append a (sub)string | |
2bb67b80 | 270 | void ConcatSelf(int nLen, const wxChar *src); |
6b95b20d VZ |
271 | |
272 | // functions called before writing to the string: they copy it if there | |
273 | // are other references to our data (should be the only owner when writing) | |
274 | void CopyBeforeWrite(); | |
275 | void AllocBeforeWrite(size_t); | |
276 | ||
00b4a13e VZ |
277 | // if we hadn't made these operators private, it would be possible to |
278 | // compile "wxString s; s = 17;" without any warnings as 17 is implicitly | |
279 | // converted to char in C and we do have operator=(char) | |
280 | // | |
281 | // NB: we don't need other versions (short/long and unsigned) as attempt | |
282 | // to assign another numeric type to wxString will now result in | |
283 | // ambiguity between operator=(char) and operator=(int) | |
284 | wxString& operator=(int); | |
285 | ||
286 | // these methods are not implemented - there is _no_ conversion from int to | |
c606a9a4 VZ |
287 | // string, you're doing something wrong if the compiler wants to call it! |
288 | // | |
289 | // try `s << i' or `s.Printf("%d", i)' instead | |
290 | wxString(int); | |
c606a9a4 | 291 | |
c801d85f | 292 | public: |
3c67202d VZ |
293 | // constructors and destructor |
294 | // ctor for an empty string | |
6b95b20d | 295 | wxString() { Init(); } |
3c67202d | 296 | // copy ctor |
6b95b20d VZ |
297 | wxString(const wxString& stringSrc) |
298 | { | |
09443a26 VZ |
299 | wxASSERT_MSG( stringSrc.GetStringData()->IsValid(), |
300 | _T("did you forget to call UngetWriteBuf()?") ); | |
6b95b20d VZ |
301 | |
302 | if ( stringSrc.IsEmpty() ) { | |
303 | // nothing to do for an empty string | |
304 | Init(); | |
305 | } | |
306 | else { | |
307 | m_pchData = stringSrc.m_pchData; // share same data | |
308 | GetStringData()->Lock(); // => one more copy | |
309 | } | |
310 | } | |
3c67202d | 311 | // string containing nRepeat copies of ch |
2bb67b80 | 312 | wxString(wxChar ch, size_t nRepeat = 1); |
3c67202d | 313 | // ctor takes first nLength characters from C string |
566b84d2 | 314 | // (default value of wxSTRING_MAXLEN means take all the string) |
2bb67b80 | 315 | wxString(const wxChar *psz, size_t nLength = wxSTRING_MAXLEN) |
6b95b20d | 316 | { InitWith(psz, 0, nLength); } |
f6bcfd97 BP |
317 | wxString(const wxChar *psz, wxMBConv& WXUNUSED(conv), size_t nLength = wxSTRING_MAXLEN) |
318 | { InitWith(psz, 0, nLength); } | |
e90c1d2a | 319 | |
2bb67b80 OK |
320 | #if wxUSE_UNICODE |
321 | // from multibyte string | |
322 | // (NB: nLength is right now number of Unicode characters, not | |
323 | // characters in psz! So try not to use it yet!) | |
5f709e67 | 324 | wxString(const char *psz, wxMBConv& conv = wxConvLibc, size_t nLength = wxSTRING_MAXLEN); |
2bb67b80 OK |
325 | // from wxWCharBuffer (i.e. return from wxGetString) |
326 | wxString(const wxWCharBuffer& psz) | |
327 | { InitWith(psz, 0, wxSTRING_MAXLEN); } | |
e90c1d2a | 328 | #else // ANSI |
3c67202d | 329 | // from C string (for compilers using unsigned char) |
2bb67b80 OK |
330 | wxString(const unsigned char* psz, size_t nLength = wxSTRING_MAXLEN) |
331 | { InitWith((const char*)psz, 0, nLength); } | |
e90c1d2a | 332 | |
6f841509 | 333 | #if wxUSE_WCHAR_T |
2bb67b80 | 334 | // from wide (Unicode) string |
1c2e6a28 | 335 | wxString(const wchar_t *pwz, wxMBConv& conv = wxConvLibc, size_t nLength = wxSTRING_MAXLEN); |
e90c1d2a VZ |
336 | #endif // !wxUSE_WCHAR_T |
337 | ||
2bb67b80 OK |
338 | // from wxCharBuffer |
339 | wxString(const wxCharBuffer& psz) | |
340 | { InitWith(psz, 0, wxSTRING_MAXLEN); } | |
e90c1d2a VZ |
341 | #endif // Unicode/ANSI |
342 | ||
3c67202d | 343 | // dtor is not virtual, this class must not be inherited from! |
6b95b20d | 344 | ~wxString() { GetStringData()->Unlock(); } |
c801d85f | 345 | |
3c67202d VZ |
346 | // generic attributes & operations |
347 | // as standard strlen() | |
47d67540 | 348 | size_t Len() const { return GetStringData()->nDataLength; } |
3c67202d | 349 | // string contains any characters? |
dd1eaa89 | 350 | bool IsEmpty() const { return Len() == 0; } |
dcfde592 VZ |
351 | // empty string is "FALSE", so !str will return TRUE |
352 | bool operator!() const { return IsEmpty(); } | |
735d1db6 VZ |
353 | // truncate the string to given length |
354 | wxString& Truncate(size_t uiLen); | |
3c67202d | 355 | // empty string contents |
dd1eaa89 VZ |
356 | void Empty() |
357 | { | |
735d1db6 | 358 | Truncate(0); |
dd1eaa89 | 359 | |
735d1db6 | 360 | wxASSERT_MSG( IsEmpty(), _T("string not empty after call to Empty()?") ); |
7be07660 | 361 | } |
3c67202d | 362 | // empty the string and free memory |
7be07660 VZ |
363 | void Clear() |
364 | { | |
365 | if ( !GetStringData()->IsEmpty() ) | |
366 | Reinit(); | |
367 | ||
09443a26 VZ |
368 | wxASSERT_MSG( !GetStringData()->nDataLength && |
369 | !GetStringData()->nAllocLength, | |
370 | _T("string should be empty after Clear()") ); | |
dd1eaa89 VZ |
371 | } |
372 | ||
3c67202d VZ |
373 | // contents test |
374 | // Is an ascii value | |
c801d85f | 375 | bool IsAscii() const; |
3c67202d | 376 | // Is a number |
c801d85f | 377 | bool IsNumber() const; |
3c67202d | 378 | // Is a word |
c801d85f | 379 | bool IsWord() const; |
c801d85f | 380 | |
3c67202d VZ |
381 | // data access (all indexes are 0 based) |
382 | // read access | |
2bb67b80 | 383 | wxChar GetChar(size_t n) const |
5737d05f | 384 | { wxASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
3c67202d | 385 | // read/write access |
2bb67b80 | 386 | wxChar& GetWritableChar(size_t n) |
5737d05f | 387 | { wxASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } |
3c67202d | 388 | // write access |
2bb67b80 | 389 | void SetChar(size_t n, wxChar ch) |
5737d05f | 390 | { wxASSERT_VALID_INDEX( n ); CopyBeforeWrite(); m_pchData[n] = ch; } |
c801d85f | 391 | |
3c67202d | 392 | // get last character |
2bb67b80 | 393 | wxChar Last() const |
09443a26 VZ |
394 | { |
395 | wxASSERT_MSG( !IsEmpty(), _T("wxString: index out of bounds") ); | |
396 | ||
397 | return m_pchData[Len() - 1]; | |
398 | } | |
399 | ||
3c67202d | 400 | // get writable last character |
2bb67b80 | 401 | wxChar& Last() |
09443a26 VZ |
402 | { |
403 | wxASSERT_MSG( !IsEmpty(), _T("wxString: index out of bounds") ); | |
404 | CopyBeforeWrite(); | |
405 | return m_pchData[Len()-1]; | |
406 | } | |
c801d85f | 407 | |
d836ee96 VZ |
408 | /* |
409 | So why do we have all these overloaded operator[]s? A bit of history: | |
410 | initially there was only one of them, taking size_t. Then people | |
411 | started complaining because they wanted to use ints as indices (I | |
412 | wonder why) and compilers were giving warnings about it, so we had to | |
413 | add the operator[](int). Then it became apparent that you couldn't | |
414 | write str[0] any longer because there was ambiguity between two | |
415 | overloads and so you now had to write str[0u] (or, of course, use the | |
416 | explicit casts to either int or size_t but nobody did this). | |
417 | ||
418 | Finally, someone decided to compile wxWin on an Alpha machine and got | |
419 | a surprize: str[0u] didn't compile there because it is of type | |
420 | unsigned int and size_t is unsigned _long_ on Alpha and so there was | |
421 | ambiguity between converting uint to int or ulong. To fix this one we | |
422 | now add operator[](uint) for the machines where size_t is not already | |
423 | the same as unsigned int - hopefully this fixes the problem (for some | |
424 | time) | |
425 | ||
426 | The only real fix is, of course, to remove all versions but the one | |
427 | taking size_t... | |
428 | */ | |
429 | ||
3c67202d | 430 | // operator version of GetChar |
2bb67b80 | 431 | wxChar operator[](size_t n) const |
5737d05f | 432 | { wxASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
c5248639 | 433 | |
3c67202d | 434 | // operator version of GetChar |
2bb67b80 | 435 | wxChar operator[](int n) const |
5737d05f | 436 | { wxASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
cd0b1709 | 437 | |
f83db661 | 438 | // operator version of GetWriteableChar |
2bb67b80 | 439 | wxChar& operator[](size_t n) |
5737d05f | 440 | { wxASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } |
d836ee96 VZ |
441 | |
442 | #ifndef wxSIZE_T_IS_UINT | |
443 | // operator version of GetChar | |
444 | wxChar operator[](unsigned int n) const | |
5737d05f | 445 | { wxASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
d836ee96 | 446 | |
f83db661 | 447 | // operator version of GetWriteableChar |
d836ee96 | 448 | wxChar& operator[](unsigned int n) |
5737d05f | 449 | { wxASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } |
d836ee96 | 450 | #endif // size_t != unsigned int |
c801d85f | 451 | |
3c67202d | 452 | // implicit conversion to C string |
2bb67b80 | 453 | operator const wxChar*() const { return m_pchData; } |
3c67202d | 454 | // explicit conversion to C string (use this with printf()!) |
2bb67b80 | 455 | const wxChar* c_str() const { return m_pchData; } |
f6bcfd97 | 456 | // identical to c_str() |
6f841509 | 457 | const wxChar* wx_str() const { return m_pchData; } |
e90c1d2a | 458 | // identical to c_str() |
2bb67b80 | 459 | const wxChar* GetData() const { return m_pchData; } |
e90c1d2a VZ |
460 | |
461 | // conversions with (possible) format convertions: have to return a | |
462 | // buffer with temporary data | |
f6bcfd97 BP |
463 | // |
464 | // the functions defined (in either Unicode or ANSI) mode are mb_str() to | |
465 | // return an ANSI (multibyte) string, wc_str() to return a wide string and | |
466 | // fn_str() to return a string which should be used with the OS APIs | |
467 | // accepting the file names. The return value is always the same, but the | |
468 | // type differs because a function may either return pointer to the buffer | |
469 | // directly or have to use intermediate buffer for translation. | |
2bb67b80 | 470 | #if wxUSE_UNICODE |
f6bcfd97 BP |
471 | const wxCharBuffer mb_str(wxMBConv& conv = wxConvLibc) const |
472 | { return conv.cWC2MB(m_pchData); } | |
473 | ||
e90c1d2a VZ |
474 | const wxWX2MBbuf mbc_str() const { return mb_str(*wxConvCurrent); } |
475 | ||
f6bcfd97 BP |
476 | const wxChar* wc_str() const { return m_pchData; } |
477 | ||
478 | // for compatibility with !wxUSE_UNICODE version | |
479 | const wxChar* wc_str(wxMBConv& WXUNUSED(conv)) const { return m_pchData; } | |
e90c1d2a | 480 | |
2bb67b80 | 481 | #if wxMBFILES |
5f709e67 | 482 | const wxCharBuffer fn_str() const { return mb_str(wxConvFile); } |
e90c1d2a | 483 | #else // !wxMBFILES |
2bb67b80 | 484 | const wxChar* fn_str() const { return m_pchData; } |
e90c1d2a VZ |
485 | #endif // wxMBFILES/!wxMBFILES |
486 | #else // ANSI | |
e90c1d2a | 487 | const wxChar* mb_str() const { return m_pchData; } |
f6bcfd97 BP |
488 | |
489 | // for compatibility with wxUSE_UNICODE version | |
490 | const wxChar* mb_str(wxMBConv& WXUNUSED(conv)) const { return m_pchData; } | |
491 | ||
e90c1d2a | 492 | const wxWX2MBbuf mbc_str() const { return mb_str(); } |
f6bcfd97 | 493 | |
6f841509 | 494 | #if wxUSE_WCHAR_T |
f6bcfd97 BP |
495 | const wxWCharBuffer wc_str(wxMBConv& conv) const |
496 | { return conv.cMB2WC(m_pchData); } | |
e90c1d2a | 497 | #endif // wxUSE_WCHAR_T |
f6bcfd97 | 498 | |
2bb67b80 | 499 | const wxChar* fn_str() const { return m_pchData; } |
e90c1d2a | 500 | #endif // Unicode/ANSI |
c801d85f | 501 | |
3c67202d VZ |
502 | // overloaded assignment |
503 | // from another wxString | |
c801d85f | 504 | wxString& operator=(const wxString& stringSrc); |
3c67202d | 505 | // from a character |
2bb67b80 | 506 | wxString& operator=(wxChar ch); |
3c67202d | 507 | // from a C string |
2bb67b80 | 508 | wxString& operator=(const wxChar *psz); |
111bb7f2 OK |
509 | #if wxUSE_UNICODE |
510 | // from wxWCharBuffer | |
511 | wxString& operator=(const wxWCharBuffer& psz) { return operator=((const wchar_t *)psz); } | |
e90c1d2a | 512 | #else // ANSI |
3c67202d | 513 | // from another kind of C string |
c801d85f | 514 | wxString& operator=(const unsigned char* psz); |
6f841509 | 515 | #if wxUSE_WCHAR_T |
3c67202d | 516 | // from a wide string |
c801d85f | 517 | wxString& operator=(const wchar_t *pwz); |
6f841509 | 518 | #endif |
111bb7f2 OK |
519 | // from wxCharBuffer |
520 | wxString& operator=(const wxCharBuffer& psz) { return operator=((const char *)psz); } | |
e90c1d2a | 521 | #endif // Unicode/ANSI |
3c67202d VZ |
522 | |
523 | // string concatenation | |
524 | // in place concatenation | |
525 | /* | |
526 | Concatenate and return the result. Note that the left to right | |
527 | associativity of << allows to write things like "str << str1 << str2 | |
528 | << ..." (unlike with +=) | |
529 | */ | |
530 | // string += string | |
dd1eaa89 VZ |
531 | wxString& operator<<(const wxString& s) |
532 | { | |
09443a26 VZ |
533 | wxASSERT_MSG( s.GetStringData()->IsValid(), |
534 | _T("did you forget to call UngetWriteBuf()?") ); | |
dd1eaa89 VZ |
535 | |
536 | ConcatSelf(s.Len(), s); | |
537 | return *this; | |
538 | } | |
3c67202d | 539 | // string += C string |
2bb67b80 OK |
540 | wxString& operator<<(const wxChar *psz) |
541 | { ConcatSelf(wxStrlen(psz), psz); return *this; } | |
3c67202d | 542 | // string += char |
2bb67b80 | 543 | wxString& operator<<(wxChar ch) { ConcatSelf(1, &ch); return *this; } |
dd1eaa89 | 544 | |
3c67202d | 545 | // string += string |
6b95b20d | 546 | void operator+=(const wxString& s) { (void)operator<<(s); } |
3c67202d | 547 | // string += C string |
2bb67b80 | 548 | void operator+=(const wxChar *psz) { (void)operator<<(psz); } |
3c67202d | 549 | // string += char |
2bb67b80 OK |
550 | void operator+=(wxChar ch) { (void)operator<<(ch); } |
551 | ||
552 | // string += buffer (i.e. from wxGetString) | |
553 | #if wxUSE_UNICODE | |
09443a26 VZ |
554 | wxString& operator<<(const wxWCharBuffer& s) |
555 | { (void)operator<<((const wchar_t *)s); return *this; } | |
556 | void operator+=(const wxWCharBuffer& s) | |
557 | { (void)operator<<((const wchar_t *)s); } | |
558 | #else // !wxUSE_UNICODE | |
559 | wxString& operator<<(const wxCharBuffer& s) | |
560 | { (void)operator<<((const char *)s); return *this; } | |
561 | void operator+=(const wxCharBuffer& s) | |
562 | { (void)operator<<((const char *)s); } | |
563 | #endif // wxUSE_UNICODE/!wxUSE_UNICODE | |
6b95b20d | 564 | |
3c67202d | 565 | // string += C string |
09443a26 VZ |
566 | wxString& Append(const wxString& s) |
567 | { | |
568 | // test for IsEmpty() to share the string if possible | |
569 | if ( IsEmpty() ) | |
570 | *this = s; | |
571 | else | |
572 | ConcatSelf(s.Length(), s.c_str()); | |
573 | return *this; | |
574 | } | |
2bb67b80 OK |
575 | wxString& Append(const wxChar* psz) |
576 | { ConcatSelf(wxStrlen(psz), psz); return *this; } | |
3c67202d | 577 | // append count copies of given character |
2bb67b80 | 578 | wxString& Append(wxChar ch, size_t count = 1u) |
3c67202d | 579 | { wxString str(ch, count); return *this << str; } |
8f06a017 RD |
580 | wxString& Append(const wxChar* psz, size_t nLen) |
581 | { ConcatSelf(nLen, psz); return *this; } | |
3c67202d VZ |
582 | |
583 | // prepend a string, return the string itself | |
584 | wxString& Prepend(const wxString& str) | |
585 | { *this = str + *this; return *this; } | |
586 | ||
587 | // non-destructive concatenation | |
588 | // | |
c33534e5 | 589 | friend wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2); |
3c67202d | 590 | // |
2bb67b80 | 591 | friend wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch); |
3c67202d | 592 | // |
2bb67b80 | 593 | friend wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string); |
3c67202d | 594 | // |
2bb67b80 | 595 | friend wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz); |
3c67202d | 596 | // |
2bb67b80 | 597 | friend wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string); |
3c67202d VZ |
598 | |
599 | // stream-like functions | |
600 | // insert an int into string | |
3ce65f6c VZ |
601 | wxString& operator<<(int i) |
602 | { return (*this) << Format(_T("%d"), i); } | |
603 | // insert an unsigned int into string | |
604 | wxString& operator<<(unsigned int ui) | |
605 | { return (*this) << Format(_T("%u"), ui); } | |
606 | // insert a long into string | |
607 | wxString& operator<<(long l) | |
608 | { return (*this) << Format(_T("%ld"), l); } | |
609 | // insert an unsigned long into string | |
610 | wxString& operator<<(unsigned long ul) | |
611 | { return (*this) << Format(_T("%lu"), ul); } | |
3c67202d | 612 | // insert a float into string |
3ce65f6c VZ |
613 | wxString& operator<<(float f) |
614 | { return (*this) << Format(_T("%f"), f); } | |
3c67202d | 615 | // insert a double into string |
3ce65f6c VZ |
616 | wxString& operator<<(double d) |
617 | { return (*this) << Format(_T("%g"), d); } | |
c84c52de | 618 | |
3c67202d | 619 | // string comparison |
30b21f9a | 620 | // case-sensitive comparison (returns a value < 0, = 0 or > 0) |
f33fee2a | 621 | int Cmp(const wxChar *psz) const { return wxStrcmp(c_str(), psz); } |
3c67202d | 622 | // same as Cmp() but not case-sensitive |
f33fee2a | 623 | int CmpNoCase(const wxChar *psz) const { return wxStricmp(c_str(), psz); } |
3c67202d VZ |
624 | // test for the string equality, either considering case or not |
625 | // (if compareWithCase then the case matters) | |
2bb67b80 | 626 | bool IsSameAs(const wxChar *psz, bool compareWithCase = TRUE) const |
3c67202d | 627 | { return (compareWithCase ? Cmp(psz) : CmpNoCase(psz)) == 0; } |
f33fee2a VZ |
628 | // comparison with a signle character: returns TRUE if equal |
629 | bool IsSameAs(wxChar c, bool compareWithCase = TRUE) const | |
630 | { | |
631 | return (Len() == 1) && (compareWithCase ? GetChar(0u) == c | |
632 | : wxToupper(GetChar(0u)) == wxToupper(c)); | |
633 | } | |
3c67202d VZ |
634 | |
635 | // simple sub-string extraction | |
636 | // return substring starting at nFirst of length nCount (or till the end | |
637 | // if nCount = default value) | |
566b84d2 | 638 | wxString Mid(size_t nFirst, size_t nCount = wxSTRING_MAXLEN) const; |
3c67202d | 639 | |
f6bcfd97 | 640 | // operator version of Mid() |
3c67202d VZ |
641 | wxString operator()(size_t start, size_t len) const |
642 | { return Mid(start, len); } | |
643 | ||
c0881dc3 | 644 | // check that the string starts with prefix and return the rest of the |
f6bcfd97 BP |
645 | // string in the provided pointer if it is not NULL, otherwise return |
646 | // FALSE | |
647 | bool StartsWith(const wxChar *prefix, wxString *rest = NULL) const; | |
648 | ||
3c67202d | 649 | // get first nCount characters |
c801d85f | 650 | wxString Left(size_t nCount) const; |
3c67202d | 651 | // get last nCount characters |
c801d85f | 652 | wxString Right(size_t nCount) const; |
c0881dc3 | 653 | // get all characters before the first occurance of ch |
3c67202d | 654 | // (returns the whole string if ch not found) |
2bb67b80 | 655 | wxString BeforeFirst(wxChar ch) const; |
3c67202d VZ |
656 | // get all characters before the last occurence of ch |
657 | // (returns empty string if ch not found) | |
2bb67b80 | 658 | wxString BeforeLast(wxChar ch) const; |
3c67202d VZ |
659 | // get all characters after the first occurence of ch |
660 | // (returns empty string if ch not found) | |
2bb67b80 | 661 | wxString AfterFirst(wxChar ch) const; |
3c67202d VZ |
662 | // get all characters after the last occurence of ch |
663 | // (returns the whole string if ch not found) | |
2bb67b80 | 664 | wxString AfterLast(wxChar ch) const; |
3c67202d VZ |
665 | |
666 | // for compatibility only, use more explicitly named functions above | |
2bb67b80 OK |
667 | wxString Before(wxChar ch) const { return BeforeLast(ch); } |
668 | wxString After(wxChar ch) const { return AfterFirst(ch); } | |
3c67202d VZ |
669 | |
670 | // case conversion | |
c84c52de | 671 | // convert to upper case in place, return the string itself |
c801d85f | 672 | wxString& MakeUpper(); |
c84c52de | 673 | // convert to upper case, return the copy of the string |
03ab016d JS |
674 | // Here's something to remember: BC++ doesn't like returns in inlines. |
675 | wxString Upper() const ; | |
c84c52de | 676 | // convert to lower case in place, return the string itself |
c801d85f | 677 | wxString& MakeLower(); |
c84c52de | 678 | // convert to lower case, return the copy of the string |
03ab016d | 679 | wxString Lower() const ; |
c801d85f | 680 | |
3c67202d VZ |
681 | // trimming/padding whitespace (either side) and truncating |
682 | // remove spaces from left or from right (default) side | |
c801d85f | 683 | wxString& Trim(bool bFromRight = TRUE); |
3c67202d | 684 | // add nCount copies chPad in the beginning or at the end (default) |
223d09f6 | 685 | wxString& Pad(size_t nCount, wxChar chPad = wxT(' '), bool bFromRight = TRUE); |
dd1eaa89 | 686 | |
3c67202d VZ |
687 | // searching and replacing |
688 | // searching (return starting index, or -1 if not found) | |
2bb67b80 | 689 | int Find(wxChar ch, bool bFromEnd = FALSE) const; // like strchr/strrchr |
3c67202d | 690 | // searching (return starting index, or -1 if not found) |
2bb67b80 | 691 | int Find(const wxChar *pszSub) const; // like strstr |
3c67202d VZ |
692 | // replace first (or all of bReplaceAll) occurences of substring with |
693 | // another string, returns the number of replacements made | |
2bb67b80 OK |
694 | size_t Replace(const wxChar *szOld, |
695 | const wxChar *szNew, | |
3c67202d VZ |
696 | bool bReplaceAll = TRUE); |
697 | ||
698 | // check if the string contents matches a mask containing '*' and '?' | |
2bb67b80 | 699 | bool Matches(const wxChar *szMask) const; |
c801d85f | 700 | |
538f35cc VZ |
701 | // conversion to numbers: all functions return TRUE only if the whole |
702 | // string is a number and put the value of this number into the pointer | |
703 | // provided, the base is the numeric base in which the conversion should be | |
704 | // done and must be comprised between 2 and 36 or be 0 in which case the | |
705 | // standard C rules apply (leading '0' => octal, "0x" => hex) | |
cd0b1709 | 706 | // convert to a signed integer |
538f35cc | 707 | bool ToLong(long *val, int base = 10) const; |
cd0b1709 | 708 | // convert to an unsigned integer |
538f35cc | 709 | bool ToULong(unsigned long *val, int base = 10) const; |
cd0b1709 VZ |
710 | // convert to a double |
711 | bool ToDouble(double *val) const; | |
712 | ||
3c67202d VZ |
713 | // formated input/output |
714 | // as sprintf(), returns the number of characters written or < 0 on error | |
2bb67b80 | 715 | int Printf(const wxChar *pszFormat, ...); |
3c67202d | 716 | // as vprintf(), returns the number of characters written or < 0 on error |
2bb67b80 | 717 | int PrintfV(const wxChar* pszFormat, va_list argptr); |
dd1eaa89 | 718 | |
341e7d28 VZ |
719 | // returns the string containing the result of Printf() to it |
720 | static wxString Format(const wxChar *pszFormat, ...); | |
721 | // the same as above, but takes a va_list | |
722 | static wxString FormatV(const wxChar *pszFormat, va_list argptr); | |
723 | ||
3c67202d VZ |
724 | // raw access to string memory |
725 | // ensure that string has space for at least nLen characters | |
dd1eaa89 | 726 | // only works if the data of this string is not shared |
c86f1403 | 727 | void Alloc(size_t nLen); |
3c67202d | 728 | // minimize the string's memory |
dd1eaa89 VZ |
729 | // only works if the data of this string is not shared |
730 | void Shrink(); | |
3c67202d VZ |
731 | // get writable buffer of at least nLen bytes. Unget() *must* be called |
732 | // a.s.a.p. to put string back in a reasonable state! | |
2bb67b80 | 733 | wxChar *GetWriteBuf(size_t nLen); |
3c67202d | 734 | // call this immediately after GetWriteBuf() has been used |
8fd0f20b | 735 | void UngetWriteBuf(); |
8f06a017 | 736 | void UngetWriteBuf(size_t nLen); |
c801d85f | 737 | |
3c67202d VZ |
738 | // wxWindows version 1 compatibility functions |
739 | ||
740 | // use Mid() | |
741 | wxString SubString(size_t from, size_t to) const | |
742 | { return Mid(from, (to - from + 1)); } | |
743 | // values for second parameter of CompareTo function | |
c801d85f | 744 | enum caseCompare {exact, ignoreCase}; |
3c67202d | 745 | // values for first parameter of Strip function |
c801d85f | 746 | enum stripType {leading = 0x1, trailing = 0x2, both = 0x3}; |
8870c26e | 747 | |
3c67202d | 748 | // use Printf() |
2bb67b80 | 749 | int sprintf(const wxChar *pszFormat, ...); |
c801d85f | 750 | |
3c67202d | 751 | // use Cmp() |
2bb67b80 | 752 | inline int CompareTo(const wxChar* psz, caseCompare cmp = exact) const |
6b95b20d | 753 | { return cmp == exact ? Cmp(psz) : CmpNoCase(psz); } |
c801d85f | 754 | |
3c67202d | 755 | // use Len |
c801d85f | 756 | size_t Length() const { return Len(); } |
3c67202d | 757 | // Count the number of characters |
2bb67b80 | 758 | int Freq(wxChar ch) const; |
3c67202d | 759 | // use MakeLower |
c801d85f | 760 | void LowerCase() { MakeLower(); } |
3c67202d | 761 | // use MakeUpper |
c801d85f | 762 | void UpperCase() { MakeUpper(); } |
3c67202d | 763 | // use Trim except that it doesn't change this string |
c801d85f KB |
764 | wxString Strip(stripType w = trailing) const; |
765 | ||
3c67202d | 766 | // use Find (more general variants not yet supported) |
2bb67b80 OK |
767 | size_t Index(const wxChar* psz) const { return Find(psz); } |
768 | size_t Index(wxChar ch) const { return Find(ch); } | |
3c67202d | 769 | // use Truncate |
c801d85f | 770 | wxString& Remove(size_t pos) { return Truncate(pos); } |
28a156b1 | 771 | wxString& RemoveLast(size_t n = 1) { return Truncate(Len() - n); } |
c801d85f | 772 | |
3ed358cb | 773 | wxString& Remove(size_t nStart, size_t nLen) { return erase( nStart, nLen ); } |
dd1eaa89 | 774 | |
3c67202d | 775 | // use Find() |
2bb67b80 OK |
776 | int First( const wxChar ch ) const { return Find(ch); } |
777 | int First( const wxChar* psz ) const { return Find(psz); } | |
3ed358cb | 778 | int First( const wxString &str ) const { return Find(str); } |
2bb67b80 | 779 | int Last( const wxChar ch ) const { return Find(ch, TRUE); } |
3c67202d | 780 | bool Contains(const wxString& str) const { return Find(str) != -1; } |
c801d85f | 781 | |
3c67202d | 782 | // use IsEmpty() |
c801d85f | 783 | bool IsNull() const { return IsEmpty(); } |
c801d85f | 784 | |
3c67202d VZ |
785 | #ifdef wxSTD_STRING_COMPATIBILITY |
786 | // std::string compatibility functions | |
dd1eaa89 | 787 | |
2bc07607 VZ |
788 | // standard types |
789 | typedef wxChar value_type; | |
790 | typedef const value_type *const_iterator; | |
791 | ||
3c67202d | 792 | // an 'invalid' value for string index |
c801d85f | 793 | static const size_t npos; |
dd1eaa89 | 794 | |
3c67202d VZ |
795 | // constructors |
796 | // take nLen chars starting at nPos | |
797 | wxString(const wxString& str, size_t nPos, size_t nLen) | |
798 | { | |
09443a26 VZ |
799 | wxASSERT_MSG( str.GetStringData()->IsValid(), |
800 | _T("did you forget to call UngetWriteBuf()?") ); | |
801 | ||
3c67202d VZ |
802 | InitWith(str.c_str(), nPos, nLen == npos ? 0 : nLen); |
803 | } | |
804 | // take all characters from pStart to pEnd | |
805 | wxString(const void *pStart, const void *pEnd); | |
806 | ||
807 | // lib.string.capacity | |
808 | // return the length of the string | |
809 | size_t size() const { return Len(); } | |
810 | // return the length of the string | |
811 | size_t length() const { return Len(); } | |
812 | // return the maximum size of the string | |
566b84d2 | 813 | size_t max_size() const { return wxSTRING_MAXLEN; } |
3c67202d | 814 | // resize the string, filling the space with c if c != 0 |
223d09f6 | 815 | void resize(size_t nSize, wxChar ch = wxT('\0')); |
3c67202d VZ |
816 | // delete the contents of the string |
817 | void clear() { Empty(); } | |
818 | // returns true if the string is empty | |
819 | bool empty() const { return IsEmpty(); } | |
252a752e VZ |
820 | // inform string about planned change in size |
821 | void reserve(size_t size) { Alloc(size); } | |
3c67202d VZ |
822 | |
823 | // lib.string.access | |
824 | // return the character at position n | |
2bb67b80 | 825 | wxChar at(size_t n) const { return GetChar(n); } |
3c67202d | 826 | // returns the writable character at position n |
2bb67b80 | 827 | wxChar& at(size_t n) { return GetWritableChar(n); } |
3c67202d | 828 | |
2bc07607 VZ |
829 | // first valid index position |
830 | const_iterator begin() const { return wx_str(); } | |
831 | // position one after the last valid one | |
832 | const_iterator end() const { return wx_str() + length(); } | |
833 | ||
3c67202d VZ |
834 | // lib.string.modifiers |
835 | // append a string | |
836 | wxString& append(const wxString& str) | |
837 | { *this += str; return *this; } | |
838 | // append elements str[pos], ..., str[pos+n] | |
839 | wxString& append(const wxString& str, size_t pos, size_t n) | |
840 | { ConcatSelf(n, str.c_str() + pos); return *this; } | |
841 | // append first n (or all if n == npos) characters of sz | |
2bb67b80 OK |
842 | wxString& append(const wxChar *sz, size_t n = npos) |
843 | { ConcatSelf(n == npos ? wxStrlen(sz) : n, sz); return *this; } | |
3c67202d VZ |
844 | |
845 | // append n copies of ch | |
2bb67b80 | 846 | wxString& append(size_t n, wxChar ch) { return Pad(n, ch); } |
3c67202d VZ |
847 | |
848 | // same as `this_string = str' | |
735d1db6 VZ |
849 | wxString& assign(const wxString& str) |
850 | { return *this = str; } | |
3c67202d VZ |
851 | // same as ` = str[pos..pos + n] |
852 | wxString& assign(const wxString& str, size_t pos, size_t n) | |
735d1db6 | 853 | { Empty(); return Append(str.c_str() + pos, n); } |
3c67202d | 854 | // same as `= first n (or all if n == npos) characters of sz' |
2bb67b80 | 855 | wxString& assign(const wxChar *sz, size_t n = npos) |
735d1db6 | 856 | { Empty(); return Append(sz, n == npos ? wxStrlen(sz) : n); } |
3c67202d | 857 | // same as `= n copies of ch' |
2bb67b80 | 858 | wxString& assign(size_t n, wxChar ch) |
735d1db6 | 859 | { Empty(); return Append(ch, n); } |
3c67202d VZ |
860 | |
861 | // insert another string | |
862 | wxString& insert(size_t nPos, const wxString& str); | |
863 | // insert n chars of str starting at nStart (in str) | |
864 | wxString& insert(size_t nPos, const wxString& str, size_t nStart, size_t n) | |
2bb67b80 | 865 | { return insert(nPos, wxString((const wxChar *)str + nStart, n)); } |
3c67202d VZ |
866 | |
867 | // insert first n (or all if n == npos) characters of sz | |
2bb67b80 | 868 | wxString& insert(size_t nPos, const wxChar *sz, size_t n = npos) |
3c67202d VZ |
869 | { return insert(nPos, wxString(sz, n)); } |
870 | // insert n copies of ch | |
2bb67b80 | 871 | wxString& insert(size_t nPos, size_t n, wxChar ch) |
3c67202d VZ |
872 | { return insert(nPos, wxString(ch, n)); } |
873 | ||
874 | // delete characters from nStart to nStart + nLen | |
875 | wxString& erase(size_t nStart = 0, size_t nLen = npos); | |
876 | ||
877 | // replaces the substring of length nLen starting at nStart | |
2bb67b80 | 878 | wxString& replace(size_t nStart, size_t nLen, const wxChar* sz); |
3c67202d | 879 | // replaces the substring with nCount copies of ch |
2bb67b80 | 880 | wxString& replace(size_t nStart, size_t nLen, size_t nCount, wxChar ch); |
3c67202d VZ |
881 | // replaces a substring with another substring |
882 | wxString& replace(size_t nStart, size_t nLen, | |
883 | const wxString& str, size_t nStart2, size_t nLen2); | |
884 | // replaces the substring with first nCount chars of sz | |
fb20fa43 VZ |
885 | wxString& replace(size_t nStart, size_t nLen, |
886 | const wxChar* sz, size_t nCount); | |
3c67202d VZ |
887 | |
888 | // swap two strings | |
889 | void swap(wxString& str); | |
890 | ||
891 | // All find() functions take the nStart argument which specifies the | |
892 | // position to start the search on, the default value is 0. All functions | |
893 | // return npos if there were no match. | |
894 | ||
895 | // find a substring | |
896 | size_t find(const wxString& str, size_t nStart = 0) const; | |
897 | ||
898 | // VC++ 1.5 can't cope with this syntax. | |
3f4a0c5b | 899 | #if !defined(__VISUALC__) || defined(__WIN32__) |
3c67202d | 900 | // find first n characters of sz |
2bb67b80 | 901 | size_t find(const wxChar* sz, size_t nStart = 0, size_t n = npos) const; |
fb20fa43 | 902 | #endif // VC++ 1.5 |
3c67202d VZ |
903 | |
904 | // Gives a duplicate symbol (presumably a case-insensitivity problem) | |
62448488 | 905 | #if !defined(__BORLANDC__) |
3c67202d | 906 | // find the first occurence of character ch after nStart |
2bb67b80 | 907 | size_t find(wxChar ch, size_t nStart = 0) const; |
62448488 | 908 | #endif |
3c67202d VZ |
909 | // rfind() family is exactly like find() but works right to left |
910 | ||
911 | // as find, but from the end | |
912 | size_t rfind(const wxString& str, size_t nStart = npos) const; | |
913 | ||
914 | // VC++ 1.5 can't cope with this syntax. | |
3f4a0c5b | 915 | #if !defined(__VISUALC__) || defined(__WIN32__) |
3c67202d | 916 | // as find, but from the end |
2bb67b80 | 917 | size_t rfind(const wxChar* sz, size_t nStart = npos, |
3c67202d VZ |
918 | size_t n = npos) const; |
919 | // as find, but from the end | |
2bb67b80 | 920 | size_t rfind(wxChar ch, size_t nStart = npos) const; |
fb20fa43 | 921 | #endif // VC++ 1.5 |
3c67202d VZ |
922 | |
923 | // find first/last occurence of any character in the set | |
924 | ||
969d318c VZ |
925 | // as strpbrk() but starts at nStart, returns npos if not found |
926 | size_t find_first_of(const wxString& str, size_t nStart = 0) const | |
927 | { return find_first_of(str.c_str(), nStart); } | |
928 | // same as above | |
2bb67b80 | 929 | size_t find_first_of(const wxChar* sz, size_t nStart = 0) const; |
3c67202d | 930 | // same as find(char, size_t) |
969d318c VZ |
931 | size_t find_first_of(wxChar c, size_t nStart = 0) const |
932 | { return find(c, nStart); } | |
933 | // find the last (starting from nStart) char from str in this string | |
934 | size_t find_last_of (const wxString& str, size_t nStart = npos) const | |
935 | { return find_last_of(str.c_str(), nStart); } | |
936 | // same as above | |
937 | size_t find_last_of (const wxChar* sz, size_t nStart = npos) const; | |
938 | // same as above | |
939 | size_t find_last_of(wxChar c, size_t nStart = npos) const | |
940 | { return rfind(c, nStart); } | |
3c67202d VZ |
941 | |
942 | // find first/last occurence of any character not in the set | |
943 | ||
969d318c VZ |
944 | // as strspn() (starting from nStart), returns npos on failure |
945 | size_t find_first_not_of(const wxString& str, size_t nStart = 0) const | |
946 | { return find_first_not_of(str.c_str(), nStart); } | |
947 | // same as above | |
948 | size_t find_first_not_of(const wxChar* sz, size_t nStart = 0) const; | |
949 | // same as above | |
2bb67b80 | 950 | size_t find_first_not_of(wxChar ch, size_t nStart = 0) const; |
969d318c | 951 | // as strcspn() |
fb20fa43 VZ |
952 | size_t find_last_not_of(const wxString& str, size_t nStart = npos) const |
953 | { return find_first_not_of(str.c_str(), nStart); } | |
969d318c VZ |
954 | // same as above |
955 | size_t find_last_not_of(const wxChar* sz, size_t nStart = npos) const; | |
956 | // same as above | |
2bb67b80 | 957 | size_t find_last_not_of(wxChar ch, size_t nStart = npos) const; |
3c67202d VZ |
958 | |
959 | // All compare functions return -1, 0 or 1 if the [sub]string is less, | |
960 | // equal or greater than the compare() argument. | |
961 | ||
962 | // just like strcmp() | |
963 | int compare(const wxString& str) const { return Cmp(str); } | |
964 | // comparison with a substring | |
fb20fa43 VZ |
965 | int compare(size_t nStart, size_t nLen, const wxString& str) const |
966 | { return Mid(nStart, nLen).Cmp(str); } | |
3c67202d VZ |
967 | // comparison of 2 substrings |
968 | int compare(size_t nStart, size_t nLen, | |
fb20fa43 VZ |
969 | const wxString& str, size_t nStart2, size_t nLen2) const |
970 | { return Mid(nStart, nLen).Cmp(str.Mid(nStart2, nLen2)); } | |
3c67202d | 971 | // just like strcmp() |
2bb67b80 | 972 | int compare(const wxChar* sz) const { return Cmp(sz); } |
3c67202d VZ |
973 | // substring comparison with first nCount characters of sz |
974 | int compare(size_t nStart, size_t nLen, | |
fb20fa43 VZ |
975 | const wxChar* sz, size_t nCount = npos) const |
976 | { return Mid(nStart, nLen).Cmp(wxString(sz, nCount)); } | |
3c67202d VZ |
977 | |
978 | // substring extraction | |
8c264b23 VZ |
979 | wxString substr(size_t nStart = 0, size_t nLen = npos) const |
980 | { return Mid(nStart, nLen); } | |
3c67202d | 981 | #endif // wxSTD_STRING_COMPATIBILITY |
c801d85f KB |
982 | }; |
983 | ||
984 | // ---------------------------------------------------------------------------- | |
3c67202d VZ |
985 | // The string array uses it's knowledge of internal structure of the wxString |
986 | // class to optimize string storage. Normally, we would store pointers to | |
987 | // string, but as wxString is, in fact, itself a pointer (sizeof(wxString) is | |
988 | // sizeof(char *)) we store these pointers instead. The cast to "wxString *" is | |
989 | // really all we need to turn such pointer into a string! | |
990 | // | |
991 | // Of course, it can be called a dirty hack, but we use twice less memory and | |
992 | // this approach is also more speed efficient, so it's probably worth it. | |
993 | // | |
994 | // Usage notes: when a string is added/inserted, a new copy of it is created, | |
995 | // so the original string may be safely deleted. When a string is retrieved | |
996 | // from the array (operator[] or Item() method), a reference is returned. | |
c801d85f | 997 | // ---------------------------------------------------------------------------- |
e90c1d2a | 998 | |
fbcb4166 | 999 | class WXDLLEXPORT wxArrayString |
c801d85f KB |
1000 | { |
1001 | public: | |
30b21f9a VZ |
1002 | // type of function used by wxArrayString::Sort() |
1003 | typedef int (*CompareFunction)(const wxString& first, | |
1004 | const wxString& second); | |
1005 | ||
3c67202d | 1006 | // constructors and destructor |
0fe1f685 VZ |
1007 | // default ctor |
1008 | wxArrayString() { Init(FALSE); } | |
1009 | // if autoSort is TRUE, the array is always sorted (in alphabetical order) | |
1010 | // | |
1011 | // NB: the reason for using int and not bool is that like this we can avoid | |
1012 | // using this ctor for implicit conversions from "const char *" (which | |
1013 | // we'd like to be implicitly converted to wxString instead!) | |
1014 | // | |
1015 | // of course, using explicit would be even better - if all compilers | |
1016 | // supported it... | |
1017 | wxArrayString(int autoSort) { Init(autoSort != 0); } | |
3c67202d | 1018 | // copy ctor |
c801d85f | 1019 | wxArrayString(const wxArrayString& array); |
3c67202d | 1020 | // assignment operator |
c801d85f | 1021 | wxArrayString& operator=(const wxArrayString& src); |
3c67202d | 1022 | // not virtual, this class should not be derived from |
c801d85f | 1023 | ~wxArrayString(); |
c801d85f | 1024 | |
3c67202d VZ |
1025 | // memory management |
1026 | // empties the list, but doesn't release memory | |
c801d85f | 1027 | void Empty(); |
3c67202d | 1028 | // empties the list and releases memory |
c801d85f | 1029 | void Clear(); |
3c67202d | 1030 | // preallocates memory for given number of items |
c801d85f | 1031 | void Alloc(size_t nCount); |
3c67202d | 1032 | // minimzes the memory usage (by freeing all extra memory) |
dd1eaa89 | 1033 | void Shrink(); |
3c67202d VZ |
1034 | |
1035 | // simple accessors | |
1036 | // number of elements in the array | |
1037 | size_t GetCount() const { return m_nCount; } | |
1038 | // is it empty? | |
1039 | bool IsEmpty() const { return m_nCount == 0; } | |
1040 | // number of elements in the array (GetCount is preferred API) | |
1041 | size_t Count() const { return m_nCount; } | |
1042 | ||
1043 | // items access (range checking is done in debug version) | |
1044 | // get item at position uiIndex | |
c801d85f | 1045 | wxString& Item(size_t nIndex) const |
09443a26 VZ |
1046 | { |
1047 | wxASSERT_MSG( nIndex < m_nCount, | |
1048 | _T("wxArrayString: index out of bounds") ); | |
1049 | ||
1050 | return *(wxString *)&(m_pItems[nIndex]); | |
1051 | } | |
1052 | ||
3c67202d | 1053 | // same as Item() |
c801d85f | 1054 | wxString& operator[](size_t nIndex) const { return Item(nIndex); } |
3c67202d | 1055 | // get last item |
09443a26 VZ |
1056 | wxString& Last() const |
1057 | { | |
1058 | wxASSERT_MSG( !IsEmpty(), | |
1059 | _T("wxArrayString: index out of bounds") ); | |
1060 | return Item(Count() - 1); | |
1061 | } | |
3c67202d | 1062 | |
9d155f50 RL |
1063 | // return a wxString[], useful for the controls which |
1064 | // take one in their ctor. You must delete[] it yourself | |
1065 | // once you are done with it. Will return NULL if the | |
1066 | // ArrayString was empty. | |
1067 | wxString* GetStringArray() const; | |
1068 | ||
3c67202d VZ |
1069 | // item management |
1070 | // Search the element in the array, starting from the beginning if | |
1071 | // bFromEnd is FALSE or from end otherwise. If bCase, comparison is case | |
1072 | // sensitive (default). Returns index of the first item matched or | |
1073 | // wxNOT_FOUND | |
2bb67b80 | 1074 | int Index (const wxChar *sz, bool bCase = TRUE, bool bFromEnd = FALSE) const; |
e01c8145 VZ |
1075 | // add new element at the end (if the array is not sorted), return its |
1076 | // index | |
2a39c386 | 1077 | size_t Add(const wxString& str, size_t nInsert = 1); |
3c67202d | 1078 | // add new element at given position |
2a39c386 | 1079 | void Insert(const wxString& str, size_t uiIndex, size_t nInsert = 1); |
71e03035 VZ |
1080 | // expand the array to have count elements |
1081 | void SetCount(size_t count); | |
3c67202d | 1082 | // remove first item matching this value |
2bb67b80 | 1083 | void Remove(const wxChar *sz); |
3c67202d | 1084 | // remove item by index |
2a39c386 VZ |
1085 | void Remove(size_t nIndex, size_t nRemove = 1); |
1086 | void RemoveAt(size_t nIndex, size_t nRemove = 1) { Remove(nIndex, nRemove); } | |
c801d85f | 1087 | |
30b21f9a VZ |
1088 | // sorting |
1089 | // sort array elements in alphabetical order (or reversed alphabetical | |
1090 | // order if reverseOrder parameter is TRUE) | |
1091 | void Sort(bool reverseOrder = FALSE); | |
1092 | // sort array elements using specified comparaison function | |
1093 | void Sort(CompareFunction compareFunction); | |
c801d85f | 1094 | |
f6bcfd97 BP |
1095 | // comparison |
1096 | // compare two arrays case sensitively | |
1097 | bool operator==(const wxArrayString& a) const; | |
1098 | // compare two arrays case sensitively | |
1099 | bool operator!=(const wxArrayString& a) const { return !(*this == a); } | |
1100 | ||
e87271f3 | 1101 | protected: |
0fe1f685 | 1102 | void Init(bool autoSort); // common part of all ctors |
e87271f3 VZ |
1103 | void Copy(const wxArrayString& src); // copies the contents of another array |
1104 | ||
c801d85f | 1105 | private: |
2a39c386 | 1106 | void Grow(size_t nIncrement = 0); // makes array bigger if needed |
e87271f3 | 1107 | void Free(); // free all the strings stored |
c801d85f | 1108 | |
e87271f3 | 1109 | void DoSort(); // common part of all Sort() variants |
30b21f9a | 1110 | |
3c67202d | 1111 | size_t m_nSize, // current size of the array |
c801d85f KB |
1112 | m_nCount; // current number of elements |
1113 | ||
e87271f3 VZ |
1114 | wxChar **m_pItems; // pointer to data |
1115 | ||
1116 | bool m_autoSort; // if TRUE, keep the array always sorted | |
1117 | }; | |
1118 | ||
1119 | class WXDLLEXPORT wxSortedArrayString : public wxArrayString | |
1120 | { | |
1121 | public: | |
1122 | wxSortedArrayString() : wxArrayString(TRUE) | |
1123 | { } | |
1124 | wxSortedArrayString(const wxArrayString& array) : wxArrayString(TRUE) | |
1125 | { Copy(array); } | |
c801d85f KB |
1126 | }; |
1127 | ||
1d218550 VZ |
1128 | // ---------------------------------------------------------------------------- |
1129 | // wxStringBuffer: a tiny class allowing to get a writable pointer into string | |
1130 | // ---------------------------------------------------------------------------- | |
1131 | ||
1132 | class WXDLLEXPORT wxStringBuffer | |
1133 | { | |
1134 | public: | |
1135 | wxStringBuffer(wxString& str, size_t lenWanted = 1024) | |
1136 | : m_str(str) { m_buf = m_str.GetWriteBuf(lenWanted); } | |
1137 | ||
1138 | ~wxStringBuffer() { m_str.UngetWriteBuf(); } | |
1139 | ||
1140 | operator wxChar*() const { return m_buf; } | |
1141 | ||
1142 | private: | |
1143 | wxString& m_str; | |
1144 | wxChar *m_buf; | |
1145 | }; | |
1146 | ||
c801d85f | 1147 | // --------------------------------------------------------------------------- |
3c67202d | 1148 | // wxString comparison functions: operator versions are always case sensitive |
c801d85f | 1149 | // --------------------------------------------------------------------------- |
f33fee2a | 1150 | |
0cbe5ee3 VZ |
1151 | inline bool operator==(const wxString& s1, const wxString& s2) |
1152 | { return (s1.Len() == s2.Len()) && (s1.Cmp(s2) == 0); } | |
1153 | inline bool operator==(const wxString& s1, const wxChar * s2) | |
1154 | { return s1.Cmp(s2) == 0; } | |
1155 | inline bool operator==(const wxChar * s1, const wxString& s2) | |
1156 | { return s2.Cmp(s1) == 0; } | |
1157 | inline bool operator!=(const wxString& s1, const wxString& s2) | |
1158 | { return (s1.Len() != s2.Len()) || (s1.Cmp(s2) != 0); } | |
1159 | inline bool operator!=(const wxString& s1, const wxChar * s2) | |
1160 | { return s1.Cmp(s2) != 0; } | |
1161 | inline bool operator!=(const wxChar * s1, const wxString& s2) | |
1162 | { return s2.Cmp(s1) != 0; } | |
1163 | inline bool operator< (const wxString& s1, const wxString& s2) | |
1164 | { return s1.Cmp(s2) < 0; } | |
1165 | inline bool operator< (const wxString& s1, const wxChar * s2) | |
1166 | { return s1.Cmp(s2) < 0; } | |
1167 | inline bool operator< (const wxChar * s1, const wxString& s2) | |
1168 | { return s2.Cmp(s1) > 0; } | |
1169 | inline bool operator> (const wxString& s1, const wxString& s2) | |
1170 | { return s1.Cmp(s2) > 0; } | |
1171 | inline bool operator> (const wxString& s1, const wxChar * s2) | |
1172 | { return s1.Cmp(s2) > 0; } | |
1173 | inline bool operator> (const wxChar * s1, const wxString& s2) | |
1174 | { return s2.Cmp(s1) < 0; } | |
1175 | inline bool operator<=(const wxString& s1, const wxString& s2) | |
1176 | { return s1.Cmp(s2) <= 0; } | |
1177 | inline bool operator<=(const wxString& s1, const wxChar * s2) | |
1178 | { return s1.Cmp(s2) <= 0; } | |
1179 | inline bool operator<=(const wxChar * s1, const wxString& s2) | |
1180 | { return s2.Cmp(s1) >= 0; } | |
1181 | inline bool operator>=(const wxString& s1, const wxString& s2) | |
1182 | { return s1.Cmp(s2) >= 0; } | |
1183 | inline bool operator>=(const wxString& s1, const wxChar * s2) | |
1184 | { return s1.Cmp(s2) >= 0; } | |
1185 | inline bool operator>=(const wxChar * s1, const wxString& s2) | |
1186 | { return s2.Cmp(s1) <= 0; } | |
3c67202d | 1187 | |
f33fee2a VZ |
1188 | // comparison with char |
1189 | inline bool operator==(wxChar c, const wxString& s) { return s.IsSameAs(c); } | |
1190 | inline bool operator==(const wxString& s, wxChar c) { return s.IsSameAs(c); } | |
1191 | inline bool operator!=(wxChar c, const wxString& s) { return !s.IsSameAs(c); } | |
1192 | inline bool operator!=(const wxString& s, wxChar c) { return !s.IsSameAs(c); } | |
1193 | ||
5ca07d0f OK |
1194 | #if wxUSE_UNICODE |
1195 | inline bool operator==(const wxString& s1, const wxWCharBuffer& s2) | |
f33fee2a | 1196 | { return (s1.Cmp((const wchar_t *)s2) == 0); } |
5ca07d0f | 1197 | inline bool operator==(const wxWCharBuffer& s1, const wxString& s2) |
f33fee2a | 1198 | { return (s2.Cmp((const wchar_t *)s1) == 0); } |
f6bcfd97 BP |
1199 | inline bool operator!=(const wxString& s1, const wxWCharBuffer& s2) |
1200 | { return (s1.Cmp((const wchar_t *)s2) != 0); } | |
1201 | inline bool operator!=(const wxWCharBuffer& s1, const wxString& s2) | |
1202 | { return (s2.Cmp((const wchar_t *)s1) != 0); } | |
0cbe5ee3 | 1203 | #else // !wxUSE_UNICODE |
5ca07d0f | 1204 | inline bool operator==(const wxString& s1, const wxCharBuffer& s2) |
f33fee2a | 1205 | { return (s1.Cmp((const char *)s2) == 0); } |
5ca07d0f | 1206 | inline bool operator==(const wxCharBuffer& s1, const wxString& s2) |
f33fee2a | 1207 | { return (s2.Cmp((const char *)s1) == 0); } |
f6bcfd97 BP |
1208 | inline bool operator!=(const wxString& s1, const wxCharBuffer& s2) |
1209 | { return (s1.Cmp((const char *)s2) != 0); } | |
1210 | inline bool operator!=(const wxCharBuffer& s1, const wxString& s2) | |
1211 | { return (s2.Cmp((const char *)s1) != 0); } | |
0cbe5ee3 | 1212 | #endif // wxUSE_UNICODE/!wxUSE_UNICODE |
5ca07d0f | 1213 | |
ed7174ba | 1214 | wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2); |
2bb67b80 OK |
1215 | wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch); |
1216 | wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string); | |
1217 | wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz); | |
1218 | wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string); | |
028a2b5d | 1219 | #if wxUSE_UNICODE |
6d56eb5c | 1220 | inline wxString operator+(const wxString& string, const wxWCharBuffer& buf) |
e90c1d2a | 1221 | { return string + (const wchar_t *)buf; } |
6d56eb5c | 1222 | inline wxString operator+(const wxWCharBuffer& buf, const wxString& string) |
e90c1d2a | 1223 | { return (const wchar_t *)buf + string; } |
0cbe5ee3 | 1224 | #else // !wxUSE_UNICODE |
6d56eb5c | 1225 | inline wxString operator+(const wxString& string, const wxCharBuffer& buf) |
e90c1d2a | 1226 | { return string + (const char *)buf; } |
6d56eb5c | 1227 | inline wxString operator+(const wxCharBuffer& buf, const wxString& string) |
e90c1d2a | 1228 | { return (const char *)buf + string; } |
0cbe5ee3 | 1229 | #endif // wxUSE_UNICODE/!wxUSE_UNICODE |
f04f3991 | 1230 | |
c801d85f | 1231 | // --------------------------------------------------------------------------- |
3c67202d | 1232 | // Implementation only from here until the end of file |
c801d85f KB |
1233 | // --------------------------------------------------------------------------- |
1234 | ||
e90c1d2a | 1235 | // don't pollute the library user's name space |
5737d05f | 1236 | #undef wxASSERT_VALID_INDEX |
e90c1d2a | 1237 | |
38830220 | 1238 | #if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM |
c801d85f | 1239 | |
3f4a0c5b | 1240 | #include "wx/ioswrap.h" |
c801d85f | 1241 | |
dd107c50 VZ |
1242 | WXDLLEXPORT wxSTD istream& operator>>(wxSTD istream&, wxString&); |
1243 | WXDLLEXPORT wxSTD ostream& operator<<(wxSTD ostream&, const wxString&); | |
c801d85f | 1244 | |
3c67202d | 1245 | #endif // wxSTD_STRING_COMPATIBILITY |
c801d85f | 1246 | |
34138703 | 1247 | #endif // _WX_WXSTRINGH__ |