X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/dbda9e86f0e5ec1184bc16d135bb7205bc99236e..bfc6fde4b1dd5bfd8ae22839ff9a69cf24eb9120:/include/wx/string.h diff --git a/include/wx/string.h b/include/wx/string.h index 593b80c603..518b8f5f79 100644 --- a/include/wx/string.h +++ b/include/wx/string.h @@ -79,7 +79,7 @@ inline size_t WXDLLEXPORT Strlen(const char *psz) // portable strcasecmp/_stricmp inline int WXDLLEXPORT Stricmp(const char *psz1, const char *psz2) { -#if defined(__VISUALC__) || defined(__MWERKS__) +#if defined(__VISUALC__) || ( defined(__MWERKS__) && defined(__INTEL__) ) return _stricmp(psz1, psz2); #elif defined(__SC__) return _stricmp(psz1, psz2); @@ -91,7 +91,7 @@ inline int WXDLLEXPORT Stricmp(const char *psz1, const char *psz2) return stricmp(psz1, psz2); #elif defined(__UNIX__) || defined(__GNUWIN32__) return strcasecmp(psz1, psz2); -#elif defined(__MWERKS__) && !defined(_MSC_VER) +#elif defined(__MWERKS__) && !defined(__INTEL__) register char c1, c2; do { c1 = tolower(*psz1++); @@ -410,7 +410,7 @@ public: wxString& operator<<(double d); // string comparison - // case-sensitive comparison: return 0 if =, +1 if > or -1 if < + // case-sensitive comparison (returns a value < 0, = 0 or > 0) int Cmp(const char *psz) const { return strcmp(c_str(), psz); } // same as Cmp() but not case-sensitive int CmpNoCase(const char *psz) const { return Stricmp(c_str(), psz); } @@ -740,6 +740,10 @@ public: class WXDLLEXPORT wxArrayString { public: + // type of function used by wxArrayString::Sort() + typedef int (*CompareFunction)(const wxString& first, + const wxString& second); + // constructors and destructor // default ctor wxArrayString(); @@ -792,13 +796,19 @@ public: // remove item by index void Remove(size_t nIndex); - // sort array elements - void Sort(bool bCase = TRUE, bool bReverse = FALSE); + // sorting + // sort array elements in alphabetical order (or reversed alphabetical + // order if reverseOrder parameter is TRUE) + void Sort(bool reverseOrder = FALSE); + // sort array elements using specified comparaison function + void Sort(CompareFunction compareFunction); private: void Grow(); // makes array bigger if needed void Free(); // free the string stored + void DoSort(); // common part of all Sort() variants + size_t m_nSize, // current size of the array m_nCount; // current number of elements