parallelSort#

Fully qualified name: carb::tasking::parallelSort

Defined in carb/tasking/ParallelSort.h

template<typename RandomAccessIterator, typename Compare>
inline ::std::enable_if_t<detail::IsRandomAccess_v<RandomAccessIterator>> carb::tasking::parallelSort(
ITasking *tasking,
RandomAccessIterator first,
RandomAccessIterator last,
const Compare &comp,
)#

Performs a parallel sort on the given data.

Warning

This sorting algorithm is not stable.

Parameters:

  • tasking – the ITasking interface to use.

  • first – an iterator to the first element to sort.

  • last – an iterator to the last element to sort.

  • comp – the Functor to use to compare two elements.

On this page