/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/ |
H A D | sso_string_base.h | 224 size_type __len2); 525 const size_type __len2) 529 size_type __new_capacity = _M_length() + __len2 - __len1; 534 if (__s && __len2) 535 _S_copy(__r + __pos, __s, __len2); 537 _S_copy(__r + __pos + __len2, 524 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, const size_type __len2) argument
|
H A D | rc_string_base.h | 335 size_type __len2); 637 size_type __len2) 641 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, 646 if (__s && __len2) 647 _S_copy(__r->_M_refdata() + __pos, __s, __len2); 649 _S_copy(__r->_M_refdata() + __pos + __len2, 636 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, size_type __len2) argument
|
H A D | vstring.h | 1219 const size_type __len2);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
H A D | rc_string_base.h | 343 size_type __len2); 646 size_type __len2) 650 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, 655 if (__s && __len2) 656 _S_copy(__r->_M_refdata() + __pos, __s, __len2); 658 _S_copy(__r->_M_refdata() + __pos + __len2, 645 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, size_type __len2) argument
|
H A D | sso_string_base.h | 216 size_type __len2); 536 size_type __len2) 540 size_type __new_capacity = _M_length() + __len2 - __len1; 545 if (__s && __len2) 546 _S_copy(__r + __pos, __s, __len2); 548 _S_copy(__r + __pos + __len2, 535 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, size_type __len2) argument
|
H A D | vstring.h | 1444 const size_type __len2);
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 2966 _Distance __len1, _Distance __len2) 2968 if (__len1 == 0 || __len2 == 0) 2970 if (__len1 + __len2 == 2) 2980 if (__len1 > __len2) 2989 __len22 = __len2 / 2; 3000 __len1 - __len11, __len2 - __len22); 3014 _Distance __len1, _Distance __len2, 3017 if (__len1 == 0 || __len2 == 0) 3019 if (__len1 + __len2 == 2) 3029 if (__len1 > __len2) 2963 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) argument 3011 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument 3430 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) argument 3466 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) argument 3525 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument 3617 _DistanceType __len2 = std::distance(__middle, __last); local 3673 const _DistanceType __len2 = std::distance(__middle, __last); local [all...] |
H A D | stl_algobase.h | 884 const size_t __len2 = __last2 - __first2; local 886 std::min(__len1, __len2)); 887 return __result != 0 ? __result < 0 : __len1 < __len2;
|
H A D | basic_string.h | 389 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 2800 _Distance __len1, _Distance __len2, 2805 if (__len1 > __len2 && __len2 <= __buffer_size) 2832 _Distance __len1, _Distance __len2, 2835 if (__len1 <= __len2 && __len1 <= __buffer_size) 2844 else if (__len2 <= __buffer_size) 2859 if (__len1 > __len2) 2869 __len22 = __len2 / 2; 2883 __len2 - __len22, __buffer, __buffer_size); 2894 _Distance __len1, _Distance __len2, 2797 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) argument 2829 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) argument 2891 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument 2954 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) argument 2998 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument 3081 _DistanceType __len2 = std::distance(__middle, __last); local 3138 const _DistanceType __len2 = std::distance(__middle, __last); local [all...] |
H A D | stl_algobase.h | 916 const size_t __len2 = __last2 - __first2; local 918 std::min(__len1, __len2)); 919 return __result != 0 ? __result < 0 : __len1 < __len2;
|
H A D | basic_string.h | 406 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
|