X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/dbda9e86f0e5ec1184bc16d135bb7205bc99236e..8a0d4cf6c5e9fe357ca3e873b81c0fda10e4b217:/src/common/string.cpp diff --git a/src/common/string.cpp b/src/common/string.cpp index 3ba5ee9ab5..37a116fa02 100644 --- a/src/common/string.cpp +++ b/src/common/string.cpp @@ -10,7 +10,7 @@ ///////////////////////////////////////////////////////////////////////////// #ifdef __GNUG__ -#pragma implementation "string.h" + #pragma implementation "string.h" #endif /* @@ -28,7 +28,7 @@ #include "wx/wxprec.h" #ifdef __BORLANDC__ -#pragma hdrstop + #pragma hdrstop #endif #ifndef WX_PRECOMP @@ -42,7 +42,7 @@ #include #ifdef __SALFORDC__ -#include + #include #endif #if wxUSE_WCSRTOMBS @@ -116,6 +116,8 @@ extern const char WXDLLEXPORT *g_szNul = &g_strEmpty.dummy; // No warning #elif defined(__SUNCC__) // nothing -- I don't know about "#warning" for Sun's CC +#elif defined(__DECCXX) + // nothing #else // change this to some analogue of '#warning' for your compiler #error "Using sprintf() because no snprintf()-like function defined" @@ -1448,10 +1450,79 @@ void wxArrayString::Remove(const char *sz) Remove(iIndex); } +// ---------------------------------------------------------------------------- +// sorting +// ---------------------------------------------------------------------------- + +// we can only sort one array at a time with the quick-sort based +// implementation +#if wxUSE_THREADS + #include + + // need a critical section to protect access to gs_compareFunction and + // gs_sortAscending variables + static wxCriticalSection gs_critsectStringSort; + + // call this before the value of the global sort vars is changed/after + // you're finished with them + #define START_SORT() gs_critsectStringSort.Enter() + #define END_SORT() gs_critsectStringSort.Leave() +#else // !threads + #define START_SORT() + #define END_SORT() +#endif // wxUSE_THREADS + +// function to use for string comparaison +static wxArrayString::CompareFunction gs_compareFunction = NULL; + +// if we don't use the compare function, this flag tells us if we sort the +// array in ascending or descending order +static bool gs_sortAscending = TRUE; + +// function which is called by quick sort +static int wxStringCompareFunction(const void *first, const void *second) +{ + wxString *strFirst = (wxString *)first; + wxString *strSecond = (wxString *)second; + + if ( gs_compareFunction ) { + return gs_compareFunction(*strFirst, *strSecond); + } + else { + int result = strcmp(strFirst->c_str(), strSecond->c_str()); + + return gs_sortAscending ? result : -result; + } +} + // sort array elements using passed comparaison function +void wxArrayString::Sort(CompareFunction compareFunction) +{ + START_SORT(); + + wxASSERT( !gs_compareFunction ); // must have been reset to NULL + gs_compareFunction = compareFunction; + + DoSort(); + + END_SORT(); +} + +void wxArrayString::Sort(bool reverseOrder) +{ + START_SORT(); + + wxASSERT( !gs_compareFunction ); // must have been reset to NULL + gs_sortAscending = !reverseOrder; + + DoSort(); + + END_SORT(); +} -void wxArrayString::Sort(bool WXUNUSED(bCase), bool WXUNUSED(bReverse) ) +void wxArrayString::DoSort() { - //@@@@ TO DO - //qsort(m_pItems, m_nCount, sizeof(char *), fCmp); + // just sort the pointers using qsort() - of course it only works because + // wxString() *is* a pointer to its data + qsort(m_pItems, m_nCount, sizeof(char *), wxStringCompareFunction); }