[#llvm-parallelSort-0d]
= xref:llvm.adoc[llvm]::parallelSort
:relfileprefix: ../
:mrdocs:

`parallelSort` overloads

== Synopses

Declared in `<llvm/Support/Parallel.h>`

Sort range `R` in parallel when enabled.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class RangeTy,
    class Comparator = std::less<decltype(*std::begin(RangeTy()))>>
void
xref:llvm/parallelSort-0c.adoc[parallelSort](
    RangeTy&& R,
    Comparator const& Comp = Comparator());
----

[.small]#xref:llvm/parallelSort-0c.adoc[_» more..._]#

Sort the half‐open range []`Start,` `End)` in parallel when enabled.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class RandomAccessIterator,
    class Comparator = std::less<std::iterator_traits<RandomAccessIterator>::value_type>>
void
xref:llvm/parallelSort-0f.adoc[parallelSort](
    RandomAccessIterator Start,
    RandomAccessIterator End,
    Comparator const& Comp = Comparator());
----

[.small]#xref:llvm/parallelSort-0f.adoc[_» more..._]#

== Parameters

[cols="1,4"]
|===
| Name| Description
| *R*
| Random‐access range to sort.
| *Comp*
| Strict‐weak‐ordering comparator; defaults to `std::less.`
| *Start*
| Beginning of the random‐access range.
| *End*
| End of the random‐access range.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#