/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/pstl/ |
A D | parallel_backend_utils.h | 52 … operator()(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, in operator() 57 if (__xs != __xe) in operator() 63 if (__comp(*__ys, *__xs)) in operator() 82 _M_move_values(__xs, __zs); in operator() 84 if (++__xs == __xe) in operator() 91 __zs = _M_move_sequences(__xs, __xe, __zs); in operator() 101 __ys = __xs; in operator() 110 __init_buf(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _OutputIterator __zs, bool __b… in __init_buf() argument 112 const _OutputIterator __ze = __zs + (__xe - __xs); in __init_buf() 117 for (; __zs != __ze; ++__xs, ++__zs) in __init_buf() [all …]
|
A D | parallel_backend_tbb.h | 421 …__merge_task(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, in __merge_task() argument 424 …: _M_xs(__xs), _M_xe(__xe), _M_ys(__ys), _M_ye(__ye), _M_zs(__zs), _M_comp(__comp), _M_cleanup(__c… in __merge_task() 496 …__stable_sort_task(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator… in __stable_sort_task() argument 498 …: _M_xs(__xs), _M_xe(__xe), _M_zs(__zs), _M_comp(__comp), _M_leaf_sort(__leaf_sort), _M_inplace(__… in __stable_sort_task() 580 __parallel_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __xs, _RandomAccessIterator __xe, … 587 const _DifferenceType __n = __xe - __xs; 603 __leaf_sort(__xs, __xe, __comp); 614 __parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, in __parallel_merge() argument 621 const _SizeType __n = (__xe - __xs) + (__ye - __ys); in __parallel_merge() 626 __leaf_merge(__xs, __xe, __ys, __ye, __zs, __comp); in __parallel_merge() [all …]
|
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/pstl/ |
A D | parallel_backend_utils.h | 52 … operator()(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, in operator() 57 if (__xs != __xe) in operator() 63 if (__comp(*__ys, *__xs)) in operator() 82 _M_move_values(__xs, __zs); in operator() 84 if (++__xs == __xe) in operator() 91 __zs = _M_move_sequences(__xs, __xe, __zs); in operator() 101 __ys = __xs; in operator() 110 __init_buf(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _OutputIterator __zs, bool __b… in __init_buf() argument 112 const _OutputIterator __ze = __zs + (__xe - __xs); in __init_buf() 117 for (; __zs != __ze; ++__xs, ++__zs) in __init_buf() [all …]
|
A D | parallel_backend_tbb.h | 425 …__merge_task(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, in __merge_task() argument 428 …: _M_xs(__xs), _M_xe(__xe), _M_ys(__ys), _M_ye(__ye), _M_zs(__zs), _M_comp(__comp), _M_cleanup(__c… in __merge_task() 500 …__stable_sort_task(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator… in __stable_sort_task() argument 502 …: _M_xs(__xs), _M_xe(__xe), _M_zs(__zs), _M_comp(__comp), _M_leaf_sort(__leaf_sort), _M_inplace(__… in __stable_sort_task() 586 __parallel_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __xs, _RandomAccessIterator __xe, … 593 const _DifferenceType __n = __xe - __xs; 609 __leaf_sort(__xs, __xe, __comp); 620 __parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, in __parallel_merge() argument 627 const _SizeType __n = (__xe - __xs) + (__ye - __ys); in __parallel_merge() 632 __leaf_merge(__xs, __xe, __ys, __ye, __zs, __comp); in __parallel_merge() [all …]
|
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/pstl/ |
A D | parallel_backend_utils.h | 48 … operator()(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, in operator() 58 auto __nx = __xe - __xs; in operator() 62 if (__xs != __xe) in operator() 68 if (__comp(*__ys, *__xs)) in operator() 94 __move_value_x(__xs, __zs); in operator() 96 __move_value_y(__xs, __zs); in operator() 98 if (++__xs == __xe) in operator() 112 __zs = __move_sequence_x(__xs, __xe, __zs); in operator() 117 __zs = __move_sequence_y(__xs, __xe, __zs); in operator() 125 __ys = __xs; in operator()
|
A D | parallel_backend_tbb.h | 827 …: _M_xs(__xs), _M_xe(__xe), _M_ys(__ys), _M_ye(__ye), _M_zs(__zs), _M_x_beg(__x_beg), _M_z_beg(__z… in __merge_func() 1104 …__stable_sort_func(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterator… in __stable_sort_func() argument 1107 … : _M_xs(__xs), _M_xe(__xe), _M_x_beg(__x_beg), _M_zs(__zs), _M_z_beg(__z_beg), _M_comp(__comp), in __stable_sort_func() 1164 const _DifferenceType __n = __xe - __xs; 1173 __xs, __xe, __buf.get(), true, __comp, __leaf_sort, __nsort, __xs, __buf.get()}; 1178 __leaf_sort(__xs, __xe, __comp); 1196 …__merge_func_static(_RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, _RandomAccessIterato… in __merge_func_static() argument 1251 __parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe, in __parallel_merge() argument 1258 const _SizeType __n = (__xe - __xs) + (__ye - __ys); in __parallel_merge() 1263 __leaf_merge(__xs, __xe, __ys, __ye, __zs, __comp); in __parallel_merge() [all …]
|
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/bits/ |
A D | uses_allocator_args.h | 218 return std::apply([&](auto&&... __xs) { in _GLIBCXX_VISIBILITY() 219 return std::construct_at(__p, std::forward<decltype(__xs)>(__xs)...); in _GLIBCXX_VISIBILITY()
|
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/std/ |
A D | memory | 402 return std::apply([&](auto&&... __xs) { 403 return std::construct_at(__p, std::forward<decltype(__xs)>(__xs)...);
|
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/experimental/bits/ |
A D | simd.h | 3930 return __subscript_in_pack<_I - simd_size_v<_Tp, _Ap>>(__xs...); 3938 const simd<_Tp, _As>&... __xs) 3942 if constexpr (sizeof...(__xs) > 0) 3943 __store_pack_of_simd(__mem + __n_bytes, __xs...); 3951 concat(const simd<_Tp, _As>&... __xs) 3954 if constexpr (sizeof...(__xs) == 1) 3955 return simd_cast<_Rp>(__xs...); 3956 else if ((... && __xs._M_is_constprop())) 3959 auto __i) constexpr { return __subscript_in_pack<__i>(__xs...); }); 3975 return __call_with_subscripts<_Np>(__x, [](const auto&... __xs) { [all …]
|
A D | simd_builtin.h | 496 __vector_convert(_SimdWrapper<_From, _FromSize>... __xs) in __vector_convert() argument 501 if (!_FW::_S_is_partial && !(... && __xs._M_is_constprop())) in __vector_convert() 505 return __convert_x86<_To>(__as_vector(__xs)...); in __vector_convert() 507 return __vector_convert<_To>(__xs..., _FW{}); in __vector_convert() 512 __as_vector(__xs)..., in __vector_convert() 513 make_index_sequence<(sizeof...(__xs) == 1 ? std::min( in __vector_convert()
|
A D | simd_fixed_size.h | 657 __make_simd_tuple(const simd<_Tp, _A0>& __x0, const simd<_Tp, _As>&... __xs) 658 { return {__data(__x0), __make_simd_tuple(__xs...)}; }
|
A D | simd_x86.h | 1313 const auto __xs = reinterpret_cast<short>(__x._M_data); in _S_multiplies() local 1316 ((__xs * __ys) & 0xff) | ((__xs >> 8) * (__ys & 0xff00)))); in _S_multiplies()
|