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

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60354 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/llvm/ADT/STLExtras.h b/include/llvm/ADT/STLExtras.h
index 5685729eb513479698de2154982e0d75daec15a2..7be7699bcc2b041d6c673b193736746cde6c0742 100644 (file)
--- a/include/llvm/ADT/STLExtras.h
+++ b/include/llvm/ADT/STLExtras.h
@@ -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