X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/e11d2abe46cee46100ac19ff00f018b21ae861fa..e0954e729dabaad5603d9970d123d6b96ed73463:/src/common/dynarray.cpp diff --git a/src/common/dynarray.cpp b/src/common/dynarray.cpp index f55c594a3b..2157246df3 100644 --- a/src/common/dynarray.cpp +++ b/src/common/dynarray.cpp @@ -1,5 +1,5 @@ /////////////////////////////////////////////////////////////////////////////// -// Name: dynarray.cpp +// Name: src/common/dynarray.cpp // Purpose: implementation of wxBaseArray class // Author: Vadim Zeitlin // Modified by: @@ -13,26 +13,21 @@ // headers // ============================================================================ -#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA) -#pragma implementation "dynarray.h" -#endif - +// For compilers that support precompilation, includes "wx.h". #include "wx/wxprec.h" #ifdef __BORLANDC__ - #pragma hdrstop + #pragma hdrstop #endif -#include "wx/dynarray.h" -#include "wx/intl.h" +#ifndef WX_PRECOMP + #include "wx/dynarray.h" + #include "wx/intl.h" +#endif //WX_PRECOMP #include #include // for memmove -#ifndef max - #define max(a, b) (((a) > (b)) ? (a) : (b)) -#endif - // we cast the value to long from which we cast it to void * in IndexForInsert: // this can't work if the pointers are not big enough wxCOMPILE_TIME_ASSERT( sizeof(wxUIntPtr) <= sizeof(void *), @@ -99,8 +94,8 @@ int name::Index(T lItem, CMPFUNC fnCompare) const \ { \ Predicate p((SCMPFUNC)fnCompare); \ const_iterator it = std::lower_bound(begin(), end(), lItem, p); \ - return (it != end() && \ - p(lItem, *it)) ? (int)(it - begin()) : wxNOT_FOUND; \ + return (it != end() && !p(lItem, *it)) ? \ + (int)(it - begin()) : wxNOT_FOUND; \ } \ \ void name::Shrink() \ @@ -249,23 +244,6 @@ void name::Clear() \ wxDELETEA(m_pItems); \ } \ \ -/* pre-allocates memory (frees the previous data!) */ \ -void name::Alloc(size_t nSize) \ -{ \ - /* only if old buffer was not big enough */ \ - if ( nSize > m_nSize ) { \ - wxDELETEA(m_pItems); \ - m_nSize = 0; \ - m_pItems = new T[nSize]; \ - /* only alloc if allocation succeeded */ \ - if ( m_pItems ) { \ - m_nSize = nSize; \ - } \ - } \ - \ - m_nCount = 0; \ -} \ - \ /* minimizes the memory usage by freeing unused memory */ \ void name::Shrink() \ { \ @@ -418,13 +396,24 @@ void name::insert(iterator it, const_iterator first, const_iterator last) \ _WX_DEFINE_BASEARRAY_COMMON(T, name) \ _WX_DEFINE_BASEARRAY_NOCOMMON(T, name) +#ifdef __INTELC__ + #pragma warning(push) + #pragma warning(disable: 1684) + #pragma warning(disable: 1572) +#endif + _WX_DEFINE_BASEARRAY(const void *, wxBaseArrayPtrVoid) +_WX_DEFINE_BASEARRAY(char, wxBaseArrayChar) _WX_DEFINE_BASEARRAY(short, wxBaseArrayShort) _WX_DEFINE_BASEARRAY(int, wxBaseArrayInt) _WX_DEFINE_BASEARRAY(long, wxBaseArrayLong) _WX_DEFINE_BASEARRAY(size_t, wxBaseArraySizeT) _WX_DEFINE_BASEARRAY(double, wxBaseArrayDouble) +#ifdef __INTELC__ + #pragma warning(pop) +#endif + #if wxUSE_STL #include "wx/arrstr.h" @@ -432,7 +421,7 @@ _WX_DEFINE_BASEARRAY(double, wxBaseArrayDouble) #include #include "wx/afterstd.h" -_WX_DEFINE_BASEARRAY(wxString, wxBaseArrayStringBase); +_WX_DEFINE_BASEARRAY(wxString, wxBaseArrayStringBase) // some compilers (Sun CC being the only known example) distinguish between // extern "C" functions and the functions with C++ linkage and ptr_fun and @@ -470,28 +459,53 @@ int wxArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) return it == end() ? wxNOT_FOUND : it - begin(); } +template class wxStringCompareLess { public: - typedef int (wxCMPFUNC_CONV * fnc)(const wxChar*, const wxChar*); -public: - wxStringCompareLess(fnc f) : m_f(f) { } + wxStringCompareLess(F f) : m_f(f) { } bool operator()(const wxChar* s1, const wxChar* s2) { return m_f(s1, s2) < 0; } + bool operator()(const wxString& s1, const wxString& s2) + { return m_f(s1, s2) < 0; } private: - fnc m_f; + F m_f; }; +template +wxStringCompareLess wxStringCompare(F f) +{ + return wxStringCompareLess(f); +} + +void wxArrayString::Sort(CompareFunction function) +{ + std::sort(begin(), end(), wxStringCompare(function)); +} + +void wxArrayString::Sort(bool reverseOrder) +{ + if (reverseOrder) + { + std::sort(begin(), end(), std::greater()); + } + else + { + std::sort(begin(), end()); + } +} + int wxSortedArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) const { wxSortedArrayString::const_iterator it; + wxString s(sz); if (bCase) - it = std::lower_bound(begin(), end(), sz, - wxStringCompareLess(wxStrcmpCppWrapper)); + it = std::lower_bound(begin(), end(), s, + wxStringCompare(wxStrcmpCppWrapper)); else - it = std::lower_bound(begin(), end(), sz, - wxStringCompareLess(wxStricmpCppWrapper)); + it = std::lower_bound(begin(), end(), s, + wxStringCompare(wxStricmpCppWrapper)); if (it == end()) return wxNOT_FOUND;