//usr/include/c++/11/parallel
43 items
NAME ↑ SIZE MODIFIED PERMS ACTIONS
.. / Parent Directory
algo.h — 78.77 KB
2025-09-15 15:41 · rw-r--r--
78.77 KB 2025-09-15 15:41 rw-r--r--
algobase.h — 17.93 KB
2025-09-15 15:41 · rw-r--r--
17.93 KB 2025-09-15 15:41 rw-r--r--
algorithm — 1.35 KB
2025-09-15 15:41 · rw-r--r--
1.35 KB 2025-09-15 15:41 rw-r--r--
algorithmfwd.h — 31.55 KB
2025-09-15 15:41 · rw-r--r--
31.55 KB 2025-09-15 15:41 rw-r--r--
balanced_quicksort.h — 16.55 KB
2025-09-15 15:41 · rw-r--r--
16.55 KB 2025-09-15 15:41 rw-r--r--
base.h — 12.13 KB
2025-09-15 15:41 · rw-r--r--
12.13 KB 2025-09-15 15:41 rw-r--r--
basic_iterator.h — 1.55 KB
2025-09-15 15:41 · rw-r--r--
1.55 KB 2025-09-15 15:41 rw-r--r--
checkers.h — 2.18 KB
2025-09-15 15:41 · rw-r--r--
2.18 KB 2025-09-15 15:41 rw-r--r--
compatibility.h — 3.7 KB
2025-09-15 15:41 · rw-r--r--
3.7 KB 2025-09-15 15:41 rw-r--r--
compiletime_settings.h — 2.8 KB
2025-09-15 15:41 · rw-r--r--
2.8 KB 2025-09-15 15:41 rw-r--r--
equally_split.h — 3.28 KB
2025-09-15 15:41 · rw-r--r--
3.28 KB 2025-09-15 15:41 rw-r--r--
features.h — 3.46 KB
2025-09-15 15:41 · rw-r--r--
3.46 KB 2025-09-15 15:41 rw-r--r--
find.h — 13.27 KB
2025-09-15 15:41 · rw-r--r--
13.27 KB 2025-09-15 15:41 rw-r--r--
find_selectors.h — 6.83 KB
2025-09-15 15:41 · rw-r--r--
6.83 KB 2025-09-15 15:41 rw-r--r--
for_each.h — 3.85 KB
2025-09-15 15:41 · rw-r--r--
3.85 KB 2025-09-15 15:41 rw-r--r--
for_each_selectors.h — 10.32 KB
2025-09-15 15:41 · rw-r--r--
10.32 KB 2025-09-15 15:41 rw-r--r--
iterator.h — 5.54 KB
2025-09-15 15:41 · rw-r--r--
5.54 KB 2025-09-15 15:41 rw-r--r--
list_partition.h — 6.39 KB
2025-09-15 15:41 · rw-r--r--
6.39 KB 2025-09-15 15:41 rw-r--r--
losertree.h — 27.92 KB
2025-09-15 15:41 · rw-r--r--
27.92 KB 2025-09-15 15:41 rw-r--r--
merge.h — 9.35 KB
2025-09-15 15:41 · rw-r--r--
9.35 KB 2025-09-15 15:41 rw-r--r--
multiseq_selection.h — 21.56 KB
2025-09-15 15:41 · rw-r--r--
21.56 KB 2025-09-15 15:41 rw-r--r--
multiway_merge.h — 68.96 KB
2025-09-15 15:41 · rw-r--r--
68.96 KB 2025-09-15 15:41 rw-r--r--
multiway_mergesort.h — 14.92 KB
2025-09-15 15:41 · rw-r--r--
14.92 KB 2025-09-15 15:41 rw-r--r--
numeric — 20.23 KB
2025-09-15 15:41 · rw-r--r--
20.23 KB 2025-09-15 15:41 rw-r--r--
numericfwd.h — 7.33 KB
2025-09-15 15:41 · rw-r--r--
7.33 KB 2025-09-15 15:41 rw-r--r--
omp_loop.h — 3.94 KB
2025-09-15 15:41 · rw-r--r--
3.94 KB 2025-09-15 15:41 rw-r--r--
omp_loop_static.h — 4.01 KB
2025-09-15 15:41 · rw-r--r--
4.01 KB 2025-09-15 15:41 rw-r--r--
par_loop.h — 4.45 KB
2025-09-15 15:41 · rw-r--r--
4.45 KB 2025-09-15 15:41 rw-r--r--
parallel.h — 1.54 KB
2025-09-15 15:41 · rw-r--r--
1.54 KB 2025-09-15 15:41 rw-r--r--
partial_sum.h — 7.3 KB
2025-09-15 15:41 · rw-r--r--
7.3 KB 2025-09-15 15:41 rw-r--r--
partition.h — 14.61 KB
2025-09-15 15:41 · rw-r--r--
14.61 KB 2025-09-15 15:41 rw-r--r--
queue.h — 5.41 KB
2025-09-15 15:41 · rw-r--r--
5.41 KB 2025-09-15 15:41 rw-r--r--
quicksort.h — 5.98 KB
2025-09-15 15:41 · rw-r--r--
5.98 KB 2025-09-15 15:41 rw-r--r--
random_number.h — 4.13 KB
2025-09-15 15:41 · rw-r--r--
4.13 KB 2025-09-15 15:41 rw-r--r--
random_shuffle.h — 18.24 KB
2025-09-15 15:41 · rw-r--r--
18.24 KB 2025-09-15 15:41 rw-r--r--
search.h — 5.26 KB
2025-09-15 15:41 · rw-r--r--
5.26 KB 2025-09-15 15:41 rw-r--r--
set_operations.h — 14.25 KB
2025-09-15 15:41 · rw-r--r--
14.25 KB 2025-09-15 15:41 rw-r--r--
settings.h — 12.17 KB
2025-09-15 15:41 · rw-r--r--
12.17 KB 2025-09-15 15:41 rw-r--r--
sort.h — 7.53 KB
2025-09-15 15:41 · rw-r--r--
7.53 KB 2025-09-15 15:41 rw-r--r--
tags.h — 5.84 KB
2025-09-15 15:41 · rw-r--r--
5.84 KB 2025-09-15 15:41 rw-r--r--
types.h — 3.63 KB
2025-09-15 15:41 · rw-r--r--
3.63 KB 2025-09-15 15:41 rw-r--r--
unique_copy.h — 6.02 KB
2025-09-15 15:41 · rw-r--r--
6.02 KB 2025-09-15 15:41 rw-r--r--
workstealing.h — 9.38 KB
2025-09-15 15:41 · rw-r--r--
9.38 KB 2025-09-15 15:41 rw-r--r--
ONLINE
parallel
43 items
18:36:14
TERMINAL FM
NAVIGATION
ACTIONS
SELECTION
Edit
Preview
Download
Rename
Copy
Chmod
Delete
// -*- C++ -*- // Copyright (C) 2007-2021 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the terms // of the GNU General Public License as published by the Free Software // Foundation; either version 3, or (at your option) any later // version. // This library is distributed in the hope that it will be useful, but // WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // . /** @file parallel/par_loop.h * @brief Parallelization of embarrassingly parallel execution by * means of equal splitting. * This file is a GNU parallel extension to the Standard C++ Library. */ // Written by Felix Putze. #ifndef _GLIBCXX_PARALLEL_PAR_LOOP_H #define _GLIBCXX_PARALLEL_PAR_LOOP_H 1 #include #include #include #include namespace __gnu_parallel { /** @brief Embarrassingly parallel algorithm for random access * iterators, using hand-crafted parallelization by equal splitting * the work. * * @param __begin Begin iterator of element sequence. * @param __end End iterator of element sequence. * @param __o User-supplied functor (comparator, predicate, adding * functor, ...) * @param __f Functor to "process" an element with __op (depends on * desired functionality, e. g. for std::for_each(), ...). * @param __r Functor to "add" a single __result to the already * processed elements (depends on functionality). * @param __base Base value for reduction. * @param __output Pointer to position where final result is written to * @param __bound Maximum number of elements processed (e. g. for * std::count_n()). * @return User-supplied functor (that may contain a part of the result). */ template _Op __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end, _Op __o, _Fu& __f, _Red __r, _Result __base, _Result& __output, typename std::iterator_traits<_RAIter>::difference_type __bound) { typedef std::iterator_traits<_RAIter> _TraitsType; typedef typename _TraitsType::difference_type _DifferenceType; const _DifferenceType __length = __end - __begin; _Result *__thread_results; bool* __constructed; _ThreadIndex __num_threads = __gnu_parallel::min<_DifferenceType> (__get_max_threads(), __length); # pragma omp parallel num_threads(__num_threads) { # pragma omp single { __num_threads = omp_get_num_threads(); __thread_results = static_cast<_Result*> (::operator new(__num_threads * sizeof(_Result))); __constructed = new bool[__num_threads]; } _ThreadIndex __iam = omp_get_thread_num(); // Neutral element. _Result* __reduct; _DifferenceType __start = __equally_split_point(__length, __num_threads, __iam), __stop = __equally_split_point(__length, __num_threads, __iam + 1); if (__start < __stop) { __reduct = new _Result(__f(__o, __begin + __start)); ++__start; __constructed[__iam] = true; } else __constructed[__iam] = false; for (; __start < __stop; ++__start) *__reduct = __r(*__reduct, __f(__o, __begin + __start)); if (__constructed[__iam]) { ::new(&__thread_results[__iam]) _Result(*__reduct); delete __reduct; } } //parallel for (_ThreadIndex __i = 0; __i < __num_threads; ++__i) if (__constructed[__i]) { __output = __r(__output, __thread_results[__i]); __thread_results[__i].~_Result(); } // Points to last element processed (needed as return value for // some algorithms like transform). __f._M_finish_iterator = __begin + __length; ::operator delete(__thread_results); delete[] __constructed; return __o; } } // end namespace #endif /* _GLIBCXX_PARALLEL_PAR_LOOP_H */