| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| parallel_impl.h | 29 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first)
32 const _DifferenceType __n = __last - __first;
36 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
43 // If not '__last' returned then we found what we want so put this to extremum
55 return __extremum != __initial_dist ? __first + __extremum : __last;
64 __parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
67 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
|
| glue_algorithm_impl.h | 27 any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
30 std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
39 all_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred)
41 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, std::not_fn(__pred));
48 none_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
50 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred);
57 for_each(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f)
60 std::forward<_ExecutionPolicy>(__exec), __first, __last, __f, local
79 find_if(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
82 std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| fs_path.h | 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last); }
401 append(_InputIterator __first, _InputIterator __last)
1139 const char* __last = __first + __u8str.size(); local
1189 const value_type* __last = __first + _M_pathname.size(); local
[all...] |
| locale_conv.h | 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
72 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen);
75 __result = (__cvt.*__fn)(__state, __next, __last, __next,
79 while (__result == codecvt_base::partial && __next != __last
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last,
580 const _Elem* const __last = this->pptr(); local
[all...] |
| shared_ptr_base.h | 789 _Iter __last = __first; local
790 __last._M_pos = _M_n;
791 std::__uninitialized_copy_a(__first, __last, __p, _M_alloc);
|
| stl_deque.h | 988 * @param __last An input iterator.
992 * __last).
996 * distance(__first,__last)) and do no memory reallocation. But if only
1003 deque(_InputIterator __first, _InputIterator __last,
1007 _M_range_initialize(__first, __last,
1012 deque(_InputIterator __first, _InputIterator __last,
1018 _M_initialize_dispatch(__first, __last, _Integral());
1096 * @param __last An input iterator.
1099 * range [__first,__last).
1109 assign(_InputIterator __first, _InputIterator __last)
1965 _M_range_insert_aux(end(), __mid, __last, local
[all...] |
| stl_bvector.h | 870 vector(_InputIterator __first, _InputIterator __last,
874 _M_initialize_range(__first, __last,
879 vector(_InputIterator __first, _InputIterator __last,
885 _M_initialize_dispatch(__first, __last, _Integral());
973 assign(_InputIterator __first, _InputIterator __last)
974 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
978 assign(_InputIterator __first, _InputIterator __last)
982 _M_assign_dispatch(__first, __last, _Integral());
1216 _InputIterator __first, _InputIterator __last)
1220 __first, __last,
1462 insert(end(), __first, __last); local
1479 insert(end(), __mid, __last); local
[all...] |
| chrono_io.h | 248 auto __last = __pc.end(); local
257 if (__first == __last || *__first == '}')
268 __first = __spec._M_parse_fill_and_align(__first, __last);
272 __first = __spec._M_parse_width(__first, __last, __pc);
278 __first = __spec._M_parse_precision(__first, __last, __pc);
283 __first = __spec._M_parse_locale(__first, __last);
290 __string_view __str(__first, __last - __first);
295 __last = __first + __end;
314 while (__first != __last)
447 size_t __pos = __string_view(__first, __last - __first).find('%')
485 const auto __last = _M_spec._M_chrono_specs.end(); local
3708 auto __last = __first + __str.size(); local
[all...] |
| ranges_algo.h | 80 operator()(_Iter __first, _Sent __last,
83 for (; __first != __last; ++__first)
108 operator()(_Iter __first, _Sent __last,
111 for (; __first != __last; ++__first)
136 operator()(_Iter __first, _Sent __last,
139 for (; __first != __last; ++__first)
187 operator()(_Iter __first, _Sent __last, _Fun __f, _Proj __proj = {}) const
189 for (; __first != __last; ++__first)
222 auto __last = __first + __n;
223 return ranges::for_each(std::move(__first), std::move(__last),
2910 auto __last = ranges::end(__r); local
3013 auto __last = ranges::end(__r); local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| fs_path.h | 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last); }
401 append(_InputIterator __first, _InputIterator __last)
1144 const char* __last = __first + __u8str.size(); local
1194 const value_type* __last = __first + _M_pathname.size(); local
[all...] |
| locale_conv.h | 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
72 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen);
75 __result = (__cvt.*__fn)(__state, __next, __last, __next,
79 while (__result == codecvt_base::partial && __next != __last
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last,
580 const _Elem* const __last = this->pptr(); local
[all...] |
| shared_ptr_base.h | 791 _Iter __last = __first; local
792 __last._M_pos = _M_n;
793 std::__uninitialized_copy_a(__first, __last, __p, _M_alloc);
|
| stl_deque.h | 988 * @param __last An input iterator.
992 * __last).
996 * distance(__first,__last)) and do no memory reallocation. But if only
1003 deque(_InputIterator __first, _InputIterator __last,
1007 _M_range_initialize(__first, __last,
1012 deque(_InputIterator __first, _InputIterator __last,
1018 _M_initialize_dispatch(__first, __last, _Integral());
1096 * @param __last An input iterator.
1099 * range [__first,__last).
1109 assign(_InputIterator __first, _InputIterator __last)
1965 _M_range_insert_aux(end(), __mid, __last, local
[all...] |
| stl_bvector.h | 824 vector(_InputIterator __first, _InputIterator __last,
828 _M_initialize_range(__first, __last,
833 vector(_InputIterator __first, _InputIterator __last,
839 _M_initialize_dispatch(__first, __last, _Integral());
927 assign(_InputIterator __first, _InputIterator __last)
928 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
932 assign(_InputIterator __first, _InputIterator __last)
936 _M_assign_dispatch(__first, __last, _Integral());
1170 _InputIterator __first, _InputIterator __last)
1174 __first, __last,
1416 insert(end(), __first, __last); local
1433 insert(end(), __mid, __last); local
[all...] |
| ranges_algo.h | 77 operator()(_Iter __first, _Sent __last,
80 for (; __first != __last; ++__first)
105 operator()(_Iter __first, _Sent __last,
108 for (; __first != __last; ++__first)
133 operator()(_Iter __first, _Sent __last,
136 for (; __first != __last; ++__first)
184 operator()(_Iter __first, _Sent __last, _Fun __f, _Proj __proj = {}) const
186 for (; __first != __last; ++__first)
219 auto __last = __first + __n;
220 return ranges::for_each(std::move(__first), std::move(__last),
2931 auto __last = ranges::end(__r); local
2985 auto __last = ranges::end(__r); local
3084 auto __last = ranges::end(__r); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 231 const unsigned long* __last = __first + (int)_S_num_primes; local
232 const unsigned long* pos = std::lower_bound(__first, __last, __n);
233 return pos == __last ? *(__last - 1) : *pos;
566 erase(iterator __first, iterator __last);
572 erase(const_iterator __first, const_iterator __last);
637 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
640 _M_erase_bucket(const size_type __n, _Node* __last);
978 erase(iterator __first, iterator __last)
983 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/ |
| fs_path.h | 230 path(_InputIterator __first, _InputIterator __last)
231 : _M_pathname(_S_convert(__first, __last))
245 path(_InputIterator __first, _InputIterator __last, const locale& __loc)
246 : _M_pathname(_S_convert_loc(__first, __last, __loc))
270 assign(_InputIterator __first, _InputIterator __last)
271 { return *this = path(__first, __last); }
292 append(_InputIterator __first, _InputIterator __last)
293 { return _M_append(_S_convert(__first, __last)); }
323 concat(_InputIterator __first, _InputIterator __last)
324 { return *this += _S_convert(__first, __last); }
1051 const value_type* __last = __first + _M_pathname.size(); local
1133 const value_type* __last = __first + _M_pathname.size(); local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 231 const unsigned long* __last = __first + (int)_S_num_primes; local
232 const unsigned long* pos = std::lower_bound(__first, __last, __n);
233 return pos == __last ? *(__last - 1) : *pos;
566 erase(iterator __first, iterator __last);
572 erase(const_iterator __first, const_iterator __last);
637 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
640 _M_erase_bucket(const size_type __n, _Node* __last);
978 erase(iterator __first, iterator __last)
983 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/ |
| fs_path.h | 230 path(_InputIterator __first, _InputIterator __last)
231 : _M_pathname(_S_convert(__first, __last))
245 path(_InputIterator __first, _InputIterator __last, const locale& __loc)
246 : _M_pathname(_S_convert_loc(__first, __last, __loc))
270 assign(_InputIterator __first, _InputIterator __last)
271 { return *this = path(__first, __last); }
292 append(_InputIterator __first, _InputIterator __last)
293 { return _M_append(_S_convert(__first, __last)); }
323 concat(_InputIterator __first, _InputIterator __last)
324 { return *this += _S_convert(__first, __last); }
1058 const value_type* __last = __first + _M_pathname.size(); local
1140 const value_type* __last = __first + _M_pathname.size(); local
[all...] |
