Searched refs:Entry (Results 151 - 175 of 575) sorted by path
1234567891011>>
/haiku/src/apps/resedit/ |
H A D | ResView.h | 11 #include <Entry.h>
|
H A D | ResourceRoster.cpp | 13 #include <Entry.h>
|
/haiku/src/apps/serialconnect/ |
H A D | SerialApp.cpp | 13 #include <Entry.h>
|
/haiku/src/apps/showimage/ |
H A D | ImageCache.h | 13 #include <Entry.h>
|
H A D | ImageFileNavigator.cpp | 27 #include <Entry.h> 200 specifier.AddString("property", "Entry");
|
H A D | ImageFileNavigator.h | 19 #include <Entry.h>
|
/haiku/src/apps/soundrecorder/ |
H A D | RecorderWindow.cpp | 172 item->Entry().Remove(); // delete temp file 770 if ((! pItem) || (pItem->Entry().InitCheck() != B_OK)) 775 pItem->Entry().GetName(filename); 778 pItem->Entry().GetRef(&ref); 802 BEntry& oldEntry = pItem->Entry(); 1061 BEntry& entry = item->Entry();
|
H A D | RecorderWindow.h | 13 #include <Entry.h>
|
H A D | SoundListView.cpp | 9 #include <Entry.h>
|
H A D | SoundListView.h | 30 BEntry & Entry() { return fEntry; } function in class:SoundListItem
|
/haiku/src/apps/stylededit/ |
H A D | StatusView.h | 13 #include <Entry.h>
|
/haiku/src/apps/text_search/ |
H A D | ChangesIterator.cpp | 64 const PathMap::Entry& entry = iterator.Next(); 135 const PathMap::Entry& entry = iterator.Next();
|
H A D | GrepApp.cpp | 10 #include <Entry.h>
|
H A D | GrepListView.h | 8 #include <Entry.h>
|
H A D | Model.cpp | 15 #include <Entry.h>
|
/haiku/src/apps/tv/ |
H A D | Controller.h | 28 #include <Entry.h>
|
H A D | MainApp.cpp | 26 #include <Entry.h>
|
/haiku/src/apps/webpositive/ |
H A D | BrowsingHistory.cpp | 13 #include <Entry.h>
|
H A D | CredentialsStorage.cpp | 13 #include <Entry.h> 226 const CredentialMap::Entry& entry = iterator.Next();
|
/haiku/src/apps/workspaces/ |
H A D | Workspaces.cpp | 20 #include <Entry.h>
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | Disk.cpp | 13 #include <Entry.h>
|
H A D | Hashtable.cpp | 45 if (!(fTable = (struct Entry **)malloc(capacity * sizeof(void *)))) 61 struct Entry **table = fTable; 65 struct Entry *entry,*next; 103 Entry *entry = GetHashEntry(key); 111 Entry *entry = GetHashEntry(key); 124 fTable[index] = new Entry(fTable[index], key, value); 133 Entry **table,*entry,*prev; 201 Entry *entry, *next; 245 struct Entry **oldTable = fTable,**newtable; 250 if (!(newtable = (struct Entry **)mallo [all...] |
H A D | Hashtable.h | 40 class Entry class in class:Hashtable 43 Entry(Entry *_next, const void *_key, void *_value) function in class:Hashtable::Entry 46 Entry *next; 52 Entry *GetHashEntry(const void *key); 56 Entry **fTable; 61 Entry *fIteratorEntry;
|
/haiku/src/bin/desklink/ |
H A D | DeskButton.h | 14 #include <Entry.h>
|
/haiku/src/bin/keymap/ |
H A D | Keymap.cpp | 19 #include <Entry.h>
|
Completed in 123 milliseconds
1234567891011>>