Home
last modified time | relevance | path

Searched refs:__first (Results 1 – 25 of 85) sorted by relevance

1234

/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_algo.h158 for ( ; __first != __last; ++__first) in for_each()
432 for ( ; __first != __last; ++__first) in count()
456 for ( ; __first != __last; ++__first) in count_if()
1003 for ( ; __first != __last; ++__first) in replace()
1034 for ( ; __first != __last; ++__first) in replace_if()
1134 for ( ; __first != __last; ++__first) in generate()
1189 for ( ; __first != __last; ++__first) in remove_copy()
1226 for ( ; __first != __last; ++__first) in remove_copy_if()
1265 return __first == __last ? __first in remove()
1300 return __first == __last ? __first in remove_if()
[all …]
H A Dstl_heap.h77 if (__first[__parent] < __first[__child]) in _GLIBCXX_BEGIN_NAMESPACE()
94 if (__comp(__first[__parent], __first[__child])) in __is_heap()
105 { return std::__is_heap(__first, std::distance(__first, __last)); } in __is_heap()
123 *(__first + __holeIndex) = *(__first + __parent); in __push_heap()
155 std::__push_heap(__first, _DistanceType((__last - __first) - 1), in push_heap()
169 *(__first + __holeIndex) = *(__first + __parent); in __push_heap()
216 if (*(__first + __secondChild) < *(__first + (__secondChild - 1))) in __adjust_heap()
218 *(__first + __holeIndex) = *(__first + __secondChild); in __adjust_heap()
224 *(__first + __holeIndex) = *(__first + (__secondChild - 1)); in __adjust_heap()
282 *(__first + __holeIndex) = *(__first + __secondChild); in __adjust_heap()
[all …]
H A Dstl_uninitialized.h86 for (; __first != __last; ++__first, ++__cur) in __uninitialized_copy_aux()
87 std::_Construct(&*__cur, *__first); in __uninitialized_copy_aux()
120 std::memmove(__result, __first, __last - __first); in uninitialized_copy()
128 std::memmove(__result, __first, sizeof(wchar_t) * (__last - __first)); in uninitialized_copy()
139 { std::fill(__first, __last, __x); } in __uninitialized_fill_aux()
146 _ForwardIterator __cur = __first; in __uninitialized_fill_aux()
154 std::_Destroy(__first, __cur); in __uninitialized_fill_aux()
184 { std::fill_n(__first, __n, __x); } in __uninitialized_fill_n_aux()
191 _ForwardIterator __cur = __first; in __uninitialized_fill_n_aux()
199 std::_Destroy(__first, __cur); in __uninitialized_fill_n_aux()
[all …]
H A Dstl_numeric.h87 for (; __first != __last; ++__first) in _GLIBCXX_BEGIN_NAMESPACE()
88 __init = __init + *__first; in _GLIBCXX_BEGIN_NAMESPACE()
114 for (; __first != __last; ++__first) in accumulate()
209 if (__first == __last) in partial_sum()
213 while (++__first != __last) in partial_sum()
215 __value = __value + *__first; in partial_sum()
249 if (__first == __last) in partial_sum()
285 if (__first == __last) in adjacent_difference()
291 _ValueType __tmp = *__first; in adjacent_difference()
324 if (__first == __last) in adjacent_difference()
[all …]
H A Dstl_algobase.h267 for (; __first != __last; ++__result, ++__first)
284 ++__first;
298 std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
551 for (; __first != __last; ++__first)
565 for (; __first != __last; ++__first)
600 std::memset(__first, __tmp, __last - __first);
628 return __first;
642 return __first;
672 std::fill(__first, __first + __n, __c);
680 std::fill(__first, __first + __n, __c);
[all …]
H A Dstl_bvector.h359 for (; __first != __last; ++__first) in __fill_bvector()
360 *__first = __x; in __fill_bvector()
369 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x); in fill()
757 return __first; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
826 for (; __first != __last; ++__first) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
827 push_back(*__first); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
849 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
874 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
875 *__cur = *__first; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
876 if (__first == __last) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
H A Ddeque.tcc148 if (__first != begin()) in erase()
170 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
171 *__cur = *__first; in _M_assign_aux()
172 if (__first == __last) in _M_assign_aux()
255 for (; __first != __last; ++__first) in _M_range_initialize()
256 push_back(*__first); in _M_range_initialize()
282 _ForwardIterator __mid = __first; in _M_range_initialize()
286 __first = __mid; in _M_range_initialize()
580 __pos, __first, __mid, in _M_insert_aux()
648 std::_Destroy(__first._M_cur, __first._M_last, in _M_destroy_data_aux()
[all …]
H A Dstl_construct.h118 __destroy_aux(_ForwardIterator __first, _ForwardIterator __last, in __destroy_aux() argument
121 for (; __first != __last; ++__first) in __destroy_aux()
122 std::_Destroy(&*__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()
174 __alloc.destroy(&*__first); in _Destroy()
179 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _Destroy() argument
182 _Destroy(__first, __last); in _Destroy()
H A Dlist.tcc183 if (*__first == __value) in remove()
184 _M_erase(__first); in remove()
185 __first = __next; in remove()
201 if (*__first == *__next) in unique()
204 __first = __next; in unique()
205 __next = __first; in unique()
317 if (__pred(*__first)) in remove_if()
318 _M_erase(__first); in remove_if()
319 __first = __next; in remove_if()
339 __first = __next; in unique()
[all …]
H A Dvector.tcc124 std::copy(__last, end(), __first); in erase()
126 return __first; in erase()
199 ++__cur, ++__first) in _M_assign_aux()
200 *__cur = *__first; in _M_assign_aux()
201 if (__first == __last) in _M_assign_aux()
204 insert(end(), __first, __last); in _M_assign_aux()
232 _ForwardIterator __mid = __first; in _M_assign_aux()
397 for (; __first != __last; ++__first) in _M_range_insert()
399 __pos = insert(__pos, *__first); in _M_range_insert()
411 if (__first != __last) in _M_range_insert()
[all …]
H A Dstl_vector.h272 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
328 _M_assign_dispatch(__first, __last, _Integral()); in assign()
730 erase(iterator __first, iterator __last);
814 _M_range_initialize(__first, __last, _IterCategory()); in _M_initialize_dispatch()
820 _M_range_initialize(_InputIterator __first, in _M_range_initialize() argument
823 for (; __first != __last; ++__first) in _M_range_initialize()
824 push_back(*__first); in _M_range_initialize()
830 _M_range_initialize(_ForwardIterator __first, in _M_range_initialize() argument
833 const size_type __n = std::distance(__first, __last); in _M_range_initialize()
837 std::__uninitialized_copy_a(__first, __last, in _M_range_initialize()
[all …]
H A Dstreambuf_iterator.h284 copy(istreambuf_iterator<_CharT> __first, in copy() argument
306 __result._M_put(__first, __num); in __copy_aux()
318 __result._M_put(__first, __num); in __copy_aux()
333 if (__first._M_sbuf && !__last._M_sbuf) in __copy_aux()
335 streambuf_type* __sb = __first._M_sbuf; in __copy_aux()
360 find(istreambuf_iterator<_CharT> __first, in find() argument
368 if (__first._M_sbuf && !__last._M_sbuf) in find()
371 streambuf_type* __sb = __first._M_sbuf; in find()
391 __first._M_c = __c; in find()
393 __first._M_sbuf = 0; in find()
[all …]
H A Dstl_iterator_base_funcs.h75 __distance(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NAMESPACE()
82 while (__first != __last) in _GLIBCXX_BEGIN_NAMESPACE()
84 ++__first; 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()
119 std::__iterator_category(__first)); in distance()
H A Dstl_list.h84 transfer(_List_node_base * const __first,
526 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
579 _M_assign_dispatch(__first, __last, _Integral()); in assign()
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()
887 __first = erase(__first); in erase()
985 if (__first != __last) in splice()
990 this->_M_transfer(__position, __first, __last); in splice()
1126 for (; __first != __last; ++__first) in _M_initialize_dispatch()
[all …]
H A Dstl_deque.h355 fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,
745 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
797 _M_assign_dispatch(__first, __last, _Integral()); in assign()
1197 erase(iterator __first, iterator __last);
1316 _M_assign_aux(__first, __last, _IterCategory()); in _M_assign_dispatch()
1334 _ForwardIterator __mid = __first; in _M_assign_aux()
1336 std::copy(__first, __mid, begin()); in _M_assign_aux()
1392 _InputIterator __first, _InputIterator __last, in _M_insert_dispatch() argument
1444 { _M_destroy_data_aux(__first, __last); } in _M_destroy_data_dispatch()
1451 { _M_destroy_data_aux(__first, __last); } in _M_destroy_data()
[all …]
/freebsd-12.1/contrib/libstdc++/include/debug/
H A Dfunctions.h163 return __first; in __check_valid_range()
204 if (__first == __last) in __check_sorted_aux()
231 if (__first == __last) in __check_sorted_aux()
272 while (__first != __last && *__first < __value) in __check_partitioned()
273 ++__first; in __check_partitioned()
274 while (__first != __last && !(*__first < __value)) in __check_partitioned()
275 ++__first; in __check_partitioned()
285 while (__first != __last && __pred(*__first, __value)) in __check_partitioned()
286 ++__first; in __check_partitioned()
287 while (__first != __last && !__pred(*__first, __value)) in __check_partitioned()
[all …]
H A Dlist416 iterator __first = begin();
418 if (__first == __last)
420 iterator __next = __first;
423 if (*__first == *__next)
426 __first = __next;
427 __next = __first;
435 iterator __first = begin();
437 if (__first == __last)
439 iterator __next = __first;
445 __first = __next;
[all …]
/freebsd-12.1/contrib/libc++/include/
H A Dalgorithm819 for (; __first != __last; ++__first)
832 for (; __first != __last; ++__first)
845 for (; __first != __last; ++__first)
858 for (; __first != __last; ++__first)
890 for (; __first != __last; ++__first)
903 for (; __first != __last; ++__first)
916 for (; __first != __last; ++__first)
1141 for (; __first != __last; ++__first)
1155 for (; __first != __last; ++__first)
3749 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
[all …]
H A Dnumeric161 for (; __first != __last; ++__first)
171 for (; __first != __last; ++__first)
182 for (; __first != __last; ++__first)
233 for (; __first != __last; ++__first)
270 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
289 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
332 for (; __first != __last; ++__first, (void) ++__result) {
386 for (; __first != __last; ++__first, (void) ++__result) {
418 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
438 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[all …]
H A D__bit_reference164 if (__first.__ctz_ != 0)
175 ++__first.__seg_;
179 if (*__first.__seg_)
200 if (__first.__ctz_ != 0)
211 ++__first.__seg_;
253 if (__first.__ctz_ != 0)
260 ++__first.__seg_;
284 if (__first.__ctz_ != 0)
291 ++__first.__seg_;
332 ++__first.__seg_;
[all …]
H A Dregex3060 __first = __parse_grep(__first, __last);
3114 while (__first != __last && *__first == '|')
3407 if (*__first == '.' || *__first == '\\' || *__first == '[')
3706 if (__first != __last && *__first == '[')
3769 if (__first != __last && *__first != ']')
3952 if ('0' <= *__first && *__first <= '7')
3955 if (++__first != __last && ('0' <= *__first && *__first <= '7'))
3958 if (++__first != __last && ('0' <= *__first && *__first <= '7'))
4303 if (__first != __last && *__first == '\\')
4345 __first != __last && '0' <= *__first && *__first <= '9'; ++__first)
[all …]
H A Dcharconv302 *__first++ = '-';
348 *__first++ = '-';
364 while (__p != __first)
406 bool __neg = (__first != __last && *__first == '-');
407 auto __r = __f(__neg ? __first + 1 : __first, __last, __x, __args...);
411 return {__first, __r.ec};
474 for (; __first != __last; ++__first)
475 if (*__first != '0')
477 return __first;
483 if (__p == __first)
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dalgorithm89 ++__first;
236 for ( ; __first != __last; ++__first)
253 for ( ; __first != __last; ++__first)
289 ++__first;
326 ++__first;
340 for ( ; __first != __last && __m < __n; ++__m, ++__first)
349 ++__first;
368 for ( ; __first != __last && __m < __n; ++__m, ++__first)
377 ++__first;
445 return std::__is_heap(__first, __last - __first);
[all …]
H A Dhashtable.h512 _Node* __first;
514 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
515 __first = __first->_M_next)
524 const _Node* __first;
526 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
527 __first = __first->_M_next)
820 for (_Node* __first = _M_buckets[__n]; __first;
821 __first = __first->_M_next)
846 for (const _Node* __first = _M_buckets[__n]; __first;
847 __first = __first->_M_next)
[all …]
H A Dmemory78 __uninitialized_copy_n(_InputIter __first, _Size __count,
84 for (; __count > 0 ; --__count, ++__first, ++__cur)
85 std::_Construct(&*__cur, *__first);
86 return pair<_InputIter, _ForwardIter>(__first, __cur);
101 _RandomAccessIter __last = __first + __count;
111 __iterator_category(__first)); }
125 uninitialized_copy_n(_InputIter __first, _Size __count,
128 __iterator_category(__first)); }
143 for (; __count > 0 ; --__count, ++__first, ++__cur)
144 __alloc.construct(&*__cur, *__first);
[all …]

1234