/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/ |
H A D | sso_string_base.h | 223 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 524 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 527 const size_type __how_much = _M_length() - __pos - __len1; 529 size_type __new_capacity = _M_length() + __len2 - __len1; 538 _M_data() + __pos + __len1, __how_much);
|
H A D | rc_string_base.h | 334 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 636 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 639 const size_type __how_much = _M_length() - __pos - __len1; 641 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, 650 _M_data() + __pos + __len1, __how_much);
|
H A D | vstring.h | 1218 _M_replace(size_type __pos, size_type __len1, const _CharT* __s,
|
/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) 2982 __len11 = __len1 / 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 > __len 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 3672 const _DistanceType __len1 = std::distance(__first, __middle); local [all...] |
H A D | stl_algobase.h | 883 const size_t __len1 = __last1 - __first1; 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/ext/ |
H A D | rc_string_base.h | 342 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 645 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 648 const size_type __how_much = _M_length() - __pos - __len1; 650 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, 659 _M_data() + __pos + __len1, __how_much);
|
H A D | sso_string_base.h | 215 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, 535 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, argument 538 const size_type __how_much = _M_length() - __pos - __len1; 540 size_type __new_capacity = _M_length() + __len2 - __len1; 549 _M_data() + __pos + __len1, __how_much);
|
H A D | vstring.h | 1443 _M_replace(size_type __pos, size_type __len1, const _CharT* __s,
|
/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) 2811 else if (__len1 <= __buffer_size) 2832 _Distance __len1, _Distance __len2, 2835 if (__len1 <= __len2 && __len1 <= __buffer_size) 2859 if (__len1 > __len2) 2861 __len11 = __len1 / 2; 2877 __len1 - __len11, __len22, __buffer, 2882 __len1 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 3137 const _DistanceType __len1 = std::distance(__first, __middle); local [all...] |
H A D | stl_algobase.h | 915 const size_t __len1 = __last1 - __first1; 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);
|