/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
rc_string_base.h | 136 _M_set_length(size_type __n) 139 _M_info._M_length = __n; 142 traits_type::assign(_M_refdata()[__n], _CharT()); 293 _M_set_length(size_type __n) 294 { _M_rep()->_M_set_length(__n); } 309 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a); 340 _M_erase(size_type __pos, size_type __n); 364 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create")); 469 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a) 470 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { 686 _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
hashtable_policy.h | 426 _M_next_bkt(std::size_t __n) const; 430 _M_bkt_for_elements(std::size_t __n) const; 455 _M_next_bkt(std::size_t __n) const 458 + _S_n_primes, __n); 468 _M_bkt_for_elements(std::size_t __n) const 470 const float __min_bkts = __n / _M_max_load_factor; 568 std::size_t __n = __h->_M_bucket_index(__k, __code, local 572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 575 __n, __code)->second; 588 std::size_t __n = __h->_M_bucket_index(__k, __code local 606 std::size_t __n = __h->_M_bucket_index(__k, __code, local [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_vector.h | 110 _Vector_base(size_t __n, const allocator_type& __a) 113 this->_M_impl._M_start = this->_M_allocate(__n); 115 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 139 _M_allocate(size_t __n) 140 { return __n != 0 ? _M_impl.allocate(__n) : 0; } 143 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n) 146 _M_impl.deallocate(__p, __n); 227 vector(size_type __n, const value_type& __value = value_type(), 229 : _Base(__n, __a 1037 const size_type __n = std::distance(__first, __last); local [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/ |
rc_string_base.h | 136 _M_set_length(size_type __n) 139 _M_info._M_length = __n; 142 traits_type::assign(_M_refdata()[__n], _CharT()); 293 _M_set_length(size_type __n) 294 { _M_rep()->_M_set_length(__n); } 309 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a); 340 _M_erase(size_type __pos, size_type __n); 364 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create")); 469 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a) 470 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { 686 _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
hashtable_policy.h | 426 _M_next_bkt(std::size_t __n) const; 430 _M_bkt_for_elements(std::size_t __n) const; 455 _M_next_bkt(std::size_t __n) const 458 + _S_n_primes, __n); 468 _M_bkt_for_elements(std::size_t __n) const 470 const float __min_bkts = __n / _M_max_load_factor; 568 std::size_t __n = __h->_M_bucket_index(__k, __code, local 572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 575 __n, __code)->second; 588 std::size_t __n = __h->_M_bucket_index(__k, __code local 606 std::size_t __n = __h->_M_bucket_index(__k, __code, local [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
_fstream.h | 68 ptrdiff_t _M_read(char* __buf, ptrdiff_t __n); 71 bool _M_write(char* __buf, ptrdiff_t __n); 234 bool _M_allocate_buffers(_CharT* __buf, streamsize __n); 322 bool _M_write(char* __buf, ptrdiff_t __n) {return _M_base._M_write(__buf, __n); } 359 ptrdiff_t __n = __last - __first; local 360 return (__buf->_M_write(__first, __n));
|
_string.c | 162 size_type __n = (max)(__res_arg, size()) + 1; local 163 if (__n < this->_M_capacity()) 166 _M_reserve(__n); 170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { 171 pointer __new_start = this->_M_start_of_storage.allocate(__n, __n); 175 this->_M_reset(__new_start, __new_finish, __new_start + __n); 180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { 181 if (__n > 0) { 182 if (__n > max_size() - size() 198 size_type __n = __STATIC_CAST(size_type, __last - __first); local 243 ptrdiff_t __n = __l - __f; local 319 const size_t __n = __last - __first; local 392 const ptrdiff_t __n = __l - __f; local [all...] |
_string_sum.h | 33 const_reference operator[] (size_t __n) const { 34 //To avoid a check on __n we use this strange implementation 35 return (&_Val)[__n]; 54 const_reference operator[] (size_t __n) const { return _CStr[__n]; } 72 const_reference operator[] (size_t __n) const { return _BStr[__n]; } 116 const_reference operator[](size_t __n) const 117 { return (__n < _lhs.size())?_lhs[__n]:_rhs[__n - _lhs.size()]; 138 const size_type __n = _Traits::length(__s); local [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_deque.h | 139 reference operator[](size_type __n) 140 { return cast_traits::to_value_type_ref(_M_impl[__n]); } 141 const_reference operator[](size_type __n) const 142 { return cast_traits::to_value_type_cref(_M_impl[__n]); } 144 reference at(size_type __n) 145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } 146 const_reference at(size_type __n) const 147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); } 165 explicit deque(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 167 deque(size_type __n, const value_type& __val 301 { _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, cast_traits::to_storage_type_cref(__x)); } local 309 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, __val); local [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_vector.h | 110 _Vector_base(size_t __n, const allocator_type& __a) 113 this->_M_impl._M_start = this->_M_allocate(__n); 115 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 139 _M_allocate(size_t __n) 140 { return __n != 0 ? _M_impl.allocate(__n) : 0; } 143 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n) 146 _M_impl.deallocate(__p, __n); 227 vector(size_type __n, const value_type& __value = value_type(), 229 : _Base(__n, __a 1037 const size_type __n = std::distance(__first, __last); local [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
rc_string_base.h | 136 _M_set_length(size_type __n) 139 _M_info._M_length = __n; 142 traits_type::assign(_M_refdata()[__n], _CharT()); 293 _M_set_length(size_type __n) 294 { _M_rep()->_M_set_length(__n); } 309 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a); 340 _M_erase(size_type __pos, size_type __n); 364 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create")); 469 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a) 470 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { 686 _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
hashtable_policy.h | 426 _M_next_bkt(std::size_t __n) const; 430 _M_bkt_for_elements(std::size_t __n) const; 455 _M_next_bkt(std::size_t __n) const 458 + _S_n_primes, __n); 468 _M_bkt_for_elements(std::size_t __n) const 470 const float __min_bkts = __n / _M_max_load_factor; 568 std::size_t __n = __h->_M_bucket_index(__k, __code, local 572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 575 __n, __code)->second; 588 std::size_t __n = __h->_M_bucket_index(__k, __code local 606 std::size_t __n = __h->_M_bucket_index(__k, __code, local [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
_fstream.h | 68 ptrdiff_t _M_read(char* __buf, ptrdiff_t __n); 71 bool _M_write(char* __buf, ptrdiff_t __n); 234 bool _M_allocate_buffers(_CharT* __buf, streamsize __n); 322 bool _M_write(char* __buf, ptrdiff_t __n) {return _M_base._M_write(__buf, __n); } 359 ptrdiff_t __n = __last - __first; local 360 return (__buf->_M_write(__first, __n));
|
_string.c | 162 size_type __n = (max)(__res_arg, size()) + 1; local 163 if (__n < this->_M_capacity()) 166 _M_reserve(__n); 170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { 171 pointer __new_start = this->_M_start_of_storage.allocate(__n, __n); 175 this->_M_reset(__new_start, __new_finish, __new_start + __n); 180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { 181 if (__n > 0) { 182 if (__n > max_size() - size() 198 size_type __n = __STATIC_CAST(size_type, __last - __first); local 243 ptrdiff_t __n = __l - __f; local 319 const size_t __n = __last - __first; local 392 const ptrdiff_t __n = __l - __f; local [all...] |
_string_sum.h | 33 const_reference operator[] (size_t __n) const { 34 //To avoid a check on __n we use this strange implementation 35 return (&_Val)[__n]; 54 const_reference operator[] (size_t __n) const { return _CStr[__n]; } 72 const_reference operator[] (size_t __n) const { return _BStr[__n]; } 116 const_reference operator[](size_t __n) const 117 { return (__n < _lhs.size())?_lhs[__n]:_rhs[__n - _lhs.size()]; 138 const size_type __n = _Traits::length(__s); local [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_deque.h | 139 reference operator[](size_type __n) 140 { return cast_traits::to_value_type_ref(_M_impl[__n]); } 141 const_reference operator[](size_type __n) const 142 { return cast_traits::to_value_type_cref(_M_impl[__n]); } 144 reference at(size_type __n) 145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } 146 const_reference at(size_type __n) const 147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); } 165 explicit deque(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 167 deque(size_type __n, const value_type& __val 301 { _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, cast_traits::to_storage_type_cref(__x)); } local 309 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, __val); local [all...] |
/external/stlport/stlport/stl/ |
_hashtable.h | 303 hashtable(size_type __n, 308 hashtable(size_type __n, 317 { _M_initialize_buckets(__n); } 319 hashtable(size_type __n, 330 { _M_initialize_buckets(__n); } 378 local_iterator begin(size_type __n) { return _ElemsIte(_M_buckets[__n]); } 379 local_iterator end(size_type __n) { return _ElemsIte(_M_buckets[__n + 1]); } 383 const_local_iterator begin(size_type __n) const { return _ElemsIte(_M_buckets[__n]); 449 size_type __n = _STLP_STD::distance(__f, __l); local 458 size_type __n = _STLP_STD::distance(__f, __l); local 466 size_type __n = __l - __f; local 473 size_type __n = __l - __f; local 480 size_type __n = _STLP_STD::distance(__f, __l); local 487 size_type __n = _STLP_STD::distance(__f, __l); local 499 size_type __n = _M_bkt_num_key(__key); local 517 const size_type __n = _M_bkt_num_key(__key); local 536 const size_type __n = _M_bkt_num_key(__key); local 552 const size_type __n = _M_bkt_num_key(__key); local [all...] |
_list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 309 explicit list(size_type __n) 311 { this->insert(begin(), __n, _STLP_DEFAULT_CONSTRUCTED(value_type)); } 312 list(size_type __n, const_reference __val) 314 { this->insert(begin(), __n, __val); } 315 list(size_type __n, const_reference __val, const allocator_type& __a) 318 { this->insert(begin(), __n, __val); } local 426 _Node_base* __n = __pos._M_node; local 427 _Node_base* __p = __n->_M_prev; 428 __tmp->_M_next = __n; 521 _Node* __n = __STATIC_CAST(_Node*, __pos._M_node); local [all...] |
_slist.h | 289 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp), 292 explicit slist(size_type __n) 294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } 295 slist(size_type __n, const value_type& __x) 297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); } 298 slist(size_type __n, const value_type& __x, const allocator_type& __a) 301 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); } 348 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } 351 void _M_fill_assign(size_type __n, const _Tp& __val) 574 __n, __x); local 651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local [all...] |
_string.h | 169 basic_string(_Reserve_t, size_t __n, 172 basic_string(_Reserve_t, size_t __n) 173 : _STLP_PRIV _String_base<_CharT,_Alloc>(allocator_type(), __n + 1) 175 basic_string(_Reserve_t, size_t __n, const allocator_type& __a) 177 : _STLP_PRIV _String_base<_CharT,_Alloc>(__a, __n + 1) 183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, 193 basic_string(const _Self& __s, size_type __pos, size_type __n) 199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); 201 basic_string(const _Self& __s, size_type __pos, size_type __n, 209 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)) 323 difference_type __n = _STLP_STD::distance(__f, __l); local 378 ptrdiff_t __n = __l - __f; local 471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local 634 _M_insert(begin() + __pos, __s, __s + __n, _M_inside(__s)); local 714 size_type __n = _STLP_STD::distance(__first, __last); local [all...] |
_tree.h | 504 size_type __n = _STLP_STD::distance(__p.first, __p.second); local 506 return __n;
|
_vector.h | 69 _Vector_base(size_t __n, const _Alloc& __a) 71 _M_start = _M_end_of_storage.allocate(__n, __n); 73 _M_end_of_storage._M_data = _M_start + __n; 166 void _M_range_check(size_type __n) const { 167 if (__n >= size_type(this->_M_finish - this->_M_start)) 171 size_type _M_compute_next_size(size_type __n) { 173 if (__n > max_size() - __size) 175 size_type __len = __size + (max)(__n, __size); 202 reference operator[](size_type __n) { return *(begin() + __n); 327 size_type __n = __len; local 547 size_type __n = _STLP_STD::distance(__first, __last); local 701 size_type __n = _STLP_STD::distance(__first, __last); local [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_hashtable.h | 303 hashtable(size_type __n, 308 hashtable(size_type __n, 317 { _M_initialize_buckets(__n); } 319 hashtable(size_type __n, 330 { _M_initialize_buckets(__n); } 378 local_iterator begin(size_type __n) { return _ElemsIte(_M_buckets[__n]); } 379 local_iterator end(size_type __n) { return _ElemsIte(_M_buckets[__n + 1]); } 383 const_local_iterator begin(size_type __n) const { return _ElemsIte(_M_buckets[__n]); 449 size_type __n = _STLP_STD::distance(__f, __l); local 458 size_type __n = _STLP_STD::distance(__f, __l); local 466 size_type __n = __l - __f; local 473 size_type __n = __l - __f; local 480 size_type __n = _STLP_STD::distance(__f, __l); local 487 size_type __n = _STLP_STD::distance(__f, __l); local 499 size_type __n = _M_bkt_num_key(__key); local 517 const size_type __n = _M_bkt_num_key(__key); local 536 const size_type __n = _M_bkt_num_key(__key); local 552 const size_type __n = _M_bkt_num_key(__key); local [all...] |
_list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 309 explicit list(size_type __n) 311 { this->insert(begin(), __n, _STLP_DEFAULT_CONSTRUCTED(value_type)); } 312 list(size_type __n, const_reference __val) 314 { this->insert(begin(), __n, __val); } 315 list(size_type __n, const_reference __val, const allocator_type& __a) 318 { this->insert(begin(), __n, __val); } local 426 _Node_base* __n = __pos._M_node; local 427 _Node_base* __p = __n->_M_prev; 428 __tmp->_M_next = __n; 521 _Node* __n = __STATIC_CAST(_Node*, __pos._M_node); local [all...] |
_slist.h | 289 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp), 292 explicit slist(size_type __n) 294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } 295 slist(size_type __n, const value_type& __x) 297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); } 298 slist(size_type __n, const value_type& __x, const allocator_type& __a) 301 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); } 348 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } 351 void _M_fill_assign(size_type __n, const _Tp& __val) 574 __n, __x); local 651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local [all...] |