HomeSort by relevance Sort by last modified time
    Searched full:__begin (Results 26 - 50 of 256) sorted by null

12 3 4 5 6 7 8 91011

  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
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...]
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);
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,
par_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end,
74 const _DifferenceType __length = __end - __begin;
102 __reduct = new _Result(__f(__o, __begin + __start));
110 *__reduct = __r(*__reduct, __f(__o, __begin + __start));
128 __f._M_finish_iterator = __begin + __length;
unique_copy.h 83 _DifferenceType __begin, __end; local
92 __begin = __borders[0] + 1; // == 1
98 for (_IIter __iter = __first + __begin; __iter < __first + __end;
110 __begin = __borders[__iam]; //one part
113 for (_IIter __iter = __first + __begin; __iter < __first + __end;
139 __begin = __borders[__num_threads];
142 for (_IIter __iter = __first + __begin; __iter < __first + __end;
161 for (_IIter __iter = __first + __begin; __iter < __first + __end;
omp_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_omp_loop(_RAIter __begin, _RAIter __end,
76 _DifferenceType __length = __end - __begin;
98 __f(__o, __begin+__pos));
108 __f._M_finish_iterator = __begin + __length;
omp_loop_static.h 46 * @param __begin Begin iterator of element sequence.
66 __for_each_template_random_access_omp_loop_static(_RAIter __begin,
76 _DifferenceType __length = __end - __begin;
98 __f(__o, __begin+__pos));
108 __f.finish_iterator = __begin + __length;
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
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...]
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);
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,
par_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end,
74 const _DifferenceType __length = __end - __begin;
102 __reduct = new _Result(__f(__o, __begin + __start));
110 *__reduct = __r(*__reduct, __f(__o, __begin + __start));
128 __f._M_finish_iterator = __begin + __length;
unique_copy.h 83 _DifferenceType __begin, __end; local
92 __begin = __borders[0] + 1; // == 1
98 for (_IIter __iter = __first + __begin; __iter < __first + __end;
110 __begin = __borders[__iam]; //one part
113 for (_IIter __iter = __first + __begin; __iter < __first + __end;
139 __begin = __borders[__num_threads];
142 for (_IIter __iter = __first + __begin; __iter < __first + __end;
161 for (_IIter __iter = __first + __begin; __iter < __first + __end;
omp_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_omp_loop(_RAIter __begin, _RAIter __end,
76 _DifferenceType __length = __end - __begin;
98 __f(__o, __begin+__pos));
108 __f._M_finish_iterator = __begin + __length;
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
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...]
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);
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,
par_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end,
74 const _DifferenceType __length = __end - __begin;
102 __reduct = new _Result(__f(__o, __begin + __start));
110 *__reduct = __r(*__reduct, __f(__o, __begin + __start));
128 __f._M_finish_iterator = __begin + __length;
unique_copy.h 83 _DifferenceType __begin, __end; local
92 __begin = __borders[0] + 1; // == 1
98 for (_IIter __iter = __first + __begin; __iter < __first + __end;
110 __begin = __borders[__iam]; //one part
113 for (_IIter __iter = __first + __begin; __iter < __first + __end;
139 __begin = __borders[__num_threads];
142 for (_IIter __iter = __first + __begin; __iter < __first + __end;
161 for (_IIter __iter = __first + __begin; __iter < __first + __end;
  /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);
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,
par_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end,
74 const _DifferenceType __length = __end - __begin;
102 __reduct = new _Result(__f(__o, __begin + __start));
110 *__reduct = __r(*__reduct, __f(__o, __begin + __start));
128 __f._M_finish_iterator = __begin + __length;
unique_copy.h 83 _DifferenceType __begin, __end; local
92 __begin = __borders[0] + 1; // == 1
98 for (_IIter __iter = __first + __begin; __iter < __first + __end;
110 __begin = __borders[__iam]; //one part
113 for (_IIter __iter = __first + __begin; __iter < __first + __end;
139 __begin = __borders[__num_threads];
142 for (_IIter __iter = __first + __begin; __iter < __first + __end;
161 for (_IIter __iter = __first + __begin; __iter < __first + __end;
omp_loop.h 47 * @param __begin Begin iterator of element sequence.
67 __for_each_template_random_access_omp_loop(_RAIter __begin, _RAIter __end,
76 _DifferenceType __length = __end - __begin;
98 __f(__o, __begin+__pos));
108 __f._M_finish_iterator = __begin + __length;
omp_loop_static.h 46 * @param __begin Begin iterator of element sequence.
66 __for_each_template_random_access_omp_loop_static(_RAIter __begin,
76 _DifferenceType __length = __end - __begin;
98 __f(__o, __begin+__pos));
108 __f.finish_iterator = __begin + __length;
  /external/clang/test/SemaCXX/
template-implicit-vars.cpp 13 // CHECK: VarDecl {{.*}} implicit used __begin

Completed in 413 milliseconds

12 3 4 5 6 7 8 91011