Home
last modified time | relevance | path

Searched refs:__nth (Results 1 – 2 of 2) sorted by relevance

/NextBSD/contrib/libstdc++/include/bits/
Dstl_algo.h3945 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, in __introselect() argument
3955 std::__heap_select(__first, __nth + 1, __last); in __introselect()
3957 std::iter_swap(__first, __nth); in __introselect()
3970 if (__cut <= __nth) in __introselect()
3980 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, in __introselect() argument
3991 std::__heap_select(__first, __nth + 1, __last, __comp); in __introselect()
3993 std::iter_swap(__first, __nth); in __introselect()
4007 if (__cut <= __nth) in __introselect()
4032 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, in nth_element() argument
4042 __glibcxx_requires_valid_range(__first, __nth); in nth_element()
[all …]
/NextBSD/contrib/libc++/include/
Dalgorithm5127 __nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __l…
5135 if (__nth == __last)
5216 if (__nth < __i)
5219 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5263 if (__nth == __i)
5268 if (__nth < __i)
5298 // __nth_element on range containing __nth
5299 if (__nth < __i)
5301 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5306 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
[all …]