/haiku-buildtools/legacy/gcc/libstdc++/stl/ |
H A D | stl_algobase.h | 440 const size_t __len1 = __last1 - __first1; local 442 const int __result = memcmp(__first1, __first2, min(__len1, __len2)); 443 return __result != 0 ? __result < 0 : __len1 < __len2; 488 const ptrdiff_t __len1 = __last1 - __first1; local 490 const int __result = memcmp(__first1, __first2, min(__len1, __len2)); 492 : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));
|
H A D | stl_algo.h | 1983 _Distance __len1, _Distance __len2) { 1984 if (__len1 == 0 || __len2 == 0) 1986 if (__len1 + __len2 == 2) { 1995 if (__len1 > __len2) { 1996 __len11 = __len1 / 2; 2011 __merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11, 2019 _Distance __len1, _Distance __len2, 2021 if (__len1 == 0 || __len2 == 0) 2023 if (__len1 + __len2 == 2) { 2032 if (__len1 > __len 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 2223 _Distance __len1 = 0; local 2242 _Distance __len1 = 0; local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/ext/ |
H A D | rc_string_base.h | 349 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 652 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 655 const size_type __how_much = _M_length() - __pos - __len1; 657 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, 666 _M_data() + __pos + __len1, __how_much);
|
H A D | sso_string_base.h | 216 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 539 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 542 const size_type __how_much = _M_length() - __pos - __len1; 544 size_type __new_capacity = _M_length() + __len2 - __len1; 553 _M_data() + __pos + __len1, __how_much);
|
H A D | vstring.h | 1605 _M_replace(size_type __pos, size_type __len1, const _CharT* __s,
|
/haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 2388 _Distance __len1, _Distance __len2, 2393 if (__len1 > __len2 && __len2 <= __buffer_size) 2404 else if (__len1 <= __buffer_size) 2406 if (__len1) 2430 _Distance __len1, _Distance __len2, 2434 if (__len1 <= __len2 && __len1 <= __buffer_size) 2452 if (__len1 > __len2) 2454 __len11 = __len1 / 2; 2473 __len1 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 2551 const _DistanceType __len1 = std::distance(__first, __middle); local [all...] |
H A D | stl_algobase.h | 933 const size_t __len1 = __last1 - __first1; local 935 if (const size_t __len = std::min(__len1, __len2)) 938 return __len1 < __len2;
|
H A D | basic_string.h | 365 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 1846 _M_replace(size_type __pos, size_type __len1, const _CharT* __s, 2821 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/ |
H A D | pr46567.C | 1500 const size_t __len1 = __last1 - __first1; local 1503 std::min(__len1, __len2)); 1504 return __result != 0 ? __result < 0 : __len1 < __len2;
|