| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| streambuf_iterator.h | 331 const streamsize __n = __sb->egptr() - __sb->gptr(); local
332 if (__n > 1)
334 traits_type::copy(__result, __sb->gptr(), __n);
335 __sb->gbump(__n);
336 __result += __n;
368 streamsize __n = __sb->egptr() - __sb->gptr(); local
369 if (__n > 1)
372 __n, __val);
374 __n = __p - __sb->gptr();
375 __sb->gbump(__n);
[all...] |
| valarray_after.h | 256 _Expr<_Clos, _Tp>::shift(int __n) const
258 valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n);
264 _Expr<_Clos, _Tp>::cshift(int __n) const
266 valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n);
291 size_t __n = _M_closure.size(); local
292 if (__n == 0)
296 _Tp __s = _M_closure[--__n];
297 while (__n != 0)
298 __s += _M_closure[--__n];
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
126 for ( ; __i != end() && __n > 0; ++__i, --__n)
128 if (__n > 0)
129 insert(end(), __n, __val); local
|
| _ostream.c | 335 streamsize __n = _Traits::length(__s); local
336 streamsize __npad = this->width() > __n ? this->width() - __n : 0;
340 __failed = this->rdbuf()->sputn(__s, __n) != __n;
342 __failed = this->rdbuf()->sputn(__s, __n) != __n;
348 __failed = __failed || this->rdbuf()->sputn(__s, __n) != __n;
367 streamsize __n = char_traits<char>::length(__s) local
[all...] |
| _time_facets.c | 80 difference_type __n = __name_end - __name; local
83 difference_type __check_count = __n;
85 size_t __matching_name_index = __n;
90 difference_type __new_n = __n;
91 for (__i = __start; __i < __n; ++__i) {
119 __n = __new_n;
|
| _vector.c | 62 void vector<_Tp, _Alloc>::reserve(size_type __n) {
63 if (capacity() < __n) {
64 if (max_size() < __n) {
71 __tmp = _M_allocate_and_copy(__n, this->_M_start, this->_M_finish);
74 __tmp = this->_M_end_of_storage.allocate(__n, __n);
76 _M_set(__tmp, __tmp + __old_size, __tmp + __n);
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n,
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type());
130 iterator __dst = __src + __n;
224 size_type __n = __pos - begin(); local
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| streambuf_iterator.h | 331 const streamsize __n = __sb->egptr() - __sb->gptr(); local
332 if (__n > 1)
334 traits_type::copy(__result, __sb->gptr(), __n);
335 __sb->gbump(__n);
336 __result += __n;
368 streamsize __n = __sb->egptr() - __sb->gptr(); local
369 if (__n > 1)
372 __n, __val);
374 __n = __p - __sb->gptr();
375 __sb->gbump(__n);
[all...] |
| valarray_after.h | 256 _Expr<_Clos, _Tp>::shift(int __n) const
258 valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n);
264 _Expr<_Clos, _Tp>::cshift(int __n) const
266 valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n);
291 size_t __n = _M_closure.size(); local
292 if (__n == 0)
296 _Tp __s = _M_closure[--__n];
297 while (__n != 0)
298 __s += _M_closure[--__n];
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _list.c | 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
126 for ( ; __i != end() && __n > 0; ++__i, --__n)
128 if (__n > 0)
129 insert(end(), __n, __val); local
|
| _ostream.c | 335 streamsize __n = _Traits::length(__s); local
336 streamsize __npad = this->width() > __n ? this->width() - __n : 0;
340 __failed = this->rdbuf()->sputn(__s, __n) != __n;
342 __failed = this->rdbuf()->sputn(__s, __n) != __n;
348 __failed = __failed || this->rdbuf()->sputn(__s, __n) != __n;
367 streamsize __n = char_traits<char>::length(__s) local
[all...] |
| _time_facets.c | 80 difference_type __n = __name_end - __name; local
83 difference_type __check_count = __n;
85 size_t __matching_name_index = __n;
90 difference_type __new_n = __n;
91 for (__i = __start; __i < __n; ++__i) {
119 __n = __new_n;
|
| _vector.c | 62 void vector<_Tp, _Alloc>::reserve(size_type __n) {
63 if (capacity() < __n) {
64 if (max_size() < __n) {
71 __tmp = _M_allocate_and_copy(__n, this->_M_start, this->_M_finish);
74 __tmp = this->_M_end_of_storage.allocate(__n, __n);
76 _M_set(__tmp, __tmp + __old_size, __tmp + __n);
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n,
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type());
130 iterator __dst = __src + __n;
224 size_type __n = __pos - begin(); local
[all...] |
| /external/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...] |
| /external/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;
|
| /external/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...] |
| /ndk/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...] |
