Home
last modified time | relevance | path

Searched refs:__last (Results 1 – 25 of 72) sorted by relevance

123

/trueos/contrib/libstdc++/include/bits/
Dstl_algo.h153 for_each(_InputIterator __first, _InputIterator __last, _Function __f) in for_each() argument
157 __glibcxx_requires_valid_range(__first, __last); in for_each()
158 for ( ; __first != __last; ++__first) in for_each()
170 __find(_InputIterator __first, _InputIterator __last, in __find() argument
173 while (__first != __last && !(*__first == __val)) in __find()
185 __find_if(_InputIterator __first, _InputIterator __last, in __find_if() argument
188 while (__first != __last && !__pred(*__first)) in __find_if()
200 __find(_RandomAccessIterator __first, _RandomAccessIterator __last, in __find() argument
204 __trip_count = (__last - __first) >> 2; in __find()
225 switch (__last - __first) in __find()
[all …]
Dstl_heap.h104 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in __is_heap() argument
105 { return std::__is_heap(__first, std::distance(__first, __last)); } in __is_heap()
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in __is_heap() argument
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in __is_heap()
141 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in push_heap() argument
152 __glibcxx_requires_valid_range(__first, __last); in push_heap()
155 std::__push_heap(__first, _DistanceType((__last - __first) - 1), in push_heap()
156 _DistanceType(0), _ValueType(*(__last - 1))); in push_heap()
189 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in push_heap() argument
200 __glibcxx_requires_valid_range(__first, __last); in push_heap()
[all …]
Dstl_numeric.h81 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) in _GLIBCXX_BEGIN_NAMESPACE()
85 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_BEGIN_NAMESPACE()
87 for (; __first != __last; ++__first) in _GLIBCXX_BEGIN_NAMESPACE()
107 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, in accumulate() argument
112 __glibcxx_requires_valid_range(__first, __last); in accumulate()
114 for (; __first != __last; ++__first) in accumulate()
198 partial_sum(_InputIterator __first, _InputIterator __last, in partial_sum() argument
207 __glibcxx_requires_valid_range(__first, __last); in partial_sum()
209 if (__first == __last) in partial_sum()
213 while (++__first != __last) in partial_sum()
[all …]
Dstl_algobase.h265 copy(_II __first, _II __last, _OI __result)
267 for (; __first != __last; ++__result, ++__first)
278 copy(_II __first, _II __last, _OI __result)
281 for(_Distance __n = __last - __first; __n > 0; --__n)
296 copy(const _Tp* __first, const _Tp* __last, _Tp* __result)
298 std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
299 return __result + (__last - __first);
305 __copy_aux(_II __first, _II __last, _OI __result)
315 return std::__copy<__simple, _Category>::copy(__first, __last, __result);
339 __copy_n(_II __first, _II __last, _OI __result)
[all …]
Dstl_uninitialized.h72 __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NAMESPACE()
75 { return std::copy(__first, __last, __result); } in _GLIBCXX_BEGIN_NAMESPACE()
79 __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, in __uninitialized_copy_aux() argument
86 for (; __first != __last; ++__first, ++__cur) in __uninitialized_copy_aux()
108 uninitialized_copy(_InputIterator __first, _InputIterator __last, in uninitialized_copy() argument
113 return std::__uninitialized_copy_aux(__first, __last, __result, in uninitialized_copy()
118 uninitialized_copy(const char* __first, const char* __last, char* __result) in uninitialized_copy() argument
120 std::memmove(__result, __first, __last - __first); in uninitialized_copy()
121 return __result + (__last - __first); in uninitialized_copy()
125 uninitialized_copy(const wchar_t* __first, const wchar_t* __last, in uninitialized_copy() argument
[all …]
Dstl_bvector.h357 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) in __fill_bvector() argument
359 for (; __first != __last; ++__first) in __fill_bvector()
364 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) in fill() argument
366 if (__first._M_p != __last._M_p) in fill()
368 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); in fill()
370 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); in fill()
373 __fill_bvector(__first, __last, __x); in fill()
517 vector(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
522 _M_initialize_dispatch(__first, __last, _Integral()); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
552 assign(_InputIterator __first, _InputIterator __last) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Ddeque.tcc135 erase(iterator __first, iterator __last) in erase() argument
137 if (__first == begin() && __last == end()) in erase()
144 const difference_type __n = __last - __first; in erase()
149 std::copy_backward(begin(), __first, __last); in erase()
154 if (__last != end()) in erase()
155 std::copy(__last, end(), __first); in erase()
166 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
170 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
172 if (__first == __last) in _M_assign_aux()
175 insert(end(), __first, __last); in _M_assign_aux()
[all …]
Dstl_construct.h118 __destroy_aux(_ForwardIterator __first, _ForwardIterator __last, in __destroy_aux() argument
121 for (; __first != __last; ++__first) in __destroy_aux()
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last) in _Destroy() argument
155 std::__destroy_aux(__first, __last, _Has_trivial_destructor()); in _Destroy()
170 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _Destroy() argument
173 for (; __first != __last; ++__first) in _Destroy()
179 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _Destroy() argument
182 _Destroy(__first, __last); in _Destroy()
Dstl_vector.h266 vector(_InputIterator __first, _InputIterator __last,
272 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
324 assign(_InputIterator __first, _InputIterator __last) in assign() argument
328 _M_assign_dispatch(__first, __last, _Integral()); in assign()
686 _InputIterator __last) in insert() argument
690 _M_insert_dispatch(__position, __first, __last, _Integral()); in insert()
730 erase(iterator __first, iterator __last);
775 _ForwardIterator __first, _ForwardIterator __last) in _M_allocate_and_copy() argument
780 std::__uninitialized_copy_a(__first, __last, __result, in _M_allocate_and_copy()
809 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, in _M_initialize_dispatch() argument
[all …]
Dvector.tcc121 erase(iterator __first, iterator __last) in erase() argument
123 if (__last != end()) in erase()
124 std::copy(__last, end(), __first); in erase()
125 _M_erase_at_end(__first.base() + (end() - __last)); in erase()
194 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
198 for (; __first != __last && __cur != this->_M_impl._M_finish; in _M_assign_aux()
201 if (__first == __last) in _M_assign_aux()
204 insert(end(), __first, __last); in _M_assign_aux()
211 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, in _M_assign_aux() argument
214 const size_type __len = std::distance(__first, __last); in _M_assign_aux()
[all …]
Dstl_iterator_base_funcs.h75 __distance(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NAMESPACE()
82 while (__first != __last) in _GLIBCXX_BEGIN_NAMESPACE()
92 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, in __distance() argument
98 return __last - __first; in __distance()
115 distance(_InputIterator __first, _InputIterator __last) in distance() argument
118 return std::__distance(__first, __last, in distance()
Dstl_deque.h356 const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value);
739 deque(_InputIterator __first, _InputIterator __last,
745 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
794 assign(_InputIterator __first, _InputIterator __last) in assign() argument
797 _M_assign_dispatch(__first, __last, _Integral()); in assign()
1157 _InputIterator __last) in insert() argument
1161 _M_insert_dispatch(__position, __first, __last, _Integral()); in insert()
1197 erase(iterator __first, iterator __last);
1247 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, in _M_initialize_dispatch() argument
1252 _M_range_initialize(__first, __last, _IterCategory()); in _M_initialize_dispatch()
[all …]
Dstl_list.h85 _List_node_base * const __last);
520 list(_InputIterator __first, _InputIterator __last,
526 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
575 assign(_InputIterator __first, _InputIterator __last) in assign() argument
579 _M_assign_dispatch(__first, __last, _Integral()); in assign()
841 _InputIterator __last) in insert() argument
843 list __tmp(__first, __last, _M_get_Node_allocator()); in insert()
884 erase(iterator __first, iterator __last) in erase() argument
886 while (__first != __last) in erase()
888 return __last; in erase()
[all …]
Dlist.tcc178 iterator __last = end(); in remove() local
179 while (__first != __last) in remove()
195 iterator __last = end(); in unique() local
196 if (__first == __last) in unique()
199 while (++__next != __last) in unique()
312 iterator __last = end(); in remove_if() local
313 while (__first != __last) in remove_if()
330 iterator __last = end(); in unique() local
331 if (__first == __last) in unique()
334 while (++__next != __last) in unique()
/trueos/contrib/libstdc++/include/debug/
Dfunctions.h96 const _RandomAccessIterator& __last, in __valid_range_aux2() argument
98 { return __last - __first >= 0; } in __valid_range_aux2()
125 const _InputIterator& __last, std::__false_type) in __valid_range_aux() argument
129 return __valid_range_aux2(__first, __last, _Category()); in __valid_range_aux()
139 __valid_range(const _InputIterator& __first, const _InputIterator& __last) in __valid_range() argument
142 return __valid_range_aux(__first, __last, _Integral()); in __valid_range()
149 const _Safe_iterator<_Iterator, _Sequence>& __last) in __valid_range() argument
150 { return __first._M_valid_range(__last); } in __valid_range()
159 const _InputIterator& __last in __check_valid_range() argument
162 _GLIBCXX_DEBUG_ASSERT(__valid_range(__first, __last)); in __check_valid_range()
[all …]
Dlist110 list(_InputIterator __first, _InputIterator __last,
112 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, __a)
132 assign(_InputIterator __first, _InputIterator __last)
134 __glibcxx_check_valid_range(__first, __last);
135 _Base::assign(__first, __last);
284 _InputIterator __last)
286 __glibcxx_check_insert_range(__position, __first, __last);
287 _Base::insert(__position.base(), __first, __last);
299 erase(iterator __position, iterator __last)
303 __glibcxx_check_erase_range(__position, __last);
[all …]
Dhash_set.h139 insert(const value_type* __first, const value_type* __last) in insert() argument
141 __glibcxx_check_valid_range(__first, __last); in insert()
142 _Base::insert(__first, __last); in insert()
147 insert(_InputIterator __first, _InputIterator __last) in insert() argument
149 __glibcxx_check_valid_range(__first, __last); in insert()
150 _Base::insert(__first.base(), __last.base()); in insert()
197 erase(iterator __first, iterator __last) in erase() argument
199 __glibcxx_check_erase_range(__first, __last); in erase()
200 for (iterator __tmp = __first; __tmp != __last;) in erase()
205 _Base::erase(__first.base(), __last.base()); in erase()
Ddeque82 deque(_InputIterator __first, _InputIterator __last,
84 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, __a)
103 assign(_InputIterator __first, _InputIterator __last)
105 __glibcxx_check_valid_range(__first, __last);
106 _Base::assign(__first, __last);
254 _InputIterator __first, _InputIterator __last)
256 __glibcxx_check_insert_range(__position, __first, __last);
257 _Base::insert(__position.base(), __first, __last);
298 erase(iterator __first, iterator __last)
302 __glibcxx_check_erase_range(__first, __last);
[all …]
/trueos/contrib/libc++/include/
Dalgorithm811 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
813 for (; __first != __last; ++__first)
824 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
826 for (; __first != __last; ++__first)
837 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
839 for (; __first != __last; ++__first)
850 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
852 for (; __first != __last; ++__first)
862 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_)
864 for (; __first != __last; ++__first)
[all …]
Dnumeric72 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
74 for (; __first != __last; ++__first)
82 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
84 for (; __first != __last; ++__first)
113 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
115 if (__first != __last)
119 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
131 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
134 if (__first != __last)
138 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[all …]
Dregex2513 basic_regex(_ForwardIterator __first, _ForwardIterator __last,
2517 {__parse(__first, __last);}
2573 assign(_InputIterator __first, _InputIterator __last,
2576 basic_string<_CharT> __t(__first, __last);
2599 assign(_ForwardIterator __first, _ForwardIterator __last,
2603 __parse(__first, __last);
2642 __parse(_ForwardIterator __first, _ForwardIterator __last);
2645 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
2648 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last);
2651 __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last);
[all …]
D__bit_reference238 find(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __valu…
241 return __find_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
242 return __find_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
312 count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __val…
315 return __count_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
316 return __count_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
400 fill(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __last, bool __value_)
402 _VSTD::fill_n(__first, static_cast<typename _Cp::size_type>(__last - __first), __value_);
409 __copy_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
416 difference_type __n = __last - __first;
[all …]
/trueos/contrib/libstdc++/include/ext/
Dalgorithm101 _RAIterator __last = __first + __count;
102 return pair<_RAIterator, _OutputIterator>(__last, std::copy(__first,
103 __last,
225 count(_InputIterator __first, _InputIterator __last,
234 __glibcxx_requires_valid_range(__first, __last);
236 for ( ; __first != __last; ++__first)
243 count_if(_InputIterator __first, _InputIterator __last,
251 __glibcxx_requires_valid_range(__first, __last);
253 for ( ; __first != __last; ++__first)
268 random_sample_n(_ForwardIterator __first, _ForwardIterator __last,
[all …]
/trueos/contrib/libstdc++/src/
Dlist.cc94 _List_node_base * const __last) in transfer() argument
96 if (this != __last) in transfer()
99 __last->_M_prev->_M_next = this; in transfer()
100 __first->_M_prev->_M_next = __last; in transfer()
105 this->_M_prev = __last->_M_prev; in transfer()
106 __last->_M_prev = __first->_M_prev; in transfer()
/trueos/contrib/libc++/include/ext/
Dhash_set248 hash_set(_InputIterator __first, _InputIterator __last);
250 hash_set(_InputIterator __first, _InputIterator __last,
254 hash_set(_InputIterator __first, _InputIterator __last,
285 void insert(_InputIterator __first, _InputIterator __last);
292 void erase(const_iterator __first, const_iterator __last)
293 {__table_.erase(__first, __last);}
349 _InputIterator __first, _InputIterator __last)
352 insert(__first, __last);
358 _InputIterator __first, _InputIterator __last, size_type __n,
363 insert(__first, __last);
[all …]

123