mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-01-14 15:38:57 +00:00
switch to std::sort until I have time to sort this out.
llvm-svn: 60354
This commit is contained in:
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
|
||||
|
Loading…
x
Reference in New Issue
Block a user