| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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...] |
| vstring.h | 89 std::__throw_out_of_range(__N(__s));
97 std::__throw_length_error(__N(__s));
179 * @param __n Number of characters to copy (default remainder).
182 size_type __n = npos)
186 __str._M_data() + __str._M_limit(__pos, __n)
193 * @param __n Number of characters to copy.
197 size_type __n, const _Alloc& __a)
201 __str._M_data() + __str._M_limit(__pos, __n)
207 * @param __n Number of characters to copy.
210 * NB: @a __s must have at least @a __n characters, '\\0' has no specia
729 const size_type __n = traits_type::length(__s); local
2629 const int __n = __numeric_traits<float>::__max_exponent10 + 20; local
2637 const int __n = __numeric_traits<double>::__max_exponent10 + 20; local
2645 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
2730 const int __n = __numeric_traits<float>::__max_exponent10 + 20; local
2738 const int __n = __numeric_traits<double>::__max_exponent10 + 20; local
2746 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_algobase.h | 333 for(_Distance __n = __last - __first; __n > 0; --__n)
352 for(_Distance __n = __last - __first; __n > 0; --__n)
535 typename iterator_traits<_BI1>::difference_type __n; local
536 for (__n = __last - __first; __n > 0; --__n)
550 typename iterator_traits<_BI1>::difference_type __n; local
[all...] |
| stl_vector.h | 130 _Vector_base(size_t __n)
132 { _M_create_storage(__n); }
134 _Vector_base(size_t __n, const allocator_type& __a)
136 { _M_create_storage(__n); }
153 size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start; local
154 _M_create_storage(__n);
167 _M_allocate(size_t __n)
168 { return __n != 0 ? _M_impl.allocate(__n) : 0; }
171 _M_deallocate(pointer __p, size_t __n)
1196 const size_type __n = std::distance(__first, __last); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/ |
| rc_string_base.h | 137 _M_set_length(size_type __n)
140 _M_info._M_length = __n;
143 traits_type::assign(_M_refdata()[__n], _CharT());
306 _M_set_length(size_type __n)
307 { _M_rep()->_M_set_length(__n); }
322 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a);
353 _M_erase(size_type __pos, size_type __n);
377 std::__throw_length_error(__N("__rc_string_base::_Rep::_S_create"));
482 __rc_string_base(size_type __n, _CharT __c, const _Alloc& __a)
483 : _M_dataplus(__a, _S_construct(__n, __c, __a)) {
699 _M_data() + __pos + __n, __how_much); local
[all...] |
| vstring.h | 88 std::__throw_out_of_range(__N(__s));
96 std::__throw_length_error(__N(__s));
178 * @param __n Number of characters to copy (default remainder).
181 size_type __n = npos)
185 __str._M_data() + __str._M_limit(__pos, __n)
192 * @param __n Number of characters to copy.
196 size_type __n, const _Alloc& __a)
200 __str._M_data() + __str._M_limit(__pos, __n)
206 * @param __n Number of characters to copy.
209 * NB: @a __s must have at least @a __n characters, '\\0' has no specia
733 const size_type __n = traits_type::length(__s); local
2663 const int __n = __numeric_traits<float>::__max_exponent10 + 20; local
2671 const int __n = __numeric_traits<double>::__max_exponent10 + 20; local
2679 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
2764 const int __n = __numeric_traits<float>::__max_exponent10 + 20; local
2772 const int __n = __numeric_traits<double>::__max_exponent10 + 20; local
2780 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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...] |
| /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...] |
| _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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hashtable.h | 124 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
125 : _M_cur(__n), _M_ht(__tab) { }
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
178 : _M_cur(__n), _M_ht(__tab) { }
222 __stl_next_prime(unsigned long __n)
226 const unsigned long* pos = std::lower_bound(__first, __last, __n);
321 hashtable(size_type __n, const _HashFcn& __hf,
326 { _M_initialize_buckets(__n); }
328 hashtable(size_type __n, const _HashFcn& __hf,
333 { _M_initialize_buckets(__n); }
483 size_type __n = distance(__f, __l); local
494 size_type __n = distance(__f, __l); local
506 size_type __n = _M_bkt_num_key(__key); local
518 size_type __n = _M_bkt_num_key(__key); local
530 const size_type __n = _M_bkt_num_key(__key); local
600 _Node* __n = _M_get_node(); local
746 const size_type __n = _M_bkt_num(__obj); local
765 const size_type __n = _M_bkt_num(__obj); local
792 size_type __n = _M_bkt_num(__obj); local
813 const size_type __n = _M_bkt_num_key(__key); local
839 const size_type __n = _M_bkt_num_key(__key); local
866 const size_type __n = _M_bkt_num_key(__key); local
926 const size_type __n = _M_bkt_num(__p->_M_val); local
1008 const size_type __n = _M_next_size(__num_elements_hint); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| forward_list.h | 123 _Fwd_list_iterator(typename _Node_base::_Pointer __n)
124 : _M_node(__n) { }
191 _Fwd_list_const_iterator(typename _Node_base::_Const_pointer __n)
192 : _M_node(__n) { }
457 forward_list(size_type __n)
459 { _M_fill_initialize(__n, value_type()); }
470 forward_list(size_type __n, const _Tp& __value,
473 { _M_fill_initialize(__n, __value); }
615 assign(size_type __n, const _Tp& __val)
618 insert_after(cbefore_begin(), __n, __val) local
[all...] |
| stl_bvector.h | 139 difference_type __n = __i + _M_offset; local
140 _M_p += __n / int(_S_word_bit);
141 __n = __n % int(_S_word_bit);
142 if (__n < 0)
144 __n += int(_S_word_bit);
147 _M_offset = static_cast<unsigned int>(__n);
264 operator+(ptrdiff_t __n, const _Bit_iterator& __x)
265 { return __x + __n; }
350 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x
775 const difference_type __n = __position - begin(); local
900 const size_type __n = std::distance(__first, __last); local
[all...] |
| stl_list.h | 519 list(size_type __n, const value_type& __value = value_type(),
522 { _M_fill_initialize(__n, __value); }
641 assign(size_type __n, const value_type& __val)
642 { _M_fill_assign(__n, __val); }
1027 insert(iterator __position, size_type __n, const value_type& __x)
1029 list __tmp(__n, __x, _M_get_Node_allocator());
1425 _Node* __n = static_cast<_Node*>(__position._M_node); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| vstring.h | 96 std::__throw_out_of_range(__N(__s));
104 std::__throw_length_error(__N(__s));
186 * @param __n Number of characters to copy (default remainder).
189 size_type __n = npos)
193 __str._M_data() + __str._M_limit(__pos, __n)
200 * @param __n Number of characters to copy.
204 size_type __n, const _Alloc& __a)
208 __str._M_data() + __str._M_limit(__pos, __n)
214 * @param __n Number of characters to copy.
217 * NB: @a __s must have at least @a __n characters, '\\0' has no specia
720 const size_type __n = traits_type::length(__s); local
2517 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
2576 const int __n = __numeric_traits<long double>::__max_exponent10 + 20; local
[all...] |
