| /external/chromium/net/disk_cache/ |
| disk_cache.h | 27 class Entry;
76 // for a given Entry (as opposed to the Backend) will still generate a
83 // Opens an existing entry. Upon success, the out param holds a pointer
84 // to a Entry object representing the specified disk cache entry.
85 // When the entry pointer is no longer needed, the Close method
88 virtual bool OpenEntry(const std::string& key, Entry** entry) = 0;
90 // Opens an existing entry. Upon success, |entry| holds a pointer to an Entr
[all...] |
| /external/chromium/net/base/ |
| host_cache.cc | 14 HostCache::Entry::Entry(int error,
20 HostCache::Entry::~Entry() {
36 const HostCache::Entry* HostCache::Lookup(const Key& key,
45 Entry* entry = it->second.get();
46 if (CanUseEntry(entry, now))
47 return entry;
52 HostCache::Entry* HostCache::Set(const Key& key
62 scoped_refptr<Entry>& entry = entries_[key]; local
90 Entry* entry = (it->second).get(); local
107 Entry* entry = (it->second).get(); local
[all...] |
| host_cache.h | 23 struct Entry : public base::RefCounted<Entry> {
24 Entry(int error, const AddressList& addrlist, base::TimeTicks expiration);
26 // The resolve results for this entry.
30 // The time when this entry expires.
34 friend class base::RefCounted<Entry>;
36 ~Entry();
58 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
69 // Returns a pointer to the entry for |key|, which is valid at time
70 // |now|. If there is no such entry, returns NULL
[all...] |
| load_log_util.cc | 73 struct Entry {
74 explicit Entry(const LoadLog::Entry* log_entry)
78 return log_entry->type == LoadLog::Entry::TYPE_EVENT &&
83 return log_entry->type == LoadLog::Entry::TYPE_EVENT &&
87 const LoadLog::Entry* log_entry;
96 Entry entry(&log->entries()[i]);
98 entry.indentation = current_indentation;
100 if (entry.IsBeginEvent())
171 const LoadLog::Entry* entry = entries_[index].log_entry; local
[all...] |
| /development/simulator/app/ |
| ExternalRuntime.cpp | 54 * Thread entry point.
61 void* ExternalRuntime::Entry(void)
|
| PropertyServer.cpp | 450 * Thread entry point.
457 void* PropertyServer::Entry(void)
|
| /external/chromium/net/ftp/ |
| ftp_auth_cache.h | 28 struct Entry {
29 Entry(const GURL& origin, const std::wstring& username,
44 // Return Entry corresponding to given |origin| or NULL if not found.
45 Entry* Lookup(const GURL& origin);
47 // Add an entry for |origin| to the cache (consisting of |username| and
48 // |password|). If there is already an entry for |origin|, it will be
53 // Remove the entry for |origin| from the cache, if one exists and matches
59 typedef std::list<Entry> EntryList;
|
| /packages/apps/Gallery3D/src/com/cooliris/picasa/ |
| Entry.java | 26 public abstract class Entry {
29 // The primary key of the entry.
54 throw new UnsupportedOperationException("Entry class does not support XML parsing");
|
| /external/skia/src/gl/ |
| SkTextureCache.cpp | 6 SkTextureCache::Entry::Entry(const SkBitmap& bitmap)
13 SkTextureCache::Entry::~Entry() {
32 Entry* entry = fHead; local
33 while (entry) {
34 SkASSERT(entry->lockCount() == 0);
35 entry = entry->fNext
44 Entry* entry = fHead; local
86 const Entry* entry = sorted[hi]; local
112 Entry* entry = fHash[hashIndex]; local
144 Entry* entry = this->find(key, &index); local
226 Entry* entry = fTail; local
313 const Entry* entry = fHead; local
[all...] |
| /external/chromium/net/http/ |
| http_auth_cache.h | 23 // For each realm the cache stores a HttpAuthCache::Entry, which holds:
32 class Entry;
34 // Find the realm entry on server |origin| for realm |realm|.
37 // returns - the matched entry or NULL.
38 Entry* LookupByRealm(const GURL& origin, const std::string& realm);
40 // Find the realm entry on server |origin| whose protection space includes
46 // returns - the matched entry or NULL.
47 Entry* LookupByPath(const GURL& origin, const std::string& path);
49 // Add a realm entry on server |origin| for realm |handler->realm()|, If an
50 // entry for this realm already exists, update it rather than replace it -
[all...] |
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| DirectLinkedList.java | 20 private Entry<E> mHead;
21 private Entry<E> mTail;
24 public static final class Entry<E> {
25 Entry(E value) {
30 public Entry<E> previous = null;
31 public Entry<E> next = null;
46 public void add(Entry<E> entry) {
47 // Requires that entry not be inserted in a list.
48 final Entry<E> tail = mTail
[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...] |
| PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz];
99 arr[at] = new PositionList.Entry(insn.getAddress(), pos);
131 public Entry get(int n) {
132 return (Entry) get0(n);
136 * Sets the entry at the given index.
139 * @param entry {@code non-null;} the entry to set at {@code n}
141 public void set(int n, Entry entry) {
[all...] |
| /external/guava/src/com/google/common/collect/ |
| Multiset.java | 52 * collapsed", and {@link #entrySet} is similar but contains {@link Entry
53 * Multiset.Entry} instances, each providing both a distinct element and the
193 * Multiset.Entry} instances, each providing an element of the multiset and
194 * the count of that element. This set contains exactly one entry for each
199 * <p>The entry set is backed by the same data as the multiset, so any change
201 * may or may not be reflected in any {@code Entry} instances already
202 * retrieved from the entry set (this is implementation-dependent).
204 * the entry set at all, and the {@code Entry} instances themselves don't
206 * for more details on how its entry set handles modifications
[all...] |
| /external/v8/src/ |
| hashmap.h | 66 struct Entry {
72 // If an entry with matching key is found, Lookup()
73 // returns that entry. If no matching entry is found,
74 // but insert is set, a new entry is inserted with
77 Entry* Lookup(void* key, uint32_t hash, bool insert);
79 // Removes the entry with matching key.
95 // for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) {
101 Entry* Start() const;
102 Entry* Next(Entry* p) const
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| NotificationData.java | 31 public static final class Entry {
39 private final ArrayList<Entry> mEntries = new ArrayList<Entry>();
45 public Entry getEntryAt(int index) {
52 Entry entry = mEntries.get(i); local
53 if (entry.key == key) {
62 Entry entry = new Entry(); local
77 Entry entry = mEntries.get(i); local
89 Entry entry = mEntries.get(i); local
103 Entry entry = mEntries.get(i); local
117 Entry entry = mEntries.get(i); local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Map.java | 34 * {@code Map.Entry} is a key/value mapping contained in a {@code Map}.
36 public static interface Entry<K,V> {
38 * Compares the specified object to this {@code Map.Entry} and returns if they
39 * are equal. To be equal, the object must be an instance of {@code Map.Entry} and have the
45 * {@code Map.Entry}, {@code false} otherwise.
74 * Sets the value of this entry to the specified value, replacing any
79 * @return object the replaced value of this entry.
116 * an instance of {@link Map.Entry}. As the {@code Set} is backed by this {@code Map},
121 public Set<Map.Entry<K,V>> entrySet();
|
| /libcore/luni/src/main/java/org/apache/harmony/security/asn1/ |
| InformationObjectSet.java | 39 private final Entry[][] pool;
47 pool = new Entry[capacity][size];
58 Entry[] list = pool[index];
72 list[i] = new Entry(oid, object);
79 Entry[] list = pool[index];
97 private static class Entry {
102 public Entry(int[] oid, Object object) {
|
| /libcore/support/src/test/java/tests/http/ |
| DefaultResponseCache.java | 39 private final Map<URI, Entry> entries = new HashMap<URI, Entry>();
48 Entry entry = entries.get(uri); local
49 if (entry != null) {
51 return entry.asResponse();
61 return new Entry(uri, urlConnection).asRequest();
64 public synchronized Map<URI, Entry> getContents() {
65 return new HashMap<URI, Entry>(entries);
96 public final class Entry {
[all...] |
| /packages/apps/Camera/src/com/android/camera/gallery/ |
| LruCache.java | 32 private final HashMap<K, Entry<K, V>> mWeakMap =
33 new HashMap<K, Entry<K, V>>();
40 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
46 private static class Entry<K, V> extends WeakReference<V> {
49 public Entry(K key, V value, ReferenceQueue<V> queue) {
57 Entry<K, V> entry = (Entry<K, V>) mQueue.poll(); local
58 while (entry != null) {
59 mWeakMap.remove(entry.mKey)
67 Entry<K, V> entry = mWeakMap.put( local
[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/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 27 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
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) return true;
111 final Entry [] buckets = m_buckets
[all...] |
| 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...] |
