Searched refs:__nth (Results 1 - 4 of 4) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dpartition.h326 * @param __nth _Iterator of element that must be in position afterwards.
332 __parallel_nth_element(_RAIter __begin, _RAIter __nth, argument
403 if (__split_pos2 <= __nth)
405 else if (__nth < __split_pos1)
412 __gnu_sequential::nth_element(__begin, __nth, __end, __comp);
H A Dalgo.h2089 nth_element(_RAIter __begin, _RAIter __nth, argument
2091 { return _GLIBCXX_STD_A::nth_element(__begin, __nth, __end); }
2096 nth_element(_RAIter __begin, _RAIter __nth, argument
2099 { return _GLIBCXX_STD_A::nth_element(__begin, __nth, __end, __comp); }
2104 nth_element(_RAIter __begin, _RAIter __nth, argument
2110 __gnu_parallel::__parallel_nth_element(__begin, __nth, __end, __comp);
2112 nth_element(__begin, __nth, __end, __comp,
2119 nth_element(_RAIter __begin, _RAIter __nth, argument
2124 __gnu_parallel::nth_element(__begin, __nth, __end,
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_algo.h1972 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, argument
1980 std::__heap_select(__first, __nth + 1, __last, __comp);
1982 std::iter_swap(__first, __nth);
1988 if (__cut <= __nth)
4602 * @param __nth Another iterator.
4606 * Rearranges the elements in the range @p [__first,__last) so that @p *__nth
4608 * whole sequence been sorted. The elements either side of @p *__nth are
4610 * @p [__first,__nth) and any iterator @e j in the range @p [__nth,__last) it
4615 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, argument
4653 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_algo.h1672 void __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, argument
1680 if (__cut <= __nth)
1689 inline void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, argument
1691 __nth_element(__first, __nth, __last, __VALUE_TYPE(__first));
1695 void __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, argument
1705 if (__cut <= __nth)
1714 inline void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, argument
1716 __nth_element(__first, __nth, __last, __VALUE_TYPE(__first), __comp);

Completed in 85 milliseconds