ΒΆtemplate <class IteratorTy>
inline void array_pod_sort(IteratorTy Start,
                           IteratorTy End)

Description

array_pod_sort - This sorts an array with the specified start and end extent. This is just like std::sort, except that it calls qsort instead of using an inlined template. qsort is slightly slower than std::sort, but most sorts are not performance critical in LLVM and std::sort has to be template instantiated for each type, leading to significant measured code bloat. This function should generally be used instead of std::sort where possible. This function assumes that you have simple POD-like types that can be compared with std::less and can be moved with memcpy. If this isn't true, you should use std::sort. NOTE: If qsort_r were portable, we could allow a custom comparator and default to std::less.

Declared at: llvm/include/llvm/ADT/STLExtras.h:1520

Templates

IteratorTy

Parameters

IteratorTy Start
IteratorTy End