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 /////////////////////////////////////////////////////////////////////////////
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;
64 #ifdef wxSTD_STRING_COMPATIBILITY
65 const size_t wxString::npos
= wxSTRING_MAXLEN
;
66 #endif // wxSTD_STRING_COMPATIBILITY
68 // ----------------------------------------------------------------------------
70 // ----------------------------------------------------------------------------
72 // for an empty string, GetStringData() will return this address: this
73 // structure has the same layout as wxStringData and it's data() method will
74 // return the empty string (dummy pointer)
79 } g_strEmpty
= { {-1, 0, 0}, wxT('\0') };
81 // empty C style string: points to 'string data' byte of g_strEmpty
82 extern const wxChar WXDLLEXPORT
*wxEmptyString
= &g_strEmpty
.dummy
;
84 // ----------------------------------------------------------------------------
86 // ----------------------------------------------------------------------------
88 #if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM
90 // MS Visual C++ version 5.0 provides the new STL headers as well as the old
93 // ATTN: you can _not_ use both of these in the same program!
95 wxSTD istream
& operator>>(wxSTD istream
& is
, wxString
& WXUNUSED(str
))
100 streambuf
*sb
= is
.rdbuf();
103 int ch
= sb
->sbumpc ();
105 is
.setstate(ios::eofbit
);
108 else if ( isspace(ch
) ) {
120 if ( str
.length() == 0 )
121 is
.setstate(ios::failbit
);
126 wxSTD ostream
& operator<<(wxSTD ostream
& os
, const wxString
& str
)
132 #endif //std::string compatibility
134 // ----------------------------------------------------------------------------
136 // ----------------------------------------------------------------------------
138 // this small class is used to gather statistics for performance tuning
139 //#define WXSTRING_STATISTICS
140 #ifdef WXSTRING_STATISTICS
144 Averager(const wxChar
*sz
) { m_sz
= sz
; m_nTotal
= m_nCount
= 0; }
146 { wxPrintf("wxString: average %s = %f\n", m_sz
, ((float)m_nTotal
)/m_nCount
); }
148 void Add(size_t n
) { m_nTotal
+= n
; m_nCount
++; }
151 size_t m_nCount
, m_nTotal
;
153 } g_averageLength("allocation size"),
154 g_averageSummandLength("summand length"),
155 g_averageConcatHit("hit probability in concat"),
156 g_averageInitialLength("initial string length");
158 #define STATISTICS_ADD(av, val) g_average##av.Add(val)
160 #define STATISTICS_ADD(av, val)
161 #endif // WXSTRING_STATISTICS
163 // ===========================================================================
164 // wxStringData class deallocation
165 // ===========================================================================
167 #if defined(__VISUALC__) && defined(_MT) && !defined(_DLL)
168 # pragma message (__FILE__ ": building with Multithreaded non DLL runtime has a performance impact on wxString!")
169 void wxStringData::Free()
175 // ===========================================================================
176 // wxString class core
177 // ===========================================================================
179 // ---------------------------------------------------------------------------
181 // ---------------------------------------------------------------------------
183 // constructs string of <nLength> copies of character <ch>
184 wxString::wxString(wxChar ch
, size_t nLength
)
189 if ( !AllocBuffer(nLength
) ) {
190 wxFAIL_MSG( _T("out of memory in wxString::wxString") );
195 // memset only works on chars
196 for ( size_t n
= 0; n
< nLength
; n
++ )
199 memset(m_pchData
, ch
, nLength
);
204 // takes nLength elements of psz starting at nPos
205 void wxString::InitWith(const wxChar
*psz
, size_t nPos
, size_t nLength
)
209 // if the length is not given, assume the string to be NUL terminated
210 if ( nLength
== wxSTRING_MAXLEN
) {
211 wxASSERT_MSG( nPos
<= wxStrlen(psz
), _T("index out of bounds") );
213 nLength
= wxStrlen(psz
+ nPos
);
216 STATISTICS_ADD(InitialLength
, nLength
);
219 // trailing '\0' is written in AllocBuffer()
220 if ( !AllocBuffer(nLength
) ) {
221 wxFAIL_MSG( _T("out of memory in wxString::InitWith") );
224 memcpy(m_pchData
, psz
+ nPos
, nLength
*sizeof(wxChar
));
228 #ifdef wxSTD_STRING_COMPATIBILITY
230 // poor man's iterators are "void *" pointers
231 wxString::wxString(const void *pStart
, const void *pEnd
)
233 InitWith((const wxChar
*)pStart
, 0,
234 (const wxChar
*)pEnd
- (const wxChar
*)pStart
);
237 #endif //std::string compatibility
241 // from multibyte string
242 wxString::wxString(const char *psz
, wxMBConv
& conv
, size_t nLength
)
244 // first get the size of the buffer we need
248 // calculate the needed size ourselves or use a provide one
249 nLen
= nLength
== wxSTRING_MAXLEN
? conv
.MB2WC(NULL
, psz
, 0) : nLength
;
253 // nothing to convert
258 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
260 if ( !AllocBuffer(nLen
) )
262 wxFAIL_MSG( _T("out of memory in wxString::wxString") );
266 // MB2WC wants the buffer size, not the string length
267 if ( conv
.MB2WC(m_pchData
, psz
, nLen
+ 1) != (size_t)-1 )
272 //else: the conversion failed -- leave the string empty (what else?)
282 wxString::wxString(const wchar_t *pwz
, wxMBConv
& conv
, size_t nLength
)
284 // first get the size of the buffer we need
288 // calculate the needed size ourselves or use a provide one
289 nLen
= nLength
== wxSTRING_MAXLEN
? conv
.WC2MB(NULL
, pwz
, 0) : nLength
;
293 // nothing to convert
298 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
300 if ( !AllocBuffer(nLen
) )
302 wxFAIL_MSG( _T("out of memory in wxString::wxString") );
306 // WC2MB wants the buffer size, not the string length
307 if ( conv
.WC2MB(m_pchData
, pwz
, nLen
+ 1) != (size_t)-1 )
312 //else: the conversion failed -- leave the string empty (what else?)
317 #endif // wxUSE_WCHAR_T
319 #endif // Unicode/ANSI
321 // ---------------------------------------------------------------------------
323 // ---------------------------------------------------------------------------
325 // allocates memory needed to store a C string of length nLen
326 bool wxString::AllocBuffer(size_t nLen
)
328 // allocating 0 sized buffer doesn't make sense, all empty strings should
330 wxASSERT( nLen
> 0 );
332 // make sure that we don't overflow
333 wxASSERT( nLen
< (INT_MAX
/ sizeof(wxChar
)) -
334 (sizeof(wxStringData
) + EXTRA_ALLOC
+ 1) );
336 STATISTICS_ADD(Length
, nLen
);
339 // 1) one extra character for '\0' termination
340 // 2) sizeof(wxStringData) for housekeeping info
341 wxStringData
* pData
= (wxStringData
*)
342 malloc(sizeof(wxStringData
) + (nLen
+ EXTRA_ALLOC
+ 1)*sizeof(wxChar
));
344 if ( pData
== NULL
) {
345 // allocation failures are handled by the caller
350 pData
->nDataLength
= nLen
;
351 pData
->nAllocLength
= nLen
+ EXTRA_ALLOC
;
352 m_pchData
= pData
->data(); // data starts after wxStringData
353 m_pchData
[nLen
] = wxT('\0');
357 // must be called before changing this string
358 bool wxString::CopyBeforeWrite()
360 wxStringData
* pData
= GetStringData();
362 if ( pData
->IsShared() ) {
363 pData
->Unlock(); // memory not freed because shared
364 size_t nLen
= pData
->nDataLength
;
365 if ( !AllocBuffer(nLen
) ) {
366 // allocation failures are handled by the caller
369 memcpy(m_pchData
, pData
->data(), nLen
*sizeof(wxChar
));
372 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
377 // must be called before replacing contents of this string
378 bool wxString::AllocBeforeWrite(size_t nLen
)
380 wxASSERT( nLen
!= 0 ); // doesn't make any sense
382 // must not share string and must have enough space
383 wxStringData
* pData
= GetStringData();
384 if ( pData
->IsShared() || pData
->IsEmpty() ) {
385 // can't work with old buffer, get new one
387 if ( !AllocBuffer(nLen
) ) {
388 // allocation failures are handled by the caller
393 if ( nLen
> pData
->nAllocLength
) {
394 // realloc the buffer instead of calling malloc() again, this is more
396 STATISTICS_ADD(Length
, nLen
);
400 pData
= (wxStringData
*)
401 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
403 if ( pData
== NULL
) {
404 // allocation failures are handled by the caller
405 // keep previous data since reallocation failed
409 pData
->nAllocLength
= nLen
;
410 m_pchData
= pData
->data();
413 // now we have enough space, just update the string length
414 pData
->nDataLength
= nLen
;
417 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
422 // allocate enough memory for nLen characters
423 bool wxString::Alloc(size_t nLen
)
425 wxStringData
*pData
= GetStringData();
426 if ( pData
->nAllocLength
<= nLen
) {
427 if ( pData
->IsEmpty() ) {
430 wxStringData
* pData
= (wxStringData
*)
431 malloc(sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
433 if ( pData
== NULL
) {
434 // allocation failure handled by caller
439 pData
->nDataLength
= 0;
440 pData
->nAllocLength
= nLen
;
441 m_pchData
= pData
->data(); // data starts after wxStringData
442 m_pchData
[0u] = wxT('\0');
444 else if ( pData
->IsShared() ) {
445 pData
->Unlock(); // memory not freed because shared
446 size_t nOldLen
= pData
->nDataLength
;
447 if ( !AllocBuffer(nLen
) ) {
448 // allocation failure handled by caller
451 memcpy(m_pchData
, pData
->data(), nOldLen
*sizeof(wxChar
));
456 pData
= (wxStringData
*)
457 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
459 if ( pData
== NULL
) {
460 // allocation failure handled by caller
461 // keep previous data since reallocation failed
465 // it's not important if the pointer changed or not (the check for this
466 // is not faster than assigning to m_pchData in all cases)
467 pData
->nAllocLength
= nLen
;
468 m_pchData
= pData
->data();
471 //else: we've already got enough
475 // shrink to minimal size (releasing extra memory)
476 bool wxString::Shrink()
478 wxStringData
*pData
= GetStringData();
480 size_t nLen
= pData
->nDataLength
;
481 void *p
= realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
484 wxFAIL_MSG( _T("out of memory reallocating wxString data") );
485 // keep previous data since reallocation failed
491 // contrary to what one might believe, some realloc() implementation do
492 // move the memory block even when its size is reduced
493 pData
= (wxStringData
*)p
;
495 m_pchData
= pData
->data();
498 pData
->nAllocLength
= nLen
;
503 // get the pointer to writable buffer of (at least) nLen bytes
504 wxChar
*wxString::GetWriteBuf(size_t nLen
)
506 if ( !AllocBeforeWrite(nLen
) ) {
507 // allocation failure handled by caller
511 wxASSERT( GetStringData()->nRefs
== 1 );
512 GetStringData()->Validate(FALSE
);
517 // put string back in a reasonable state after GetWriteBuf
518 void wxString::UngetWriteBuf()
520 GetStringData()->nDataLength
= wxStrlen(m_pchData
);
521 GetStringData()->Validate(TRUE
);
524 void wxString::UngetWriteBuf(size_t nLen
)
526 GetStringData()->nDataLength
= nLen
;
527 GetStringData()->Validate(TRUE
);
530 // ---------------------------------------------------------------------------
532 // ---------------------------------------------------------------------------
534 // all functions are inline in string.h
536 // ---------------------------------------------------------------------------
537 // assignment operators
538 // ---------------------------------------------------------------------------
540 // helper function: does real copy
541 bool wxString::AssignCopy(size_t nSrcLen
, const wxChar
*pszSrcData
)
543 if ( nSrcLen
== 0 ) {
547 if ( !AllocBeforeWrite(nSrcLen
) ) {
548 // allocation failure handled by caller
551 memcpy(m_pchData
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
552 GetStringData()->nDataLength
= nSrcLen
;
553 m_pchData
[nSrcLen
] = wxT('\0');
558 // assigns one string to another
559 wxString
& wxString::operator=(const wxString
& stringSrc
)
561 wxASSERT( stringSrc
.GetStringData()->IsValid() );
563 // don't copy string over itself
564 if ( m_pchData
!= stringSrc
.m_pchData
) {
565 if ( stringSrc
.GetStringData()->IsEmpty() ) {
570 GetStringData()->Unlock();
571 m_pchData
= stringSrc
.m_pchData
;
572 GetStringData()->Lock();
579 // assigns a single character
580 wxString
& wxString::operator=(wxChar ch
)
582 if ( !AssignCopy(1, &ch
) ) {
583 wxFAIL_MSG( _T("out of memory in wxString::operator=(wxChar)") );
590 wxString
& wxString::operator=(const wxChar
*psz
)
592 if ( !AssignCopy(wxStrlen(psz
), psz
) ) {
593 wxFAIL_MSG( _T("out of memory in wxString::operator=(const wxChar *)") );
600 // same as 'signed char' variant
601 wxString
& wxString::operator=(const unsigned char* psz
)
603 *this = (const char *)psz
;
608 wxString
& wxString::operator=(const wchar_t *pwz
)
618 // ---------------------------------------------------------------------------
619 // string concatenation
620 // ---------------------------------------------------------------------------
622 // add something to this string
623 bool wxString::ConcatSelf(size_t nSrcLen
, const wxChar
*pszSrcData
)
625 STATISTICS_ADD(SummandLength
, nSrcLen
);
627 // concatenating an empty string is a NOP
629 wxStringData
*pData
= GetStringData();
630 size_t nLen
= pData
->nDataLength
;
631 size_t nNewLen
= nLen
+ nSrcLen
;
633 // alloc new buffer if current is too small
634 if ( pData
->IsShared() ) {
635 STATISTICS_ADD(ConcatHit
, 0);
637 // we have to allocate another buffer
638 wxStringData
* pOldData
= GetStringData();
639 if ( !AllocBuffer(nNewLen
) ) {
640 // allocation failure handled by caller
643 memcpy(m_pchData
, pOldData
->data(), nLen
*sizeof(wxChar
));
646 else if ( nNewLen
> pData
->nAllocLength
) {
647 STATISTICS_ADD(ConcatHit
, 0);
649 // we have to grow the buffer
650 if ( !Alloc(nNewLen
) ) {
651 // allocation failure handled by caller
656 STATISTICS_ADD(ConcatHit
, 1);
658 // the buffer is already big enough
661 // should be enough space
662 wxASSERT( nNewLen
<= GetStringData()->nAllocLength
);
664 // fast concatenation - all is done in our buffer
665 memcpy(m_pchData
+ nLen
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
667 m_pchData
[nNewLen
] = wxT('\0'); // put terminating '\0'
668 GetStringData()->nDataLength
= nNewLen
; // and fix the length
670 //else: the string to append was empty
675 * concatenation functions come in 5 flavours:
677 * char + string and string + char
678 * C str + string and string + C str
681 wxString
operator+(const wxString
& str1
, const wxString
& str2
)
683 wxASSERT( str1
.GetStringData()->IsValid() );
684 wxASSERT( str2
.GetStringData()->IsValid() );
692 wxString
operator+(const wxString
& str
, wxChar ch
)
694 wxASSERT( str
.GetStringData()->IsValid() );
702 wxString
operator+(wxChar ch
, const wxString
& str
)
704 wxASSERT( str
.GetStringData()->IsValid() );
712 wxString
operator+(const wxString
& str
, const wxChar
*psz
)
714 wxASSERT( str
.GetStringData()->IsValid() );
717 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
718 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
726 wxString
operator+(const wxChar
*psz
, const wxString
& str
)
728 wxASSERT( str
.GetStringData()->IsValid() );
731 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
732 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
740 // ===========================================================================
741 // other common string functions
742 // ===========================================================================
746 wxString
wxString::FromAscii(const char *ascii
)
749 return wxEmptyString
;
751 size_t len
= strlen( ascii
);
756 wxStringBuffer
buf(res
, len
);
762 if ( (*dest
++ = (wchar_t)(unsigned char)*ascii
++) == L
'\0' )
770 wxString
wxString::FromAscii(const char ascii
)
772 // What do we do with '\0' ?
775 res
+= (wchar_t)(unsigned char) ascii
;
780 const wxCharBuffer
wxString::ToAscii() const
782 // this will allocate enough space for the terminating NUL too
783 wxCharBuffer
buffer(length());
785 signed char *dest
= (signed char *)buffer
.data();
787 const wchar_t *pwc
= c_str();
790 *dest
++ = *pwc
> SCHAR_MAX
? '_' : *pwc
;
792 // the output string can't have embedded NULs anyhow, so we can safely
793 // stop at first of them even if we do have any
803 // ---------------------------------------------------------------------------
804 // simple sub-string extraction
805 // ---------------------------------------------------------------------------
807 // helper function: clone the data attached to this string
808 bool wxString::AllocCopy(wxString
& dest
, int nCopyLen
, int nCopyIndex
) const
810 if ( nCopyLen
== 0 ) {
814 if ( !dest
.AllocBuffer(nCopyLen
) ) {
815 // allocation failure handled by caller
818 memcpy(dest
.m_pchData
, m_pchData
+ nCopyIndex
, nCopyLen
*sizeof(wxChar
));
823 // extract string of length nCount starting at nFirst
824 wxString
wxString::Mid(size_t nFirst
, size_t nCount
) const
826 wxStringData
*pData
= GetStringData();
827 size_t nLen
= pData
->nDataLength
;
829 // default value of nCount is wxSTRING_MAXLEN and means "till the end"
830 if ( nCount
== wxSTRING_MAXLEN
)
832 nCount
= nLen
- nFirst
;
835 // out-of-bounds requests return sensible things
836 if ( nFirst
+ nCount
> nLen
)
838 nCount
= nLen
- nFirst
;
843 // AllocCopy() will return empty string
848 if ( !AllocCopy(dest
, nCount
, nFirst
) ) {
849 wxFAIL_MSG( _T("out of memory in wxString::Mid") );
855 // check that the tring starts with prefix and return the rest of the string
856 // in the provided pointer if it is not NULL, otherwise return FALSE
857 bool wxString::StartsWith(const wxChar
*prefix
, wxString
*rest
) const
859 wxASSERT_MSG( prefix
, _T("invalid parameter in wxString::StartsWith") );
861 // first check if the beginning of the string matches the prefix: note
862 // that we don't have to check that we don't run out of this string as
863 // when we reach the terminating NUL, either prefix string ends too (and
864 // then it's ok) or we break out of the loop because there is no match
865 const wxChar
*p
= c_str();
868 if ( *prefix
++ != *p
++ )
877 // put the rest of the string into provided pointer
884 // extract nCount last (rightmost) characters
885 wxString
wxString::Right(size_t nCount
) const
887 if ( nCount
> (size_t)GetStringData()->nDataLength
)
888 nCount
= GetStringData()->nDataLength
;
891 if ( !AllocCopy(dest
, nCount
, GetStringData()->nDataLength
- nCount
) ) {
892 wxFAIL_MSG( _T("out of memory in wxString::Right") );
897 // get all characters after the last occurence of ch
898 // (returns the whole string if ch not found)
899 wxString
wxString::AfterLast(wxChar ch
) const
902 int iPos
= Find(ch
, TRUE
);
903 if ( iPos
== wxNOT_FOUND
)
906 str
= c_str() + iPos
+ 1;
911 // extract nCount first (leftmost) characters
912 wxString
wxString::Left(size_t nCount
) const
914 if ( nCount
> (size_t)GetStringData()->nDataLength
)
915 nCount
= GetStringData()->nDataLength
;
918 if ( !AllocCopy(dest
, nCount
, 0) ) {
919 wxFAIL_MSG( _T("out of memory in wxString::Left") );
924 // get all characters before the first occurence of ch
925 // (returns the whole string if ch not found)
926 wxString
wxString::BeforeFirst(wxChar ch
) const
929 for ( const wxChar
*pc
= m_pchData
; *pc
!= wxT('\0') && *pc
!= ch
; pc
++ )
935 /// get all characters before the last occurence of ch
936 /// (returns empty string if ch not found)
937 wxString
wxString::BeforeLast(wxChar ch
) const
940 int iPos
= Find(ch
, TRUE
);
941 if ( iPos
!= wxNOT_FOUND
&& iPos
!= 0 )
942 str
= wxString(c_str(), iPos
);
947 /// get all characters after the first occurence of ch
948 /// (returns empty string if ch not found)
949 wxString
wxString::AfterFirst(wxChar ch
) const
953 if ( iPos
!= wxNOT_FOUND
)
954 str
= c_str() + iPos
+ 1;
959 // replace first (or all) occurences of some substring with another one
960 size_t wxString::Replace(const wxChar
*szOld
, const wxChar
*szNew
, bool bReplaceAll
)
962 size_t uiCount
= 0; // count of replacements made
964 size_t uiOldLen
= wxStrlen(szOld
);
967 const wxChar
*pCurrent
= m_pchData
;
968 const wxChar
*pSubstr
;
969 while ( *pCurrent
!= wxT('\0') ) {
970 pSubstr
= wxStrstr(pCurrent
, szOld
);
971 if ( pSubstr
== NULL
) {
972 // strTemp is unused if no replacements were made, so avoid the copy
976 strTemp
+= pCurrent
; // copy the rest
977 break; // exit the loop
980 // take chars before match
981 if ( !strTemp
.ConcatSelf(pSubstr
- pCurrent
, pCurrent
) ) {
982 wxFAIL_MSG( _T("out of memory in wxString::Replace") );
986 pCurrent
= pSubstr
+ uiOldLen
; // restart after match
991 if ( !bReplaceAll
) {
992 strTemp
+= pCurrent
; // copy the rest
993 break; // exit the loop
998 // only done if there were replacements, otherwise would have returned above
1004 bool wxString::IsAscii() const
1006 const wxChar
*s
= (const wxChar
*) *this;
1008 if(!isascii(*s
)) return(FALSE
);
1014 bool wxString::IsWord() const
1016 const wxChar
*s
= (const wxChar
*) *this;
1018 if(!wxIsalpha(*s
)) return(FALSE
);
1024 bool wxString::IsNumber() const
1026 const wxChar
*s
= (const wxChar
*) *this;
1028 if ((s
[0] == '-') || (s
[0] == '+')) s
++;
1030 if(!wxIsdigit(*s
)) return(FALSE
);
1036 wxString
wxString::Strip(stripType w
) const
1039 if ( w
& leading
) s
.Trim(FALSE
);
1040 if ( w
& trailing
) s
.Trim(TRUE
);
1044 // ---------------------------------------------------------------------------
1046 // ---------------------------------------------------------------------------
1048 wxString
& wxString::MakeUpper()
1050 if ( !CopyBeforeWrite() ) {
1051 wxFAIL_MSG( _T("out of memory in wxString::MakeUpper") );
1055 for ( wxChar
*p
= m_pchData
; *p
; p
++ )
1056 *p
= (wxChar
)wxToupper(*p
);
1061 wxString
& wxString::MakeLower()
1063 if ( !CopyBeforeWrite() ) {
1064 wxFAIL_MSG( _T("out of memory in wxString::MakeLower") );
1068 for ( wxChar
*p
= m_pchData
; *p
; p
++ )
1069 *p
= (wxChar
)wxTolower(*p
);
1074 // ---------------------------------------------------------------------------
1075 // trimming and padding
1076 // ---------------------------------------------------------------------------
1078 // some compilers (VC++ 6.0 not to name them) return TRUE for a call to
1079 // isspace('ê') in the C locale which seems to be broken to me, but we have to
1080 // live with this by checking that the character is a 7 bit one - even if this
1081 // may fail to detect some spaces (I don't know if Unicode doesn't have
1082 // space-like symbols somewhere except in the first 128 chars), it is arguably
1083 // still better than trimming away accented letters
1084 inline int wxSafeIsspace(wxChar ch
) { return (ch
< 127) && wxIsspace(ch
); }
1086 // trims spaces (in the sense of isspace) from left or right side
1087 wxString
& wxString::Trim(bool bFromRight
)
1089 // first check if we're going to modify the string at all
1092 (bFromRight
&& wxSafeIsspace(GetChar(Len() - 1))) ||
1093 (!bFromRight
&& wxSafeIsspace(GetChar(0u)))
1097 // ok, there is at least one space to trim
1098 if ( !CopyBeforeWrite() ) {
1099 wxFAIL_MSG( _T("out of memory in wxString::Trim") );
1105 // find last non-space character
1106 wxChar
*psz
= m_pchData
+ GetStringData()->nDataLength
- 1;
1107 while ( wxSafeIsspace(*psz
) && (psz
>= m_pchData
) )
1110 // truncate at trailing space start
1112 GetStringData()->nDataLength
= psz
- m_pchData
;
1116 // find first non-space character
1117 const wxChar
*psz
= m_pchData
;
1118 while ( wxSafeIsspace(*psz
) )
1121 // fix up data and length
1122 int nDataLength
= GetStringData()->nDataLength
- (psz
- (const wxChar
*) m_pchData
);
1123 memmove(m_pchData
, psz
, (nDataLength
+ 1)*sizeof(wxChar
));
1124 GetStringData()->nDataLength
= nDataLength
;
1131 // adds nCount characters chPad to the string from either side
1132 wxString
& wxString::Pad(size_t nCount
, wxChar chPad
, bool bFromRight
)
1134 wxString
s(chPad
, nCount
);
1147 // truncate the string
1148 wxString
& wxString::Truncate(size_t uiLen
)
1150 if ( uiLen
< Len() ) {
1151 if ( !CopyBeforeWrite() ) {
1152 wxFAIL_MSG( _T("out of memory in wxString::Truncate") );
1156 *(m_pchData
+ uiLen
) = wxT('\0');
1157 GetStringData()->nDataLength
= uiLen
;
1159 //else: nothing to do, string is already short enough
1164 // ---------------------------------------------------------------------------
1165 // finding (return wxNOT_FOUND if not found and index otherwise)
1166 // ---------------------------------------------------------------------------
1169 int wxString::Find(wxChar ch
, bool bFromEnd
) const
1171 const wxChar
*psz
= bFromEnd
? wxStrrchr(m_pchData
, ch
) : wxStrchr(m_pchData
, ch
);
1173 return (psz
== NULL
) ? wxNOT_FOUND
: psz
- (const wxChar
*) m_pchData
;
1176 // find a sub-string (like strstr)
1177 int wxString::Find(const wxChar
*pszSub
) const
1179 const wxChar
*psz
= wxStrstr(m_pchData
, pszSub
);
1181 return (psz
== NULL
) ? wxNOT_FOUND
: psz
- (const wxChar
*) m_pchData
;
1184 // ----------------------------------------------------------------------------
1185 // conversion to numbers
1186 // ----------------------------------------------------------------------------
1188 bool wxString::ToLong(long *val
, int base
) const
1190 wxCHECK_MSG( val
, FALSE
, _T("NULL pointer in wxString::ToLong") );
1191 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1193 const wxChar
*start
= c_str();
1195 *val
= wxStrtol(start
, &end
, base
);
1197 // return TRUE only if scan was stopped by the terminating NUL and if the
1198 // string was not empty to start with
1199 return !*end
&& (end
!= start
);
1202 bool wxString::ToULong(unsigned long *val
, int base
) const
1204 wxCHECK_MSG( val
, FALSE
, _T("NULL pointer in wxString::ToULong") );
1205 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1207 const wxChar
*start
= c_str();
1209 *val
= wxStrtoul(start
, &end
, base
);
1211 // return TRUE only if scan was stopped by the terminating NUL and if the
1212 // string was not empty to start with
1213 return !*end
&& (end
!= start
);
1216 bool wxString::ToDouble(double *val
) const
1218 wxCHECK_MSG( val
, FALSE
, _T("NULL pointer in wxString::ToDouble") );
1220 const wxChar
*start
= c_str();
1222 *val
= wxStrtod(start
, &end
);
1224 // return TRUE only if scan was stopped by the terminating NUL and if the
1225 // string was not empty to start with
1226 return !*end
&& (end
!= start
);
1229 // ---------------------------------------------------------------------------
1231 // ---------------------------------------------------------------------------
1234 wxString
wxString::Format(const wxChar
*pszFormat
, ...)
1237 va_start(argptr
, pszFormat
);
1240 s
.PrintfV(pszFormat
, argptr
);
1248 wxString
wxString::FormatV(const wxChar
*pszFormat
, va_list argptr
)
1251 s
.PrintfV(pszFormat
, argptr
);
1255 int wxString::Printf(const wxChar
*pszFormat
, ...)
1258 va_start(argptr
, pszFormat
);
1260 int iLen
= PrintfV(pszFormat
, argptr
);
1267 int wxString::PrintfV(const wxChar
* pszFormat
, va_list argptr
)
1272 wxChar
*buf
= GetWriteBuf(size
+ 1);
1279 int len
= wxVsnprintf(buf
, size
, pszFormat
, argptr
);
1281 // some implementations of vsnprintf() don't NUL terminate the string
1282 // if there is not enough space for it so always do it manually
1283 buf
[size
] = _T('\0');
1289 // ok, there was enough space
1293 // still not enough, double it again
1297 // we could have overshot
1303 // ----------------------------------------------------------------------------
1304 // misc other operations
1305 // ----------------------------------------------------------------------------
1307 // returns TRUE if the string matches the pattern which may contain '*' and
1308 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1310 bool wxString::Matches(const wxChar
*pszMask
) const
1312 // I disable this code as it doesn't seem to be faster (in fact, it seems
1313 // to be much slower) than the old, hand-written code below and using it
1314 // here requires always linking with libregex even if the user code doesn't
1316 #if 0 // wxUSE_REGEX
1317 // first translate the shell-like mask into a regex
1319 pattern
.reserve(wxStrlen(pszMask
));
1331 pattern
+= _T(".*");
1342 // these characters are special in a RE, quote them
1343 // (however note that we don't quote '[' and ']' to allow
1344 // using them for Unix shell like matching)
1345 pattern
+= _T('\\');
1349 pattern
+= *pszMask
;
1357 return wxRegEx(pattern
, wxRE_NOSUB
| wxRE_EXTENDED
).Matches(c_str());
1358 #else // !wxUSE_REGEX
1359 // TODO: this is, of course, awfully inefficient...
1361 // the char currently being checked
1362 const wxChar
*pszTxt
= c_str();
1364 // the last location where '*' matched
1365 const wxChar
*pszLastStarInText
= NULL
;
1366 const wxChar
*pszLastStarInMask
= NULL
;
1369 for ( ; *pszMask
!= wxT('\0'); pszMask
++, pszTxt
++ ) {
1370 switch ( *pszMask
) {
1372 if ( *pszTxt
== wxT('\0') )
1375 // pszTxt and pszMask will be incremented in the loop statement
1381 // remember where we started to be able to backtrack later
1382 pszLastStarInText
= pszTxt
;
1383 pszLastStarInMask
= pszMask
;
1385 // ignore special chars immediately following this one
1386 // (should this be an error?)
1387 while ( *pszMask
== wxT('*') || *pszMask
== wxT('?') )
1390 // if there is nothing more, match
1391 if ( *pszMask
== wxT('\0') )
1394 // are there any other metacharacters in the mask?
1396 const wxChar
*pEndMask
= wxStrpbrk(pszMask
, wxT("*?"));
1398 if ( pEndMask
!= NULL
) {
1399 // we have to match the string between two metachars
1400 uiLenMask
= pEndMask
- pszMask
;
1403 // we have to match the remainder of the string
1404 uiLenMask
= wxStrlen(pszMask
);
1407 wxString
strToMatch(pszMask
, uiLenMask
);
1408 const wxChar
* pMatch
= wxStrstr(pszTxt
, strToMatch
);
1409 if ( pMatch
== NULL
)
1412 // -1 to compensate "++" in the loop
1413 pszTxt
= pMatch
+ uiLenMask
- 1;
1414 pszMask
+= uiLenMask
- 1;
1419 if ( *pszMask
!= *pszTxt
)
1425 // match only if nothing left
1426 if ( *pszTxt
== wxT('\0') )
1429 // if we failed to match, backtrack if we can
1430 if ( pszLastStarInText
) {
1431 pszTxt
= pszLastStarInText
+ 1;
1432 pszMask
= pszLastStarInMask
;
1434 pszLastStarInText
= NULL
;
1436 // don't bother resetting pszLastStarInMask, it's unnecessary
1442 #endif // wxUSE_REGEX/!wxUSE_REGEX
1445 // Count the number of chars
1446 int wxString::Freq(wxChar ch
) const
1450 for (int i
= 0; i
< len
; i
++)
1452 if (GetChar(i
) == ch
)
1458 // convert to upper case, return the copy of the string
1459 wxString
wxString::Upper() const
1460 { wxString
s(*this); return s
.MakeUpper(); }
1462 // convert to lower case, return the copy of the string
1463 wxString
wxString::Lower() const { wxString
s(*this); return s
.MakeLower(); }
1465 int wxString::sprintf(const wxChar
*pszFormat
, ...)
1468 va_start(argptr
, pszFormat
);
1469 int iLen
= PrintfV(pszFormat
, argptr
);
1474 // ---------------------------------------------------------------------------
1475 // standard C++ library string functions
1476 // ---------------------------------------------------------------------------
1478 #ifdef wxSTD_STRING_COMPATIBILITY
1480 void wxString::resize(size_t nSize
, wxChar ch
)
1482 size_t len
= length();
1488 else if ( nSize
> len
)
1490 *this += wxString(ch
, nSize
- len
);
1492 //else: we have exactly the specified length, nothing to do
1495 void wxString::swap(wxString
& str
)
1497 // this is slightly less efficient than fiddling with m_pchData directly,
1498 // but it is still quite efficient as we don't copy the string here because
1499 // ref count always stays positive
1505 wxString
& wxString::insert(size_t nPos
, const wxString
& str
)
1507 wxASSERT( str
.GetStringData()->IsValid() );
1508 wxASSERT( nPos
<= Len() );
1510 if ( !str
.IsEmpty() ) {
1512 wxChar
*pc
= strTmp
.GetWriteBuf(Len() + str
.Len());
1513 wxStrncpy(pc
, c_str(), nPos
);
1514 wxStrcpy(pc
+ nPos
, str
);
1515 wxStrcpy(pc
+ nPos
+ str
.Len(), c_str() + nPos
);
1516 strTmp
.UngetWriteBuf();
1523 size_t wxString::find(const wxString
& str
, size_t nStart
) const
1525 wxASSERT( str
.GetStringData()->IsValid() );
1526 wxASSERT( nStart
<= Len() );
1528 const wxChar
*p
= wxStrstr(c_str() + nStart
, str
);
1530 return p
== NULL
? npos
: p
- c_str();
1533 // VC++ 1.5 can't cope with the default argument in the header.
1534 #if !defined(__VISUALC__) || defined(__WIN32__)
1535 size_t wxString::find(const wxChar
* sz
, size_t nStart
, size_t n
) const
1537 return find(wxString(sz
, n
), nStart
);
1541 // Gives a duplicate symbol (presumably a case-insensitivity problem)
1542 #if !defined(__BORLANDC__)
1543 size_t wxString::find(wxChar ch
, size_t nStart
) const
1545 wxASSERT( nStart
<= Len() );
1547 const wxChar
*p
= wxStrchr(c_str() + nStart
, ch
);
1549 return p
== NULL
? npos
: p
- c_str();
1553 size_t wxString::rfind(const wxString
& str
, size_t nStart
) const
1555 wxASSERT( str
.GetStringData()->IsValid() );
1556 wxASSERT( nStart
== npos
|| nStart
<= Len() );
1558 // TODO could be made much quicker than that
1559 const wxChar
*p
= c_str() + (nStart
== npos
? Len() : nStart
);
1560 while ( p
>= c_str() + str
.Len() ) {
1561 if ( wxStrncmp(p
- str
.Len(), str
, str
.Len()) == 0 )
1562 return p
- str
.Len() - c_str();
1569 // VC++ 1.5 can't cope with the default argument in the header.
1570 #if !defined(__VISUALC__) || defined(__WIN32__)
1571 size_t wxString::rfind(const wxChar
* sz
, size_t nStart
, size_t n
) const
1573 return rfind(wxString(sz
, n
== npos
? wxSTRING_MAXLEN
: n
), nStart
);
1576 size_t wxString::rfind(wxChar ch
, size_t nStart
) const
1578 if ( nStart
== npos
)
1584 wxASSERT( nStart
<= Len() );
1587 const wxChar
*p
= wxStrrchr(c_str(), ch
);
1592 size_t result
= p
- c_str();
1593 return ( result
> nStart
) ? npos
: result
;
1597 size_t wxString::find_first_of(const wxChar
* sz
, size_t nStart
) const
1599 const wxChar
*start
= c_str() + nStart
;
1600 const wxChar
*firstOf
= wxStrpbrk(start
, sz
);
1602 return firstOf
- c_str();
1607 size_t wxString::find_last_of(const wxChar
* sz
, size_t nStart
) const
1609 if ( nStart
== npos
)
1615 wxASSERT( nStart
<= Len() );
1618 for ( const wxChar
*p
= c_str() + length() - 1; p
>= c_str(); p
-- )
1620 if ( wxStrchr(sz
, *p
) )
1627 size_t wxString::find_first_not_of(const wxChar
* sz
, size_t nStart
) const
1629 if ( nStart
== npos
)
1635 wxASSERT( nStart
<= Len() );
1638 size_t nAccept
= wxStrspn(c_str() + nStart
, sz
);
1639 if ( nAccept
>= length() - nStart
)
1645 size_t wxString::find_first_not_of(wxChar ch
, size_t nStart
) const
1647 wxASSERT( nStart
<= Len() );
1649 for ( const wxChar
*p
= c_str() + nStart
; *p
; p
++ )
1658 size_t wxString::find_last_not_of(const wxChar
* sz
, size_t nStart
) const
1660 if ( nStart
== npos
)
1666 wxASSERT( nStart
<= Len() );
1669 for ( const wxChar
*p
= c_str() + nStart
- 1; p
>= c_str(); p
-- )
1671 if ( !wxStrchr(sz
, *p
) )
1678 size_t wxString::find_last_not_of(wxChar ch
, size_t nStart
) const
1680 if ( nStart
== npos
)
1686 wxASSERT( nStart
<= Len() );
1689 for ( const wxChar
*p
= c_str() + nStart
- 1; p
>= c_str(); p
-- )
1698 wxString
& wxString::erase(size_t nStart
, size_t nLen
)
1700 wxString
strTmp(c_str(), nStart
);
1701 if ( nLen
!= npos
) {
1702 wxASSERT( nStart
+ nLen
<= Len() );
1704 strTmp
.append(c_str() + nStart
+ nLen
);
1711 wxString
& wxString::replace(size_t nStart
, size_t nLen
, const wxChar
*sz
)
1713 wxASSERT_MSG( nStart
+ nLen
<= Len(),
1714 _T("index out of bounds in wxString::replace") );
1717 strTmp
.Alloc(Len()); // micro optimisation to avoid multiple mem allocs
1720 strTmp
.append(c_str(), nStart
);
1721 strTmp
<< sz
<< c_str() + nStart
+ nLen
;
1727 wxString
& wxString::replace(size_t nStart
, size_t nLen
, size_t nCount
, wxChar ch
)
1729 return replace(nStart
, nLen
, wxString(ch
, nCount
));
1732 wxString
& wxString::replace(size_t nStart
, size_t nLen
,
1733 const wxString
& str
, size_t nStart2
, size_t nLen2
)
1735 return replace(nStart
, nLen
, str
.substr(nStart2
, nLen2
));
1738 wxString
& wxString::replace(size_t nStart
, size_t nLen
,
1739 const wxChar
* sz
, size_t nCount
)
1741 return replace(nStart
, nLen
, wxString(sz
, nCount
));
1744 #endif //std::string compatibility
1746 // ============================================================================
1748 // ============================================================================
1750 // size increment = min(50% of current size, ARRAY_MAXSIZE_INCREMENT)
1751 #define ARRAY_MAXSIZE_INCREMENT 4096
1753 #ifndef ARRAY_DEFAULT_INITIAL_SIZE // also defined in dynarray.h
1754 #define ARRAY_DEFAULT_INITIAL_SIZE (16)
1757 #define STRING(p) ((wxString *)(&(p)))
1760 void wxArrayString::Init(bool autoSort
)
1764 m_pItems
= (wxChar
**) NULL
;
1765 m_autoSort
= autoSort
;
1769 wxArrayString::wxArrayString(const wxArrayString
& src
)
1771 Init(src
.m_autoSort
);
1776 // assignment operator
1777 wxArrayString
& wxArrayString::operator=(const wxArrayString
& src
)
1784 m_autoSort
= src
.m_autoSort
;
1789 void wxArrayString::Copy(const wxArrayString
& src
)
1791 if ( src
.m_nCount
> ARRAY_DEFAULT_INITIAL_SIZE
)
1792 Alloc(src
.m_nCount
);
1794 for ( size_t n
= 0; n
< src
.m_nCount
; n
++ )
1799 void wxArrayString::Grow(size_t nIncrement
)
1801 // only do it if no more place
1802 if ( (m_nSize
- m_nCount
) < nIncrement
) {
1803 // if ARRAY_DEFAULT_INITIAL_SIZE were set to 0, the initially empty would
1804 // be never resized!
1805 #if ARRAY_DEFAULT_INITIAL_SIZE == 0
1806 #error "ARRAY_DEFAULT_INITIAL_SIZE must be > 0!"
1809 if ( m_nSize
== 0 ) {
1810 // was empty, alloc some memory
1811 m_nSize
= ARRAY_DEFAULT_INITIAL_SIZE
;
1812 if (m_nSize
< nIncrement
)
1813 m_nSize
= nIncrement
;
1814 m_pItems
= new wxChar
*[m_nSize
];
1817 // otherwise when it's called for the first time, nIncrement would be 0
1818 // and the array would never be expanded
1819 // add 50% but not too much
1820 size_t ndefIncrement
= m_nSize
< ARRAY_DEFAULT_INITIAL_SIZE
1821 ? ARRAY_DEFAULT_INITIAL_SIZE
: m_nSize
>> 1;
1822 if ( ndefIncrement
> ARRAY_MAXSIZE_INCREMENT
)
1823 ndefIncrement
= ARRAY_MAXSIZE_INCREMENT
;
1824 if ( nIncrement
< ndefIncrement
)
1825 nIncrement
= ndefIncrement
;
1826 m_nSize
+= nIncrement
;
1827 wxChar
**pNew
= new wxChar
*[m_nSize
];
1829 // copy data to new location
1830 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
1832 // delete old memory (but do not release the strings!)
1833 wxDELETEA(m_pItems
);
1840 void wxArrayString::Free()
1842 for ( size_t n
= 0; n
< m_nCount
; n
++ ) {
1843 STRING(m_pItems
[n
])->GetStringData()->Unlock();
1847 // deletes all the strings from the list
1848 void wxArrayString::Empty()
1855 // as Empty, but also frees memory
1856 void wxArrayString::Clear()
1863 wxDELETEA(m_pItems
);
1867 wxArrayString::~wxArrayString()
1871 wxDELETEA(m_pItems
);
1874 // pre-allocates memory (frees the previous data!)
1875 void wxArrayString::Alloc(size_t nSize
)
1877 // only if old buffer was not big enough
1878 if ( nSize
> m_nSize
) {
1880 wxDELETEA(m_pItems
);
1881 m_pItems
= new wxChar
*[nSize
];
1888 // minimizes the memory usage by freeing unused memory
1889 void wxArrayString::Shrink()
1891 // only do it if we have some memory to free
1892 if( m_nCount
< m_nSize
) {
1893 // allocates exactly as much memory as we need
1894 wxChar
**pNew
= new wxChar
*[m_nCount
];
1896 // copy data to new location
1897 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
1903 // return a wxString[] as required for some control ctors.
1904 wxString
* wxArrayString::GetStringArray() const
1906 wxString
*array
= 0;
1910 array
= new wxString
[m_nCount
];
1911 for( size_t i
= 0; i
< m_nCount
; i
++ )
1912 array
[i
] = m_pItems
[i
];
1918 // searches the array for an item (forward or backwards)
1919 int wxArrayString::Index(const wxChar
*sz
, bool bCase
, bool bFromEnd
) const
1922 // use binary search in the sorted array
1923 wxASSERT_MSG( bCase
&& !bFromEnd
,
1924 wxT("search parameters ignored for auto sorted array") );
1933 res
= wxStrcmp(sz
, m_pItems
[i
]);
1945 // use linear search in unsorted array
1947 if ( m_nCount
> 0 ) {
1948 size_t ui
= m_nCount
;
1950 if ( STRING(m_pItems
[--ui
])->IsSameAs(sz
, bCase
) )
1957 for( size_t ui
= 0; ui
< m_nCount
; ui
++ ) {
1958 if( STRING(m_pItems
[ui
])->IsSameAs(sz
, bCase
) )
1967 // add item at the end
1968 size_t wxArrayString::Add(const wxString
& str
, size_t nInsert
)
1971 // insert the string at the correct position to keep the array sorted
1979 res
= wxStrcmp(str
, m_pItems
[i
]);
1990 wxASSERT_MSG( lo
== hi
, wxT("binary search broken") );
1992 Insert(str
, lo
, nInsert
);
1997 wxASSERT( str
.GetStringData()->IsValid() );
2001 for (size_t i
= 0; i
< nInsert
; i
++)
2003 // the string data must not be deleted!
2004 str
.GetStringData()->Lock();
2007 m_pItems
[m_nCount
+ i
] = (wxChar
*)str
.c_str(); // const_cast
2009 size_t ret
= m_nCount
;
2010 m_nCount
+= nInsert
;
2015 // add item at the given position
2016 void wxArrayString::Insert(const wxString
& str
, size_t nIndex
, size_t nInsert
)
2018 wxASSERT( str
.GetStringData()->IsValid() );
2020 wxCHECK_RET( nIndex
<= m_nCount
, wxT("bad index in wxArrayString::Insert") );
2021 wxCHECK_RET( m_nCount
<= m_nCount
+ nInsert
,
2022 wxT("array size overflow in wxArrayString::Insert") );
2026 memmove(&m_pItems
[nIndex
+ nInsert
], &m_pItems
[nIndex
],
2027 (m_nCount
- nIndex
)*sizeof(wxChar
*));
2029 for (size_t i
= 0; i
< nInsert
; i
++)
2031 str
.GetStringData()->Lock();
2032 m_pItems
[nIndex
+ i
] = (wxChar
*)str
.c_str();
2034 m_nCount
+= nInsert
;
2038 void wxArrayString::SetCount(size_t count
)
2043 while ( m_nCount
< count
)
2044 m_pItems
[m_nCount
++] = (wxChar
*)s
.c_str();
2047 // removes item from array (by index)
2048 void wxArrayString::Remove(size_t nIndex
, size_t nRemove
)
2050 wxCHECK_RET( nIndex
< m_nCount
, wxT("bad index in wxArrayString::Remove") );
2051 wxCHECK_RET( nIndex
+ nRemove
<= m_nCount
,
2052 wxT("removing too many elements in wxArrayString::Remove") );
2055 for (size_t i
= 0; i
< nRemove
; i
++)
2056 Item(nIndex
+ i
).GetStringData()->Unlock();
2058 memmove(&m_pItems
[nIndex
], &m_pItems
[nIndex
+ nRemove
],
2059 (m_nCount
- nIndex
- nRemove
)*sizeof(wxChar
*));
2060 m_nCount
-= nRemove
;
2063 // removes item from array (by value)
2064 void wxArrayString::Remove(const wxChar
*sz
)
2066 int iIndex
= Index(sz
);
2068 wxCHECK_RET( iIndex
!= wxNOT_FOUND
,
2069 wxT("removing inexistent element in wxArrayString::Remove") );
2074 // ----------------------------------------------------------------------------
2076 // ----------------------------------------------------------------------------
2078 // we can only sort one array at a time with the quick-sort based
2081 // need a critical section to protect access to gs_compareFunction and
2082 // gs_sortAscending variables
2083 static wxCriticalSection
*gs_critsectStringSort
= NULL
;
2085 // call this before the value of the global sort vars is changed/after
2086 // you're finished with them
2087 #define START_SORT() wxASSERT( !gs_critsectStringSort ); \
2088 gs_critsectStringSort = new wxCriticalSection; \
2089 gs_critsectStringSort->Enter()
2090 #define END_SORT() gs_critsectStringSort->Leave(); \
2091 delete gs_critsectStringSort; \
2092 gs_critsectStringSort = NULL
2094 #define START_SORT()
2096 #endif // wxUSE_THREADS
2098 // function to use for string comparaison
2099 static wxArrayString::CompareFunction gs_compareFunction
= NULL
;
2101 // if we don't use the compare function, this flag tells us if we sort the
2102 // array in ascending or descending order
2103 static bool gs_sortAscending
= TRUE
;
2105 // function which is called by quick sort
2106 extern "C" int wxC_CALLING_CONV
// LINKAGEMODE
2107 wxStringCompareFunction(const void *first
, const void *second
)
2109 wxString
*strFirst
= (wxString
*)first
;
2110 wxString
*strSecond
= (wxString
*)second
;
2112 if ( gs_compareFunction
) {
2113 return gs_compareFunction(*strFirst
, *strSecond
);
2116 // maybe we should use wxStrcoll
2117 int result
= wxStrcmp(strFirst
->c_str(), strSecond
->c_str());
2119 return gs_sortAscending
? result
: -result
;
2123 // sort array elements using passed comparaison function
2124 void wxArrayString::Sort(CompareFunction compareFunction
)
2128 wxASSERT( !gs_compareFunction
); // must have been reset to NULL
2129 gs_compareFunction
= compareFunction
;
2133 // reset it to NULL so that Sort(bool) will work the next time
2134 gs_compareFunction
= NULL
;
2139 void wxArrayString::Sort(bool reverseOrder
)
2143 wxASSERT( !gs_compareFunction
); // must have been reset to NULL
2144 gs_sortAscending
= !reverseOrder
;
2151 void wxArrayString::DoSort()
2153 wxCHECK_RET( !m_autoSort
, wxT("can't use this method with sorted arrays") );
2155 // just sort the pointers using qsort() - of course it only works because
2156 // wxString() *is* a pointer to its data
2157 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), wxStringCompareFunction
);
2160 bool wxArrayString::operator==(const wxArrayString
& a
) const
2162 if ( m_nCount
!= a
.m_nCount
)
2165 for ( size_t n
= 0; n
< m_nCount
; n
++ )
2167 if ( Item(n
) != a
[n
] )