| /freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/ |
| D | inplace_merge.h | 85 … typename iterator_traits<_BidirectionalIterator>::difference_type __len2, in __buffered_inplace_merge() argument
91 if (__len1 <= __len2) in __buffered_inplace_merge()
116 … typename iterator_traits<_BidirectionalIterator>::difference_type __len2, in __inplace_merge() argument
123 if (__len2 == 0) in __inplace_merge()
125 if (__len1 <= __buff_size || __len2 <= __buff_size) in __inplace_merge()
127 (__first, __middle, __last, __comp, __len1, __len2, __buff); in __inplace_merge()
149 if (__len1 < __len2) in __inplace_merge()
151 __len21 = __len2 / 2; in __inplace_merge()
173 difference_type __len22 = __len2 - __len21; // distance(__m2, __last) in __inplace_merge()
186 __len2 = __len22; in __inplace_merge()
[all …]
|
| D | stable_partition.h | 83 _Distance __len2 = __len / 2; // __len2 >= 2 in __stable_partition() local
84 _VSTD::advance(__m, __len2); in __stable_partition()
89 …ator __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); in __stable_partition()
95 _Distance __len_half = __len - __len2; in __stable_partition()
209 _Distance __len2 = __len / 2; // __len2 >= 2 in __stable_partition() local
210 _VSTD::advance(__m, __len2); in __stable_partition()
216 _Distance __len_half = __len2; in __stable_partition()
234 __len_half = __len - __len2; in __stable_partition()
|
| D | search.h | 69 const _D2 __len2 = __last2 - __first2; in __search() local
70 if (__len2 == 0) in __search()
73 if (__len1 < __len2) in __search()
75 …const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyo… in __search()
90 return _VSTD::make_pair(__first1, __first1 + __len2); in __search()
|
| D | find_end.h | 103 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; in __find_end() local
104 if (__len2 == 0) in __find_end()
107 if (__len1 < __len2) in __find_end()
109 …const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go befor… in __find_end()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/ |
| D | vstring.tcc | 130 const size_type __len2) in _M_replace() argument
132 _M_check_length(__len1, __len2, "__versa_string::_M_replace"); in _M_replace()
135 const size_type __new_size = __old_size + __len2 - __len1; in _M_replace()
144 if (__how_much && __len1 != __len2) in _M_replace()
145 this->_S_move(__p + __len2, __p + __len1, __how_much); in _M_replace()
146 if (__len2) in _M_replace()
147 this->_S_copy(__p, __s, __len2); in _M_replace()
152 if (__len2 && __len2 <= __len1) in _M_replace()
153 this->_S_move(__p, __s, __len2); in _M_replace()
154 if (__how_much && __len1 != __len2) in _M_replace()
[all …]
|
| D | sso_string_base.h | 213 size_type __len2); in _GLIBCXX_BEGIN_NAMESPACE()
509 const size_type __len2) in _M_mutate() argument
513 size_type __new_capacity = _M_length() + __len2 - __len1; in _M_mutate()
518 if (__s && __len2) in _M_mutate()
519 _S_copy(__r + __pos, __s, __len2); in _M_mutate()
521 _S_copy(__r + __pos + __len2, in _M_mutate()
|
| D | rc_string_base.h | 336 size_type __len2); in _GLIBCXX_BEGIN_NAMESPACE()
639 size_type __len2) in _M_mutate() argument
643 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1, in _M_mutate()
648 if (__s && __len2) in _M_mutate()
649 _S_copy(__r->_M_refdata() + __pos, __s, __len2); in _M_mutate()
651 _S_copy(__r->_M_refdata() + __pos + __len2, in _M_mutate()
|
| D | algorithm | 163 const ptrdiff_t __len2 = __last2 - __first2;
164 const int __result = std::memcmp(__first1, __first2, min(__len1, __len2));
166 : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));
|
| D | vstring.h | 1217 const size_type __len2); in _GLIBCXX_BEGIN_NAMESPACE()
|
| /freebsd-12-stable/contrib/libstdc++/include/bits/ |
| D | stl_algo.h | 3076 _Distance __len1, _Distance __len2) in __merge_without_buffer() argument
3078 if (__len1 == 0 || __len2 == 0) in __merge_without_buffer()
3080 if (__len1 + __len2 == 2) in __merge_without_buffer()
3090 if (__len1 > __len2) in __merge_without_buffer()
3099 __len22 = __len2 / 2; in __merge_without_buffer()
3110 __len1 - __len11, __len2 - __len22); in __merge_without_buffer()
3124 _Distance __len1, _Distance __len2, in __merge_without_buffer() argument
3127 if (__len1 == 0 || __len2 == 0) in __merge_without_buffer()
3129 if (__len1 + __len2 == 2) in __merge_without_buffer()
3139 if (__len1 > __len2) in __merge_without_buffer()
[all …]
|
| D | basic_string.tcc | 451 _M_mutate(size_type __pos, size_type __len1, size_type __len2) in _M_mutate() argument
454 const size_type __new_size = __old_size + __len2 - __len1; in _M_mutate()
466 _M_copy(__r->_M_refdata() + __pos + __len2, in _M_mutate()
472 else if (__how_much && __len1 != __len2) in _M_mutate()
475 _M_move(_M_data() + __pos + __len2, in _M_mutate()
|
| D | stl_algobase.h | 907 const size_t __len2 = __last2 - __first2;
909 std::min(__len1, __len2));
910 return __result != 0 ? __result < 0 : __len1 < __len2;
|
| D | basic_string.h | 404 _M_mutate(size_type __pos, size_type __len1, size_type __len2); in _GLIBCXX_BEGIN_NAMESPACE()
|
| /freebsd-12-stable/contrib/llvm-project/libcxx/include/ |
| D | __string | 925 const ptrdiff_t __len2 = __last2 - __first2;
926 if (__len2 == 0)
930 if (__len1 < __len2)
937 // Check whether __first1 still has at least __len2 bytes.
938 if (__len1 < __len2)
942 __first1 = _Traits::find(__first1, __len1 - __len2 + 1, __f2);
951 if (_Traits::compare(__first1, __first2, __len2) == 0)
|