commit | a3c81119d3d9de259bb79736ef15a7a9ae0715db | [log] [tgz] |
---|---|---|
author | Mikhail Dvorskiy <mikhail.dvorskiy@intel.com> | Thu Jun 06 07:34:46 2019 +0000 |
committer | Copybara-Service <copybara-worker@google.com> | Tue Sep 01 14:42:27 2020 -0700 |
tree | 6515980b232208cac6467755653de7ef674cca4d | |
parent | 911aa5cb6c225e6a8cdcd5a8647a2b67c2d907e9 [diff] |
[pstl] The optimized parallel versions of sort, stable_sort algorithms, TBB parallel backend. Summary: A modification of the parallel sorting algorithm, additionally optimized for a partially sorted array. Reviewers: rodgert ldionne Differential Revision: https://reviews.llvm.org/D59925 llvm-svn: 362678 GitOrigin-RevId: 36d1f2443b0d659c213313f72d3769b922fbb1fc
Parallel STL is an implementation of the C++ standard library algorithms with support for execution policies, as specified in ISO/IEC 14882:2017 standard, commonly called C++17. The implementation also supports the unsequenced execution policy specified in Parallelism TS version 2 and proposed for the next version of the C++ standard in the C++ working group paper P1001. Parallel STL offers efficient support for both parallel and vectorized execution of algorithms. For sequential execution, it relies on an available implementation of the C++ standard library.
To use Parallel STL, you must have the following software installed:
unseq
and par_unseq
policies only have effect with compilers that support #pragma omp simd
or #pragma simd
.includes
, inplace_merge
, merge
, nth_element
, partial_sort
, partial_sort_copy
, set_difference
, set_intersection
, set_symmetric_difference
, set_union
, sort
, stable_partition
, stable_sort
, unique
.exclusive_scan
, inclusive_scan
, transform_exclusive_scan
, transform_inclusive_scan
shall be DefaultConstructible. A default constructed-instance of the initial value type shall be the identity element for the specified binary operation.max_element
, min_element
, minmax_element
, partial_sort
, partial_sort_copy
, sort
, stable_sort
the dereferenced value type of the provided iterators shall be DefaultConstructible.remove
, remove_if
, unique
the dereferenced value type of the provided iterators shall be MoveConstructible.copy_if
, inplace_merge
, partial_sort
, partial_sort_copy
, partition_copy
, remove
, remove_if
, rotate
, sort
, stable_sort
, unique
, unique_copy
.