Searched refs:__first_cut (Results 1 - 2 of 2) sorted by relevance

/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_algo.h1991 _BidirectionalIter __first_cut = __first; local
1997 advance(__first_cut, __len11);
1998 __second_cut = lower_bound(__middle, __last, *__first_cut);
2004 __first_cut = upper_bound(__first, __middle, *__second_cut);
2005 distance(__first, __first_cut, __len11);
2008 = rotate(__first_cut, __middle, __second_cut);
2009 __merge_without_buffer(__first, __first_cut, __new_middle,
2028 _BidirectionalIter __first_cut = __first; local
2034 advance(__first_cut, __len11);
2035 __second_cut = lower_bound(__middle, __last, *__first_cut, __com
2149 _BidirectionalIter __first_cut = __first; local
2193 _BidirectionalIter __first_cut = __first; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_algo.h2448 _BidirectionalIterator __first_cut = __first; local
2455 std::advance(__first_cut, __len11);
2457 = std::__lower_bound(__middle, __last, *__first_cut,
2465 __first_cut
2468 __len11 = std::distance(__first, __first_cut);
2472 = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
2475 std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
2504 _BidirectionalIterator __first_cut = __first; local
2511 std::advance(__first_cut, __len11);
2513 = std::__lower_bound(__middle, __last, *__first_cut,
[all...]

Completed in 145 milliseconds