X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Fdoc%2Fhtml%2Fmanual%2Fparallel_mode.html;fp=libstdc%2B%2B-v3%2Fdoc%2Fhtml%2Fmanual%2Fparallel_mode.html;h=e757819ed2a4777983ae5e5d869b7fe22b4d7416;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html new file mode 100644 index 00000000..e757819e --- /dev/null +++ b/libstdc++-v3/doc/html/manual/parallel_mode.html @@ -0,0 +1,24 @@ + + +
Table of Contents
The libstdc++ parallel mode is an experimental parallel +implementation of many algorithms the C++ Standard Library. +
+Several of the standard algorithms, for instance
+std::sort
, are made parallel using OpenMP
+annotations. These parallel mode constructs and can be invoked by
+explicit source declaration or by compiling existing sources with a
+specific compiler flag.
+
The following library components in the include
+numeric
are included in the parallel mode:
std::accumulate
std::adjacent_difference
std::inner_product
std::partial_sum
The following library components in the include
+algorithm
are included in the parallel mode:
std::adjacent_find
std::count
std::count_if
std::equal
std::find
std::find_if
std::find_first_of
std::for_each
std::generate
std::generate_n
std::lexicographical_compare
std::mismatch
std::search
std::search_n
std::transform
std::replace
std::replace_if
std::max_element
std::merge
std::min_element
std::nth_element
std::partial_sort
std::partition
std::random_shuffle
std::set_union
std::set_intersection
std::set_symmetric_difference
std::set_difference
std::sort
std::stable_sort
std::unique_copy