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 memcpy(m_pchData
, psz
+ nPos
, nLength
*sizeof(wxChar
));
215 // poor man's iterators are "void *" pointers
216 wxStringBase::wxStringBase(const void *pStart
, const void *pEnd
)
218 InitWith((const wxChar
*)pStart
, 0,
219 (const wxChar
*)pEnd
- (const wxChar
*)pStart
);
222 wxStringBase::wxStringBase(size_type n
, wxChar ch
)
228 // ---------------------------------------------------------------------------
230 // ---------------------------------------------------------------------------
232 // allocates memory needed to store a C string of length nLen
233 bool wxStringBase::AllocBuffer(size_t nLen
)
235 // allocating 0 sized buffer doesn't make sense, all empty strings should
237 wxASSERT( nLen
> 0 );
239 // make sure that we don't overflow
240 wxASSERT( nLen
< (INT_MAX
/ sizeof(wxChar
)) -
241 (sizeof(wxStringData
) + EXTRA_ALLOC
+ 1) );
243 STATISTICS_ADD(Length
, nLen
);
246 // 1) one extra character for '\0' termination
247 // 2) sizeof(wxStringData) for housekeeping info
248 wxStringData
* pData
= (wxStringData
*)
249 malloc(sizeof(wxStringData
) + (nLen
+ EXTRA_ALLOC
+ 1)*sizeof(wxChar
));
251 if ( pData
== NULL
) {
252 // allocation failures are handled by the caller
257 pData
->nDataLength
= nLen
;
258 pData
->nAllocLength
= nLen
+ EXTRA_ALLOC
;
259 m_pchData
= pData
->data(); // data starts after wxStringData
260 m_pchData
[nLen
] = wxT('\0');
264 // must be called before changing this string
265 bool wxStringBase::CopyBeforeWrite()
267 wxStringData
* pData
= GetStringData();
269 if ( pData
->IsShared() ) {
270 pData
->Unlock(); // memory not freed because shared
271 size_t nLen
= pData
->nDataLength
;
272 if ( !AllocBuffer(nLen
) ) {
273 // allocation failures are handled by the caller
276 memcpy(m_pchData
, pData
->data(), nLen
*sizeof(wxChar
));
279 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
284 // must be called before replacing contents of this string
285 bool wxStringBase::AllocBeforeWrite(size_t nLen
)
287 wxASSERT( nLen
!= 0 ); // doesn't make any sense
289 // must not share string and must have enough space
290 wxStringData
* pData
= GetStringData();
291 if ( pData
->IsShared() || pData
->IsEmpty() ) {
292 // can't work with old buffer, get new one
294 if ( !AllocBuffer(nLen
) ) {
295 // allocation failures are handled by the caller
300 if ( nLen
> pData
->nAllocLength
) {
301 // realloc the buffer instead of calling malloc() again, this is more
303 STATISTICS_ADD(Length
, nLen
);
307 pData
= (wxStringData
*)
308 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
310 if ( pData
== NULL
) {
311 // allocation failures are handled by the caller
312 // keep previous data since reallocation failed
316 pData
->nAllocLength
= nLen
;
317 m_pchData
= pData
->data();
320 // now we have enough space, just update the string length
321 pData
->nDataLength
= nLen
;
324 wxASSERT( !GetStringData()->IsShared() ); // we must be the only owner
329 wxStringBase
& wxStringBase::append(size_t n
, wxChar ch
)
331 size_type len
= length();
333 if ( !CopyBeforeWrite() || !Alloc(len
+ n
) ) {
334 wxFAIL_MSG( _T("out of memory in wxStringBase::append") );
336 GetStringData()->nDataLength
= len
+ n
;
337 m_pchData
[len
+ n
] = '\0';
338 for ( size_t i
= 0; i
< n
; ++i
)
339 m_pchData
[len
+ i
] = ch
;
343 void wxStringBase::resize(size_t nSize
, wxChar ch
)
345 size_t len
= length();
349 erase(begin() + nSize
, end());
351 else if ( nSize
> len
)
353 append(nSize
- len
, ch
);
355 //else: we have exactly the specified length, nothing to do
358 // allocate enough memory for nLen characters
359 bool wxStringBase::Alloc(size_t nLen
)
361 wxStringData
*pData
= GetStringData();
362 if ( pData
->nAllocLength
<= nLen
) {
363 if ( pData
->IsEmpty() ) {
366 wxStringData
* pData
= (wxStringData
*)
367 malloc(sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
369 if ( pData
== NULL
) {
370 // allocation failure handled by caller
375 pData
->nDataLength
= 0;
376 pData
->nAllocLength
= nLen
;
377 m_pchData
= pData
->data(); // data starts after wxStringData
378 m_pchData
[0u] = wxT('\0');
380 else if ( pData
->IsShared() ) {
381 pData
->Unlock(); // memory not freed because shared
382 size_t nOldLen
= pData
->nDataLength
;
383 if ( !AllocBuffer(nLen
) ) {
384 // allocation failure handled by caller
387 memcpy(m_pchData
, pData
->data(), nOldLen
*sizeof(wxChar
));
392 pData
= (wxStringData
*)
393 realloc(pData
, sizeof(wxStringData
) + (nLen
+ 1)*sizeof(wxChar
));
395 if ( pData
== NULL
) {
396 // allocation failure handled by caller
397 // keep previous data since reallocation failed
401 // it's not important if the pointer changed or not (the check for this
402 // is not faster than assigning to m_pchData in all cases)
403 pData
->nAllocLength
= nLen
;
404 m_pchData
= pData
->data();
407 //else: we've already got enough
411 wxStringBase::iterator
wxStringBase::begin()
418 wxStringBase::iterator
wxStringBase::end()
422 return m_pchData
+ length();
425 wxStringBase::iterator
wxStringBase::erase(iterator it
)
427 size_type idx
= it
- begin();
429 return begin() + idx
;
432 wxStringBase
& wxStringBase::erase(size_t nStart
, size_t nLen
)
434 wxASSERT(nStart
<= length());
435 size_t strLen
= length() - nStart
;
436 // delete nLen or up to the end of the string characters
437 nLen
= strLen
< nLen
? strLen
: nLen
;
438 wxString
strTmp(c_str(), nStart
);
439 strTmp
.append(c_str() + nStart
+ nLen
, length() - nStart
- nLen
);
445 wxStringBase
& wxStringBase::insert(size_t nPos
, const wxChar
*sz
, size_t n
)
447 wxASSERT( nPos
<= length() );
449 if ( n
== npos
) n
= wxStrlen(sz
);
450 if ( n
== 0 ) return *this;
452 if ( !CopyBeforeWrite() || !Alloc(length() + n
) ) {
453 wxFAIL_MSG( _T("out of memory in wxStringBase::insert") );
456 memmove(m_pchData
+ nPos
+ n
, m_pchData
+ nPos
,
457 (length() - nPos
) * sizeof(wxChar
));
458 memcpy(m_pchData
+ nPos
, sz
, n
* sizeof(wxChar
));
459 GetStringData()->nDataLength
= length() + n
;
460 m_pchData
[length()] = '\0';
465 void wxStringBase::swap(wxStringBase
& str
)
467 wxChar
* tmp
= str
.m_pchData
;
468 str
.m_pchData
= m_pchData
;
472 size_t wxStringBase::find(const wxStringBase
& str
, size_t nStart
) const
474 wxASSERT( str
.GetStringData()->IsValid() );
475 wxASSERT( nStart
<= length() );
477 const wxChar
*p
= wxStrstr(c_str() + nStart
, str
.c_str());
479 return p
== NULL
? npos
: p
- c_str();
482 size_t wxStringBase::find(const wxChar
* sz
, size_t nStart
, size_t n
) const
484 return find(wxStringBase(sz
, n
), nStart
);
487 size_t wxStringBase::find(wxChar ch
, size_t nStart
) const
489 wxASSERT( nStart
<= length() );
491 const wxChar
*p
= wxStrchr(c_str() + nStart
, ch
);
493 return p
== NULL
? npos
: p
- c_str();
496 size_t wxStringBase::rfind(const wxStringBase
& str
, size_t nStart
) const
498 wxASSERT( str
.GetStringData()->IsValid() );
499 wxASSERT( nStart
== npos
|| nStart
<= length() );
501 if ( length() >= str
.length() )
503 // avoids a corner case later
504 if ( length() == 0 && str
.length() == 0 )
507 // "top" is the point where search starts from
508 size_t top
= length() - str
.length();
510 if ( nStart
== npos
)
511 nStart
= length() - 1;
515 const wxChar
*cursor
= c_str() + top
;
518 if ( memcmp(cursor
, str
.c_str(),
519 str
.length() * sizeof(wxChar
)) == 0 )
521 return cursor
- c_str();
523 } while ( cursor
-- > c_str() );
529 size_t wxStringBase::rfind(const wxChar
* sz
, size_t nStart
, size_t n
) const
531 return rfind(wxStringBase(sz
, n
), nStart
);
534 size_t wxStringBase::rfind(wxChar ch
, size_t nStart
) const
536 if ( nStart
== npos
)
542 wxASSERT( nStart
<= length() );
545 const wxChar
*actual
;
546 for ( actual
= c_str() + ( nStart
== npos
? length() : nStart
+ 1 );
547 actual
> c_str(); --actual
)
549 if ( *(actual
- 1) == ch
)
550 return (actual
- 1) - c_str();
556 size_t wxStringBase::find_first_of(const wxChar
* sz
, size_t nStart
) const
558 const wxChar
*start
= c_str() + nStart
;
559 const wxChar
*firstOf
= wxStrpbrk(start
, sz
);
561 return firstOf
- c_str();
566 size_t wxStringBase::find_first_of(const wxChar
* sz
, size_t nStart
,
569 return find_first_of(wxStringBase(sz
, n
), nStart
);
572 size_t wxStringBase::find_last_of(const wxChar
* sz
, size_t nStart
) const
574 if ( nStart
== npos
)
576 nStart
= length() - 1;
580 wxASSERT_MSG( nStart
<= length(),
581 _T("invalid index in find_last_of()") );
584 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
586 if ( wxStrchr(sz
, *p
) )
593 size_t wxStringBase::find_last_of(const wxChar
* sz
, size_t nStart
,
596 return find_last_of(wxStringBase(sz
, n
), nStart
);
599 size_t wxStringBase::find_first_not_of(const wxChar
* sz
, size_t nStart
) const
601 if ( nStart
== npos
)
607 wxASSERT( nStart
<= length() );
610 size_t nAccept
= wxStrspn(c_str() + nStart
, sz
);
611 if ( nAccept
>= length() - nStart
)
614 return nStart
+ nAccept
;
617 size_t wxStringBase::find_first_not_of(const wxChar
* sz
, size_t nStart
,
620 return find_first_not_of(wxStringBase(sz
, n
), nStart
);
623 size_t wxStringBase::find_first_not_of(wxChar ch
, size_t nStart
) const
625 wxASSERT( nStart
<= length() );
627 for ( const wxChar
*p
= c_str() + nStart
; *p
; p
++ )
636 size_t wxStringBase::find_last_not_of(const wxChar
* sz
, size_t nStart
) const
638 if ( nStart
== npos
)
640 nStart
= length() - 1;
644 wxASSERT( nStart
<= length() );
647 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
649 if ( !wxStrchr(sz
, *p
) )
656 size_t wxStringBase::find_last_not_of(const wxChar
* sz
, size_t nStart
,
659 return find_last_not_of(wxStringBase(sz
, n
), nStart
);
662 size_t wxStringBase::find_last_not_of(wxChar ch
, size_t nStart
) const
664 if ( nStart
== npos
)
666 nStart
= length() - 1;
670 wxASSERT( nStart
<= length() );
673 for ( const wxChar
*p
= c_str() + nStart
; p
>= c_str(); --p
)
682 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
685 wxASSERT_MSG( nStart
<= length(),
686 _T("index out of bounds in wxStringBase::replace") );
687 size_t strLen
= length() - nStart
;
688 nLen
= strLen
< nLen
? strLen
: nLen
;
691 strTmp
.reserve(length()); // micro optimisation to avoid multiple mem allocs
694 strTmp
.append(c_str(), nStart
);
696 strTmp
.append(c_str() + nStart
+ nLen
);
702 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
703 size_t nCount
, wxChar ch
)
705 return replace(nStart
, nLen
, wxStringBase(ch
, nCount
).c_str());
708 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
709 const wxStringBase
& str
,
710 size_t nStart2
, size_t nLen2
)
712 return replace(nStart
, nLen
, str
.substr(nStart2
, nLen2
));
715 wxStringBase
& wxStringBase::replace(size_t nStart
, size_t nLen
,
716 const wxChar
* sz
, size_t nCount
)
718 return replace(nStart
, nLen
, wxStringBase(sz
, nCount
).c_str());
721 wxStringBase
wxStringBase::substr(size_t nStart
, size_t nLen
) const
724 nLen
= length() - nStart
;
725 return wxStringBase(*this, nStart
, nLen
);
728 // assigns one string to another
729 wxStringBase
& wxStringBase::operator=(const wxStringBase
& stringSrc
)
731 wxASSERT( stringSrc
.GetStringData()->IsValid() );
733 // don't copy string over itself
734 if ( m_pchData
!= stringSrc
.m_pchData
) {
735 if ( stringSrc
.GetStringData()->IsEmpty() ) {
740 GetStringData()->Unlock();
741 m_pchData
= stringSrc
.m_pchData
;
742 GetStringData()->Lock();
749 // assigns a single character
750 wxStringBase
& wxStringBase::operator=(wxChar ch
)
752 if ( !AssignCopy(1, &ch
) ) {
753 wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(wxChar)") );
759 wxStringBase
& wxStringBase::operator=(const wxChar
*psz
)
761 if ( !AssignCopy(wxStrlen(psz
), psz
) ) {
762 wxFAIL_MSG( _T("out of memory in wxStringBase::operator=(const wxChar *)") );
767 // helper function: does real copy
768 bool wxStringBase::AssignCopy(size_t nSrcLen
, const wxChar
*pszSrcData
)
770 if ( nSrcLen
== 0 ) {
774 if ( !AllocBeforeWrite(nSrcLen
) ) {
775 // allocation failure handled by caller
778 memcpy(m_pchData
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
779 GetStringData()->nDataLength
= nSrcLen
;
780 m_pchData
[nSrcLen
] = wxT('\0');
785 // ---------------------------------------------------------------------------
786 // string concatenation
787 // ---------------------------------------------------------------------------
789 // add something to this string
790 bool wxStringBase::ConcatSelf(size_t nSrcLen
, const wxChar
*pszSrcData
,
793 STATISTICS_ADD(SummandLength
, nSrcLen
);
795 nSrcLen
= nSrcLen
< nMaxLen
? nSrcLen
: nMaxLen
;
797 // concatenating an empty string is a NOP
799 wxStringData
*pData
= GetStringData();
800 size_t nLen
= pData
->nDataLength
;
801 size_t nNewLen
= nLen
+ nSrcLen
;
803 // alloc new buffer if current is too small
804 if ( pData
->IsShared() ) {
805 STATISTICS_ADD(ConcatHit
, 0);
807 // we have to allocate another buffer
808 wxStringData
* pOldData
= GetStringData();
809 if ( !AllocBuffer(nNewLen
) ) {
810 // allocation failure handled by caller
813 memcpy(m_pchData
, pOldData
->data(), nLen
*sizeof(wxChar
));
816 else if ( nNewLen
> pData
->nAllocLength
) {
817 STATISTICS_ADD(ConcatHit
, 0);
820 // we have to grow the buffer
821 if ( capacity() < nNewLen
) {
822 // allocation failure handled by caller
827 STATISTICS_ADD(ConcatHit
, 1);
829 // the buffer is already big enough
832 // should be enough space
833 wxASSERT( nNewLen
<= GetStringData()->nAllocLength
);
835 // fast concatenation - all is done in our buffer
836 memcpy(m_pchData
+ nLen
, pszSrcData
, nSrcLen
*sizeof(wxChar
));
838 m_pchData
[nNewLen
] = wxT('\0'); // put terminating '\0'
839 GetStringData()->nDataLength
= nNewLen
; // and fix the length
841 //else: the string to append was empty
845 // ---------------------------------------------------------------------------
846 // simple sub-string extraction
847 // ---------------------------------------------------------------------------
849 // helper function: clone the data attached to this string
850 bool wxStringBase::AllocCopy(wxString
& dest
, int nCopyLen
, int nCopyIndex
) const
852 if ( nCopyLen
== 0 ) {
856 if ( !dest
.AllocBuffer(nCopyLen
) ) {
857 // allocation failure handled by caller
860 memcpy(dest
.m_pchData
, m_pchData
+ nCopyIndex
, nCopyLen
*sizeof(wxChar
));
867 #if !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
870 #define STRINGCLASS wxStringBase
872 #define STRINGCLASS wxString
875 static inline int wxDoCmp(const wxChar
* s1
, size_t l1
,
876 const wxChar
* s2
, size_t l2
)
879 return wxStrncmp(s1
, s2
, l1
);
882 int ret
= wxStrncmp(s1
, s2
, l1
);
883 return ret
== 0 ? -1 : ret
;
887 int ret
= wxStrncmp(s1
, s2
, l2
);
888 return ret
== 0 ? +1 : ret
;
891 wxFAIL
; // must never get there
892 return 0; // quiet compilers
897 int STRINGCLASS::compare(const wxStringBase
& str
) const
899 return ::wxDoCmp(data(), length(), str
.data(), str
.length());
904 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
905 const wxStringBase
& str
) const
907 wxASSERT(nStart
<= length());
908 size_type strLen
= length() - nStart
;
909 nLen
= strLen
< nLen
? strLen
: nLen
;
910 return ::wxDoCmp(data() + nStart
, nLen
, str
.data(), str
.length());
913 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
914 const wxStringBase
& str
,
915 size_t nStart2
, size_t nLen2
) const
917 wxASSERT(nStart
<= length());
918 wxASSERT(nStart2
<= str
.length());
919 size_type strLen
= length() - nStart
,
920 strLen2
= str
.length() - nStart2
;
921 nLen
= strLen
< nLen
? strLen
: nLen
;
922 nLen2
= strLen2
< nLen2
? strLen2
: nLen2
;
923 return ::wxDoCmp(data() + nStart
, nLen
, str
.data() + nStart2
, nLen2
);
928 int STRINGCLASS::compare(const wxChar
* sz
) const
930 size_t nLen
= wxStrlen(sz
);
931 return ::wxDoCmp(data(), length(), sz
, nLen
);
936 int STRINGCLASS::compare(size_t nStart
, size_t nLen
,
937 const wxChar
* sz
, size_t nCount
) const
939 wxASSERT(nStart
<= length());
940 size_type strLen
= length() - nStart
;
941 nLen
= strLen
< nLen
? strLen
: nLen
;
943 nCount
= wxStrlen(sz
);
945 return ::wxDoCmp(data() + nStart
, nLen
, sz
, nCount
);
950 #endif // !wxUSE_STL || !defined(HAVE_STD_STRING_COMPARE)
952 // ===========================================================================
953 // wxString class core
954 // ===========================================================================
956 // ---------------------------------------------------------------------------
958 // ---------------------------------------------------------------------------
962 // from multibyte string
963 wxString::wxString(const char *psz
, wxMBConv
& conv
, size_t nLength
)
965 // if nLength != npos, then we have to make a NULL-terminated copy
966 // of first nLength bytes of psz first because the input buffer to MB2WC
967 // must always be NULL-terminated:
968 wxCharBuffer
inBuf((const char *)NULL
);
971 wxASSERT( psz
!= NULL
);
972 wxCharBuffer
tmp(nLength
);
973 memcpy(tmp
.data(), psz
, nLength
);
974 tmp
.data()[nLength
] = '\0';
979 // first get the size of the buffer we need
983 // calculate the needed size ourselves or use the provided one
984 nLen
= conv
.MB2WC(NULL
, psz
, 0);
988 // nothing to convert
993 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
997 wxFAIL_MSG( _T("out of memory in wxString::wxString") );
1001 wxWCharBuffer
buf(nLen
);
1002 // MB2WC wants the buffer size, not the string length hence +1
1003 nLen
= conv
.MB2WC(buf
.data(), psz
, nLen
+ 1);
1005 if ( nLen
!= (size_t)-1 )
1007 // initialized ok, set the real length as nLength specified by
1008 // the caller could be greater than the real string length
1009 assign(buf
.data(), nLen
);
1012 //else: the conversion failed -- leave the string empty (what else?)
1021 wxString::wxString(const wchar_t *pwz
, wxMBConv
& conv
, size_t nLength
)
1023 // if nLength != npos, then we have to make a NULL-terminated copy
1024 // of first nLength chars of psz first because the input buffer to WC2MB
1025 // must always be NULL-terminated:
1026 wxWCharBuffer
inBuf((const wchar_t *)NULL
);
1027 if (nLength
!= npos
)
1029 wxASSERT( pwz
!= NULL
);
1030 wxWCharBuffer
tmp(nLength
);
1031 memcpy(tmp
.data(), pwz
, nLength
* sizeof(wchar_t));
1032 tmp
.data()[nLength
] = '\0';
1037 // first get the size of the buffer we need
1041 // calculate the needed size ourselves or use the provided one
1042 nLen
= conv
.WC2MB(NULL
, pwz
, 0);
1046 // nothing to convert
1051 if ( (nLen
!= 0) && (nLen
!= (size_t)-1) )
1055 wxFAIL_MSG( _T("out of memory in wxString::wxString") );
1059 wxCharBuffer
buf(nLen
);
1060 // WC2MB wants the buffer size, not the string length
1061 if ( conv
.WC2MB(buf
.data(), pwz
, nLen
+ 1) != (size_t)-1 )
1064 assign(buf
.data(), nLen
);
1067 //else: the conversion failed -- leave the string empty (what else?)
1073 #endif // wxUSE_WCHAR_T
1075 #endif // Unicode/ANSI
1077 // shrink to minimal size (releasing extra memory)
1078 bool wxString::Shrink()
1080 wxString
tmp(begin(), end());
1082 return tmp
.length() == length();
1086 // get the pointer to writable buffer of (at least) nLen bytes
1087 wxChar
*wxString::GetWriteBuf(size_t nLen
)
1089 if ( !AllocBeforeWrite(nLen
) ) {
1090 // allocation failure handled by caller
1094 wxASSERT( GetStringData()->nRefs
== 1 );
1095 GetStringData()->Validate(false);
1100 // put string back in a reasonable state after GetWriteBuf
1101 void wxString::UngetWriteBuf()
1103 GetStringData()->nDataLength
= wxStrlen(m_pchData
);
1104 GetStringData()->Validate(true);
1107 void wxString::UngetWriteBuf(size_t nLen
)
1109 GetStringData()->nDataLength
= nLen
;
1110 GetStringData()->Validate(true);
1114 // ---------------------------------------------------------------------------
1116 // ---------------------------------------------------------------------------
1118 // all functions are inline in string.h
1120 // ---------------------------------------------------------------------------
1121 // assignment operators
1122 // ---------------------------------------------------------------------------
1126 // same as 'signed char' variant
1127 wxString
& wxString::operator=(const unsigned char* psz
)
1129 *this = (const char *)psz
;
1134 wxString
& wxString::operator=(const wchar_t *pwz
)
1145 * concatenation functions come in 5 flavours:
1147 * char + string and string + char
1148 * C str + string and string + C str
1151 wxString
operator+(const wxString
& str1
, const wxString
& str2
)
1154 wxASSERT( str1
.GetStringData()->IsValid() );
1155 wxASSERT( str2
.GetStringData()->IsValid() );
1164 wxString
operator+(const wxString
& str
, wxChar ch
)
1167 wxASSERT( str
.GetStringData()->IsValid() );
1176 wxString
operator+(wxChar ch
, const wxString
& str
)
1179 wxASSERT( str
.GetStringData()->IsValid() );
1188 wxString
operator+(const wxString
& str
, const wxChar
*psz
)
1191 wxASSERT( str
.GetStringData()->IsValid() );
1195 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1196 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1204 wxString
operator+(const wxChar
*psz
, const wxString
& str
)
1207 wxASSERT( str
.GetStringData()->IsValid() );
1211 if ( !s
.Alloc(wxStrlen(psz
) + str
.Len()) ) {
1212 wxFAIL_MSG( _T("out of memory in wxString::operator+") );
1220 // ===========================================================================
1221 // other common string functions
1222 // ===========================================================================
1227 #ifndef __SCHAR_MAX__
1228 #define __SCHAR_MAX__ 127
1232 wxString
wxString::FromAscii(const char *ascii
)
1235 return wxEmptyString
;
1237 size_t len
= strlen( ascii
);
1242 wxStringBuffer
buf(res
, len
);
1244 wchar_t *dest
= buf
;
1248 if ( (*dest
++ = (wchar_t)(unsigned char)*ascii
++) == L
'\0' )
1256 wxString
wxString::FromAscii(const char ascii
)
1258 // What do we do with '\0' ?
1261 res
+= (wchar_t)(unsigned char) ascii
;
1266 const wxCharBuffer
wxString::ToAscii() const
1268 // this will allocate enough space for the terminating NUL too
1269 wxCharBuffer
buffer(length());
1271 signed char *dest
= (signed char *)buffer
.data();
1273 const wchar_t *pwc
= c_str();
1276 *dest
++ = *pwc
> SCHAR_MAX
? '_' : *pwc
;
1278 // the output string can't have embedded NULs anyhow, so we can safely
1279 // stop at first of them even if we do have any
1289 // extract string of length nCount starting at nFirst
1290 wxString
wxString::Mid(size_t nFirst
, size_t nCount
) const
1292 size_t nLen
= length();
1294 // default value of nCount is npos and means "till the end"
1295 if ( nCount
== npos
)
1297 nCount
= nLen
- nFirst
;
1300 // out-of-bounds requests return sensible things
1301 if ( nFirst
+ nCount
> nLen
)
1303 nCount
= nLen
- nFirst
;
1306 if ( nFirst
> nLen
)
1308 // AllocCopy() will return empty string
1312 wxString
dest(*this, nFirst
, nCount
);
1313 if ( dest
.length() != nCount
) {
1314 wxFAIL_MSG( _T("out of memory in wxString::Mid") );
1320 // check that the string starts with prefix and return the rest of the string
1321 // in the provided pointer if it is not NULL, otherwise return false
1322 bool wxString::StartsWith(const wxChar
*prefix
, wxString
*rest
) const
1324 wxASSERT_MSG( prefix
, _T("invalid parameter in wxString::StartsWith") );
1326 // first check if the beginning of the string matches the prefix: note
1327 // that we don't have to check that we don't run out of this string as
1328 // when we reach the terminating NUL, either prefix string ends too (and
1329 // then it's ok) or we break out of the loop because there is no match
1330 const wxChar
*p
= c_str();
1333 if ( *prefix
++ != *p
++ )
1342 // put the rest of the string into provided pointer
1349 // extract nCount last (rightmost) characters
1350 wxString
wxString::Right(size_t nCount
) const
1352 if ( nCount
> length() )
1355 wxString
dest(*this, length() - nCount
, nCount
);
1356 if ( dest
.length() != nCount
) {
1357 wxFAIL_MSG( _T("out of memory in wxString::Right") );
1362 // get all characters after the last occurence of ch
1363 // (returns the whole string if ch not found)
1364 wxString
wxString::AfterLast(wxChar ch
) const
1367 int iPos
= Find(ch
, true);
1368 if ( iPos
== wxNOT_FOUND
)
1371 str
= c_str() + iPos
+ 1;
1376 // extract nCount first (leftmost) characters
1377 wxString
wxString::Left(size_t nCount
) const
1379 if ( nCount
> length() )
1382 wxString
dest(*this, 0, nCount
);
1383 if ( dest
.length() != nCount
) {
1384 wxFAIL_MSG( _T("out of memory in wxString::Left") );
1389 // get all characters before the first occurence of ch
1390 // (returns the whole string if ch not found)
1391 wxString
wxString::BeforeFirst(wxChar ch
) const
1393 int iPos
= Find(ch
);
1394 if ( iPos
== wxNOT_FOUND
) iPos
= length();
1395 return wxString(*this, 0, iPos
);
1398 /// get all characters before the last occurence of ch
1399 /// (returns empty string if ch not found)
1400 wxString
wxString::BeforeLast(wxChar ch
) const
1403 int iPos
= Find(ch
, true);
1404 if ( iPos
!= wxNOT_FOUND
&& iPos
!= 0 )
1405 str
= wxString(c_str(), iPos
);
1410 /// get all characters after the first occurence of ch
1411 /// (returns empty string if ch not found)
1412 wxString
wxString::AfterFirst(wxChar ch
) const
1415 int iPos
= Find(ch
);
1416 if ( iPos
!= wxNOT_FOUND
)
1417 str
= c_str() + iPos
+ 1;
1422 // replace first (or all) occurences of some substring with another one
1424 wxString::Replace(const wxChar
*szOld
, const wxChar
*szNew
, bool bReplaceAll
)
1426 // if we tried to replace an empty string we'd enter an infinite loop below
1427 wxCHECK_MSG( szOld
&& *szOld
&& szNew
, 0,
1428 _T("wxString::Replace(): invalid parameter") );
1430 size_t uiCount
= 0; // count of replacements made
1432 size_t uiOldLen
= wxStrlen(szOld
);
1435 const wxChar
*pCurrent
= c_str();
1436 const wxChar
*pSubstr
;
1437 while ( *pCurrent
!= wxT('\0') ) {
1438 pSubstr
= wxStrstr(pCurrent
, szOld
);
1439 if ( pSubstr
== NULL
) {
1440 // strTemp is unused if no replacements were made, so avoid the copy
1444 strTemp
+= pCurrent
; // copy the rest
1445 break; // exit the loop
1448 // take chars before match
1449 size_type len
= strTemp
.length();
1450 strTemp
.append(pCurrent
, pSubstr
- pCurrent
);
1451 if ( strTemp
.length() != (size_t)(len
+ pSubstr
- pCurrent
) ) {
1452 wxFAIL_MSG( _T("out of memory in wxString::Replace") );
1456 pCurrent
= pSubstr
+ uiOldLen
; // restart after match
1461 if ( !bReplaceAll
) {
1462 strTemp
+= pCurrent
; // copy the rest
1463 break; // exit the loop
1468 // only done if there were replacements, otherwise would have returned above
1474 bool wxString::IsAscii() const
1476 const wxChar
*s
= (const wxChar
*) *this;
1478 if(!isascii(*s
)) return(false);
1484 bool wxString::IsWord() const
1486 const wxChar
*s
= (const wxChar
*) *this;
1488 if(!wxIsalpha(*s
)) return(false);
1494 bool wxString::IsNumber() const
1496 const wxChar
*s
= (const wxChar
*) *this;
1498 if ((s
[0] == '-') || (s
[0] == '+')) s
++;
1500 if(!wxIsdigit(*s
)) return(false);
1506 wxString
wxString::Strip(stripType w
) const
1509 if ( w
& leading
) s
.Trim(false);
1510 if ( w
& trailing
) s
.Trim(true);
1514 // ---------------------------------------------------------------------------
1516 // ---------------------------------------------------------------------------
1518 wxString
& wxString::MakeUpper()
1520 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1521 *it
= (wxChar
)wxToupper(*it
);
1526 wxString
& wxString::MakeLower()
1528 for ( iterator it
= begin(), en
= end(); it
!= en
; ++it
)
1529 *it
= (wxChar
)wxTolower(*it
);
1534 // ---------------------------------------------------------------------------
1535 // trimming and padding
1536 // ---------------------------------------------------------------------------
1538 // some compilers (VC++ 6.0 not to name them) return true for a call to
1539 // isspace('ê') in the C locale which seems to be broken to me, but we have to
1540 // live with this by checking that the character is a 7 bit one - even if this
1541 // may fail to detect some spaces (I don't know if Unicode doesn't have
1542 // space-like symbols somewhere except in the first 128 chars), it is arguably
1543 // still better than trimming away accented letters
1544 inline int wxSafeIsspace(wxChar ch
) { return (ch
< 127) && wxIsspace(ch
); }
1546 // trims spaces (in the sense of isspace) from left or right side
1547 wxString
& wxString::Trim(bool bFromRight
)
1549 // first check if we're going to modify the string at all
1552 (bFromRight
&& wxSafeIsspace(GetChar(Len() - 1))) ||
1553 (!bFromRight
&& wxSafeIsspace(GetChar(0u)))
1559 // find last non-space character
1560 iterator psz
= begin() + length() - 1;
1561 while ( wxSafeIsspace(*psz
) && (psz
>= begin()) )
1564 // truncate at trailing space start
1570 // find first non-space character
1571 iterator psz
= begin();
1572 while ( wxSafeIsspace(*psz
) )
1575 // fix up data and length
1576 erase(begin(), psz
);
1583 // adds nCount characters chPad to the string from either side
1584 wxString
& wxString::Pad(size_t nCount
, wxChar chPad
, bool bFromRight
)
1586 wxString
s(chPad
, nCount
);
1599 // truncate the string
1600 wxString
& wxString::Truncate(size_t uiLen
)
1602 if ( uiLen
< Len() ) {
1603 erase(begin() + uiLen
, end());
1605 //else: nothing to do, string is already short enough
1610 // ---------------------------------------------------------------------------
1611 // finding (return wxNOT_FOUND if not found and index otherwise)
1612 // ---------------------------------------------------------------------------
1615 int wxString::Find(wxChar ch
, bool bFromEnd
) const
1617 size_type idx
= bFromEnd
? find_last_of(ch
) : find_first_of(ch
);
1619 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1622 // find a sub-string (like strstr)
1623 int wxString::Find(const wxChar
*pszSub
) const
1625 size_type idx
= find(pszSub
);
1627 return (idx
== npos
) ? wxNOT_FOUND
: (int)idx
;
1630 // ----------------------------------------------------------------------------
1631 // conversion to numbers
1632 // ----------------------------------------------------------------------------
1634 bool wxString::ToLong(long *val
, int base
) const
1636 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToLong") );
1637 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1639 const wxChar
*start
= c_str();
1641 *val
= wxStrtol(start
, &end
, base
);
1643 // return true only if scan was stopped by the terminating NUL and if the
1644 // string was not empty to start with
1645 return !*end
&& (end
!= start
);
1648 bool wxString::ToULong(unsigned long *val
, int base
) const
1650 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToULong") );
1651 wxASSERT_MSG( !base
|| (base
> 1 && base
<= 36), _T("invalid base") );
1653 const wxChar
*start
= c_str();
1655 *val
= wxStrtoul(start
, &end
, base
);
1657 // return true only if scan was stopped by the terminating NUL and if the
1658 // string was not empty to start with
1659 return !*end
&& (end
!= start
);
1662 bool wxString::ToDouble(double *val
) const
1664 wxCHECK_MSG( val
, false, _T("NULL pointer in wxString::ToDouble") );
1666 const wxChar
*start
= c_str();
1668 *val
= wxStrtod(start
, &end
);
1670 // return true only if scan was stopped by the terminating NUL and if the
1671 // string was not empty to start with
1672 return !*end
&& (end
!= start
);
1675 // ---------------------------------------------------------------------------
1677 // ---------------------------------------------------------------------------
1680 wxString
wxString::Format(const wxChar
*pszFormat
, ...)
1683 va_start(argptr
, pszFormat
);
1686 s
.PrintfV(pszFormat
, argptr
);
1694 wxString
wxString::FormatV(const wxChar
*pszFormat
, va_list argptr
)
1697 s
.PrintfV(pszFormat
, argptr
);
1701 int wxString::Printf(const wxChar
*pszFormat
, ...)
1704 va_start(argptr
, pszFormat
);
1706 int iLen
= PrintfV(pszFormat
, argptr
);
1713 int wxString::PrintfV(const wxChar
* pszFormat
, va_list argptr
)
1721 wxStringBuffer
tmp(*this, size
+ 1);
1730 // wxVsnprintf() may modify the original arg pointer, so pass it
1733 wxVaCopy(argptrcopy
, argptr
);
1734 len
= wxVsnprintf(buf
, size
, pszFormat
, argptrcopy
);
1737 // some implementations of vsnprintf() don't NUL terminate
1738 // the string if there is not enough space for it so
1739 // always do it manually
1740 buf
[size
] = _T('\0');
1743 // vsnprintf() may return either -1 (traditional Unix behaviour) or the
1744 // total number of characters which would have been written if the
1745 // buffer were large enough
1746 if ( len
>= 0 && len
<= size
)
1748 // ok, there was enough space
1752 // still not enough, double it again
1756 // we could have overshot
1762 // ----------------------------------------------------------------------------
1763 // misc other operations
1764 // ----------------------------------------------------------------------------
1766 // returns true if the string matches the pattern which may contain '*' and
1767 // '?' metacharacters (as usual, '?' matches any character and '*' any number
1769 bool wxString::Matches(const wxChar
*pszMask
) const
1771 // I disable this code as it doesn't seem to be faster (in fact, it seems
1772 // to be much slower) than the old, hand-written code below and using it
1773 // here requires always linking with libregex even if the user code doesn't
1775 #if 0 // wxUSE_REGEX
1776 // first translate the shell-like mask into a regex
1778 pattern
.reserve(wxStrlen(pszMask
));
1790 pattern
+= _T(".*");
1801 // these characters are special in a RE, quote them
1802 // (however note that we don't quote '[' and ']' to allow
1803 // using them for Unix shell like matching)
1804 pattern
+= _T('\\');
1808 pattern
+= *pszMask
;
1816 return wxRegEx(pattern
, wxRE_NOSUB
| wxRE_EXTENDED
).Matches(c_str());
1817 #else // !wxUSE_REGEX
1818 // TODO: this is, of course, awfully inefficient...
1820 // the char currently being checked
1821 const wxChar
*pszTxt
= c_str();
1823 // the last location where '*' matched
1824 const wxChar
*pszLastStarInText
= NULL
;
1825 const wxChar
*pszLastStarInMask
= NULL
;
1828 for ( ; *pszMask
!= wxT('\0'); pszMask
++, pszTxt
++ ) {
1829 switch ( *pszMask
) {
1831 if ( *pszTxt
== wxT('\0') )
1834 // pszTxt and pszMask will be incremented in the loop statement
1840 // remember where we started to be able to backtrack later
1841 pszLastStarInText
= pszTxt
;
1842 pszLastStarInMask
= pszMask
;
1844 // ignore special chars immediately following this one
1845 // (should this be an error?)
1846 while ( *pszMask
== wxT('*') || *pszMask
== wxT('?') )
1849 // if there is nothing more, match
1850 if ( *pszMask
== wxT('\0') )
1853 // are there any other metacharacters in the mask?
1855 const wxChar
*pEndMask
= wxStrpbrk(pszMask
, wxT("*?"));
1857 if ( pEndMask
!= NULL
) {
1858 // we have to match the string between two metachars
1859 uiLenMask
= pEndMask
- pszMask
;
1862 // we have to match the remainder of the string
1863 uiLenMask
= wxStrlen(pszMask
);
1866 wxString
strToMatch(pszMask
, uiLenMask
);
1867 const wxChar
* pMatch
= wxStrstr(pszTxt
, strToMatch
);
1868 if ( pMatch
== NULL
)
1871 // -1 to compensate "++" in the loop
1872 pszTxt
= pMatch
+ uiLenMask
- 1;
1873 pszMask
+= uiLenMask
- 1;
1878 if ( *pszMask
!= *pszTxt
)
1884 // match only if nothing left
1885 if ( *pszTxt
== wxT('\0') )
1888 // if we failed to match, backtrack if we can
1889 if ( pszLastStarInText
) {
1890 pszTxt
= pszLastStarInText
+ 1;
1891 pszMask
= pszLastStarInMask
;
1893 pszLastStarInText
= NULL
;
1895 // don't bother resetting pszLastStarInMask, it's unnecessary
1901 #endif // wxUSE_REGEX/!wxUSE_REGEX
1904 // Count the number of chars
1905 int wxString::Freq(wxChar ch
) const
1909 for (int i
= 0; i
< len
; i
++)
1911 if (GetChar(i
) == ch
)
1917 // convert to upper case, return the copy of the string
1918 wxString
wxString::Upper() const
1919 { wxString
s(*this); return s
.MakeUpper(); }
1921 // convert to lower case, return the copy of the string
1922 wxString
wxString::Lower() const { wxString
s(*this); return s
.MakeLower(); }
1924 int wxString::sprintf(const wxChar
*pszFormat
, ...)
1927 va_start(argptr
, pszFormat
);
1928 int iLen
= PrintfV(pszFormat
, argptr
);
1933 // ============================================================================
1935 // ============================================================================
1937 #include "wx/arrstr.h"
1941 // size increment = min(50% of current size, ARRAY_MAXSIZE_INCREMENT)
1942 #define ARRAY_MAXSIZE_INCREMENT 4096
1944 #ifndef ARRAY_DEFAULT_INITIAL_SIZE // also defined in dynarray.h
1945 #define ARRAY_DEFAULT_INITIAL_SIZE (16)
1948 #define STRING(p) ((wxString *)(&(p)))
1951 void wxArrayString::Init(bool autoSort
)
1955 m_pItems
= (wxChar
**) NULL
;
1956 m_autoSort
= autoSort
;
1960 wxArrayString::wxArrayString(const wxArrayString
& src
)
1962 Init(src
.m_autoSort
);
1967 // assignment operator
1968 wxArrayString
& wxArrayString::operator=(const wxArrayString
& src
)
1975 m_autoSort
= src
.m_autoSort
;
1980 void wxArrayString::Copy(const wxArrayString
& src
)
1982 if ( src
.m_nCount
> ARRAY_DEFAULT_INITIAL_SIZE
)
1983 Alloc(src
.m_nCount
);
1985 for ( size_t n
= 0; n
< src
.m_nCount
; n
++ )
1990 void wxArrayString::Grow(size_t nIncrement
)
1992 // only do it if no more place
1993 if ( (m_nSize
- m_nCount
) < nIncrement
) {
1994 // if ARRAY_DEFAULT_INITIAL_SIZE were set to 0, the initially empty would
1995 // be never resized!
1996 #if ARRAY_DEFAULT_INITIAL_SIZE == 0
1997 #error "ARRAY_DEFAULT_INITIAL_SIZE must be > 0!"
2000 if ( m_nSize
== 0 ) {
2001 // was empty, alloc some memory
2002 m_nSize
= ARRAY_DEFAULT_INITIAL_SIZE
;
2003 if (m_nSize
< nIncrement
)
2004 m_nSize
= nIncrement
;
2005 m_pItems
= new wxChar
*[m_nSize
];
2008 // otherwise when it's called for the first time, nIncrement would be 0
2009 // and the array would never be expanded
2010 // add 50% but not too much
2011 size_t ndefIncrement
= m_nSize
< ARRAY_DEFAULT_INITIAL_SIZE
2012 ? ARRAY_DEFAULT_INITIAL_SIZE
: m_nSize
>> 1;
2013 if ( ndefIncrement
> ARRAY_MAXSIZE_INCREMENT
)
2014 ndefIncrement
= ARRAY_MAXSIZE_INCREMENT
;
2015 if ( nIncrement
< ndefIncrement
)
2016 nIncrement
= ndefIncrement
;
2017 m_nSize
+= nIncrement
;
2018 wxChar
**pNew
= new wxChar
*[m_nSize
];
2020 // copy data to new location
2021 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2023 // delete old memory (but do not release the strings!)
2024 wxDELETEA(m_pItems
);
2031 void wxArrayString::Free()
2033 for ( size_t n
= 0; n
< m_nCount
; n
++ ) {
2034 STRING(m_pItems
[n
])->GetStringData()->Unlock();
2038 // deletes all the strings from the list
2039 void wxArrayString::Empty()
2046 // as Empty, but also frees memory
2047 void wxArrayString::Clear()
2054 wxDELETEA(m_pItems
);
2058 wxArrayString::~wxArrayString()
2062 wxDELETEA(m_pItems
);
2065 void wxArrayString::reserve(size_t nSize
)
2070 // pre-allocates memory (frees the previous data!)
2071 void wxArrayString::Alloc(size_t nSize
)
2073 // only if old buffer was not big enough
2074 if ( nSize
> m_nSize
) {
2076 wxDELETEA(m_pItems
);
2077 m_pItems
= new wxChar
*[nSize
];
2084 // minimizes the memory usage by freeing unused memory
2085 void wxArrayString::Shrink()
2087 // only do it if we have some memory to free
2088 if( m_nCount
< m_nSize
) {
2089 // allocates exactly as much memory as we need
2090 wxChar
**pNew
= new wxChar
*[m_nCount
];
2092 // copy data to new location
2093 memcpy(pNew
, m_pItems
, m_nCount
*sizeof(wxChar
*));
2099 #if WXWIN_COMPATIBILITY_2_4
2101 // return a wxString[] as required for some control ctors.
2102 wxString
* wxArrayString::GetStringArray() const
2104 wxString
*array
= 0;
2108 array
= new wxString
[m_nCount
];
2109 for( size_t i
= 0; i
< m_nCount
; i
++ )
2110 array
[i
] = m_pItems
[i
];
2116 #endif // WXWIN_COMPATIBILITY_2_4
2118 // searches the array for an item (forward or backwards)
2119 int wxArrayString::Index(const wxChar
*sz
, bool bCase
, bool bFromEnd
) const
2122 // use binary search in the sorted array
2123 wxASSERT_MSG( bCase
&& !bFromEnd
,
2124 wxT("search parameters ignored for auto sorted array") );
2133 res
= wxStrcmp(sz
, m_pItems
[i
]);
2145 // use linear search in unsorted array
2147 if ( m_nCount
> 0 ) {
2148 size_t ui
= m_nCount
;
2150 if ( STRING(m_pItems
[--ui
])->IsSameAs(sz
, bCase
) )
2157 for( size_t ui
= 0; ui
< m_nCount
; ui
++ ) {
2158 if( STRING(m_pItems
[ui
])->IsSameAs(sz
, bCase
) )
2167 // add item at the end
2168 size_t wxArrayString::Add(const wxString
& str
, size_t nInsert
)
2171 // insert the string at the correct position to keep the array sorted
2179 res
= wxStrcmp(str
, m_pItems
[i
]);
2190 wxASSERT_MSG( lo
== hi
, wxT("binary search broken") );
2192 Insert(str
, lo
, nInsert
);
2197 wxASSERT( str
.GetStringData()->IsValid() );
2201 for (size_t i
= 0; i
< nInsert
; i
++)
2203 // the string data must not be deleted!
2204 str
.GetStringData()->Lock();
2207 m_pItems
[m_nCount
+ i
] = (wxChar
*)str
.c_str(); // const_cast
2209 size_t ret
= m_nCount
;
2210 m_nCount
+= nInsert
;
2215 // add item at the given position
2216 void wxArrayString::Insert(const wxString
& str
, size_t nIndex
, size_t nInsert
)
2218 wxASSERT( str
.GetStringData()->IsValid() );
2220 wxCHECK_RET( nIndex
<= m_nCount
, wxT("bad index in wxArrayString::Insert") );
2221 wxCHECK_RET( m_nCount
<= m_nCount
+ nInsert
,
2222 wxT("array size overflow in wxArrayString::Insert") );
2226 memmove(&m_pItems
[nIndex
+ nInsert
], &m_pItems
[nIndex
],
2227 (m_nCount
- nIndex
)*sizeof(wxChar
*));
2229 for (size_t i
= 0; i
< nInsert
; i
++)
2231 str
.GetStringData()->Lock();
2232 m_pItems
[nIndex
+ i
] = (wxChar
*)str
.c_str();
2234 m_nCount
+= nInsert
;
2237 // range insert (STL 23.2.4.3)
2239 wxArrayString::insert(iterator it
, const_iterator first
, const_iterator last
)
2241 const int idx
= it
- begin();
2246 // reset "it" since it can change inside Grow()
2249 while ( first
!= last
)
2251 it
= insert(it
, *first
);
2253 // insert returns an iterator to the last element inserted but we need
2254 // insert the next after this one, that is before the next one
2262 void wxArrayString::SetCount(size_t count
)
2267 while ( m_nCount
< count
)
2268 m_pItems
[m_nCount
++] = (wxChar
*)s
.c_str();
2271 // removes item from array (by index)
2272 void wxArrayString::RemoveAt(size_t nIndex
, size_t nRemove
)
2274 wxCHECK_RET( nIndex
< m_nCount
, wxT("bad index in wxArrayString::Remove") );
2275 wxCHECK_RET( nIndex
+ nRemove
<= m_nCount
,
2276 wxT("removing too many elements in wxArrayString::Remove") );
2279 for (size_t i
= 0; i
< nRemove
; i
++)
2280 Item(nIndex
+ i
).GetStringData()->Unlock();
2282 memmove(&m_pItems
[nIndex
], &m_pItems
[nIndex
+ nRemove
],
2283 (m_nCount
- nIndex
- nRemove
)*sizeof(wxChar
*));
2284 m_nCount
-= nRemove
;
2287 // removes item from array (by value)
2288 void wxArrayString::Remove(const wxChar
*sz
)
2290 int iIndex
= Index(sz
);
2292 wxCHECK_RET( iIndex
!= wxNOT_FOUND
,
2293 wxT("removing inexistent element in wxArrayString::Remove") );
2298 void wxArrayString::assign(const_iterator first
, const_iterator last
)
2300 reserve(last
- first
);
2301 for(; first
!= last
; ++first
)
2305 // ----------------------------------------------------------------------------
2307 // ----------------------------------------------------------------------------
2309 // we can only sort one array at a time with the quick-sort based
2312 // need a critical section to protect access to gs_compareFunction and
2313 // gs_sortAscending variables
2314 static wxCriticalSection
*gs_critsectStringSort
= NULL
;
2316 // call this before the value of the global sort vars is changed/after
2317 // you're finished with them
2318 #define START_SORT() wxASSERT( !gs_critsectStringSort ); \
2319 gs_critsectStringSort = new wxCriticalSection; \
2320 gs_critsectStringSort->Enter()
2321 #define END_SORT() gs_critsectStringSort->Leave(); \
2322 delete gs_critsectStringSort; \
2323 gs_critsectStringSort = NULL
2325 #define START_SORT()
2327 #endif // wxUSE_THREADS
2329 // function to use for string comparaison
2330 static wxArrayString::CompareFunction gs_compareFunction
= NULL
;
2332 // if we don't use the compare function, this flag tells us if we sort the
2333 // array in ascending or descending order
2334 static bool gs_sortAscending
= true;
2336 // function which is called by quick sort
2337 extern "C" int wxC_CALLING_CONV
// LINKAGEMODE
2338 wxStringCompareFunction(const void *first
, const void *second
)
2340 wxString
*strFirst
= (wxString
*)first
;
2341 wxString
*strSecond
= (wxString
*)second
;
2343 if ( gs_compareFunction
) {
2344 return gs_compareFunction(*strFirst
, *strSecond
);
2347 // maybe we should use wxStrcoll
2348 int result
= wxStrcmp(strFirst
->c_str(), strSecond
->c_str());
2350 return gs_sortAscending
? result
: -result
;
2354 // sort array elements using passed comparaison function
2355 void wxArrayString::Sort(CompareFunction compareFunction
)
2359 wxASSERT( !gs_compareFunction
); // must have been reset to NULL
2360 gs_compareFunction
= compareFunction
;
2364 // reset it to NULL so that Sort(bool) will work the next time
2365 gs_compareFunction
= NULL
;
2370 typedef int (wxC_CALLING_CONV
* wxStringCompareFn
)(const void *first
, const void *second
);
2372 void wxArrayString::Sort(CompareFunction2 compareFunction
)
2374 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), (wxStringCompareFn
)compareFunction
);
2377 void wxArrayString::Sort(bool reverseOrder
)
2379 Sort(reverseOrder
? wxStringSortDescending
: wxStringSortAscending
);
2382 void wxArrayString::DoSort()
2384 wxCHECK_RET( !m_autoSort
, wxT("can't use this method with sorted arrays") );
2386 // just sort the pointers using qsort() - of course it only works because
2387 // wxString() *is* a pointer to its data
2388 qsort(m_pItems
, m_nCount
, sizeof(wxChar
*), wxStringCompareFunction
);
2391 bool wxArrayString::operator==(const wxArrayString
& a
) const
2393 if ( m_nCount
!= a
.m_nCount
)
2396 for ( size_t n
= 0; n
< m_nCount
; n
++ )
2398 if ( Item(n
) != a
[n
] )
2405 #endif // !wxUSE_STL
2407 int wxCMPFUNC_CONV
wxStringSortAscending(wxString
* s1
, wxString
* s2
)
2409 return wxStrcmp(s1
->c_str(), s2
->c_str());
2412 int wxCMPFUNC_CONV
wxStringSortDescending(wxString
* s1
, wxString
* s2
)
2414 return -wxStrcmp(s1
->c_str(), s2
->c_str());