Searched refs:fIterator (Results 1 - 25 of 39) sorted by relevance

12

/haiku/src/servers/registrar/
H A DAppInfoListMessagingTargetSet.cpp16 fIterator(list.It()),
31 return fIterator.IsValid();
38 if (!fIterator.IsValid())
41 port = (*fIterator)->port;
44 ++fIterator;
54 fIterator = fList.It();
71 while (fIterator.IsValid() && !Filter(*fIterator))
72 ++fIterator;
H A DAppInfoListMessagingTargetSet.h33 AppInfoList::Iterator fIterator; member in class:AppInfoListMessagingTargetSet
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DIndex.cpp92 : fIterator(NULL)
98 : fIterator(NULL)
114 return (fIterator ? fIterator->GetCurrent() : NULL);
121 return (fIterator ? fIterator->GetCurrent(buffer, keyLength) : NULL);
128 return (fIterator ? fIterator->GetPrevious() : NULL);
135 return (fIterator ? fIterator
[all...]
H A DNameIndex.cpp92 NameIndex::EntryTree::Iterator fIterator; member in class:NameIndexEntryIterator
237 fIterator(),
253 return (fIndex && fIterator.GetCurrent() ? *fIterator.GetCurrent() : NULL);
274 if (!(fIterator.GetCurrent() && fIsNext))
275 fIterator.GetPrevious();
277 return (fIndex && fIterator.GetCurrent() ? *fIterator.GetCurrent() : NULL);
286 if (!(fIterator.GetCurrent() && fIsNext))
287 fIterator
[all...]
H A DQuery.cpp33 IndexEntryIterator fIterator; member in class:IndexIterator
40 fIterator(),
53 fInitialized = fIndex->Find(key, keyLength, &fIterator);
66 fInitialized = fIndex->GetIterator(&fIterator);
81 fIndex->GetIterator(&fIterator);
87 if (Entry *entry = fIterator.GetCurrent(buffer, &keyLength)) {
94 fIterator.GetNext();
H A DTwoKeyAVLTree.h280 : fIterator()
290 return fIterator.CurrentValuePointer();
295 fIterator.Next();
301 fIterator.Previous();
307 fIterator.Remove();
314 : fIterator(other.fIterator)
320 fIterator = other.fIterator;
324 : fIterator()
334 TWO_KEY_AVL_TREE_CLASS_NAME::TreeMapIterator fIterator; member in class:TWO_KEY_AVL_TREE_CLASS_NAME::Iterator
[all...]
H A DIndexImpl.h47 NodeIterator fIterator; member in class:NodeEntryIterator
59 fIterator(),
115 if (Node **nodeP = fIterator.GetNext()) {
H A DAttributeIndexImpl.cpp121 if (Attribute **attribute = fIterator.GetCurrent()) {
130 if (Attribute **attribute = fIterator.GetNext()) {
137 AttributeIterator fIterator; member in class:AttributeNodeIterator
381 if (Attribute **attribute = fIterator.fIterator.GetCurrent()) {
458 fIndex->fAttributes->GetIterator(&fIterator.fIterator);
461 &(fIterator.fIterator));
465 if (Node **nodeP = fIterator
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DIndex.cpp92 fIterator(NULL)
106 return fIterator != NULL && fIterator->HasNext();
113 return fIterator != NULL ? fIterator->Next(NULL, NULL) : NULL;
120 return fIterator != NULL ? fIterator->Next(buffer, _keyLength) : NULL;
127 return fIterator != NULL ? fIterator->Suspend() : B_BAD_VALUE;
134 return fIterator !
[all...]
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DAttributeIterator.cpp24 fIterator(NULL)
30 fIterator = new(std::nothrow) TreeIterator(inode->GetVolume()->FSTree(),
37 delete fIterator;
38 fIterator = NULL;
45 return fIterator != NULL ? B_OK : B_NO_MEMORY;
54 status_t status = fIterator->GetPreviousEntry((void**)&entries,
83 fIterator->Rewind();
H A DAttributeIterator.h19 //! Check if fIterator pointer is valid
36 TreeIterator* fIterator; member in class:AttributeIterator
H A DDirectoryIterator.h39 TreeIterator* fIterator; member in class:DirectoryIterator
H A DDirectoryIterator.cpp25 fIterator(NULL)
31 fIterator = new(std::nothrow) TreeIterator(inode->GetVolume()->FSTree(),
38 delete fIterator;
39 fIterator = NULL;
46 return fIterator != NULL ? B_OK : B_NO_MEMORY;
76 status_t status = fIterator->GetNextEntry((void**)&entries, &entries_length);
160 fIterator->Rewind();
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DQueryManager.h60 fIterator(iterator)
66 if (fManager && fIterator)
67 fManager->PutIterator(fIterator);
73 fIterator = NULL;
78 QueryIterator* fIterator; member in class:QueryIteratorPutter
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DFileSystemVisitor.cpp22 fIterator(NULL)
54 if (fIterator == NULL) {
92 fIterator = new(std::nothrow) TreeIterator(tree);
93 if (fIterator == NULL)
104 status_t status = fIterator->GetNextEntry(treeName, &length,
108 delete fIterator;
109 fIterator = NULL;
137 fIterator);
238 if (fIterator != NULL) {
239 delete fIterator;
[all...]
H A DQuery.h70 TreeIterator* fIterator; member in class:Query
/haiku/src/kits/network/libnetservices/
H A DNetworkCookieJar.cpp497 fIterator(NULL),
504 fIterator = new(std::nothrow) PrivateIterator(
514 fIterator(NULL),
521 fIterator = new(std::nothrow) PrivateIterator(
536 delete fIterator;
546 delete fIterator;
551 fIterator = NULL;
558 fIterator = new(std::nothrow) PrivateIterator(
594 if (!fIterator->fCookieMapIterator.HasNext()) {
603 fList = fIterator
[all...]
/haiku/src/apps/text_search/
H A DGrepper.h54 FileIterator* fIterator; member in class:Grepper
/haiku/headers/private/kernel/util/
H A DVectorMap.h164 fIterator()
171 fIterator(other.fIterator)
177 ++fIterator;
190 --fIterator;
204 fIterator = other.fIterator;
210 return (fParent == other.fParent && fIterator == other.fIterator);
220 return Entry(fParent, &*fIterator);
253 EntryIterator fIterator; member in class:VectorMapIterator
[all...]
/haiku/headers/private/shared/
H A DHashSet.h72 fIterator(other.fIterator),
79 return fIterator.HasNext();
84 fElement = fIterator.Next();
94 fIterator = other.fIterator;
103 fIterator(set->fTable.GetIterator()),
112 typename ElementTable::Iterator fIterator; member in class:BPrivate::HashSet::Iterator
H A DHashMap.h84 fIterator(other.fIterator),
91 return fIterator.HasNext();
96 fElement = fIterator.Next();
106 fIterator = other.fIterator;
115 fIterator(map->fTable.GetIterator()),
126 typename ElementTable::Iterator fIterator; member in class:BPrivate::HashMap::Iterator
/haiku/src/kits/tracker/
H A DRecentItems.cpp72 BRecentItemsList* fIterator; member in class:RecentItemsMenu
126 fIterator(NULL),
138 delete fIterator;
146 BMenuItem* item = fIterator->GetNextMenuItem(FileMessage(),
170 fIterator->Rewind();
181 fIterator->Rewind();
195 fIterator = new BRecentFilesList(maxItems + 10, navMenuFolders,
208 fIterator = new BRecentFilesList(maxItems + 10, navMenuFolders,
228 fIterator = new BRecentFoldersList(maxItems + 10, navMenuFolders,
241 fIterator
[all...]
H A DOpenWithWindow.cpp542 fIterator(NULL),
554 delete fIterator;
663 fIterator = new SearchForSignatureEntryList(true);
667 EachEntryRef(entryList, AddOneRefSignatures, fIterator, 100);
670 AddSupportingAppForTypeToQuery(fIterator, B_FILE_MIMETYPE);
671 fHaveCommonPreferredApp = fIterator->GetPreferredApp(&fPreferredRef);
673 if (fIterator->Rewind() != B_OK) {
674 delete fIterator;
675 fIterator = NULL;
680 fRefFilter = new OpenWithRefFilter(fIterator, entryLis
[all...]
H A DEntryIterator.cpp144 fIterator(iterator),
183 fStatus = fIterator->GetNextEntry(&fEntryBuffer[fNumEntries],
218 fStatus = fIterator->GetNextRef(&fEntryRefBuffer[fNumEntries]);
268 int32 count = fIterator->GetNextDirents(fCurrentDirent,
340 return fIterator->Rewind();
347 return fIterator->CountEntries();
357 fIterator = iterator;
/haiku/src/add-ons/kernel/file_systems/packagefs/util/
H A DTwoKeyAVLTree.h358 fIterator()
368 return fIterator.CurrentValuePointer();
373 return fIterator.CurrentNode();
378 fIterator.Next();
384 fIterator.Previous();
390 fIterator.Remove();
398 fIterator(other.fIterator)
404 fIterator = other.fIterator;
419 TWO_KEY_AVL_TREE_CLASS_NAME::TreeMapIterator fIterator; member in class:TWO_KEY_AVL_TREE_CLASS_NAME::Iterator
[all...]

Completed in 415 milliseconds

12