Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 127) sorted by relevance

123456

/frameworks/base/cmds/incident_helper/testdata/
Dprocrank.txt2 1119 2607640K 339564K 180278K 114216K 1584K 46K 0K 10K system_server
3 649 11016K 1448K 98K 48K 472K 342K 212K 75K /vendor/bin/qseecomd
5 1201993K 935300K 88164K 31069K 27612K 6826K TOTAL
7 ZRAM: 6828K physical used for 31076K in swap (524284K total swap)
8 RAM: 3843972K total, 281424K free, 116764K buffers, 1777452K cached, 1136K shmem, 217916K slab
Dprocrank_short.txt2 1119 2607640K 339564K 180278K 114216K system_server
3 649 11016K 1448K 98K 48K /vendor/bin/qseecomd
5 1201993K 935300K TOTAL
7 RAM: 3843972K total, 281424K free, 116764K buffers, 1777452K cached, 1136K shmem, 217916K slab
/frameworks/opt/gamesdk/third_party/protobuf-3.0.0/java/core/src/main/java/com/google/protobuf/
DMapFieldLite.java47 public final class MapFieldLite<K, V> extends LinkedHashMap<K, V> {
55 private MapFieldLite(Map<K, V> mapData) { in MapFieldLite() argument
68 public static <K, V> MapFieldLite<K, V> emptyMapField() { in emptyMapField()
69 return (MapFieldLite<K, V>) EMPTY_MAP_FIELD; in emptyMapField()
72 public void mergeFrom(MapFieldLite<K, V> other) { in mergeFrom() argument
80 @Override public Set<Map.Entry<K, V>> entrySet() { in entrySet()
81 return isEmpty() ? Collections.<Map.Entry<K, V>>emptySet() : super.entrySet(); in entrySet()
89 @Override public V put(K key, V value) { in put()
94 public V put(Map.Entry<K, V> entry) { in put() argument
98 @Override public void putAll(Map<? extends K, ? extends V> m) { in putAll() argument
[all …]
DMapEntry.java51 public final class MapEntry<K, V> extends AbstractMessage {
53 private static final class Metadata<K, V> extends MapEntryLite.Metadata<K, V> {
56 public final Parser<MapEntry<K, V>> parser;
60 MapEntry<K, V> defaultInstance, in Metadata() argument
65 this.parser = new AbstractParser<MapEntry<K, V>>() { in Metadata()
68 public MapEntry<K, V> parsePartialFrom( in Metadata()
71 return new MapEntry<K, V>(Metadata.this, input, extensionRegistry); in Metadata()
77 private final K key;
79 private final Metadata<K, V> metadata;
84 WireFormat.FieldType keyType, K defaultKey, in MapEntry()
[all …]
DMapField.java57 public class MapField<K, V> implements MutabilityOracle {
80 private MutatabilityAwareMap<K, V> mapData;
84 private static interface Converter<K, V> {
85 Message convertKeyAndValueToMessage(K key, V value); in convertKeyAndValueToMessage()
86 void convertMessageToKeyAndValue(Message message, Map<K, V> map); in convertMessageToKeyAndValue() argument
91 private static class ImmutableMessageConverter<K, V> implements Converter<K, V> {
92 private final MapEntry<K, V> defaultEntry;
93 public ImmutableMessageConverter(MapEntry<K, V> defaultEntry) { in ImmutableMessageConverter() argument
98 public Message convertKeyAndValueToMessage(K key, V value) { in convertKeyAndValueToMessage()
103 public void convertMessageToKeyAndValue(Message message, Map<K, V> map) { in convertMessageToKeyAndValue() argument
[all …]
DMapEntryLite.java46 public class MapEntryLite<K, V> {
48 static class Metadata<K, V> {
50 public final K defaultKey;
55 WireFormat.FieldType keyType, K defaultKey, in Metadata()
67 private final Metadata<K, V> metadata;
68 private final K key;
73 WireFormat.FieldType keyType, K defaultKey, in MapEntryLite()
75 this.metadata = new Metadata<K, V>(keyType, defaultKey, valueType, defaultValue); in MapEntryLite()
81 private MapEntryLite(Metadata<K, V> metadata, K key, V value) { in MapEntryLite() argument
87 public K getKey() { in getKey()
[all …]
DSmallSortedMap.java87 class SmallSortedMap<K extends Comparable<K>, V> extends AbstractMap<K, V> {
132 static <K extends Comparable<K>, V> SmallSortedMap<K, V> newInstanceForTest(
134 return new SmallSortedMap<K, V>(arraySize);
142 private Map<K, V> overflowEntries;
167 Collections.<K, V>emptyMap() :
184 public Map.Entry<K, V> getArrayEntryAt(int index) {
194 public Iterable<Map.Entry<K, V>> getOverflowEntries() {
196 EmptySet.<Map.Entry<K, V>>iterable() :
214 final K key = (K) o;
227 final K key = (K) o; in get()
[all …]
DLazyField.java91 static class LazyEntry<K> implements Entry<K, Object> {
92 private Entry<K, LazyField> entry;
94 private LazyEntry(Entry<K, LazyField> entry) { in LazyEntry() argument
99 public K getKey() { in getKey()
127 static class LazyIterator<K> implements Iterator<Entry<K, Object>> {
128 private Iterator<Entry<K, Object>> iterator;
130 public LazyIterator(Iterator<Entry<K, Object>> iterator) { in LazyIterator() argument
141 public Entry<K, Object> next() { in next()
142 Entry<K, ?> entry = iterator.next(); in next()
144 return new LazyEntry<K>((Entry<K, LazyField>) entry); in next()
[all …]
DInternal.java449 public static class MapAdapter<K, V, RealValue> extends AbstractMap<K, V> {
474 private final Map<K, RealValue> realMap;
477 public MapAdapter(Map<K, RealValue> realMap, in MapAdapter() argument
494 public V put(K key, V value) { in put()
503 public Set<java.util.Map.Entry<K, V>> entrySet() { in entrySet()
507 private class SetAdapter extends AbstractSet<Map.Entry<K, V>> {
508 private final Set<Map.Entry<K, RealValue>> realSet;
509 public SetAdapter(Set<Map.Entry<K, RealValue>> realSet) { in SetAdapter() argument
514 public Iterator<java.util.Map.Entry<K, V>> iterator() { in iterator()
524 private class IteratorAdapter implements Iterator<Map.Entry<K, V>> {
[all …]
/frameworks/base/packages/SystemUI/src/com/android/systemui/util/leak/
DWeakIdentityHashMap.java30 public class WeakIdentityHashMap<K,V> {
32 private final HashMap<WeakReference<K>,V> mMap = new HashMap<>();
42 public void put(K key, V value) { in put()
47 public V get(K key) { in get()
57 public Set<Map.Entry<WeakReference<K>, V>> entrySet() { in entrySet()
71 private static class CmpWeakReference<K> extends WeakReference<K> {
74 public CmpWeakReference(K key) { in CmpWeakReference()
79 public CmpWeakReference(K key, ReferenceQueue<Object> refQueue) { in CmpWeakReference()
89 K k = get(); in equals()
/frameworks/opt/net/wifi/service/java/com/android/server/wifi/util/
DObjectCounter.java32 public class ObjectCounter<K> implements Iterable<Map.Entry<K, Integer>> {
33 private ArrayMap<K, Integer> mCounter;
56 public int getCount(K key) { in getCount()
63 public void increment(K key) { in increment()
70 public void add(K key, int count) { in add()
88 public Iterator<Map.Entry<K, Integer>> iterator() { in iterator()
114 public <T> T[] toProto(Class<T> protoClass, ProtobufConverter<K, T> converter) { in toProto() argument
118 for (Map.Entry<K, Integer> entry : this) { in toProto()
/frameworks/opt/gamesdk/third_party/protobuf-3.0.0/javanano/src/main/java/com/google/protobuf/nano/
DMapFactories.java41 <K, V> Map<K, V> forMap(Map<K, V> oldMap); in forMap() argument
57 public <K, V> Map<K, V> forMap(Map<K, V> oldMap) { in forMap() argument
59 return new HashMap<K, V>(); in forMap()
DInternalNano.java391 public static final <K, V> Map<K, V> mergeMapEntry( in mergeMapEntry() argument
393 Map<K, V> map, in mergeMapEntry()
403 K key = null; in mergeMapEntry()
410 key = (K) input.readPrimitiveField(keyType); in mergeMapEntry()
428 key = (K) primitiveDefaultValue(keyType); in mergeMapEntry()
440 public static <K, V> void serializeMapField( in serializeMapField()
442 Map<K, V> map, int number, int keyType, int valueType) in serializeMapField() argument
444 for (Entry<K, V> entry: map.entrySet()) { in serializeMapField()
445 K key = entry.getKey(); in serializeMapField()
461 public static <K, V> int computeMapFieldSize( in computeMapFieldSize()
[all …]
/frameworks/base/core/java/android/util/
DLruCache.java63 public class LruCache<K, V> {
65 private final LinkedHashMap<K, V> map;
87 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in LruCache()
112 public final V get(K key) { in get()
166 public final V put(K key, V value) { in put()
198 K key; in trimToSize()
210 Map.Entry<K, V> toEvict = map.eldest(); in trimToSize()
231 public final V remove(K key) { in remove()
266 protected void entryRemoved(boolean evicted, K key, V oldValue, V newValue) {} in entryRemoved()
283 protected V create(K key) { in create()
[all …]
DMapCollections.java32 abstract class MapCollections<K, V> {
74 final class MapIterator implements Iterator<Map.Entry<K, V>>, Map.Entry<K, V> {
90 public Map.Entry<K, V> next() { in next()
109 public K getKey() { in getKey()
114 return (K)colGetEntry(mIndex, 0); in getKey()
167 final class EntrySet implements Set<Map.Entry<K, V>> {
169 public boolean add(Map.Entry<K, V> object) { in add() argument
174 public boolean addAll(Collection<? extends Map.Entry<K, V>> collection) { in addAll() argument
176 for (Map.Entry<K, V> entry : collection) { in addAll()
217 public Iterator<Map.Entry<K, V>> iterator() { in iterator()
[all …]
/frameworks/base/core/java/com/google/android/collect/
DMaps.java34 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap()
35 return new HashMap<K, V>(); in newHashMap()
41 public static <K, V> ArrayMap<K, V> newArrayMap() { in newArrayMap()
42 return new ArrayMap<K, V>(); in newArrayMap()
/frameworks/opt/bitmap/src/com/android/bitmap/
DUnrefedPooledCache.java44 public class UnrefedPooledCache<K, V extends Poolable> implements PooledCache<K, V> {
46 private final LinkedHashMap<K, V> mCache;
49 private final LruCache<K, V> mNonPooledCache;
60 mCache = new LinkedHashMap<K, V>(0, 0.75f, true); in UnrefedPooledCache()
72 public V get(K key, boolean incrementRefCount) { in get()
88 public V put(K key, V value) { in put()
131 Map.Entry<K, V> eldestUnref = null; in poll()
132 for (Map.Entry<K, V> entry : mCache.entrySet()) { in poll()
191 for (Map.Entry<K, V> item : mCache.entrySet()) { in toDebugString()
201 for (Map.Entry<K, V> item : mNonPooledCache.snapshot().entrySet()) { in toDebugString()
[all …]
DPooledCache.java19 public interface PooledCache<K, V> {
21 V get(K key, boolean incrementRefCount); in get()
22 V put(K key, V value); in put()
/frameworks/base/test-runner/src/android/test/
DSimpleCache.java23 abstract class SimpleCache<K, V> {
24 private Map<K, V> map = new HashMap<K, V>();
26 protected abstract V load(K key); in load()
28 final V get(K key) { in get()
/frameworks/opt/telephony/src/java/com/google/android/mms/util/
DAbstractCache.java24 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()
64 public V get(K key) { in get()
82 public V purge(K key) { in purge()
/frameworks/layoutlib/create/src/com/android/tools/layoutlib/java/
DLinkedHashMap_Delegate.java32 public static <K,V> Map.Entry<K,V> eldest(LinkedHashMap<K,V> map) { in eldest() argument
33 Iterator<Entry<K, V>> iterator = map.entrySet().iterator(); in eldest()
/frameworks/rs/cpp/util/
DTypeHelpers.h249 template <typename K, typename V>
250 struct trait_trivial_ctor< key_value_pair_t<K, V> >
251 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
252 template <typename K, typename V>
253 struct trait_trivial_dtor< key_value_pair_t<K, V> >
254 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
255 template <typename K, typename V>
256 struct trait_trivial_copy< key_value_pair_t<K, V> >
257 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
258 template <typename K, typename V>
[all …]
/frameworks/rs/cpu_ref/
DrsCpuBLASDispatch.h40 const int N, const int K, const float *A, const int lda,
51 const int N, const int K, const float *A, const int lda,
73 const int N, const int K, const double *A, const int lda,
84 const int N, const int K, const double *A, const int lda,
106 const int N, const int K, const void *A, const int lda,
117 const int N, const int K, const void *A, const int lda,
139 const int N, const int K, const void *A, const int lda,
150 const int N, const int K, const void *A, const int lda,
165 const int N, const int K, const float alpha, const float *A,
194 const int N, const int K, const double alpha, const double *A,
[all …]
/frameworks/base/tests/LegacyRestoreTest/
Djbmr2-encrypted-settings-abcd.ab10 ���$t�)�&����Y�e�Y��� ?A>Q��ª_j��a<�E��K��g�;�e���c��:k�(�K*rFA�ȏ�"��wR���&�%�?\��}����z��…
13 …tክ�:[�]�r )��Ayާ�5;JM����<pJ�˓�����'�?H���k��N�<�7��Ww4�-XReTr�VZ��K<����'ɷ���;����…
14 �&d?�6g1g�K��^�?�(<Ȭ��F�R���2’]����?e�p��� EO���3 ����{n{��Sn$��� ��fcʲ1i�Bu�z�1z� � XG��E�K�…
15 …K ��;�Q2���+�b�w�-uy xj��^�qqy��>� ��`�x���⼖��0���I�0j��T�z�,aB�Zo���(7 �V5��.���$����…
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/
DSimpleCache.java25 class SimpleCache<K, V> extends LinkedHashMap<K, V> {
35 protected boolean removeEldestEntry(final Map.Entry<K, V> eldest) { in removeEldestEntry() argument

123456