switch to std::sort until I have time to sort this out.

llvm-svn: 60354
This commit is contained in:
Chris Lattner 2008-12-01 17:00:08 +00:00
parent f73ecf1a6c
commit ddae8937e6

@ -246,12 +246,16 @@ static inline int array_pod_sort_comparator(const void *P1, const void *P2) {
///
/// NOTE: If qsort_r were portable, we could allow a custom comparator and
/// default to std::less.
#include <algorithm>
template<class IteratorTy>
static inline void array_pod_sort(IteratorTy Start, IteratorTy End) {
std::sort(Start, End);
// Don't dereference start iterator of empty sequence.
if (Start == End) return;
qsort(&*Start, End-Start, sizeof(*Start),
array_pod_sort_comparator<sizeof(*Start)>);
//if (Start == End) return;
//qsort(&*Start, End-Start, sizeof(*Start),
// array_pod_sort_comparator<*Start>);
}
} // End llvm namespace