HomeSort by relevance Sort by last modified time
    Searched defs:__n (Results 76 - 100 of 176) sorted by null

1 2 34 5 6 7 8

  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/pointers/
_slist.h 91 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type),
93 slist(size_type __n, const value_type& __x,
96 : _M_impl(__n, cast_traits::to_storage_type_cref(__x), _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}
99 explicit slist(size_type __n) : _M_impl(__n) {}
145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
238 void insert_after(iterator __pos, size_type __n, const value_type& __x
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } local
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
300 { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } local
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
    [all...]
_vector.h 95 reference operator[](size_type __n) { return cast_traits::to_value_type_ref(_M_impl[__n]); }
96 const_reference operator[](size_type __n) const { return cast_traits::to_value_type_cref(_M_impl[__n]); }
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
110 explicit vector(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
112 vector(size_type __n, const value_type& __val
206 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __n, cast_traits::to_storage_type_cref(__x)); local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_algobase.h 341 for(_Distance __n = __last - __first; __n > 0; --__n)
360 for(_Distance __n = __last - __first; __n > 0; --__n)
544 typename iterator_traits<_BI1>::difference_type __n; local
545 for (__n = __last - __first; __n > 0; --__n)
559 typename iterator_traits<_BI1>::difference_type __n; local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/
sso_string_base.h 173 _M_set_length_no_wipe(size_type __n)
175 _M_length(__n);
176 traits_type::assign(_M_data()[__n], _CharT());
180 _M_set_length(size_type __n)
183 if (__n + 1 < _M_length())
187 __builtin_memset(_M_data() + __n + 1, 0xcd, _M_length() - __n);
190 _M_set_length_no_wipe(__n);
205 __sso_string_base(size_type __n, _CharT __c, const _Alloc& __a);
236 _M_erase(size_type __pos, size_type __n);
491 this->_S_assign(_M_data(), __n, __c); local
584 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/
_algobase.h 213 for (_Distance __n = __last - __first; __n > 0; --__n) {
223 size_t __n = (const char*)__last - (const char*)__first; local
224 return __n ? (void *)((char*)memmove(__result, __first, __n) + __n) : __result;
248 for (_Distance __n = __last - __first; __n > 0; --__n)
    [all...]
_deque.c 82 for (_Tp** __n = __nstart; __n < __nfinish; ++__n)
83 _M_map_size.deallocate(*__n, this->buffer_size());
123 size_type __n, const value_type& __x) {
128 iterator __new_start = _M_reserve_elements_at_front(__n);
136 iterator __new_finish = _M_reserve_elements_at_back(__n);
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
155 size_type __n = __last - __first; local
157 iterator __new_start = _M_reserve_elements_at_front(__n);
183 size_type __n = __last - __first; local
262 difference_type __n = __last - __first; local
326 difference_type __n = __last - __first; local
    [all...]
_fstream.c 245 ptrdiff_t __n = __enext - _M_ext_buf; local
246 if (_M_write(_M_ext_buf, __n))
261 // __buf == 0 && __n == 0 means to make this stream unbuffered.
262 // __buf != 0 && __n > 0 means to use __buf as the stream's internal
265 // size is at least __n.
268 basic_filebuf<_CharT, _Traits>::setbuf(_CharT* __buf, streamsize __n) {
271 if (__buf == 0 && __n == 0)
273 else if (__buf != 0 && __n > 0)
274 _M_allocate_buffers(__buf, __n);
284 _Filebuf_Tmp_Buf(ptrdiff_t __n) : _M_ptr(0) { _M_ptr = new _CharT[__n];
515 ptrdiff_t __n = _M_base._M_read(_M_ext_buf_end, _M_ext_buf_EOS - _M_ext_buf_end); local
    [all...]
_hashtable.c 69 _Stl_prime<_Dummy>::_S_next_size(size_t __n) {
73 const size_t* pos = __lower_bound(__first, __last, __n,
80 _Stl_prime<_Dummy>::_S_prev_sizes(size_t __n, size_t const*&__begin, size_t const*&__pos) {
84 __pos = __lower_bound(__begin, __last, __n,
89 else if (*__pos == __n) {
140 /* Returns the iterator before the first iterator of the bucket __n and set
141 * __n to the first previous bucket having the same first iterator as bucket
142 * __n.
148 ::_M_before_begin(size_type &__n) const {
149 return _S_before_begin(_M_elems, _M_buckets, __n);
200 const size_type __n = _M_bkt_num(__obj); local
231 const size_type __n = _M_bkt_num(__obj); local
264 const size_type __n = _M_bkt_num_key(__key); local
304 const size_type __n = _M_bkt_num(*__it); local
    [all...]
_num_get.c 140 int __n = __get_digit_from_table(__c); local
142 if (__n >= __base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
200 int __n = __get_digit_from_table(__c); local
202 if (__n >= __base)
211 _Integer __next = __STATIC_CAST(_Integer, __base * __result + __n);
457 size_t __n = 0; local
460 __true_ok = __true_ok && (__c == __truename[__n]);
461 __false_ok = __false_ok && (__c == __falsename[__n]);
462 ++__n;
    [all...]
_sstream.c 171 streamsize __n) {
174 if ((_M_mode & ios_base::out) && __n > 0) {
179 if (__avail > __n) {
180 _Traits::copy(this->pptr(), __s, __STATIC_CAST(size_t, __n));
181 this->pbump((int)__n);
182 return __n;
186 __n -= __avail;
195 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n));
199 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n));
205 __nwritten += __n;
335 ptrdiff_t __n = this->egptr() - this->eback(); local
344 ptrdiff_t __n = this->epptr() - this->pbase(); local
370 const off_type __n = __pos - pos_type(off_type(0)); local
    [all...]
_string_workaround.h 51 basic_string(_Reserve_t __r, size_t __n,
53 : _STLP_NO_MEM_T_STRING_BASE(__r, __n, __a) {}
58 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
60 : _STLP_NO_MEM_T_STRING_BASE(__s, __pos, __n, __a) {}
62 basic_string(const _CharT* __s, size_type __n,
64 : _STLP_NO_MEM_T_STRING_BASE(__s, __n, __a) {}
70 basic_string(size_type __n, _CharT __c,
72 : _STLP_NO_MEM_T_STRING_BASE(__n, __c, __a) {}
124 difference_type __n = _STLP_STD::distance(__f, __l); local
125 this->_M_allocate_block(__n + 1)
219 const size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local
400 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/debug/
_hashtable.h 134 hashtable(size_type __n,
139 : _M_non_dbg_impl(__n, __hf, __eql, __ext, __a),
142 hashtable(size_type __n,
146 : _M_non_dbg_impl(__n, __hf, __eql, __a),
185 local_iterator begin(size_type __n) {
187 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT)
188 return local_iterator(&_M_iter_list, _M_non_dbg_impl.begin(__n));
190 local_iterator end(size_type __n) {
192 _STLP_VERBOSE_ASSERT((__n < bucket_count()), _StlMsg_INVALID_ARGUMENT)
193 return local_iterator(&_M_iter_list, _M_non_dbg_impl.end(__n));
286 size_type __n = _STLP_STD::distance(__p.first, __p.second); local
    [all...]
_tree.h 277 size_type __n = _STLP_STD::distance(__p.first._M_iterator, __p.second._M_iterator); local
280 return __n;
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/pointers/
_list.h 96 explicit list(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
98 list(size_type __n, const value_type& __val,
101 : _M_impl(__n, cast_traits::to_storage_type_cref(__val),
105 explicit list(size_type __n)
106 : _M_impl(__n) {}
191 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } local
225 void insert(iterator __pos, size_type __n, const value_type& __x)
226 { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } local
255 void assign(size_type __n, const value_type& __val
    [all...]
_slist.h 91 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type),
93 slist(size_type __n, const value_type& __x,
96 : _M_impl(__n, cast_traits::to_storage_type_cref(__x), _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}
99 explicit slist(size_type __n) : _M_impl(__n) {}
145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
238 void insert_after(iterator __pos, size_type __n, const value_type& __x
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } local
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
300 { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); } local
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
    [all...]
_vector.h 95 reference operator[](size_type __n) { return cast_traits::to_value_type_ref(_M_impl[__n]); }
96 const_reference operator[](size_type __n) const { return cast_traits::to_value_type_cref(_M_impl[__n]); }
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
110 explicit vector(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
112 vector(size_type __n, const value_type& __val
206 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __n, cast_traits::to_storage_type_cref(__x)); local
    [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...]
  /prebuilt/linux-x86/toolchain/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...]

Completed in 496 milliseconds

1 2 34 5 6 7 8