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