Home
last modified time | relevance | path

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

1234

/reactos/sdk/include/c++/stlport/stl/
H A D_string.c166 _M_reserve(__n); in reserve()
171 pointer __new_start = this->_M_start_of_storage.allocate(__n, __n); in _M_reserve()
181 if (__n > 0) { in append()
282 if (__n != 0) { in insert()
289 _Traits::move(__pos + __n, __pos, (__elems_after - __n) + 1); in insert()
326 _Traits::move(__pos + __n, __pos, (__elems_after - __n) + 1); in _M_insert()
376 if (__len >= __n) { in replace()
394 if (__len >= __n) { in _M_replace()
580 if (__n > 0) { in _S_string_copy()
581 __n = (min) (__n - 1, __s.size()); in _S_string_copy()
[all …]
H A D_hashtable.h303 hashtable(size_type __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]); }
451 for ( ; __n > 0; --__n, ++__f)
460 for ( ; __n > 0; --__n, ++__f)
468 for ( ; __n > 0; --__n, ++__f)
475 for ( ; __n > 0; --__n, ++__f)
482 for ( ; __n > 0; --__n, ++__f)
489 for ( ; __n > 0; --__n, ++__f)
538 for (_ElemsIte __first(_M_buckets[__n]), __last(_M_buckets[__n + 1]);
[all …]
H A D_vector.h71 _M_start = _M_end_of_storage.allocate(__n, __n); in _Vector_base()
202 reference operator[](size_type __n) { return *(begin() + __n); }
203 const_reference operator[](size_type __n) const { return *(begin() + __n); }
210 reference at(size_type __n) { _M_range_check(__n); return (*this)[__n]; } in at() argument
211 const_reference at(size_type __n) const { _M_range_check(__n); return (*this)[__n]; } in at() argument
235 { _M_initialize(__n); } in vector()
318 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } in assign() argument
330 size_type __n = __len; local
465 this->_M_finish += __n;
683 pointer __result = this->_M_end_of_storage.allocate(__n, __n);
[all …]
H A D_string_workaround.h169 _Base::append(__s, __pos, __n); in append()
175 _Base::append(__s, __n); in append()
184 _Base::append(__n, __c); in append()
220 if (__n >= this->_M_rest()) { in _M_appendT()
233 this->_M_finish += __n; in _M_appendT()
261 _Base::assign(__s, __n); in assign()
272 _Base::assign(__n, __c); in assign()
401 if (__n < this->_M_rest()) { in _M_insertT()
405 this->_M_finish += __n; in _M_insertT()
406 _Traits::move(__pos + __n, __pos, (__elems_after - __n) + 1); in _M_insertT()
[all …]
H A D_bvector.h134 __n = __n % _STLP_WORD_BIT;
135 if (__n < 0) {
233 return __x + __n;
430 _M_initialize(__n);
503 { _M_range_check(__n); return (*this)[__n]; }
505 { _M_range_check(__n); return (*this)[__n]; }
513 _M_initialize(__n);
519 _M_initialize(__n);
532 _M_initialize(__n);
562 _M_initialize(__n);
[all …]
H A D_vector.c63 if (capacity() < __n) { in reserve()
64 if (max_size() < __n) { in reserve()
74 __tmp = this->_M_end_of_storage.allocate(__n, __n); in reserve()
130 iterator __dst = __src + __n; in _M_fill_insert_aux()
136 this->_M_finish += __n; in _M_fill_insert_aux()
152 if (__elems_after > __n) { in _M_fill_insert_aux()
154 this->_M_finish += __n; in _M_fill_insert_aux()
171 if (__n != 0) { in _M_fill_insert()
211 if (__n > capacity()) { in _M_fill_assign()
214 } else if (__n > size()) { in _M_fill_assign()
[all …]
H A D_alloc.h72 void *__result = malloc(__n);
92 static void* _STLP_CALL allocate(size_t __n) { return __stl_new(__n); } in allocate() argument
158 { return (__n > (size_t)_MAX_BYTES) ? __stl_new(__n) : _M_allocate(__n); } in allocate()
161 { if (__n > (size_t)_MAX_BYTES) __stl_delete(__p); else _M_deallocate(__p, __n); } in deallocate()
302 if (__n > max_size()) {
305 if (__n != 0) {
342 if (__n > max_size()) { in _M_allocate()
346 if (__n != 0) { in _M_allocate()
538 _Tp* allocate(size_type __n)
547 _Tp* allocate(size_type __n)
[all …]
H A D_hash_set.h85 explicit hash_set(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
98 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
123 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
146 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
162 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
222 { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
271 explicit hash_multiset(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
279 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
305 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
328 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_string.h304 if (__n > max_size() - __size) in _M_compute_next_size()
378 ptrdiff_t __n = __l - __f; in _M_range_initialize()
405 if (__n <= size()) in resize()
408 append(__n - size(), __c); in resize()
411 void resize(size_type __n) { resize(__n, _M_null()); } in resize() argument
438 if (__n >= size()) in at()
443 reference at(size_type __n) { in at() argument
444 if (__n >= size()) in at()
485 this->_M_finish += __n; in _M_appendT()
719 this->_M_finish += __n; in _M_insertT()
[all …]
H A D_hash_map.h89 explicit hash_map(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
95 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
128 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
145 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
161 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
227 { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
280 explicit hash_multimap(size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
286 : _M_ht(__n, __hf, __eql, __a) {} in _STLP_CREATE_HASH_ITERATOR_TRAITS()
319 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
336 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_deque.h143 _M_cur += __n; in _M_advance()
208 _Self& operator+=(difference_type __n) { this->_M_advance(__n); return *this; }
211 return __tmp += __n;
214 _Self& operator-=(difference_type __n) { return *this += -__n; }
217 return __tmp -= __n;
220 reference operator[](difference_type __n) const { return *(*this + __n); }
227 { return __x + __n; }
454 { _M_range_check(__n); return (*this)[__n]; }
456 { _M_range_check(__n); return (*this)[__n]; }
499 { _M_initialize(__n); }
[all …]
H A 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()
H A D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
60 if (__n == 0) in _M_append_fast_pos()
66 size_type __pos, size_type __n) in _M_append_fast_pos() argument
69 size_type __pos, size_type __n) in _M_append_fast_pos() argument
72 size_type __pos, size_type __n) in _M_append_fast_pos() argument
75 size_type __pos, size_type __n) in _M_append_fast_pos() argument
84 if (__n == 0) { in _M_append_fast_pos()
89 if (__n < (__lhs_size - __pos)) { in _M_append_fast_pos()
126 size_type __s_size = (min)(__s.size() - __pos, __n); in _M_append_sum_pos()
152 this->_M_construct_null(__finish + __n); in _M_append_sum_no_overflow()
[all …]
H A 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]; }
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()
152 _BString& assign(const _CharT* __s, size_type __n) {return _M_get_storage().assign(__s, __n);} in assign() argument
154 _BString& assign(size_type __n, _CharT __c) {return _M_get_storage().assign(__n, __c);} in assign() argument
162 …_BString& insert(size_type __pos, size_type __n, _CharT __c) {return _M_get_storage().insert(__pos… in insert() argument
[all …]
H A Dchar_traits.h147 for (size_t __i = 0; __i < __n; ++__i) in compare()
161 for ( ; __n > 0 ; ++__s, --__n) in find()
171 return (__n == 0 ? __s1 : in copy()
172 (char_type*)memcpy(__s1, __s2, __n * sizeof(char_type))); in copy()
176 for (size_t __i = 0; __i < __n; ++__i) in assign()
226 { return memcmp(__s1, __s2, __n); } in compare()
235 memset(__s, __c, __n); in assign()
249 { return wmemmove(__dest, __src, __n); } in move()
253 { return wmemcpy(__dest, __src, __n); } in copy()
257 { return wmemcmp(__s1, __s2, __n); } in compare()
[all …]
H A D_pthread_alloc.h130 if (__n > max_size()) {
133 if (__n != 0) {
145 void deallocate(pointer __p, size_type __n) { in deallocate() argument
146 _STLP_ASSERT( (__p == 0) == (__n == 0) ) in deallocate()
169 if (__n > max_size()) { in allocate()
172 if (__n != 0) { in allocate()
313 if (__n > max_size()) {
316 if (__n != 0) {
329 _STLP_ASSERT( (__p == 0) == (__n == 0) )
355 if (__n > max_size()) {
[all …]
H A D_sstream.c179 if (__avail > __n) { in xsputn()
182 return __n; in xsputn()
186 __n -= __avail; in xsputn()
205 __nwritten += __n; in xsputn()
222 if (__avail > __n) { in _M_xsputnc()
225 return __n; in _M_xsputnc()
230 __n -= __avail; in _M_xsputnc()
263 if (__n > 0) { in setbuf()
373 if (__n < 0 || __n > this->egptr() - this->eback()) in seekpos()
379 if (__n < 0 || size_t(__n) > _M_str.size()) in seekpos()
[all …]
H A D_unordered_set.h93 : _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()
167 local_iterator end(size_type __n) { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
168 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
169 const_local_iterator end(size_type __n) const { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
313 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
316 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
317 local_iterator end(size_type __n) { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
318 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_uninitialized.h86 for (_Distance __n = __last - __first; __n > 0; --__n) { in __ucopy() local
249 for (_Distance __n = __last - __first; __n > 0; --__n, ++__cur) in __ufill() local
288 for ( ; __n > 0; --__n, ++__cur) in __ufill_n()
298 { return __ufill_n(__first, __n, __x); } in __ufill_n()
304 { return __ufill_n(__first, __n, __x); } in __ufill_n()
309 { return __ufill_n(__first, __n, __x); } in __ufill_n()
314 _ForwardIter __last = __first + __n; in __uninitialized_fill_n()
322 { return __uninitialized_fill_n(__first, __n, __x); } in __ufill_n()
337 return __first + __n; in __uinit_aux_aux()
343 { return __first + __n; } in __uinit_aux()
[all …]
H A 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
143 { return this->setbuf(__s, __n); } in pubsetbuf()
165 virtual streamsize xsgetn(char_type* __s, streamsize __n);
204 streamsize sputn(const char_type* __s, streamsize __n) in sputn() argument
205 { return this->xsputn(__s, __n); } in sputn()
208 streamsize _M_sputnc(char_type __c, streamsize __n) in _M_sputnc() argument
209 { return this->_M_xsputnc(__c, __n); } in _M_sputnc()
238 streamsize sgetn(char_type* __s, streamsize __n) in sgetn() argument
[all …]
H A D_unordered_map.h99 : _M_ht(__n, __hf, __eql, __a) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
177 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
180 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
181 local_iterator end(size_type __n) { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
182 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
183 const_local_iterator end(size_type __n) const { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
337 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
340 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
341 local_iterator end(size_type __n) { return _M_ht.end(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
342 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_deque.c82 for (_Tp** __n = __nstart; __n < __nfinish; ++__n) in _M_destroy_nodes() local
155 size_type __n = __last - __first; in insert() local
183 size_type __n = __last - __first; in insert() local
262 difference_type __n = __last - __first; in _M_erase() local
288 iterator __new_start = this->_M_start + __n; in _M_erase()
316 iterator __new_finish = this->_M_finish - __n; in _M_erase()
326 difference_type __n = __last - __first; in _M_erase() local
330 iterator __new_start = this->_M_start + __n; in _M_erase()
337 iterator __new_finish = this->_M_finish - __n; in _M_erase()
523 __pos -= difference_type(__n); in _M_fill_insert_aux()
[all …]
/reactos/sdk/lib/3rdparty/stlport/src/
H A Dallocators.cpp148 __result = malloc(__n); in allocate()
319 __n = _S_round_up(__n); in _M_allocate()
331 __r = _S_refill(__n); in _M_allocate()
485 __n = _S_round_up(__n); in _M_allocate()
488 { __r = _S_refill(__n); } in _M_allocate()
996 if (__n > _MAX_BYTES) { in allocate()
1000 __n = _S_round_up(__n); in allocate()
1020 if (__n > _MAX_BYTES) { in deallocate()
1039 if (__n > _MAX_BYTES) { in allocate()
1042 __n = _S_round_up(__n); in allocate()
[all …]
/reactos/sdk/include/c++/stlport/stl/debug/
H A D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
60 if (__n == 0) in _M_append_fast_pos()
65 size_type __pos, size_type __n) in _M_append_fast_pos() argument
68 size_type __pos, size_type __n) in _M_append_fast_pos() argument
71 size_type __pos, size_type __n) in _M_append_fast_pos() argument
72 { return _M_append_fast_pos(__s.b_str(), __str, __pos, __n); } in _M_append_fast_pos()
82 if (__n == 0) { in _M_append_fast_pos()
87 if (__n < (__lhs_size - __pos)) { in _M_append_fast_pos()
88 return _M_append_fast_pos(__s.getLhs(), __str, __pos, __n); in _M_append_fast_pos()
91 0, __n - (__lhs_size - __pos)); in _M_append_fast_pos()
[all …]
H A D_string.h199 if (__n > capacity()) in resize()
201 else if (__n < size()) in resize()
203 _M_non_dbg_impl.resize(__n, __c); in resize()
205 void resize(size_type __n) { resize(__n, _STLP_DEFAULT_CONSTRUCTED(_CharT)); } in resize() argument
222 return _M_non_dbg_impl[__n];
227 return _M_non_dbg_impl[__n];
230 const_reference at(size_type __n) const { return _M_non_dbg_impl.at(__n); } in at() argument
231 reference at(size_type __n) { return _M_non_dbg_impl.at(__n); } in at() argument
291 _M_non_dbg_impl.append(__s, __n); in append()
307 _M_non_dbg_impl.append(__n, __c); in append()
[all …]

1234