| /frameworks/base/core/java/android/os/ |
| DropBoxManager.aidl | 19 parcelable DropBoxManager.Entry;
|
| /external/skia/gpu/include/ |
| GrTLList.h | 25 class Entry {
26 Entry* fPrev;
27 Entry* fNext;
46 Entry* fHead;
47 Entry* fTail;
49 friend class Entry;
57 class Child : public GrTLList::Entry<Child> {
|
| /external/skia/src/effects/ |
| SkBitmapCache.h | 34 struct Entry;
35 mutable Entry* fHead;
36 mutable Entry* fTail;
38 inline Entry* detach(Entry*) const;
39 inline void attachToHead(Entry*) const;
|
| SkBitmapCache.cpp | 19 struct SkBitmapCache::Entry {
20 Entry* fPrev;
21 Entry* fNext;
27 Entry(const void* buffer, size_t size, const SkBitmap& bm) : fBitmap(bm) {
33 ~Entry() { sk_free(fBuffer); }
50 Entry* entry = fHead; local
51 while (entry) {
52 Entry* next = entry->fNext
90 Entry* entry = fHead; local
115 Entry* entry = new Entry(buffer, len, bm); local
137 Entry* entry = fHead; local
[all...] |
| /external/webkit/Source/WebCore/html/parser/ |
| HTMLFormattingElementList.h | 44 // Ideally Entry would be private, but HTMLTreeBuilder has to coordinate
46 // access to Entry::isMarker() and Entry::replaceElement() to do so.
47 class Entry {
50 explicit Entry(Element* element)
56 Entry(MarkerEntryType)
60 ~Entry() {}
83 Bookmark(Entry* entry)
85 , m_mark(entry)
[all...] |
| /external/webkit/Source/WebCore/fileapi/ |
| EntryCallback.h | 40 class Entry;
45 virtual bool handleEvent(Entry*) = 0;
|
| EntryCallback.idl | 36 boolean handleEvent(in Entry entry);
|
| EntryArray.h | 36 #include "Entry.h"
50 Entry* item(unsigned index) const;
51 void set(unsigned index, PassRefPtr<Entry> entry);
55 void append(PassRefPtr<Entry> entry) { m_entries.append(entry); }
60 Vector<RefPtr<Entry> > m_entries;
|
| /external/chromium/net/ftp/ |
| ftp_auth_cache.h | 29 struct Entry {
30 Entry(const GURL& origin, const string16& username,
32 ~Entry();
42 // Return Entry corresponding to given |origin| or NULL if not found.
43 Entry* Lookup(const GURL& origin);
45 // Add an entry for |origin| to the cache (consisting of |username| and
46 // |password|). If there is already an entry for |origin|, it will be
51 // Remove the entry for |origin| from the cache, if one exists and matches
57 typedef std::list<Entry> EntryList;
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| IntQueue.java | 20 private static class Entry {
21 private IntQueue.Entry next;
23 private Entry(int value) {
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value); local
34 tail.next = entry;
35 tail = entry;
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| NotificationData.java | 33 public static final class Entry {
41 public Entry() {}
42 public Entry(IBinder key, StatusBarNotification n, StatusBarIconView ic) {
48 private final ArrayList<Entry> mEntries = new ArrayList<Entry>();
49 private final Comparator<Entry> mEntryCmp = new Comparator<Entry>() {
50 public int compare(Entry a, Entry b) {
64 public Entry get(int i)
91 Entry entry = new Entry(); local
[all...] |
| /external/llvm/include/llvm/Support/ |
| PredIteratorCache.h | 43 BasicBlock **&Entry = BlockToPredsMap[BB];
44 if (Entry) return Entry;
51 Entry = Memory.Allocate<BasicBlock*>(PredCache.size());
52 std::copy(PredCache.begin(), PredCache.end(), Entry);
53 return Entry;
|
| /external/clang/test/CodeGen/ |
| pointer-signext.c | 26 MEMORY_MAP *Entry;
30 Entry = CR (Link, MEMORY_MAP, Link);
31 return (int) Entry->Signature;
|
| /frameworks/base/core/java/com/android/internal/os/ |
| IDropBoxManagerService.aidl | 35 void add(in DropBoxManager.Entry entry);
41 DropBoxManager.Entry getNextEntry(String tag, long millis);
|
| /external/emma/core/java12/com/vladium/util/ |
| IntObjectMap.java | 61 m_buckets = new Entry [initialCapacity];
87 final Entry [] buckets = m_buckets;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
93 if (key == entry.m_key)
112 final Entry [] buckets = m_buckets;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next
[all...] |
| IntSet.java | 59 m_buckets = new Entry [initialCapacity];
85 final Entry [] buckets = m_buckets;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
91 if (key == entry.m_key)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| CatchTable.java | 23 * Table of catch entries. Each entry includes a range of code
49 public Entry get(int n) {
50 return (Entry) get0(n);
54 * Sets the entry at the given index.
57 * @param entry {@code non-null;} the entry to set at {@code n}
59 public void set(int n, Entry entry) {
60 set0(n, entry);
75 Entry thisEntry = get(i)
[all...] |
| CatchHandlerList.java | 48 public Entry get(int n) {
49 return (Entry) get0(n);
75 Entry entry = get(i); local
86 sb.append(entry.getExceptionType().toHuman());
90 sb.append(Hex.u2or4(entry.getHandler()));
110 Entry last = get(size - 1);
115 * Sets the entry at the given index.
122 set0(n, new Entry(exceptionType, handler));
126 * Sets the entry at the given index
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| CatchTable.java | 23 * Table of catch entries. Each entry includes a range of code
49 public Entry get(int n) {
50 return (Entry) get0(n);
54 * Sets the entry at the given index.
57 * @param entry {@code non-null;} the entry to set at {@code n}
59 public void set(int n, Entry entry) {
60 set0(n, entry);
75 Entry thisEntry = get(i)
[all...] |
| CatchHandlerList.java | 48 public Entry get(int n) {
49 return (Entry) get0(n);
75 Entry entry = get(i); local
86 sb.append(entry.getExceptionType().toHuman());
90 sb.append(Hex.u2or4(entry.getHandler()));
110 Entry last = get(size - 1);
115 * Sets the entry at the given index.
122 set0(n, new Entry(exceptionType, handler));
126 * Sets the entry at the given index
[all...] |
| /packages/apps/Gallery/src/com/android/camera/gallery/ |
| LruCache.java | 28 private final HashMap<K, Entry<K, V>> mWeakMap =
29 new HashMap<K, Entry<K, V>>();
36 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
42 private static class Entry<K, V> extends WeakReference<V> {
45 public Entry(K key, V value, ReferenceQueue<V> queue) {
53 Entry<K, V> entry = (Entry<K, V>) mQueue.poll(); local
54 while (entry != null) {
55 mWeakMap.remove(entry.mKey)
63 Entry<K, V> entry = mWeakMap.put( local
[all...] |
| /external/v8/src/ |
| hashmap.h | 67 struct Entry {
73 // If an entry with matching key is found, Lookup()
74 // returns that entry. If no matching entry is found,
75 // but insert is set, a new entry is inserted with
78 Entry* Lookup(void* key, uint32_t hash, bool insert);
80 // Removes the entry with matching key.
96 // for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) {
102 Entry* Start() const;
103 Entry* Next(Entry* p) const
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| NavigableMap.java | 18 * and {@code higherEntry} return {@code Map.Entry} objects
43 * <p>Implementations of entry-returning methods are expected to
44 * return {@code Map.Entry} pairs representing snapshots of mappings
46 * support the optional {@code Entry.setValue} method. Note however
74 * @return an entry with the greatest key less than {@code key},
81 Map.Entry<K,V> lowerEntry(K key);
103 * @return an entry with the greatest key less than or equal to
110 Map.Entry<K,V> floorEntry(K key);
132 * @return an entry with the least key greater than or equal to
139 Map.Entry<K,V> ceilingEntry(K key)
[all...] |
| /external/guava/src/com/google/common/collect/ |
| AbstractMapEntry.java | 22 import java.util.Map.Entry;
28 * methods of {@code Entry}.
33 abstract class AbstractMapEntry<K, V> implements Entry<K, V> {
44 if (object instanceof Entry) {
45 Entry<?, ?> that = (Entry<?, ?>) object;
|
| /external/llvm/include/llvm/ADT/ |
| UniqueVector.h | 21 /// unique entry that is added. T is the type of entries in the vector. This
23 /// Entries can be fetched using operator[] with the entry ID.
26 // Map - Used to handle the correspondence of entry to ID.
34 /// insert - Append entry to the vector if it doesn't already exist. Returns
35 /// the entry's index + 1 to be used as a unique ID.
36 unsigned insert(const T &Entry) {
37 // Check if the entry is already in the map.
38 unsigned &Val = Map[Entry];
40 // See if entry exists, if so return prior ID.
43 // Compute ID for entry
[all...] |
