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