Searched refs:fRefs (Results 1 - 7 of 7) sorted by relevance

/haiku/src/apps/mediaplayer/playlist/
H A DFilePlaylistItem.cpp27 fRefs.push_back(ref);
34 fRefs(other.fRefs),
50 fRefs.push_back(ref);
55 if (fRefs.empty()) {
56 fRefs.push_back(entry_ref());
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++) {
96 BPath path(&fRefs[i]);
115 BEntry entry(&fRefs[
[all...]
H A DFilePlaylistItem.h61 const entry_ref& Ref() const { return fRefs[0]; }
84 // always fRefs.size() == fNamesInTrash.size()
85 vector<entry_ref> fRefs; member in class:FilePlaylistItem
/haiku/src/apps/mail/
H A DQueryList.h47 { return fRefs; }
68 RefMap fRefs; member in class:QueryList
H A DQueryList.cpp98 RefMap::const_iterator iterator = fRefs.begin();
99 for (; iterator != fRefs.end(); iterator++) {
152 fRefs.insert(std::make_pair(node_ref(ref.device, node), ref));
162 RefMap::iterator found = fRefs.find(nodeRef);
163 if (found != fRefs.end())
/haiku/src/bin/
H A Dnotify.cpp64 BList* fRefs; member in class:NotifyApp
81 fRefs = new BList();
88 for (int32 i = 0; void* item = fRefs->ItemAt(i); i++)
90 delete fRefs;
156 fRefs->AddItem(new BEntry(&ref));
259 for (int32 i = 0; void* item = fRefs->ItemAt(i); i++) {
/haiku/src/kits/app/
H A DNotification.cpp135 for (int32 i = fRefs.CountItems() - 1; i >= 0; i--)
136 delete (entry_ref*)fRefs.ItemAtFast(i);
377 if (clonedRef == NULL || !fRefs.AddItem(clonedRef))
387 return fRefs.CountItems();
394 return (entry_ref*)fRefs.ItemAt(index);
/haiku/headers/os/app/
H A DNotification.h99 BList fRefs; member in class:BNotification

Completed in 44 milliseconds