| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| checkers.h | 42 * @brief Check whether @c [__begin, @c __end) is sorted according
44 * @param __begin Begin iterator of sequence.
51 __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
53 if (__begin == __end)
56 _IIter __current(__begin), __recent(__begin);
|
| sort.h | 61 __parallel_sort(_RAIter __begin, _RAIter __end,
67 * @param __begin Begin iterator of input sequence.
75 __parallel_sort(_RAIter __begin, _RAIter __end,
78 _GLIBCXX_CALL(__end - __begin)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
91 * @param __begin Begin iterator of input sequence.
99 __parallel_sort(_RAIter __begin, _RAIter __end,
103 _GLIBCXX_CALL(__end - __begin)
106 (__begin, __end, __comp, __parallelism.__get_num_threads())
[all...] |
| partial_sum.h | 47 * @param __begin Begin iterator of input sequence.
58 __parallel_partial_sum_basecase(_IIter __begin, _IIter __end,
63 if (__begin == __end)
66 while (__begin != __end)
68 __value = __bin_op(__value, *__begin);
71 ++__begin;
78 * @param __begin Begin iterator of input sequence.
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end,
98 if (__begin == __end)
106 *__result = *__begin;
[all...] |
| quicksort.h | 41 * @param __begin Begin iterator of subsequence.
51 __parallel_sort_qs_divide(_RAIter __begin, _RAIter __end,
62 _DifferenceType __n = __end - __begin;
73 ::new(&(__samples[__s])) _ValueType(__begin[__index]);
82 _DifferenceType __split = __parallel_partition(__begin, __end,
93 * @param __begin Begin iterator of subsequence.
101 __parallel_sort_qs_conquer(_RAIter __begin, _RAIter __end,
111 __gnu_sequential::sort(__begin, __end, __comp);
115 _DifferenceType __n = __end - __begin, __pivot_rank;
130 (__begin, __end, __comp, __pivot_rank
[all...] |
| balanced_quicksort.h | 92 * @param __begin Begin iterator of subsequence.
97 * @pre @c (__end-__begin)>=1 */
100 __qsb_divide(_RAIter __begin, _RAIter __end,
110 __median_of_three_iterators(__begin, __begin + (__end - __begin) / 2,
115 _DifferenceType __n = __end - __begin;
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
277 _RAIter __begin = __current.first, __end = __current.second; local
[all...] |
| partition.h | 48 * @param __begin Begin iterator of input sequence to split.
56 __parallel_partition(_RAIter __begin, _RAIter __end,
63 _DifferenceType __n = __end - __begin;
169 while (__pred(__begin[__thread_left])
172 while (!__pred(__begin[__thread_right])
181 std::iter_swap(__begin + __thread_left,
182 __begin + __thread_right);
241 std::swap_ranges(__begin + __thread_left_border
243 __begin + __thread_left_border + 1,
244 __begin + __swapstart)
[all...] |
| for_each.h | 46 * @param __begin Begin iterator of input sequence.
61 __for_each_template_random_access(_IIter __begin, _IIter __end,
73 (__begin, __end, __user_op, __functionality, __reduction,
77 (__begin, __end, __user_op, __functionality, __reduction,
81 (__begin, __end, __user_op, __functionality, __reduction,
85 (__begin, __end, __user_op, __functionality, __reduction,
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| checkers.h | 42 * @brief Check whether @c [__begin, @c __end) is sorted according
44 * @param __begin Begin iterator of sequence.
51 __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
53 if (__begin == __end)
56 _IIter __current(__begin), __recent(__begin);
|
| sort.h | 61 __parallel_sort(_RAIter __begin, _RAIter __end,
67 * @param __begin Begin iterator of input sequence.
75 __parallel_sort(_RAIter __begin, _RAIter __end,
78 _GLIBCXX_CALL(__end - __begin)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
91 * @param __begin Begin iterator of input sequence.
99 __parallel_sort(_RAIter __begin, _RAIter __end,
103 _GLIBCXX_CALL(__end - __begin)
106 (__begin, __end, __comp, __parallelism.__get_num_threads())
[all...] |
| partial_sum.h | 47 * @param __begin Begin iterator of input sequence.
58 __parallel_partial_sum_basecase(_IIter __begin, _IIter __end,
63 if (__begin == __end)
66 while (__begin != __end)
68 __value = __bin_op(__value, *__begin);
71 ++__begin;
78 * @param __begin Begin iterator of input sequence.
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end,
98 if (__begin == __end)
106 *__result = *__begin;
[all...] |
| quicksort.h | 41 * @param __begin Begin iterator of subsequence.
51 __parallel_sort_qs_divide(_RAIter __begin, _RAIter __end,
62 _DifferenceType __n = __end - __begin;
73 ::new(&(__samples[__s])) _ValueType(__begin[__index]);
82 _DifferenceType __split = __parallel_partition(__begin, __end,
93 * @param __begin Begin iterator of subsequence.
101 __parallel_sort_qs_conquer(_RAIter __begin, _RAIter __end,
111 __gnu_sequential::sort(__begin, __end, __comp);
115 _DifferenceType __n = __end - __begin, __pivot_rank;
130 (__begin, __end, __comp, __pivot_rank
[all...] |
| balanced_quicksort.h | 92 * @param __begin Begin iterator of subsequence.
97 * @pre @c (__end-__begin)>=1 */
100 __qsb_divide(_RAIter __begin, _RAIter __end,
110 __median_of_three_iterators(__begin, __begin + (__end - __begin) / 2,
115 _DifferenceType __n = __end - __begin;
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
277 _RAIter __begin = __current.first, __end = __current.second; local
[all...] |
| partition.h | 48 * @param __begin Begin iterator of input sequence to split.
56 __parallel_partition(_RAIter __begin, _RAIter __end,
63 _DifferenceType __n = __end - __begin;
169 while (__pred(__begin[__thread_left])
172 while (!__pred(__begin[__thread_right])
181 std::iter_swap(__begin + __thread_left,
182 __begin + __thread_right);
241 std::swap_ranges(__begin + __thread_left_border
243 __begin + __thread_left_border + 1,
244 __begin + __swapstart)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| checkers.h | 42 * @brief Check whether @c [__begin, @c __end) is sorted according
44 * @param __begin Begin iterator of sequence.
51 __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
53 if (__begin == __end)
56 _IIter __current(__begin), __recent(__begin);
|
| sort.h | 61 __parallel_sort(_RAIter __begin, _RAIter __end,
67 * @param __begin Begin iterator of input sequence.
75 __parallel_sort(_RAIter __begin, _RAIter __end,
78 _GLIBCXX_CALL(__end - __begin)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
91 * @param __begin Begin iterator of input sequence.
99 __parallel_sort(_RAIter __begin, _RAIter __end,
103 _GLIBCXX_CALL(__end - __begin)
106 (__begin, __end, __comp, __parallelism.__get_num_threads())
[all...] |
| partial_sum.h | 47 * @param __begin Begin iterator of input sequence.
58 __parallel_partial_sum_basecase(_IIter __begin, _IIter __end,
63 if (__begin == __end)
66 while (__begin != __end)
68 __value = __bin_op(__value, *__begin);
71 ++__begin;
78 * @param __begin Begin iterator of input sequence.
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end,
98 if (__begin == __end)
106 *__result = *__begin;
[all...] |
| quicksort.h | 41 * @param __begin Begin iterator of subsequence.
51 __parallel_sort_qs_divide(_RAIter __begin, _RAIter __end,
62 _DifferenceType __n = __end - __begin;
73 ::new(&(__samples[__s])) _ValueType(__begin[__index]);
82 _DifferenceType __split = __parallel_partition(__begin, __end,
93 * @param __begin Begin iterator of subsequence.
101 __parallel_sort_qs_conquer(_RAIter __begin, _RAIter __end,
111 __gnu_sequential::sort(__begin, __end, __comp);
115 _DifferenceType __n = __end - __begin, __pivot_rank;
130 (__begin, __end, __comp, __pivot_rank
[all...] |
| balanced_quicksort.h | 92 * @param __begin Begin iterator of subsequence.
97 * @pre @c (__end-__begin)>=1 */
100 __qsb_divide(_RAIter __begin, _RAIter __end,
110 __median_of_three_iterators(__begin, __begin + (__end - __begin) / 2,
115 _DifferenceType __n = __end - __begin;
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
277 _RAIter __begin = __current.first, __end = __current.second; local
[all...] |
| partition.h | 48 * @param __begin Begin iterator of input sequence to split.
56 __parallel_partition(_RAIter __begin, _RAIter __end,
63 _DifferenceType __n = __end - __begin;
169 while (__pred(__begin[__thread_left])
172 while (!__pred(__begin[__thread_right])
181 std::iter_swap(__begin + __thread_left,
182 __begin + __thread_right);
241 std::swap_ranges(__begin + __thread_left_border
243 __begin + __thread_left_border + 1,
244 __begin + __swapstart)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| checkers.h | 42 * @brief Check whether @c [__begin, @c __end) is sorted according
44 * @param __begin Begin iterator of sequence.
51 __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
53 if (__begin == __end)
56 _IIter __current(__begin), __recent(__begin);
|
| sort.h | 61 __parallel_sort(_RAIter __begin, _RAIter __end,
67 * @param __begin Begin iterator of input sequence.
75 __parallel_sort(_RAIter __begin, _RAIter __end,
78 _GLIBCXX_CALL(__end - __begin)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
91 * @param __begin Begin iterator of input sequence.
99 __parallel_sort(_RAIter __begin, _RAIter __end,
103 _GLIBCXX_CALL(__end - __begin)
106 (__begin, __end, __comp, __parallelism.__get_num_threads())
[all...] |
| partial_sum.h | 47 * @param __begin Begin iterator of input sequence.
58 __parallel_partial_sum_basecase(_IIter __begin, _IIter __end,
63 if (__begin == __end)
66 while (__begin != __end)
68 __value = __bin_op(__value, *__begin);
71 ++__begin;
78 * @param __begin Begin iterator of input sequence.
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end,
98 if (__begin == __end)
106 *__result = *__begin;
[all...] |
| quicksort.h | 41 * @param __begin Begin iterator of subsequence.
51 __parallel_sort_qs_divide(_RAIter __begin, _RAIter __end,
62 _DifferenceType __n = __end - __begin;
73 ::new(&(__samples[__s])) _ValueType(__begin[__index]);
82 _DifferenceType __split = __parallel_partition(__begin, __end,
93 * @param __begin Begin iterator of subsequence.
101 __parallel_sort_qs_conquer(_RAIter __begin, _RAIter __end,
111 __gnu_sequential::sort(__begin, __end, __comp);
115 _DifferenceType __n = __end - __begin, __pivot_rank;
130 (__begin, __end, __comp, __pivot_rank
[all...] |
| balanced_quicksort.h | 92 * @param __begin Begin iterator of subsequence.
97 * @pre @c (__end-__begin)>=1 */
100 __qsb_divide(_RAIter __begin, _RAIter __end,
110 __median_of_three_iterators(__begin, __begin + (__end - __begin) / 2,
115 _DifferenceType __n = __end - __begin;
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
277 _RAIter __begin = __current.first, __end = __current.second; local
[all...] |
| partition.h | 48 * @param __begin Begin iterator of input sequence to split.
56 __parallel_partition(_RAIter __begin, _RAIter __end,
63 _DifferenceType __n = __end - __begin;
169 while (__pred(__begin[__thread_left])
172 while (!__pred(__begin[__thread_right])
181 std::iter_swap(__begin + __thread_left,
182 __begin + __thread_right);
241 std::swap_ranges(__begin + __thread_left_border
243 __begin + __thread_left_border + 1,
244 __begin + __swapstart)
[all...] |
