Home
last modified time | relevance | path

Searched refs:_RandomAccessIterator (Results 1 – 19 of 19) sorted by relevance

/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Dnth_element.h28 template<class _Compare, class _RandomAccessIterator>
30 __nth_element_find_guard(_RandomAccessIterator& __i, _RandomAccessIterator& __j, in __nth_element_find_guard()
44 template <class _Compare, class _RandomAccessIterator>
46 __nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __l… in __nth_element()
67 _RandomAccessIterator __m = __first; in __nth_element()
79 _RandomAccessIterator __lm1 = __last; in __nth_element()
84 _RandomAccessIterator __i = __first; in __nth_element()
85 _RandomAccessIterator __j = __lm1; in __nth_element()
226 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __las… in nth_element()
232 template <class _RandomAccessIterator>
[all …]
H A Dpartial_sort.h30 template <class _Compare, class _RandomAccessIterator>
32 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator… in __partial_sort()
36 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; in __partial_sort()
37 for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) in __partial_sort()
48 template <class _RandomAccessIterator, class _Compare>
51 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort()
58 template <class _RandomAccessIterator>
61 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort()
64 __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); in partial_sort()
H A Dpartial_sort_copy.h30 template <class _Compare, class _InputIterator, class _RandomAccessIterator>
31 _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator
33 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in __partial_sort_copy()
35 _RandomAccessIterator __r = __result_first; in __partial_sort_copy()
41 … typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; in __partial_sort_copy()
53 template <class _InputIterator, class _RandomAccessIterator, class _Compare>
55 _RandomAccessIterator
57 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in partial_sort_copy()
63 template <class _InputIterator, class _RandomAccessIterator>
65 _RandomAccessIterator
[all …]
H A Dstable_sort.h100 template <class _Compare, class _RandomAccessIterator>
102 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
106 template <class _Compare, class _RandomAccessIterator>
108 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, in __stable_sort_move()
146 _RandomAccessIterator __m = __first1 + __l2; in __stable_sort_move()
158 template <class _Compare, class _RandomAccessIterator>
160 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __stable_sort()
182 _RandomAccessIterator __m = __first + __l2; in __stable_sort()
207 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in stable_sort()
223 template <class _RandomAccessIterator>
[all …]
H A Dis_heap_until.h25 template <class _RandomAccessIterator, class _Compare>
26 _LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator
27 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in is_heap_until()
29 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in is_heap_until()
33 _RandomAccessIterator __pp = __first; in is_heap_until()
36 _RandomAccessIterator __cp = __first + __c; in is_heap_until()
52 template<class _RandomAccessIterator>
55 _RandomAccessIterator
56 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) in is_heap_until()
58 …D::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in is_heap_until()
H A Dpush_heap.h27 template <class _Compare, class _RandomAccessIterator>
29 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __sift_up()
30 typename iterator_traits<_RandomAccessIterator>::difference_type __len) in __sift_up()
32 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; in __sift_up()
36 _RandomAccessIterator __ptr = __first + __len; in __sift_up()
54 template <class _RandomAccessIterator, class _Compare>
57 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in push_heap()
63 template <class _RandomAccessIterator>
66 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in push_heap()
68 …_VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in push_heap()
H A Dpop_heap.h28 template <class _Compare, class _RandomAccessIterator>
31 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pop_heap()
32 typename iterator_traits<_RandomAccessIterator>::difference_type __len) in __pop_heap()
41 template <class _RandomAccessIterator, class _Compare>
44 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in pop_heap()
50 template <class _RandomAccessIterator>
53 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in pop_heap()
55 …_VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_typ… in pop_heap()
H A Dsort_heap.h28 template <class _Compare, class _RandomAccessIterator>
30 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __sort_heap()
32 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __sort_heap()
37 template <class _RandomAccessIterator, class _Compare>
40 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in sort_heap()
46 template <class _RandomAccessIterator>
49 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in sort_heap()
51 …_VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in sort_heap()
H A Dmake_heap.h27 template <class _Compare, class _RandomAccessIterator>
29 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __make_heap()
31 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __make_heap()
43 template <class _RandomAccessIterator, class _Compare>
46 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in make_heap()
52 template <class _RandomAccessIterator>
55 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in make_heap()
57 …_VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty… in make_heap()
H A Dshuffle.h59 template <class _RandomAccessIterator>
61 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) in random_shuffle()
63 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle()
80 template <class _RandomAccessIterator, class _RandomNumberGenerator>
82 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, in random_shuffle()
89 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle()
103 template<class _RandomAccessIterator, class _UniformRandomNumberGenerator>
104 void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, in shuffle()
107 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in shuffle()
H A Drotate.h103 template<typename _RandomAccessIterator>
104 _LIBCPP_CONSTEXPR_AFTER_CXX14 _RandomAccessIterator
105 __rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in __rotate_gcd()
108 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; in __rotate_gcd()
118 for (_RandomAccessIterator __p = __first + __g; __p != __first;) in __rotate_gcd()
121 _RandomAccessIterator __p1 = __p; in __rotate_gcd()
122 _RandomAccessIterator __p2 = __p1 + __m1; in __rotate_gcd()
170 template <class _RandomAccessIterator>
172 _LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator
173 __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __las… in __rotate()
[all …]
H A Dsort.h163 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_3()
166 _RandomAccessIterator __j = __first+2; in __insertion_sort_3()
173 _RandomAccessIterator __k = __j; in __insertion_sort_3()
188 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare _… in __insertion_sort_incomplete()
210 _RandomAccessIterator __j = __first+2; in __insertion_sort_incomplete()
219 _RandomAccessIterator __k = __j; in __insertion_sort_incomplete()
272 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __sort()
331 _RandomAccessIterator __j = __lm1; in __sort()
508 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in _LIBCPP_EXTERN_TEMPLATE()
518 template <class _RandomAccessIterator>
[all …]
H A Dsift_down.h25 template <class _Compare, class _RandomAccessIterator>
27 __sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, in __sift_down() argument
29 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __sift_down()
30 _RandomAccessIterator __start) in __sift_down()
32 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __sift_down()
33 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; in __sift_down()
42 _RandomAccessIterator __child_i = __first + __child; in __sift_down()
H A Dis_heap.h26 template <class _RandomAccessIterator, class _Compare>
30 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in is_heap()
35 template<class _RandomAccessIterator>
39 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in is_heap()
41 …return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::val… in is_heap()
H A Dsearch_n.h60 template <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp>
61 _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator __search_n(_RandomAccessIterator __first, in __search_n()
62 … _RandomAccessIterator __last, _Size __count, in __search_n()
70 …const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyon… in __search_n()
81 _RandomAccessIterator __m = __first; in __search_n()
H A Dreverse.h39 template <class _RandomAccessIterator>
42 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) in __reverse()
H A Dfill.h35 template <class _RandomAccessIterator, class _Tp>
38 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_acc… in __fill()
/freebsd-13.1/contrib/llvm-project/libcxx/include/experimental/
H A Dfunctional347 template<class _RandomAccessIterator,
348 class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
351 boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
352 make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
355 … return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
442 template<class _RandomAccessIterator,
443 class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
446 boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
447 make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
450 …return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __h…
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A Drandom3664 template<class _RandomAccessIterator>
3665 void generate(_RandomAccessIterator __first, _RandomAccessIterator __last);
3692 template<class _RandomAccessIterator>
3694 seed_seq::generate(_RandomAccessIterator __first, _RandomAccessIterator __last)