Home
last modified time | relevance | path

Searched refs:__n (Results 1 – 25 of 122) sorted by relevance

12345

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_string.c162 size_type __n = (max)(__res_arg, size()) + 1; in reserve() local
163 if (__n < this->_M_capacity()) in reserve()
166 _M_reserve(__n); in reserve()
170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { in _M_reserve() argument
171 pointer __new_start = this->_M_start_of_storage.allocate(__n, __n); in _M_reserve()
175 this->_M_reset(__new_start, __new_finish, __new_start + __n); in _M_reserve()
180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { in append() argument
181 if (__n > 0) { in append()
182 if (__n > max_size() - size()) in append()
184 if (__n >= this->_M_rest()) in append()
[all …]
D_vector.c62 void vector<_Tp, _Alloc>::reserve(size_type __n) { in reserve() argument
63 if (capacity() < __n) { in reserve()
64 if (max_size() < __n) { in reserve()
71 __tmp = _M_allocate_and_copy(__n, this->_M_start, this->_M_finish); in reserve()
74 __tmp = this->_M_end_of_storage.allocate(__n, __n); in reserve()
76 _M_set(__tmp, __tmp + __old_size, __tmp + __n); in reserve()
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, in _M_fill_insert_aux() argument
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type()); in _M_fill_insert_aux()
130 iterator __dst = __src + __n; in _M_fill_insert_aux()
135 _STLP_PRIV __uninitialized_fill_n(__pos, __n, __x); in _M_fill_insert_aux()
[all …]
D_hashtable.h303 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]); }
384 const_local_iterator end(size_type __n) const { return _ElemsIte(_M_buckets[__n + 1]); }
418 iterator _M_insert_noresize(size_type __n, const value_type& __obj);
[all …]
D_alloc.h67 static void* _STLP_CALL allocate(size_t __n)
72 void *__result = malloc(__n);
92 static void* _STLP_CALL allocate(size_t __n) { return __stl_new(__n); } in allocate() argument
149 static void * _STLP_CALL _M_allocate(size_t& __n);
151 static void _STLP_CALL _M_deallocate(void *__p, size_t __n);
157 static void* _STLP_CALL allocate(size_t& __n) in allocate() argument
158 { return (__n > (size_t)_MAX_BYTES) ? __stl_new(__n) : _M_allocate(__n); } in allocate()
160 static void _STLP_CALL deallocate(void *__p, size_t __n) in deallocate() argument
161 { if (__n > (size_t)_MAX_BYTES) __stl_delete(__p); else _M_deallocate(__p, __n); } in deallocate()
301 _Tp* allocate(size_type __n, const void* = 0) {
[all …]
D_string_workaround.h51 basic_string(_Reserve_t __r, size_t __n,
53 : _STLP_NO_MEM_T_STRING_BASE(__r, __n, __a) {} in _STLP_NO_MEM_T_STRING_BASE() argument
58 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
60 : _STLP_NO_MEM_T_STRING_BASE(__s, __pos, __n, __a) {} in _STLP_NO_MEM_T_STRING_BASE() argument
62 basic_string(const _CharT* __s, size_type __n,
64 : _STLP_NO_MEM_T_STRING_BASE(__s, __n, __a) {} in _STLP_NO_MEM_T_STRING_BASE() argument
70 basic_string(size_type __n, _CharT __c,
72 : _STLP_NO_MEM_T_STRING_BASE(__n, __c, __a) {} in _STLP_NO_MEM_T_STRING_BASE() argument
124 difference_type __n = _STLP_STD::distance(__f, __l); in _M_range_initialize() local
125 this->_M_allocate_block(__n + 1); in _M_range_initialize()
[all …]
D_vector.h69 _Vector_base(size_t __n, const _Alloc& __a) in _Vector_base() argument
71 _M_start = _M_end_of_storage.allocate(__n, __n); in _Vector_base()
73 _M_end_of_storage._M_data = _M_start + __n; in _Vector_base()
166 void _M_range_check(size_type __n) const { in _M_range_check() argument
167 if (__n >= size_type(this->_M_finish - this->_M_start)) in _M_range_check()
171 size_type _M_compute_next_size(size_type __n) { in _M_compute_next_size() argument
173 if (__n > max_size() - __size) in _M_compute_next_size()
175 size_type __len = __size + (max)(__n, __size); in _M_compute_next_size()
202 reference operator[](size_type __n) { return *(begin() + __n); }
203 const_reference operator[](size_type __n) const { return *(begin() + __n); }
[all …]
D_bvector.h132 difference_type __n = __i + _M_offset;
133 _M_p += __n / _STLP_WORD_BIT;
134 __n = __n % _STLP_WORD_BIT;
135 if (__n < 0) {
136 _M_offset = (unsigned int) __n + _STLP_WORD_BIT;
139 _M_offset = (unsigned int) __n;
232 operator+(ptrdiff_t __n, const _Bit_iter<_Ref, _Ptr>& __x) {
233 return __x + __n;
300 __chunk_type* _M_bit_alloc(size_t __n)
301 { return _M_end_of_storage.allocate(_M_bits_to_chunks(__n)); }
[all …]
D_bitset.c41 for (size_t __n = _Nw - 1; __n >= __wshift; --__n) in _M_do_left_shift() local
42 _M_w[__n] = _M_w[__n - __wshift]; in _M_do_left_shift()
46 for (size_t __n = _Nw - 1; __n > __wshift; --__n) in _M_do_left_shift() local
47 _M_w[__n] = (_M_w[__n - __wshift] << __offset) | in _M_do_left_shift()
48 (_M_w[__n - __wshift - 1] >> __sub_offset); in _M_do_left_shift()
64 for (size_t __n = 0; __n <= __limit; ++__n) in _M_do_right_shift() local
65 _M_w[__n] = _M_w[__n + __wshift]; in _M_do_right_shift()
69 for (size_t __n = 0; __n < __limit; ++__n) in _M_do_right_shift() local
70 _M_w[__n] = (_M_w[__n + __wshift] >> __offset) | in _M_do_right_shift()
71 (_M_w[__n + __wshift + 1] << __sub_offset); in _M_do_right_shift()
D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
32 …: _STLP_STRING_SUM_BASE(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : … in _Reserve_t()
37 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos)); in _Reserve_t()
59 …ast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _CharT *__buf, size_type /*__pos*/, size_type __n) { in _M_append_fast_pos() argument
60 if (__n == 0) in _M_append_fast_pos()
66 size_type __pos, size_type __n) in _M_append_fast_pos() argument
67 { return uninitialized_copy(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos), __buf); } in _M_append_fast_pos()
69 size_type __pos, size_type __n) in _M_append_fast_pos() argument
70 { return _M_append_fast_pos(__s.c_str(), __s.size(), __buf, __pos, __n); } in _M_append_fast_pos()
72 size_type __pos, size_type __n) in _M_append_fast_pos() argument
[all …]
Dchar_traits.h146 static int _STLP_CALL compare(const char_type* __s1, const char_type* __s2, size_t __n) { in compare() argument
147 for (size_t __i = 0; __i < __n; ++__i) in compare()
160 static const char_type* _STLP_CALL find(const char_type* __s, size_t __n, const char_type& __c) { in find() argument
161 for ( ; __n > 0 ; ++__s, --__n) in find()
170 static char_type* _STLP_CALL copy(char_type* __s1, const char_type* __s2, size_t __n) { in copy() argument
171 return (__n == 0 ? __s1 : in copy()
172 (char_type*)memcpy(__s1, __s2, __n * sizeof(char_type))); in copy()
175 static char_type* _STLP_CALL assign(char_type* __s, size_t __n, char_type __c) { in assign() argument
176 for (size_t __i = 0; __i < __n; ++__i) in assign()
225 static int _STLP_CALL compare(const char* __s1, const char* __s2, size_t __n) in compare() argument
[all …]
D_hash_set.h85 explicit hash_set(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
86 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
87 hash_set(size_type __n, const hasher& __hf) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
88 : _M_ht(__n, __hf, key_equal(), allocator_type()) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, in _STLP_CREATE_HASH_ITERATOR_TRAITS()
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
94 : _M_ht(__n, __hf, __eql, allocator_type()) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, in _STLP_CREATE_HASH_ITERATOR_TRAITS()
98 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
D_alloc.c38 void * _STLP_CALL __debug_alloc<_Alloc>::allocate(size_t __n) { in allocate() argument
40 size_t __real_n = __n + __total_extra; in allocate()
41 if (__real_n < __n) { in allocate()
49 __result->_M_size = (_STLP_UINT32_T)__n; in allocate()
55 __debug_alloc<_Alloc>::deallocate(void *__p, size_t __n) { in deallocate() argument
61 _STLP_VERBOSE_ASSERT(__real_p->_M_size == __n, _StlMsg_DBA_SIZE_MISMATCH) in deallocate()
68 size_t __real_n = __n + __extra_before_chunk() + __extra_after_chunk(); in deallocate()
70 for (__tmp= ((unsigned char*)__p) + __n * sizeof(value_type); in deallocate()
77 memset((char*)__p, __shred_byte, __n * sizeof(value_type)); in deallocate()
D_string.h169 basic_string(_Reserve_t, size_t __n,
172 basic_string(_Reserve_t, size_t __n) in basic_string() argument
173 : _STLP_PRIV _String_base<_CharT,_Alloc>(allocator_type(), __n + 1) in basic_string()
175 basic_string(_Reserve_t, size_t __n, const allocator_type& __a) in basic_string() argument
177 : _STLP_PRIV _String_base<_CharT,_Alloc>(__a, __n + 1) in basic_string()
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) in basic_string() argument
199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); in basic_string()
201 basic_string(const _Self& __s, size_type __pos, size_type __n, in basic_string() argument
209 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); in basic_string()
[all …]
D_hash_map.h89 explicit hash_map(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
90 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
91 hash_map(size_type __n, const hasher& __hf) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
92 : _M_ht(__n, __hf, key_equal(), allocator_type()) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, in _STLP_CREATE_HASH_ITERATOR_TRAITS()
95 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
110 : _M_ht(__n, hasher(), key_equal(), allocator_type()) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS()
115 : _M_ht(__n, __hf, key_equal(), allocator_type()) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
D_pthread_alloc.h76 static void * _STLP_CALL allocate(size_t& __n);
79 static void _STLP_CALL deallocate(void *__p, size_t __n);
83 static void * _STLP_CALL allocate(size_t& __n, __state_type* __a);
86 static void _STLP_CALL deallocate(void *__p, size_t __n, __state_type* __a);
129 _Tp* allocate(size_type __n, const void* = 0) {
130 if (__n > max_size()) {
133 if (__n != 0) {
134 size_type __buf_size = __n * sizeof(value_type);
145 void deallocate(pointer __p, size_type __n) { in deallocate() argument
146 _STLP_ASSERT( (__p == 0) == (__n == 0) ) in deallocate()
[all …]
D_string_sum.h33 const_reference operator[] (size_t __n) const {
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()]; }
119 const_reference at(size_type __n) const in at() argument
120 { return _M_get_storage().at(__n); } in at()
135 _BString& append(const _BString& __s, size_type __pos, size_type __n) in append() argument
136 { return _M_get_storage().append(__s, __pos, __n); } in append()
[all …]
D_deque.h139 void _M_advance(difference_type __n) { in _M_advance()
141 difference_type __offset = __n + (_M_cur - _M_first); in _M_advance()
143 _M_cur += __n; in _M_advance()
208 _Self& operator+=(difference_type __n) { this->_M_advance(__n); return *this; }
209 _Self operator+(difference_type __n) const {
211 return __tmp += __n;
214 _Self& operator-=(difference_type __n) { return *this += -__n; }
215 _Self operator-(difference_type __n) const {
217 return __tmp -= __n;
220 reference operator[](difference_type __n) const { return *(*this + __n); }
[all …]
D_streambuf.h91 void gbump(int __n) { _M_gnext += __n; } in gbump() argument
105 void _M_gbump(int __n) { gbump(__n); } in _M_gbump() argument
115 void pbump(int __n) { _M_pnext += __n; } in pbump() argument
142 basic_streambuf<_CharT, _Traits>* pubsetbuf(char_type* __s, streamsize __n) in pubsetbuf() argument
143 { return this->setbuf(__s, __n); } in pubsetbuf()
165 virtual streamsize xsgetn(char_type* __s, streamsize __n);
186 virtual streamsize xsputn(const char_type* __s, streamsize __n);
190 virtual streamsize _M_xsputnc(char_type __c, streamsize __n);
204 streamsize sputn(const char_type* __s, streamsize __n) in sputn() argument
205 { return this->xsputn(__s, __n); } in sputn()
[all …]
D_numeric.c74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) { in __power() argument
76 if (__n == 0) in __power()
79 while ((__n & 1) == 0) { in __power()
80 __n >>= 1; in __power()
85 __n >>= 1; in __power()
86 while (__n != 0) { in __power()
88 if ((__n & 1) != 0) in __power()
90 __n >>= 1; in __power()
D_unordered_set.h77 explicit unordered_set(size_type __n = 0, const hasher& __hf = hasher(), in _STLP_CREATE_HASH_ITERATOR_TRAITS()
80 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
90 size_type __n = 0, const hasher& __hf = hasher(), in _STLP_CREATE_HASH_ITERATOR_TRAITS()
93 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
97 size_type __n = 0, const hasher& __hf = hasher(), in _STLP_CREATE_HASH_ITERATOR_TRAITS()
100 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
104 size_type __n = 0, const hasher& __hf = hasher(), in _STLP_CREATE_HASH_ITERATOR_TRAITS()
107 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
163 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
166 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
D_sstream.c171 streamsize __n) { in xsputn() argument
174 if ((_M_mode & ios_base::out) && __n > 0) { in xsputn()
179 if (__avail > __n) { in xsputn()
180 _Traits::copy(this->pptr(), __s, __STATIC_CAST(size_t, __n)); in xsputn()
181 this->pbump((int)__n); in xsputn()
182 return __n; in xsputn()
186 __n -= __avail; in xsputn()
195 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n)); in xsputn()
199 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n)); in xsputn()
205 __nwritten += __n; in xsputn()
[all …]
/ndk/sources/cxx-stl/stlport/src/
Dallocators.cpp131 void* _STLP_CALL __malloc_alloc::allocate(size_t __n) in allocate() argument
133 void *__result = malloc(__n); in allocate()
148 __result = malloc(__n); in allocate()
268 static _Obj* _S_refill(size_t __n);
312 static void* _M_allocate(size_t& __n);
314 static void _M_deallocate(void *__p, size_t __n);
318 void* __node_alloc_impl::_M_allocate(size_t& __n) { in _M_allocate() argument
319 __n = _S_round_up(__n); in _M_allocate()
320 _Obj * _STLP_VOLATILE * __my_free_list = _S_free_list + _S_FREELIST_INDEX(__n); in _M_allocate()
331 __r = _S_refill(__n); in _M_allocate()
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
32 …: _M_non_dbg_impl(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a… in _Reserve_t()
39 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos), _M_non_dbg_impl); in _Reserve_t()
59 …fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _Base &__str, size_type /*__pos*/, size_type __n) { in _M_append_fast_pos() argument
60 if (__n == 0) in _M_append_fast_pos()
65 size_type __pos, size_type __n) in _M_append_fast_pos() argument
66 { return __str.append(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos)); } in _M_append_fast_pos()
68 size_type __pos, size_type __n) in _M_append_fast_pos() argument
69 { return _M_append_fast_pos(__s.c_str(), __s.size(), __str, __pos, __n); } in _M_append_fast_pos()
71 size_type __pos, size_type __n) in _M_append_fast_pos() argument
[all …]
D_string.h93 basic_string(_Reserve_t __r, size_t __n,
95 : _M_non_dbg_impl(__r, __n, __a), _M_iter_list(&_M_non_dbg_impl) {} in _M_non_dbg_impl() argument
101 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
103 : _M_non_dbg_impl(__s._M_non_dbg_impl, __pos, __n, __a),
106 basic_string(const _CharT* __s, size_type __n,
108 : _ConstructCheck(__s), _M_non_dbg_impl(__s, __n, __a), in _ConstructCheck()
116 basic_string(size_type __n, _CharT __c,
118 : _M_non_dbg_impl(__n, __c, __a), _M_iter_list(&_M_non_dbg_impl) {} in _M_non_dbg_impl() argument
198 void resize(size_type __n, _CharT __c) { in resize() argument
199 if (__n > capacity()) in resize()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__bit_reference162 __find_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
171 __storage_type __dn = _VSTD::min(__clz_f, __n);
176 if (__n == __dn)
177 return __first + __n;
178 __n -= __dn;
182 for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
186 if (__n > 0)
188 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
193 return _It(__first.__seg_, static_cast<unsigned>(__n));
198 __find_bool_false(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
[all …]

12345