/external/tinyxml/ |
H A D | tinystr.h | 56 typedef unsigned int size_type; typedef in class:TiXmlString 59 static const size_type npos; // = -1; 77 init( static_cast<size_type>( strlen(copy) )); 82 TiXmlString (const char * str, size_type len) 97 return assign( copy, (size_type)strlen(copy)); 110 return append(suffix, static_cast<size_type>( strlen(suffix) )); 133 size_type length () const { return rep_->size; } 136 size_type size () const { return rep_->size; } 142 size_type capacity () const { return rep_->capacity; } 146 const char& at (size_type inde [all...] |
/external/stlport/stlport/stl/ |
H A D | _alloc.h | 282 typedef size_t size_type; typedef in class:allocator 301 _Tp* allocate(size_type __n, const void* = 0) { 306 size_type __buf_size = __n * sizeof(value_type); 317 void deallocate(pointer __p, size_type __n) { 330 size_type max_size() const _STLP_NOTHROW { return size_t(-1) / sizeof(value_type); } 341 _Tp* _M_allocate(size_type __n, size_type& __allocated_n) { 347 size_type __buf_size = __n * sizeof(value_type); 366 typedef size_t size_type; typedef in class:allocator 475 typedef typename _Base::size_type size_typ typedef in class:_STLP_alloc_proxy [all...] |
H A D | _bvector.h | 176 typedef size_t size_type; typedef in struct:_Bit_iter 367 typedef size_t size_type; typedef in class:__BVECTOR_QUALIFIED 390 void _M_initialize(size_type __n) { 404 size_type __len = size() ? 2 * size() : _STLP_WORD_BIT; 429 size_type __n = _STLP_STD::distance(__first, __last); 449 size_type __n = _STLP_STD::distance(__first, __last); 457 size_type __len = size() + (max)(size(), __n); 486 size_type size() const { return size_type(end() - begin()); } 487 size_type max_siz [all...] |
H A D | _deque.c | 99 # define size_type size_t macro 108 const size_type __len = size(); 123 size_type __n, const value_type& __x) { 155 size_type __n = __last - __first; 183 size_type __n = __last - __first; 211 if (size_type(__index) < this->size() >> 1) { 248 if (size_type(__index) < this->size() >> 1) { 464 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, 468 size_type __length = this->size(); 506 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __ 816 #undef size_type macro [all...] |
H A D | _deque.h | 94 typedef size_t size_type; typedef in struct:_Deque_iterator_base 167 typedef size_t size_type; typedef in struct:_Deque_iterator 413 typedef size_t size_type; typedef in class:deque 444 reference operator[](size_type __n) 446 const_reference operator[](size_type __n) const 449 void _M_range_check(size_type __n) const { 453 reference at(size_type __n) 455 const_reference at(size_type __n) const 471 size_type size() const { return this->_M_finish - this->_M_start; } 472 size_type max_siz [all...] |
H A D | _hash_map.h | 68 typedef typename _Ht::size_type size_type; typedef in class:hash_map 89 explicit hash_map(size_type __n) 91 hash_map(size_type __n, const hasher& __hf) 93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, 109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) 113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 119 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 125 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 135 hash_map(const value_type* __f, const value_type* __l, size_type __ 259 typedef typename _Ht::size_type size_type; typedef in class:hash_multimap [all...] |
H A D | _hash_set.h | 62 typedef typename _Ht::size_type size_type; typedef in class:hash_set 85 explicit hash_set(size_type __n) 87 hash_set(size_type __n, const hasher& __hf) 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) 95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, 111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) 115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, 120 hash_set(_InputIterator __f, _InputIterator __l, size_type __ 248 typedef typename _Ht::size_type size_type; typedef in class:hash_multiset [all...] |
H A D | _hashtable.c | 111 # define size_type size_t macro 121 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::size_type 148 ::_M_before_begin(size_type &__n) const { 157 size_type &__n) { 183 ::_M_insert_noresize(size_type __n, const value_type& __obj) { 186 size_type __prev = __n; 200 const size_type __n = _M_bkt_num(__obj); 231 const size_type __n = _M_bkt_num(__obj); 264 const size_type __n = _M_bkt_num_key(__key); 271 size_type __erase 537 #undef size_type macro [all...] |
H A D | _hashtable.h | 119 typedef size_t size_type; typedef in struct:_Ht_iterator 238 typedef size_t size_type; typedef in class:hashtable 278 size_type _M_num_elements; 303 hashtable(size_type __n, 308 hashtable(size_type __n, 319 hashtable(size_type __n, 363 size_type size() const { return _M_num_elements; } 364 size_type max_size() const { return size_type(-1); } 378 local_iterator begin(size_type __ [all...] |
H A D | _iostream_string.h | 51 typedef typename _Base::size_type size_type; typedef in class:__iostring_allocator 63 _CharT* allocate(size_type __n, const void* __ptr = 0) { 69 void deallocate(pointer __p, size_type __n) {
|
H A D | _list.c | 83 # define size_type size_t macro 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) { 97 size_type __len = 0; 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
|
H A D | _list.h | 83 typedef size_t size_type; typedef in struct:_List_iterator_base 110 typedef size_t size_type; typedef in struct:_List_iterator 268 typedef size_t size_type; typedef in class:list 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 309 explicit list(size_type __n) 312 list(size_type __n, const_reference __val) 315 list(size_type __n, const_reference __val, const allocator_type& __a) 379 size_type size() const { 380 size_type __result = _STLP_STD::distance(begin(), end()); 383 size_type max_siz [all...] |
H A D | _map.h | 89 typedef typename _Rep_type::size_type size_type; typedef in class:map 172 size_type size() const { return _M_t.size(); } 173 size_type max_size() const { return _M_t.max_size(); } 204 size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } 214 size_type count(const _KT& __x) const { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } 282 typedef typename _Rep_type::size_type size_type; typedef in class:multimap 358 size_type size() const { return _M_t.size(); } 359 size_type max_siz [all...] |
H A D | _pthread_alloc.h | 100 typedef size_t size_type; typedef in class:pthread_allocator 129 _Tp* allocate(size_type __n, const void* = 0) { 134 size_type __buf_size = __n * sizeof(value_type); 145 void deallocate(pointer __p, size_type __n) { 155 size_type max_size() const _STLP_NOTHROW 168 _Tp* allocate(size_type __n, size_type& __allocated_n) { 173 size_type __buf_size = __n * sizeof(value_type); 192 typedef size_t size_type; typedef in class:pthread_allocator 281 typedef size_t size_type; typedef in class:per_thread_allocator 375 typedef size_t size_type; typedef in class:per_thread_allocator [all...] |
H A D | _queue.h | 76 typedef typename _Sequence::size_type size_type; typedef in class:queue 95 size_type size() const { return c.size(); } 160 typedef typename _Sequence::size_type size_type; typedef in class:priority_queue 221 size_type size() const { return c.size(); }
|
H A D | _rope.c | 362 # define size_type size_t macro 909 size_type __result_pos = __start + __c._M_count; 1123 rope<_CharT,_Alloc>::_S_fetch(_RopeRep* __r, size_type __i) 1170 rope<_CharT,_Alloc>::_S_fetch_ptr(_RopeRep* __r, size_type __i) 1399 # undef size_type macro
|
H A D | _rope.h | 1094 typedef size_t size_type; typedef in class:rope 1142 static _CharT _S_fetch(_RopeRep* __r, size_type __pos); 1150 static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos); 1559 size_type copy(size_type __pos, size_type __n, _CharT* __buffer) const { 1599 _CharT operator[] (size_type __pos) const { 1603 _CharT at(size_type __pos) const { 1625 size_type size() const { 1629 size_type lengt [all...] |
H A D | _set.h | 77 typedef typename _Rep_type::size_type size_type; typedef in class:set 160 size_type size() const { return _M_t.size(); } 161 size_type max_size() const { return _M_t.max_size(); } 183 size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } 193 size_type count(const _KT& __x) const 248 typedef typename _Rep_type::size_type size_type; typedef in class:multiset 331 size_type size() const { return _M_t.size(); } 332 size_type max_siz [all...] |
H A D | _slist.c | 35 # define size_type size_t macro 91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { 106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) { 223 # undef size_type macro
|
H A D | _slist.h | 66 typedef size_t size_type; typedef in struct:_Slist_iterator_base 86 typedef size_t size_type; typedef in class:_Slist_iterator 235 typedef size_t size_type; typedef in class:slist 289 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp), 292 explicit slist(size_type __n) 295 slist(size_type __n, const value_type& __x) 298 slist(size_type __n, const value_type& __x, const allocator_type& __a) 348 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } 351 void _M_fill_assign(size_type __n, const _Tp& __val); 365 _M_fill_assign((size_type) __ [all...] |
H A D | _stack.h | 65 typedef typename _Sequence::size_type size_type; typedef in class:stack 83 size_type size() const { return c.size(); }
|
H A D | _string.c | 47 # define size_type size_t macro 50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::size_type 158 void basic_string<_CharT,_Traits,_Alloc>::reserve(size_type __res_arg) { 162 size_type __n = (max)(__res_arg, size()) + 1; 170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { 180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { 198 size_type __n = __STATIC_CAST(size_type, __last - __first); 200 size_type __len = _M_compute_next_size(__n); 222 basic_string<_CharT,_Traits,_Alloc>::assign(size_type __ 665 # undef size_type macro [all...] |
H A D | _string.h | 138 typedef typename _Base::size_type size_type; typedef in class:basic_string 183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, 186 basic_string(const _Self& __s, size_type __pos) 193 basic_string(const _Self& __s, size_type __pos, size_type __n) 201 basic_string(const _Self& __s, size_type __pos, size_type __n, 213 basic_string(const _CharT* __s, size_type __ [all...] |
H A D | _string_base.h | 51 typedef size_t size_type; typedef in class:_String_base 71 size_type _M_capacity() const 72 { return _M_using_static_buf() ? static_cast<size_type>(_DEFAULT_SIZE) : _M_buffers._M_end_of_storage - _M_start_of_storage._M_data; } 73 size_type _M_rest() const 80 size_type _M_capacity() const 82 size_type _M_rest() const 105 const size_type __string_max_size = size_type(-1) / sizeof(_Tp); 106 typename allocator_type::size_type __alloc_max_size = _M_start_of_storage.max_size();
|
H A D | _string_io.c | 33 typedef typename basic_string<_CharT, _Traits, _Alloc>::size_type size_type; typedef 35 // The hypothesis of this implementation is that size_type is unsigned: 36 _STLP_STATIC_ASSERT(__STATIC_CAST(size_type, -1) > 0) 43 size_type __n = __s.size(); 72 typedef typename basic_string<_CharT, _Traits, _Alloc>::size_type size_type; typedef 74 // The hypothesis of this implementation is that size_type is unsigned: 75 _STLP_STATIC_ASSERT(__STATIC_CAST(size_type, -1) > 0) 87 size_type __ 137 typedef typename basic_string<_CharT, _Traits, _Alloc>::size_type size_type; typedef [all...] |