/haiku/src/kits/tracker/ |
H A D | PendingNodeMonitorCache.cpp | 78 fList(10, true) 100 fList.AddItem(new PendingNodeMonitorEntry(&node, message)); 107 int32 count = fList.CountItems(); 109 if (fList.ItemAt(index)->Match(nodeRef)) 110 delete fList.RemoveItemAt(index); 118 int32 count = fList.CountItems(); 120 if (fList.ItemAt(index)->TooOld(now)) { 122 delete fList.RemoveItemAt(index); 132 for (int32 index = 0; index < fList.CountItems();) { 133 PendingNodeMonitorEntry* item = fList [all...] |
H A D | EntryIterator.cpp | 435 fList(5, true), 443 int32 count = fList.CountItems(); 446 BEntryList* entry = fList.RemoveItemAt(count - 1); 459 fList.AddItem(walker); 467 if (fCurrentIndex >= fList.CountItems()) { 472 fStatus = fList.ItemAt(fCurrentIndex)->GetNextEntry(entry, traverse); 486 if (fCurrentIndex >= fList.CountItems()) { 491 fStatus = fList.ItemAt(fCurrentIndex)->GetNextRef(ref); 507 if (fCurrentIndex >= fList.CountItems()) { 512 result = fList [all...] |
H A D | PendingNodeMonitorCache.h | 81 BObjectList<PendingNodeMonitorEntry> fList; member in class:BPrivate::PendingNodeMonitorCache
|
/haiku/src/kits/storage/sniffer/ |
H A D | RPatternList.cpp | 26 for (i = fList.begin(); i != fList.end(); i++) 51 for (i = fList.begin(); i != fList.end(); i++) { 71 for (i = fList.begin(); i != fList.end(); i++) { 90 fList.push_back(rpattern);
|
H A D | PatternList.cpp | 27 for (i = fList.begin(); i != fList.end(); i++) 51 for (i = fList.begin(); i != fList.end(); i++) { 72 for (i = fList.begin(); i != fList.end(); i++) { 97 fList.push_back(pattern);
|
/haiku/src/servers/registrar/ |
H A D | AppInfoList.h | 84 : fList(it.fList), 99 RosterAppInfo *info = fList->RemoveInfo(fIndex); 107 fList = it.fList; 121 return Iterator(fList, fIndex + 1); 132 return Iterator(fList, fIndex - 1); 137 return (fList == it.fList && fIndex == it.fIndex); 147 return fList 162 AppInfoList *fList; member in class:AppInfoList::Iterator [all...] |
H A D | AppInfoListMessagingTargetSet.cpp | 15 : fList(list), 54 fIterator = fList.It();
|
H A D | AppInfoListMessagingTargetSet.h | 32 AppInfoList &fList; member in class:AppInfoListMessagingTargetSet
|
/haiku/src/system/kernel/ |
H A D | TeamThreadTables.h | 82 fList.Add(element); 88 fList.Remove(element); 103 return Iterator(fList.Head()); 111 fList.Add(entry, false); 116 fList.Remove(entry); 121 if (entry == fList.Tail()) 130 fList.Remove(entry); 131 fList.Add(entry); 138 fList.Remove(entry); 139 fList 176 List fList; member in struct:BKernel::TeamThreadTable [all...] |
/haiku/src/tests/add-ons/print/ppd/model/ |
H A D | StatementList.cpp | 27 fList.MakeEmpty(); 32 fList.AddItem(statement); 37 fList.RemoveItem(statement); 42 return fList.CountItems(); 47 return (Statement*)fList.ItemAt(index); 52 for (int32 i = 0; i < fList.CountItems(); i ++) {
|
H A D | StatementList.h | 18 BList fList; member in class:StatementList
|
/haiku/src/kits/network/libnetservices/ |
H A D | NetworkCookieJar.cpp | 499 fList(NULL), 516 fList(NULL), 531 if (fList != NULL) 532 fList->Unlock(); 547 if (fList != NULL) 548 fList->Unlock(); 553 fList = NULL; 599 if (fList != NULL) 600 fList->Unlock(); 603 fList [all...] |
/haiku/src/servers/media/ |
H A D | Queue.cpp | 60 if (!fList.AddItem(item)) 80 return fList.RemoveItem((int32)0);
|
H A D | Queue.h | 24 BList fList; member in class:Queue
|
/haiku/headers/libs/print/libprint/ |
H A D | PrintUtils.h | 67 BList fList; member in class:TList 94 fList.MakeEmpty(); 100 return fList.CountItems(); 106 return (T*)fList.ItemAt(index); 112 fList.AddItem(p); 117 return (T*)fList.RemoveItem(i); 123 return (T*)fList.Items(); 130 fList.SortItems(sort);
|
/haiku/src/apps/resedit/ |
H A D | ResourceRoster.h | 30 BList fList; member in class:ResourceRoster
|
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 121 fList(list) 140 fNext = fList->GetNext(fNext); 153 fList->Remove(fCurrent); 161 fList = other.fList; 170 fNext = fList->First(); 174 List *fList; member in class:FSShell::DoublyLinkedList::Iterator 183 fList(list) 202 fNext = fList->GetNext(fNext); 208 fList 219 const List *fList; member in class:FSShell::DoublyLinkedList::ConstIterator 275 List *fList; member in class:FSShell::DoublyLinkedList::ReverseIterator 320 const List *fList; member in class:FSShell::DoublyLinkedList::ConstReverseIterator [all...] |
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedList.h | 122 fList(list) 145 fNext = fList->GetNext(fNext); 158 fList->Remove(fCurrent); 166 fList = other.fList; 175 fNext = fList->First(); 179 List* fList; member in class:DoublyLinkedList::Iterator 188 fList(list) 207 fNext = fList->GetNext(fNext); 213 fList 224 const List* fList; member in class:DoublyLinkedList::ConstIterator 280 List* fList; member in class:DoublyLinkedList::ReverseIterator 325 const List* fList; member in class:DoublyLinkedList::ConstReverseIterator [all...] |
/haiku/src/apps/mail/ |
H A D | Enclosures.cpp | 94 us->fList->AddItem(new TListItem(component)); 113 fList = new TListView(this); 114 fList->SetInvocationMessage(new BMessage(LIST_INVOKED)); 117 BScrollView* scroll = new BScrollView("", fList, 0, false, true); 130 for (int32 index = fList->CountItems();index-- > 0;) { 131 TListItem *item = static_cast<TListItem *>(fList->ItemAt(index)); 132 fList->RemoveItem(index); 168 while ((index = fList->CurrentSelection()) >= 0) { 169 TListItem *item = (TListItem *) fList->ItemAt(index); 170 fList [all...] |
/haiku/src/preferences/mail/ |
H A D | FilterList.cpp | 68 return fList.size(); 75 return fList[index]; 82 for (size_t i = 0; i < fList.size(); i++) { 83 const FilterInfo& info = fList[i]; 146 for (size_t i = 0; i < fList.size(); i++) { 147 FilterInfo& info = fList[i]; 150 fList.clear(); 178 fList.push_back(info);
|
/haiku/src/add-ons/kernel/network/protocols/tcp/ |
H A D | BufferQueue.cpp | 47 while ((buffer = fList.RemoveHead()) != NULL) { 101 if (fList.IsEmpty() || sequence >= fLastSequence) { 103 fList.Add(buffer); 128 SegmentList::ReverseIterator iterator = fList.GetReverseIterator(); 150 fList.Remove(previous); 179 fList.Remove(remove); 201 fList.InsertBefore(next, buffer); 243 SegmentList::Iterator iterator = fList.GetIterator(); 271 if (fList.IsEmpty()) 274 fFirstSequence = fList [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 70 : fList(list), 73 fNext(fList->GetFirst()) 95 fNext = fList->GetNext(fNext); 104 fList->_Remove(fPrevious, fCurrent); 112 fList = other.fList; 120 List *fList; member in class:UserlandFSUtil::SLList::Iterator 129 : fList(list), 148 fNext = fList->GetNext(fNext); 154 fList 160 const List *fList; member in class:UserlandFSUtil::SLList::ConstIterator [all...] |
/haiku/src/system/boot/loader/ |
H A D | RootFileSystem.cpp | 24 while ((entry = fList.RemoveHead()) != NULL) { 34 EntryIterator *iterator = new (std::nothrow) EntryIterator(&fList); 69 iterator = fList.GetIterator(); 128 return fList.IsEmpty(); 144 fList.Add(entry); 170 EntryIterator iterator = fList.GetIterator();
|
/haiku/src/kits/media/ |
H A D | FormatManager.h | 40 BObjectList<meta_format> fList; member in class:FormatManager
|
/haiku/headers/private/storage/sniffer/ |
H A D | PatternList.h | 41 std::vector<Pattern*> fList; member in class:BPrivate::Storage::Sniffer::PatternList
|