Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 145) 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/base/core/java/android/util/
DSparseArrayMap.java34 public class SparseArrayMap<K, V> {
35 private final SparseArray<ArrayMap<K, V>> mData = new SparseArray<>();
38 public void add(int key, @NonNull K mapKey, @Nullable V obj) { in add()
39 ArrayMap<K, V> data = mData.get(key); in add()
55 public boolean contains(int key, @NonNull K mapKey) { in contains()
70 public V delete(int key, @NonNull K mapKey) { in delete()
71 ArrayMap<K, V> data = mData.get(key); in delete()
82 public V get(int key, @NonNull K mapKey) { in get()
83 ArrayMap<K, V> data = mData.get(key); in get()
95 public V getOrDefault(int key, @NonNull K mapKey, V defaultValue) { in getOrDefault()
[all …]
DLruCache.java64 public class LruCache<K, V> {
66 private final LinkedHashMap<K, V> map;
88 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in LruCache()
113 public final V get(K key) { in get()
167 public final V put(K key, V value) { in put()
199 K key; in trimToSize()
211 Map.Entry<K, V> toEvict = map.eldest(); in trimToSize()
232 public final V remove(K key) { in remove()
267 protected void entryRemoved(boolean evicted, K key, V oldValue, V newValue) {} in entryRemoved()
284 protected V create(K key) { in create()
[all …]
DMapCollections.java34 abstract class MapCollections<K, V> {
76 final class MapIterator implements Iterator<Map.Entry<K, V>>, Map.Entry<K, V> {
92 public Map.Entry<K, V> next() { in next()
111 public K getKey() { in getKey()
116 return (K)colGetEntry(mIndex, 0); in getKey()
169 final class EntrySet implements Set<Map.Entry<K, V>> {
171 public boolean add(Map.Entry<K, V> object) { in add() argument
176 public boolean addAll(Collection<? extends Map.Entry<K, V>> collection) { in addAll() argument
178 for (Map.Entry<K, V> entry : collection) { in addAll()
219 public Iterator<Map.Entry<K, V>> iterator() { in iterator()
[all …]
/frameworks/base/services/core/java/com/android/server/utils/
DWatchedArrayMap.java35 public class WatchedArrayMap<K, V> extends WatchableImpl
36 implements Map<K, V>, Snappable {
39 private final ArrayMap<K, V> mStorage;
149 mStorage = new ArrayMap<K, V>(capacity, identityHashCode); in WatchedArrayMap()
155 public WatchedArrayMap(@Nullable Map<? extends K, ? extends V> map) { in WatchedArrayMap() argument
156 mStorage = new ArrayMap<K, V>(); in WatchedArrayMap()
165 public WatchedArrayMap(@NonNull ArrayMap<K, V> c) { in WatchedArrayMap() argument
172 public WatchedArrayMap(@NonNull WatchedArrayMap<K, V> c) { in WatchedArrayMap() argument
179 public void copyFrom(@NonNull ArrayMap<K, V> src) { in copyFrom() argument
191 public void copyTo(@NonNull ArrayMap<K, V> dst) { in copyTo() argument
[all …]
/frameworks/native/include/ftl/
Dinitializer_list.h68 template <typename K, typename V>
74 template <typename K, typename V, std::size_t... Sizes, typename... Types>
75 struct InitializerList<KeyValue<K, V>, std::index_sequence<Sizes...>, Types...> {
78 [[nodiscard]] constexpr auto operator()(K&& k, Args&&... args) && -> InitializerList<
79 KeyValue<K, V>, std::index_sequence<Sizes..., 3>, Types..., std::piecewise_construct_t,
80 std::tuple<K&&>, std::tuple<Args&&...>> {
83 std::forward_as_tuple(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)),
97 template <typename K, typename V, typename... Args>
99 return list<KeyValue<K, V>>(std::forward<Args>(args)...);
102 template <typename K, typename V>
[all …]
Dsmall_map.h57 template <typename K, typename V, std::size_t N>
59 using Map = SmallVector<std::pair<const K, V>, N>;
62 using key_type = K;
178 template <typename K, typename V, std::size_t... Sizes, typename... Types>
179 SmallMap(InitializerList<KeyValue<K, V>, std::index_sequence<Sizes...>, Types...>&&)
180 -> SmallMap<K, V, sizeof...(Sizes)>;
183 template <typename K, typename V, std::size_t N, typename Q, typename W, std::size_t M>
184 bool operator==(const SmallMap<K, V, N>& lhs, const SmallMap<Q, W, M>& rhs) {
198 template <typename K, typename V, std::size_t N, typename Q, typename W, std::size_t M>
199 inline bool operator!=(const SmallMap<K, V, N>& lhs, const SmallMap<Q, W, M>& rhs) {
/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/base/services/tests/servicestests/src/com/android/server/timedetector/
DArrayMapWithHistoryTest.java115 private static <K, V> void putAndCompareReturnValue(ArrayMapWithHistory<K, V> historyMap, in putAndCompareReturnValue() argument
116 ArrayMap<K, V> arrayMap, K key, V value) { in putAndCompareReturnValue() argument
120 private static class Entry<K, V> {
121 public final K key;
124 Entry(K key, V value) { in Entry()
130 private static <K, V> Entry<K, V> entry(K key, V value) { in entry()
135 private static <K, V> void compareGetAndSizeForKeys(ArrayMapWithHistory<K, V> historyMap, in compareGetAndSizeForKeys() argument
136 ArrayMap<K, V> arrayMap, Entry<K, V>... expectedEntries) { in compareGetAndSizeForKeys() argument
137 for (Entry<K, V> expectedEntry : expectedEntries) { in compareGetAndSizeForKeys()
/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/telephony/src/java/com/android/internal/telephony/
DBiMap.java27 public class BiMap<K, V> {
28 private Map<K, V> mPrimaryMap = new ArrayMap<>();
29 private Map<V, K> mSecondaryMap = new ArrayMap<>();
31 public boolean put(K key, V value) { in put()
42 public boolean remove(K key) { in remove()
62 public V getValue(K key) { in getValue()
66 public K getKey(V value) { in getKey()
/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/base/telephony/common/com/google/android/mms/util/
DAbstractCache.java26 public abstract class AbstractCache<K, V> {
33 private final HashMap<K, CacheEntry<V>> mCacheMap;
37 mCacheMap = new HashMap<K, CacheEntry<V>>(); in AbstractCache()
41 public boolean put(K key, V value) { in put()
69 public V get(K key) { in get()
88 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/packages/SystemUI/src/com/android/systemui/controls/management/
DAllModel.kt112 private class OrderedMap<K, V>(private val map: MutableMap<K, V>) : MutableMap<K, V> by map { in <lambda>()
114 val orderedKeys = mutableListOf<K>() in <lambda>()
116 override fun put(key: K, value: V): V? { in <lambda>()
128 override fun remove(key: K): V? { in <lambda>()
/frameworks/rs/cpp/
DScriptIntrinsicBLAS.cpp52 int M, int N, int K, int incX, int incY, int KL, int KU, in setUpBLASCall() argument
67 call.K = K; in setUpBLASCall()
108 int TransB, int Side, int Uplo, int Diag, int M, int N, int K, in nScriptIntrinsicBLAS_Single() argument
112 M, N, K, incX, incY, KL, KU, alpha, beta, 0.0, 0.0, in nScriptIntrinsicBLAS_Single()
122 int TransB, int Side, int Uplo, int Diag, int M, int N, int K, in nScriptIntrinsicBLAS_Double() argument
126 M, N, K, incX, incY, KL, KU, 0.0f, 0.0f, alpha, beta, in nScriptIntrinsicBLAS_Double()
135 int TransB, int Side, int Uplo, int Diag, int M, int N, int K, in nScriptIntrinsicBLAS_Complex() argument
139 M, N, K, incX, incY, KL, KU, 0.0f, 0.0f, 0.0, 0.0, in nScriptIntrinsicBLAS_Complex()
148 int TransB, int Side, int Uplo, int Diag, int M, int N, int K, in nScriptIntrinsicBLAS_Z() argument
152 M, N, K, incX, incY, KL, KU, 0.0f, 0.0f, 0.0, 0.0, in nScriptIntrinsicBLAS_Z()
[all …]
/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
/frameworks/base/services/core/java/com/android/server/vcn/util/
DPersistableBundleUtils.java220 public static <K, V> PersistableBundle fromMap( in fromMap() argument
221 @NonNull Map<K, V> in, in fromMap()
222 @NonNull Serializer<K> keySerializer, in fromMap()
228 for (Entry<K, V> entry : in.entrySet()) { in fromMap()
260 public static <K, V> LinkedHashMap<K, V> toMap( in toMap()
262 @NonNull Deserializer<K> keyDeserializer, in toMap()
265 final LinkedHashMap<K, V> result = new LinkedHashMap<>(mapSize); in toMap()
273 final K key = keyDeserializer.fromPersistableBundle(keyBundle); in toMap()
/frameworks/base/media/tests/contents/media_api/music/
Dtest_amr_ietf.amr2 …M���R�['���E`|X�<Mq�I�C��:8%�h��[(q]���V���<`<4]�� ��x��K˳�'+�{��{���KP<Zga4� ��^�?�y苁�s`…
6 ]�is��n�,�U����!������<x@0�E�ȍ:�_K�.LJ�:����<$9(6pT��s:����A�I�uNiS��vp<ۘ��R�����`…
21 ؠ<���W%�g-KLo�}�G�@J��bҗ�Z�<[›�'����?��K���B�j˞|���!�`<4���k��3�::�۩m�O�$�q��`+� <Y���"��…
35 …���k/0��"Y]�Qa�<x;0~��ie����U+�t���Ɓziy�Z�<G9�_|���K]\%I\�h6J��yP`��<N�����燌��b<̎�K"…
43 …b�:�\W�C���E�M�������<�y:��!�R�.UCR�p��.�2�}`����<�)��)�l��T�h���~\�(�_��<������K�…
97 �W�<h[t��(��J��UJ��?8K����|AՐ<�)aG���瘐 �K��� ��b��7�奒�_��<�qwH��0r݄zCmu�����w���AD�<#�`l…
124 ���i��0<�-&5Wq���9\{��5�����T���Z!�<0�>`&K��X�Z͐��K�b!!� EꙸtP<8�&K��w�J������P��
125 …I�������j$�W��j����'��Kޜ0<DvcA�w�UХrT̈́j�J��B��� 5p<��}J��i�~)�ՄA��xD0a�?����<�6)A�_���…
153 ���K(n�3����aV�T�`<dG�Z!��̾�1�Q*S��f�D�R�]@<�'����8����2���=��������<"dG�3�A��,�Z()N4��d…
154 …i�5:8)]�b�q��O<�d��w'��LZæ�u,k0f��9)�"�W4�<>$G��<��-��3`Ҭ'<��o�?�`볠<�$6�֒��$�K��L�'ܰ�

123456