/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/ |
sso_string_base.h | 171 _M_set_length(size_type __n) 173 _M_length(__n); 174 traits_type::assign(_M_data()[__n], _CharT()); 189 __sso_string_base(size_type __n, _CharT __c, const _Alloc& __a); 220 _M_erase(size_type __pos, size_type __n); 316 std::__throw_length_error(__N("__sso_string_base::_M_create")); 372 __sso_string_base(size_type __n, _CharT __c, const _Alloc& __a) 374 { _M_construct(__n, __c); } 440 std::__throw_logic_error(__N("__sso_string_base::" 466 _M_construct(size_type __n, _CharT __c 475 this->_S_assign(_M_data(), __n, __c); local 568 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
random_shuffle.h | 259 * @param __n Length of sequence. 267 <_RAIter>::difference_type __n, 275 _GLIBCXX_CALL(__n) 279 if (__num_threads > __n) 280 __num_threads = static_cast<_ThreadIndex>(__n); 289 std::max<_DifferenceType>(1, __n / (__s.L1_cache_size_lb 295 __num_bins = std::min<_DifferenceType>(__n, __num_bins_cache); 309 (std::max<_DifferenceType>(1, __n / (__s.L2_cache_size 315 (std::min(__n, static_cast<_DifferenceType>(__num_bins_cache))); 364 _DifferenceType __chunk_length = __n / __num_threads 417 _DifferenceType __n = __end - __begin; local 527 _DifferenceType __n = __end - __begin; local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
random.h | 547 template<class _UIntType, int __w, int __n, int __m, int __r, 560 static const int state_size = __n; 996 if (!std::equal(__lhs._M_x[__i], __lhs._M_x[__i] + __n, 1065 static const int __n = (__w + 31) \/ 32; member in class:subtract_with_carry_01 [all...] |
/external/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...] |
/external/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...] |
/ndk/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...] |
/ndk/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...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/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...] |
/prebuilts/gcc/linux-x86/host/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...] |
/prebuilts/gcc/linux-x86/host/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...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
hashtable_policy.h | 399 _M_next_bkt(std::size_t __n) const; 403 _M_bkt_for_elements(std::size_t __n) const; 428 _M_next_bkt(std::size_t __n) const 431 + _S_n_primes, __n); 441 _M_bkt_for_elements(std::size_t __n) const 443 const float __min_bkts = __n / _M_max_load_factor; 542 std::size_t __n = __h->_M_bucket_index(__k, __code, local 546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 549 __n, __code)->second; 561 std::size_t __n = __h->_M_bucket_index(__k, __code local 581 std::size_t __n = __h->_M_bucket_index(__k, __code, local 599 std::size_t __n = __h->_M_bucket_index(__k, __code, local [all...] |
stl_algobase.h | 327 for(_Distance __n = __last - __first; __n > 0; --__n) 346 for(_Distance __n = __last - __first; __n > 0; --__n) 529 typename iterator_traits<_BI1>::difference_type __n; local 530 for (__n = __last - __first; __n > 0; --__n) 544 typename iterator_traits<_BI1>::difference_type __n; local [all...] |
stl_vector.h | 112 _Vector_base(size_t __n) 115 this->_M_impl._M_start = this->_M_allocate(__n); 117 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 120 _Vector_base(size_t __n, const allocator_type& __a) 123 this->_M_impl._M_start = this->_M_allocate(__n); 125 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 149 _M_allocate(size_t __n) 150 { return __n != 0 ? _M_impl.allocate(__n) : 0; } 153 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n) 1181 const size_type __n = std::distance(__first, __last); local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/ |
rc_string_base.h | 138 _M_set_length(size_type __n) 141 _M_info._M_length = __n; 144 traits_type::assign(_M_refdata()[__n], _CharT()); 307 _M_set_length(size_type __n) 308 { _M_rep()->_M_set_length(__n); } 323 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a); 354 _M_erase(size_type __pos, size_type __n); 378 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create")); 483 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a) 484 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { 700 _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
hashtable_policy.h | 392 _M_next_bkt(std::size_t __n) const; 396 _M_bkt_for_elements(std::size_t __n) const; 421 _M_next_bkt(std::size_t __n) const 424 + _S_n_primes, __n); 434 _M_bkt_for_elements(std::size_t __n) const 436 const float __min_bkts = __n / _M_max_load_factor; 524 std::size_t __n = __h->_M_bucket_index(__k, __code, local 528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 531 __n, __code)->second; 597 std::size_t __n) cons [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
hashtable_policy.h | 399 _M_next_bkt(std::size_t __n) const; 403 _M_bkt_for_elements(std::size_t __n) const; 428 _M_next_bkt(std::size_t __n) const 431 + _S_n_primes, __n); 441 _M_bkt_for_elements(std::size_t __n) const 443 const float __min_bkts = __n / _M_max_load_factor; 542 std::size_t __n = __h->_M_bucket_index(__k, __code, local 546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 549 __n, __code)->second; 561 std::size_t __n = __h->_M_bucket_index(__k, __code local 581 std::size_t __n = __h->_M_bucket_index(__k, __code, local 599 std::size_t __n = __h->_M_bucket_index(__k, __code, local [all...] |
stl_algobase.h | 327 for(_Distance __n = __last - __first; __n > 0; --__n) 346 for(_Distance __n = __last - __first; __n > 0; --__n) 529 typename iterator_traits<_BI1>::difference_type __n; local 530 for (__n = __last - __first; __n > 0; --__n) 544 typename iterator_traits<_BI1>::difference_type __n; local [all...] |
stl_vector.h | 112 _Vector_base(size_t __n) 115 this->_M_impl._M_start = this->_M_allocate(__n); 117 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 120 _Vector_base(size_t __n, const allocator_type& __a) 123 this->_M_impl._M_start = this->_M_allocate(__n); 125 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 149 _M_allocate(size_t __n) 150 { return __n != 0 ? _M_impl.allocate(__n) : 0; } 153 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n) 1181 const size_type __n = std::distance(__first, __last); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/ |
rc_string_base.h | 138 _M_set_length(size_type __n) 141 _M_info._M_length = __n; 144 traits_type::assign(_M_refdata()[__n], _CharT()); 307 _M_set_length(size_type __n) 308 { _M_rep()->_M_set_length(__n); } 323 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a); 354 _M_erase(size_type __pos, size_type __n); 378 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create")); 483 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a) 484 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { 700 _M_data() + __pos + __n, __how_much); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
hashtable_policy.h | 392 _M_next_bkt(std::size_t __n) const; 396 _M_bkt_for_elements(std::size_t __n) const; 421 _M_next_bkt(std::size_t __n) const 424 + _S_n_primes, __n); 434 _M_bkt_for_elements(std::size_t __n) const 436 const float __min_bkts = __n / _M_max_load_factor; 524 std::size_t __n = __h->_M_bucket_index(__k, __code, local 528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 531 __n, __code)->second; 597 std::size_t __n) cons [all...] |
/prebuilts/ndk/5/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...] |