| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/experimental/bits/ |
| H A D | string_view.tcc | 52 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find() argument 57 return __pos <= this->_M_len ? __pos : npos; in find() 61 for (; __pos <= this->_M_len - __n; ++__pos) in find() 62 if (traits_type::eq(this->_M_str[__pos], __str[0]) in find() 63 && traits_type::compare(this->_M_str + __pos + 1, in find() 65 return __pos; in find() 73 find(_CharT __c, size_type __pos) const noexcept in find() 76 if (__pos < this->_M_len) in find() 78 const size_type __n = this->_M_len - __pos; in find() 79 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/experimental/bits/ |
| H A D | string_view.tcc | 52 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find() argument 57 return __pos <= this->_M_len ? __pos : npos; in find() 61 for (; __pos <= this->_M_len - __n; ++__pos) in find() 62 if (traits_type::eq(this->_M_str[__pos], __str[0]) in find() 63 && traits_type::compare(this->_M_str + __pos + 1, in find() 65 return __pos; in find() 73 find(_CharT __c, size_type __pos) const noexcept in find() 76 if (__pos < this->_M_len) in find() 78 const size_type __n = this->_M_len - __pos; in find() 79 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/ |
| H A D | string_view.tcc | 48 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find() argument 53 return __pos <= this->_M_len ? __pos : npos; in find() 57 for (; __pos <= this->_M_len - __n; ++__pos) in find() 58 if (traits_type::eq(this->_M_str[__pos], __str[0]) in find() 59 && traits_type::compare(this->_M_str + __pos + 1, in find() 61 return __pos; in find() 69 find(_CharT __c, size_type __pos) const noexcept in find() 72 if (__pos < this->_M_len) in find() 74 const size_type __n = this->_M_len - __pos; in find() 75 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find() [all …]
|
| H A D | basic_string.tcc | 311 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, in _M_mutate() argument 314 const size_type __how_much = length() - __pos - __len1; in _M_mutate() 319 if (__pos) in _M_mutate() 320 this->_S_copy(__r, _M_data(), __pos); in _M_mutate() 322 this->_S_copy(__r + __pos, __s, __len2); in _M_mutate() 324 this->_S_copy(__r + __pos + __len2, in _M_mutate() 325 _M_data() + __pos + __len1, __how_much); in _M_mutate() 335 _M_erase(size_type __pos, size_type __n) in _M_erase() argument 337 const size_type __how_much = length() - __pos - __n; in _M_erase() 340 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much); in _M_erase() [all …]
|
| H A D | basic_string.h | 318 _M_check(size_type __pos, const char* __s) const in _GLIBCXX_VISIBILITY() 320 if (__pos > this->size()) in _GLIBCXX_VISIBILITY() 323 __s, __pos, this->size()); in _GLIBCXX_VISIBILITY() 324 return __pos; in _GLIBCXX_VISIBILITY() 337 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY() 339 const bool __testoff = __off < this->size() - __pos; in _GLIBCXX_VISIBILITY() 340 return __testoff ? __off : this->size() - __pos; in _GLIBCXX_VISIBILITY() 425 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, in _GLIBCXX_VISIBILITY() 429 _M_erase(size_type __pos, size_type __n); in _GLIBCXX_VISIBILITY() 469 basic_string(const basic_string& __str, size_type __pos, in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | forward_list.tcc | 51 _M_insert_after(const_iterator __pos, _Args&&... __args) in _M_insert_after() argument 54 = const_cast<_Fwd_list_node_base*>(__pos._M_node); in _M_insert_after() 64 _M_erase_after(_Fwd_list_node_base* __pos) in _M_erase_after() argument 66 _Node* __curr = static_cast<_Node*>(__pos->_M_next); in _M_erase_after() 67 __pos->_M_next = __curr->_M_next; in _M_erase_after() 72 return __pos->_M_next; in _M_erase_after() 78 _M_erase_after(_Fwd_list_node_base* __pos, in _M_erase_after() argument 81 _Node* __curr = static_cast<_Node*>(__pos->_M_next); in _M_erase_after() 91 __pos->_M_next = __last; in _M_erase_after() 164 _M_default_insert_after(const_iterator __pos, size_type __n) in _M_default_insert_after() argument [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/ |
| H A D | string_view.tcc | 48 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find() argument 53 return __pos <= this->_M_len ? __pos : npos; in find() 57 for (; __pos <= this->_M_len - __n; ++__pos) in find() 58 if (traits_type::eq(this->_M_str[__pos], __str[0]) in find() 59 && traits_type::compare(this->_M_str + __pos + 1, in find() 61 return __pos; in find() 69 find(_CharT __c, size_type __pos) const noexcept in find() 72 if (__pos < this->_M_len) in find() 74 const size_type __n = this->_M_len - __pos; in find() 75 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find() [all …]
|
| H A D | basic_string.tcc | 311 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, in _M_mutate() argument 314 const size_type __how_much = length() - __pos - __len1; in _M_mutate() 319 if (__pos) in _M_mutate() 320 this->_S_copy(__r, _M_data(), __pos); in _M_mutate() 322 this->_S_copy(__r + __pos, __s, __len2); in _M_mutate() 324 this->_S_copy(__r + __pos + __len2, in _M_mutate() 325 _M_data() + __pos + __len1, __how_much); in _M_mutate() 335 _M_erase(size_type __pos, size_type __n) in _M_erase() argument 337 const size_type __how_much = length() - __pos - __n; in _M_erase() 340 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much); in _M_erase() [all …]
|
| H A D | basic_string.h | 318 _M_check(size_type __pos, const char* __s) const in _GLIBCXX_VISIBILITY() 320 if (__pos > this->size()) in _GLIBCXX_VISIBILITY() 323 __s, __pos, this->size()); in _GLIBCXX_VISIBILITY() 324 return __pos; in _GLIBCXX_VISIBILITY() 337 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY() 339 const bool __testoff = __off < this->size() - __pos; in _GLIBCXX_VISIBILITY() 340 return __testoff ? __off : this->size() - __pos; in _GLIBCXX_VISIBILITY() 425 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, in _GLIBCXX_VISIBILITY() 429 _M_erase(size_type __pos, size_type __n); in _GLIBCXX_VISIBILITY() 469 basic_string(const basic_string& __str, size_type __pos, in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | forward_list.tcc | 51 _M_insert_after(const_iterator __pos, _Args&&... __args) in _M_insert_after() argument 54 = const_cast<_Fwd_list_node_base*>(__pos._M_node); in _M_insert_after() 64 _M_erase_after(_Fwd_list_node_base* __pos) in _M_erase_after() argument 66 _Node* __curr = static_cast<_Node*>(__pos->_M_next); in _M_erase_after() 67 __pos->_M_next = __curr->_M_next; in _M_erase_after() 72 return __pos->_M_next; in _M_erase_after() 78 _M_erase_after(_Fwd_list_node_base* __pos, in _M_erase_after() argument 81 _Node* __curr = static_cast<_Node*>(__pos->_M_next); in _M_erase_after() 91 __pos->_M_next = __last; in _M_erase_after() 164 _M_default_insert_after(const_iterator __pos, size_type __n) in _M_default_insert_after() argument [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/parallel/ |
| H A D | losertree.h | 136 unsigned int __pos = _M_k + __source; in __insert_start() local 146 _M_losers[__pos]._M_key = __key; in __insert_start() 148 _M_losers[__pos]._M_sup = __sup; in __insert_start() 149 _M_losers[__pos]._M_source = __source; in __insert_start() 231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0; in __delete_min_insert() local 232 __pos /= 2) in __delete_min_insert() 235 if ((__sup && (!_M_losers[__pos]._M_sup in __delete_min_insert() 236 || _M_losers[__pos]._M_source < __source)) in __delete_min_insert() 237 || (!__sup && !_M_losers[__pos]._M_sup in __delete_min_insert() 238 && ((_M_comp(_M_losers[__pos]._M_key, __key)) in __delete_min_insert() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/parallel/ |
| H A D | losertree.h | 136 unsigned int __pos = _M_k + __source; in __insert_start() local 146 _M_losers[__pos]._M_key = __key; in __insert_start() 148 _M_losers[__pos]._M_sup = __sup; in __insert_start() 149 _M_losers[__pos]._M_source = __source; in __insert_start() 231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0; in __delete_min_insert() local 232 __pos /= 2) in __delete_min_insert() 235 if ((__sup && (!_M_losers[__pos]._M_sup in __delete_min_insert() 236 || _M_losers[__pos]._M_source < __source)) in __delete_min_insert() 237 || (!__sup && !_M_losers[__pos]._M_sup in __delete_min_insert() 238 && ((_M_comp(_M_losers[__pos]._M_key, __key)) in __delete_min_insert() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/ |
| H A D | vstring.tcc | 128 _M_replace(size_type __pos, size_type __len1, const _CharT* __s, in _M_replace() argument 138 _CharT* __p = this->_M_data() + __pos; in _M_replace() 140 const size_type __how_much = __old_size - __pos - __len1; in _M_replace() 172 this->_M_mutate(__pos, __len1, __s, __len2); in _M_replace() 255 copy(_CharT* __s, size_type __n, size_type __pos) const in copy() 257 _M_check(__pos, "__versa_string::copy"); in copy() 258 __n = _M_limit(__pos, __n); in copy() 261 this->_S_copy(__s, this->_M_data() + __pos, __n); in copy() 270 find(const _CharT* __s, size_type __pos, size_type __n) const in find() argument 277 return __pos <= __size ? __pos : npos; in find() [all …]
|
| H A D | vstring.h | 86 _M_check(size_type __pos, const char* __s) const in _GLIBCXX_VISIBILITY() 88 if (__pos > this->size()) in _GLIBCXX_VISIBILITY() 91 __s, __pos, this->size()); in _GLIBCXX_VISIBILITY() 92 return __pos; in _GLIBCXX_VISIBILITY() 104 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY() 106 const bool __testoff = __off < this->size() - __pos; in _GLIBCXX_VISIBILITY() 107 return __testoff ? __off : this->size() - __pos; in _GLIBCXX_VISIBILITY() 177 __versa_string(const __versa_string& __str, size_type __pos, in _GLIBCXX_VISIBILITY() 180 + __str._M_check(__pos, in _GLIBCXX_VISIBILITY() 182 __str._M_data() + __str._M_limit(__pos, __n) in _GLIBCXX_VISIBILITY() [all …]
|
| H A D | slist | 91 __slist_splice_after(_Slist_node_base* __pos, 95 if (__pos != __before_first && __pos != __before_last) 98 _Slist_node_base* __after = __pos->_M_next; 100 __pos->_M_next = __first; 106 __slist_splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) 111 _Slist_node_base* __after = __pos->_M_next; 112 __pos->_M_next = __head->_M_next; 250 _Slist_node_base* _M_erase_after(_Slist_node_base* __pos) 252 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next); 254 __pos->_M_next = __next_next; [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/ |
| H A D | vstring.tcc | 128 _M_replace(size_type __pos, size_type __len1, const _CharT* __s, in _M_replace() argument 138 _CharT* __p = this->_M_data() + __pos; in _M_replace() 140 const size_type __how_much = __old_size - __pos - __len1; in _M_replace() 172 this->_M_mutate(__pos, __len1, __s, __len2); in _M_replace() 255 copy(_CharT* __s, size_type __n, size_type __pos) const in copy() 257 _M_check(__pos, "__versa_string::copy"); in copy() 258 __n = _M_limit(__pos, __n); in copy() 261 this->_S_copy(__s, this->_M_data() + __pos, __n); in copy() 270 find(const _CharT* __s, size_type __pos, size_type __n) const in find() argument 277 return __pos <= __size ? __pos : npos; in find() [all …]
|
| H A D | vstring.h | 86 _M_check(size_type __pos, const char* __s) const in _GLIBCXX_VISIBILITY() 88 if (__pos > this->size()) in _GLIBCXX_VISIBILITY() 91 __s, __pos, this->size()); in _GLIBCXX_VISIBILITY() 92 return __pos; in _GLIBCXX_VISIBILITY() 104 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY() 106 const bool __testoff = __off < this->size() - __pos; in _GLIBCXX_VISIBILITY() 107 return __testoff ? __off : this->size() - __pos; in _GLIBCXX_VISIBILITY() 177 __versa_string(const __versa_string& __str, size_type __pos, in _GLIBCXX_VISIBILITY() 180 + __str._M_check(__pos, in _GLIBCXX_VISIBILITY() 182 __str._M_data() + __str._M_limit(__pos, __n) in _GLIBCXX_VISIBILITY() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ |
| H A D | string_view | 58 __sv_check(size_t __size, size_t __pos, const char* __s) 60 if (__pos > __size) 61 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > __size " 62 "(which is %zu)"), __s, __pos, __size); 63 return __pos; 67 // NB: __sv_limit doesn't check for a bad __pos value. 69 __sv_limit(size_t __size, size_t __pos, size_t __off) noexcept 71 const bool __testoff = __off < __size - __pos; 72 return __testoff ? __off : __size - __pos; 208 operator[](size_type __pos) const noexcept [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ |
| H A D | string_view | 58 __sv_check(size_t __size, size_t __pos, const char* __s) 60 if (__pos > __size) 61 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > __size " 62 "(which is %zu)"), __s, __pos, __size); 63 return __pos; 67 // NB: __sv_limit doesn't check for a bad __pos value. 69 __sv_limit(size_t __size, size_t __pos, size_t __off) noexcept 71 const bool __testoff = __off < __size - __pos; 72 return __testoff ? __off : __size - __pos; 208 operator[](size_type __pos) const noexcept [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/experimental/ |
| H A D | string_view | 180 operator[](size_type __pos) const 182 __glibcxx_assert(__pos < this->_M_len); 183 return *(this->_M_str + __pos); 187 at(size_type __pos) const 189 return __pos < this->_M_len 190 ? *(this->_M_str + __pos) 191 : (__throw_out_of_range_fmt(__N("basic_string_view::at: __pos " 194 __pos, this->size()), 255 copy(_CharT* __str, size_type __n, size_type __pos = 0) const 258 if (__pos > this->_M_len) [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/experimental/ |
| H A D | string_view | 180 operator[](size_type __pos) const 182 __glibcxx_assert(__pos < this->_M_len); 183 return *(this->_M_str + __pos); 187 at(size_type __pos) const 189 return __pos < this->_M_len 190 ? *(this->_M_str + __pos) 191 : (__throw_out_of_range_fmt(__N("basic_string_view::at: __pos " 194 __pos, this->size()), 255 copy(_CharT* __str, size_type __n, size_type __pos = 0) const 258 if (__pos > this->_M_len) [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/debug/ |
| H A D | string | 170 basic_string(const basic_string& __str, size_type __pos, 173 : _Base(__str, __pos, __n, __a) { } 335 operator[](size_type __pos) const _GLIBCXX_NOEXCEPT 337 _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), 340 ._M_integer(__pos, "__pos") 342 return _M_base()[__pos]; 346 operator[](size_type __pos) // _GLIBCXX_NOEXCEPT 349 __glibcxx_check_subscript(__pos); 352 _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), 355 ._M_integer(__pos, "__pos") [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/debug/ |
| H A D | string | 170 basic_string(const basic_string& __str, size_type __pos, 173 : _Base(__str, __pos, __n, __a) { } 335 operator[](size_type __pos) const _GLIBCXX_NOEXCEPT 337 _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), 340 ._M_integer(__pos, "__pos") 342 return _M_base()[__pos]; 346 operator[](size_type __pos) // _GLIBCXX_NOEXCEPT 349 __glibcxx_check_subscript(__pos); 352 _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), 355 ._M_integer(__pos, "__pos") [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/tr2/ |
| H A D | dynamic_bitset | 142 _S_whichword(size_type __pos) noexcept 143 { return __pos / _S_bits_per_block; } 146 _S_whichbyte(size_type __pos) noexcept 147 { return (__pos % _S_bits_per_block) / __CHAR_BIT__; } 150 _S_whichbit(size_type __pos) noexcept 151 { return __pos % _S_bits_per_block; } 154 _S_maskbit(size_type __pos) noexcept 155 { return (static_cast<block_type>(1)) << _S_whichbit(__pos); } 158 _M_getword(size_type __pos) noexcept 159 { return this->_M_w[_S_whichword(__pos)]; } [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/tr2/ |
| H A D | dynamic_bitset | 142 _S_whichword(size_type __pos) noexcept 143 { return __pos / _S_bits_per_block; } 146 _S_whichbyte(size_type __pos) noexcept 147 { return (__pos % _S_bits_per_block) / __CHAR_BIT__; } 150 _S_whichbit(size_type __pos) noexcept 151 { return __pos % _S_bits_per_block; } 154 _S_maskbit(size_type __pos) noexcept 155 { return (static_cast<block_type>(1)) << _S_whichbit(__pos); } 158 _M_getword(size_type __pos) noexcept 159 { return this->_M_w[_S_whichword(__pos)]; } [all …]
|