Searched defs:Entry (Results 1 - 3 of 3) sorted by relevance
/system/core/include/utils/ |
H A D | LruCache.h | 82 struct Entry { struct in class:android::LruCache 85 Entry* parent; 86 Entry* child; 88 Entry(TKey key_, TValue value_) : key(key_), value(value_), parent(NULL), child(NULL) { function in struct:android::LruCache::Entry 93 void attachToCache(Entry& entry); 94 void detachFromCache(Entry& entry); 97 UniquePtr<BasicHashtable<TKey, Entry> > mTable; 99 Entry* mOldest; 100 Entry* mYoungest; 108 : mTable(new BasicHashtable<TKey, Entry>) [all...] |
/system/core/libcutils/ |
H A D | hashmap.c | 26 typedef struct Entry Entry; typedef in typeref:struct:Entry 27 struct Entry { struct 31 Entry* next; 35 Entry** buckets; 61 map->buckets = calloc(map->bucketCount, sizeof(Entry*)); 106 Entry** newBuckets = calloc(newBucketCount, sizeof(Entry*)); 115 Entry* entry = map->buckets[i]; 117 Entry* nex [all...] |
/system/media/camera/docs/ |
H A D | metadata_model.py | 24 Entry: A node corresponding to <entry> elements. 211 self._entries_ordered = [] # list of ordered Entry/Clone instances 296 Entry#__init__ for the keys required/optional. 302 e = Entry(**entry) 359 Generate the graph recursively, after which all Entry nodes will be 770 entries: A sequence of Entry/Clone children. 870 entries: A sequence of Entry/Clone children. 983 parent: An edge to the parent, always an Entry instance. 1008 class Entry(Node): class in inherits:Node 1051 tags: A sequence of Tag nodes associated with this Entry [all...] |
Completed in 359 milliseconds