/frameworks/base/packages/SystemUI/src/com/android/systemui/recents/views/ |
D | ViewPool.java | 26 public class ViewPool<V, T> { 29 public interface ViewPoolConsumer<V, T> { 30 public V createView(Context context); in createView() 31 public void prepareViewToEnterPool(V v); in prepareViewToEnterPool() 32 public void prepareViewToLeavePool(V v, T prepareData, boolean isNewView); in prepareViewToLeavePool() 33 public boolean hasPreferredData(V v, T preferredData); in hasPreferredData() 37 ViewPoolConsumer<V, T> mViewCreator; 38 LinkedList<V> mPool = new LinkedList<V>(); 41 public ViewPool(Context context, ViewPoolConsumer<V, T> viewCreator) { in ViewPool() argument 47 void returnViewToPool(V v) { in returnViewToPool() [all …]
|
/frameworks/opt/bitmap/src/com/android/bitmap/ |
D | UnrefedPooledCache.java | 44 public class UnrefedPooledCache<K, V extends Poolable> implements PooledCache<K, V> { 46 private final LinkedHashMap<K, V> mCache; 47 private final LinkedBlockingQueue<V> mPool; 49 private final LruCache<K, V> mNonPooledCache; 60 mCache = new LinkedHashMap<K, V>(0, 0.75f, true); in UnrefedPooledCache() 61 mPool = new LinkedBlockingQueue<V>(); in UnrefedPooledCache() 72 public V get(K key, boolean incrementRefCount) { in get() 75 V result = mCache.get(key); in get() 88 public V put(K key, V value) { in put() 96 final V prev; in put() [all …]
|
D | PooledCache.java | 19 public interface PooledCache<K, V> { 21 V get(K key, boolean incrementRefCount); in get() 22 V put(K key, V value); in put() 23 void offer(V scrapValue); in offer() 24 V poll(); in poll()
|
/frameworks/base/tools/layoutlib/bridge/src/android/util/ |
D | LruCache.java | 66 public class LruCache<K, V> { 67 private final LinkedHashMap<K, V> map; 89 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in LruCache() 115 public final V get(K key) { in get() 120 V mapValue; in get() 137 V createdValue = create(key); in get() 169 public final V put(K key, V value) { in put() 174 V previous; in put() 199 V value; in trimToSize() 214 Map.Entry<K, V> toEvict = null; in trimToSize() [all …]
|
/frameworks/support/v4/java/android/support/v4/util/ |
D | LruCache.java | 29 public class LruCache<K, V> { 30 private final LinkedHashMap<K, V> map; 52 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in LruCache() 77 public final V get(K key) { in get() 82 V mapValue; in get() 99 V createdValue = create(key); in get() 131 public final V put(K key, V value) { in put() 136 V previous; in put() 164 V value; in trimToSize() 175 Map.Entry<K, V> toEvict = map.entrySet().iterator().next(); in trimToSize() [all …]
|
D | ArrayMap.java | 50 public class ArrayMap<K, V> extends SimpleArrayMap<K, V> implements Map<K, V> { 51 MapCollections<K, V> mCollections; 71 private MapCollections<K, V> getCollection() { in getCollection() 73 mCollections = new MapCollections<K, V>() { in getCollection() 95 protected Map<K, V> colGetMap() { in getCollection() 100 protected void colPut(K key, V value) { in getCollection() 105 protected V colSetValue(int index, V value) { in getCollection() 138 public void putAll(Map<? extends K, ? extends V> map) { in putAll() 140 for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll() 178 public Set<Entry<K, V>> entrySet() { in entrySet() [all …]
|
D | MapCollections.java | 30 abstract class MapCollections<K, V> { 71 final class MapIterator implements Iterator<Map.Entry<K, V>>, Map.Entry<K, V> { 87 public Map.Entry<K, V> next() { in next() 114 public V getValue() { in getValue() 119 return (V)colGetEntry(mIndex, 1); in getValue() 123 public V setValue(V object) { in setValue() 163 final class EntrySet implements Set<Map.Entry<K, V>> { 165 public boolean add(Map.Entry<K, V> object) { in add() 170 public boolean addAll(Collection<? extends Map.Entry<K, V>> collection) { in addAll() 172 for (Map.Entry<K, V> entry : collection) { in addAll() [all …]
|
D | SimpleArrayMap.java | 31 public class SimpleArrayMap<K, V> { 322 public V get(Object key) { in get() 324 return index >= 0 ? (V)mArray[(index<<1)+1] : null; in get() 341 public V valueAt(int index) { in valueAt() 342 return (V)mArray[(index << 1) + 1]; in valueAt() 351 public V setValueAt(int index, V value) { in setValueAt() 353 V old = (V)mArray[index]; in setValueAt() 373 public V put(K key, V value) { in put() 385 final V old = (V)mArray[index]; in put() 428 public void putAll(SimpleArrayMap<? extends K, ? extends V> array) { in putAll() [all …]
|
/frameworks/base/core/java/android/util/ |
D | LruCache.java | 62 public class LruCache<K, V> { 63 private final LinkedHashMap<K, V> map; 85 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in LruCache() 110 public final V get(K key) { in get() 115 V mapValue; in get() 132 V createdValue = create(key); in get() 164 public final V put(K key, V value) { in put() 169 V previous; in put() 197 V value; in trimToSize() 208 Map.Entry<K, V> toEvict = map.eldest(); in trimToSize() [all …]
|
D | Property.java | 28 public abstract class Property<T, V> { 31 private final Class<V> mType; 54 public static <T, V> Property<T, V> of(Class<T> hostType, Class<V> valueType, String name) { in of() 55 return new ReflectiveProperty<T, V>(hostType, valueType, name); in of() 61 public Property(Class<V> type, String name) { in Property() 84 public void set(T object, V value) { in set() 91 public abstract V get(T object); in get() 103 public Class<V> getType() { in getType()
|
D | MapCollections.java | 32 abstract class MapCollections<K, V> { 73 final class MapIterator implements Iterator<Map.Entry<K, V>>, Map.Entry<K, V> { 89 public Map.Entry<K, V> next() { in next() 116 public V getValue() { in getValue() 121 return (V)colGetEntry(mIndex, 1); in getValue() 125 public V setValue(V object) { in setValue() 165 final class EntrySet implements Set<Map.Entry<K, V>> { 167 public boolean add(Map.Entry<K, V> object) { in add() 172 public boolean addAll(Collection<? extends Map.Entry<K, V>> collection) { in addAll() 174 for (Map.Entry<K, V> entry : collection) { in addAll() [all …]
|
D | ArrayMap.java | 47 public final class ArrayMap<K, V> implements Map<K, V> { 86 MapCollections<K, V> mCollections; 380 public V get(Object key) { in get() 382 return index >= 0 ? (V)mArray[(index<<1)+1] : null; in get() 399 public V valueAt(int index) { in valueAt() 400 return (V)mArray[(index << 1) + 1]; in valueAt() 409 public V setValueAt(int index, V value) { in setValueAt() 411 V old = (V)mArray[index]; in setValueAt() 433 public V put(K key, V value) { in put() 445 final V old = (V)mArray[index]; in put() [all …]
|
D | ReflectiveProperty.java | 26 class ReflectiveProperty<T, V> extends Property<T, V> { 45 public ReflectiveProperty(Class<T> propertyHolder, Class<V> valueType, String name) { in ReflectiveProperty() 97 private boolean typesMatch(Class<V> valueType, Class getterType) { in typesMatch() 115 public void set(T object, V value) { in set() 136 public V get(T object) { in get() 139 return (V) mGetter.invoke(object, (Object[])null); in get() 147 return (V) mField.get(object); in get()
|
/frameworks/compile/slang/BitWriter_2_9/ |
D | ValueEnumerator.cpp | 29 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) { in isIntOrIntVectorValue() argument 30 return V.first->getType()->isIntOrIntVectorTy(); in isIntOrIntVectorValue() 124 unsigned ValueEnumerator::getValueID(const Value *V) const { in getValueID() 125 if (isa<MDNode>(V) || isa<MDString>(V)) { in getValueID() 126 ValueMapType::const_iterator I = MDValueMap.find(V); in getValueID() 131 ValueMapType::const_iterator I = ValueMap.find(V); in getValueID() 151 const Value *V = I->first; in print() local 152 if (V->hasName()) in print() 153 OS << "Value: " << V->getName(); in print() 156 V->dump(); in print() [all …]
|
/frameworks/compile/slang/BitWriter_2_9_func/ |
D | ValueEnumerator.cpp | 29 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) { in isIntOrIntVectorValue() argument 30 return V.first->getType()->isIntOrIntVectorTy(); in isIntOrIntVectorValue() 124 unsigned ValueEnumerator::getValueID(const Value *V) const { in getValueID() 125 if (isa<MDNode>(V) || isa<MDString>(V)) { in getValueID() 126 ValueMapType::const_iterator I = MDValueMap.find(V); in getValueID() 131 ValueMapType::const_iterator I = ValueMap.find(V); in getValueID() 151 const Value *V = I->first; in print() local 152 if (V->hasName()) in print() 153 OS << "Value: " << V->getName(); in print() 156 V->dump(); in print() [all …]
|
/frameworks/compile/slang/BitWriter_3_2/ |
D | ValueEnumerator.cpp | 29 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) { in isIntOrIntVectorValue() argument 30 return V.first->getType()->isIntOrIntVectorTy(); in isIntOrIntVectorValue() 124 unsigned ValueEnumerator::getValueID(const Value *V) const { in getValueID() 125 if (isa<MDNode>(V) || isa<MDString>(V)) { in getValueID() 126 ValueMapType::const_iterator I = MDValueMap.find(V); in getValueID() 131 ValueMapType::const_iterator I = ValueMap.find(V); in getValueID() 151 const Value *V = I->first; in print() local 152 if (V->hasName()) in print() 153 OS << "Value: " << V->getName(); in print() 156 V->dump(); in print() [all …]
|
/frameworks/base/core/java/android/content/pm/ |
D | RegisteredServicesCache.java | 71 public abstract class RegisteredServicesCache<V> { 79 private final XmlSerializerAndParser<V> mSerializerAndParser; 86 private final SparseArray<UserServices<V>> mUserServices = new SparseArray<UserServices<V>>(2); 88 private static class UserServices<V> { 90 public final Map<V, Integer> persistentServices = Maps.newHashMap(); 92 public Map<V, ServiceInfo<V>> services = null; 95 private UserServices<V> findOrCreateUserLocked(int userId) { in findOrCreateUserLocked() 96 UserServices<V> services = mUserServices.get(userId); in findOrCreateUserLocked() 98 services = new UserServices<V>(); in findOrCreateUserLocked() 111 private RegisteredServicesCacheListener<V> mListener; [all …]
|
/frameworks/opt/telephony/src/java/com/google/android/mms/util/ |
D | AbstractCache.java | 24 public abstract class AbstractCache<K, V> { 31 private final HashMap<K, CacheEntry<V>> mCacheMap; 34 mCacheMap = new HashMap<K, CacheEntry<V>>(); in AbstractCache() 37 public boolean put(K key, V value) { in put() 52 CacheEntry<V> cacheEntry = new CacheEntry<V>(); in put() 64 public V get(K key) { in get() 70 CacheEntry<V> cacheEntry = mCacheMap.get(key); in get() 82 public V purge(K key) { in purge() 87 CacheEntry<V> v = mCacheMap.remove(key); in purge() 108 private static class CacheEntry<V> { [all …]
|
/frameworks/base/core/java/com/google/android/collect/ |
D | Maps.java | 32 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap() 33 return new HashMap<K, V>(); in newHashMap() 39 public static <K, V> ArrayMap<K, V> newArrayMap() { in newArrayMap() 40 return new ArrayMap<K, V>(); in newArrayMap()
|
/frameworks/base/test-runner/src/android/test/ |
D | SimpleCache.java | 22 abstract class SimpleCache<K, V> { 23 private Map<K, V> map = new HashMap<K, V>(); 25 protected abstract V load(K key); in load() 27 final V get(K key) { in get() 31 V value = load(key); in get()
|
/frameworks/base/packages/SystemUI/src/com/android/systemui/recents/model/ |
D | KeyStoreLruCache.java | 29 public class KeyStoreLruCache<V> { 34 LruCache<Integer, V> mCache; 37 mCache = new LruCache<Integer, V>(cacheSize) { in KeyStoreLruCache() 40 protected void entryRemoved(boolean evicted, Integer taskId, V oldV, V newV) { in KeyStoreLruCache() 47 final V get(Task.TaskKey key) { in get() 54 final V getAndInvalidateIfModified(Task.TaskKey key) { in getAndInvalidateIfModified() 68 final void put(Task.TaskKey key, V value) { in put()
|
/frameworks/base/graphics/java/android/graphics/ |
D | Color.java | 123 int V = Math.max(b, Math.max(r, g)); in hue() local 128 if (V == temp) { in hue() 131 final float vtemp = (float) (V - temp); in hue() 132 final float cr = (V - r) / vtemp; in hue() 133 final float cg = (V - g) / vtemp; in hue() 134 final float cb = (V - b) / vtemp; in hue() 136 if (r == V) { in hue() 138 } else if (g == V) { in hue() 166 int V = Math.max(b, Math.max(r, g)); in saturation() local 171 if (V == temp) { in saturation() [all …]
|
/frameworks/base/core/java/android/animation/ |
D | TypeConverter.java | 25 public abstract class TypeConverter<T, V> { 27 private Class<V> mToClass; 29 public TypeConverter(Class<T> fromClass, Class<V> toClass) { in TypeConverter() 39 Class<V> getTargetType() { in getTargetType() 55 public abstract V convert(T value); in convert()
|
D | BidirectionalTypeConverter.java | 25 public abstract class BidirectionalTypeConverter<T, V> extends TypeConverter<T, V> { 28 public BidirectionalTypeConverter(Class<T> fromClass, Class<V> toClass) { in BidirectionalTypeConverter() 39 public abstract T convertBack(V value); in convertBack() 48 public BidirectionalTypeConverter<V, T> invert() { in invert()
|
/frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/ |
D | LinkedHashMap_Delegate.java | 32 public static <K,V> Map.Entry<K,V> eldest(LinkedHashMap<K,V> map) { in eldest() 33 Iterator<Entry<K, V>> iterator = map.entrySet().iterator(); in eldest()
|