/haiku/headers/cpp/ |
H A D | stl_set.h | 65 typedef typename _Rep_type::const_iterator iterator; typedef in class:set 122 iterator begin() const { return _M_t.begin(); } 123 iterator end() const { return _M_t.end(); } 132 pair<iterator,bool> insert(const value_type& __x) { 133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x); 134 return pair<iterator, bool>(__p.first, __p.second); 136 iterator insert(iterator __position, const value_type& __x) { 137 typedef typename _Rep_type::iterator _Rep_iterator; 153 void erase(iterator __positio [all...] |
H A D | stl_list.h | 51 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in struct:_List_iterator 67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {} 266 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in class:list 271 typedef reverse_iterator<iterator> reverse_iterator; 276 typedef reverse_bidirectional_iterator<iterator,value_type,reference, 312 iterator begin() { return (_Node*)(_M_node->_M_next); } 315 iterator end() { return _M_node; } 343 iterator insert(iterator __position, const _Tp& __x) { 351 iterator inser [all...] |
H A D | stl_multiset.h | 65 typedef typename _Rep_type::const_iterator iterator; typedef in class:multiset 128 iterator begin() const { return _M_t.begin(); } 129 iterator end() const { return _M_t.end(); } 138 iterator insert(const value_type& __x) { 141 iterator insert(iterator __position, const value_type& __x) { 142 typedef typename _Rep_type::iterator _Rep_iterator; 159 void erase(iterator __position) { 160 typedef typename _Rep_type::iterator _Rep_iterator; 166 void erase(iterator __firs [all...] |
H A D | stl_deque.h | 35 * For any nonsingular iterator i: 42 * pointer, even if i is a past-the-end iterator. 100 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in struct:_Deque_iterator 107 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in struct:_Deque_iterator::_Deque_iterator 132 _Deque_iterator(const iterator& __x) 344 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in class:_Deque_iterator::_Deque_base 361 iterator _M_start; 362 iterator _M_finish; 371 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator; typedef in class:_Deque_iterator::_Deque_base 374 typedef _Deque_iterator<_Tp,_Tp&,_Tp*> iterator; 495 typedef typename _Base::iterator iterator; typedef in class:_Deque_iterator::deque [all...] |
H A D | stl_bvector.h | 78 typedef _Bit_iterator iterator; typedef in struct:_Bit_iterator 99 iterator& operator++() { 103 iterator operator++(int) { 104 iterator __tmp = *this; 108 iterator& operator--() { 112 iterator operator--(int) { 113 iterator __tmp = *this; 117 iterator& operator+=(difference_type __i) { 128 iterator& operator-=(difference_type __i) { 132 iterator operato 388 typedef _Bit_iterator iterator; typedef in class:vector [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | VirtualDir.cpp | 243 for (VirtualDirIterator* iterator = fIterators.First(); 244 iterator; 245 iterator = fIterators.GetNext(iterator)) { 246 if (iterator->GetCurrentEntry() == entry) 247 iterator->NextEntry(); 298 VirtualDir::AddDirIterator(VirtualDirIterator* iterator) argument 300 if (!iterator) 303 fIterators.Insert(iterator); 308 VirtualDir::RemoveDirIterator(VirtualDirIterator* iterator) argument [all...] |
H A D | QueryIterator.h | 64 QueryIterator* iterator) const 66 return &iterator->fVolumeLink; 70 const QueryIterator* iterator) const 72 return &iterator->fVolumeLink;
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | NameIndex.cpp | 189 Iterator* iterator = new(std::nothrow) Iterator; local 190 if (iterator != NULL) { 191 if (!iterator->SetTo(this, NULL, true)) { 192 delete iterator; 193 iterator = NULL; 196 return iterator; 220 Iterator* iterator = new(std::nothrow) Iterator; local 221 if (iterator != NULL) { 222 if (!iterator->SetTo(this, (const char*)key)) { 223 delete iterator; [all...] |
H A D | Index.cpp | 51 Index::GetIterator(IndexIterator& iterator) argument 54 iterator.SetIterator(actualIterator); 61 Index::Find(const void* key, size_t length, IndexIterator& iterator) argument 65 iterator.SetIterator(actualIterator); 139 IndexIterator::SetIterator(AbstractIndexIterator* iterator) argument 142 fIterator = iterator;
|
H A D | LastModifiedIndex.cpp | 220 Iterator* iterator = it.Next();) { 221 iterator->NodeChangeBegin(node); 235 Iterator* iterator = it.Next();) { 236 iterator->NodeChangeEnd(node); 249 Iterator* iterator = new(std::nothrow) Iterator; local 250 if (iterator != NULL) { 251 if (!iterator->SetTo(this, 0, true)) { 252 delete iterator; 253 iterator = NULL; 256 return iterator; 277 _AddIteratorToUpdate(Iterator* iterator) argument [all...] |
H A D | SizeIndex.cpp | 218 Iterator* iterator = it.Next();) { 219 iterator->NodeChangeBegin(node); 233 Iterator* iterator = it.Next();) { 234 iterator->NodeChangeEnd(node); 247 Iterator* iterator = new(std::nothrow) Iterator; local 248 if (iterator != NULL) { 249 if (!iterator->SetTo(this, 0, true)) { 250 delete iterator; 251 iterator = NULL; 254 return iterator; 275 _AddIteratorToUpdate(Iterator* iterator) argument [all...] |
H A D | AttributeIndex.cpp | 346 Iterator* iterator = it.Next();) { 347 iterator->NodeChangeBegin(node); 363 Iterator* iterator = it.Next();) { 364 iterator->NodeChangeEnd(node); 383 Iterator* iterator = new(std::nothrow) Iterator; local 384 if (iterator != NULL) { 385 if (!iterator->SetTo(this, TreeKey(), true)) { 386 delete iterator; 387 iterator = NULL; 390 return iterator; 412 _AddIteratorToUpdate(Iterator* iterator) argument [all...] |
/haiku/src/system/boot/loader/file_systems/bfs/ |
H A D | Directory.cpp | 101 TreeIterator *iterator = (TreeIterator *)cookie; local 105 return iterator->GetNextEntry(name, &length, size, &id); 112 TreeIterator *iterator = (TreeIterator *)cookie; local 117 status_t status = iterator->GetNextEntry(name, &length, sizeof(name), &id); 132 TreeIterator *iterator = (TreeIterator *)cookie; local 134 return iterator->Rewind(); 141 TreeIterator iterator(&fTree); 151 while (iterator.GetNextEntry(name, &length, B_FILE_NAME_LENGTH, &id)
|
/haiku/src/tests/system/kernel/util/ |
H A D | DoublyLinkedListTest.cpp | 111 iterator = list.GetIterator(); local 112 while (iterator.Next() != NULL) 119 iterator = list.GetIterator(); 123 while ((item = iterator.Next()) != NULL) { 137 iterator = list.GetIterator(); 139 while ((item = iterator.Next()) != NULL) { 154 iterator = list.GetIterator(); 155 while (iterator.Next() != NULL)
|
/haiku/src/servers/app/font/ |
H A D | FontCache.cpp | 125 FontMap::Iterator iterator = fFontCacheEntries.GetIterator(); 128 // some entries, so using the iterator like that should be ok 129 FontCacheEntry* leastUsedEntry = iterator.Next().value; 136 while (iterator.HasNext()) { 137 FontCacheEntry* entry = iterator.Next().value; 148 iterator = fFontCacheEntries.GetIterator(); 149 while (iterator.HasNext()) { 150 if (iterator.Next().value.Get() == leastUsedEntry) { 151 fFontCacheEntries.Remove(iterator);
|
/haiku/src/servers/registrar/mime/ |
H A D | RegistrarThreadManager.h | 39 std::list<RegistrarThread*>::iterator& 40 RemoveThread(std::list<RegistrarThread*>::iterator &i);
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Index.cpp | 44 Index::GetIterator(IndexEntryIterator *iterator) argument 47 if (iterator) { 50 iterator->SetIterator(actualIterator); 59 Index::Find(const uint8 *key, size_t length, IndexEntryIterator *iterator) argument 62 if (key && iterator) { 66 iterator->SetIterator(actualIterator); 164 IndexEntryIterator::SetIterator(AbstractIndexEntryIterator *iterator) argument 168 fIterator = iterator;
|
H A D | AttributeIndexImpl.cpp | 211 for (Iterator *iterator = fIterators->First(); 212 iterator; 213 iterator = fIterators->GetNext(iterator)) { 214 iterator->SetTo(NULL, NULL, 0); 251 for (Iterator *iterator = fIterators->First(); 252 iterator; 253 iterator = fIterators->GetNext(iterator)) { 254 if (iterator 312 Iterator *iterator = new(nothrow) Iterator; local 340 _AddIterator(Iterator *iterator) argument 347 _RemoveIterator(Iterator *iterator) argument [all...] |
/haiku/src/servers/media/ |
H A D | MediaFilesManager.cpp | 80 TypeMap::iterator iterator = fMap.begin(); local 81 for (; iterator != fMap.end(); iterator++) { 82 const BString& type = iterator->first; 83 ItemMap& itemMap = iterator->second; 90 ItemMap::iterator itemIterator = itemMap.begin(); 129 TypeMap::iterator iterator = fMap.begin(); local 130 for (; iterator ! 173 TypeMap::iterator iterator = fMap.begin(); local 214 ItemMap::iterator iterator = itemMap.begin(); local [all...] |
/haiku/src/bin/rc/ |
H A D | private.h | 30 typedef ptr_list_t::iterator ptr_iter_t;
|
/haiku/src/servers/launch/ |
H A D | Job.cpp | 79 PortMap::iterator iterator = fPortMap.begin(); local 80 for (; iterator != fPortMap.end(); iterator++) 81 iterator->second.RemoveData("port"); 339 PortMap::iterator iterator = fPortMap.begin(); local 340 for (; iterator != fPortMap.end(); iterator++) { 342 if (iterator 513 PortMap::const_iterator iterator = Ports().begin(); local [all...] |
/haiku/src/add-ons/kernel/bluetooth/btCoreData/ |
H A D | ConnectionInterface.cpp | 110 DoublyLinkedList<HciConnection>::Iterator iterator local 113 while (iterator.HasNext()) { 115 conn = iterator.Next(); 141 DoublyLinkedList<HciConnection>::Iterator iterator local 143 while (iterator.HasNext()) { 145 conn = iterator.Next(); 170 DoublyLinkedList<HciConnection>::Iterator iterator local 172 while (iterator.HasNext()) { 174 conn = iterator.Next(); 190 DoublyLinkedList<HciConnection>::Iterator iterator local 209 DoublyLinkedList<HciConnection>::Iterator iterator local [all...] |
/haiku/src/kits/translation/ |
H A D | TranslatorRoster.cpp | 191 TranslatorMap::iterator iterator = fTranslators.begin(); local 194 while (iterator != fTranslators.end()) { 195 BTranslator* translator = iterator->second.translator; 197 images.insert(iterator->second.image); 200 iterator++; 678 MessengerList::iterator iterator = fMessengers.begin(); local 680 while (iterator != fMessengers.end()) { 681 if (*iterator 701 TranslatorMap::const_iterator iterator = fTranslators.begin(); local 725 TranslatorMap::const_iterator iterator = fTranslators.begin(); local 873 TranslatorMap::iterator iterator = fTranslators.find(id); local 921 EntryRefSet::iterator iterator = fRescanEntries.begin(); local 962 TranslatorMap::const_iterator iterator = fTranslators.find(id); local 1051 NodeRefList::const_iterator iterator = fDirectories.begin(); local 1069 NodeRefList::const_iterator iterator = fDirectories.begin(); local 1157 MessengerList::const_iterator iterator = fMessengers.begin(); local [all...] |
/haiku/src/servers/media_addon/ |
H A D | MediaAddonServer.cpp | 230 FileMap::iterator iterator = fFileMap.begin(); local 231 for (; iterator != fFileMap.end(); iterator++) 232 gDormantNodeManager->UnregisterAddOn(iterator->second); 301 InfoMap::iterator iterator = fInfoMap.begin(); local 302 for (; iterator != fInfoMap.end(); iterator++) 303 _InstantiatePhysicalInputsAndOutputs(iterator 321 InfoMap::iterator iterator = fInfoMap.begin(); local 607 NodeVector::iterator iterator = info.active_flavors.begin(); local [all...] |
/haiku/headers/private/storage/ |
H A D | AddOnMonitorHandler.h | 91 EntryList::iterator& it) const; 94 EntryList::iterator& it) const; 102 DirectoryList::iterator& it) const; 105 DirectoryList::iterator& it) const; 107 DirectoryList::iterator& it, 112 DirectoryList::iterator& it,
|