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

/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_algo.h1992 _BidirectionalIter __second_cut = __middle; local
1998 __second_cut = lower_bound(__middle, __last, *__first_cut);
1999 distance(__middle, __second_cut, __len22);
2003 advance(__second_cut, __len22);
2004 __first_cut = upper_bound(__first, __middle, *__second_cut);
2008 = rotate(__first_cut, __middle, __second_cut);
2011 __merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
2029 _BidirectionalIter __second_cut = __middle; local
2035 __second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
2036 distance(__middle, __second_cut, __len2
2150 _BidirectionalIter __second_cut = __middle; local
2194 _BidirectionalIter __second_cut = __middle; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_algo.h2449 _BidirectionalIterator __second_cut = __middle; local
2456 __second_cut
2459 __len22 = std::distance(__middle, __second_cut);
2464 std::advance(__second_cut, __len22);
2466 = std::__upper_bound(__first, __middle, *__second_cut,
2472 = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
2477 std::__merge_adaptive(__new_middle, __second_cut, __last,
2505 _BidirectionalIterator __second_cut = __middle; local
2512 __second_cut
2515 __len22 = std::distance(__middle, __second_cut);
[all...]

Completed in 61 milliseconds