| /frameworks/native/include/utils/ |
| D | GenerationCache.h | 53 template<typename K, typename V>
63 void setOnEntryRemovedListener(OnEntryRemoved<K, V>* listener);
69 bool contains(const K& key) const;
70 const K& getKeyAt(size_t index) const;
73 const V& get(const K& key);
74 bool put(const K& key, const V& value);
77 bool remove(const K& key);
81 KeyedVector<K, sp<Entry<K, V> > > mCache;
84 OnEntryRemoved<K, V>* mListener;
86 sp<Entry<K, V> > mOldest;
[all …]
|
| D | TypeHelpers.h | 248 template <typename K, typename V>
249 struct trait_trivial_ctor< key_value_pair_t<K, V> >
250 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
251 template <typename K, typename V>
252 struct trait_trivial_dtor< key_value_pair_t<K, V> >
253 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
254 template <typename K, typename V>
255 struct trait_trivial_copy< key_value_pair_t<K, V> >
256 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
257 template <typename K, typename V>
[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()
111 public final V get(K key) { in get()
165 public final V put(K key, V value) { in put()
194 K key; in trimToSize()
206 Map.Entry<K, V> toEvict = map.eldest(); in trimToSize()
227 public final V remove(K key) { in remove()
262 protected void entryRemoved(boolean evicted, K key, V oldValue, V newValue) {} in entryRemoved()
279 protected V create(K key) { in create()
[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()
61 public final V get(K key) { in get()
115 public final V put(K key, V value) { in put()
144 K key; in trimToSize()
156 Map.Entry<K, V> toEvict = map.entrySet().iterator().next(); in trimToSize()
173 public final V remove(K key) { in remove()
208 protected void entryRemoved(boolean evicted, K key, V oldValue, V newValue) {} in entryRemoved()
225 protected V create(K key) { in create()
[all …]
|
| /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()
|
| /frameworks/base/core/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()
64 public V get(K key) { in get()
82 public V purge(K key) { in purge()
|
| /frameworks/base/media/tests/contents/media_api/music/ |
| D | test_amr_ietf.amr | 2 …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�'ܰ�
|
| /frameworks/base/core/java/com/google/android/collect/ |
| D | Maps.java | 30 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap()
31 return new HashMap<K, V>(); in newHashMap()
|
| D | Sets.java | 43 public static <K> HashSet<K> newHashSet() { in newHashSet()
44 return new HashSet<K>(); in newHashSet()
|
| /frameworks/base/services/sensorservice/ |
| D | Fusion.cpp | 407 vec<mat33_t, 2> K; in update() local
412 K[0] = P[0][0] * LtSi; in update()
413 K[1] = transpose(P[1][0])*LtSi; in update()
417 const mat33_t K0L(K[0] * L); in update()
418 const mat33_t K1L(K[1] * L); in update()
425 const vec3_t dq(K[0]*e); in update()
426 const vec3_t db(K[1]*e); in update()
|
| /frameworks/compile/slang/ |
| D | slang_rs_exportable.h | 39 RSExportable(RSContext *Context, RSExportable::Kind K) in RSExportable() argument
41 mK(K) { in RSExportable()
|
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| D | GridLayout.java | 2010 final static class Assoc<K, V> extends ArrayList<Pair<K, V>> {
2011 private final Class<K> keyType;
2014 private Assoc(Class<K> keyType, Class<V> valueType) {
2019 public static <K, V> Assoc<K, V> of(Class<K> keyType, Class<V> valueType) {
2020 return new Assoc<K, V>(keyType, valueType);
2023 public void put(K key, V value) {
2028 public PackedMap<K, V> pack() {
2030 K[] keys = (K[]) Array.newInstance(keyType, N);
2036 return new PackedMap<K, V>(keys, values);
2055 final static class PackedMap<K, V> {
[all …]
|
| /frameworks/base/core/java/android/widget/ |
| D | GridLayout.java | 2077 final static class Assoc<K, V> extends ArrayList<Pair<K, V>> {
2078 private final Class<K> keyType;
2081 private Assoc(Class<K> keyType, Class<V> valueType) {
2086 public static <K, V> Assoc<K, V> of(Class<K> keyType, Class<V> valueType) {
2087 return new Assoc<K, V>(keyType, valueType);
2090 public void put(K key, V value) {
2095 public PackedMap<K, V> pack() {
2097 K[] keys = (K[]) Array.newInstance(keyType, N);
2103 return new PackedMap<K, V>(keys, values);
2122 final static class PackedMap<K, V> {
[all …]
|
| /frameworks/native/libs/utils/tests/ |
| D | BasicHashtable_test.cpp | 266 const int K = 1; in TEST_F() local
270 ssize_t index = find(h, -1, K); in TEST_F()
277 add(h, K, int(i)); in TEST_F()
283 index = find(h, index, K); in TEST_F()
285 ASSERT_EQ(K, h.entryAt(index).key); in TEST_F()
290 index = find(h, index, K); in TEST_F()
295 ASSERT_TRUE(remove(h, K)) << "i = " << i; in TEST_F()
300 index = find(h, index, K); in TEST_F()
302 ASSERT_EQ(K, h.entryAt(index).key); in TEST_F()
305 index = find(h, index, K); in TEST_F()
|
| /frameworks/compile/libbcc/tests/data/src/ |
| D | otcc-ansi.c | 3 int d, z, C, h, P, K, ac, q, G, v, Q, R, D, L, W, M; variable
385 K=B(K); in I()
428 K=G=0; in ab()
432 A(K); in ab()
|
| D | otcc-noinclude.c | 19 F d,z,C,h,P,K,ac,q,G,v,Q,R,D,L,W,M; variable
379 K=B(K);
421 K=G=0;
425 A(K);
|
| /frameworks/base/core/java/android/emoji/ |
| D | EmojiFactory.java | 38 private class CustomLinkedHashMap<K, V> extends LinkedHashMap<K, V> {
51 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { in removeEldestEntry() argument
|
| /frameworks/base/packages/InputDevices/res/raw/ |
| D | keyboard_layout_english_us_dvorak.kcm | 51 map key 47 K
307 key K {
308 label: 'K'
310 shift, capslock: 'K'
|
| D | keyboard_layout_english_us.kcm | 227 key K {
228 label: 'K'
230 shift, capslock: 'K'
|
| D | keyboard_layout_italian.kcm | 229 key K {
230 label: 'K'
232 shift, capslock: 'K'
|
| D | keyboard_layout_belgian.kcm | 240 key K {
241 label: 'K'
243 shift, capslock: 'K'
|
| D | keyboard_layout_czech.kcm | 240 key K {
241 label: 'K'
243 shift, capslock: 'K'
|
| D | keyboard_layout_swedish.kcm | 233 key K {
234 label: 'K'
236 shift, capslock: 'K'
|
| /frameworks/compile/libbcc/tests/data/ |
| D | otcc.c | 19 F d,z,C,h,P,K,ac,q,G,v,Q,R,D,L,W,M; variable
379 K=B(K);
421 K=G=0;
425 A(K);
|
| /frameworks/base/core/tests/coretests/src/android/database/sqlite/ |
| D | SQLiteCursorTest.java | 136 int K = N / 2; in testFillWindow() local
137 for (int p = 0; p < K && c.moveToNext(); p++) { in testFillWindow()
|