|
Functions |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> |
OutputIterator | ustl::merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) |
| Combines two sorted ranges.
|
template<typename InputIterator> |
void | ustl::inplace_merge (InputIterator first, InputIterator middle, InputIterator last) |
template<typename RandomAccessIterator, typename Compare> |
void | ustl::sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename RandomAccessIterator> |
void | ustl::sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator> |
void | ustl::stable_sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator, typename Compare> |
void | ustl::stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename RandomAccessIterator> |
void | ustl::partial_sort (RandomAccessIterator first, RandomAccessIterator, RandomAccessIterator last) |
| Partially sort the range. Postcondition is that middle has the nth element and [first, middle) has elements smaller than those in (middle, last). In this implementation, the entire array is sorted. I can't think of any use for it where the time gained would be useful.
|
template<typename RandomAccessIterator> |
void | ustl::nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last) |
| Puts nth element into its sorted position. In this implementation, the entire array is sorted. I can't think of any use for it where the time gained would be useful.
|