Searched refs:__middle (Results 1 - 10 of 10) sorted by relevance

/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_algo.h706 _ForwardIter __middle,
710 if (__first == __middle)
712 if (__last == __middle)
715 _ForwardIter __first2 = __middle;
718 if (__first == __middle)
719 __middle = __first2;
724 __first2 = __middle;
728 if (__first == __middle)
729 __middle = __first2;
731 __first2 = __middle;
705 __rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _Distance*, forward_iterator_tag) argument
739 __rotate(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance*, bidirectional_iterator_tag) argument
766 __rotate(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Distance *, _Tp *) argument
819 rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) argument
827 rotate_copy(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _OutputIter __result) argument
1071 _ForwardIter __middle = __first; local
1346 _RandomAccessIter __middle = __first + (__last - __first) / 2; local
1361 _RandomAccessIter __middle = __first + (__last - __first) / 2; local
1479 _RandomAccessIter __middle = __first + __len; local
1498 _RandomAccessIter __middle = __first + __len; local
1560 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*) argument
1571 partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last) argument
1578 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1589 partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp) argument
1729 _ForwardIter __middle; local
1760 _ForwardIter __middle; local
1791 _ForwardIter __middle; local
1822 _ForwardIter __middle; local
1854 _ForwardIter __middle, __left, __right; local
1892 _ForwardIter __middle, __left, __right; local
1980 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2) argument
2016 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2054 __rotate_adaptive(_BidirectionalIter1 __first, _BidirectionalIter1 __middle, _BidirectionalIter1 __last, _Distance __len1, _Distance __len2, _BidirectionalIter2 __buffer, _Distance __buffer_size) argument
2135 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) argument
2177 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2220 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*) argument
2238 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*, _Compare __comp) argument
2257 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last) argument
2267 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp) argument
[all...]
H A Dropeimpl.h1497 _Rope_iterator<_CharT,_Alloc> __middle,
1500 __stl_assert(__first.container() == __middle.container()
1501 && __middle.container() == __last.container());
1507 __r.substr(__middle.index(), __last.index() - __middle.index());
1509 __r.substr(__first.index(), __middle.index() - __first.index());
1519 _Rope_iterator<char,__STL_DEFAULT_ALLOCATOR(char)> __middle,
1521 _Rope_rotate(__first, __middle, __last);
1535 _Rope_iterator<wchar_t,__STL_DEFAULT_ALLOCATOR(char)> __middle,
1537 _Rope_rotate(__first, __middle, __las
1496 _Rope_rotate(_Rope_iterator<_CharT,_Alloc> __first, _Rope_iterator<_CharT,_Alloc> __middle, _Rope_iterator<_CharT,_Alloc> __last) argument
1518 rotate(_Rope_iterator<char,__STL_DEFAULT_ALLOCATOR(char)> __first, _Rope_iterator<char,__STL_DEFAULT_ALLOCATOR(char)> __middle, _Rope_iterator<char,__STL_DEFAULT_ALLOCATOR(char)> __last) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_algo.h616 _ForwardIterator __middle; local
621 __middle = __first;
622 std::advance(__middle, __half);
623 if (__pred(*__middle))
625 __first = __middle;
1247 _ForwardIterator __middle,
1251 if (__first == __middle)
1253 else if (__last == __middle)
1256 _ForwardIterator __first2 = __middle;
1262 if (__first == __middle)
1246 __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) argument
1287 __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) argument
1325 __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) argument
1431 rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) argument
1468 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) argument
1582 _ForwardIterator __middle = __first; local
1665 __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
1923 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
2048 _ForwardIterator __middle = __first; local
2139 _ForwardIterator __middle = __first; local
2385 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) argument
2427 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2488 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2538 __inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2586 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) argument
2626 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2748 const _RandomAccessIterator __middle = __first + __len; local
2779 _RandomAccessIterator __middle = __first + (__last - __first) / 2; local
4543 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) argument
4580 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_algobase.h973 _ForwardIterator __middle = __first; local
974 std::advance(__middle, __half);
975 if (__comp(__middle, __val))
977 __first = __middle;
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dmultiseq_selection.h256 _DifferenceType __middle = (__b[__i] + __a[__i]) / 2;
257 if (__lmax && __middle < __ns[__i] &&
258 __lcomp(std::make_pair(__S(__i)[__middle], __i),
501 _DifferenceType __middle = (__b[__i] + __a[__i]) / 2;
502 if (__lmax && __middle < __ns[__i]
503 && __comp(__S(__i)[__middle], *__lmax))
H A Dpartition.h417 * @param __middle Sort until this position.
423 _RAIter __middle,
426 __parallel_nth_element(__begin, __middle, __end, __comp);
427 std::sort(__begin, __middle, __comp);
422 __parallel_partial_sort(_RAIter __begin, _RAIter __middle, _RAIter __end, _Compare __comp) argument
H A Dalgo.h1713 _DifferenceType __middle = __gnu_parallel:: local
1716 return __begin + __middle;
2131 partial_sort(_RAIter __begin, _RAIter __middle, argument
2134 { _GLIBCXX_STD_A::partial_sort(__begin, __middle, __end, __comp); }
2139 partial_sort(_RAIter __begin, _RAIter __middle, argument
2141 { _GLIBCXX_STD_A::partial_sort(__begin, __middle, __end); }
2146 partial_sort(_RAIter __begin, _RAIter __middle, argument
2153 __parallel_partial_sort(__begin, __middle, __end, __comp);
2155 partial_sort(__begin, __middle, __end, __comp,
2162 partial_sort(_RAIter __begin, _RAIter __middle, argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/debug/
H A Dformatter.h139 __middle, // dereferenceable, not at the beginning enumerator in enum:__gnu_debug::_Error_formatter::_Iterator_state
248 _M_variant._M_iterator._M_state = __middle;
284 _M_variant._M_iterator._M_state = __middle;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/
H A Dbitmap_allocator.h244 _ForwardIterator __middle; local
249 __middle = __first;
250 __middle += __half;
251 if (__comp(*__middle, __val))
253 __first = __middle;
H A Dropeimpl.h1658 _Rope_iterator __middle,
1669 __r.substr(__middle.index(), __last.index() - __middle.index());
1671 __r.substr(__first.index(), __middle.index() - __first.index());
1682 _Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __middle,
1684 { _Rope_rotate(__first, __middle, __last); }
1697 _Rope_iterator<wchar_t, __STL_DEFAULT_ALLOCATOR(char)> __middle,
1699 { _Rope_rotate(__first, __middle, __last); }
1657 _Rope_rotate(_Rope_iterator __first, _Rope_iterator __middle, _Rope_iterator __last) argument
1681 rotate(_Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __first, _Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __middle, _Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __last) argument

Completed in 197 milliseconds