| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| stl_heap.h | 76 __is_heap_until(_RandomAccessIterator __first, _Distance __n,
82 if (__comp(__first + __parent, __first + __child))
95 __is_heap(_RandomAccessIterator __first, _Distance __n)
98 return std::__is_heap_until(__first, __n, __comp) == __n;
105 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
109 return std::__is_heap_until(__first, __n, __cmp) == __n;
115 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
116 { return std::__is_heap(__first, std::distance(__first, __last));
[all...] |
| stl_numeric.h | 79 * @param __first Start of range.
88 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
95 __glibcxx_requires_valid_range(__first, __last);
97 for (; __first != __last; ++__first)
99 *__first = __value;
126 * @param __first Start of range.
134 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
138 __glibcxx_requires_valid_range(__first, __last);
140 for (; __first != __last; ++__first
[all...] |
| stl_uninitialized.h | 113 __do_uninit_copy(_InputIterator __first, _InputIterator __last,
119 for (; __first != __last; ++__first, (void)++__cur)
120 std::_Construct(std::__addressof(*__cur), *__first);
135 __uninit_copy(_InputIterator __first, _InputIterator __last,
137 { return std::__do_uninit_copy(__first, __last, __result); }
145 __uninit_copy(_InputIterator __first, _InputIterator __last,
147 { return std::copy(__first, __last, __result); }
154 * @param __first An input iterator.
157 * @return __result + (__first - __last
[all...] |
| stl_construct.h | 139 _Destroy(_ForwardIterator __first, _ForwardIterator __last);
160 __destroy(_ForwardIterator __first, _ForwardIterator __last)
162 for (; __first != __last; ++__first)
163 std::_Destroy(std::__addressof(*__first));
182 _Destroy(_ForwardIterator __first, _ForwardIterator __last)
193 return std::_Destroy_aux<false>::__destroy(__first, __last);
196 __destroy(__first, __last);
204 __destroy_n(_ForwardIterator __first, _Size __count)
206 for (; __count > 0; (void)++__first, --__count
[all...] |
| stl_algo.h | 106 __find_if_not(_InputIterator __first, _InputIterator __last,
109 return std::__find_if(__first, __last,
111 std::__iterator_category(__first));
120 __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred)
122 for (; __len; --__len, (void) ++__first)
123 if (!__pred(__first))
125 return __first;
197 __search_n_aux(_ForwardIterator __first, _ForwardIterator __last,
201 __first = std::__find_if(__first, __last, __unary_pred)
[all...] |
| charconv.h | 72 __to_chars_10_impl(char* __first, unsigned __len, _Tp __val) noexcept
88 __first[__pos] = __digits[__num + 1];
89 __first[__pos - 1] = __digits[__num];
95 __first[1] = __digits[__num + 1];
96 __first[0] = __digits[__num];
99 __first[0] = '0' + __val;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| stl_heap.h | 76 __is_heap_until(_RandomAccessIterator __first, _Distance __n,
82 if (__comp(__first + __parent, __first + __child))
95 __is_heap(_RandomAccessIterator __first, _Distance __n)
98 return std::__is_heap_until(__first, __n, __comp) == __n;
105 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
109 return std::__is_heap_until(__first, __n, __cmp) == __n;
115 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
116 { return std::__is_heap(__first, std::distance(__first, __last));
[all...] |
| stl_numeric.h | 79 * @param __first Start of range.
88 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
95 __glibcxx_requires_valid_range(__first, __last);
97 for (; __first != __last; ++__first)
99 *__first = __value;
126 * @param __first Start of range.
134 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
138 __glibcxx_requires_valid_range(__first, __last);
140 for (; __first != __last; ++__first
[all...] |
| stl_uninitialized.h | 113 __do_uninit_copy(_InputIterator __first, _InputIterator __last,
119 for (; __first != __last; ++__first, (void)++__cur)
120 std::_Construct(std::__addressof(*__cur), *__first);
135 __uninit_copy(_InputIterator __first, _InputIterator __last,
137 { return std::__do_uninit_copy(__first, __last, __result); }
145 __uninit_copy(_InputIterator __first, _InputIterator __last,
147 { return std::copy(__first, __last, __result); }
154 * @param __first An input iterator.
157 * @return __result + (__first - __last
[all...] |
| stl_construct.h | 139 _Destroy(_ForwardIterator __first, _ForwardIterator __last);
160 __destroy(_ForwardIterator __first, _ForwardIterator __last)
162 for (; __first != __last; ++__first)
163 std::_Destroy(std::__addressof(*__first));
182 _Destroy(_ForwardIterator __first, _ForwardIterator __last)
193 return std::_Destroy_aux<false>::__destroy(__first, __last);
196 __destroy(__first, __last);
204 __destroy_n(_ForwardIterator __first, _Size __count)
206 for (; __count > 0; (void)++__first, --__count
[all...] |
| stl_algo.h | 109 __find_if_not(_InputIterator __first, _InputIterator __last,
112 return std::__find_if(__first, __last,
114 std::__iterator_category(__first));
123 __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred)
125 for (; __len; --__len, (void) ++__first)
126 if (!__pred(__first))
128 return __first;
152 __search_n_aux(_ForwardIterator __first, _ForwardIterator __last,
156 __first = std::__find_if(__first, __last, __unary_pred)
[all...] |
| charconv.h | 81 __to_chars_10_impl(char* __first, unsigned __len, _Tp __val) noexcept
98 __first[__pos] = __digits[__num + 1];
99 __first[__pos - 1] = __digits[__num];
105 __first[1] = __digits[__num + 1];
106 __first[0] = __digits[__num];
109 __first[0] = '0' + __val;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/impl/ |
| profiler_algos.h | 84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f)
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last,
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first != __last; ++__first
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/ |
| functions.h | 52 * __first. This routine is useful when we can't use a separate
57 __check_valid_range(const _InputIterator& __first,
63 __glibcxx_check_valid_range_at(__first, __last,
65 return __first;
215 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
218 if (__first == __last)
221 _ForwardIterator __next = __first;
222 for (++__next; __next != __last; __first = __next, (void)++__next)
223 if (*__next < *__first)
243 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/ |
| functions.h | 52 * __first. This routine is useful when we can't use a separate
57 __check_valid_range(const _InputIterator& __first,
63 __glibcxx_check_valid_range_at(__first, __last,
65 return __first;
215 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
218 if (__first == __last)
221 _ForwardIterator __next = __first;
222 for (++__next; __next != __last; __first = __next, (void)++__next)
223 if (*__next < *__first)
243 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| memory_impl.h | 28 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
32 for (; __first != __last; ++__first, ++__result)
34 ::new (std::addressof(*__result)) _ValueType(std::move(*__first));
41 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
49 __first, __last - __first, __result,
55 __brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type) noexcept
59 for (; __first != __last; ++__first)
[all...] |
| 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
|
| algorithm_impl.h | 38 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
41 return std::any_of(__first, __last, __pred);
46 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
49 return __unseq_backend::__simd_or(__first, __last - __first, __pred);
54 __pattern_any_of(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred,
57 return __internal::__brick_any_of(__first, __last, __pred, __is_vector);
62 __pattern_any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred,
66 return __internal::__parallel_or(std::forward<_ExecutionPolicy>(__exec), __first, __last,
78 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __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/pstl/ |
| memory_impl.h | 28 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
32 for (; __first != __last; ++__first, ++__result)
34 ::new (std::addressof(*__result)) _ValueType(std::move(*__first));
41 __brick_uninitialized_move(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
49 __first, __last - __first, __result,
55 __brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type) noexcept
59 for (; __first != __last; ++__first)
[all...] |
| parallel_impl.h | 29 __parallel_find(_BackendTag __tag, _ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f,
33 const _DifferenceType __n = __last - __first;
37 __par_backend::__parallel_for(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
38 [__comp, __f, __first, &__extremum](_Index __i, _Index __j)
42 if (__comp(__i - __first, __extremum))
48 const _DifferenceType __k = __res - __first;
57 return __extremum != __initial_dist ? __first + __extremum : __last;
66 __parallel_or(_BackendTag __tag, _ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
69 __par_backend::__parallel_for(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
|
| algorithm_impl.h | 38 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
41 return std::any_of(__first, __last, __pred);
46 __brick_any_of(const _RandomAccessIterator __first, const _RandomAccessIterator __last, _Pred __pred,
49 return __unseq_backend::__simd_or(__first, __last - __first, __pred);
54 __pattern_any_of(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) noexcept
56 return __internal::__brick_any_of(__first, __last, __pred, typename _Tag::__is_vector{});
61 __pattern_any_of(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
69 return __internal::__parallel_or(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
80 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __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/apache2/llvm/dist/libcxx/include/__memory/ |
| uninitialized_algorithms.h | 127 void destroy(_ForwardIterator __first, _ForwardIterator __last) {
128 for (; __first != __last; ++__first)
129 _VSTD::destroy_at(_VSTD::addressof(*__first));
134 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) {
135 for (; __n > 0; (void)++__first, --__n)
136 _VSTD::destroy_at(_VSTD::addressof(*__first));
137 return __first;
142 void uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) {
144 auto __idx = __first;
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
| list-aux-2.cc | 47 _M_transfer(_List_node_base * const __first,
62 _M_transfer(_List_node_base * const __first,
69 __first->_M_prev->_M_next = __last;
70 this->_M_prev->_M_next = __first;
75 __last->_M_prev = __first->_M_prev;
76 __first->_M_prev = __tmp;
|
