| 193 | @ingroup algorithms **/ |
| 194 | template<typename RandomAccessIterator, typename Compare> |
| 195 | void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp) { |
| 196 | const int min_parallel_size = 500; |
| 197 | if( end > begin ) { |
| 198 | if (end - begin < min_parallel_size) { |
| 199 | std::sort(begin, end, comp); |
| 200 | } else { |
| 201 | internal::parallel_quick_sort(begin, end, comp); |
| 202 | } |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | //! Sorts the data in [begin,end) with a default comparator \c std::less<RandomAccessIterator> |
| 207 | /** @ingroup algorithms **/ |
nothing calls this directly
no test coverage detected