Searched refs:iterator (Results 76 - 100 of 453) sorted by relevance

1234567891011>>

/haiku-fatelf/src/system/boot/loader/file_systems/bfs/
H A DDirectory.cpp124 TreeIterator *iterator = (TreeIterator *)cookie; local
128 return iterator->GetNextEntry(name, &length, size, &id);
135 TreeIterator *iterator = (TreeIterator *)cookie; local
140 status_t status = iterator->GetNextEntry(name, &length, sizeof(name), &id);
155 TreeIterator *iterator = (TreeIterator *)cookie; local
157 return iterator->Rewind();
164 TreeIterator iterator(&fTree);
174 while (iterator.GetNextEntry(name, &length, B_FILE_NAME_LENGTH, &id)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/
H A DDirectory.h30 status_t OpenDir(DirIterator** iterator);
33 void RemoveDirIterator(DirIterator* iterator);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DAttributeIndexImpl.h41 void _AddIterator(Iterator *iterator);
42 void _RemoveIterator(Iterator *iterator);
H A DLastModifiedIndex.h36 void _AddIterator(Iterator *iterator);
37 void _RemoveIterator(Iterator *iterator);
H A DSizeIndex.h36 void _AddIterator(Iterator *iterator);
37 void _RemoveIterator(Iterator *iterator);
H A DIndex.h35 bool GetIterator(IndexEntryIterator *iterator);
37 IndexEntryIterator *iterator);
73 void SetIterator(AbstractIndexEntryIterator *iterator);
H A DNameIndex.cpp178 NameIndexEntryIterator *iterator = new(nothrow) NameIndexEntryIterator; local
179 if (iterator) {
180 if (!iterator->SetTo(this, NULL, true)) {
181 delete iterator;
182 iterator = NULL;
185 return iterator;
207 NameIndexEntryIterator *iterator = new(nothrow) NameIndexEntryIterator; local
208 if (iterator) {
209 if (!iterator->SetTo(this, (const char *)key)) {
210 delete iterator;
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DTwoKeyAVLTree.h253 Value *FindFirst(const PrimaryKey &key, Iterator *iterator = NULL);
254 Value *FindLast(const PrimaryKey &key, Iterator *iterator = NULL);
257 Iterator *iterator = NULL);
259 inline void GetIterator(Iterator *iterator);
261 inline status_t Insert(const Value &value, Iterator *iterator = NULL);
323 Iterator(const TreeMapIterator &iterator) argument
328 inline void _SetTo(const TreeMapIterator &iterator) argument
330 fIterator = iterator;
374 Iterator *iterator)
389 if (iterator)
373 FindFirst(const PrimaryKey &key, Iterator *iterator) argument
405 FindLast(const PrimaryKey &key, Iterator *iterator) argument
437 Find(const PrimaryKey &primaryKey, const SecondaryKey &secondaryKey, Iterator *iterator) argument
450 GetIterator(Iterator *iterator) argument
461 Insert(const Value &value, Iterator *iterator) argument
[all...]
H A DIndex.h35 bool GetIterator(IndexEntryIterator *iterator);
37 IndexEntryIterator *iterator);
73 void SetIterator(AbstractIndexEntryIterator *iterator);
H A DNameIndex.cpp178 NameIndexEntryIterator *iterator = new(nothrow) NameIndexEntryIterator; local
179 if (iterator) {
180 if (!iterator->SetTo(this, NULL, true)) {
181 delete iterator;
182 iterator = NULL;
185 return iterator;
207 NameIndexEntryIterator *iterator = new(nothrow) NameIndexEntryIterator; local
208 if (iterator) {
209 if (!iterator->SetTo(this, (const char *)key)) {
210 delete iterator;
[all...]
/haiku-fatelf/headers/cpp/
H A Dstl_map.h80 typedef typename _Rep_type::iterator iterator; typedef in class:map
139 iterator begin() { return _M_t.begin(); }
141 iterator end() { return _M_t.end(); }
151 iterator __i = lower_bound(__k);
161 pair<iterator,bool> insert(const value_type& __x)
163 iterator insert(iterator position, const value_type& __x)
179 void erase(iterator __position) { _M_t.erase(__position); }
181 void erase(iterator __firs
[all...]
H A Dstl_multimap.h79 typedef typename _Rep_type::iterator iterator; typedef in class:multimap
136 iterator begin() { return _M_t.begin(); }
138 iterator end() { return _M_t.end(); }
151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); }
152 iterator insert(iterator __position, const value_type& __x) {
168 void erase(iterator __position) { _M_t.erase(__position); }
170 void erase(iterator __first, iterator __las
[all...]
/haiku-fatelf/src/servers/registrar/
H A DWatchingService.cpp79 for (watcher_map::iterator it = fWatchers.begin();
148 watcher_map::iterator it = fWatchers.find(watcher->Target());
177 watcher_map::iterator it = fWatchers.find(target);
209 for (watcher_map::iterator it = fWatchers.begin();
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/client/
H A DQueryIterator.cpp128 while (QueryIterator* iterator = fSubIterators.First()) {
129 RemoveSubIterator(iterator);
130 subIterators.Insert(iterator);
H A DServerVolume.h40 QueryIterator** iterator);
41 virtual void FreeQueryIterator(QueryIterator* iterator);
42 virtual status_t ReadQuery(QueryIterator* iterator,
H A DShareNode.cpp471 for (LocalShareDirIterator* iterator = fIterators.First();
472 iterator;
473 iterator = fIterators.GetNext(iterator)) {
474 if (iterator->GetCurrentEntry() == entry)
475 iterator->NextEntry();
501 ShareDir::AddDirIterator(LocalShareDirIterator* iterator) argument
503 if (!iterator)
506 fIterators.Insert(iterator);
511 ShareDir::RemoveDirIterator(LocalShareDirIterator* iterator) argument
[all...]
H A DVirtualVolume.cpp90 // init a directory iterator
92 VirtualDirIterator iterator; local
93 iterator.SetDirectory(fRootNode, true);
98 while (iterator.GetCurrentEntry(&name, &node)) {
99 iterator.NextEntry();
110 // uninit the directory iterator
111 iterator.SetDirectory(NULL);
531 // allocate an iterator
532 VirtualDirIterator* iterator = new(std::nothrow) VirtualDirIterator;
533 if (!iterator)
559 VirtualDirIterator* iterator = (VirtualDirIterator*)cookie; local
575 VirtualDirIterator* iterator = (VirtualDirIterator*)cookie; local
613 VirtualDirIterator* iterator = (VirtualDirIterator*)cookie; local
754 HierarchicalQueryIterator* iterator local
807 FreeQueryIterator(QueryIterator* iterator) argument
817 HierarchicalQueryIterator* iterator local
[all...]
/haiku-fatelf/src/apps/debugger/model/
H A DTeamMemoryBlock.cpp47 ListenerList::Iterator iterator = fListeners.GetIterator(); local
48 while (iterator.HasNext()) {
49 if (iterator.Next() == listener)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/client/
H A DQueryIterator.cpp120 while (QueryIterator* iterator = fSubIterators.GetFirst()) {
121 RemoveSubIterator(iterator);
122 subIterators.Insert(iterator);
H A DServerVolume.h40 QueryIterator** iterator);
41 virtual void FreeQueryIterator(QueryIterator* iterator);
42 virtual status_t ReadQuery(QueryIterator* iterator,
H A DShareNode.cpp468 for (LocalShareDirIterator* iterator = fIterators.GetFirst();
469 iterator;
470 iterator = fIterators.GetNext(iterator)) {
471 if (iterator->GetCurrentEntry() == entry)
472 iterator->NextEntry();
498 ShareDir::AddDirIterator(LocalShareDirIterator* iterator) argument
500 if (!iterator)
503 fIterators.Insert(iterator);
508 ShareDir::RemoveDirIterator(LocalShareDirIterator* iterator) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/
H A DTwoKeyAVLTree.h281 Iterator* iterator = NULL);
283 bool less, Iterator* iterator = NULL);
285 Iterator* iterator = NULL);
288 Iterator* iterator = NULL);
290 inline void GetIterator(Iterator* iterator);
291 inline void GetIterator(Node* node, Iterator* iterator);
294 Iterator* iterator);
372 Iterator(const TreeMapIterator& iterator) argument
378 inline void _SetTo(const TreeMapIterator& iterator) argument
380 fIterator = iterator;
437 FindFirst(const PrimaryKey& key, Iterator* iterator) argument
455 FindFirstClosest(const PrimaryKey& key, bool less, Iterator* iterator) argument
491 FindLast(const PrimaryKey& key, Iterator* iterator) argument
523 Find(const PrimaryKey& primaryKey, const SecondaryKey& secondaryKey, Iterator* iterator) argument
535 GetIterator(Iterator* iterator) argument
546 GetIterator(Node* node, Iterator* iterator) argument
554 Insert(const Value& value, Iterator* iterator) argument
[all...]
/haiku-fatelf/src/system/kernel/
H A DNotifications.cpp179 // in the hook method. That's a property of the DoublyLinkedList iterator.
182 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
183 while (default_listener* listener = iterator.Next()) {
189 iterator = fListeners.GetIterator();
190 while (default_listener* listener = iterator.Next()) {
240 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
241 while (default_listener* listener = iterator.Next()) {
243 iterator.Remove();
317 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
318 while (default_listener* listener = iterator
338 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
358 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
382 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
414 DefaultListenerList::Iterator iterator = fListeners.GetIterator(); local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/reiserfs/
H A DTree.cpp43 located in the iterator code (Iterators.{cpp,h}).
192 DirEntryIterator iterator(this, dirID, objectID, offset, true);
196 while (iterator.GetPrevious(&dirItem, &index) == B_OK) {
213 ObjectItemIterator iterator(this, dirID, objectID);
216 while (iterator.GetNext(&dirItem, TYPE_DIRENTRY) == B_OK) {
240 ItemIterator iterator(this);
241 error = iterator.InitCheck();
244 error = iterator.FindRightMost(&k, item);
/haiku-fatelf/src/apps/cortex/TipManager/
H A DTipManagerImpl.cpp70 for(list<_ViewEntry*>::iterator it = m_childViews.begin();
74 for(tip_entry_set::iterator it = m_tips.begin();
108 for(list<BView*>::iterator itView = parentOrder.begin();
112 list<_ViewEntry*>::iterator itEntry =
136 tip_entry_set::iterator itFound = viewEntry->m_tips.find(newTipEntry);
142 pair<tip_entry_set::iterator, bool> ret;
174 for(list<BView*>::iterator itView = parentOrder.begin();
178 list<_ViewEntry*>::iterator itEntry =
195 tip_entry_set::iterator it = viewEntry->m_tips.lower_bound(&matchEntry);
196 tip_entry_set::iterator itEn
[all...]

Completed in 204 milliseconds

1234567891011>>