Google Git
Sign in
llvm / llvm-project / pstl / be1cab3e07a5c2c4d049fd6119fd2edd58f31346
commitbe1cab3e07a5c2c4d049fd6119fd2edd58f31346[log] [tgz]
authorLouis Dionne <ldionne@apple.com>Mon Jan 07 17:31:17 2019 +0000
committerCopybara-Service <copybara-worker@google.com>Tue Sep 01 14:39:35 2020 -0700
tree2b7dffce1e5cc455602d275a9d970c0d804e4f93
parent6b010a7169b945f6c68a02c2bf2180420c49f0df [diff]
[pstl] Avoid shadowing explicit lambda capture with lambda parameter

Summary:
Recent Clangs give an error for this. Note that the size of this diff is
caused by running clang-format on the result of removing the captures.
I guess we'll see how well that works for us.

Reviewers: jfb, rodgert

Subscribers: jkorous, dexonsmith, libcxx-commits, mclow.lists

Differential Revision: https://reviews.llvm.org/D55945

llvm-svn: 350544
GitOrigin-RevId: 1f66672515773d8086d0d167ad494c87c3f93da9
1 file changed
tree: 2b7dffce1e5cc455602d275a9d970c0d804e4f93
  1. build/
  2. cmake/
  3. include/
  4. test/
  5. .arcconfig
  6. .clang-format
  7. CMakeLists.txt
  8. CREDITS.txt
  9. LICENSE.txt
  10. ParallelSTLConfig.cmake.in
  11. README.md
README.md

Parallel STL

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.

Prerequisites

To use Parallel STL, you must have the following software installed:

  • C++ compiler with:
    • Support for C++11
    • Support for OpenMP* 4.0 SIMD constructs
  • Threading Building Blocks (TBB) which is available for download at https://github.com/01org/tbb/

Known issues and limitations

  • unseq and par_unseq policies only have effect with compilers that support #pragma omp simd or #pragma simd.
  • Parallel and vector execution is only supported for the algorithms if random access iterators are provided, while for other iterator types the execution will remain serial.
  • The following algorithms do not allow efficient SIMD execution: 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.
  • The initial value type for 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.
  • For 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.
  • For remove, remove_if, unique the dereferenced value type of the provided iterators shall be MoveConstructible.
  • The following algorithms require additional O(n) memory space for parallel execution: copy_if, inplace_merge, partial_sort, partial_sort_copy, partition_copy, remove, remove_if, rotate, sort, stable_sort, unique, unique_copy.