Home
last modified time | relevance | path

Searched refs:__len1 (Results 1 – 4 of 4) sorted by relevance

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_algo.c45 _Distance __len1, _Distance __len2,
1096 _Distance __len1, _Distance __len2, in __rotate_adaptive() argument
1099 if (__len1 > __len2 && __len2 <= __buffer_size) { in __rotate_adaptive()
1104 else if (__len1 <= __buffer_size) { in __rotate_adaptive()
1118 _Distance __len1, _Distance __len2, in __merge_adaptive() argument
1121 if (__len1 <= __len2 && __len1 <= __buffer_size) { in __merge_adaptive()
1135 if (__len1 > __len2) { in __merge_adaptive()
1136 __len11 = __len1 / 2; in __merge_adaptive()
1148 __rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11, in __merge_adaptive()
1152 __merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11, in __merge_adaptive()
[all …]
D_algobase.h591 const size_t __len1 = __last1 - __first1; in lexicographical_compare() local
596 const int __result = memcmp(__first1, __first2, (min) (__len1, __len2)); in lexicographical_compare()
597 return __result != 0 ? (__result < 0) : (__len1 < __len2); in lexicographical_compare()
625 const ptrdiff_t __len1 = __last1 - __first1; in __lexicographical_compare_3way() local
627 const int __result = memcmp(__first1, __first2, (min) (__len1, __len2)); in __lexicographical_compare_3way()
629 : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1)); in __lexicographical_compare_3way()
D_string.h830 const size_type __len1 = (min) (__n1, __size1 - __pos1); in replace() local
832 if (__len2 > max_size() - (__size1 - __len1)) in replace()
834 return _M_replace(begin() + __pos1, begin() + __pos1 + __len1, in replace()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dalgorithm987 typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1;
988 if (__len1 < __len2)
1454 _D1 __len1 = __last1 - __first1;
1455 if (__len1 < __len2)
4351 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4360 if (__len1 <= __len2)
4387 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4399 for (; true; ++__first, --__len1)
4401 if (__len1 == 0)
4406 if (__len1 <= __buff_size || __len2 <= __buff_size)
[all …]