#include <stdlib.h>
#include <string.h> // for memmove
-#if !wxUSE_STL
+#if !wxUSE_STD_CONTAINERS
// 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
{ \
m_nSize = \
m_nCount = 0; \
- m_pItems = (T *)NULL; \
+ m_pItems = NULL; \
} \
\
/* copy ctor */ \
} \
} \
else \
- m_pItems = (T *) NULL; \
+ m_pItems = NULL; \
} \
\
/* assignment operator */ \
} \
} \
else \
- m_pItems = (T *) NULL; \
+ m_pItems = NULL; \
\
return *this; \
} \
return; \
Grow(nInsert); \
\
+ /* old iterator could have been invalidated by Grow(). */ \
+ it = begin() + nIndex; \
+ \
memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex], \
(m_nCount - nIndex)*sizeof(T)); \
for (size_t i = 0; i < nInsert; ++i, ++it, ++first) \
#pragma warning(pop)
#endif
-#else // wxUSE_STL
+#else // wxUSE_STD_CONTAINERS
#include "wx/arrstr.h"
}
}
-int wxSortedArrayString::Index(const wxString& str, bool bCase, bool WXUNUSED(bFromEnd)) const
+int wxSortedArrayString::Index(const wxString& str,
+ bool WXUNUSED_UNLESS_DEBUG(bCase),
+ bool WXUNUSED_UNLESS_DEBUG(bFromEnd)) const
{
- wxSortedArrayString::const_iterator it;
+ wxASSERT_MSG( bCase && !bFromEnd,
+ "search parameters ignored for sorted array" );
- if (bCase)
- it = std::lower_bound(begin(), end(), str,
- wxStringCompare(wxStringCmp()));
- else
- it = std::lower_bound(begin(), end(), str,
- wxStringCompare(wxStringCmpNoCase()));
+ wxSortedArrayString::const_iterator
+ it = std::lower_bound(begin(), end(), str, wxStringCompare(wxStringCmp()));
- if (it == end())
+ if ( it == end() || str.Cmp(*it) != 0 )
return wxNOT_FOUND;
- if (bCase)
- {
- if (str.Cmp(*it) != 0)
- return wxNOT_FOUND;
- }
- else
- {
- if (str.CmpNoCase(*it) != 0)
- return wxNOT_FOUND;
- }
-
return it - begin();
}
-#endif // !wxUSE_STL/wxUSE_STL
+#endif // !wxUSE_STD_CONTAINERS/wxUSE_STD_CONTAINERS