Home
last modified time | relevance | path

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

12345678

/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/services/permission/java/com/android/server/permission/access/collection/
DIndexedMap.kt21 typealias IndexedMap<K, V> = ArrayMap<K, V> in <lambda>()
23 inline fun <K, V> IndexedMap<K, V>.allIndexed(predicate: (Int, K, V) -> Boolean): Boolean { in <lambda>()
32 inline fun <K, V> IndexedMap<K, V>.anyIndexed(predicate: (Int, K, V) -> Boolean): Boolean { in anyIndexed()
41 inline fun <K, V> IndexedMap<K, V>.copy(copyValue: (V) -> V): IndexedMap<K, V> = in copy()
48 inline fun <K, V, R> IndexedMap<K, V>.firstNotNullOfOrNullIndexed(transform: (Int, K, V) -> R): R? { in firstNotNullOfOrNullIndexed()
55 inline fun <K, V> IndexedMap<K, V>.forEachIndexed(action: (Int, K, V) -> Unit) { in forEachIndexed()
61 inline fun <K, V> IndexedMap<K, V>.forEachKeyIndexed(action: (Int, K) -> Unit) { in forEachKeyIndexed()
67 inline fun <K, V> IndexedMap<K, V>.forEachReversedIndexed(action: (Int, K, V) -> Unit) { in forEachReversedIndexed()
73 inline fun <K, V> IndexedMap<K, V>.forEachValueIndexed(action: (Int, V) -> Unit) { in forEachValueIndexed()
79 inline fun <K, V> IndexedMap<K, V>.getOrPut(key: K, defaultValue: () -> V): V { in getOrPut()
[all …]
/frameworks/libs/net/common/device/com/android/net/module/util/
DIBpfMap.java32 public interface IBpfMap<K extends Struct, V extends Struct> extends AutoCloseable {
34 void updateEntry(K key, V value) throws ErrnoException; in updateEntry()
37 void insertEntry(K key, V value) throws ErrnoException, IllegalStateException; in insertEntry()
40 void replaceEntry(K key, V value) throws ErrnoException, NoSuchElementException; in replaceEntry()
47 boolean insertOrReplaceEntry(K key, V value) throws ErrnoException; in insertOrReplaceEntry()
50 boolean deleteEntry(K key) throws ErrnoException; in deleteEntry()
56 K getNextKey(@NonNull K key) throws ErrnoException; in getNextKey()
59 K getFirstKey() throws ErrnoException; in getFirstKey()
62 boolean containsKey(@NonNull K key) throws ErrnoException; in containsKey()
65 V getValue(@NonNull K key) throws ErrnoException; in getValue()
[all …]
DBpfDump.java44 public static <K extends Struct, V extends Struct> String toBase64EncodedString( in toBase64EncodedString()
45 @NonNull final K key, @NonNull final V value) { in toBase64EncodedString()
71 public static <K extends Struct, V extends Struct> Pair<K, V> fromBase64EncodedString( in fromBase64EncodedString()
72 Class<K> keyClass, Class<V> valueClass, @NonNull String base64Str) { in fromBase64EncodedString()
78 final K k = parseStruct(keyClass, keyValueStrs[0]); in fromBase64EncodedString()
86 public static <K extends Struct, V extends Struct> void dumpMap(IBpfMap<K, V> map, in dumpMap() argument
87 PrintWriter pw, String mapName, BiFunction<K, V, String> entryToString) { in dumpMap() argument
94 public static <K extends Struct, V extends Struct> void dumpMap(IBpfMap<K, V> map, in dumpMap() argument
95 PrintWriter pw, String mapName, String header, BiFunction<K, V, String> entryToString) { in dumpMap() argument
118 public static <K extends Struct, V extends Struct> void dumpMapStatus(IBpfMap<K, V> map, in dumpMapStatus() argument
DBpfMap.java43 public class BpfMap<K extends Struct, V extends Struct> implements IBpfMap<K, V> {
62 private final Class<K> mKeyClass;
97 public BpfMap(@NonNull final String path, final int flag, final Class<K> key, in BpfMap()
111 public void updateEntry(K key, V value) throws ErrnoException { in updateEntry()
120 public void insertEntry(K key, V value) in insertEntry()
137 public void replaceEntry(K key, V value) in replaceEntry()
156 public boolean insertOrReplaceEntry(K key, V value) in insertOrReplaceEntry()
183 public boolean deleteEntry(K key) throws ErrnoException { in deleteEntry()
193 private K getNextKeyInternal(@Nullable K key) throws ErrnoException { in getNextKeyInternal()
210 public K getNextKey(@NonNull K key) throws ErrnoException { in getNextKey()
[all …]
/frameworks/base/core/java/android/util/
DSparseArrayMap.java34 public class SparseArrayMap<K, V> {
35 private final SparseArray<ArrayMap<K, V>> mData = new SparseArray<>();
44 public V add(int key, @NonNull K mapKey, @Nullable V obj) { in add()
45 ArrayMap<K, V> data = mData.get(key); in add()
61 public boolean contains(int key, @NonNull K mapKey) { in contains()
84 public V delete(int key, @NonNull K mapKey) { in delete()
85 ArrayMap<K, V> data = mData.get(key); in delete()
104 public V get(int key, @NonNull K mapKey) { in get()
105 ArrayMap<K, V> data = mData.get(key); in get()
117 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/libs/net/common/testutils/devicetests/com/android/testutils/
DTestBpfMap.java43 public class TestBpfMap<K extends Struct, V extends Struct> implements IBpfMap<K, V> {
44 private final ConcurrentHashMap<K, V> mMap = new ConcurrentHashMap<>();
47 public TestBpfMap(final Class<K> key, final Class<V> value) { in TestBpfMap()
51 public void forEach(ThrowingBiConsumer<K, V> action) throws ErrnoException { in forEach() argument
54 for (Map.Entry<K, V> entry : mMap.entrySet()) { in forEach()
60 public void updateEntry(K key, V value) throws ErrnoException { in updateEntry()
65 public void insertEntry(K key, V value) throws ErrnoException, in insertEntry()
75 public void replaceEntry(K key, V value) throws ErrnoException, NoSuchElementException { in replaceEntry()
81 public boolean insertOrReplaceEntry(K key, V value) throws ErrnoException { in insertOrReplaceEntry()
99 public K getNextKey(@NonNull K key) { in getNextKey()
[all …]
/frameworks/native/include/ftl/
Dinitializer_list.h69 template <typename K, typename V, typename KeyEqual = std::equal_to<K>>
75 template <typename K, typename V, typename E, std::size_t... Sizes, typename... Types>
76 struct InitializerList<KeyValue<K, V, E>, std::index_sequence<Sizes...>, Types...> {
79 [[nodiscard]] constexpr auto operator()(K&& k, Args&&... args) && -> InitializerList<
80 KeyValue<K, V, E>, std::index_sequence<Sizes..., 3>, Types..., std::piecewise_construct_t,
81 std::tuple<K&&>, std::tuple<Args&&...>> {
84 std::forward_as_tuple(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)),
98 template <typename K, typename V, typename E = std::equal_to<K>, typename... Args>
100 return list<KeyValue<K, V, E>>(std::forward<Args>(args)...);
103 template <typename K, typename V>
[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 …]
DAlarmQueue.java51 public abstract class AlarmQueue<K> implements AlarmManager.OnAlarmListener {
142 private final AlarmPriorityQueue<K> mAlarmPriorityQueue = new AlarmPriorityQueue<>();
194 public void addAlarm(K key, @ElapsedRealtimeLong long alarmTimeElapsed) { in addAlarm()
217 public void removeAlarmForKey(K key) { in removeAlarmForKey()
231 final K key = (K) alarms[i].first; in removeAlarmsForUserId()
252 protected void removeAlarmsIf(@NonNull Predicate<K> predicate) { in removeAlarmsIf()
257 final K key = (K) alarms[i].first; in removeAlarmsIf()
283 protected abstract boolean isForUser(@NonNull K key, int userId); in isForUser()
286 protected abstract void processExpiredAlarms(@NonNull ArraySet<K> expired); in processExpiredAlarms()
314 final Pair<K, Long> alarm = mAlarmPriorityQueue.peek(); in setNextAlarmLocked()
[all …]
/frameworks/base/services/core/java/com/android/server/
DCircularQueue.java30 public class CircularQueue<K, V> extends LinkedList<K> {
32 private final ArrayMap<K, V> mArrayMap = new ArrayMap<>();
39 public boolean add(K k) throws IllegalArgumentException { in add()
51 public V put(K key, V value) { in put()
56 K removedKey = super.remove(); in put()
67 public V removeElement(K key) { in removeElement()
78 public V getElement(K key) { in getElement()
88 public boolean containsKey(K key) { in containsKey()
/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/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/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/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 …]
/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/libs/binary_translation/base/include/berberis/base/
Dforever_set.h26 template <typename K, typename C = std::less<K> >
27 using ForeverSet = std::set<K, C, ForeverPoolAllocator<K> >;
Dforever_map.h26 template <typename K, typename T, typename C = std::less<K> >
27 using ForeverMap = std::map<K, T, C, ForeverPoolAllocator<std::pair<const K, T> > >;
Darena_map.h26 template <typename K, typename T, typename C = std::less<K> >
27 using ArenaMap = std::map<K, T, C, ArenaAllocator<std::pair<const K, T> > >;
/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()

12345678