Lines Matching defs:sort
281 // the insertion sort algorithm.
308 // the insertion sort algorithm. Insertion sort has two loops, outer and inner.
751 // - option of using block quick sort for partitioning,
752 // - guarded and unguarded insertion sort for small lengths,
766 // Upper bound for using insertion sort for sorting.
797 // Use insertion sort if the length of the range is below the specified limit.
807 // Fallback to heap sort as Introsort suggests.
835 // partitioned. This also means that we do not need to sort the left
849 // If we were given a perfect partition, see if insertion sort is quick...
1003 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp __comp) {
1009 sort(_RandomAccessIterator __first, _RandomAccessIterator __last) {
1010 std::sort(__first, __last, __less<>());