Home
last modified time | relevance | path

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

1234567

/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/
Dstl_heap.h110 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in _GLIBCXX_VISIBILITY()
111 { return std::__is_heap(__first, std::distance(__first, __last)); } in _GLIBCXX_VISIBILITY()
115 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
119 std::distance(__first, __last)); in _GLIBCXX_VISIBILITY()
154 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in _GLIBCXX_VISIBILITY()
165 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
166 __glibcxx_requires_irreflexive(__first, __last); in _GLIBCXX_VISIBILITY()
167 __glibcxx_requires_heap(__first, __last - 1); in _GLIBCXX_VISIBILITY()
170 _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); in _GLIBCXX_VISIBILITY()
171 std::__push_heap(__first, _DistanceType((__last - __first) - 1), in _GLIBCXX_VISIBILITY()
[all …]
Dstl_algo.h101 __find_if(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
104 while (__first != __last && !__pred(__first)) in _GLIBCXX_VISIBILITY()
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
116 __trip_count = (__last - __first) >> 2; in _GLIBCXX_VISIBILITY()
137 switch (__last - __first) in _GLIBCXX_VISIBILITY()
153 return __last; in _GLIBCXX_VISIBILITY()
159 __find_if(_Iterator __first, _Iterator __last, _Predicate __pred) in _GLIBCXX_VISIBILITY()
161 return __find_if(__first, __last, __pred, in _GLIBCXX_VISIBILITY()
168 __find_if_not(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
171 return std::__find_if(__first, __last, in _GLIBCXX_VISIBILITY()
[all …]
Dstl_numeric.h82 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) in _GLIBCXX_VISIBILITY()
89 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
91 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
120 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) in _GLIBCXX_VISIBILITY()
124 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
126 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
146 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, in _GLIBCXX_VISIBILITY()
151 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
153 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
237 partial_sum(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
[all …]
Dstl_uninitialized.h76 __uninit_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
82 for (; __first != __last; ++__first, (void)++__cur) in _GLIBCXX_VISIBILITY()
99 __uninit_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
101 { return std::copy(__first, __last, __result); } in _GLIBCXX_VISIBILITY()
115 uninitialized_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
134 __uninit_copy(__first, __last, __result); in _GLIBCXX_VISIBILITY()
143 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
149 for (; __cur != __last; ++__cur) in _GLIBCXX_VISIBILITY()
165 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
167 { std::fill(__first, __last, __x); } in _GLIBCXX_VISIBILITY()
[all …]
Ddeque.tcc257 _M_erase(iterator __first, iterator __last) in _M_erase() argument
259 if (__first == __last) in _M_erase()
261 else if (__first == begin() && __last == end()) in _M_erase()
268 const difference_type __n = __last - __first; in _M_erase()
273 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last); in _M_erase()
278 if (__last != end()) in _M_erase()
279 _GLIBCXX_MOVE3(__last, end(), __first); in _M_erase()
290 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
294 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
296 if (__first == __last) in _M_assign_aux()
[all …]
Dstl_algobase.h291 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
293 for (; __first != __last; ++__result, (void)++__first) in _GLIBCXX_VISIBILITY()
305 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
307 for (; __first != __last; ++__result, (void)++__first) in _GLIBCXX_VISIBILITY()
319 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
322 for(_Distance __n = __last - __first; __n > 0; --__n) in _GLIBCXX_VISIBILITY()
338 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
341 for(_Distance __n = __last - __first; __n > 0; --__n) in _GLIBCXX_VISIBILITY()
357 __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) in _GLIBCXX_VISIBILITY()
366 const ptrdiff_t _Num = __last - __first; in _GLIBCXX_VISIBILITY()
[all …]
Dstl_bvector.h394 unsigned int __first, unsigned int __last, bool __x) in _GLIBCXX_VISIBILITY()
397 const _Bit_type __lmask = ~0ul >> (_S_word_bit - __last); in _GLIBCXX_VISIBILITY()
407 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) in _GLIBCXX_VISIBILITY()
409 if (__first._M_p != __last._M_p) in _GLIBCXX_VISIBILITY()
416 (__last._M_p - __first_p) * sizeof(_Bit_type)); in _GLIBCXX_VISIBILITY()
418 if (__last._M_offset != 0) in _GLIBCXX_VISIBILITY()
419 __fill_bvector(__last._M_p, 0, __last._M_offset, __x); in _GLIBCXX_VISIBILITY()
421 else if (__first._M_offset != __last._M_offset) in _GLIBCXX_VISIBILITY()
422 __fill_bvector(__first._M_p, __first._M_offset, __last._M_offset, __x); in _GLIBCXX_VISIBILITY()
695 vector(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
[all …]
Dlocale_conv.h55 __do_str_codecvt(const _InChar* __first, const _InChar* __last, in _GLIBCXX_VISIBILITY()
59 if (__first == __last) in _GLIBCXX_VISIBILITY()
73 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen); in _GLIBCXX_VISIBILITY()
76 __result = (__cvt.*__fn)(__state, __next, __last, __next, in _GLIBCXX_VISIBILITY()
80 while (__result == codecvt_base::partial && __next != __last in _GLIBCXX_VISIBILITY()
91 __outstr.assign(__first, __last); in _GLIBCXX_VISIBILITY()
92 __count = __last - __first; in _GLIBCXX_VISIBILITY()
106 __str_codecvt_in(const char* __first, const char* __last, in _GLIBCXX_VISIBILITY()
117 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state, in _GLIBCXX_VISIBILITY()
123 __str_codecvt_in(const char* __first, const char* __last, in _GLIBCXX_VISIBILITY()
[all …]
Dstl_construct.h105 __destroy(_ForwardIterator __first, _ForwardIterator __last) in _GLIBCXX_VISIBILITY()
107 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
127 _Destroy(_ForwardIterator __first, _ForwardIterator __last) in _GLIBCXX_VISIBILITY()
137 __destroy(__first, __last); in _GLIBCXX_VISIBILITY()
193 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
197 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
203 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
206 _Destroy(__first, __last); in _GLIBCXX_VISIBILITY()
219 destroy(_ForwardIterator __first, _ForwardIterator __last) in _GLIBCXX_VISIBILITY()
221 std::_Destroy(__first, __last); in _GLIBCXX_VISIBILITY()
Dstl_list.h90 _List_node_base* const __last) _GLIBCXX_USE_NOEXCEPT; in _GLIBCXX_VISIBILITY()
370 const __detail::_List_node_base* __last) in _GLIBCXX_VISIBILITY()
373 while (__first != __last) in _GLIBCXX_VISIBILITY()
423 const __detail::_List_node_base* __last) const in _GLIBCXX_VISIBILITY()
424 { return _S_distance(__first, __last); } in _GLIBCXX_VISIBILITY()
654 _S_distance(const_iterator __first, const_iterator __last) in _GLIBCXX_VISIBILITY()
655 { return std::distance(__first, __last); } in _GLIBCXX_VISIBILITY()
811 list(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
814 { _M_initialize_dispatch(__first, __last, __false_type()); } in _GLIBCXX_VISIBILITY()
817 list(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/
Dstl_algo.h138 __find(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
141 while (__first != __last && !(*__first == __val)) in _GLIBCXX_VISIBILITY()
149 __find_if(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
152 while (__first != __last && !bool(__pred(*__first))) in _GLIBCXX_VISIBILITY()
160 __find(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
164 __trip_count = (__last - __first) >> 2; in _GLIBCXX_VISIBILITY()
185 switch (__last - __first) in _GLIBCXX_VISIBILITY()
201 return __last; in _GLIBCXX_VISIBILITY()
208 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
212 __trip_count = (__last - __first) >> 2; in _GLIBCXX_VISIBILITY()
[all …]
Dstl_heap.h118 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in _GLIBCXX_VISIBILITY()
119 { return std::__is_heap(__first, std::distance(__first, __last)); } in _GLIBCXX_VISIBILITY()
123 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in _GLIBCXX_VISIBILITY()
157 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in _GLIBCXX_VISIBILITY()
168 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
169 __glibcxx_requires_heap(__first, __last - 1); in _GLIBCXX_VISIBILITY()
171 _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); in _GLIBCXX_VISIBILITY()
172 std::__push_heap(__first, _DistanceType((__last - __first) - 1), in _GLIBCXX_VISIBILITY()
207 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in _GLIBCXX_VISIBILITY()
[all …]
Dstl_numeric.h83 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) in _GLIBCXX_VISIBILITY()
90 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
92 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
121 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) in _GLIBCXX_VISIBILITY()
125 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
127 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
147 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, in _GLIBCXX_VISIBILITY()
152 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_VISIBILITY()
154 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
238 partial_sum(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
[all …]
Dstl_uninitialized.h70 __uninit_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
76 for (; __first != __last; ++__first, ++__cur) in _GLIBCXX_VISIBILITY()
93 __uninit_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
95 { return std::copy(__first, __last, __result); } in _GLIBCXX_VISIBILITY()
109 uninitialized_copy(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
119 __uninit_copy(__first, __last, __result); in _GLIBCXX_VISIBILITY()
128 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
134 for (; __cur != __last; ++__cur) in _GLIBCXX_VISIBILITY()
150 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
152 { std::fill(__first, __last, __x); } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_algobase.h296 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
298 for (; __first != __last; ++__result, ++__first) in _GLIBCXX_VISIBILITY()
310 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
312 for (; __first != __last; ++__result, ++__first) in _GLIBCXX_VISIBILITY()
324 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
327 for(_Distance __n = __last - __first; __n > 0; --__n) in _GLIBCXX_VISIBILITY()
343 __copy_m(_II __first, _II __last, _OI __result) in _GLIBCXX_VISIBILITY()
346 for(_Distance __n = __last - __first; __n > 0; --__n) in _GLIBCXX_VISIBILITY()
362 __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) in _GLIBCXX_VISIBILITY()
364 const ptrdiff_t _Num = __last - __first; in _GLIBCXX_VISIBILITY()
[all …]
Ddeque.tcc219 erase(iterator __first, iterator __last) in erase() argument
221 if (__first == __last) in erase()
223 else if (__first == begin() && __last == end()) in erase()
230 const difference_type __n = __last - __first; in erase()
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last); in erase()
240 if (__last != end()) in erase()
241 _GLIBCXX_MOVE3(__last, end(), __first); in erase()
252 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
256 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
258 if (__first == __last) in _M_assign_aux()
[all …]
Dstl_bvector.h358 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) in _GLIBCXX_VISIBILITY()
360 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
365 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) in _GLIBCXX_VISIBILITY()
367 if (__first._M_p != __last._M_p) in _GLIBCXX_VISIBILITY()
369 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); in _GLIBCXX_VISIBILITY()
371 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); in _GLIBCXX_VISIBILITY()
374 __fill_bvector(__first, __last, __x); in _GLIBCXX_VISIBILITY()
561 vector(_InputIterator __first, _InputIterator __last, in _GLIBCXX_VISIBILITY()
566 _M_initialize_dispatch(__first, __last, _Integral()); in _GLIBCXX_VISIBILITY()
615 assign(_InputIterator __first, _InputIterator __last) in _GLIBCXX_VISIBILITY()
[all …]
Dstl_construct.h102 __destroy(_ForwardIterator __first, _ForwardIterator __last) in _GLIBCXX_VISIBILITY()
104 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
124 _Destroy(_ForwardIterator __first, _ForwardIterator __last) in _GLIBCXX_VISIBILITY()
129 __destroy(__first, __last); in _GLIBCXX_VISIBILITY()
142 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
146 for (; __first != __last; ++__first) in _GLIBCXX_VISIBILITY()
152 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _GLIBCXX_VISIBILITY()
155 _Destroy(__first, __last); in _GLIBCXX_VISIBILITY()
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/debug/
Dfunctions.h91 const _RandomAccessIterator& __last, in __valid_range_aux2() argument
93 { return __last - __first >= 0; } in __valid_range_aux2()
120 const _InputIterator& __last, std::__false_type) in __valid_range_aux() argument
124 return __valid_range_aux2(__first, __last, _Category()); in __valid_range_aux()
134 __valid_range(const _InputIterator& __first, const _InputIterator& __last) in __valid_range() argument
137 return __valid_range_aux(__first, __last, _Integral()); in __valid_range()
144 const _Safe_iterator<_Iterator, _Sequence>& __last) in __valid_range() argument
145 { return __first._M_valid_range(__last); } in __valid_range()
151 const _Safe_local_iterator<_Iterator, _Sequence>& __last) in __valid_range() argument
152 { return __first._M_valid_range(__last); } in __valid_range()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/debug/
Dfunctions.h90 const _InputIterator& __last in __check_valid_range() argument
93 __glibcxx_check_valid_range(__first, __last); in __check_valid_range()
249 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, in __check_sorted_aux() argument
252 if (__first == __last) in __check_sorted_aux()
256 for (++__next; __next != __last; __first = __next, (void)++__next) in __check_sorted_aux()
275 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, in __check_sorted_aux() argument
278 if (__first == __last) in __check_sorted_aux()
282 for (++__next; __next != __last; __first = __next, (void)++__next) in __check_sorted_aux()
292 __check_sorted(const _InputIterator& __first, const _InputIterator& __last) in __check_sorted() argument
296 __glibcxx_assert(__first == __last || !(*__first < *__first)); in __check_sorted()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/
Dalgorithm98 _RAIterator __last = __first + __count;
99 return pair<_RAIterator, _OutputIterator>(__last, std::copy(__first,
100 __last,
224 count(_InputIterator __first, _InputIterator __last,
233 __glibcxx_requires_valid_range(__first, __last);
235 for ( ; __first != __last; ++__first)
242 count_if(_InputIterator __first, _InputIterator __last,
250 __glibcxx_requires_valid_range(__first, __last);
252 for ( ; __first != __last; ++__first)
267 random_sample_n(_ForwardIterator __first, _ForwardIterator __last,
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/
Dalgorithm100 _RAIterator __last = __first + __count;
101 return pair<_RAIterator, _OutputIterator>(__last, std::copy(__first,
102 __last,
226 count(_InputIterator __first, _InputIterator __last,
235 __glibcxx_requires_valid_range(__first, __last);
237 for ( ; __first != __last; ++__first)
244 count_if(_InputIterator __first, _InputIterator __last,
252 __glibcxx_requires_valid_range(__first, __last);
254 for ( ; __first != __last; ++__first)
269 random_sample_n(_ForwardIterator __first, _ForwardIterator __last,
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/std/
Dcharconv157 __to_chars(char* __first, char* __last, _Tp __val, int __base) noexcept
166 if (__builtin_expect((__last - __first) < __len, 0))
168 __res.ptr = __last;
194 __to_chars_16(char* __first, char* __last, _Tp __val) noexcept
203 if (__builtin_expect((__last - __first) < __len, 0))
205 __res.ptr = __last;
243 __to_chars_10(char* __first, char* __last, _Tp __val) noexcept
252 if (__builtin_expect((__last - __first) < __len, 0))
254 __res.ptr = __last;
289 __to_chars_8(char* __first, char* __last, _Tp __val) noexcept
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/src/c++98/
Dlist-aux-2.cc48 _List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT;
63 _List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT in _M_transfer() argument
65 if (this != __last) in _M_transfer()
68 __last->_M_prev->_M_next = this; in _M_transfer()
69 __first->_M_prev->_M_next = __last; in _M_transfer()
74 this->_M_prev = __last->_M_prev; in _M_transfer()
75 __last->_M_prev = __first->_M_prev; in _M_transfer()
/dragonfly/contrib/gcc-4.7/libstdc++-v3/src/c++98/
Dcompatibility-list-2.cc48 _List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT;
63 _List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT in _M_transfer() argument
65 if (this != __last) in _M_transfer()
68 __last->_M_prev->_M_next = this; in _M_transfer()
69 __first->_M_prev->_M_next = __last; in _M_transfer()
74 this->_M_prev = __last->_M_prev; in _M_transfer()
75 __last->_M_prev = __first->_M_prev; in _M_transfer()

1234567