| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| numeric_impl.h | 84 [__first1, __first2, __binary_op1, __binary_op2](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j, member in namespace:__pstl
87 return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init,
142 [__unary_op, __binary_op](_RandomAccessIterator __i, _RandomAccessIterator __j, _Tp __init) {
143 return __internal::__brick_transform_reduce(__i, __j, __init, __binary_op, __unary_op, _IsVector{});
252 [__first, __unary_op, __binary_op](_DifferenceType __i, _DifferenceType __j, _Tp __init)
255 return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op,
259 [__first, __unary_op, __binary_op, __result](_DifferenceType __i, _DifferenceType __j, _Tp __init)
261 return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op,
|
| parallel_backend_utils.h | 82 const auto __j = __zs - __zs_beg; local
83 if (__same_move_seq || __j < __nx)
100 const auto __j = __zs - __zs_beg; local
101 if (__same_move_seq || __j < __nx)
109 const auto __j = __zs - __zs_beg; local
110 if (__same_move_seq || __j < __nx)
|
| parallel_backend_tbb.h | 187 _Index __j = __range.end(); local
195 if (__i == __j)
198 sum() = _M_brick_reduce(__i, __j, sum());
258 _Index __j = __range.end(); local
264 if (__i == __j)
267 sum() = _M_brick_reduce(__i, __j, sum());
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| numeric_impl.h | 80 __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j, _Tp __init) -> _Tp { member in namespace:__pstl
81 return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init, __binary_op1,
131 [__unary_op, __binary_op, __is_vector](_ForwardIterator __i, _ForwardIterator __j, _Tp __init) {
132 return __internal::__brick_transform_reduce(__i, __j, __init, __binary_op, __unary_op, __is_vector);
236 [__first, __unary_op, __binary_op](_DifferenceType __i, _DifferenceType __j, _Tp __init) {
238 return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op,
242 [__first, __unary_op, __binary_op, __result, __is_vector](_DifferenceType __i, _DifferenceType __j,
244 return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op,
|
| parallel_backend_utils.h | 82 const auto __j = __zs - __zs_beg; local
83 if (__same_move_seq || __j < __nx)
100 const auto __j = __zs - __zs_beg; local
101 if (__same_move_seq || __j < __nx)
109 const auto __j = __zs - __zs_beg; local
110 if (__same_move_seq || __j < __nx)
|
| parallel_backend_tbb.h | 177 _Index __j = __range.end(); local
185 if (__i == __j)
188 sum() = _M_brick_reduce(__i, __j, sum());
248 _Index __j = __range.end(); local
254 if (__i == __j)
257 sum() = _M_brick_reduce(__i, __j, sum());
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 194 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
195 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
491 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
492 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
686 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
687 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 194 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
195 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
491 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
492 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
686 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
687 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| ropeimpl.h | 170 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
172 if (__j < 0) __j = 0;
173 while (__j <= __curr_depth)
174 __x._M_path_end[++__i] = __path[__j++];
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| ropeimpl.h | 170 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
172 if (__j < 0) __j = 0;
173 while (__j <= __curr_depth)
174 __x._M_path_end[++__i] = __path[__j++];
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| ranges_algo.h | 3390 auto __j = __lasti; local
3393 std::__invoke(__proj, *--__j)))
3395 ranges::iter_swap(__i, __j);
3452 auto __j = __lasti; local
3454 std::__invoke(__proj, *--__j),
3457 ranges::iter_swap(__i, __j);
|
| stl_algo.h | 2907 _BidirectionalIterator __j = __last; local
2908 while (!__comp(__i, --__j))
2910 std::iter_swap(__i, __j);
3009 _BidirectionalIterator __j = __last; local
3010 while (!__comp(--__j, __i))
3012 std::iter_swap(__i, __j);
4503 _RandomAccessIterator __j = __first local
4505 if (__i != __j)
4506 std::iter_swap(__i, __j);
4547 _RandomAccessIterator __j = __first + __rand((__i - __first) + 1) local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| ranges_algo.h | 3461 auto __j = __lasti; local
3464 std::__invoke(__proj, *--__j)))
3466 ranges::iter_swap(__i, __j);
3523 auto __j = __lasti; local
3525 std::__invoke(__proj, *--__j),
3528 ranges::iter_swap(__i, __j);
|
| stl_algo.h | 2909 _BidirectionalIterator __j = __last; local
2910 while (!__comp(__i, --__j))
2912 std::iter_swap(__i, __j);
3011 _BidirectionalIterator __j = __last; local
3012 while (!__comp(--__j, __i))
3014 std::iter_swap(__i, __j);
4552 _RandomAccessIterator __j = __first local
4554 if (__i != __j)
4555 std::iter_swap(__i, __j);
4597 _RandomAccessIterator __j = __first + __rand((__i - __first) + 1) local
[all...] |
