Searched defs:key (Results 176 - 200 of 3586) sorted by relevance

1234567891011>>

/external/glide/library/src/main/java/com/bumptech/glide/load/engine/
H A DEngineJobListener.java7 void onEngineJobComplete(Key key, EngineResource<?> resource); argument
9 void onEngineJobCancelled(EngineJob engineJob, Key key); argument
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DBaseKeyPool.java19 public void offer(T key) { argument
21 keyPool.offer(key);
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/cache/
H A DDiskCache.java12 * An interface to actually write data to a key in the disk cache.
25 * Get the cache for the value at the given key.
32 * @param key The key in the cache.
33 * @return An InputStream representing the data at key at the time get is called.
35 File get(Key key); argument
38 * Write to a key in the cache. {@link Writer} is used so that the cache implementation can perform actions after
41 * @param key The key to write to.
42 * @param writer An interface that will write data given an OutputStream for the key
44 put(Key key, Writer writer) argument
51 delete(Key key) argument
[all...]
H A DDiskCacheAdapter.java12 public File get(Key key) { argument
18 public void put(Key key, Writer writer) { argument
23 public void delete(Key key) { argument
H A DLruResourceCache.java30 protected void onItemEvicted(Key key, Resource<?> item) { argument
/external/guava/guava/src/com/google/common/cache/
H A DAbstractLoadingCache.java51 public V getUnchecked(K key) { argument
53 return get(key);
62 for (K key : keys) {
63 if (!result.containsKey(key)) {
64 result.put(key, get(key));
71 public final V apply(K key) { argument
72 return getUnchecked(key);
76 public void refresh(K key) { argument
H A DForwardingLoadingCache.java47 public V get(K key) throws ExecutionException { argument
48 return delegate().get(key);
52 public V getUnchecked(K key) { argument
53 return delegate().getUnchecked(key);
62 public V apply(K key) { argument
63 return delegate().apply(key);
67 public void refresh(K key) { argument
68 delegate().refresh(key);
H A DLoadingCache.java52 * Returns the value associated with {@code key} in this cache, first loading that value if
56 * {@code key}, simply waits for that thread to finish and returns its loaded value. Note that
62 * with {@code key} while the new value was loading then a removal notification will be sent for
76 V get(K key) throws ExecutionException; argument
79 * Returns the value associated with {@code key} in this cache, first loading that value if
85 * {@code key}, simply waits for that thread to finish and returns its loaded value. Note that
91 * with {@code key} while the new value was loading then a removal notification will be sent for
102 V getUnchecked(K key); argument
114 * or fails to return an entry for each requested key.
139 V apply(K key); argument
159 refresh(K key) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DAbstractSortedSetMultimap.java43 * @param map place to store the mapping from each key to its corresponding
66 * Returns a collection view of all values associated with a key. If no
67 * mappings in the multimap have the provided key, an empty collection is
74 * key, this method returns a {@link SortedSet}, instead of the
77 @Override public SortedSet<V> get(@Nullable K key) { argument
78 return (SortedSet<V>) super.get(key);
82 * Removes all values associated with a given key. The returned collection is
86 * key, this method returns a {@link SortedSet}, instead of the
89 @Override public SortedSet<V> removeAll(@Nullable Object key) { argument
90 return (SortedSet<V>) super.removeAll(key);
103 replaceValues( @ullable K key, Iterable<? extends V> values) argument
[all...]
H A DBiMap.java47 * different key in this bimap. The bimap will remain unmodified in this
51 V put(@Nullable K key, @Nullable V value); argument
56 * operation. If the bimap previously contained the provided key-value
62 * <p><b>Warning:</b> If an existing entry with this value is removed, the key
65 * @param key the key with which the specified value is to be associated
66 * @param value the value to be associated with the specified key
67 * @return the value which was previously associated with the key, which may
70 V forcePut(@Nullable K key, @Nullable V value); argument
101 * values to its associated key
[all...]
H A DCollectPreconditions.java29 static void checkEntryNotNull(Object key, Object value) { argument
30 if (key == null) {
31 throw new NullPointerException("null key in entry: null=" + value);
33 throw new NullPointerException("null value in entry: " + key + "=null");
H A DFilteredEntrySetMultimap.java44 public Set<V> get(K key) { argument
45 return (Set<V>) super.get(key);
49 public Set<V> removeAll(Object key) { argument
50 return (Set<V>) super.removeAll(key);
54 public Set<V> replaceValues(K key, Iterable<? extends V> values) { argument
55 return (Set<V>) super.replaceValues(key, values);
H A DFilteredKeyListMultimap.java44 public List<V> get(K key) { argument
45 return (List<V>) super.get(key);
49 public List<V> removeAll(@Nullable Object key) { argument
50 return (List<V>) super.removeAll(key);
54 public List<V> replaceValues(K key, Iterable<? extends V> values) { argument
55 return (List<V>) super.replaceValues(key, values);
H A DForwardingConcurrentMap.java42 public V putIfAbsent(K key, V value) { argument
43 return delegate().putIfAbsent(key, value);
47 public boolean remove(Object key, Object value) { argument
48 return delegate().remove(key, value);
52 public V replace(K key, V value) { argument
53 return delegate().replace(key, value);
57 public boolean replace(K key, V oldValue, V newValue) { argument
58 return delegate().replace(key, oldValue, newValue);
H A DForwardingListMultimap.java43 @Override public List<V> get(@Nullable K key) { argument
44 return delegate().get(key);
47 @Override public List<V> removeAll(@Nullable Object key) { argument
48 return delegate().removeAll(key);
51 @Override public List<V> replaceValues(K key, Iterable<? extends V> values) { argument
52 return delegate().replaceValues(key, values);
H A DForwardingSetMultimap.java45 @Override public Set<V> get(@Nullable K key) { argument
46 return delegate().get(key);
49 @Override public Set<V> removeAll(@Nullable Object key) { argument
50 return delegate().removeAll(key);
53 @Override public Set<V> replaceValues(K key, Iterable<? extends V> values) { argument
54 return delegate().replaceValues(key, values);
H A DForwardingSortedSetMultimap.java44 @Override public SortedSet<V> get(@Nullable K key) { argument
45 return delegate().get(key);
48 @Override public SortedSet<V> removeAll(@Nullable Object key) { argument
49 return delegate().removeAll(key);
53 K key, Iterable<? extends V> values) {
54 return delegate().replaceValues(key, values);
52 replaceValues( K key, Iterable<? extends V> values) argument
H A DImmutableEntry.java31 final K key; field in class:ImmutableEntry
34 ImmutableEntry(@Nullable K key, @Nullable V value) { argument
35 this.key = key;
40 return key;
H A DImmutableMapEntry.java27 * hash buckets for the key and the value. This allows reuse in {@link RegularImmutableMap} and
35 ImmutableMapEntry(K key, V value) { argument
36 super(key, value);
37 checkEntryNotNull(key, value);
56 TerminalEntry(K key, V value) { argument
57 super(key, value);
H A DListMultimap.java28 * A {@code Multimap} that can hold duplicate key-value pairs and that maintains
29 * the insertion ordering of values for a given key. See the {@link Multimap}
48 * <p>Because the values for a given key may have duplicates and follow the
53 List<V> get(@Nullable K key); argument
58 * <p>Because the values for a given key may have duplicates and follow the
63 List<V> removeAll(@Nullable Object key); argument
68 * <p>Because the values for a given key may have duplicates and follow the
73 List<V> replaceValues(K key, Iterable<? extends V> values); argument
89 * <p>Two {@code ListMultimap} instances are equal if, for each key, they
H A DSetMultimap.java28 * A {@code Multimap} that cannot hold duplicate key-value pairs. Adding a
29 * key-value pair that's already in the multimap has no effect. See the {@link
37 * <p>If the values corresponding to a single key should be ordered according to
42 * is not specified if key <em>or value</em> objects already present in the
59 * <p>Because a {@code SetMultimap} has unique values for a given key, this
64 Set<V> get(@Nullable K key); argument
69 * <p>Because a {@code SetMultimap} has unique values for a given key, this
74 Set<V> removeAll(@Nullable Object key); argument
79 * <p>Because a {@code SetMultimap} has unique values for a given key, this
86 Set<V> replaceValues(K key, Iterabl argument
[all...]
H A DSortedSetMultimap.java30 * A {@code SetMultimap} whose set of values for a given key are kept sorted;
32 * key-value pairs; adding a key-value pair that's already in the multimap has
55 * Returns a collection view of all values associated with a key. If no
56 * mappings in the multimap have the provided key, an empty collection is
63 * key, this method returns a {@link SortedSet}, instead of the
67 SortedSet<V> get(@Nullable K key); argument
70 * Removes all values associated with a given key.
73 * key, this method returns a {@link SortedSet}, instead of the
77 SortedSet<V> removeAll(@Nullable Object key); argument
90 replaceValues(K key, Iterable<? extends V> values) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DEnumBiMap.java46 * Returns a new, empty {@code EnumBiMap} using the specified key and value
49 * @param keyType the key type
61 * mapping, in order to determine the key and value types.
100 /** Returns the associated key type. */
111 K checkKey(K key) { argument
112 return checkNotNull(key);
H A DEnumHashBiMap.java47 * Returns a new, empty {@code EnumHashBiMap} using the specified key type.
49 * @param keyType the key type
59 * bimap has the same key type as the input bimap. Otherwise, the specified
60 * map must contain at least one mapping, in order to determine the key type.
84 K checkKey(K key) { argument
85 return checkNotNull(key);
88 @Override public V put(K key, @Nullable V value) { argument
89 return super.put(key, value);
92 @Override public V forcePut(K key, @Nullable V value) { argument
93 return super.forcePut(key, valu
[all...]
H A DHashBiMap.java74 @Override public V put(@Nullable K key, @Nullable V value) { argument
75 return super.put(key, value);
78 @Override public V forcePut(@Nullable K key, @Nullable V value) { argument
79 return super.forcePut(key, value);

Completed in 1197 milliseconds

1234567891011>>