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 wxMemcpy(m_pchData
, pData
->data(), nLen
);
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(nCount
, ch
).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 // construction and conversion
989 // ---------------------------------------------------------------------------
993 // from multibyte string
994 wxString::wxString(const char *psz
, wxMBConv
& conv
, size_t nLength
)
996 // if nLength != npos, then we have to make a NULL-terminated copy
997 // of first nLength bytes of psz first because the input buffer to MB2WC
998 // must always be NULL-terminated:
999 wxCharBuffer
inBuf((const char *)NULL
);
1000 if (nLength
!= npos
)
1002 wxASSERT( psz
!= NULL
);
1003 wxCharBuffer
tmp(nLength
);
1004 memcpy(tmp
.data(), psz
, nLength
);
1005 tmp
.data()[nLength
] = '\0';
1010 // first get the size of the buffer we need
1014 // calculate the needed size ourselves or use the provided one
1015 if (nLength
== npos
)
1022 // nothing to convert
1028 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
1030 //Get length of converted string
1031 size_t dwConvLen
= conv
.MB2WC(NULL
, psz
, 0, nLen
);
1033 //if valid, do the conversion
1034 if (dwConvLen
!= (size_t) -1)
1036 //Get internal buffer
1037 wxStringBufferLength
internalBuffer(*this, dwConvLen
+ 1);
1039 //Do the actual conversion & Set the length of the buffer
1040 internalBuffer
.SetLength(
1041 conv
.MB2WC(internalBuffer
, psz
, dwConvLen
+ 1, nLen
)
1047 //Convert wxString in Unicode mode to a multi-byte string
1048 const wxCharBuffer
wxString::mb_str(wxMBConv
& conv
) const
1050 //Get length of converted string
1051 size_t dwConvLen
= conv
.WC2MB(NULL
, (*this).c_str(), 0, length());
1053 //if valid, do the conversion
1054 if (dwConvLen
!= (size_t) -1)
1056 //Create good buffer
1057 wxCharBuffer
buffer(dwConvLen
+ 1);
1059 //Do the actual conversion
1060 conv
.WC2MB(buffer
.data(), (*this).c_str(), dwConvLen
+ 1, length());
1065 //create bogus buffer
1066 wxCharBuffer
buffer(1);
1067 buffer
.data()[0u] = 0;
1075 wxString::wxString(const wchar_t *pwz
, wxMBConv
& conv
, size_t nLength
)
1077 // if nLength != npos, then we have to make a NULL-terminated copy
1078 // of first nLength chars of psz first because the input buffer to WC2MB
1079 // must always be NULL-terminated:
1080 wxWCharBuffer
inBuf((const wchar_t *)NULL
);
1081 if (nLength
!= npos
)
1083 wxASSERT( pwz
!= NULL
);
1084 wxWCharBuffer
tmp(nLength
);
1085 memcpy(tmp
.data(), pwz
, nLength
* sizeof(wchar_t));
1086 tmp
.data()[nLength
] = '\0';
1091 // first get the size of the buffer we need
1095 // calculate the needed size ourselves or use the provided one
1096 if (nLength
== npos
)
1097 nLen
= wxWcslen(pwz
);
1103 // nothing to convert
1108 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
1110 //Get length of converted string
1111 size_t dwConvLen
= conv
.WC2MB(NULL
, pwz
, 0, nLen
);
1113 //if valid, do the conversion
1114 if (dwConvLen
!= (size_t) -1)
1116 //Get internal buffer
1117 wxStringBufferLength
internalBuffer(*this, dwConvLen
+ 1);
1119 //Do the actual conversion & Set the length of the buffer
1120 internalBuffer
.SetLength(
1121 conv
.WC2MB(internalBuffer
, pwz
, dwConvLen
+ 1, nLen
)
1127 //Converts this string to a wide character string if unicode
1128 //mode is not enabled and wxUSE_WCHAR_T is enabled
1129 const wxWCharBuffer
wxString::wc_str(wxMBConv
& conv
) const
1131 //Get length of converted string
1132 size_t dwConvLen
= conv
.MB2WC(NULL
, (*this).c_str(), 0, length());
1134 //if valid, do the conversion
1135 if (dwConvLen
!= (size_t) -1)
1137 //Create good buffer
1138 wxWCharBuffer
buffer(dwConvLen
+ 1);
1140 //Do the actual conversion
1141 conv
.MB2WC(buffer
.data(), (*this).c_str(), dwConvLen
+ 1, length());
1146 //create bogus buffer
1147 wxWCharBuffer
buffer(1);
1148 buffer
.data()[0u] = 0;
1152 #endif // wxUSE_WCHAR_T
1154 #endif // Unicode/ANSI
1156 // shrink to minimal size (releasing extra memory)
1157 bool wxString::Shrink()
1159 wxString
tmp(begin(), end());
1161 return tmp
.length() == length();
1165 // get the pointer to writable buffer of (at least) nLen bytes
1166 wxChar
*wxString::GetWriteBuf(size_t nLen
)
1168 if ( !AllocBeforeWrite(nLen
) ) {
1169 // allocation failure handled by caller
1173 wxASSERT( GetStringData()->nRefs
== 1 );
1174 GetStringData()->Validate(false);
1179 // put string back in a reasonable state after GetWriteBuf
1180 void wxString::UngetWriteBuf()
1182 GetStringData()->nDataLength
= wxStrlen(m_pchData
);
1183 GetStringData()->Validate(true);
1186 void wxString::UngetWriteBuf(size_t nLen
)
1188 GetStringData()->nDataLength
= nLen
;
1189 GetStringData()->Validate(true);
1193 // ---------------------------------------------------------------------------
1195 // ---------------------------------------------------------------------------
1197 // all functions are inline in string.h
1199 // ---------------------------------------------------------------------------
1200 // assignment operators
1201 // ---------------------------------------------------------------------------
1205 // same as 'signed char' variant
1206 wxString
& wxString::operator=(const unsigned char* psz
)
1208 *this = (const char *)psz
;
1213 wxString
& wxString::operator=(const wchar_t *pwz
)
1224 * concatenation functions come in 5 flavours:
1226 * char + string and string + char
1227 * C str + string and string + C str
1230 wxString
operator+(const wxString
& str1
, const wxString
& str2
)
1233 wxASSERT( str1
.GetStringData()->IsValid() );
1234 wxASSERT( str2
.GetStringData()->IsValid() );
1243 wxString
operator+(const wxString
& str
, wxChar ch
)
1246 wxASSERT( str
.GetStringData()->IsValid() );
1255 wxString
operator+(wxChar ch
, const wxString
& str
)
1258 wxASSERT( str
.GetStringData()->IsValid() );
1267 wxString
operator+(const wxString
& str
, const wxChar
*psz
)
1270 wxASSERT( str
.GetStringData()->IsValid() );
1274 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1275 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1283 wxString
operator+(const wxChar
*psz
, const wxString
& str
)
1286 wxASSERT( str
.GetStringData()->IsValid() );
1290 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1291 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1299 // ===========================================================================
1300 // other common string functions
1301 // ===========================================================================
1303 int wxString::Cmp(const wxString
& s
) const
1308 int wxString::Cmp(const wxChar
* psz
) const
1310 return compare(psz
);
1313 static inline int wxDoCmpNoCase(const wxChar
* s1
, size_t l1
,
1314 const wxChar
* s2
, size_t l2
)
1320 for(i
= 0; i
< l1
; ++i
)
1322 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1325 return i
== l1
? 0 : s1
[i
] < s2
[i
] ? -1 : 1;
1329 for(i
= 0; i
< l1
; ++i
)
1331 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1334 return i
== l1
? -1 : s1
[i
] < s2
[i
] ? -1 : 1;
1338 for(i
= 0; i
< l2
; ++i
)
1340 if(wxTolower(s1
[i
]) != wxTolower(s2
[i
]))
1343 return i
== l2
? 1 : s1
[i
] < s2
[i
] ? -1 : 1;
1346 wxFAIL
; // must never get there
1347 return 0; // quiet compilers
1350 int wxString::CmpNoCase(const wxString
& s
) const
1352 return wxDoCmpNoCase(data(), length(), s
.data(), s
.length());
1355 int wxString::CmpNoCase(const wxChar
* psz
) const
1357 int nLen
= wxStrlen(psz
);
1359 return wxDoCmpNoCase(data(), length(), psz
, nLen
);
1366 #ifndef __SCHAR_MAX__
1367 #define __SCHAR_MAX__ 127
1371 wxString
wxString::FromAscii(const char *ascii
)
1374 return wxEmptyString
;
1376 size_t len
= strlen( ascii
);
1381 wxStringBuffer
buf(res
, len
);
1383 wchar_t *dest
= buf
;
1387 if ( (*dest
++ = (wchar_t)(unsigned char)*ascii
++) == L
'\0' )
1395 wxString
wxString::FromAscii(const char ascii
)
1397 // What do we do with '\0' ?
1400 res
+= (wchar_t)(unsigned char) ascii
;
1405 const wxCharBuffer
wxString::ToAscii() const
1407 // this will allocate enough space for the terminating NUL too
1408 wxCharBuffer
buffer(length());
1410 signed char *dest
= (signed char *)buffer
.data();
1412 const wchar_t *pwc
= c_str();
1415 *dest
++ = *pwc
> SCHAR_MAX
? wxT('_') : *pwc
;
1417 // the output string can't have embedded NULs anyhow, so we can safely
1418 // stop at first of them even if we do have any
1428 // extract string of length nCount starting at nFirst
1429 wxString
wxString::Mid(size_t nFirst
, size_t nCount
) const
1431 size_t nLen
= length();
1433 // default value of nCount is npos and means "till the end"
1434 if ( nCount
== npos
)
1436 nCount
= nLen
- nFirst
;
1439 // out-of-bounds requests return sensible things
1440 if ( nFirst
+ nCount
> nLen
)
1442 nCount
= nLen
- nFirst
;
1445 if ( nFirst
> nLen
)
1447 // AllocCopy() will return empty string
1451 wxString
dest(*this, nFirst
, nCount
);
1452 if ( dest
.length() != nCount
) {
1453 wxFAIL_MSG( _T("out of memory in wxString::Mid") );
1459 // check that the string starts with prefix and return the rest of the string
1460 // in the provided pointer if it is not NULL, otherwise return false
1461 bool wxString::StartsWith(const wxChar
*prefix
, wxString
*rest
) const
1463 wxASSERT_MSG( prefix
, _T("invalid parameter in wxString::StartsWith") );
1465 // first check if the beginning of the string matches the prefix: note
1466 // that we don't have to check that we don't run out of this string as
1467 // when we reach the terminating NUL, either prefix string ends too (and
1468 // then it's ok) or we break out of the loop because there is no match
1469 const wxChar
*p
= c_str();
1472 if ( *prefix
++ != *p
++ )
1481 // put the rest of the string into provided pointer
1488 // extract nCount last (rightmost) characters
1489 wxString
wxString::Right(size_t nCount
) const
1491 if ( nCount
> length() )
1494 wxString
dest(*this, length() - nCount
, nCount
);
1495 if ( dest
.length() != nCount
) {
1496 wxFAIL_MSG( _T("out of memory in wxString::Right") );
1501 // get all characters after the last occurence of ch
1502 // (returns the whole string if ch not found)
1503 wxString
wxString::AfterLast(wxChar ch
) const
1506 int iPos
= Find(ch
, true);
1507 if ( iPos
== wxNOT_FOUND
)
1510 str
= c_str() + iPos
+ 1;
1515 // extract nCount first (leftmost) characters
1516 wxString
wxString::Left(size_t nCount
) const
1518 if ( nCount
> length() )
1521 wxString
dest(*this, 0, nCount
);
1522 if ( dest
.length() != nCount
) {
1523 wxFAIL_MSG( _T("out of memory in wxString::Left") );
1528 // get all characters before the first occurence of ch
1529 // (returns the whole string if ch not found)
1530 wxString
wxString::BeforeFirst(wxChar ch
) const
1532 int iPos
= Find(ch
);
1533 if ( iPos
== wxNOT_FOUND
) iPos
= length();
1534 return wxString(*this, 0, iPos
);
1537 /// get all characters before the last occurence of ch
1538 /// (returns empty string if ch not found)
1539 wxString
wxString::BeforeLast(wxChar ch
) const
1542 int iPos
= Find(ch
, true);
1543 if ( iPos
!= wxNOT_FOUND
&& iPos
!= 0 )
1544 str
= wxString(c_str(), iPos
);
1549 /// get all characters after the first occurence of ch
1550 /// (returns empty string if ch not found)
1551 wxString
wxString::AfterFirst(wxChar ch
) const
1554 int iPos
= Find(ch
);
1555 if ( iPos
!= wxNOT_FOUND
)
1556 str
= c_str() + iPos
+ 1;
1561 // replace first (or all) occurences of some substring with another one
1563 wxString::Replace(const wxChar
*szOld
, const wxChar
*szNew
, bool bReplaceAll
)
1565 // if we tried to replace an empty string we'd enter an infinite loop below
1566 wxCHECK_MSG( szOld
&& *szOld
&& szNew
, 0,
1567 _T("wxString::Replace(): invalid parameter") );
1569 size_t uiCount
= 0; // count of replacements made
1571 size_t uiOldLen
= wxStrlen(szOld
);
1574 const wxChar
*pCurrent
= c_str();
1575 const wxChar
*pSubstr
;
1576 while ( *pCurrent
!= wxT('\0') ) {
1577 pSubstr
= wxStrstr(pCurrent
, szOld
);
1578 if ( pSubstr
== NULL
) {
1579 // strTemp is unused if no replacements were made, so avoid the copy
1583 strTemp
+= pCurrent
; // copy the rest
1584 break; // exit the loop
1587 // take chars before match
1588 size_type len
= strTemp
.length();
1589 strTemp
.append(pCurrent
, pSubstr
- pCurrent
);
1590 if ( strTemp
.length() != (size_t)(len
+ pSubstr
- pCurrent
) ) {
1591 wxFAIL_MSG( _T("out of memory in wxString::Replace") );
1595 pCurrent
= pSubstr
+ uiOldLen
; // restart after match
1600 if ( !bReplaceAll
) {
1601 strTemp
+= pCurrent
; // copy the rest
1602 break; // exit the loop
1607 // only done if there were replacements, otherwise would have returned above
1613 bool wxString::IsAscii() const
1615 const wxChar
*s
= (const wxChar
*) *this;
1617 if(!isascii(*s
)) return(false);
1623 bool wxString::IsWord() const
1625 const wxChar
*s
= (const wxChar
*) *this;
1627 if(!wxIsalpha(*s
)) return(false);
1633 bool wxString::IsNumber() const
1635 const wxChar
*s
= (const wxChar
*) *this;
1637 if ((s
[0] == wxT('-')) || (s
[0] == wxT('+'))) s
++;
1639 if(!wxIsdigit(*s
)) return(false);
1645 wxString
wxString::Strip(stripType w
) const
1648 if ( w
& leading
) s
.Trim(false);
1649 if ( w
& trailing
) s
.Trim(true);
1653 // ---------------------------------------------------------------------------
1655 // ---------------------------------------------------------------------------
1657 wxString
& wxString::MakeUpper()
1659 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1660 *it
= (wxChar
)wxToupper(*it
);
1665 wxString
& wxString::MakeLower()
1667 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1668 *it
= (wxChar
)wxTolower(*it
);
1673 // ---------------------------------------------------------------------------
1674 // trimming and padding
1675 // ---------------------------------------------------------------------------
1677 // some compilers (VC++ 6.0 not to name them) return true for a call to
1678 // isspace('ê') in the C locale which seems to be broken to me, but we have to
1679 // live with this by checking that the character is a 7 bit one - even if this
1680 // may fail to detect some spaces (I don't know if Unicode doesn't have
1681 // space-like symbols somewhere except in the first 128 chars), it is arguably
1682 // still better than trimming away accented letters
1683 inline int wxSafeIsspace(wxChar ch
) { return (ch
< 127) && wxIsspace(ch
); }
1685 // trims spaces (in the sense of isspace) from left or right side
1686 wxString
& wxString::Trim(bool bFromRight
)
1688 // first check if we're going to modify the string at all
1691 (bFromRight
&& wxSafeIsspace(GetChar(Len() - 1))) ||
1692 (!bFromRight
&& wxSafeIsspace(GetChar(0u)))
1698 // find last non-space character
1699 iterator psz
= begin() + length() - 1;
1700 while ( wxSafeIsspace(*psz
) && (psz
>= begin()) )
1703 // truncate at trailing space start
1709 // find first non-space character
1710 iterator psz
= begin();
1711 while ( wxSafeIsspace(*psz
) )
1714 // fix up data and length
1715 erase(begin(), psz
);
1722 // adds nCount characters chPad to the string from either side
1723 wxString
& wxString::Pad(size_t nCount
, wxChar chPad
, bool bFromRight
)
1725 wxString
s(chPad
, nCount
);
1738 // truncate the string
1739 wxString
& wxString::Truncate(size_t uiLen
)
1741 if ( uiLen
< Len() ) {
1742 erase(begin() + uiLen
, end());
1744 //else: nothing to do, string is already short enough
1749 // ---------------------------------------------------------------------------
1750 // finding (return wxNOT_FOUND if not found and index otherwise)
1751 // ---------------------------------------------------------------------------
1754 int wxString::Find(wxChar ch
, bool bFromEnd
) const
1756 size_type idx
= bFromEnd
? find_last_of(ch
) : find_first_of(ch
);
1758 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1761 // find a sub-string (like strstr)
1762 int wxString::Find(const wxChar
*pszSub
) const
1764 size_type idx
= find(pszSub
);
1766 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1769 // ----------------------------------------------------------------------------
1770 // conversion to numbers
1771 // ----------------------------------------------------------------------------
1773 bool wxString::ToLong(long *val
, int base
) const
1775 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToLong") );
1776 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1778 const wxChar
*start
= c_str();
1780 *val
= wxStrtol(start
, &end
, base
);
1782 // return true only if scan was stopped by the terminating NUL and if the
1783 // string was not empty to start with
1784 return !*end
&& (end
!= start
);
1787 bool wxString::ToULong(unsigned long *val
, int base
) const
1789 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToULong") );
1790 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1792 const wxChar
*start
= c_str();
1794 *val
= wxStrtoul(start
, &end
, base
);
1796 // return true only if scan was stopped by the terminating NUL and if the
1797 // string was not empty to start with
1798 return !*end
&& (end
!= start
);
1801 bool wxString::ToDouble(double *val
) const
1803 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToDouble") );
1805 const wxChar
*start
= c_str();
1807 *val
= wxStrtod(start
, &end
);
1809 // return true only if scan was stopped by the terminating NUL and if the
1810 // string was not empty to start with
1811 return !*end
&& (end
!= start
);
1814 // ---------------------------------------------------------------------------
1816 // ---------------------------------------------------------------------------
1819 wxString
wxString::Format(const wxChar
*pszFormat
, ...)
1822 va_start(argptr
, pszFormat
);
1825 s
.PrintfV(pszFormat
, argptr
);
1833 wxString
wxString::FormatV(const wxChar
*pszFormat
, va_list argptr
)
1836 s
.PrintfV(pszFormat
, argptr
);
1840 int wxString::Printf(const wxChar
*pszFormat
, ...)
1843 va_start(argptr
, pszFormat
);
1845 int iLen
= PrintfV(pszFormat
, argptr
);
1852 int wxString::PrintfV(const wxChar
* pszFormat
, va_list argptr
)
1860 wxStringBuffer
tmp(*this, size
+ 1);
1869 // wxVsnprintf() may modify the original arg pointer, so pass it
1872 wxVaCopy(argptrcopy
, argptr
);
1873 len
= wxVsnprintf(buf
, size
, pszFormat
, argptrcopy
);
1876 // some implementations of vsnprintf() don't NUL terminate
1877 // the string if there is not enough space for it so
1878 // always do it manually
1879 buf
[size
] = _T('\0');
1882 // vsnprintf() may return either -1 (traditional Unix behaviour) or the
1883 // total number of characters which would have been written if the
1884 // buffer were large enough
1885 if ( len
>= 0 && len
<= size
)
1887 // ok, there was enough space
1891 // still not enough, double it again
1895 // we could have overshot
1901 // ----------------------------------------------------------------------------
1902 // misc other operations
1903 // ----------------------------------------------------------------------------
1905 // returns true if the string matches the pattern which may contain '*' and
1906 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1908 bool wxString::Matches(const wxChar
*pszMask
) const
1910 // I disable this code as it doesn't seem to be faster (in fact, it seems
1911 // to be much slower) than the old, hand-written code below and using it
1912 // here requires always linking with libregex even if the user code doesn't
1914 #if 0 // wxUSE_REGEX
1915 // first translate the shell-like mask into a regex
1917 pattern
.reserve(wxStrlen(pszMask
));
1929 pattern
+= _T(".*");
1940 // these characters are special in a RE, quote them
1941 // (however note that we don't quote '[' and ']' to allow
1942 // using them for Unix shell like matching)
1943 pattern
+= _T('\\');
1947 pattern
+= *pszMask
;
1955 return wxRegEx(pattern
, wxRE_NOSUB
| wxRE_EXTENDED
).Matches(c_str());
1956 #else // !wxUSE_REGEX
1957 // TODO: this is, of course, awfully inefficient...
1959 // the char currently being checked
1960 const wxChar
*pszTxt
= c_str();
1962 // the last location where '*' matched
1963 const wxChar
*pszLastStarInText
= NULL
;
1964 const wxChar
*pszLastStarInMask
= NULL
;
1967 for ( ; *pszMask
!= wxT('\0'); pszMask
++, pszTxt
++ ) {
1968 switch ( *pszMask
) {
1970 if ( *pszTxt
== wxT('\0') )
1973 // pszTxt and pszMask will be incremented in the loop statement
1979 // remember where we started to be able to backtrack later
1980 pszLastStarInText
= pszTxt
;
1981 pszLastStarInMask
= pszMask
;
1983 // ignore special chars immediately following this one
1984 // (should this be an error?)
1985 while ( *pszMask
== wxT('*') || *pszMask
== wxT('?') )
1988 // if there is nothing more, match
1989 if ( *pszMask
== wxT('\0') )
1992 // are there any other metacharacters in the mask?
1994 const wxChar
*pEndMask
= wxStrpbrk(pszMask
, wxT("*?"));
1996 if ( pEndMask
!= NULL
) {
1997 // we have to match the string between two metachars
1998 uiLenMask
= pEndMask
- pszMask
;
2001 // we have to match the remainder of the string
2002 uiLenMask
= wxStrlen(pszMask
);
2005 wxString
strToMatch(pszMask
, uiLenMask
);
2006 const wxChar
* pMatch
= wxStrstr(pszTxt
, strToMatch
);
2007 if ( pMatch
== NULL
)
2010 // -1 to compensate "++" in the loop
2011 pszTxt
= pMatch
+ uiLenMask
- 1;
2012 pszMask
+= uiLenMask
- 1;
2017 if ( *pszMask
!= *pszTxt
)
2023 // match only if nothing left
2024 if ( *pszTxt
== wxT('\0') )
2027 // if we failed to match, backtrack if we can
2028 if ( pszLastStarInText
) {
2029 pszTxt
= pszLastStarInText
+ 1;
2030 pszMask
= pszLastStarInMask
;
2032 pszLastStarInText
= NULL
;
2034 // don't bother resetting pszLastStarInMask, it's unnecessary
2040 #endif // wxUSE_REGEX/!wxUSE_REGEX
2043 // Count the number of chars
2044 int wxString::Freq(wxChar ch
) const
2048 for (int i
= 0; i
< len
; i
++)
2050 if (GetChar(i
) == ch
)
2056 // convert to upper case, return the copy of the string
2057 wxString
wxString::Upper() const
2058 { wxString
s(*this); return s
.MakeUpper(); }
2060 // convert to lower case, return the copy of the string
2061 wxString
wxString::Lower() const { wxString
s(*this); return s
.MakeLower(); }
2063 int wxString::sprintf(const wxChar
*pszFormat
, ...)
2066 va_start(argptr
, pszFormat
);
2067 int iLen
= PrintfV(pszFormat
, argptr
);
2072 // ============================================================================
2074 // ============================================================================
2076 #include "wx/arrstr.h"
2080 // size increment = min(50% of current size, ARRAY_MAXSIZE_INCREMENT)
2081 #define ARRAY_MAXSIZE_INCREMENT 4096
2083 #ifndef ARRAY_DEFAULT_INITIAL_SIZE // also defined in dynarray.h
2084 #define ARRAY_DEFAULT_INITIAL_SIZE (16)
2087 #define STRING(p) ((wxString *)(&(p)))
2090 void wxArrayString::Init(bool autoSort
)
2094 m_pItems
= (wxChar
**) NULL
;
2095 m_autoSort
= autoSort
;
2099 wxArrayString::wxArrayString(const wxArrayString
& src
)
2101 Init(src
.m_autoSort
);
2106 // assignment operator
2107 wxArrayString
& wxArrayString::operator=(const wxArrayString
& src
)
2114 m_autoSort
= src
.m_autoSort
;
2119 void wxArrayString::Copy(const wxArrayString
& src
)
2121 if ( src
.m_nCount
> ARRAY_DEFAULT_INITIAL_SIZE
)
2122 Alloc(src
.m_nCount
);
2124 for ( size_t n
= 0; n
< src
.m_nCount
; n
++ )
2129 void wxArrayString::Grow(size_t nIncrement
)
2131 // only do it if no more place
2132 if ( (m_nSize
- m_nCount
) < nIncrement
) {
2133 // if ARRAY_DEFAULT_INITIAL_SIZE were set to 0, the initially empty would
2134 // be never resized!
2135 #if ARRAY_DEFAULT_INITIAL_SIZE == 0
2136 #error "ARRAY_DEFAULT_INITIAL_SIZE must be > 0!"
2139 if ( m_nSize
== 0 ) {
2140 // was empty, alloc some memory
2141 m_nSize
= ARRAY_DEFAULT_INITIAL_SIZE
;
2142 if (m_nSize
< nIncrement
)
2143 m_nSize
= nIncrement
;
2144 m_pItems
= new wxChar
*[m_nSize
];
2147 // otherwise when it's called for the first time, nIncrement would be 0
2148 // and the array would never be expanded
2149 // add 50% but not too much
2150 size_t ndefIncrement
= m_nSize
< ARRAY_DEFAULT_INITIAL_SIZE
2151 ? ARRAY_DEFAULT_INITIAL_SIZE
: m_nSize
>> 1;
2152 if ( ndefIncrement
> ARRAY_MAXSIZE_INCREMENT
)
2153 ndefIncrement
= ARRAY_MAXSIZE_INCREMENT
;
2154 if ( nIncrement
< ndefIncrement
)
2155 nIncrement
= ndefIncrement
;
2156 m_nSize
+= nIncrement
;
2157 wxChar
**pNew
= new wxChar
*[m_nSize
];
2159 // copy data to new location
2160 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2162 // delete old memory (but do not release the strings!)
2163 wxDELETEA(m_pItems
);
2170 void wxArrayString::Free()
2172 for ( size_t n
= 0; n
< m_nCount
; n
++ ) {
2173 STRING(m_pItems
[n
])->GetStringData()->Unlock();
2177 // deletes all the strings from the list
2178 void wxArrayString::Empty()
2185 // as Empty, but also frees memory
2186 void wxArrayString::Clear()
2193 wxDELETEA(m_pItems
);
2197 wxArrayString::~wxArrayString()
2201 wxDELETEA(m_pItems
);
2204 void wxArrayString::reserve(size_t nSize
)
2209 // pre-allocates memory (frees the previous data!)
2210 void wxArrayString::Alloc(size_t nSize
)
2212 // only if old buffer was not big enough
2213 if ( nSize
> m_nSize
) {
2215 wxDELETEA(m_pItems
);
2216 m_pItems
= new wxChar
*[nSize
];
2223 // minimizes the memory usage by freeing unused memory
2224 void wxArrayString::Shrink()
2226 // only do it if we have some memory to free
2227 if( m_nCount
< m_nSize
) {
2228 // allocates exactly as much memory as we need
2229 wxChar
**pNew
= new wxChar
*[m_nCount
];
2231 // copy data to new location
2232 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2238 #if WXWIN_COMPATIBILITY_2_4
2240 // return a wxString[] as required for some control ctors.
2241 wxString
* wxArrayString::GetStringArray() const
2243 wxString
*array
= 0;
2247 array
= new wxString
[m_nCount
];
2248 for( size_t i
= 0; i
< m_nCount
; i
++ )
2249 array
[i
] = m_pItems
[i
];
2255 #endif // WXWIN_COMPATIBILITY_2_4
2257 // searches the array for an item (forward or backwards)
2258 int wxArrayString::Index(const wxChar
*sz
, bool bCase
, bool bFromEnd
) const
2261 // use binary search in the sorted array
2262 wxASSERT_MSG( bCase
&& !bFromEnd
,
2263 wxT("search parameters ignored for auto sorted array") );
2272 res
= wxStrcmp(sz
, m_pItems
[i
]);
2284 // use linear search in unsorted array
2286 if ( m_nCount
> 0 ) {
2287 size_t ui
= m_nCount
;
2289 if ( STRING(m_pItems
[--ui
])->IsSameAs(sz
, bCase
) )
2296 for( size_t ui
= 0; ui
< m_nCount
; ui
++ ) {
2297 if( STRING(m_pItems
[ui
])->IsSameAs(sz
, bCase
) )
2306 // add item at the end
2307 size_t wxArrayString::Add(const wxString
& str
, size_t nInsert
)
2310 // insert the string at the correct position to keep the array sorted
2318 res
= str
.Cmp(m_pItems
[i
]);
2329 wxASSERT_MSG( lo
== hi
, wxT("binary search broken") );
2331 Insert(str
, lo
, nInsert
);
2336 wxASSERT( str
.GetStringData()->IsValid() );
2340 for (size_t i
= 0; i
< nInsert
; i
++)
2342 // the string data must not be deleted!
2343 str
.GetStringData()->Lock();
2346 m_pItems
[m_nCount
+ i
] = (wxChar
*)str
.c_str(); // const_cast
2348 size_t ret
= m_nCount
;
2349 m_nCount
+= nInsert
;
2354 // add item at the given position
2355 void wxArrayString::Insert(const wxString
& str
, size_t nIndex
, size_t nInsert
)
2357 wxASSERT( str
.GetStringData()->IsValid() );
2359 wxCHECK_RET( nIndex
<= m_nCount
, wxT("bad index in wxArrayString::Insert") );
2360 wxCHECK_RET( m_nCount
<= m_nCount
+ nInsert
,
2361 wxT("array size overflow in wxArrayString::Insert") );
2365 memmove(&m_pItems
[nIndex
+ nInsert
], &m_pItems
[nIndex
],
2366 (m_nCount
- nIndex
)*sizeof(wxChar
*));
2368 for (size_t i
= 0; i
< nInsert
; i
++)
2370 str
.GetStringData()->Lock();
2371 m_pItems
[nIndex
+ i
] = (wxChar
*)str
.c_str();
2373 m_nCount
+= nInsert
;
2376 // range insert (STL 23.2.4.3)
2378 wxArrayString::insert(iterator it
, const_iterator first
, const_iterator last
)
2380 const int idx
= it
- begin();
2385 // reset "it" since it can change inside Grow()
2388 while ( first
!= last
)
2390 it
= insert(it
, *first
);
2392 // insert returns an iterator to the last element inserted but we need
2393 // insert the next after this one, that is before the next one
2401 void wxArrayString::SetCount(size_t count
)
2406 while ( m_nCount
< count
)
2407 m_pItems
[m_nCount
++] = (wxChar
*)s
.c_str();
2410 // removes item from array (by index)
2411 void wxArrayString::RemoveAt(size_t nIndex
, size_t nRemove
)
2413 wxCHECK_RET( nIndex
< m_nCount
, wxT("bad index in wxArrayString::Remove") );
2414 wxCHECK_RET( nIndex
+ nRemove
<= m_nCount
,
2415 wxT("removing too many elements in wxArrayString::Remove") );
2418 for (size_t i
= 0; i
< nRemove
; i
++)
2419 Item(nIndex
+ i
).GetStringData()->Unlock();
2421 memmove(&m_pItems
[nIndex
], &m_pItems
[nIndex
+ nRemove
],
2422 (m_nCount
- nIndex
- nRemove
)*sizeof(wxChar
*));
2423 m_nCount
-= nRemove
;
2426 // removes item from array (by value)
2427 void wxArrayString::Remove(const wxChar
*sz
)
2429 int iIndex
= Index(sz
);
2431 wxCHECK_RET( iIndex
!= wxNOT_FOUND
,
2432 wxT("removing inexistent element in wxArrayString::Remove") );
2437 void wxArrayString::assign(const_iterator first
, const_iterator last
)
2439 reserve(last
- first
);
2440 for(; first
!= last
; ++first
)
2444 // ----------------------------------------------------------------------------
2446 // ----------------------------------------------------------------------------
2448 // we can only sort one array at a time with the quick-sort based
2451 // need a critical section to protect access to gs_compareFunction and
2452 // gs_sortAscending variables
2453 static wxCriticalSection
*gs_critsectStringSort
= NULL
;
2455 // call this before the value of the global sort vars is changed/after
2456 // you're finished with them
2457 #define START_SORT() wxASSERT( !gs_critsectStringSort ); \
2458 gs_critsectStringSort = new wxCriticalSection; \
2459 gs_critsectStringSort->Enter()
2460 #define END_SORT() gs_critsectStringSort->Leave(); \
2461 delete gs_critsectStringSort; \
2462 gs_critsectStringSort = NULL
2464 #define START_SORT()
2466 #endif // wxUSE_THREADS
2468 // function to use for string comparaison
2469 static wxArrayString::CompareFunction gs_compareFunction
= NULL
;
2471 // if we don't use the compare function, this flag tells us if we sort the
2472 // array in ascending or descending order
2473 static bool gs_sortAscending
= true;
2475 // function which is called by quick sort
2476 extern "C" int wxC_CALLING_CONV
// LINKAGEMODE
2477 wxStringCompareFunction(const void *first
, const void *second
)
2479 wxString
*strFirst
= (wxString
*)first
;
2480 wxString
*strSecond
= (wxString
*)second
;
2482 if ( gs_compareFunction
) {
2483 return gs_compareFunction(*strFirst
, *strSecond
);
2486 // maybe we should use wxStrcoll
2487 int result
= strFirst
->Cmp(*strSecond
);
2489 return gs_sortAscending
? result
: -result
;
2493 // sort array elements using passed comparaison function
2494 void wxArrayString::Sort(CompareFunction compareFunction
)
2498 wxASSERT( !gs_compareFunction
); // must have been reset to NULL
2499 gs_compareFunction
= compareFunction
;
2503 // reset it to NULL so that Sort(bool) will work the next time
2504 gs_compareFunction
= NULL
;
2509 typedef int (wxC_CALLING_CONV
* wxStringCompareFn
)(const void *first
, const void *second
);
2511 void wxArrayString::Sort(CompareFunction2 compareFunction
)
2513 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), (wxStringCompareFn
)compareFunction
);
2516 void wxArrayString::Sort(bool reverseOrder
)
2518 Sort(reverseOrder
? wxStringSortDescending
: wxStringSortAscending
);
2521 void wxArrayString::DoSort()
2523 wxCHECK_RET( !m_autoSort
, wxT("can't use this method with sorted arrays") );
2525 // just sort the pointers using qsort() - of course it only works because
2526 // wxString() *is* a pointer to its data
2527 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), wxStringCompareFunction
);
2530 bool wxArrayString::operator==(const wxArrayString
& a
) const
2532 if ( m_nCount
!= a
.m_nCount
)
2535 for ( size_t n
= 0; n
< m_nCount
; n
++ )
2537 if ( Item(n
) != a
[n
] )
2544 #endif // !wxUSE_STL
2546 int wxCMPFUNC_CONV
wxStringSortAscending(wxString
* s1
, wxString
* s2
)
2548 return s1
->Cmp(*s2
);
2551 int wxCMPFUNC_CONV
wxStringSortDescending(wxString
* s1
, wxString
* s2
)
2553 return -s1
->Cmp(*s2
);