Home
last modified time | relevance | path

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

1234

/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Drotate.h37 _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); in __rotate_left()
61 swap(*__first, *__i); in __rotate_forward()
62 ++__first; in __rotate_forward()
65 if (__first == __middle) in __rotate_forward()
69 if (__first != __middle) in __rotate_forward()
74 swap(*__first, *__i); in __rotate_forward()
75 ++__first; in __rotate_forward()
118 for (_RandomAccessIterator __p = __first + __g; __p != __first;) in __rotate_gcd()
135 return __first + __m2; in __rotate_gcd()
193 if (__first == __middle) in rotate()
[all …]
H A Dstable_partition.h35 return __first; in __stable_partition()
44 return __first; in __stable_partition()
63 ++__first; in __stable_partition()
74 __i = __first; in __stable_partition()
78 return __first; in __stable_partition()
123 return __first; in __stable_partition()
126 ++__first; in __stable_partition()
187 ++__first; in __stable_partition()
198 __i = ++__first; in __stable_partition()
204 return __first; in __stable_partition()
[all …]
H A Dpartition.h33 if (__first == __last) in __partition()
34 return __first; in __partition()
35 if (!__pred(*__first)) in __partition()
37 ++__first; in __partition()
43 swap(*__first, *__p); in __partition()
44 ++__first; in __partition()
47 return __first; in __partition()
60 return __first; in __partition()
63 ++__first; in __partition()
68 return __first; in __partition()
[all …]
H A Dsort.h132 for (--__lm1; __first != __lm1; ++__first) in __selection_sort()
137 if (__i != __first) in __selection_sort()
147 if (__first != __last) in __insertion_sort()
167 _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); in __insertion_sort_3()
200 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); in __insertion_sort_incomplete()
203 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); in __insertion_sort_incomplete()
206 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); in __insertion_sort_incomplete()
211 _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); in __insertion_sort_incomplete()
292 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); in __sort()
295 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); in __sort()
[all …]
H A Dunique_copy.h32 if (__first != __last) in __unique_copy()
37 while (++__first != __last) in __unique_copy()
39 if (!__pred(__t, *__first)) in __unique_copy()
41 __t = *__first; in __unique_copy()
55 if (__first != __last) in __unique_copy()
60 while (++__first != __last) in __unique_copy()
64 *__result = *__first; in __unique_copy()
66 __i = __first; in __unique_copy()
78 if (__first != __last) in __unique_copy()
80 *__result = *__first; in __unique_copy()
[all …]
H A Dsearch_n.h32 return __first; in __search_n()
40 ++__first; in __search_n()
43 _ForwardIterator __m = __first; in __search_n()
47 return __first; in __search_n()
52 __first = __m; in __search_n()
53 ++__first; in __search_n()
66 return __first; in __search_n()
78 ++__first; in __search_n()
85 return __first; in __search_n()
89 __first = __m; in __search_n()
[all …]
H A Dminmax_element.h33 pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); in minmax_element()
34 if (__first != __last) in minmax_element()
36 if (++__first != __last) in minmax_element()
38 if (__comp(*__first, *__result.first)) in minmax_element()
39 __result.first = __first; in minmax_element()
41 __result.second = __first; in minmax_element()
42 while (++__first != __last) in minmax_element()
44 _ForwardIterator __i = __first; in minmax_element()
45 if (++__first == __last) in minmax_element()
55 if (__comp(*__first, *__i)) in minmax_element()
[all …]
H A 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()
75 swap(*__first, *(__first + __i)); 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()
97 swap(*__first, *(__first + __i)); in random_shuffle()
110 difference_type __d = __last - __first; in shuffle()
114 for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) in shuffle()
[all …]
H A Dnth_element.h55 difference_type __len = __last - __first; in __nth_element()
62 if (__comp(*--__last, *__first)) in __nth_element()
63 swap(*__first, *__last); in __nth_element()
67 _RandomAccessIterator __m = __first; in __nth_element()
78 _RandomAccessIterator __m = __first + __len/2; in __nth_element()
84 _RandomAccessIterator __i = __first; in __nth_element()
118 while (!__comp(*__first, *__i)) in __nth_element()
120 while (__comp(*__first, *--__j)) in __nth_element()
135 __first = __i; in __nth_element()
179 __j = __m = __first; in __nth_element()
[all …]
H A Dminmax.h55 _Iter __first = __t.begin(); in minmax() local
57 pair<_Tp, _Tp> __result(*__first, *__first); in minmax()
59 ++__first; in minmax()
63 __result.first = *__first; in minmax()
65 __result.second = *__first; in minmax()
66 ++__first; in minmax()
69 while (__first != __last) in minmax()
71 _Tp __prev = *__first++; in minmax()
73 if ( __comp(*__first, __result.first)) __result.first = *__first; in minmax()
78 if (!__comp(*__first, __result.second)) __result.second = *__first; in minmax()
[all …]
H A 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()
35 ++__first; 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
[all …]
H A Dshift_right.h37 return __first; in shift_right()
41 decltype(__n) __d = __last - __first; in shift_right()
45 _ForwardIterator __m = __first + (__d - __n); in shift_right()
46 return _VSTD::move_backward(__first, __m, __last); in shift_right()
50 if (__m == __first) { in shift_right()
57 _ForwardIterator __ret = __first; in shift_right()
71 auto __trail = __first; in shift_right()
75 _VSTD::move(__first, __trail, __ret); in shift_right()
82 _ForwardIterator __mid = __first; in shift_right()
86 _VSTD::move(__first, __mid, __trail); in shift_right()
[all …]
H A Dunique.h32 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) in unique() argument
34 …__first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::… in unique()
35 (__first, __last, __pred); in unique()
36 if (__first != __last) in unique()
40 _ForwardIterator __i = __first; in unique()
42 if (!__pred(*__first, *__i)) in unique()
43 *++__first = _VSTD::move(*__i); in unique()
44 ++__first; in unique()
46 return __first; in unique()
53 unique(_ForwardIterator __first, _ForwardIterator __last) in unique() argument
[all …]
H A Dpartial_sort.h32 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator… in __partial_sort() argument
35 _VSTD::__make_heap<_Compare>(__first, __middle, __comp); in __partial_sort()
36 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; in __partial_sort()
39 if (__comp(*__i, *__first)) in __partial_sort()
41 swap(*__i, *__first); in __partial_sort()
42 _VSTD::__sift_down<_Compare>(__first, __middle, __comp, __len, __first); in __partial_sort()
45 _VSTD::__sort_heap<_Compare>(__first, __middle, __comp); in __partial_sort()
51 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort() argument
55 _VSTD::__partial_sort<_Comp_ref>(__first, __middle, __last, __comp); in partial_sort()
61 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort() argument
[all …]
H A Dsample.h29 _SampleIterator __sample(_PopulationIterator __first, in __sample() argument
36 for (; __first != __last && __k < __n; ++__first, (void) ++__k) in __sample()
37 __output_iter[__k] = *__first; in __sample()
39 for (; __first != __last; ++__first, (void) ++__k) { in __sample()
42 __output_iter[__r] = *__first; in __sample()
50 _SampleIterator __sample(_PopulationIterator __first, in __sample() argument
55 _Distance __unsampled_sz = _VSTD::distance(__first, __last); in __sample()
59 *__output_iter++ = *__first; in __sample()
69 _SampleIterator __sample(_PopulationIterator __first, in __sample() argument
82 __first, __last, __output_iter, _CommonType(__n), in __sample()
[all …]
H A Dcopy.h32 __copy_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __copy_constexpr() argument
34 for (; __first != __last; ++__first, (void) ++__result) in __copy_constexpr()
35 *__result = *__first; 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()
59 _VSTD::memmove(__result, __first, __n * sizeof(_Up)); in __copy()
66 copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in copy() argument
69 return _VSTD::__copy_constexpr(__first, __last, __result); in copy()
[all …]
H A Dis_partitioned.h25 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) in is_partitioned() argument
27 for (; __first != __last; ++__first) in is_partitioned()
28 if (!__pred(*__first)) in is_partitioned()
30 if ( __first == __last ) in is_partitioned()
32 ++__first; in is_partitioned()
33 for (; __first != __last; ++__first) in is_partitioned()
34 if (__pred(*__first)) in is_partitioned()
H A Dmove.h33 __move_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __move_constexpr() argument
35 for (; __first != __last; ++__first, (void) ++__result) in __move_constexpr()
36 *__result = _VSTD::move(*__first); in __move_constexpr()
43 __move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in __move() argument
45 return _VSTD::__move_constexpr(__first, __last, __result); in __move()
56 __move(_Tp* __first, _Tp* __last, _Up* __result) in __move() argument
58 const size_t __n = static_cast<size_t>(__last - __first); in __move()
60 _VSTD::memmove(__result, __first, __n * sizeof(_Up)); in __move()
67 move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in move() argument
70 return _VSTD::__move_constexpr(__first, __last, __result); in move()
[all …]
H A Dpartial_sort_copy.h32 __partial_sort_copy(_InputIterator __first, _InputIterator __last, in __partial_sort_copy() argument
38 for (; __first != __last && __r != __result_last; ++__first, (void) ++__r) in __partial_sort_copy()
39 *__r = *__first; in __partial_sort_copy()
42 for (; __first != __last; ++__first) in __partial_sort_copy()
43 if (__comp(*__first, *__result_first)) in __partial_sort_copy()
45 *__result_first = *__first; in __partial_sort_copy()
56 partial_sort_copy(_InputIterator __first, _InputIterator __last, in partial_sort_copy() argument
60 …return _VSTD::__partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __com… in partial_sort_copy()
66 partial_sort_copy(_InputIterator __first, _InputIterator __last, in partial_sort_copy() argument
69 return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, in partial_sort_copy()
H A Dfill.h29 __fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) in __fill() argument
31 for (; __first != __last; ++__first) in __fill()
32 *__first = __value_; in __fill()
38 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_acc… in __fill() argument
40 _VSTD::fill_n(__first, __last - __first, __value_); in __fill()
46 fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in fill() argument
48 …_VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_cate… in fill()
H A Dremove.h28 remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in remove() argument
30 __first = _VSTD::find(__first, __last, __value_); in remove()
31 if (__first != __last) in remove()
33 _ForwardIterator __i = __first; in remove()
38 *__first = _VSTD::move(*__i); in remove()
39 ++__first; in remove()
43 return __first; in remove()
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A D__bit_reference169 if (__first.__ctz_ != 0)
180 ++__first.__seg_;
184 if (*__first.__seg_)
205 if (__first.__ctz_ != 0)
216 ++__first.__seg_;
258 if (__first.__ctz_ != 0)
265 ++__first.__seg_;
289 if (__first.__ctz_ != 0)
296 ++__first.__seg_;
337 ++__first.__seg_;
[all …]
H A Dnumeric169 for (; __first != __last; ++__first)
183 for (; __first != __last; ++__first)
198 for (; __first != __last; ++__first)
257 for (; __first != __last; ++__first)
294 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
317 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
368 for (; __first != __last; ++__first, (void) ++__result) {
426 for (; __first != __last; ++__first, (void) ++__result) {
460 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
484 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[all …]
H A Dregex3156 __first = __parse_grep(__first, __last);
3210 while (__first != __last && *__first == '|')
3493 if (*__first == '.' || *__first == '\\' || *__first == '[')
3794 if (__first != __last && *__first == '[')
3857 if (__first != __last && *__first != ']')
4040 if ('0' <= *__first && *__first <= '7')
4043 if (++__first != __last && ('0' <= *__first && *__first <= '7'))
4046 if (++__first != __last && ('0' <= *__first && *__first <= '7'))
4391 if (__first != __last && *__first == '\\')
4433 __first != __last && '0' <= *__first && *__first <= '9'; ++__first)
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h128 for (; __first != __last; ++__first) in destroy()
137 return __first; in destroy_n()
144 auto __idx = __first; in uninitialized_default_construct()
152 _VSTD::destroy(__first, __idx); in uninitialized_default_construct()
162 auto __idx = __first; in uninitialized_default_construct_n()
171 _VSTD::destroy(__first, __idx); in uninitialized_default_construct_n()
182 auto __idx = __first; in uninitialized_value_construct()
190 _VSTD::destroy(__first, __idx); in uninitialized_value_construct()
200 auto __idx = __first; in uninitialized_value_construct_n()
224 for (; __first != __last; (void)++__idx, ++__first) in uninitialized_move()
[all …]

1234