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

/haiku/headers/cpp/
H A Dstl_algobase.h441 const size_t __len2 = __last2 - __first2; local
442 const int __result = memcmp(__first1, __first2, min(__len1, __len2));
443 return __result != 0 ? __result < 0 : __len1 < __len2;
489 const ptrdiff_t __len2 = __last2 - __first2; local
490 const int __result = memcmp(__first1, __first2, min(__len1, __len2));
492 : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));
H A Dstl_algo.h1983 _Distance __len1, _Distance __len2) {
1984 if (__len1 == 0 || __len2 == 0)
1986 if (__len1 + __len2 == 2) {
1995 if (__len1 > __len2) {
2002 __len22 = __len2 / 2;
2012 __len2 - __len22);
2019 _Distance __len1, _Distance __len2,
2021 if (__len1 == 0 || __len2 == 0)
2023 if (__len1 + __len2 == 2) {
2032 if (__len1 > __len2) {
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
2225 _Distance __len2 = 0; local
2244 _Distance __len2 = 0; local
[all...]

Completed in 37 milliseconds