| /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
37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
40 if (__comp(__i - __first, __extremum))
46 const _DifferenceType __k = __res - __first;
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
67 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f)
70 std::forward<_ExecutionPolicy>(__exec), __first, __n, __f
[all...] |
| unseq_backend_simd.h | 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/ |
| simd_fixed_size.h | 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
[all...] |
| 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);
1050 const value_type* __first = _M_pathname.data(); local
1132 const value_type* __first = _M_pathname.data(); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| unseq_backend_simd.h | 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/ |
| simd_fixed_size.h | 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
[all...] |
| 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);
1057 const value_type* __first = _M_pathname.data(); local
1139 const value_type* __first = _M_pathname.data(); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
|
| /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__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
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);
1138 const char* __first = __u8str.data(); local
1188 const value_type* __first = _M_pathname.data(); local
[all...] |
| locale_conv.h | 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __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
579 _Elem* const __first = this->pbase(); local
[all...] |
| stl_bvector.h | 870 vector(_InputIterator __first, _InputIterator __last,
874 _M_initialize_range(__first, __last,
875 std::__iterator_category(__first));
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())
1462 insert(end(), __first, __last); local
[all...] |
| chrono_io.h | 247 auto __first = __pc.begin(); local
257 if (__first == __last || *__first == '}')
266 return __first;
268 __first = __spec._M_parse_fill_and_align(__first, __last);
270 return __first;
272 __first = __spec._M_parse_width(__first, __last, __pc);
274 return __first;
484 auto __first = _M_spec._M_chrono_specs.begin(); local
1242 _TDays __first; \/\/ First day of week 1. local
3707 auto __first = __str.data(); local
[all...] |
| ranges_algo.h | 80 operator()(_Iter __first, _Sent __last,
83 for (; __first != __last; ++__first)
84 if (!(bool)std::__invoke(__pred, std::__invoke(__proj, *__first)))
108 operator()(_Iter __first, _Sent __last,
111 for (; __first != __last; ++__first)
112 if (std::__invoke(__pred, std::__invoke(__proj, *__first)))
136 operator()(_Iter __first, _Sent __last,
139 for (; __first != __last; ++__first
2909 auto __first = ranges::begin(__r); local
3012 auto __first = ranges::begin(__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__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
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);
1143 const char* __first = __u8str.data(); local
1193 const value_type* __first = _M_pathname.data(); local
[all...] |
| locale_conv.h | 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __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
579 _Elem* const __first = this->pbase(); local
[all...] |
| stl_bvector.h | 824 vector(_InputIterator __first, _InputIterator __last,
828 _M_initialize_range(__first, __last,
829 std::__iterator_category(__first));
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())
1416 insert(end(), __first, __last); local
[all...] |
| ranges_algo.h | 77 operator()(_Iter __first, _Sent __last,
80 for (; __first != __last; ++__first)
81 if (!(bool)std::__invoke(__pred, std::__invoke(__proj, *__first)))
105 operator()(_Iter __first, _Sent __last,
108 for (; __first != __last; ++__first)
109 if (std::__invoke(__pred, std::__invoke(__proj, *__first)))
133 operator()(_Iter __first, _Sent __last,
136 for (; __first != __last; ++__first
2930 auto __first = ranges::begin(__r); local
2984 auto __first = ranges::begin(__r); local
3083 auto __first = ranges::begin(__r); local
[all...] |
| /src/external/apache2/llvm/dist/libcxx/include/__memory/ |
| shared_ptr.h | 343 typename _CompressedPair::_Base1* __first = _CompressedPair::__get_first_base(__as_pair); variable
344 _Alloc *__alloc = reinterpret_cast<_Alloc*>(__first);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 230 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
231 const unsigned long* __last = __first + (int)_S_num_primes;
232 const unsigned long* pos = std::lower_bound(__first, __last, __n);
520 _Node* __first; local
521 for (__first = _M_buckets[__n];
522 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
523 __first = __first->_M_next)
525 return iterator(__first, this)
532 const _Node* __first; local
763 _Node* __first = _M_buckets[__n]; local
782 _Node* __first = _M_buckets[__n]; local
809 _Node* __first = _M_buckets[__n]; local
884 _Node* __first = _M_buckets[__n]; local
1034 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 230 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
231 const unsigned long* __last = __first + (int)_S_num_primes;
232 const unsigned long* pos = std::lower_bound(__first, __last, __n);
520 _Node* __first; local
521 for (__first = _M_buckets[__n];
522 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
523 __first = __first->_M_next)
525 return iterator(__first, this)
532 const _Node* __first; local
763 _Node* __first = _M_buckets[__n]; local
782 _Node* __first = _M_buckets[__n]; local
809 _Node* __first = _M_buckets[__n]; local
884 _Node* __first = _M_buckets[__n]; local
1034 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| bitmap_allocator.h | 178 iterator __first = this->begin(); local
180 while (__first != __pos)
182 *__start = *__first;
183 ++__start; ++__first;
187 while (__first != this->end())
189 *__start = *__first;
190 ++__start; ++__first;
236 __lower_bound(_ForwardIterator __first, _ForwardIterator __last,
242 _DistanceType __len = __last - __first;
249 __middle = __first;
734 _BPiter __first = _S_mem_blocks.begin(); local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| bitmap_allocator.h | 176 iterator __first = this->begin(); local
178 while (__first != __pos)
180 *__start = *__first;
181 ++__start; ++__first;
185 while (__first != this->end())
187 *__start = *__first;
188 ++__start; ++__first;
234 __lower_bound(_ForwardIterator __first, _ForwardIterator __last,
240 _DistanceType __len = __last - __first;
247 __middle = __first;
732 _BPiter __first = _S_mem_blocks.begin(); local
[all...] |
