Searched refs:Entry (Results 251 - 275 of 575) sorted by last modified time
<<11121314151617181920>>
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | IndexImpl.h | 17 virtual Entry *GetCurrent() = 0; 18 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0; 19 virtual Entry *GetPrevious() = 0; 20 virtual Entry *GetNext() = 0; 36 virtual Entry *GetCurrent(); 37 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0; 38 virtual Entry *GetPrevious(); 39 virtual Entry *GetNext(); 49 Entry *fEntry; 88 Entry * [all...] |
H A D | Index.h | 13 class Entry; 65 Entry *GetCurrent(); 66 Entry *GetCurrent(uint8 *buffer, size_t *keyLength); 67 Entry *GetPrevious(); 68 Entry *GetNext(); 69 Entry *GetNext(uint8 *buffer, size_t *keyLength);
|
H A D | EntryListener.h | 8 class Entry; 23 virtual void EntryAdded(Entry *entry); 24 virtual void EntryRemoved(Entry *entry);
|
H A D | EntryListener.cpp | 20 EntryListener::EntryAdded(Entry */*entry*/) 26 EntryListener::EntryRemoved(Entry */*entry*/)
|
H A D | EntryIterator.h | 13 class Entry; 29 status_t GetNext(Entry **entry); 30 Entry *GetCurrent() const { return fEntry; } 35 void SetCurrent(Entry *entry, bool isNext); 42 Entry *fEntry;
|
H A D | EntryIterator.cpp | 7 #include "Entry.h" 97 EntryIterator::GetNext(Entry **entry) 134 EntryIterator::SetCurrent(Entry *entry, bool isNext)
|
H A D | Directory.h | 13 class Entry; 22 virtual status_t Link(Entry *entry); 23 virtual status_t Unlink(Entry *entry); 37 status_t AddEntry(Entry *entry); 38 status_t CreateEntry(Node *node, const char *name, Entry **entry = NULL); 39 status_t RemoveEntry(Entry *entry); 40 status_t DeleteEntry(Entry *entry); 42 status_t FindEntry(const char *name, Entry **entry) const; 45 Entry **entry = NULL) const; 47 status_t GetPreviousEntry(Entry **entr [all...] |
H A D | Directory.cpp | 9 #include "Entry.h" 26 while (Entry *entry = fEntries.First()) { 36 Directory::Link(Entry *entry) 45 Directory::Unlink(Entry *entry) 70 Entry *entry = fReferrers.First(); 134 Directory::AddEntry(Entry *entry) 153 Directory::CreateEntry(Node *node, const char *name, Entry **_entry) 158 Entry *entry = new(nothrow) Entry(name); 187 Directory::RemoveEntry(Entry *entr [all...] |
/haiku/src/apps/diskusage/ |
H A D | PieView.cpp | 21 #include <Entry.h>
|
/haiku/src/tools/locale/ |
H A D | linkcatkeys.cpp | 11 #include <Entry.h>
|
/haiku/src/servers/media/ |
H A D | BufferManager.cpp | 154 BufferInfoMap::Entry entry = iterator.Next();
|
/haiku/src/kits/tracker/ |
H A D | FSUndoRedo.h | 38 #include <Entry.h>
|
/haiku/src/kits/package/ |
H A D | PackageRoster.cpp | 16 #include <Entry.h>
|
/haiku/src/kits/app/ |
H A D | AppMisc.cpp | 19 #include <Entry.h>
|
H A D | Application.cpp | 26 #include <Entry.h>
|
/haiku/src/build/libbe/app/ |
H A D | AppMisc.cpp | 14 #include <Entry.h>
|
/haiku/headers/os/package/ |
H A D | PackageRoster.h | 9 #include <Entry.h>
|
/haiku/src/kits/storage/ |
H A D | PathMonitor.cpp | 19 #include <Entry.h> 263 // #pragma mark - Entry 266 class Entry : public SinglyLinkedListLinkImpl<Entry> { class in namespace:__anon3 268 Entry(Directory* parent, const BString& name, ::Node* node) function in class:__anon3::Entry 298 Entry*& HashNext() 307 Entry* fHashNext; 310 typedef SinglyLinkedList<Entry> EntryList; 318 typedef Entry ValueType; 325 size_t Hash(Entry* valu [all...] |
H A D | Mime.cpp | 22 #include <Entry.h>
|
H A D | NodeInfo.cpp | 18 #include <Entry.h>
|
/haiku/src/kits/media/ |
H A D | DormantNodeManager.cpp | 56 #include <Entry.h>
|
/haiku/src/bin/media_client/ |
H A D | MediaPlay.cpp | 10 #include <Entry.h>
|
/haiku/src/kits/shared/ |
H A D | SettingsHandler.cpp | 37 #include <Entry.h>
|
/haiku/src/preferences/media/ |
H A D | MediaViews.cpp | 19 #include <Entry.h>
|
/haiku/src/kits/storage/mime/ |
H A D | SnifferRules.cpp | 21 #include <Entry.h>
|
Completed in 162 milliseconds
<<11121314151617181920>>