]>
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 | ||
32 | // define to derive wxString from wxObject (deprecated!) | |
33 | #ifdef WXSTRING_IS_WXOBJECT | |
34 | #undef WXSTRING_IS_WXOBJECT | |
c801d85f KB |
35 | #endif |
36 | ||
e90c1d2a VZ |
37 | // ---------------------------------------------------------------------------- |
38 | // headers | |
39 | // ---------------------------------------------------------------------------- | |
40 | ||
9dea36ef | 41 | #if defined(__WXMAC__) || defined(__VISAGECPP__) |
3f4a0c5b | 42 | #include <ctype.h> |
17dff81c | 43 | #endif |
3f4a0c5b | 44 | |
91b8de8d RR |
45 | #ifdef __EMX__ |
46 | #include <std.h> | |
47 | #endif | |
48 | ||
9dea36ef DW |
49 | #if defined(__VISAGECPP__) && __IBMCPP__ >= 400 |
50 | // problem in VACPP V4 with including stdlib.h multiple times | |
51 | // strconv includes it anyway | |
52 | # include <stdio.h> | |
53 | # include <string.h> | |
54 | # include <stdarg.h> | |
55 | # include <limits.h> | |
56 | #else | |
57 | # include <string.h> | |
58 | # include <stdio.h> | |
59 | # include <stdarg.h> | |
60 | # include <limits.h> | |
61 | # include <stdlib.h> | |
62 | #endif | |
c801d85f | 63 | |
57493f9f | 64 | #ifdef HAVE_STRINGS_H |
1bfcb0b6 VZ |
65 | #include <strings.h> // for strcasecmp() |
66 | #endif // AIX | |
67 | ||
e90c1d2a VZ |
68 | #include "wx/defs.h" // everybody should include this |
69 | #include "wx/debug.h" // for wxASSERT() | |
70 | #include "wx/wxchar.h" // for wxChar | |
71 | #include "wx/buffer.h" // for wxCharBuffer | |
72 | #include "wx/strconv.h" // for wxConvertXXX() macros and wxMBConv classes | |
3f4a0c5b | 73 | |
e90c1d2a | 74 | #ifndef WX_PRECOMP |
dd1eaa89 | 75 | #ifdef WXSTRING_IS_WXOBJECT |
e90c1d2a | 76 | #include "wx/object.h" // base class |
dd1eaa89 | 77 | #endif |
3f4a0c5b | 78 | #endif // !PCH |
8fd0f20b | 79 | |
c801d85f KB |
80 | // --------------------------------------------------------------------------- |
81 | // macros | |
82 | // --------------------------------------------------------------------------- | |
83 | ||
c801d85f | 84 | // 'naughty' cast |
2bb67b80 | 85 | #define WXSTRINGCAST (wxChar *)(const wxChar *) |
e90c1d2a VZ |
86 | #define wxCSTRINGCAST (wxChar *)(const wxChar *) |
87 | #define wxMBSTRINGCAST (char *)(const char *) | |
88 | #define wxWCSTRINGCAST (wchar_t *)(const wchar_t *) | |
c801d85f | 89 | |
3c67202d | 90 | // implementation only |
b1269691 | 91 | #define ASSERT_VALID_INDEX(i) wxASSERT( (unsigned)(i) <= Len() ) |
c801d85f | 92 | |
e90c1d2a VZ |
93 | // ---------------------------------------------------------------------------- |
94 | // constants | |
95 | // ---------------------------------------------------------------------------- | |
96 | ||
97 | // maximum possible length for a string means "take all string" everywhere | |
98 | // (as sizeof(StringData) is unknown here, we substract 100) | |
99 | const unsigned int wxSTRING_MAXLEN = UINT_MAX - 100; | |
100 | ||
101 | // ---------------------------------------------------------------------------- | |
102 | // global data | |
103 | // ---------------------------------------------------------------------------- | |
104 | ||
105 | // global pointer to empty string | |
106 | WXDLLEXPORT_DATA(extern const wxChar*) wxEmptyString; | |
6001e347 | 107 | |
c801d85f | 108 | // --------------------------------------------------------------------------- |
e90c1d2a | 109 | // global functions complementing standard C string library replacements for |
3c67202d VZ |
110 | // strlen() and portable strcasecmp() |
111 | //--------------------------------------------------------------------------- | |
e90c1d2a VZ |
112 | |
113 | // Use wxXXX() functions from wxchar.h instead! These functions are for | |
114 | // backwards compatibility only. | |
88150e60 | 115 | |
3c67202d | 116 | // checks whether the passed in pointer is NULL and if the string is empty |
dbda9e86 | 117 | inline bool WXDLLEXPORT IsEmpty(const char *p) { return (!p || !*p); } |
c801d85f | 118 | |
3c67202d VZ |
119 | // safe version of strlen() (returns 0 if passed NULL pointer) |
120 | inline size_t WXDLLEXPORT Strlen(const char *psz) | |
c801d85f KB |
121 | { return psz ? strlen(psz) : 0; } |
122 | ||
3c67202d | 123 | // portable strcasecmp/_stricmp |
dd1eaa89 VZ |
124 | inline int WXDLLEXPORT Stricmp(const char *psz1, const char *psz2) |
125 | { | |
91b8de8d | 126 | #if defined(__VISUALC__) || ( defined(__MWERKS__) && defined(__INTEL__) ) |
dd1eaa89 | 127 | return _stricmp(psz1, psz2); |
91b8de8d | 128 | #elif defined(__SC__) |
2432b92d | 129 | return _stricmp(psz1, psz2); |
91b8de8d | 130 | #elif defined(__SALFORDC__) |
a3ef5bf5 | 131 | return stricmp(psz1, psz2); |
dd1eaa89 VZ |
132 | #elif defined(__BORLANDC__) |
133 | return stricmp(psz1, psz2); | |
7be1f0d9 JS |
134 | #elif defined(__WATCOMC__) |
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 VZ |
200 | void Lock() { if ( !IsEmpty() ) nRefs++; } |
201 | void Unlock() { if ( !IsEmpty() && --nRefs == 0) free(this); } | |
8fd0f20b | 202 | |
dd1eaa89 | 203 | // if we had taken control over string memory (GetWriteBuf), it's |
8fd0f20b | 204 | // intentionally put in invalid state |
dbda9e86 JS |
205 | void Validate(bool b) { nRefs = (b ? 1 : 0); } |
206 | bool IsValid() const { return (nRefs != 0); } | |
c801d85f KB |
207 | }; |
208 | ||
c801d85f | 209 | // --------------------------------------------------------------------------- |
3c67202d VZ |
210 | // This is (yet another one) String class for C++ programmers. It doesn't use |
211 | // any of "advanced" C++ features (i.e. templates, exceptions, namespaces...) | |
212 | // thus you should be able to compile it with practicaly any C++ compiler. | |
213 | // This class uses copy-on-write technique, i.e. identical strings share the | |
214 | // same memory as long as neither of them is changed. | |
215 | // | |
216 | // This class aims to be as compatible as possible with the new standard | |
217 | // std::string class, but adds some additional functions and should be at | |
218 | // least as efficient than the standard implementation. | |
219 | // | |
220 | // Performance note: it's more efficient to write functions which take "const | |
221 | // String&" arguments than "const char *" if you assign the argument to | |
222 | // another string. | |
223 | // | |
224 | // It was compiled and tested under Win32, Linux (libc 5 & 6), Solaris 5.5. | |
225 | // | |
226 | // To do: | |
227 | // - ressource support (string tables in ressources) | |
228 | // - more wide character (UNICODE) support | |
229 | // - regular expressions support | |
c801d85f | 230 | // --------------------------------------------------------------------------- |
3c67202d | 231 | |
c801d85f | 232 | #ifdef WXSTRING_IS_WXOBJECT |
3c67202d VZ |
233 | class WXDLLEXPORT wxString : public wxObject |
234 | { | |
c801d85f KB |
235 | DECLARE_DYNAMIC_CLASS(wxString) |
236 | #else //WXSTRING_IS_WXOBJECT | |
3c67202d VZ |
237 | class WXDLLEXPORT wxString |
238 | { | |
c801d85f KB |
239 | #endif //WXSTRING_IS_WXOBJECT |
240 | ||
fbcb4166 | 241 | friend class WXDLLEXPORT wxArrayString; |
c801d85f | 242 | |
3c67202d VZ |
243 | // NB: special care was taken in arranging the member functions in such order |
244 | // that all inline functions can be effectively inlined, verify that all | |
245 | // performace critical functions are still inlined if you change order! | |
dd1eaa89 VZ |
246 | private: |
247 | // points to data preceded by wxStringData structure with ref count info | |
2bb67b80 | 248 | wxChar *m_pchData; |
dd1eaa89 VZ |
249 | |
250 | // accessor to string data | |
251 | wxStringData* GetStringData() const { return (wxStringData*)m_pchData - 1; } | |
252 | ||
6b95b20d VZ |
253 | // string (re)initialization functions |
254 | // initializes the string to the empty value (must be called only from | |
255 | // ctors, use Reinit() otherwise) | |
e90c1d2a | 256 | void Init() { m_pchData = (wxChar *)wxEmptyString; } |
6b95b20d | 257 | // initializaes the string with (a part of) C-string |
2bb67b80 | 258 | void InitWith(const wxChar *psz, size_t nPos = 0, size_t nLen = wxSTRING_MAXLEN); |
6b95b20d VZ |
259 | // as Init, but also frees old data |
260 | void Reinit() { GetStringData()->Unlock(); Init(); } | |
261 | ||
262 | // memory allocation | |
263 | // allocates memory for string of lenght nLen | |
264 | void AllocBuffer(size_t nLen); | |
265 | // copies data to another string | |
266 | void AllocCopy(wxString&, int, int) const; | |
267 | // effectively copies data to string | |
2bb67b80 | 268 | void AssignCopy(size_t, const wxChar *); |
6b95b20d VZ |
269 | |
270 | // append a (sub)string | |
2bb67b80 | 271 | void ConcatSelf(int nLen, const wxChar *src); |
6b95b20d VZ |
272 | |
273 | // functions called before writing to the string: they copy it if there | |
274 | // are other references to our data (should be the only owner when writing) | |
275 | void CopyBeforeWrite(); | |
276 | void AllocBeforeWrite(size_t); | |
277 | ||
c606a9a4 VZ |
278 | // this method is not implemented - there is _no_ conversion from int to |
279 | // string, you're doing something wrong if the compiler wants to call it! | |
280 | // | |
281 | // try `s << i' or `s.Printf("%d", i)' instead | |
282 | wxString(int); | |
283 | wxString(long); | |
284 | ||
c801d85f | 285 | public: |
3c67202d VZ |
286 | // constructors and destructor |
287 | // ctor for an empty string | |
6b95b20d | 288 | wxString() { Init(); } |
3c67202d | 289 | // copy ctor |
6b95b20d VZ |
290 | wxString(const wxString& stringSrc) |
291 | { | |
292 | wxASSERT( stringSrc.GetStringData()->IsValid() ); | |
293 | ||
294 | if ( stringSrc.IsEmpty() ) { | |
295 | // nothing to do for an empty string | |
296 | Init(); | |
297 | } | |
298 | else { | |
299 | m_pchData = stringSrc.m_pchData; // share same data | |
300 | GetStringData()->Lock(); // => one more copy | |
301 | } | |
302 | } | |
3c67202d | 303 | // string containing nRepeat copies of ch |
2bb67b80 | 304 | wxString(wxChar ch, size_t nRepeat = 1); |
3c67202d | 305 | // ctor takes first nLength characters from C string |
566b84d2 | 306 | // (default value of wxSTRING_MAXLEN means take all the string) |
2bb67b80 | 307 | wxString(const wxChar *psz, size_t nLength = wxSTRING_MAXLEN) |
6b95b20d | 308 | { InitWith(psz, 0, nLength); } |
e90c1d2a | 309 | |
2bb67b80 OK |
310 | #if wxUSE_UNICODE |
311 | // from multibyte string | |
312 | // (NB: nLength is right now number of Unicode characters, not | |
313 | // characters in psz! So try not to use it yet!) | |
5f709e67 | 314 | wxString(const char *psz, wxMBConv& conv = wxConvLibc, size_t nLength = wxSTRING_MAXLEN); |
2bb67b80 OK |
315 | // from wxWCharBuffer (i.e. return from wxGetString) |
316 | wxString(const wxWCharBuffer& psz) | |
317 | { InitWith(psz, 0, wxSTRING_MAXLEN); } | |
e90c1d2a | 318 | #else // ANSI |
3c67202d | 319 | // from C string (for compilers using unsigned char) |
2bb67b80 OK |
320 | wxString(const unsigned char* psz, size_t nLength = wxSTRING_MAXLEN) |
321 | { InitWith((const char*)psz, 0, nLength); } | |
3a309a64 | 322 | // from multibyte string |
7c74e7fe | 323 | wxString(const char *psz, wxMBConv& WXUNUSED(conv) , size_t nLength = wxSTRING_MAXLEN) |
3a309a64 | 324 | { InitWith(psz, 0, nLength); } |
e90c1d2a | 325 | |
6f841509 | 326 | #if wxUSE_WCHAR_T |
2bb67b80 | 327 | // from wide (Unicode) string |
c801d85f | 328 | wxString(const wchar_t *pwz); |
e90c1d2a VZ |
329 | #endif // !wxUSE_WCHAR_T |
330 | ||
2bb67b80 OK |
331 | // from wxCharBuffer |
332 | wxString(const wxCharBuffer& psz) | |
333 | { InitWith(psz, 0, wxSTRING_MAXLEN); } | |
e90c1d2a VZ |
334 | #endif // Unicode/ANSI |
335 | ||
3c67202d | 336 | // dtor is not virtual, this class must not be inherited from! |
6b95b20d | 337 | ~wxString() { GetStringData()->Unlock(); } |
c801d85f | 338 | |
3c67202d VZ |
339 | // generic attributes & operations |
340 | // as standard strlen() | |
47d67540 | 341 | size_t Len() const { return GetStringData()->nDataLength; } |
3c67202d | 342 | // string contains any characters? |
dd1eaa89 | 343 | bool IsEmpty() const { return Len() == 0; } |
dcfde592 VZ |
344 | // empty string is "FALSE", so !str will return TRUE |
345 | bool operator!() const { return IsEmpty(); } | |
3c67202d | 346 | // empty string contents |
dd1eaa89 VZ |
347 | void Empty() |
348 | { | |
2c3b684c | 349 | if ( !IsEmpty() ) |
dd1eaa89 VZ |
350 | Reinit(); |
351 | ||
7be07660 | 352 | // should be empty |
dd1eaa89 | 353 | wxASSERT( GetStringData()->nDataLength == 0 ); |
7be07660 | 354 | } |
3c67202d | 355 | // empty the string and free memory |
7be07660 VZ |
356 | void Clear() |
357 | { | |
358 | if ( !GetStringData()->IsEmpty() ) | |
359 | Reinit(); | |
360 | ||
361 | wxASSERT( GetStringData()->nDataLength == 0 ); // should be empty | |
362 | wxASSERT( GetStringData()->nAllocLength == 0 ); // and not own any memory | |
dd1eaa89 VZ |
363 | } |
364 | ||
3c67202d VZ |
365 | // contents test |
366 | // Is an ascii value | |
c801d85f | 367 | bool IsAscii() const; |
3c67202d | 368 | // Is a number |
c801d85f | 369 | bool IsNumber() const; |
3c67202d | 370 | // Is a word |
c801d85f | 371 | bool IsWord() const; |
c801d85f | 372 | |
3c67202d VZ |
373 | // data access (all indexes are 0 based) |
374 | // read access | |
2bb67b80 | 375 | wxChar GetChar(size_t n) const |
dd1eaa89 | 376 | { ASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
3c67202d | 377 | // read/write access |
2bb67b80 | 378 | wxChar& GetWritableChar(size_t n) |
dd1eaa89 | 379 | { ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } |
3c67202d | 380 | // write access |
2bb67b80 | 381 | void SetChar(size_t n, wxChar ch) |
c801d85f KB |
382 | { ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); m_pchData[n] = ch; } |
383 | ||
3c67202d | 384 | // get last character |
2bb67b80 | 385 | wxChar Last() const |
c801d85f | 386 | { wxASSERT( !IsEmpty() ); return m_pchData[Len() - 1]; } |
3c67202d | 387 | // get writable last character |
2bb67b80 | 388 | wxChar& Last() |
c801d85f KB |
389 | { wxASSERT( !IsEmpty() ); CopyBeforeWrite(); return m_pchData[Len()-1]; } |
390 | ||
3c67202d | 391 | // operator version of GetChar |
2bb67b80 | 392 | wxChar operator[](size_t n) const |
c801d85f | 393 | { ASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
c5248639 | 394 | |
3c67202d | 395 | // operator version of GetChar |
2bb67b80 | 396 | wxChar operator[](int n) const |
c801d85f | 397 | { ASSERT_VALID_INDEX( n ); return m_pchData[n]; } |
0c423466 KB |
398 | #ifdef __alpha__ |
399 | // operator version of GetChar | |
400 | wxChar operator[](unsigned int n) const | |
401 | { ASSERT_VALID_INDEX( n ); return m_pchData[n]; } | |
402 | #endif | |
cd0b1709 | 403 | |
f83db661 | 404 | // operator version of GetWriteableChar |
2bb67b80 | 405 | wxChar& operator[](size_t n) |
c801d85f | 406 | { ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } |
f83db661 KB |
407 | #ifdef __alpha__ |
408 | // operator version of GetWriteableChar | |
409 | wxChar& operator[](unsigned int n) | |
410 | { ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; } | |
411 | #endif | |
c801d85f | 412 | |
3c67202d | 413 | // implicit conversion to C string |
2bb67b80 | 414 | operator const wxChar*() const { return m_pchData; } |
3c67202d | 415 | // explicit conversion to C string (use this with printf()!) |
2bb67b80 | 416 | const wxChar* c_str() const { return m_pchData; } |
6f841509 OK |
417 | // (and this with [wx]Printf()!) |
418 | const wxChar* wx_str() const { return m_pchData; } | |
e90c1d2a | 419 | // identical to c_str() |
2bb67b80 | 420 | const wxChar* GetData() const { return m_pchData; } |
e90c1d2a VZ |
421 | |
422 | // conversions with (possible) format convertions: have to return a | |
423 | // buffer with temporary data | |
2bb67b80 | 424 | #if wxUSE_UNICODE |
5f709e67 | 425 | const wxCharBuffer mb_str(wxMBConv& conv = wxConvLibc) const { return conv.cWC2MB(m_pchData); } |
e90c1d2a VZ |
426 | const wxWX2MBbuf mbc_str() const { return mb_str(*wxConvCurrent); } |
427 | ||
5f709e67 | 428 | const wxChar* wc_str(wxMBConv& WXUNUSED(conv) = wxConvLibc) const { return m_pchData; } |
e90c1d2a | 429 | |
2bb67b80 | 430 | #if wxMBFILES |
5f709e67 | 431 | const wxCharBuffer fn_str() const { return mb_str(wxConvFile); } |
e90c1d2a | 432 | #else // !wxMBFILES |
2bb67b80 | 433 | const wxChar* fn_str() const { return m_pchData; } |
e90c1d2a VZ |
434 | #endif // wxMBFILES/!wxMBFILES |
435 | #else // ANSI | |
436 | #if wxUSE_MULTIBYTE | |
437 | const wxChar* mb_str(wxMBConv& WXUNUSED(conv) = wxConvLibc) const | |
438 | { return m_pchData; } | |
439 | const wxWX2MBbuf mbc_str() const { return mb_str(*wxConvCurrent); } | |
440 | #else // !mmultibyte | |
441 | const wxChar* mb_str() const { return m_pchData; } | |
442 | const wxWX2MBbuf mbc_str() const { return mb_str(); } | |
443 | #endif // multibyte/!multibyte | |
6f841509 | 444 | #if wxUSE_WCHAR_T |
2bb67b80 | 445 | const wxWCharBuffer wc_str(wxMBConv& conv) const { return conv.cMB2WC(m_pchData); } |
e90c1d2a | 446 | #endif // wxUSE_WCHAR_T |
2bb67b80 | 447 | const wxChar* fn_str() const { return m_pchData; } |
e90c1d2a | 448 | #endif // Unicode/ANSI |
c801d85f | 449 | |
3c67202d VZ |
450 | // overloaded assignment |
451 | // from another wxString | |
c801d85f | 452 | wxString& operator=(const wxString& stringSrc); |
3c67202d | 453 | // from a character |
2bb67b80 | 454 | wxString& operator=(wxChar ch); |
3c67202d | 455 | // from a C string |
2bb67b80 | 456 | wxString& operator=(const wxChar *psz); |
111bb7f2 OK |
457 | #if wxUSE_UNICODE |
458 | // from wxWCharBuffer | |
459 | wxString& operator=(const wxWCharBuffer& psz) { return operator=((const wchar_t *)psz); } | |
e90c1d2a | 460 | #else // ANSI |
3c67202d | 461 | // from another kind of C string |
c801d85f | 462 | wxString& operator=(const unsigned char* psz); |
6f841509 | 463 | #if wxUSE_WCHAR_T |
3c67202d | 464 | // from a wide string |
c801d85f | 465 | wxString& operator=(const wchar_t *pwz); |
6f841509 | 466 | #endif |
111bb7f2 OK |
467 | // from wxCharBuffer |
468 | wxString& operator=(const wxCharBuffer& psz) { return operator=((const char *)psz); } | |
e90c1d2a | 469 | #endif // Unicode/ANSI |
3c67202d VZ |
470 | |
471 | // string concatenation | |
472 | // in place concatenation | |
473 | /* | |
474 | Concatenate and return the result. Note that the left to right | |
475 | associativity of << allows to write things like "str << str1 << str2 | |
476 | << ..." (unlike with +=) | |
477 | */ | |
478 | // string += string | |
dd1eaa89 VZ |
479 | wxString& operator<<(const wxString& s) |
480 | { | |
481 | wxASSERT( s.GetStringData()->IsValid() ); | |
482 | ||
483 | ConcatSelf(s.Len(), s); | |
484 | return *this; | |
485 | } | |
3c67202d | 486 | // string += C string |
2bb67b80 OK |
487 | wxString& operator<<(const wxChar *psz) |
488 | { ConcatSelf(wxStrlen(psz), psz); return *this; } | |
3c67202d | 489 | // string += char |
2bb67b80 | 490 | wxString& operator<<(wxChar ch) { ConcatSelf(1, &ch); return *this; } |
dd1eaa89 | 491 | |
3c67202d | 492 | // string += string |
6b95b20d | 493 | void operator+=(const wxString& s) { (void)operator<<(s); } |
3c67202d | 494 | // string += C string |
2bb67b80 | 495 | void operator+=(const wxChar *psz) { (void)operator<<(psz); } |
3c67202d | 496 | // string += char |
2bb67b80 OK |
497 | void operator+=(wxChar ch) { (void)operator<<(ch); } |
498 | ||
499 | // string += buffer (i.e. from wxGetString) | |
500 | #if wxUSE_UNICODE | |
501 | wxString& operator<<(const wxWCharBuffer& s) { (void)operator<<((const wchar_t *)s); return *this; } | |
502 | void operator+=(const wxWCharBuffer& s) { (void)operator<<((const wchar_t *)s); } | |
503 | #else | |
504 | wxString& operator<<(const wxCharBuffer& s) { (void)operator<<((const char *)s); return *this; } | |
505 | void operator+=(const wxCharBuffer& s) { (void)operator<<((const char *)s); } | |
506 | #endif | |
6b95b20d | 507 | |
3c67202d | 508 | // string += C string |
2bb67b80 OK |
509 | wxString& Append(const wxChar* psz) |
510 | { ConcatSelf(wxStrlen(psz), psz); return *this; } | |
3c67202d | 511 | // append count copies of given character |
2bb67b80 | 512 | wxString& Append(wxChar ch, size_t count = 1u) |
3c67202d VZ |
513 | { wxString str(ch, count); return *this << str; } |
514 | ||
515 | // prepend a string, return the string itself | |
516 | wxString& Prepend(const wxString& str) | |
517 | { *this = str + *this; return *this; } | |
518 | ||
519 | // non-destructive concatenation | |
520 | // | |
c33534e5 | 521 | friend wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2); |
3c67202d | 522 | // |
2bb67b80 | 523 | friend wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch); |
3c67202d | 524 | // |
2bb67b80 | 525 | friend wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string); |
3c67202d | 526 | // |
2bb67b80 | 527 | friend wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz); |
3c67202d | 528 | // |
2bb67b80 | 529 | friend wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string); |
3c67202d VZ |
530 | |
531 | // stream-like functions | |
532 | // insert an int into string | |
533 | wxString& operator<<(int i); | |
534 | // insert a float into string | |
535 | wxString& operator<<(float f); | |
536 | // insert a double into string | |
537 | wxString& operator<<(double d); | |
c84c52de | 538 | |
3c67202d | 539 | // string comparison |
30b21f9a | 540 | // case-sensitive comparison (returns a value < 0, = 0 or > 0) |
f33fee2a | 541 | int Cmp(const wxChar *psz) const { return wxStrcmp(c_str(), psz); } |
3c67202d | 542 | // same as Cmp() but not case-sensitive |
f33fee2a | 543 | int CmpNoCase(const wxChar *psz) const { return wxStricmp(c_str(), psz); } |
3c67202d VZ |
544 | // test for the string equality, either considering case or not |
545 | // (if compareWithCase then the case matters) | |
2bb67b80 | 546 | bool IsSameAs(const wxChar *psz, bool compareWithCase = TRUE) const |
3c67202d | 547 | { return (compareWithCase ? Cmp(psz) : CmpNoCase(psz)) == 0; } |
f33fee2a VZ |
548 | // comparison with a signle character: returns TRUE if equal |
549 | bool IsSameAs(wxChar c, bool compareWithCase = TRUE) const | |
550 | { | |
551 | return (Len() == 1) && (compareWithCase ? GetChar(0u) == c | |
552 | : wxToupper(GetChar(0u)) == wxToupper(c)); | |
553 | } | |
3c67202d VZ |
554 | |
555 | // simple sub-string extraction | |
556 | // return substring starting at nFirst of length nCount (or till the end | |
557 | // if nCount = default value) | |
566b84d2 | 558 | wxString Mid(size_t nFirst, size_t nCount = wxSTRING_MAXLEN) const; |
3c67202d VZ |
559 | |
560 | // operator version of Mid() | |
561 | wxString operator()(size_t start, size_t len) const | |
562 | { return Mid(start, len); } | |
563 | ||
564 | // get first nCount characters | |
c801d85f | 565 | wxString Left(size_t nCount) const; |
3c67202d | 566 | // get last nCount characters |
c801d85f | 567 | wxString Right(size_t nCount) const; |
3c67202d VZ |
568 | // get all characters before the first occurence of ch |
569 | // (returns the whole string if ch not found) | |
2bb67b80 | 570 | wxString BeforeFirst(wxChar ch) const; |
3c67202d VZ |
571 | // get all characters before the last occurence of ch |
572 | // (returns empty string if ch not found) | |
2bb67b80 | 573 | wxString BeforeLast(wxChar ch) const; |
3c67202d VZ |
574 | // get all characters after the first occurence of ch |
575 | // (returns empty string if ch not found) | |
2bb67b80 | 576 | wxString AfterFirst(wxChar ch) const; |
3c67202d VZ |
577 | // get all characters after the last occurence of ch |
578 | // (returns the whole string if ch not found) | |
2bb67b80 | 579 | wxString AfterLast(wxChar ch) const; |
3c67202d VZ |
580 | |
581 | // for compatibility only, use more explicitly named functions above | |
2bb67b80 OK |
582 | wxString Before(wxChar ch) const { return BeforeLast(ch); } |
583 | wxString After(wxChar ch) const { return AfterFirst(ch); } | |
3c67202d VZ |
584 | |
585 | // case conversion | |
c84c52de | 586 | // convert to upper case in place, return the string itself |
c801d85f | 587 | wxString& MakeUpper(); |
c84c52de | 588 | // convert to upper case, return the copy of the string |
03ab016d JS |
589 | // Here's something to remember: BC++ doesn't like returns in inlines. |
590 | wxString Upper() const ; | |
c84c52de | 591 | // convert to lower case in place, return the string itself |
c801d85f | 592 | wxString& MakeLower(); |
c84c52de | 593 | // convert to lower case, return the copy of the string |
03ab016d | 594 | wxString Lower() const ; |
c801d85f | 595 | |
3c67202d VZ |
596 | // trimming/padding whitespace (either side) and truncating |
597 | // remove spaces from left or from right (default) side | |
c801d85f | 598 | wxString& Trim(bool bFromRight = TRUE); |
3c67202d | 599 | // add nCount copies chPad in the beginning or at the end (default) |
223d09f6 | 600 | wxString& Pad(size_t nCount, wxChar chPad = wxT(' '), bool bFromRight = TRUE); |
3c67202d | 601 | // truncate string to given length |
c801d85f | 602 | wxString& Truncate(size_t uiLen); |
dd1eaa89 | 603 | |
3c67202d VZ |
604 | // searching and replacing |
605 | // searching (return starting index, or -1 if not found) | |
2bb67b80 | 606 | int Find(wxChar ch, bool bFromEnd = FALSE) const; // like strchr/strrchr |
3c67202d | 607 | // searching (return starting index, or -1 if not found) |
2bb67b80 | 608 | int Find(const wxChar *pszSub) const; // like strstr |
3c67202d VZ |
609 | // replace first (or all of bReplaceAll) occurences of substring with |
610 | // another string, returns the number of replacements made | |
2bb67b80 OK |
611 | size_t Replace(const wxChar *szOld, |
612 | const wxChar *szNew, | |
3c67202d VZ |
613 | bool bReplaceAll = TRUE); |
614 | ||
615 | // check if the string contents matches a mask containing '*' and '?' | |
2bb67b80 | 616 | bool Matches(const wxChar *szMask) const; |
c801d85f | 617 | |
cd0b1709 VZ |
618 | // conversion to numbers: all functions return TRUE only if the whole string |
619 | // is a number and put the value of this number into the pointer provided | |
620 | // convert to a signed integer | |
621 | bool ToLong(long *val) const; | |
622 | // convert to an unsigned integer | |
623 | bool ToULong(unsigned long *val) const; | |
624 | // convert to a double | |
625 | bool ToDouble(double *val) const; | |
626 | ||
3c67202d VZ |
627 | // formated input/output |
628 | // as sprintf(), returns the number of characters written or < 0 on error | |
2bb67b80 | 629 | int Printf(const wxChar *pszFormat, ...); |
3c67202d | 630 | // as vprintf(), returns the number of characters written or < 0 on error |
2bb67b80 | 631 | int PrintfV(const wxChar* pszFormat, va_list argptr); |
dd1eaa89 | 632 | |
341e7d28 VZ |
633 | // returns the string containing the result of Printf() to it |
634 | static wxString Format(const wxChar *pszFormat, ...); | |
635 | // the same as above, but takes a va_list | |
636 | static wxString FormatV(const wxChar *pszFormat, va_list argptr); | |
637 | ||
3c67202d VZ |
638 | // raw access to string memory |
639 | // ensure that string has space for at least nLen characters | |
dd1eaa89 | 640 | // only works if the data of this string is not shared |
c86f1403 | 641 | void Alloc(size_t nLen); |
3c67202d | 642 | // minimize the string's memory |
dd1eaa89 VZ |
643 | // only works if the data of this string is not shared |
644 | void Shrink(); | |
3c67202d VZ |
645 | // get writable buffer of at least nLen bytes. Unget() *must* be called |
646 | // a.s.a.p. to put string back in a reasonable state! | |
2bb67b80 | 647 | wxChar *GetWriteBuf(size_t nLen); |
3c67202d | 648 | // call this immediately after GetWriteBuf() has been used |
8fd0f20b | 649 | void UngetWriteBuf(); |
c801d85f | 650 | |
3c67202d VZ |
651 | // wxWindows version 1 compatibility functions |
652 | ||
653 | // use Mid() | |
654 | wxString SubString(size_t from, size_t to) const | |
655 | { return Mid(from, (to - from + 1)); } | |
656 | // values for second parameter of CompareTo function | |
c801d85f | 657 | enum caseCompare {exact, ignoreCase}; |
3c67202d | 658 | // values for first parameter of Strip function |
c801d85f | 659 | enum stripType {leading = 0x1, trailing = 0x2, both = 0x3}; |
8870c26e | 660 | |
3c67202d | 661 | // use Printf() |
2bb67b80 | 662 | int sprintf(const wxChar *pszFormat, ...); |
c801d85f | 663 | |
3c67202d | 664 | // use Cmp() |
2bb67b80 | 665 | inline int CompareTo(const wxChar* psz, caseCompare cmp = exact) const |
6b95b20d | 666 | { return cmp == exact ? Cmp(psz) : CmpNoCase(psz); } |
c801d85f | 667 | |
3c67202d | 668 | // use Len |
c801d85f | 669 | size_t Length() const { return Len(); } |
3c67202d | 670 | // Count the number of characters |
2bb67b80 | 671 | int Freq(wxChar ch) const; |
3c67202d | 672 | // use MakeLower |
c801d85f | 673 | void LowerCase() { MakeLower(); } |
3c67202d | 674 | // use MakeUpper |
c801d85f | 675 | void UpperCase() { MakeUpper(); } |
3c67202d | 676 | // use Trim except that it doesn't change this string |
c801d85f KB |
677 | wxString Strip(stripType w = trailing) const; |
678 | ||
3c67202d | 679 | // use Find (more general variants not yet supported) |
2bb67b80 OK |
680 | size_t Index(const wxChar* psz) const { return Find(psz); } |
681 | size_t Index(wxChar ch) const { return Find(ch); } | |
3c67202d | 682 | // use Truncate |
c801d85f KB |
683 | wxString& Remove(size_t pos) { return Truncate(pos); } |
684 | wxString& RemoveLast() { return Truncate(Len() - 1); } | |
685 | ||
3ed358cb | 686 | wxString& Remove(size_t nStart, size_t nLen) { return erase( nStart, nLen ); } |
dd1eaa89 | 687 | |
3c67202d | 688 | // use Find() |
2bb67b80 OK |
689 | int First( const wxChar ch ) const { return Find(ch); } |
690 | int First( const wxChar* psz ) const { return Find(psz); } | |
3ed358cb | 691 | int First( const wxString &str ) const { return Find(str); } |
2bb67b80 | 692 | int Last( const wxChar ch ) const { return Find(ch, TRUE); } |
3c67202d | 693 | bool Contains(const wxString& str) const { return Find(str) != -1; } |
c801d85f | 694 | |
3c67202d | 695 | // use IsEmpty() |
c801d85f | 696 | bool IsNull() const { return IsEmpty(); } |
c801d85f | 697 | |
3c67202d VZ |
698 | #ifdef wxSTD_STRING_COMPATIBILITY |
699 | // std::string compatibility functions | |
dd1eaa89 | 700 | |
2bc07607 VZ |
701 | // standard types |
702 | typedef wxChar value_type; | |
703 | typedef const value_type *const_iterator; | |
704 | ||
3c67202d | 705 | // an 'invalid' value for string index |
c801d85f | 706 | static const size_t npos; |
dd1eaa89 | 707 | |
3c67202d VZ |
708 | // constructors |
709 | // take nLen chars starting at nPos | |
710 | wxString(const wxString& str, size_t nPos, size_t nLen) | |
711 | { | |
712 | wxASSERT( str.GetStringData()->IsValid() ); | |
713 | InitWith(str.c_str(), nPos, nLen == npos ? 0 : nLen); | |
714 | } | |
715 | // take all characters from pStart to pEnd | |
716 | wxString(const void *pStart, const void *pEnd); | |
717 | ||
718 | // lib.string.capacity | |
719 | // return the length of the string | |
720 | size_t size() const { return Len(); } | |
721 | // return the length of the string | |
722 | size_t length() const { return Len(); } | |
723 | // return the maximum size of the string | |
566b84d2 | 724 | size_t max_size() const { return wxSTRING_MAXLEN; } |
3c67202d | 725 | // resize the string, filling the space with c if c != 0 |
223d09f6 | 726 | void resize(size_t nSize, wxChar ch = wxT('\0')); |
3c67202d VZ |
727 | // delete the contents of the string |
728 | void clear() { Empty(); } | |
729 | // returns true if the string is empty | |
730 | bool empty() const { return IsEmpty(); } | |
252a752e VZ |
731 | // inform string about planned change in size |
732 | void reserve(size_t size) { Alloc(size); } | |
3c67202d VZ |
733 | |
734 | // lib.string.access | |
735 | // return the character at position n | |
2bb67b80 | 736 | wxChar at(size_t n) const { return GetChar(n); } |
3c67202d | 737 | // returns the writable character at position n |
2bb67b80 | 738 | wxChar& at(size_t n) { return GetWritableChar(n); } |
3c67202d | 739 | |
2bc07607 VZ |
740 | // first valid index position |
741 | const_iterator begin() const { return wx_str(); } | |
742 | // position one after the last valid one | |
743 | const_iterator end() const { return wx_str() + length(); } | |
744 | ||
3c67202d VZ |
745 | // lib.string.modifiers |
746 | // append a string | |
747 | wxString& append(const wxString& str) | |
748 | { *this += str; return *this; } | |
749 | // append elements str[pos], ..., str[pos+n] | |
750 | wxString& append(const wxString& str, size_t pos, size_t n) | |
751 | { ConcatSelf(n, str.c_str() + pos); return *this; } | |
752 | // append first n (or all if n == npos) characters of sz | |
2bb67b80 OK |
753 | wxString& append(const wxChar *sz, size_t n = npos) |
754 | { ConcatSelf(n == npos ? wxStrlen(sz) : n, sz); return *this; } | |
3c67202d VZ |
755 | |
756 | // append n copies of ch | |
2bb67b80 | 757 | wxString& append(size_t n, wxChar ch) { return Pad(n, ch); } |
3c67202d VZ |
758 | |
759 | // same as `this_string = str' | |
760 | wxString& assign(const wxString& str) { return (*this) = str; } | |
761 | // same as ` = str[pos..pos + n] | |
762 | wxString& assign(const wxString& str, size_t pos, size_t n) | |
2bb67b80 | 763 | { return *this = wxString((const wxChar *)str + pos, n); } |
3c67202d | 764 | // same as `= first n (or all if n == npos) characters of sz' |
2bb67b80 | 765 | wxString& assign(const wxChar *sz, size_t n = npos) |
3c67202d VZ |
766 | { return *this = wxString(sz, n); } |
767 | // same as `= n copies of ch' | |
2bb67b80 | 768 | wxString& assign(size_t n, wxChar ch) |
3c67202d VZ |
769 | { return *this = wxString(ch, n); } |
770 | ||
771 | // insert another string | |
772 | wxString& insert(size_t nPos, const wxString& str); | |
773 | // insert n chars of str starting at nStart (in str) | |
774 | wxString& insert(size_t nPos, const wxString& str, size_t nStart, size_t n) | |
2bb67b80 | 775 | { return insert(nPos, wxString((const wxChar *)str + nStart, n)); } |
3c67202d VZ |
776 | |
777 | // insert first n (or all if n == npos) characters of sz | |
2bb67b80 | 778 | wxString& insert(size_t nPos, const wxChar *sz, size_t n = npos) |
3c67202d VZ |
779 | { return insert(nPos, wxString(sz, n)); } |
780 | // insert n copies of ch | |
2bb67b80 | 781 | wxString& insert(size_t nPos, size_t n, wxChar ch) |
3c67202d VZ |
782 | { return insert(nPos, wxString(ch, n)); } |
783 | ||
784 | // delete characters from nStart to nStart + nLen | |
785 | wxString& erase(size_t nStart = 0, size_t nLen = npos); | |
786 | ||
787 | // replaces the substring of length nLen starting at nStart | |
2bb67b80 | 788 | wxString& replace(size_t nStart, size_t nLen, const wxChar* sz); |
3c67202d | 789 | // replaces the substring with nCount copies of ch |
2bb67b80 | 790 | wxString& replace(size_t nStart, size_t nLen, size_t nCount, wxChar ch); |
3c67202d VZ |
791 | // replaces a substring with another substring |
792 | wxString& replace(size_t nStart, size_t nLen, | |
793 | const wxString& str, size_t nStart2, size_t nLen2); | |
794 | // replaces the substring with first nCount chars of sz | |
795 | wxString& replace(size_t nStart, size_t nLen, | |
2bb67b80 | 796 | const wxChar* sz, size_t nCount); |
3c67202d VZ |
797 | |
798 | // swap two strings | |
799 | void swap(wxString& str); | |
800 | ||
801 | // All find() functions take the nStart argument which specifies the | |
802 | // position to start the search on, the default value is 0. All functions | |
803 | // return npos if there were no match. | |
804 | ||
805 | // find a substring | |
806 | size_t find(const wxString& str, size_t nStart = 0) const; | |
807 | ||
808 | // VC++ 1.5 can't cope with this syntax. | |
3f4a0c5b | 809 | #if !defined(__VISUALC__) || defined(__WIN32__) |
3c67202d | 810 | // find first n characters of sz |
2bb67b80 | 811 | size_t find(const wxChar* sz, size_t nStart = 0, size_t n = npos) const; |
6b0eb19f | 812 | #endif |
3c67202d VZ |
813 | |
814 | // Gives a duplicate symbol (presumably a case-insensitivity problem) | |
62448488 | 815 | #if !defined(__BORLANDC__) |
3c67202d | 816 | // find the first occurence of character ch after nStart |
2bb67b80 | 817 | size_t find(wxChar ch, size_t nStart = 0) const; |
62448488 | 818 | #endif |
3c67202d VZ |
819 | // rfind() family is exactly like find() but works right to left |
820 | ||
821 | // as find, but from the end | |
822 | size_t rfind(const wxString& str, size_t nStart = npos) const; | |
823 | ||
824 | // VC++ 1.5 can't cope with this syntax. | |
3f4a0c5b | 825 | #if !defined(__VISUALC__) || defined(__WIN32__) |
3c67202d | 826 | // as find, but from the end |
2bb67b80 | 827 | size_t rfind(const wxChar* sz, size_t nStart = npos, |
3c67202d VZ |
828 | size_t n = npos) const; |
829 | // as find, but from the end | |
2bb67b80 | 830 | size_t rfind(wxChar ch, size_t nStart = npos) const; |
c801d85f | 831 | #endif |
3c67202d VZ |
832 | |
833 | // find first/last occurence of any character in the set | |
834 | ||
969d318c VZ |
835 | // as strpbrk() but starts at nStart, returns npos if not found |
836 | size_t find_first_of(const wxString& str, size_t nStart = 0) const | |
837 | { return find_first_of(str.c_str(), nStart); } | |
838 | // same as above | |
2bb67b80 | 839 | size_t find_first_of(const wxChar* sz, size_t nStart = 0) const; |
3c67202d | 840 | // same as find(char, size_t) |
969d318c VZ |
841 | size_t find_first_of(wxChar c, size_t nStart = 0) const |
842 | { return find(c, nStart); } | |
843 | // find the last (starting from nStart) char from str in this string | |
844 | size_t find_last_of (const wxString& str, size_t nStart = npos) const | |
845 | { return find_last_of(str.c_str(), nStart); } | |
846 | // same as above | |
847 | size_t find_last_of (const wxChar* sz, size_t nStart = npos) const; | |
848 | // same as above | |
849 | size_t find_last_of(wxChar c, size_t nStart = npos) const | |
850 | { return rfind(c, nStart); } | |
3c67202d VZ |
851 | |
852 | // find first/last occurence of any character not in the set | |
853 | ||
969d318c VZ |
854 | // as strspn() (starting from nStart), returns npos on failure |
855 | size_t find_first_not_of(const wxString& str, size_t nStart = 0) const | |
856 | { return find_first_not_of(str.c_str(), nStart); } | |
857 | // same as above | |
858 | size_t find_first_not_of(const wxChar* sz, size_t nStart = 0) const; | |
859 | // same as above | |
2bb67b80 | 860 | size_t find_first_not_of(wxChar ch, size_t nStart = 0) const; |
969d318c | 861 | // as strcspn() |
3c67202d | 862 | size_t find_last_not_of(const wxString& str, size_t nStart=npos) const; |
969d318c VZ |
863 | // same as above |
864 | size_t find_last_not_of(const wxChar* sz, size_t nStart = npos) const; | |
865 | // same as above | |
2bb67b80 | 866 | size_t find_last_not_of(wxChar ch, size_t nStart = npos) const; |
3c67202d VZ |
867 | |
868 | // All compare functions return -1, 0 or 1 if the [sub]string is less, | |
869 | // equal or greater than the compare() argument. | |
870 | ||
871 | // just like strcmp() | |
872 | int compare(const wxString& str) const { return Cmp(str); } | |
873 | // comparison with a substring | |
874 | int compare(size_t nStart, size_t nLen, const wxString& str) const; | |
875 | // comparison of 2 substrings | |
876 | int compare(size_t nStart, size_t nLen, | |
877 | const wxString& str, size_t nStart2, size_t nLen2) const; | |
878 | // just like strcmp() | |
2bb67b80 | 879 | int compare(const wxChar* sz) const { return Cmp(sz); } |
3c67202d VZ |
880 | // substring comparison with first nCount characters of sz |
881 | int compare(size_t nStart, size_t nLen, | |
2bb67b80 | 882 | const wxChar* sz, size_t nCount = npos) const; |
3c67202d VZ |
883 | |
884 | // substring extraction | |
8c264b23 VZ |
885 | wxString substr(size_t nStart = 0, size_t nLen = npos) const |
886 | { return Mid(nStart, nLen); } | |
3c67202d | 887 | #endif // wxSTD_STRING_COMPATIBILITY |
c801d85f KB |
888 | }; |
889 | ||
890 | // ---------------------------------------------------------------------------- | |
3c67202d VZ |
891 | // The string array uses it's knowledge of internal structure of the wxString |
892 | // class to optimize string storage. Normally, we would store pointers to | |
893 | // string, but as wxString is, in fact, itself a pointer (sizeof(wxString) is | |
894 | // sizeof(char *)) we store these pointers instead. The cast to "wxString *" is | |
895 | // really all we need to turn such pointer into a string! | |
896 | // | |
897 | // Of course, it can be called a dirty hack, but we use twice less memory and | |
898 | // this approach is also more speed efficient, so it's probably worth it. | |
899 | // | |
900 | // Usage notes: when a string is added/inserted, a new copy of it is created, | |
901 | // so the original string may be safely deleted. When a string is retrieved | |
902 | // from the array (operator[] or Item() method), a reference is returned. | |
c801d85f | 903 | // ---------------------------------------------------------------------------- |
e90c1d2a | 904 | |
fbcb4166 | 905 | class WXDLLEXPORT wxArrayString |
c801d85f KB |
906 | { |
907 | public: | |
30b21f9a VZ |
908 | // type of function used by wxArrayString::Sort() |
909 | typedef int (*CompareFunction)(const wxString& first, | |
910 | const wxString& second); | |
911 | ||
3c67202d | 912 | // constructors and destructor |
e87271f3 VZ |
913 | // default ctor: if autoSort is TRUE, the array is always sorted (in |
914 | // alphabetical order) | |
915 | wxArrayString(bool autoSort = FALSE); | |
3c67202d | 916 | // copy ctor |
c801d85f | 917 | wxArrayString(const wxArrayString& array); |
3c67202d | 918 | // assignment operator |
c801d85f | 919 | wxArrayString& operator=(const wxArrayString& src); |
3c67202d | 920 | // not virtual, this class should not be derived from |
c801d85f | 921 | ~wxArrayString(); |
c801d85f | 922 | |
3c67202d VZ |
923 | // memory management |
924 | // empties the list, but doesn't release memory | |
c801d85f | 925 | void Empty(); |
3c67202d | 926 | // empties the list and releases memory |
c801d85f | 927 | void Clear(); |
3c67202d | 928 | // preallocates memory for given number of items |
c801d85f | 929 | void Alloc(size_t nCount); |
3c67202d | 930 | // minimzes the memory usage (by freeing all extra memory) |
dd1eaa89 | 931 | void Shrink(); |
3c67202d VZ |
932 | |
933 | // simple accessors | |
934 | // number of elements in the array | |
935 | size_t GetCount() const { return m_nCount; } | |
936 | // is it empty? | |
937 | bool IsEmpty() const { return m_nCount == 0; } | |
938 | // number of elements in the array (GetCount is preferred API) | |
939 | size_t Count() const { return m_nCount; } | |
940 | ||
941 | // items access (range checking is done in debug version) | |
942 | // get item at position uiIndex | |
c801d85f KB |
943 | wxString& Item(size_t nIndex) const |
944 | { wxASSERT( nIndex < m_nCount ); return *(wxString *)&(m_pItems[nIndex]); } | |
3c67202d | 945 | // same as Item() |
c801d85f | 946 | wxString& operator[](size_t nIndex) const { return Item(nIndex); } |
3c67202d | 947 | // get last item |
c801d85f | 948 | wxString& Last() const { wxASSERT( !IsEmpty() ); return Item(Count() - 1); } |
3c67202d VZ |
949 | |
950 | // item management | |
951 | // Search the element in the array, starting from the beginning if | |
952 | // bFromEnd is FALSE or from end otherwise. If bCase, comparison is case | |
953 | // sensitive (default). Returns index of the first item matched or | |
954 | // wxNOT_FOUND | |
2bb67b80 | 955 | int Index (const wxChar *sz, bool bCase = TRUE, bool bFromEnd = FALSE) const; |
e01c8145 VZ |
956 | // add new element at the end (if the array is not sorted), return its |
957 | // index | |
958 | size_t Add(const wxString& str); | |
3c67202d | 959 | // add new element at given position |
c86f1403 | 960 | void Insert(const wxString& str, size_t uiIndex); |
3c67202d | 961 | // remove first item matching this value |
2bb67b80 | 962 | void Remove(const wxChar *sz); |
3c67202d | 963 | // remove item by index |
c801d85f | 964 | void Remove(size_t nIndex); |
c801d85f | 965 | |
30b21f9a VZ |
966 | // sorting |
967 | // sort array elements in alphabetical order (or reversed alphabetical | |
968 | // order if reverseOrder parameter is TRUE) | |
969 | void Sort(bool reverseOrder = FALSE); | |
970 | // sort array elements using specified comparaison function | |
971 | void Sort(CompareFunction compareFunction); | |
c801d85f | 972 | |
e87271f3 VZ |
973 | protected: |
974 | void Copy(const wxArrayString& src); // copies the contents of another array | |
975 | ||
c801d85f | 976 | private: |
e87271f3 VZ |
977 | void Grow(); // makes array bigger if needed |
978 | void Free(); // free all the strings stored | |
c801d85f | 979 | |
e87271f3 | 980 | void DoSort(); // common part of all Sort() variants |
30b21f9a | 981 | |
3c67202d | 982 | size_t m_nSize, // current size of the array |
c801d85f KB |
983 | m_nCount; // current number of elements |
984 | ||
e87271f3 VZ |
985 | wxChar **m_pItems; // pointer to data |
986 | ||
987 | bool m_autoSort; // if TRUE, keep the array always sorted | |
988 | }; | |
989 | ||
990 | class WXDLLEXPORT wxSortedArrayString : public wxArrayString | |
991 | { | |
992 | public: | |
993 | wxSortedArrayString() : wxArrayString(TRUE) | |
994 | { } | |
995 | wxSortedArrayString(const wxArrayString& array) : wxArrayString(TRUE) | |
996 | { Copy(array); } | |
c801d85f KB |
997 | }; |
998 | ||
c801d85f | 999 | // --------------------------------------------------------------------------- |
3c67202d | 1000 | // wxString comparison functions: operator versions are always case sensitive |
c801d85f | 1001 | // --------------------------------------------------------------------------- |
f33fee2a | 1002 | |
3c67202d | 1003 | // |
a3ef5bf5 | 1004 | inline bool operator==(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) == 0); } |
3c67202d | 1005 | // |
2bb67b80 | 1006 | inline bool operator==(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) == 0); } |
3c67202d | 1007 | // |
2bb67b80 | 1008 | inline bool operator==(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) == 0); } |
3c67202d | 1009 | // |
a3ef5bf5 | 1010 | inline bool operator!=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) != 0); } |
3c67202d | 1011 | // |
2bb67b80 | 1012 | inline bool operator!=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) != 0); } |
3c67202d | 1013 | // |
2bb67b80 | 1014 | inline bool operator!=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) != 0); } |
3c67202d | 1015 | // |
a3ef5bf5 | 1016 | inline bool operator< (const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) < 0); } |
3c67202d | 1017 | // |
2bb67b80 | 1018 | inline bool operator< (const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) < 0); } |
3c67202d | 1019 | // |
2bb67b80 | 1020 | inline bool operator< (const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) > 0); } |
3c67202d | 1021 | // |
a3ef5bf5 | 1022 | inline bool operator> (const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) > 0); } |
3c67202d | 1023 | // |
2bb67b80 | 1024 | inline bool operator> (const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) > 0); } |
3c67202d | 1025 | // |
2bb67b80 | 1026 | inline bool operator> (const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) < 0); } |
3c67202d | 1027 | // |
a3ef5bf5 | 1028 | inline bool operator<=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) <= 0); } |
3c67202d | 1029 | // |
2bb67b80 | 1030 | inline bool operator<=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) <= 0); } |
3c67202d | 1031 | // |
2bb67b80 | 1032 | inline bool operator<=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) >= 0); } |
3c67202d | 1033 | // |
a3ef5bf5 | 1034 | inline bool operator>=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) >= 0); } |
3c67202d | 1035 | // |
2bb67b80 | 1036 | inline bool operator>=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) >= 0); } |
3c67202d | 1037 | // |
2bb67b80 | 1038 | inline bool operator>=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) <= 0); } |
3c67202d | 1039 | |
f33fee2a VZ |
1040 | // comparison with char |
1041 | inline bool operator==(wxChar c, const wxString& s) { return s.IsSameAs(c); } | |
1042 | inline bool operator==(const wxString& s, wxChar c) { return s.IsSameAs(c); } | |
1043 | inline bool operator!=(wxChar c, const wxString& s) { return !s.IsSameAs(c); } | |
1044 | inline bool operator!=(const wxString& s, wxChar c) { return !s.IsSameAs(c); } | |
1045 | ||
5ca07d0f OK |
1046 | #if wxUSE_UNICODE |
1047 | inline bool operator==(const wxString& s1, const wxWCharBuffer& s2) | |
f33fee2a | 1048 | { return (s1.Cmp((const wchar_t *)s2) == 0); } |
5ca07d0f | 1049 | inline bool operator==(const wxWCharBuffer& s1, const wxString& s2) |
f33fee2a | 1050 | { return (s2.Cmp((const wchar_t *)s1) == 0); } |
5ca07d0f OK |
1051 | #else |
1052 | inline bool operator==(const wxString& s1, const wxCharBuffer& s2) | |
f33fee2a | 1053 | { return (s1.Cmp((const char *)s2) == 0); } |
5ca07d0f | 1054 | inline bool operator==(const wxCharBuffer& s1, const wxString& s2) |
f33fee2a | 1055 | { return (s2.Cmp((const char *)s1) == 0); } |
5ca07d0f OK |
1056 | #endif |
1057 | ||
ed7174ba | 1058 | wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2); |
2bb67b80 OK |
1059 | wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch); |
1060 | wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string); | |
1061 | wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz); | |
1062 | wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string); | |
028a2b5d | 1063 | #if wxUSE_UNICODE |
c6cee672 | 1064 | inline wxString WXDLLEXPORT operator+(const wxString& string, const wxWCharBuffer& buf) |
e90c1d2a | 1065 | { return string + (const wchar_t *)buf; } |
c6cee672 | 1066 | inline wxString WXDLLEXPORT operator+(const wxWCharBuffer& buf, const wxString& string) |
e90c1d2a | 1067 | { return (const wchar_t *)buf + string; } |
028a2b5d | 1068 | #else |
c6cee672 | 1069 | inline wxString WXDLLEXPORT operator+(const wxString& string, const wxCharBuffer& buf) |
e90c1d2a | 1070 | { return string + (const char *)buf; } |
c6cee672 | 1071 | inline wxString WXDLLEXPORT operator+(const wxCharBuffer& buf, const wxString& string) |
e90c1d2a | 1072 | { return (const char *)buf + string; } |
028a2b5d | 1073 | #endif |
f04f3991 | 1074 | |
c801d85f | 1075 | // --------------------------------------------------------------------------- |
3c67202d | 1076 | // Implementation only from here until the end of file |
c801d85f KB |
1077 | // --------------------------------------------------------------------------- |
1078 | ||
e90c1d2a VZ |
1079 | // don't pollute the library user's name space |
1080 | #undef ASSERT_VALID_INDEX | |
1081 | ||
38830220 | 1082 | #if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM |
c801d85f | 1083 | |
3f4a0c5b | 1084 | #include "wx/ioswrap.h" |
c801d85f | 1085 | |
825ba8f0 SB |
1086 | WXDLLEXPORT istream& operator>>(istream&, wxString&); |
1087 | WXDLLEXPORT ostream& operator<<(ostream&, const wxString&); | |
c801d85f | 1088 | |
3c67202d | 1089 | #endif // wxSTD_STRING_COMPATIBILITY |
c801d85f | 1090 | |
34138703 | 1091 | #endif // _WX_WXSTRINGH__ |