Home
last modified time | relevance | path

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

123456

/freebsd-12-stable/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 …]
/freebsd-12-stable/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 …]
/freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/
Drotate.h33 __rotate_left(_ForwardIterator __first, _ForwardIterator __last) in __rotate_left() argument
37 _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); in __rotate_left()
44 __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) in __rotate_right() argument
47 _BidirectionalIterator __lm1 = _VSTD::prev(__last); in __rotate_right()
49 _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); in __rotate_right()
56 __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) in __rotate_forward() argument
63 if (++__i == __last) in __rotate_forward()
76 if (++__i == __last) in __rotate_forward()
105 …te_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) in __rotate_gcd() argument
111 const difference_type __m2 = __last - __middle; in __rotate_gcd()
[all …]
Dstable_partition.h29 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, in __stable_partition() argument
58 while (++__i != __last) in __stable_partition()
94 _ForwardIterator __second_false = __last; in __stable_partition()
98 if (++__m1 == __last) in __stable_partition()
104 …__second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); in __stable_partition()
115 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, in __stable_partition() argument
122 if (__first == __last) in __stable_partition()
132 difference_type __len = _VSTD::distance(__first, __last); in __stable_partition()
141 (__first, __last, __pred, __len, __p, forward_iterator_tag()); in __stable_partition()
146 __stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, in __stable_partition() argument
[all …]
Dsort.h129 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __selection_sort() argument
131 _BidirectionalIterator __lm1 = __last; in __selection_sort()
136 (__first, __last, __comp); in __selection_sort()
144 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __insertion_sort() argument
147 if (__first != __last) in __insertion_sort()
150 for (++__i; __i != __last; ++__i) in __insertion_sort()
163 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_3() argument
168 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) in __insertion_sort_3()
188 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare _… in __insertion_sort_incomplete() argument
190 switch (__last - __first) in __insertion_sort_incomplete()
[all …]
Dsearch_n.h28 …ONSTEXPR_AFTER_CXX17 _ForwardIterator __search_n(_ForwardIterator __first, _ForwardIterator __last, in __search_n() argument
36 if (__first == __last) // return __last if no element matches __value_ in __search_n()
37 return __last; in __search_n()
48 if (++__m == __last) // Otherwise if source exhaused, pattern not found in __search_n()
49 return __last; in __search_n()
62 … _RandomAccessIterator __last, _Size __count, in __search_n() argument
67 _Size __len = static_cast<_Size>(__last - __first); in __search_n()
69 return __last; in __search_n()
70 …const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyon… in __search_n()
75 return __last; in __search_n()
[all …]
Dreverse.h28 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) in __reverse() argument
30 while (__first != __last) in __reverse()
32 if (__first == --__last) in __reverse()
34 _VSTD::iter_swap(__first, __last); in __reverse()
42 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) in __reverse() argument
44 if (__first != __last) in __reverse()
45 for (; __first < --__last; ++__first) in __reverse()
46 _VSTD::iter_swap(__first, __last); in __reverse()
52 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) in reverse() argument
54 …_VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_categ… in reverse()
Dpush_heap.h29 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __sift_up() argument
37 if (__comp(*__ptr, *--__last)) in __sift_up()
39 value_type __t(_VSTD::move(*__last)); in __sift_up()
42 *__last = _VSTD::move(*__ptr); in __sift_up()
43 __last = __ptr; in __sift_up()
49 *__last = _VSTD::move(__t); in __sift_up()
57 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in push_heap() argument
60 _VSTD::__sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); in push_heap()
66 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in push_heap() argument
68 …_VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in push_heap()
Dunique_copy.h29 __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredi… in __unique_copy() argument
32 if (__first != __last) in __unique_copy()
37 while (++__first != __last) in __unique_copy()
52 __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryP… in __unique_copy() argument
55 if (__first != __last) in __unique_copy()
60 while (++__first != __last) in __unique_copy()
75 __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPred… in __unique_copy() argument
78 if (__first != __last) in __unique_copy()
81 while (++__first != __last) in __unique_copy()
92 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredica… in unique_copy() argument
[all …]
Dnth_element.h46 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) in __nth_element() argument
53 if (__nth == __last) in __nth_element()
55 difference_type __len = __last - __first; in __nth_element()
62 if (__comp(*--__last, *__first)) in __nth_element()
63 swap(*__first, *__last); in __nth_element()
68 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); in __nth_element()
74 _VSTD::__selection_sort<_Compare>(__first, __last, __comp); in __nth_element()
79 _RandomAccessIterator __lm1 = __last; in __nth_element()
99 __j = __last; in __nth_element()
197 if (++__j == __last) { in __nth_element()
[all …]
Dshift_right.h33 shift_right(_ForwardIterator __first, _ForwardIterator __last, in shift_right() argument
41 decltype(__n) __d = __last - __first; in shift_right()
43 return __last; in shift_right()
46 return _VSTD::move_backward(__first, __m, __last); in shift_right()
48 _ForwardIterator __m = __last; in shift_right()
51 return __last; in shift_right()
55 return _VSTD::move_backward(__first, __m, __last); in shift_right()
59 if (__ret == __last) { in shift_right()
60 return __last; in shift_right()
74 if (__lead == __last) { in shift_right()
[all …]
Dprev_permutation.h30 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __prev_permutation() argument
32 _BidirectionalIterator __i = __last; in __prev_permutation()
33 if (__first == __last || __first == --__i) in __prev_permutation()
40 _BidirectionalIterator __j = __last; in __prev_permutation()
44 _VSTD::reverse(__ip1, __last); in __prev_permutation()
49 _VSTD::reverse(__first, __last); in __prev_permutation()
58 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in prev_permutation() argument
61 return _VSTD::__prev_permutation<_Comp_ref>(__first, __last, __comp); in prev_permutation()
67 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) in prev_permutation() argument
69 return _VSTD::prev_permutation(__first, __last, in prev_permutation()
Dnext_permutation.h30 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __next_permutation() argument
32 _BidirectionalIterator __i = __last; in __next_permutation()
33 if (__first == __last || __first == --__i) in __next_permutation()
40 _BidirectionalIterator __j = __last; in __next_permutation()
44 _VSTD::reverse(__ip1, __last); in __next_permutation()
49 _VSTD::reverse(__first, __last); in __next_permutation()
58 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in next_permutation() argument
61 return _VSTD::__next_permutation<_Comp_ref>(__first, __last, __comp); in next_permutation()
67 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) in next_permutation() argument
69 return _VSTD::next_permutation(__first, __last, in next_permutation()
Dpartition.h29 __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_… in __partition() argument
33 if (__first == __last) in __partition()
39 for (_ForwardIterator __p = __first; ++__p != __last;) in __partition()
52 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, in __partition() argument
59 if (__first == __last) in __partition()
67 if (__first == --__last) in __partition()
69 } while (!__pred(*__last)); in __partition()
70 swap(*__first, *__last); in __partition()
78 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) in partition() argument
81 … (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); in partition()
Dshuffle.h61 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) in random_shuffle() argument
66 difference_type __d = __last - __first; in random_shuffle()
71 for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) in random_shuffle()
82 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, in random_shuffle() argument
90 difference_type __d = __last - __first; in random_shuffle()
93 for (--__last; __first < __last; ++__first, (void) --__d) in random_shuffle()
104 void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, in shuffle() argument
110 difference_type __d = __last - __first; in shuffle()
114 for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) in shuffle()
Dcopy_backward.h30 __copy_backward_constexpr(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIte… in __copy_backward_constexpr() argument
32 while (__first != __last) in __copy_backward_constexpr()
33 *--__result = *--__last; in __copy_backward_constexpr()
40 __copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __re… in __copy_backward() argument
42 return _VSTD::__copy_backward_constexpr(__first, __last, __result); in __copy_backward()
53 __copy_backward(_Tp* __first, _Tp* __last, _Up* __result) in __copy_backward() argument
55 const size_t __n = static_cast<size_t>(__last - __first); in __copy_backward()
67 copy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, in copy_backward() argument
71 return _VSTD::__copy_backward_constexpr(__first, __last, __result); in copy_backward()
75 _VSTD::__unwrap_iter(__last), in copy_backward()
Dmove_backward.h30 __move_backward_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __move_backward_constexpr() argument
32 while (__first != __last) in __move_backward_constexpr()
33 *--__result = _VSTD::move(*--__last); in __move_backward_constexpr()
40 __move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __move_backward() argument
42 return _VSTD::__move_backward_constexpr(__first, __last, __result); in __move_backward()
53 __move_backward(_Tp* __first, _Tp* __last, _Up* __result) in __move_backward() argument
55 const size_t __n = static_cast<size_t>(__last - __first); in __move_backward()
67 move_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, in move_backward() argument
71 return _VSTD::__move_backward_constexpr(__first, __last, __result); in move_backward()
75 _VSTD::__unwrap_iter(__last), in move_backward()
Dcopy.h32 __copy_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __copy_constexpr() argument
34 for (; __first != __last; ++__first, (void) ++__result) in __copy_constexpr()
42 __copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __copy() argument
44 return _VSTD::__copy_constexpr(__first, __last, __result); in __copy()
55 __copy(_Tp* __first, _Tp* __last, _Up* __result) in __copy() argument
57 const size_t __n = static_cast<size_t>(__last - __first); in __copy()
66 copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in copy() argument
69 return _VSTD::__copy_constexpr(__first, __last, __result); in copy()
73 _VSTD::__unwrap_iter(__last), in copy()
/freebsd-12-stable/contrib/llvm-project/libcxx/include/
Dcharconv337 __to_chars_itoa(char* __first, char* __last, _Tp __value, true_type)
340 if (__value < 0 && __first != __last)
346 return __to_chars_itoa(__first, __last, __x, false_type());
352 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type)
355 auto __diff = __last - __first;
361 return {__last, errc::value_too_large};
376 return {__last, errc::value_too_large};
384 __to_chars_integral(char* __first, char* __last, _Tp __value, int __base,
388 if (__value < 0 && __first != __last)
394 return __to_chars_integral(__first, __last, __x, __base, false_type());
[all …]

123456