/ndk/sources/cxx-stl/stlport/stlport/stl/ |
D | _slist.c | 74 const _Node_base* __n2 = __x._M_head._M_data._M_next; variable 75 while (__n1 && __n2) { 76 __STATIC_CAST(_Node*, __n1)->_M_data = __STATIC_CAST(const _Node*, __n2)->_M_data; 79 __n2 = __n2->_M_next; 81 if (__n2 == 0) 84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
|
D | _string_sum.h | 170 …g& replace(size_type __pos1, size_type __n1, const _BString& __s, size_type __pos2, size_type __n2) in replace() argument 171 {return _M_get_storage().replace(__pos1, __n1, __s, __pos2, __n2);} in replace() 172 _BString& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) in replace() argument 173 {return _M_get_storage().replace(__pos, __n1, __s, __n2);} in replace() 176 _BString& replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) in replace() argument 177 {return _M_get_storage().replace(__pos, __n1, __n2, __c);} in replace() 243 …int compare(size_type __pos1, size_type __n1, const _Self& __s, size_type __pos2, size_type __n2) … in compare() argument 244 { return _M_get_storage().compare(__pos1, __n1, __s, __pos2, __n2); } in compare() 249 int compare(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) const in compare() argument 250 { return _M_get_storage().compare(__pos1, __n1, __s, __n2); } in compare()
|
D | _string.h | 825 size_type __pos2, size_type __n2) { in replace() argument 831 const size_type __len2 = (min) (__n2, __size2 - __pos2); in replace() 839 const _CharT* __s, size_type __n2) { in replace() argument 845 if (__n2 > max_size() - (__size - __len)) in replace() 848 __s, __s + __n2, _M_inside(__s)); in replace() 857 size_type __n2, _CharT __c) { in replace() argument 862 if (__n2 > max_size() - (__size - __len)) in replace() 864 return replace(begin() + __pos, begin() + __pos + __len, __n2, __c); in replace() 1038 size_type __pos2, size_type __n2) const { in compare() argument 1044 __s._M_Start() + __pos2 + (min) (__n2, __s.size() - __pos2)); in compare() [all …]
|
D | _string_workaround.h | 478 size_type __pos2, size_type __n2) { in replace() argument 479 _Base::replace(__pos1, __n1, __s, __pos2, __n2); in replace() 484 const _CharT* __s, size_type __n2) { in replace() argument 486 _Base::replace(__pos, __n1, __s, __n2); in replace() 497 size_type __n2, _CharT __c) { in replace() argument 498 _Base::replace(__pos, __n1, __n2, __c); in replace()
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
D | _string.h | 523 size_type __pos2, size_type __n2) { in replace() argument 525 _M_non_dbg_impl.replace(__pos1, __n1, __s._M_non_dbg_impl, __pos2, __n2); in replace() 530 _Self& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) { in replace() argument 534 _M_non_dbg_impl.replace(__pos, __n1, __s, __n2); in replace() 548 _Self& replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) { in replace() argument 550 _M_non_dbg_impl.replace(__pos, __n1, __n2, __c); in replace() 656 size_type __pos2, size_type __n2) const in compare() argument 657 { return _M_non_dbg_impl.compare(__pos1, __n1, __s._M_non_dbg_impl, __pos2, __n2); } in compare() 667 size_type __n2) const { in compare() argument 669 return _M_non_dbg_impl.compare(__pos1, __n1, __s, __n2); in compare()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
D | string | 1611 …ize_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2=npos); 1612 basic_string& replace(size_type __pos, size_type __n1, const value_type* __s, size_type __n2); 1614 basic_string& replace(size_type __pos, size_type __n1, size_type __n2, value_type __c); 1703 …pe __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2=npos) const; 1706 int compare(size_type __pos1, size_type __n1, const value_type* __s, size_type __n2) const; 2927 …raits, _Allocator>::replace(size_type __pos, size_type __n1, const value_type* __s, size_type __n2) 2929 _LIBCPP_ASSERT(__n2 == 0 || __s != nullptr, "string::replace received nullptr"); 2935 if (__cap - __sz + __n1 >= __n2) 2938 if (__n1 != __n2) 2943 if (__n1 > __n2) [all …]
|
D | chrono | 421 static const intmax_t __n2 = _R2::num / __gcd_n1_n2; 438 static const bool value = (__n1 <= max / __d2) && (__n2 <= max / __d1); 440 __mul<__n2, __d1, !value>::value> type;
|
D | list | 2197 size_type __n2 = __n / 2; 2198 iterator __e1 = _VSTD::next(__f1, __n2); 2199 iterator __r = __f1 = __sort(__f1, __e1, __n2, __comp); 2200 iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
|