| /external/stlport/stlport/stl/ |
| _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...] |
| _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...] |
| _iostream_string.h | 63 _CharT* allocate(size_type __n, const void* __ptr = 0) {
64 if (__n > _BUF_SIZE) {
65 return _Base::allocate(__n, __ptr);
69 void deallocate(pointer __p, size_type __n) {
70 if (__p != _M_static_buf) _Base::deallocate(__p, __n);
|
| _hash_set.h | 85 explicit hash_set(size_type __n)
86 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
87 hash_set(size_type __n, const hasher& __hf)
88 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql)
94 : _M_ht(__n, __hf, __eql, allocator_type()) {}
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
98 : _M_ht(__n, __hf, __eql, __a) {}
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
[all...] |
| _unordered_map.h | 83 explicit unordered_map(size_type __n = 0, const hasher& __hf = hasher(),
86 : _M_ht(__n, __hf, __eql, __a) {}
96 size_type __n = 0, const hasher& __hf = hasher(),
99 : _M_ht(__n, __hf, __eql, __a)
103 size_type __n = 0, const hasher& __hf = hasher(),
106 : _M_ht(__n, __hf, __eql, __a)
110 size_type __n = 0, const hasher& __hf = hasher(),
113 : _M_ht(__n, __hf, __eql, __a)
177 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
[all...] |
| _unordered_set.h | 77 explicit unordered_set(size_type __n = 0, const hasher& __hf = hasher(),
80 : _M_ht(__n, __hf, __eql, __a) {}
90 size_type __n = 0, const hasher& __hf = hasher(),
93 : _M_ht(__n, __hf, __eql, __a)
97 size_type __n = 0, const hasher& __hf = hasher(),
100 : _M_ht(__n, __hf, __eql, __a)
104 size_type __n = 0, const hasher& __hf = hasher(),
107 : _M_ht(__n, __hf, __eql, __a)
163 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
[all...] |
| _cwchar.h | 309 inline wchar_t* _STLP_wmemcpy(wchar_t* __wdst, const wchar_t* __wsrc, size_t __n)
310 { return __STATIC_CAST(wchar_t*, _STLP_VENDOR_CSTD::wmemcpy(__wdst, __wsrc, __n)); }
311 inline wchar_t* _STLP_wmemset(wchar_t* __wdst, wchar_t __wc, size_t __n)
312 { return __STATIC_CAST(wchar_t*, _STLP_VENDOR_CSTD::memset(__wdst, __wc, __n)); }
315 inline wchar_t* wmemcpy(wchar_t* __wdst, const wchar_t* __wsrc, size_t __n)
316 { return _STLP_wmemcpy(__wdst, __wsrc, __n); }
317 inline wchar_t* wmemset(wchar_t* __wdst, wchar_t __wc, size_t __n)
318 { return _STLP_wmemset(__wdst, __wc, __n); }
320 inline wchar_t* wmemcpy(wchar_t* __RESTRICT __wdst, const wchar_t* __RESTRICT __wsrc, size_t __n)
321 { return __STATIC_CAST(wchar_t*, memcpy(__wdst, __wsrc, __n * sizeof(wchar_t)));
[all...] |
| _hash_map.h | 89 explicit hash_map(size_type __n)
90 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
91 hash_map(size_type __n, const hasher& __hf)
92 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
95 : _M_ht(__n, __hf, __eql, __a) {}
109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
110 : _M_ht(__n, hasher(), key_equal(), allocator_type())
113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
115 : _M_ht(__n, __hf, key_equal(), allocator_type()
[all...] |
| _string_io.c | 18 streamsize __n) {
20 for (streamsize __i = 0; __i < __n; ++__i) {
43 size_type __n = __s.size(); local
48 const bool __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
55 __ok = __ok && (__buf->sputn(__s.data(), streamsize(__n)) == streamsize(__n));
87 size_type __n; local
89 __n = __s.max_size()
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _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...] |
| _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...] |
| _iostream_string.h | 63 _CharT* allocate(size_type __n, const void* __ptr = 0) {
64 if (__n > _BUF_SIZE) {
65 return _Base::allocate(__n, __ptr);
69 void deallocate(pointer __p, size_type __n) {
70 if (__p != _M_static_buf) _Base::deallocate(__p, __n);
|
| _hash_set.h | 85 explicit hash_set(size_type __n)
86 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
87 hash_set(size_type __n, const hasher& __hf)
88 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql)
94 : _M_ht(__n, __hf, __eql, allocator_type()) {}
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
98 : _M_ht(__n, __hf, __eql, __a) {}
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
[all...] |
| _unordered_map.h | 83 explicit unordered_map(size_type __n = 0, const hasher& __hf = hasher(),
86 : _M_ht(__n, __hf, __eql, __a) {}
96 size_type __n = 0, const hasher& __hf = hasher(),
99 : _M_ht(__n, __hf, __eql, __a)
103 size_type __n = 0, const hasher& __hf = hasher(),
106 : _M_ht(__n, __hf, __eql, __a)
110 size_type __n = 0, const hasher& __hf = hasher(),
113 : _M_ht(__n, __hf, __eql, __a)
177 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
[all...] |
| _unordered_set.h | 77 explicit unordered_set(size_type __n = 0, const hasher& __hf = hasher(),
80 : _M_ht(__n, __hf, __eql, __a) {}
90 size_type __n = 0, const hasher& __hf = hasher(),
93 : _M_ht(__n, __hf, __eql, __a)
97 size_type __n = 0, const hasher& __hf = hasher(),
100 : _M_ht(__n, __hf, __eql, __a)
104 size_type __n = 0, const hasher& __hf = hasher(),
107 : _M_ht(__n, __hf, __eql, __a)
163 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
[all...] |
| _cwchar.h | 309 inline wchar_t* _STLP_wmemcpy(wchar_t* __wdst, const wchar_t* __wsrc, size_t __n)
310 { return __STATIC_CAST(wchar_t*, _STLP_VENDOR_CSTD::wmemcpy(__wdst, __wsrc, __n)); }
311 inline wchar_t* _STLP_wmemset(wchar_t* __wdst, wchar_t __wc, size_t __n)
312 { return __STATIC_CAST(wchar_t*, _STLP_VENDOR_CSTD::memset(__wdst, __wc, __n)); }
315 inline wchar_t* wmemcpy(wchar_t* __wdst, const wchar_t* __wsrc, size_t __n)
316 { return _STLP_wmemcpy(__wdst, __wsrc, __n); }
317 inline wchar_t* wmemset(wchar_t* __wdst, wchar_t __wc, size_t __n)
318 { return _STLP_wmemset(__wdst, __wc, __n); }
320 inline wchar_t* wmemcpy(wchar_t* __RESTRICT __wdst, const wchar_t* __RESTRICT __wsrc, size_t __n)
321 { return __STATIC_CAST(wchar_t*, memcpy(__wdst, __wsrc, __n * sizeof(wchar_t)));
[all...] |
| _hash_map.h | 89 explicit hash_map(size_type __n)
90 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
91 hash_map(size_type __n, const hasher& __hf)
92 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
95 : _M_ht(__n, __hf, __eql, __a) {}
109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
110 : _M_ht(__n, hasher(), key_equal(), allocator_type())
113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
115 : _M_ht(__n, __hf, key_equal(), allocator_type()
[all...] |
| _string_io.c | 18 streamsize __n) {
20 for (streamsize __i = 0; __i < __n; ++__i) {
43 size_type __n = __s.size(); local
48 const bool __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
55 __ok = __ok && (__buf->sputn(__s.data(), streamsize(__n)) == streamsize(__n));
87 size_type __n; local
89 __n = __s.max_size()
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| pod_char_traits.h | 109 compare(const char_type* __s1, const char_type* __s2, size_t __n)
111 for (size_t __i = 0; __i < __n; ++__i)
127 find(const char_type* __s, size_t __n, const char_type& __a)
129 for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
136 move(char_type* __s1, const char_type* __s2, size_t __n)
139 (__builtin_memmove(__s1, __s2, __n * sizeof(char_type)));
143 copy(char_type* __s1, const char_type* __s2, size_t __n)
145 std::copy(__s2, __s2 + __n, __s1);
150 assign(char_type* __s, size_t __n, char_type __a)
152 std::fill_n(__s, __n, __a)
[all...] |
| vstring_util.h | 99 // When __n = 1 way faster than the general multichar
102 _S_copy(_CharT* __d, const _CharT* __s, size_type __n)
104 if (__n == 1)
107 traits_type::copy(__d, __s, __n);
111 _S_move(_CharT* __d, const _CharT* __s, size_type __n)
113 if (__n == 1)
116 traits_type::move(__d, __s, __n);
120 _S_assign(_CharT* __d, size_type __n, _CharT __c)
122 if (__n == 1)
125 traits_type::assign(__d, __n, __c);
[all...] |
| /external/stlport/stlport/stl/pointers/ |
| _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/pointers/ |
| _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/debug/ |
| _iterator.h | 57 void _Advance(_Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &)
58 { __it += __n; }
97 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const forward_iterator_tag &)
98 { return (__n == 1) && _Dereferenceable(__it); }
101 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const bidirectional_iterator_tag &) {
104 return (__c != 0) && ((__n == 1 && __it._M_iterator != __c->end() ) ||
105 (__n == -1 && __it._M_iterator != __c->begin()));
109 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &) {
113 ptrdiff_t __new_pos = (__it._M_iterator - __c->begin()) + __n;
150 void __advance(ptrdiff_t __n);
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _iterator.h | 57 void _Advance(_Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &)
58 { __it += __n; }
97 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const forward_iterator_tag &)
98 { return (__n == 1) && _Dereferenceable(__it); }
101 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const bidirectional_iterator_tag &) {
104 return (__c != 0) && ((__n == 1 && __it._M_iterator != __c->end() ) ||
105 (__n == -1 && __it._M_iterator != __c->begin()));
109 bool _Incrementable(const _Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &) {
113 ptrdiff_t __new_pos = (__it._M_iterator - __c->begin()) + __n;
150 void __advance(ptrdiff_t __n);
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_iterator.h | 220 operator+(difference_type __n) const
221 { return reverse_iterator(current - __n); }
229 operator+=(difference_type __n)
231 current -= __n;
241 operator-(difference_type __n) const
242 { return reverse_iterator(current + __n); }
250 operator-=(difference_type __n)
252 current += __n;
262 operator[](difference_type __n) const
263 { return *(*this + __n); }
[all...] |
