#if wxUSE_STL
#include <vector>
+#include <algorithm>
+
#define wxVector std::vector
template<typename T>
inline void wxVectorSort(wxVector<T>& v)
// Note that we use typedef instead of privately deriving from this (which
// would allowed us to omit "Ops::" prefixes below) to keep VC6 happy,
// it can't compile code that derives from wxIf<...>::value.
- typedef typename wxIf< wxIsMovable<T>::value,
+ //
+ // Note that bcc needs the extra parentheses for non-type template
+ // arguments to compile this expression.
+ typedef typename wxIf< (wxIsMovable<T>::value),
wxPrivate::wxVectorMemOpsMovable<T>,
wxPrivate::wxVectorMemOpsGeneric<T> >::value
Ops;
namespace wxPrivate
{
- // This function is a helper for the wxVectorSort function, and should
- // not be used directly in user's code.
+// This is a helper for the wxVectorSort function, and should not be used
+// directly in user's code.
template<typename T>
-int wxCMPFUNC_CONV wxVectorSort_compare(const void* pitem1, const void* pitem2, const void* )
+struct wxVectorComparator
{
- const T& item1 = *reinterpret_cast<const T*>(pitem1);
- const T& item2 = *reinterpret_cast<const T*>(pitem2);
-
- if (item1 < item2)
- return -1;
- else if (item2 < item1)
- return 1;
- else
- return 0;
-}
+ static int wxCMPFUNC_CONV
+ Compare(const void* pitem1, const void* pitem2, const void* )
+ {
+ const T& item1 = *reinterpret_cast<const T*>(pitem1);
+ const T& item2 = *reinterpret_cast<const T*>(pitem2);
+
+ if (item1 < item2)
+ return -1;
+ else if (item2 < item1)
+ return 1;
+ else
+ return 0;
+ }
+};
} // namespace wxPrivate
void wxVectorSort(wxVector<T>& v)
{
wxQsort(v.begin(), v.size(), sizeof(T),
- wxPrivate::wxVectorSort_compare<T>, NULL);
+ wxPrivate::wxVectorComparator<T>::Compare, NULL);
}