/haiku/headers/cpp/std/ |
H A D | bastring.h | 149 typedef size_t size_type; typedef in class:basic_string 159 static const size_type npos = static_cast<size_type>(-1); 168 size_type length () const 170 size_type size () const 172 size_type capacity () const 174 size_type max_size () const 188 basic_string (const basic_string& _str, size_type pos, size_type n = npos) 190 basic_string (const charT* s, size_type [all...] |
H A D | bastring.cc | 86 check_realloc (basic_string::size_type s) const 97 alloc (basic_string::size_type __size, bool __save) 118 replace (size_type pos1, size_type n1, 119 const basic_string& _str, size_type pos2, size_type n2) 153 replace (size_type pos, size_type n1, const charT* s, size_type n2) 155 const size_type le [all...] |
/haiku/src/build/libroot/ |
H A D | fs.cpp | 281 string::size_type pos = normalizedPath.rfind('/');
|
/haiku/src/build/libbe/support/ |
H A D | Archivable.cpp | 266 string::size_type pos = 0; 267 string::size_type oldpos = 0;
|
/haiku/src/apps/mediaplayer/playlist/ |
H A D | FilePlaylistItem.cpp | 58 for (vector<entry_ref>::size_type i = 0; i < fRefs.size(); i++) { 95 for (vector<entry_ref>::size_type i = 0; i < fRefs.size(); i++) { 345 for (vector<entry_ref>::size_type i = 0; i < fRefs.size(); i++) { 355 for (vector<entry_ref>::size_type i = 0; i < fImageRefs.size(); i++) { 519 for (vector<entry_ref>::size_type i = 0; i < refs->size(); i++) { 574 for (vector<entry_ref>::size_type i = 0; i < refs->size(); i++) {
|
/haiku/src/kits/support/ |
H A D | Archivable.cpp | 127 string::size_type pos = 0; 128 string::size_type oldpos = 0;
|
/haiku/headers/cpp/ |
H A D | stl_vector.h | 167 typedef size_t size_type; typedef in class:vector 211 size_type size() const 212 { return size_type(end() - begin()); } 213 size_type max_size() const 214 { return size_type(-1) / sizeof(_Tp); } 215 size_type capacity() const 216 { return size_type(_M_end_of_storage - begin()); } 220 reference operator[](size_type __n) { return *(begin() + __n); } 221 const_reference operator[](size_type __n) const { return *(begin() + __n); } 223 reference at(size_type __ [all...] |
H A D | defalloc.h | 70 typedef size_t size_type; typedef in class:allocator 72 pointer allocate(size_type n) { 80 size_type init_page_size() { 81 return max(size_type(1), size_type(4096/sizeof(T))); 83 size_type max_size() const { 84 return max(size_type(1), size_type(UINT_MAX/sizeof(T)));
|
H A D | pthread_alloc | 371 typedef size_t size_type; 394 _Tp* allocate(size_type __n, const void* = 0) { 400 void deallocate(pointer __p, size_type __n) 403 size_type max_size() const __STL_NOTHROW 413 typedef size_t size_type;
|
H A D | ropeimpl.h | 953 size_type __result_pos = __start + __c._M_count; 1184 rope<_CharT,_Alloc>::_S_fetch(_RopeRep* __r, size_type __i) 1229 rope<_CharT,_Alloc>::_S_fetch_ptr(_RopeRep* __r, size_type __i)
|
H A D | stl_alloc.h | 736 typedef size_t size_type; typedef in class:allocator 758 _Tp* allocate(size_type __n, const void* = 0) { 764 void deallocate(pointer __p, size_type __n) 767 size_type max_size() const __STL_NOTHROW 776 typedef size_t size_type; typedef in class:allocator 811 typedef size_t size_type; typedef in struct:__allocator 835 _Tp* allocate(size_type __n, const void* = 0) { 842 void deallocate(pointer __p, size_type __n) 845 size_type max_size() const __STL_NOTHROW 854 typedef size_t size_type; [all...] |
H A D | stl_bvector.h | 381 typedef size_t size_type; typedef in class:vector 414 void _M_initialize(size_type __n) { 427 size_type __len = size() ? 2 * size() : __WORD_BIT; 452 size_type __n = 0; 473 size_type __n = 0; 481 size_type __len = size() + max(size(), __n); 510 size_type size() const { return size_type(end() - begin()); } 511 size_type max_size() const { return size_type( [all...] |
H A D | stl_deque.h | 117 typedef size_t size_type; typedef in struct:_Deque_iterator::_Deque_iterator 488 typedef size_t size_type; typedef in class:_Deque_iterator::deque 543 reference operator[](size_type __n) 545 const_reference operator[](size_type __n) const 561 size_type size() const { return _M_finish - _M_start;; } 562 size_type max_size() const { return size_type(-1); } 570 deque(size_type __n, const value_type& __value, 573 explicit deque(size_type __n) : _Base(allocator_type(), __n) 614 const size_type __le [all...] |
H A D | stl_hash_map.h | 65 typedef typename _Ht::size_type size_type; typedef in class:hash_map 83 explicit hash_map(size_type __n) 85 hash_map(size_type __n, const hasher& __hf) 87 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, 97 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) 101 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 106 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 116 hash_map(const value_type* __f, const value_type* __l, size_type __n) 119 hash_map(const value_type* __f, const value_type* __l, size_type __ 248 typedef typename _Ht::size_type size_type; typedef in class:hash_multimap [all...] |
H A D | stl_hash_set.h | 62 typedef typename _Ht::size_type size_type; typedef in class:hash_set 81 explicit hash_set(size_type __n) 83 hash_set(size_type __n, const hasher& __hf) 85 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, 95 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) 99 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, 104 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, 114 hash_set(const value_type* __f, const value_type* __l, size_type __n) 117 hash_set(const value_type* __f, const value_type* __l, size_type __ 241 typedef typename _Ht::size_type size_type; typedef in class:hash_multiset [all...] |
H A D | stl_hashtable.h | 84 typedef size_t size_type; typedef in struct:_Hashtable_iterator 123 typedef size_t size_type; typedef in struct:_Hashtable_const_iterator 194 typedef size_t size_type; typedef in class:hashtable 232 size_type _M_num_elements; 247 hashtable(size_type __n, 262 hashtable(size_type __n, 303 size_type size() const { return _M_num_elements; } 304 size_type max_size() const { return size_type(-1); } 318 for (size_type __ [all...] |
H A D | stl_list.h | 60 typedef size_t size_type; typedef in struct:_List_iterator 259 typedef size_t size_type; typedef in class:list 329 size_type size() const { 330 size_type __result = 0; 334 size_type max_size() const { return size_type(-1); } 358 insert(__pos, (size_type) __n, (_Tp) __x); 377 void insert(iterator __pos, size_type __n, const _Tp& __x); 396 void resize(size_type __new_size, const _Tp& __x); 397 void resize(size_type __new_siz [all...] |
H A D | stl_map.h | 84 typedef typename _Rep_type::size_type size_type; typedef in class:map 148 size_type size() const { return _M_t.size(); } 149 size_type max_size() const { return _M_t.max_size(); } 180 size_type erase(const key_type& __x) { return _M_t.erase(__x); } 189 size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
H A D | stl_multimap.h | 83 typedef typename _Rep_type::size_type size_type; typedef in class:multimap 145 size_type size() const { return _M_t.size(); } 146 size_type max_size() const { return _M_t.max_size(); } 169 size_type erase(const key_type& __x) { return _M_t.erase(__x); } 178 size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
H A D | stl_multiset.h | 69 typedef typename _Rep_type::size_type size_type; typedef in class:multiset 133 size_type size() const { return _M_t.size(); } 134 size_type max_size() const { return _M_t.max_size(); } 163 size_type erase(const key_type& __x) { 175 size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
H A D | stl_queue.h | 46 typedef typename _Sequence::size_type size_type; typedef in class:queue 58 size_type size() const { return c.size(); } 122 typedef typename _Sequence::size_type size_type; typedef in class:priority_queue 176 size_type size() const { return c.size(); }
|
H A D | stl_rope.h | 1267 typedef size_t size_type; typedef in class:rope 1339 static _CharT _S_fetch(_RopeRep* __r, size_type __pos); 1348 static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos); 1756 size_type copy(size_type __pos, size_type __n, _CharT* __buffer) const 1797 _CharT operator[] (size_type __pos) const { 1801 _CharT at(size_type __pos) const { 1823 size_type size() const { 1827 size_type lengt [all...] |
H A D | stl_set.h | 69 typedef typename _Rep_type::size_type size_type; typedef in class:set 127 size_type size() const { return _M_t.size(); } 128 size_type max_size() const { return _M_t.max_size(); } 157 size_type erase(const key_type& __x) { 169 size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
/haiku/src/tests/kits/app/bmessage/ |
H A D | MessageItemTest.h | 60 typedef typename ArrayType::size_type SizeType;
|
/haiku/src/apps/mediaplayer/supplier/ |
H A D | MediaFileTrackSupplier.cpp | 34 for (vector<BMediaFile*>::size_type i = fMediaFiles.size() - 1; 40 for (vector<BBitmap*>::size_type i = fBitmaps.size() - 1;
|