1 /////////////////////////////////////////////////////////////////////////////
3 // Purpose: wxString class
4 // Author: Vadim Zeitlin
8 // Copyright: (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
9 // Licence: wxWindows licence
10 /////////////////////////////////////////////////////////////////////////////
12 #if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
13 #pragma implementation "string.h"
18 * 1) all empty strings use g_strEmpty, nRefs = -1 (set in Init())
19 * 2) AllocBuffer() sets nRefs to 1, Lock() increments it by one
20 * 3) Unlock() decrements nRefs and frees memory if it goes to 0
23 // ===========================================================================
24 // headers, declarations, constants
25 // ===========================================================================
27 // For compilers that support precompilation, includes "wx.h".
28 #include "wx/wxprec.h"
36 #include "wx/string.h"
38 #include "wx/thread.h"
49 // allocating extra space for each string consumes more memory but speeds up
50 // the concatenation operations (nLen is the current string's length)
51 // NB: EXTRA_ALLOC must be >= 0!
52 #define EXTRA_ALLOC (19 - nLen % 16)
54 // ---------------------------------------------------------------------------
55 // static class variables definition
56 // ---------------------------------------------------------------------------
58 #if defined(__VISAGECPP__) && __IBMCPP__ >= 400
59 // must define this static for VA or else you get multiply defined symbols
61 const unsigned int wxSTRING_MAXLEN
= UINT_MAX
- 100;
65 const size_t wxStringBase::npos
= wxSTRING_MAXLEN
;
68 // ----------------------------------------------------------------------------
70 // ----------------------------------------------------------------------------
74 extern const wxChar WXDLLIMPEXP_BASE
*wxEmptyString
= _T("");
78 // for an empty string, GetStringData() will return this address: this
79 // structure has the same layout as wxStringData and it's data() method will
80 // return the empty string (dummy pointer)
85 } g_strEmpty
= { {-1, 0, 0}, wxT('\0') };
87 // empty C style string: points to 'string data' byte of g_strEmpty
88 extern const wxChar WXDLLIMPEXP_BASE
*wxEmptyString
= &g_strEmpty
.dummy
;
92 // ----------------------------------------------------------------------------
94 // ----------------------------------------------------------------------------
96 #if wxUSE_STD_IOSTREAM
98 // MS Visual C++ version 5.0 provides the new STL headers as well as the old
101 // ATTN: you can _not_ use both of these in the same program!
105 wxSTD istream
& operator>>(wxSTD istream
& is
, wxString
& WXUNUSED(str
))
110 streambuf
*sb
= is
.rdbuf();
113 int ch
= sb
->sbumpc ();
115 is
.setstate(ios::eofbit
);
118 else if ( isspace(ch
) ) {
130 if ( str
.length() == 0 )
131 is
.setstate(ios::failbit
);
136 wxSTD ostream
& operator<<(wxSTD ostream
& os
, const wxString
& str
)
142 #endif // wxUSE_STD_IOSTREAM
144 // ----------------------------------------------------------------------------
146 // ----------------------------------------------------------------------------
148 // this small class is used to gather statistics for performance tuning
149 //#define WXSTRING_STATISTICS
150 #ifdef WXSTRING_STATISTICS
154 Averager(const wxChar
*sz
) { m_sz
= sz
; m_nTotal
= m_nCount
= 0; }
156 { wxPrintf("wxString: average %s = %f\n", m_sz
, ((float)m_nTotal
)/m_nCount
); }
158 void Add(size_t n
) { m_nTotal
+= n
; m_nCount
++; }
161 size_t m_nCount
, m_nTotal
;
163 } g_averageLength("allocation size"),
164 g_averageSummandLength("summand length"),
165 g_averageConcatHit("hit probability in concat"),
166 g_averageInitialLength("initial string length");
168 #define STATISTICS_ADD(av, val) g_average##av.Add(val)
170 #define STATISTICS_ADD(av, val)
171 #endif // WXSTRING_STATISTICS
175 // ===========================================================================
176 // wxStringData class deallocation
177 // ===========================================================================
179 #if defined(__VISUALC__) && defined(_MT) && !defined(_DLL)
180 # pragma message (__FILE__ ": building with Multithreaded non DLL runtime has a performance impact on wxString!")
181 void wxStringData::Free()
187 // ===========================================================================
189 // ===========================================================================
191 // takes nLength elements of psz starting at nPos
192 void wxStringBase::InitWith(const wxChar
*psz
, size_t nPos
, size_t nLength
)
196 // if the length is not given, assume the string to be NUL terminated
197 if ( nLength
== npos
) {
198 wxASSERT_MSG( nPos
<= wxStrlen(psz
), _T("index out of bounds") );
200 nLength
= wxStrlen(psz
+ nPos
);
203 STATISTICS_ADD(InitialLength
, nLength
);
206 // trailing '\0' is written in AllocBuffer()
207 if ( !AllocBuffer(nLength
) ) {
208 wxFAIL_MSG( _T("out of memory in wxStringBase::InitWith") );
211 wxMemcpy(m_pchData
, psz
+ nPos
, nLength
);
215 // poor man's iterators are "void *" pointers
216 wxStringBase::wxStringBase(const void *pStart
, const void *pEnd
)
218 InitWith((const wxChar
*)pStart
, 0,
219 (const wxChar
*)pEnd
- (const wxChar
*)pStart
);
222 wxStringBase::wxStringBase(size_type n
, wxChar ch
)
228 // ---------------------------------------------------------------------------
230 // ---------------------------------------------------------------------------
232 // allocates memory needed to store a C string of length nLen
233 bool wxStringBase::AllocBuffer(size_t nLen
)
235 // allocating 0 sized buffer doesn't make sense, all empty strings should
237 wxASSERT( nLen
> 0 );
239 // make sure that we don't overflow
240 wxASSERT( nLen
< (INT_MAX
/ sizeof(wxChar
)) -
241 (sizeof(wxStringData
) + EXTRA_ALLOC
+ 1) );
243 STATISTICS_ADD(Length
, nLen
);
246 // 1) one extra character for '\0' termination
247 // 2) sizeof(wxStringData) for housekeeping info
248 wxStringData
* pData
= (wxStringData
*)
249 malloc(sizeof(wxStringData
) + (nLen
+ EXTRA_ALLOC
+ 1)*sizeof(wxChar
));
251 if ( pData
== NULL
) {
252 // allocation failures are handled by the caller
257 pData
->nDataLength
= nLen
;
258 pData
->nAllocLength
= nLen
+ EXTRA_ALLOC
;
259 m_pchData
= pData
->data(); // data starts after wxStringData
260 m_pchData
[nLen
] = wxT('\0');
264 // must be called before changing this string
265 bool wxStringBase::CopyBeforeWrite()
267 wxStringData
* pData
= GetStringData();
269 if ( pData
->IsShared() ) {
270 pData
->Unlock(); // memory not freed because shared
271 size_t nLen
= pData
->nDataLength
;
272 if ( !AllocBuffer(nLen
) ) {
273 // allocation failures are handled by the caller
276 memcpy(m_pchData
, pData
->data(), nLen
*sizeof(wxChar
));
279 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
284 // must be called before replacing contents of this string
285 bool wxStringBase::AllocBeforeWrite(size_t nLen
)
287 wxASSERT( nLen
!= 0 ); // doesn't make any sense
289 // must not share string and must have enough space
290 wxStringData
* pData
= GetStringData();
291 if ( pData
->IsShared() || pData
->IsEmpty() ) {
292 // can't work with old buffer, get new one
294 if ( !AllocBuffer(nLen
) ) {
295 // allocation failures are handled by the caller
300 if ( nLen
> pData
->nAllocLength
) {
301 // realloc the buffer instead of calling malloc() again, this is more
303 STATISTICS_ADD(Length
, nLen
);
307 pData
= (wxStringData
*)
308 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
310 if ( pData
== NULL
) {
311 // allocation failures are handled by the caller
312 // keep previous data since reallocation failed
316 pData
->nAllocLength
= nLen
;
317 m_pchData
= pData
->data();
320 // now we have enough space, just update the string length
321 pData
->nDataLength
= nLen
;
324 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
329 wxStringBase
& wxStringBase::append(size_t n
, wxChar ch
)
331 size_type len
= length();
333 if ( !CopyBeforeWrite() || !Alloc(len
+ n
) ) {
334 wxFAIL_MSG( _T("out of memory in wxStringBase::append") );
336 GetStringData()->nDataLength
= len
+ n
;
337 m_pchData
[len
+ n
] = '\0';
338 for ( size_t i
= 0; i
< n
; ++i
)
339 m_pchData
[len
+ i
] = ch
;
343 void wxStringBase::resize(size_t nSize
, wxChar ch
)
345 size_t len
= length();
349 erase(begin() + nSize
, end());
351 else if ( nSize
> len
)
353 append(nSize
- len
, ch
);
355 //else: we have exactly the specified length, nothing to do
358 // allocate enough memory for nLen characters
359 bool wxStringBase::Alloc(size_t nLen
)
361 wxStringData
*pData
= GetStringData();
362 if ( pData
->nAllocLength
<= nLen
) {
363 if ( pData
->IsEmpty() ) {
366 wxStringData
* pData
= (wxStringData
*)
367 malloc(sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
369 if ( pData
== NULL
) {
370 // allocation failure handled by caller
375 pData
->nDataLength
= 0;
376 pData
->nAllocLength
= nLen
;
377 m_pchData
= pData
->data(); // data starts after wxStringData
378 m_pchData
[0u] = wxT('\0');
380 else if ( pData
->IsShared() ) {
381 pData
->Unlock(); // memory not freed because shared
382 size_t nOldLen
= pData
->nDataLength
;
383 if ( !AllocBuffer(nLen
) ) {
384 // allocation failure handled by caller
387 memcpy(m_pchData
, pData
->data(), nOldLen
*sizeof(wxChar
));
392 pData
= (wxStringData
*)
393 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
395 if ( pData
== NULL
) {
396 // allocation failure handled by caller
397 // keep previous data since reallocation failed
401 // it's not important if the pointer changed or not (the check for this
402 // is not faster than assigning to m_pchData in all cases)
403 pData
->nAllocLength
= nLen
;
404 m_pchData
= pData
->data();
407 //else: we've already got enough
411 wxStringBase::iterator
wxStringBase::begin()
418 wxStringBase::iterator
wxStringBase::end()
422 return m_pchData
+ length();
425 wxStringBase::iterator
wxStringBase::erase(iterator it
)
427 size_type idx
= it
- begin();
429 return begin() + idx
;
432 wxStringBase
& wxStringBase::erase(size_t nStart
, size_t nLen
)
434 wxASSERT(nStart
<= length());
435 size_t strLen
= length() - nStart
;
436 // delete nLen or up to the end of the string characters
437 nLen
= strLen
< nLen
? strLen
: nLen
;
438 wxString
strTmp(c_str(), nStart
);
439 strTmp
.append(c_str() + nStart
+ nLen
, length() - nStart
- nLen
);
445 wxStringBase
& wxStringBase::insert(size_t nPos
, const wxChar
*sz
, size_t n
)
447 wxASSERT( nPos
<= length() );
449 if ( n
== npos
) n
= wxStrlen(sz
);
450 if ( n
== 0 ) return *this;
452 if ( !CopyBeforeWrite() || !Alloc(length() + n
) ) {
453 wxFAIL_MSG( _T("out of memory in wxStringBase::insert") );
456 memmove(m_pchData
+ nPos
+ n
, m_pchData
+ nPos
,
457 (length() - nPos
) * sizeof(wxChar
));
458 memcpy(m_pchData
+ nPos
, sz
, n
* sizeof(wxChar
));
459 GetStringData()->nDataLength
= length() + n
;
460 m_pchData
[length()] = '\0';
465 void wxStringBase::swap(wxStringBase
& str
)
467 wxChar
* tmp
= str
.m_pchData
;
468 str
.m_pchData
= m_pchData
;
472 size_t wxStringBase::find(const wxStringBase
& str
, size_t nStart
) const
474 wxASSERT( str
.GetStringData()->IsValid() );
475 wxASSERT( nStart
<= length() );
478 const wxChar
* p
= (const wxChar
*)wxMemchr(c_str() + nStart
,
485 while(p
- c_str() + str
.length() <= length() &&
486 wxMemcmp(p
, str
.c_str(), str
.length()) )
489 p
= (const wxChar
*)wxMemchr(++p
,
491 length() - (p
- c_str()));
497 return (p
- c_str() + str
.length() <= length()) ? p
- c_str() : npos
;
500 size_t wxStringBase::find(const wxChar
* sz
, size_t nStart
, size_t n
) const
502 return find(wxStringBase(sz
, n
), nStart
);
505 size_t wxStringBase::find(wxChar ch
, size_t nStart
) const
507 wxASSERT( nStart
<= length() );
509 const wxChar
*p
= (const wxChar
*)wxMemchr(c_str() + nStart
, ch
, length() - nStart
);
511 return p
== NULL
? npos
: p
- c_str();
514 size_t wxStringBase::rfind(const wxStringBase
& str
, size_t nStart
) const
516 wxASSERT( str
.GetStringData()->IsValid() );
517 wxASSERT( nStart
== npos
|| nStart
<= length() );
519 if ( length() >= str
.length() )
521 // avoids a corner case later
522 if ( length() == 0 && str
.length() == 0 )
525 // "top" is the point where search starts from
526 size_t top
= length() - str
.length();
528 if ( nStart
== npos
)
529 nStart
= length() - 1;
533 const wxChar
*cursor
= c_str() + top
;
536 if ( wxMemcmp(cursor
, str
.c_str(),
539 return cursor
- c_str();
541 } while ( cursor
-- > c_str() );
547 size_t wxStringBase::rfind(const wxChar
* sz
, size_t nStart
, size_t n
) const
549 return rfind(wxStringBase(sz
, n
), nStart
);
552 size_t wxStringBase::rfind(wxChar ch
, size_t nStart
) const
554 if ( nStart
== npos
)
560 wxASSERT( nStart
<= length() );
563 const wxChar
*actual
;
564 for ( actual
= c_str() + ( nStart
== npos
? length() : nStart
+ 1 );
565 actual
> c_str(); --actual
)
567 if ( *(actual
- 1) == ch
)
568 return (actual
- 1) - c_str();
574 size_t wxStringBase::find_first_of(const wxChar
* sz
, size_t nStart
) const
576 wxASSERT(nStart
<= length());
578 size_t len
= wxStrlen(sz
);
581 for(i
= nStart
; i
< this->length(); ++i
)
583 if (wxMemchr(sz
, *(c_str() + i
), len
))
587 if(i
== this->length())
593 size_t wxStringBase::find_first_of(const wxChar
* sz
, size_t nStart
,
596 return find_first_of(wxStringBase(sz
, n
), nStart
);
599 size_t wxStringBase::find_last_of(const wxChar
* sz
, size_t nStart
) const
601 if ( nStart
== npos
)
603 nStart
= length() - 1;
607 wxASSERT_MSG( nStart
<= length(),
608 _T("invalid index in find_last_of()") );
611 size_t len
= wxStrlen(sz
);
613 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
615 if ( wxMemchr(sz
, *p
, len
) )
622 size_t wxStringBase::find_last_of(const wxChar
* sz
, size_t nStart
,
625 return find_last_of(wxStringBase(sz
, n
), nStart
);
628 size_t wxStringBase::find_first_not_of(const wxChar
* sz
, size_t nStart
) const
630 if ( nStart
== npos
)
636 wxASSERT( nStart
<= length() );
639 size_t len
= wxStrlen(sz
);
642 for(i
= nStart
; i
< this->length(); ++i
)
644 if (!wxMemchr(sz
, *(c_str() + i
), len
))
648 if(i
== this->length())
654 size_t wxStringBase::find_first_not_of(const wxChar
* sz
, size_t nStart
,
657 return find_first_not_of(wxStringBase(sz
, n
), nStart
);
660 size_t wxStringBase::find_first_not_of(wxChar ch
, size_t nStart
) const
662 wxASSERT( nStart
<= length() );
664 for ( const wxChar
*p
= c_str() + nStart
; *p
; p
++ )
673 size_t wxStringBase::find_last_not_of(const wxChar
* sz
, size_t nStart
) const
675 if ( nStart
== npos
)
677 nStart
= length() - 1;
681 wxASSERT( nStart
<= length() );
684 size_t len
= wxStrlen(sz
);
686 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
688 if ( !wxMemchr(sz
, *p
,len
) )
695 size_t wxStringBase::find_last_not_of(const wxChar
* sz
, size_t nStart
,
698 return find_last_not_of(wxStringBase(sz
, n
), nStart
);
701 size_t wxStringBase::find_last_not_of(wxChar ch
, size_t nStart
) const
703 if ( nStart
== npos
)
705 nStart
= length() - 1;
709 wxASSERT( nStart
<= length() );
712 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
721 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
724 wxASSERT_MSG( nStart
<= length(),
725 _T("index out of bounds in wxStringBase::replace") );
726 size_t strLen
= length() - nStart
;
727 nLen
= strLen
< nLen
? strLen
: nLen
;
730 strTmp
.reserve(length()); // micro optimisation to avoid multiple mem allocs
733 strTmp
.append(c_str(), nStart
);
735 strTmp
.append(c_str() + nStart
+ nLen
);
741 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
742 size_t nCount
, wxChar ch
)
744 return replace(nStart
, nLen
, wxStringBase(ch
, nCount
).c_str());
747 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
748 const wxStringBase
& str
,
749 size_t nStart2
, size_t nLen2
)
751 return replace(nStart
, nLen
, str
.substr(nStart2
, nLen2
));
754 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
755 const wxChar
* sz
, size_t nCount
)
757 return replace(nStart
, nLen
, wxStringBase(sz
, nCount
).c_str());
760 wxStringBase
wxStringBase::substr(size_t nStart
, size_t nLen
) const
763 nLen
= length() - nStart
;
764 return wxStringBase(*this, nStart
, nLen
);
767 // assigns one string to another
768 wxStringBase
& wxStringBase::operator=(const wxStringBase
& stringSrc
)
770 wxASSERT( stringSrc
.GetStringData()->IsValid() );
772 // don't copy string over itself
773 if ( m_pchData
!= stringSrc
.m_pchData
) {
774 if ( stringSrc
.GetStringData()->IsEmpty() ) {
779 GetStringData()->Unlock();
780 m_pchData
= stringSrc
.m_pchData
;
781 GetStringData()->Lock();
788 // assigns a single character
789 wxStringBase
& wxStringBase::operator=(wxChar ch
)
791 if ( !AssignCopy(1, &ch
) ) {
792 wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(wxChar)") );
798 wxStringBase
& wxStringBase::operator=(const wxChar
*psz
)
800 if ( !AssignCopy(wxStrlen(psz
), psz
) ) {
801 wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(const wxChar *)") );
806 // helper function: does real copy
807 bool wxStringBase::AssignCopy(size_t nSrcLen
, const wxChar
*pszSrcData
)
809 if ( nSrcLen
== 0 ) {
813 if ( !AllocBeforeWrite(nSrcLen
) ) {
814 // allocation failure handled by caller
817 memcpy(m_pchData
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
818 GetStringData()->nDataLength
= nSrcLen
;
819 m_pchData
[nSrcLen
] = wxT('\0');
824 // ---------------------------------------------------------------------------
825 // string concatenation
826 // ---------------------------------------------------------------------------
828 // add something to this string
829 bool wxStringBase::ConcatSelf(size_t nSrcLen
, const wxChar
*pszSrcData
,
832 STATISTICS_ADD(SummandLength
, nSrcLen
);
834 nSrcLen
= nSrcLen
< nMaxLen
? nSrcLen
: nMaxLen
;
836 // concatenating an empty string is a NOP
838 wxStringData
*pData
= GetStringData();
839 size_t nLen
= pData
->nDataLength
;
840 size_t nNewLen
= nLen
+ nSrcLen
;
842 // alloc new buffer if current is too small
843 if ( pData
->IsShared() ) {
844 STATISTICS_ADD(ConcatHit
, 0);
846 // we have to allocate another buffer
847 wxStringData
* pOldData
= GetStringData();
848 if ( !AllocBuffer(nNewLen
) ) {
849 // allocation failure handled by caller
852 memcpy(m_pchData
, pOldData
->data(), nLen
*sizeof(wxChar
));
855 else if ( nNewLen
> pData
->nAllocLength
) {
856 STATISTICS_ADD(ConcatHit
, 0);
859 // we have to grow the buffer
860 if ( capacity() < nNewLen
) {
861 // allocation failure handled by caller
866 STATISTICS_ADD(ConcatHit
, 1);
868 // the buffer is already big enough
871 // should be enough space
872 wxASSERT( nNewLen
<= GetStringData()->nAllocLength
);
874 // fast concatenation - all is done in our buffer
875 memcpy(m_pchData
+ nLen
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
877 m_pchData
[nNewLen
] = wxT('\0'); // put terminating '\0'
878 GetStringData()->nDataLength
= nNewLen
; // and fix the length
880 //else: the string to append was empty
884 // ---------------------------------------------------------------------------
885 // simple sub-string extraction
886 // ---------------------------------------------------------------------------
888 // helper function: clone the data attached to this string
889 bool wxStringBase::AllocCopy(wxString
& dest
, int nCopyLen
, int nCopyIndex
) const
891 if ( nCopyLen
== 0 ) {
895 if ( !dest
.AllocBuffer(nCopyLen
) ) {
896 // allocation failure handled by caller
899 memcpy(dest
.m_pchData
, m_pchData
+ nCopyIndex
, nCopyLen
*sizeof(wxChar
));
906 #if !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
909 #define STRINGCLASS wxStringBase
911 #define STRINGCLASS wxString
914 static inline int wxDoCmp(const wxChar
* s1
, size_t l1
,
915 const wxChar
* s2
, size_t l2
)
918 return wxMemcmp(s1
, s2
, l1
);
921 int ret
= wxMemcmp(s1
, s2
, l1
);
922 return ret
== 0 ? -1 : ret
;
926 int ret
= wxMemcmp(s1
, s2
, l2
);
927 return ret
== 0 ? +1 : ret
;
930 wxFAIL
; // must never get there
931 return 0; // quiet compilers
934 int STRINGCLASS::compare(const wxStringBase
& str
) const
936 return ::wxDoCmp(data(), length(), str
.data(), str
.length());
939 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
940 const wxStringBase
& str
) const
942 wxASSERT(nStart
<= length());
943 size_type strLen
= length() - nStart
;
944 nLen
= strLen
< nLen
? strLen
: nLen
;
945 return ::wxDoCmp(data() + nStart
, nLen
, str
.data(), str
.length());
948 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
949 const wxStringBase
& str
,
950 size_t nStart2
, size_t nLen2
) const
952 wxASSERT(nStart
<= length());
953 wxASSERT(nStart2
<= str
.length());
954 size_type strLen
= length() - nStart
,
955 strLen2
= str
.length() - nStart2
;
956 nLen
= strLen
< nLen
? strLen
: nLen
;
957 nLen2
= strLen2
< nLen2
? strLen2
: nLen2
;
958 return ::wxDoCmp(data() + nStart
, nLen
, str
.data() + nStart2
, nLen2
);
961 int STRINGCLASS::compare(const wxChar
* sz
) const
963 size_t nLen
= wxStrlen(sz
);
964 return ::wxDoCmp(data(), length(), sz
, nLen
);
967 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
968 const wxChar
* sz
, size_t nCount
) const
970 wxASSERT(nStart
<= length());
971 size_type strLen
= length() - nStart
;
972 nLen
= strLen
< nLen
? strLen
: nLen
;
974 nCount
= wxStrlen(sz
);
976 return ::wxDoCmp(data() + nStart
, nLen
, sz
, nCount
);
981 #endif // !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
983 // ===========================================================================
984 // wxString class core
985 // ===========================================================================
987 // ---------------------------------------------------------------------------
988 // common conversion routines
989 // ---------------------------------------------------------------------------
993 //Convert a wide character string of a specified length
994 //to a multi-byte character string, ignoring intermittent null characters
995 inline wxCharBuffer
wxMbstr(const wchar_t* szString
, size_t nStringLen
, wxMBConv
& conv
)
997 const wchar_t* szEnd
= szString
+ nStringLen
+ 1;
998 const wchar_t* szPos
= szString
;
999 const wchar_t* szStart
= szPos
;
1001 //Create the buffer we'll return on success
1002 wxCharBuffer
buffer(nStringLen
+ 1);
1004 //Convert the string until the length() is reached, continuing the
1005 //loop every time a null character is reached
1006 while(szPos
!= szEnd
)
1008 wxASSERT(szPos
< szEnd
); //something is _really_ screwed up if this rings true
1010 //Get the length of the current (sub)string
1011 size_t nLen
= conv
.WC2MB(NULL
, szPos
, 0);
1013 wxASSERT(nLen
!= (size_t)-1); //should not be true! If it is system wctomb could be bad
1015 //Convert the current (sub)string
1016 if ( conv
.WC2MB(&buffer
.data()[szPos
- szStart
], szPos
, nLen
+ 1) == (size_t)-1 )
1018 //error - return empty buffer
1019 wxFAIL_MSG(wxT("Error converting wide-character string to a multi-byte string"));
1020 buffer
.data()[0] = '\0';
1024 //Increment to next (sub)string
1025 //Note that we have to use wxWcslen here instead of nLen
1026 //here because XX2XX gives us the size of the output buffer,
1027 //not neccessarly the length of the string
1028 szPos
+= wxWcslen(szPos
) + 1;
1031 return buffer
; //success - return converted string
1034 //Convert a multi-byte character string of a specified length
1035 //to a wide character string, ignoring intermittent null characters
1036 inline wxWCharBuffer
wxWcstr(const char* szString
, size_t nStringLen
, wxMBConv
& conv
)
1038 const char* szEnd
= szString
+ nStringLen
+ 1;
1039 const char* szPos
= szString
;
1040 const char* szStart
= szPos
;
1042 wxWCharBuffer
buffer(nStringLen
+ 1);
1044 //Convert the string until the length() is reached, continuing the
1045 //loop every time a null character is reached
1046 while(szPos
!= szEnd
)
1048 wxASSERT(szPos
< szEnd
); //something is _really_ screwed up if this rings true
1050 //Get the length of the current (sub)string
1051 size_t nLen
= conv
.MB2WC(NULL
, szPos
, 0);
1053 wxASSERT(nLen
!= (size_t)-1); //should not be true! If it is system mbtowc could be bad
1055 //Convert the current (sub)string
1056 if ( conv
.MB2WC(&buffer
.data()[szPos
- szStart
], szPos
, nLen
+ 1) == (size_t)-1 )
1058 //error - return empty buffer
1059 wxFAIL_MSG(wxT("Error converting multi-byte string to a wide-character string"));
1060 buffer
.data()[0] = '\0';
1064 //Increment to next (sub)string
1065 //Note that we have to use strlen here instead of nLen
1066 //here because XX2XX gives us the size of the output buffer,
1067 //not neccessarly the length of the string
1068 szPos
+= strlen(szPos
) + 1;
1071 return buffer
; //success - return converted string
1074 #endif //wxUSE_WCHAR_T
1076 // ---------------------------------------------------------------------------
1077 // construction and conversion
1078 // ---------------------------------------------------------------------------
1082 // from multibyte string
1083 wxString::wxString(const char *psz
, wxMBConv
& conv
, size_t nLength
)
1085 // if nLength != npos, then we have to make a NULL-terminated copy
1086 // of first nLength bytes of psz first because the input buffer to MB2WC
1087 // must always be NULL-terminated:
1088 wxCharBuffer
inBuf((const char *)NULL
);
1089 if (nLength
!= npos
)
1091 wxASSERT( psz
!= NULL
);
1092 wxCharBuffer
tmp(nLength
);
1093 memcpy(tmp
.data(), psz
, nLength
);
1094 tmp
.data()[nLength
] = '\0';
1099 // first get the size of the buffer we need
1103 // calculate the needed size ourselves or use the provided one
1104 if (nLength
== npos
)
1111 // nothing to convert
1116 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
1118 //do the actual conversion (if it fails we get an empty string)
1119 (*this) = wxWcstr(psz
, nLen
, conv
);
1123 //Convert wxString in Unicode mode to a multi-byte string
1124 const wxCharBuffer
wxString::mb_str(wxMBConv
& conv
) const
1126 return wxMbstr((*this).c_str(), length(), conv
);
1133 wxString::wxString(const wchar_t *pwz
, wxMBConv
& conv
, size_t nLength
)
1135 // if nLength != npos, then we have to make a NULL-terminated copy
1136 // of first nLength chars of psz first because the input buffer to WC2MB
1137 // must always be NULL-terminated:
1138 wxWCharBuffer
inBuf((const wchar_t *)NULL
);
1139 if (nLength
!= npos
)
1141 wxASSERT( pwz
!= NULL
);
1142 wxWCharBuffer
tmp(nLength
);
1143 memcpy(tmp
.data(), pwz
, nLength
* sizeof(wchar_t));
1144 tmp
.data()[nLength
] = '\0';
1149 // first get the size of the buffer we need
1153 // calculate the needed size ourselves or use the provided one
1154 if (nLength
== npos
)
1155 nLen
= wxWcslen(pwz
);
1161 // nothing to convert
1166 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
1168 //do the actual conversion (if it fails we get an empty string)
1169 (*this) = wxMbstr(pwz
, nLen
, conv
);
1173 //Converts this string to a wide character string if unicode
1174 //mode is not enabled and wxUSE_WCHAR_T is enabled
1175 const wxWCharBuffer
wxString::wc_str(wxMBConv
& conv
) const
1177 //Do the actual conversion (will return a blank string on error)
1178 return wxWcstr((*this).c_str(), length(), conv
);
1181 #endif // wxUSE_WCHAR_T
1183 #endif // Unicode/ANSI
1185 // shrink to minimal size (releasing extra memory)
1186 bool wxString::Shrink()
1188 wxString
tmp(begin(), end());
1190 return tmp
.length() == length();
1194 // get the pointer to writable buffer of (at least) nLen bytes
1195 wxChar
*wxString::GetWriteBuf(size_t nLen
)
1197 if ( !AllocBeforeWrite(nLen
) ) {
1198 // allocation failure handled by caller
1202 wxASSERT( GetStringData()->nRefs
== 1 );
1203 GetStringData()->Validate(false);
1208 // put string back in a reasonable state after GetWriteBuf
1209 void wxString::UngetWriteBuf()
1211 GetStringData()->nDataLength
= wxStrlen(m_pchData
);
1212 GetStringData()->Validate(true);
1215 void wxString::UngetWriteBuf(size_t nLen
)
1217 GetStringData()->nDataLength
= nLen
;
1218 GetStringData()->Validate(true);
1222 // ---------------------------------------------------------------------------
1224 // ---------------------------------------------------------------------------
1226 // all functions are inline in string.h
1228 // ---------------------------------------------------------------------------
1229 // assignment operators
1230 // ---------------------------------------------------------------------------
1234 // same as 'signed char' variant
1235 wxString
& wxString::operator=(const unsigned char* psz
)
1237 *this = (const char *)psz
;
1242 wxString
& wxString::operator=(const wchar_t *pwz
)
1253 * concatenation functions come in 5 flavours:
1255 * char + string and string + char
1256 * C str + string and string + C str
1259 wxString
operator+(const wxString
& str1
, const wxString
& str2
)
1262 wxASSERT( str1
.GetStringData()->IsValid() );
1263 wxASSERT( str2
.GetStringData()->IsValid() );
1272 wxString
operator+(const wxString
& str
, wxChar ch
)
1275 wxASSERT( str
.GetStringData()->IsValid() );
1284 wxString
operator+(wxChar ch
, const wxString
& str
)
1287 wxASSERT( str
.GetStringData()->IsValid() );
1296 wxString
operator+(const wxString
& str
, const wxChar
*psz
)
1299 wxASSERT( str
.GetStringData()->IsValid() );
1303 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1304 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1312 wxString
operator+(const wxChar
*psz
, const wxString
& str
)
1315 wxASSERT( str
.GetStringData()->IsValid() );
1319 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1320 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1328 // ===========================================================================
1329 // other common string functions
1330 // ===========================================================================
1332 int wxString::Cmp(const wxString
& s
) const
1337 int wxString::Cmp(const wxChar
* psz
) const
1339 return compare(psz
);
1342 static inline int wxDoCmpNoCase(const wxChar
* s1
, size_t l1
,
1343 const wxChar
* s2
, size_t l2
)
1349 for(i
= 0; i
< l1
; ++i
)
1351 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1354 return i
== l1
? 0 : s1
[i
] < s2
[i
] ? -1 : 1;
1358 for(i
= 0; i
< l1
; ++i
)
1360 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1363 return i
== l1
? -1 : s1
[i
] < s2
[i
] ? -1 : 1;
1367 for(i
= 0; i
< l2
; ++i
)
1369 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1372 return i
== l2
? 1 : s1
[i
] < s2
[i
] ? -1 : 1;
1375 wxFAIL
; // must never get there
1376 return 0; // quiet compilers
1379 int wxString::CmpNoCase(const wxString
& s
) const
1381 return wxDoCmpNoCase(data(), length(), s
.data(), s
.length());
1384 int wxString::CmpNoCase(const wxChar
* psz
) const
1386 int nLen
= wxStrlen(psz
);
1388 return wxDoCmpNoCase(data(), length(), psz
, nLen
);
1395 #ifndef __SCHAR_MAX__
1396 #define __SCHAR_MAX__ 127
1400 wxString
wxString::FromAscii(const char *ascii
)
1403 return wxEmptyString
;
1405 size_t len
= strlen( ascii
);
1410 wxStringBuffer
buf(res
, len
);
1412 wchar_t *dest
= buf
;
1416 if ( (*dest
++ = (wchar_t)(unsigned char)*ascii
++) == L
'\0' )
1424 wxString
wxString::FromAscii(const char ascii
)
1426 // What do we do with '\0' ?
1429 res
+= (wchar_t)(unsigned char) ascii
;
1434 const wxCharBuffer
wxString::ToAscii() const
1436 // this will allocate enough space for the terminating NUL too
1437 wxCharBuffer
buffer(length());
1439 signed char *dest
= (signed char *)buffer
.data();
1441 const wchar_t *pwc
= c_str();
1444 *dest
++ = *pwc
> SCHAR_MAX
? '_' : *pwc
;
1446 // the output string can't have embedded NULs anyhow, so we can safely
1447 // stop at first of them even if we do have any
1457 // extract string of length nCount starting at nFirst
1458 wxString
wxString::Mid(size_t nFirst
, size_t nCount
) const
1460 size_t nLen
= length();
1462 // default value of nCount is npos and means "till the end"
1463 if ( nCount
== npos
)
1465 nCount
= nLen
- nFirst
;
1468 // out-of-bounds requests return sensible things
1469 if ( nFirst
+ nCount
> nLen
)
1471 nCount
= nLen
- nFirst
;
1474 if ( nFirst
> nLen
)
1476 // AllocCopy() will return empty string
1480 wxString
dest(*this, nFirst
, nCount
);
1481 if ( dest
.length() != nCount
) {
1482 wxFAIL_MSG( _T("out of memory in wxString::Mid") );
1488 // check that the string starts with prefix and return the rest of the string
1489 // in the provided pointer if it is not NULL, otherwise return false
1490 bool wxString::StartsWith(const wxChar
*prefix
, wxString
*rest
) const
1492 wxASSERT_MSG( prefix
, _T("invalid parameter in wxString::StartsWith") );
1494 // first check if the beginning of the string matches the prefix: note
1495 // that we don't have to check that we don't run out of this string as
1496 // when we reach the terminating NUL, either prefix string ends too (and
1497 // then it's ok) or we break out of the loop because there is no match
1498 const wxChar
*p
= c_str();
1501 if ( *prefix
++ != *p
++ )
1510 // put the rest of the string into provided pointer
1517 // extract nCount last (rightmost) characters
1518 wxString
wxString::Right(size_t nCount
) const
1520 if ( nCount
> length() )
1523 wxString
dest(*this, length() - nCount
, nCount
);
1524 if ( dest
.length() != nCount
) {
1525 wxFAIL_MSG( _T("out of memory in wxString::Right") );
1530 // get all characters after the last occurence of ch
1531 // (returns the whole string if ch not found)
1532 wxString
wxString::AfterLast(wxChar ch
) const
1535 int iPos
= Find(ch
, true);
1536 if ( iPos
== wxNOT_FOUND
)
1539 str
= c_str() + iPos
+ 1;
1544 // extract nCount first (leftmost) characters
1545 wxString
wxString::Left(size_t nCount
) const
1547 if ( nCount
> length() )
1550 wxString
dest(*this, 0, nCount
);
1551 if ( dest
.length() != nCount
) {
1552 wxFAIL_MSG( _T("out of memory in wxString::Left") );
1557 // get all characters before the first occurence of ch
1558 // (returns the whole string if ch not found)
1559 wxString
wxString::BeforeFirst(wxChar ch
) const
1561 int iPos
= Find(ch
);
1562 if ( iPos
== wxNOT_FOUND
) iPos
= length();
1563 return wxString(*this, 0, iPos
);
1566 /// get all characters before the last occurence of ch
1567 /// (returns empty string if ch not found)
1568 wxString
wxString::BeforeLast(wxChar ch
) const
1571 int iPos
= Find(ch
, true);
1572 if ( iPos
!= wxNOT_FOUND
&& iPos
!= 0 )
1573 str
= wxString(c_str(), iPos
);
1578 /// get all characters after the first occurence of ch
1579 /// (returns empty string if ch not found)
1580 wxString
wxString::AfterFirst(wxChar ch
) const
1583 int iPos
= Find(ch
);
1584 if ( iPos
!= wxNOT_FOUND
)
1585 str
= c_str() + iPos
+ 1;
1590 // replace first (or all) occurences of some substring with another one
1592 wxString::Replace(const wxChar
*szOld
, const wxChar
*szNew
, bool bReplaceAll
)
1594 // if we tried to replace an empty string we'd enter an infinite loop below
1595 wxCHECK_MSG( szOld
&& *szOld
&& szNew
, 0,
1596 _T("wxString::Replace(): invalid parameter") );
1598 size_t uiCount
= 0; // count of replacements made
1600 size_t uiOldLen
= wxStrlen(szOld
);
1603 const wxChar
*pCurrent
= c_str();
1604 const wxChar
*pSubstr
;
1605 while ( *pCurrent
!= wxT('\0') ) {
1606 pSubstr
= wxStrstr(pCurrent
, szOld
);
1607 if ( pSubstr
== NULL
) {
1608 // strTemp is unused if no replacements were made, so avoid the copy
1612 strTemp
+= pCurrent
; // copy the rest
1613 break; // exit the loop
1616 // take chars before match
1617 size_type len
= strTemp
.length();
1618 strTemp
.append(pCurrent
, pSubstr
- pCurrent
);
1619 if ( strTemp
.length() != (size_t)(len
+ pSubstr
- pCurrent
) ) {
1620 wxFAIL_MSG( _T("out of memory in wxString::Replace") );
1624 pCurrent
= pSubstr
+ uiOldLen
; // restart after match
1629 if ( !bReplaceAll
) {
1630 strTemp
+= pCurrent
; // copy the rest
1631 break; // exit the loop
1636 // only done if there were replacements, otherwise would have returned above
1642 bool wxString::IsAscii() const
1644 const wxChar
*s
= (const wxChar
*) *this;
1646 if(!isascii(*s
)) return(false);
1652 bool wxString::IsWord() const
1654 const wxChar
*s
= (const wxChar
*) *this;
1656 if(!wxIsalpha(*s
)) return(false);
1662 bool wxString::IsNumber() const
1664 const wxChar
*s
= (const wxChar
*) *this;
1666 if ((s
[0] == '-') || (s
[0] == '+')) s
++;
1668 if(!wxIsdigit(*s
)) return(false);
1674 wxString
wxString::Strip(stripType w
) const
1677 if ( w
& leading
) s
.Trim(false);
1678 if ( w
& trailing
) s
.Trim(true);
1682 // ---------------------------------------------------------------------------
1684 // ---------------------------------------------------------------------------
1686 wxString
& wxString::MakeUpper()
1688 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1689 *it
= (wxChar
)wxToupper(*it
);
1694 wxString
& wxString::MakeLower()
1696 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1697 *it
= (wxChar
)wxTolower(*it
);
1702 // ---------------------------------------------------------------------------
1703 // trimming and padding
1704 // ---------------------------------------------------------------------------
1706 // some compilers (VC++ 6.0 not to name them) return true for a call to
1707 // isspace('ê') in the C locale which seems to be broken to me, but we have to
1708 // live with this by checking that the character is a 7 bit one - even if this
1709 // may fail to detect some spaces (I don't know if Unicode doesn't have
1710 // space-like symbols somewhere except in the first 128 chars), it is arguably
1711 // still better than trimming away accented letters
1712 inline int wxSafeIsspace(wxChar ch
) { return (ch
< 127) && wxIsspace(ch
); }
1714 // trims spaces (in the sense of isspace) from left or right side
1715 wxString
& wxString::Trim(bool bFromRight
)
1717 // first check if we're going to modify the string at all
1720 (bFromRight
&& wxSafeIsspace(GetChar(Len() - 1))) ||
1721 (!bFromRight
&& wxSafeIsspace(GetChar(0u)))
1727 // find last non-space character
1728 iterator psz
= begin() + length() - 1;
1729 while ( wxSafeIsspace(*psz
) && (psz
>= begin()) )
1732 // truncate at trailing space start
1738 // find first non-space character
1739 iterator psz
= begin();
1740 while ( wxSafeIsspace(*psz
) )
1743 // fix up data and length
1744 erase(begin(), psz
);
1751 // adds nCount characters chPad to the string from either side
1752 wxString
& wxString::Pad(size_t nCount
, wxChar chPad
, bool bFromRight
)
1754 wxString
s(chPad
, nCount
);
1767 // truncate the string
1768 wxString
& wxString::Truncate(size_t uiLen
)
1770 if ( uiLen
< Len() ) {
1771 erase(begin() + uiLen
, end());
1773 //else: nothing to do, string is already short enough
1778 // ---------------------------------------------------------------------------
1779 // finding (return wxNOT_FOUND if not found and index otherwise)
1780 // ---------------------------------------------------------------------------
1783 int wxString::Find(wxChar ch
, bool bFromEnd
) const
1785 size_type idx
= bFromEnd
? find_last_of(ch
) : find_first_of(ch
);
1787 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1790 // find a sub-string (like strstr)
1791 int wxString::Find(const wxChar
*pszSub
) const
1793 size_type idx
= find(pszSub
);
1795 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1798 // ----------------------------------------------------------------------------
1799 // conversion to numbers
1800 // ----------------------------------------------------------------------------
1802 bool wxString::ToLong(long *val
, int base
) const
1804 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToLong") );
1805 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1807 const wxChar
*start
= c_str();
1809 *val
= wxStrtol(start
, &end
, base
);
1811 // return true only if scan was stopped by the terminating NUL and if the
1812 // string was not empty to start with
1813 return !*end
&& (end
!= start
);
1816 bool wxString::ToULong(unsigned long *val
, int base
) const
1818 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToULong") );
1819 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1821 const wxChar
*start
= c_str();
1823 *val
= wxStrtoul(start
, &end
, base
);
1825 // return true only if scan was stopped by the terminating NUL and if the
1826 // string was not empty to start with
1827 return !*end
&& (end
!= start
);
1830 bool wxString::ToDouble(double *val
) const
1832 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToDouble") );
1834 const wxChar
*start
= c_str();
1836 *val
= wxStrtod(start
, &end
);
1838 // return true only if scan was stopped by the terminating NUL and if the
1839 // string was not empty to start with
1840 return !*end
&& (end
!= start
);
1843 // ---------------------------------------------------------------------------
1845 // ---------------------------------------------------------------------------
1848 wxString
wxString::Format(const wxChar
*pszFormat
, ...)
1851 va_start(argptr
, pszFormat
);
1854 s
.PrintfV(pszFormat
, argptr
);
1862 wxString
wxString::FormatV(const wxChar
*pszFormat
, va_list argptr
)
1865 s
.PrintfV(pszFormat
, argptr
);
1869 int wxString::Printf(const wxChar
*pszFormat
, ...)
1872 va_start(argptr
, pszFormat
);
1874 int iLen
= PrintfV(pszFormat
, argptr
);
1881 int wxString::PrintfV(const wxChar
* pszFormat
, va_list argptr
)
1889 wxStringBuffer
tmp(*this, size
+ 1);
1898 // wxVsnprintf() may modify the original arg pointer, so pass it
1901 wxVaCopy(argptrcopy
, argptr
);
1902 len
= wxVsnprintf(buf
, size
, pszFormat
, argptrcopy
);
1905 // some implementations of vsnprintf() don't NUL terminate
1906 // the string if there is not enough space for it so
1907 // always do it manually
1908 buf
[size
] = _T('\0');
1911 // vsnprintf() may return either -1 (traditional Unix behaviour) or the
1912 // total number of characters which would have been written if the
1913 // buffer were large enough
1914 if ( len
>= 0 && len
<= size
)
1916 // ok, there was enough space
1920 // still not enough, double it again
1924 // we could have overshot
1930 // ----------------------------------------------------------------------------
1931 // misc other operations
1932 // ----------------------------------------------------------------------------
1934 // returns true if the string matches the pattern which may contain '*' and
1935 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1937 bool wxString::Matches(const wxChar
*pszMask
) const
1939 // I disable this code as it doesn't seem to be faster (in fact, it seems
1940 // to be much slower) than the old, hand-written code below and using it
1941 // here requires always linking with libregex even if the user code doesn't
1943 #if 0 // wxUSE_REGEX
1944 // first translate the shell-like mask into a regex
1946 pattern
.reserve(wxStrlen(pszMask
));
1958 pattern
+= _T(".*");
1969 // these characters are special in a RE, quote them
1970 // (however note that we don't quote '[' and ']' to allow
1971 // using them for Unix shell like matching)
1972 pattern
+= _T('\\');
1976 pattern
+= *pszMask
;
1984 return wxRegEx(pattern
, wxRE_NOSUB
| wxRE_EXTENDED
).Matches(c_str());
1985 #else // !wxUSE_REGEX
1986 // TODO: this is, of course, awfully inefficient...
1988 // the char currently being checked
1989 const wxChar
*pszTxt
= c_str();
1991 // the last location where '*' matched
1992 const wxChar
*pszLastStarInText
= NULL
;
1993 const wxChar
*pszLastStarInMask
= NULL
;
1996 for ( ; *pszMask
!= wxT('\0'); pszMask
++, pszTxt
++ ) {
1997 switch ( *pszMask
) {
1999 if ( *pszTxt
== wxT('\0') )
2002 // pszTxt and pszMask will be incremented in the loop statement
2008 // remember where we started to be able to backtrack later
2009 pszLastStarInText
= pszTxt
;
2010 pszLastStarInMask
= pszMask
;
2012 // ignore special chars immediately following this one
2013 // (should this be an error?)
2014 while ( *pszMask
== wxT('*') || *pszMask
== wxT('?') )
2017 // if there is nothing more, match
2018 if ( *pszMask
== wxT('\0') )
2021 // are there any other metacharacters in the mask?
2023 const wxChar
*pEndMask
= wxStrpbrk(pszMask
, wxT("*?"));
2025 if ( pEndMask
!= NULL
) {
2026 // we have to match the string between two metachars
2027 uiLenMask
= pEndMask
- pszMask
;
2030 // we have to match the remainder of the string
2031 uiLenMask
= wxStrlen(pszMask
);
2034 wxString
strToMatch(pszMask
, uiLenMask
);
2035 const wxChar
* pMatch
= wxStrstr(pszTxt
, strToMatch
);
2036 if ( pMatch
== NULL
)
2039 // -1 to compensate "++" in the loop
2040 pszTxt
= pMatch
+ uiLenMask
- 1;
2041 pszMask
+= uiLenMask
- 1;
2046 if ( *pszMask
!= *pszTxt
)
2052 // match only if nothing left
2053 if ( *pszTxt
== wxT('\0') )
2056 // if we failed to match, backtrack if we can
2057 if ( pszLastStarInText
) {
2058 pszTxt
= pszLastStarInText
+ 1;
2059 pszMask
= pszLastStarInMask
;
2061 pszLastStarInText
= NULL
;
2063 // don't bother resetting pszLastStarInMask, it's unnecessary
2069 #endif // wxUSE_REGEX/!wxUSE_REGEX
2072 // Count the number of chars
2073 int wxString::Freq(wxChar ch
) const
2077 for (int i
= 0; i
< len
; i
++)
2079 if (GetChar(i
) == ch
)
2085 // convert to upper case, return the copy of the string
2086 wxString
wxString::Upper() const
2087 { wxString
s(*this); return s
.MakeUpper(); }
2089 // convert to lower case, return the copy of the string
2090 wxString
wxString::Lower() const { wxString
s(*this); return s
.MakeLower(); }
2092 int wxString::sprintf(const wxChar
*pszFormat
, ...)
2095 va_start(argptr
, pszFormat
);
2096 int iLen
= PrintfV(pszFormat
, argptr
);
2101 // ============================================================================
2103 // ============================================================================
2105 #include "wx/arrstr.h"
2109 // size increment = min(50% of current size, ARRAY_MAXSIZE_INCREMENT)
2110 #define ARRAY_MAXSIZE_INCREMENT 4096
2112 #ifndef ARRAY_DEFAULT_INITIAL_SIZE // also defined in dynarray.h
2113 #define ARRAY_DEFAULT_INITIAL_SIZE (16)
2116 #define STRING(p) ((wxString *)(&(p)))
2119 void wxArrayString::Init(bool autoSort
)
2123 m_pItems
= (wxChar
**) NULL
;
2124 m_autoSort
= autoSort
;
2128 wxArrayString::wxArrayString(const wxArrayString
& src
)
2130 Init(src
.m_autoSort
);
2135 // assignment operator
2136 wxArrayString
& wxArrayString::operator=(const wxArrayString
& src
)
2143 m_autoSort
= src
.m_autoSort
;
2148 void wxArrayString::Copy(const wxArrayString
& src
)
2150 if ( src
.m_nCount
> ARRAY_DEFAULT_INITIAL_SIZE
)
2151 Alloc(src
.m_nCount
);
2153 for ( size_t n
= 0; n
< src
.m_nCount
; n
++ )
2158 void wxArrayString::Grow(size_t nIncrement
)
2160 // only do it if no more place
2161 if ( (m_nSize
- m_nCount
) < nIncrement
) {
2162 // if ARRAY_DEFAULT_INITIAL_SIZE were set to 0, the initially empty would
2163 // be never resized!
2164 #if ARRAY_DEFAULT_INITIAL_SIZE == 0
2165 #error "ARRAY_DEFAULT_INITIAL_SIZE must be > 0!"
2168 if ( m_nSize
== 0 ) {
2169 // was empty, alloc some memory
2170 m_nSize
= ARRAY_DEFAULT_INITIAL_SIZE
;
2171 if (m_nSize
< nIncrement
)
2172 m_nSize
= nIncrement
;
2173 m_pItems
= new wxChar
*[m_nSize
];
2176 // otherwise when it's called for the first time, nIncrement would be 0
2177 // and the array would never be expanded
2178 // add 50% but not too much
2179 size_t ndefIncrement
= m_nSize
< ARRAY_DEFAULT_INITIAL_SIZE
2180 ? ARRAY_DEFAULT_INITIAL_SIZE
: m_nSize
>> 1;
2181 if ( ndefIncrement
> ARRAY_MAXSIZE_INCREMENT
)
2182 ndefIncrement
= ARRAY_MAXSIZE_INCREMENT
;
2183 if ( nIncrement
< ndefIncrement
)
2184 nIncrement
= ndefIncrement
;
2185 m_nSize
+= nIncrement
;
2186 wxChar
**pNew
= new wxChar
*[m_nSize
];
2188 // copy data to new location
2189 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2191 // delete old memory (but do not release the strings!)
2192 wxDELETEA(m_pItems
);
2199 void wxArrayString::Free()
2201 for ( size_t n
= 0; n
< m_nCount
; n
++ ) {
2202 STRING(m_pItems
[n
])->GetStringData()->Unlock();
2206 // deletes all the strings from the list
2207 void wxArrayString::Empty()
2214 // as Empty, but also frees memory
2215 void wxArrayString::Clear()
2222 wxDELETEA(m_pItems
);
2226 wxArrayString::~wxArrayString()
2230 wxDELETEA(m_pItems
);
2233 void wxArrayString::reserve(size_t nSize
)
2238 // pre-allocates memory (frees the previous data!)
2239 void wxArrayString::Alloc(size_t nSize
)
2241 // only if old buffer was not big enough
2242 if ( nSize
> m_nSize
) {
2244 wxDELETEA(m_pItems
);
2245 m_pItems
= new wxChar
*[nSize
];
2252 // minimizes the memory usage by freeing unused memory
2253 void wxArrayString::Shrink()
2255 // only do it if we have some memory to free
2256 if( m_nCount
< m_nSize
) {
2257 // allocates exactly as much memory as we need
2258 wxChar
**pNew
= new wxChar
*[m_nCount
];
2260 // copy data to new location
2261 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2267 #if WXWIN_COMPATIBILITY_2_4
2269 // return a wxString[] as required for some control ctors.
2270 wxString
* wxArrayString::GetStringArray() const
2272 wxString
*array
= 0;
2276 array
= new wxString
[m_nCount
];
2277 for( size_t i
= 0; i
< m_nCount
; i
++ )
2278 array
[i
] = m_pItems
[i
];
2284 #endif // WXWIN_COMPATIBILITY_2_4
2286 // searches the array for an item (forward or backwards)
2287 int wxArrayString::Index(const wxChar
*sz
, bool bCase
, bool bFromEnd
) const
2290 // use binary search in the sorted array
2291 wxASSERT_MSG( bCase
&& !bFromEnd
,
2292 wxT("search parameters ignored for auto sorted array") );
2301 res
= wxStrcmp(sz
, m_pItems
[i
]);
2313 // use linear search in unsorted array
2315 if ( m_nCount
> 0 ) {
2316 size_t ui
= m_nCount
;
2318 if ( STRING(m_pItems
[--ui
])->IsSameAs(sz
, bCase
) )
2325 for( size_t ui
= 0; ui
< m_nCount
; ui
++ ) {
2326 if( STRING(m_pItems
[ui
])->IsSameAs(sz
, bCase
) )
2335 // add item at the end
2336 size_t wxArrayString::Add(const wxString
& str
, size_t nInsert
)
2339 // insert the string at the correct position to keep the array sorted
2347 res
= str
.Cmp(m_pItems
[i
]);
2358 wxASSERT_MSG( lo
== hi
, wxT("binary search broken") );
2360 Insert(str
, lo
, nInsert
);
2365 wxASSERT( str
.GetStringData()->IsValid() );
2369 for (size_t i
= 0; i
< nInsert
; i
++)
2371 // the string data must not be deleted!
2372 str
.GetStringData()->Lock();
2375 m_pItems
[m_nCount
+ i
] = (wxChar
*)str
.c_str(); // const_cast
2377 size_t ret
= m_nCount
;
2378 m_nCount
+= nInsert
;
2383 // add item at the given position
2384 void wxArrayString::Insert(const wxString
& str
, size_t nIndex
, size_t nInsert
)
2386 wxASSERT( str
.GetStringData()->IsValid() );
2388 wxCHECK_RET( nIndex
<= m_nCount
, wxT("bad index in wxArrayString::Insert") );
2389 wxCHECK_RET( m_nCount
<= m_nCount
+ nInsert
,
2390 wxT("array size overflow in wxArrayString::Insert") );
2394 memmove(&m_pItems
[nIndex
+ nInsert
], &m_pItems
[nIndex
],
2395 (m_nCount
- nIndex
)*sizeof(wxChar
*));
2397 for (size_t i
= 0; i
< nInsert
; i
++)
2399 str
.GetStringData()->Lock();
2400 m_pItems
[nIndex
+ i
] = (wxChar
*)str
.c_str();
2402 m_nCount
+= nInsert
;
2405 // range insert (STL 23.2.4.3)
2407 wxArrayString::insert(iterator it
, const_iterator first
, const_iterator last
)
2409 const int idx
= it
- begin();
2414 // reset "it" since it can change inside Grow()
2417 while ( first
!= last
)
2419 it
= insert(it
, *first
);
2421 // insert returns an iterator to the last element inserted but we need
2422 // insert the next after this one, that is before the next one
2430 void wxArrayString::SetCount(size_t count
)
2435 while ( m_nCount
< count
)
2436 m_pItems
[m_nCount
++] = (wxChar
*)s
.c_str();
2439 // removes item from array (by index)
2440 void wxArrayString::RemoveAt(size_t nIndex
, size_t nRemove
)
2442 wxCHECK_RET( nIndex
< m_nCount
, wxT("bad index in wxArrayString::Remove") );
2443 wxCHECK_RET( nIndex
+ nRemove
<= m_nCount
,
2444 wxT("removing too many elements in wxArrayString::Remove") );
2447 for (size_t i
= 0; i
< nRemove
; i
++)
2448 Item(nIndex
+ i
).GetStringData()->Unlock();
2450 memmove(&m_pItems
[nIndex
], &m_pItems
[nIndex
+ nRemove
],
2451 (m_nCount
- nIndex
- nRemove
)*sizeof(wxChar
*));
2452 m_nCount
-= nRemove
;
2455 // removes item from array (by value)
2456 void wxArrayString::Remove(const wxChar
*sz
)
2458 int iIndex
= Index(sz
);
2460 wxCHECK_RET( iIndex
!= wxNOT_FOUND
,
2461 wxT("removing inexistent element in wxArrayString::Remove") );
2466 void wxArrayString::assign(const_iterator first
, const_iterator last
)
2468 reserve(last
- first
);
2469 for(; first
!= last
; ++first
)
2473 // ----------------------------------------------------------------------------
2475 // ----------------------------------------------------------------------------
2477 // we can only sort one array at a time with the quick-sort based
2480 // need a critical section to protect access to gs_compareFunction and
2481 // gs_sortAscending variables
2482 static wxCriticalSection
*gs_critsectStringSort
= NULL
;
2484 // call this before the value of the global sort vars is changed/after
2485 // you're finished with them
2486 #define START_SORT() wxASSERT( !gs_critsectStringSort ); \
2487 gs_critsectStringSort = new wxCriticalSection; \
2488 gs_critsectStringSort->Enter()
2489 #define END_SORT() gs_critsectStringSort->Leave(); \
2490 delete gs_critsectStringSort; \
2491 gs_critsectStringSort = NULL
2493 #define START_SORT()
2495 #endif // wxUSE_THREADS
2497 // function to use for string comparaison
2498 static wxArrayString::CompareFunction gs_compareFunction
= NULL
;
2500 // if we don't use the compare function, this flag tells us if we sort the
2501 // array in ascending or descending order
2502 static bool gs_sortAscending
= true;
2504 // function which is called by quick sort
2505 extern "C" int wxC_CALLING_CONV
// LINKAGEMODE
2506 wxStringCompareFunction(const void *first
, const void *second
)
2508 wxString
*strFirst
= (wxString
*)first
;
2509 wxString
*strSecond
= (wxString
*)second
;
2511 if ( gs_compareFunction
) {
2512 return gs_compareFunction(*strFirst
, *strSecond
);
2515 // maybe we should use wxStrcoll
2516 int result
= strFirst
->Cmp(*strSecond
);
2518 return gs_sortAscending
? result
: -result
;
2522 // sort array elements using passed comparaison function
2523 void wxArrayString::Sort(CompareFunction compareFunction
)
2527 wxASSERT( !gs_compareFunction
); // must have been reset to NULL
2528 gs_compareFunction
= compareFunction
;
2532 // reset it to NULL so that Sort(bool) will work the next time
2533 gs_compareFunction
= NULL
;
2538 typedef int (wxC_CALLING_CONV
* wxStringCompareFn
)(const void *first
, const void *second
);
2540 void wxArrayString::Sort(CompareFunction2 compareFunction
)
2542 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), (wxStringCompareFn
)compareFunction
);
2545 void wxArrayString::Sort(bool reverseOrder
)
2547 Sort(reverseOrder
? wxStringSortDescending
: wxStringSortAscending
);
2550 void wxArrayString::DoSort()
2552 wxCHECK_RET( !m_autoSort
, wxT("can't use this method with sorted arrays") );
2554 // just sort the pointers using qsort() - of course it only works because
2555 // wxString() *is* a pointer to its data
2556 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), wxStringCompareFunction
);
2559 bool wxArrayString::operator==(const wxArrayString
& a
) const
2561 if ( m_nCount
!= a
.m_nCount
)
2564 for ( size_t n
= 0; n
< m_nCount
; n
++ )
2566 if ( Item(n
) != a
[n
] )
2573 #endif // !wxUSE_STL
2575 int wxCMPFUNC_CONV
wxStringSortAscending(wxString
* s1
, wxString
* s2
)
2577 return s1
->Cmp(*s2
);
2580 int wxCMPFUNC_CONV
wxStringSortDescending(wxString
* s1
, wxString
* s2
)
2582 return -s1
->Cmp(*s2
);