/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
algobase.h | 54 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 56 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2); } 61 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 63 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 69 __mismatch_switch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 71 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 76 __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1, 83 __gnu_parallel::__find_template(__begin1, __end1, __begin2, __pred, 89 return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); 95 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2 [all...] |
find_selectors.h | 65 * @param __end1 End iterator of first sequence. 73 _RAIter1 __end1, 75 { return std::make_pair(find_if(__begin1, __end1, __pred, 98 * @param __end1 End iterator of first sequence. 106 _RAIter1 __end1, 110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1, 112 if (__spot == (__end1 + 1)) 113 __spot = __end1; 136 * @param __end1 End iterator of first sequence. 144 _RAIter1 __end1, [all...] |
merge.h | 46 * @param __end1 End iterator of first sequence. 57 __merge_advance_usual(_RAIter1& __begin1, _RAIter1 __end1, 63 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 73 if (__begin1 != __end1) 94 * @param __end1 End iterator of first sequence. 105 __merge_advance_movc(_RAIter1& __begin1, _RAIter1 __end1, 120 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 140 if (__begin1 != __end1) 160 * @param __end1 End iterator of first sequence. 171 __merge_advance(_RAIter1& __begin1, _RAIter1 __end1, [all...] |
search.h | 72 * @param __end1 End iterator of first sequence. 81 __search_template(__RAIter1 __begin1, __RAIter1 __end1, 88 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)); 94 return __end1; 97 _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length; 100 _DifferenceType __result = (__end1 - __begin1); 105 return __end1;
|
find.h | 48 * @param __end1 End iterator of first sequence. 60 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 66 return __find_template(__begin1, __end1, __begin2, __pred, 69 return __find_template(__begin1, __end1, __begin2, __pred, 72 return __find_template(__begin1, __end1, __begin2, __pred, 85 * @param __end1 End iterator of first sequence. 97 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 101 _GLIBCXX_CALL(__end1 - __begin1) 107 _DifferenceType __length = __end1 - __begin1; 164 * @param __end1 End iterator of first sequence [all...] |
set_operations.h | 350 __parallel_set_operation(_IIter __begin1, _IIter __end1, 354 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)) 360 if (__begin1 == __end1) 364 return __op.__second_empty(__begin1, __end1, __result); 366 const _DifferenceType __size = (__end1 - __begin1) + (__end2 - __begin2); 368 const _IteratorPair __sequence[2] = { std::make_pair(__begin1, __end1), 377 std::min(__end1 - __begin1, __end2 - __begin2)); 454 __op._M_invoke(__block_begin.first, __end1, 475 __parallel_set_union(_IIter __begin1, _IIter __end1, 479 return __parallel_set_operation(__begin1, __end1, __begin2, __end2 [all...] |
algo.h | 214 find_first_of(_IIter __begin1, _IIter __end1, 217 { return _GLIBCXX_STD_A::find_first_of(__begin1, __end1, __begin2, __end2); 224 find_first_of(_IIter __begin1, _IIter __end1, 228 __begin1, __end1, __begin2, __end2, __comp); } 234 __find_first_of_switch(_IIter __begin1, _IIter __end1, 237 { return find_first_of(__begin1, __end1, __begin2, __end2, 245 _RAIter __end1, 251 __find_template(__begin1, __end1, __begin1, __comp, 261 __find_first_of_switch(_IIter __begin1, _IIter __end1, 264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp, [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
algobase.h | 54 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 56 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2); } 61 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 63 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 69 __mismatch_switch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 71 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 76 __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1, 83 __gnu_parallel::__find_template(__begin1, __end1, __begin2, __pred, 89 return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); 95 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2 [all...] |
find_selectors.h | 65 * @param __end1 End iterator of first sequence. 73 _RAIter1 __end1, 75 { return std::make_pair(find_if(__begin1, __end1, __pred, 98 * @param __end1 End iterator of first sequence. 106 _RAIter1 __end1, 110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1, 112 if (__spot == (__end1 + 1)) 113 __spot = __end1; 136 * @param __end1 End iterator of first sequence. 144 _RAIter1 __end1, [all...] |
merge.h | 46 * @param __end1 End iterator of first sequence. 57 __merge_advance_usual(_RAIter1& __begin1, _RAIter1 __end1, 63 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 73 if (__begin1 != __end1) 94 * @param __end1 End iterator of first sequence. 105 __merge_advance_movc(_RAIter1& __begin1, _RAIter1 __end1, 120 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 140 if (__begin1 != __end1) 160 * @param __end1 End iterator of first sequence. 171 __merge_advance(_RAIter1& __begin1, _RAIter1 __end1, [all...] |
search.h | 72 * @param __end1 End iterator of first sequence. 81 __search_template(__RAIter1 __begin1, __RAIter1 __end1, 88 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)); 94 return __end1; 97 _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length; 100 _DifferenceType __result = (__end1 - __begin1); 105 return __end1;
|
find.h | 48 * @param __end1 End iterator of first sequence. 60 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 66 return __find_template(__begin1, __end1, __begin2, __pred, 69 return __find_template(__begin1, __end1, __begin2, __pred, 72 return __find_template(__begin1, __end1, __begin2, __pred, 85 * @param __end1 End iterator of first sequence. 97 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 101 _GLIBCXX_CALL(__end1 - __begin1) 107 _DifferenceType __length = __end1 - __begin1; 164 * @param __end1 End iterator of first sequence [all...] |
set_operations.h | 350 __parallel_set_operation(_IIter __begin1, _IIter __end1, 354 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)) 360 if (__begin1 == __end1) 364 return __op.__second_empty(__begin1, __end1, __result); 366 const _DifferenceType __size = (__end1 - __begin1) + (__end2 - __begin2); 368 const _IteratorPair __sequence[2] = { std::make_pair(__begin1, __end1), 377 std::min(__end1 - __begin1, __end2 - __begin2)); 454 __op._M_invoke(__block_begin.first, __end1, 475 __parallel_set_union(_IIter __begin1, _IIter __end1, 479 return __parallel_set_operation(__begin1, __end1, __begin2, __end2 [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
algobase.h | 54 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 56 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2); } 61 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 63 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 69 __mismatch_switch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 71 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 76 __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1, 83 __gnu_parallel::__find_template(__begin1, __end1, __begin2, __pred, 89 return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); 95 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2 [all...] |
find_selectors.h | 65 * @param __end1 End iterator of first sequence. 73 _RAIter1 __end1, 75 { return std::make_pair(find_if(__begin1, __end1, __pred, 98 * @param __end1 End iterator of first sequence. 106 _RAIter1 __end1, 110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1, 112 if (__spot == (__end1 + 1)) 113 __spot = __end1; 136 * @param __end1 End iterator of first sequence. 144 _RAIter1 __end1, [all...] |
merge.h | 46 * @param __end1 End iterator of first sequence. 57 __merge_advance_usual(_RAIter1& __begin1, _RAIter1 __end1, 63 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 73 if (__begin1 != __end1) 94 * @param __end1 End iterator of first sequence. 105 __merge_advance_movc(_RAIter1& __begin1, _RAIter1 __end1, 120 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 140 if (__begin1 != __end1) 160 * @param __end1 End iterator of first sequence. 171 __merge_advance(_RAIter1& __begin1, _RAIter1 __end1, [all...] |
search.h | 72 * @param __end1 End iterator of first sequence. 81 __search_template(__RAIter1 __begin1, __RAIter1 __end1, 88 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)); 94 return __end1; 97 _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length; 100 _DifferenceType __result = (__end1 - __begin1); 105 return __end1;
|
find.h | 48 * @param __end1 End iterator of first sequence. 60 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 66 return __find_template(__begin1, __end1, __begin2, __pred, 69 return __find_template(__begin1, __end1, __begin2, __pred, 72 return __find_template(__begin1, __end1, __begin2, __pred, 85 * @param __end1 End iterator of first sequence. 97 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 101 _GLIBCXX_CALL(__end1 - __begin1) 107 _DifferenceType __length = __end1 - __begin1; 164 * @param __end1 End iterator of first sequence [all...] |
set_operations.h | 350 __parallel_set_operation(_IIter __begin1, _IIter __end1, 354 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)) 360 if (__begin1 == __end1) 364 return __op.__second_empty(__begin1, __end1, __result); 366 const _DifferenceType __size = (__end1 - __begin1) + (__end2 - __begin2); 368 const _IteratorPair __sequence[2] = { std::make_pair(__begin1, __end1), 377 std::min(__end1 - __begin1, __end2 - __begin2)); 454 __op._M_invoke(__block_begin.first, __end1, 475 __parallel_set_union(_IIter __begin1, _IIter __end1, 479 return __parallel_set_operation(__begin1, __end1, __begin2, __end2 [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
algobase.h | 54 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 56 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2); } 61 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 63 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 69 __mismatch_switch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, 71 { return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); } 76 __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1, 83 __gnu_parallel::__find_template(__begin1, __end1, __begin2, __pred, 89 return _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); 95 mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2 [all...] |
find_selectors.h | 65 * @param __end1 End iterator of first sequence. 73 _RAIter1 __end1, 75 { return std::make_pair(find_if(__begin1, __end1, __pred, 98 * @param __end1 End iterator of first sequence. 106 _RAIter1 __end1, 110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1, 112 if (__spot == (__end1 + 1)) 113 __spot = __end1; 136 * @param __end1 End iterator of first sequence. 144 _RAIter1 __end1, [all...] |
merge.h | 46 * @param __end1 End iterator of first sequence. 57 __merge_advance_usual(_RAIter1& __begin1, _RAIter1 __end1, 63 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 73 if (__begin1 != __end1) 94 * @param __end1 End iterator of first sequence. 105 __merge_advance_movc(_RAIter1& __begin1, _RAIter1 __end1, 120 while (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0) 140 if (__begin1 != __end1) 160 * @param __end1 End iterator of first sequence. 171 __merge_advance(_RAIter1& __begin1, _RAIter1 __end1, [all...] |
search.h | 72 * @param __end1 End iterator of first sequence. 81 __search_template(__RAIter1 __begin1, __RAIter1 __end1, 88 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)); 94 return __end1; 97 _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length; 100 _DifferenceType __result = (__end1 - __begin1); 105 return __end1;
|
find.h | 48 * @param __end1 End iterator of first sequence. 60 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 66 return __find_template(__begin1, __end1, __begin2, __pred, 69 return __find_template(__begin1, __end1, __begin2, __pred, 72 return __find_template(__begin1, __end1, __begin2, __pred, 85 * @param __end1 End iterator of first sequence. 97 __find_template(_RAIter1 __begin1, _RAIter1 __end1, 101 _GLIBCXX_CALL(__end1 - __begin1) 107 _DifferenceType __length = __end1 - __begin1; 164 * @param __end1 End iterator of first sequence [all...] |
set_operations.h | 350 __parallel_set_operation(_IIter __begin1, _IIter __end1, 354 _GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2)) 360 if (__begin1 == __end1) 364 return __op.__second_empty(__begin1, __end1, __result); 366 const _DifferenceType __size = (__end1 - __begin1) + (__end2 - __begin2); 368 const _IteratorPair __sequence[2] = { std::make_pair(__begin1, __end1), 377 std::min(__end1 - __begin1, __end2 - __begin2)); 454 __op._M_invoke(__block_begin.first, __end1, 475 __parallel_set_union(_IIter __begin1, _IIter __end1, 479 return __parallel_set_operation(__begin1, __end1, __begin2, __end2 [all...] |