libstdc++
quicksort.h File Reference

Go to the source code of this file.

Namespaces

namespace  __gnu_parallel
 

Functions

template<typename _RAIter , typename _Compare >
void __gnu_parallel::__parallel_sort_qs (_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)
 
template<typename _RAIter , typename _Compare >
void __gnu_parallel::__parallel_sort_qs_conquer (_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)
 
template<typename _RAIter , typename _Compare >
std::iterator_traits< _RAIter >
::difference_type 
__gnu_parallel::__parallel_sort_qs_divide (_RAIter __begin, _RAIter __end, _Compare __comp, typename std::iterator_traits< _RAIter >::difference_type __pivot_rank, typename std::iterator_traits< _RAIter >::difference_type __num_samples, _ThreadIndex __num_threads)
 

Detailed Description

Implementation of a unbalanced parallel quicksort (in-place). This file is a GNU parallel extension to the Standard C++ Library.

Definition in file quicksort.h.