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