| /system/bt/service/ipc/binder/ |
| D | remote_callback_map.h | 37 template <typename K, typename V>
53 virtual void OnRemoteCallbackRemoved(const K& key) = 0;
63 bool Register(const K& key, const android::sp<V>& callback,
68 bool Unregister(const K& key);
72 android::sp<V> Get(const K& key);
76 android::sp<V> Remove(const K& key);
84 CallbackDeathRecipient(const K& key, const android::sp<V>& callback,
85 RemoteCallbackMap<K, V>* owner, Delegate* delegate);
93 K key_;
95 RemoteCallbackMap<K, V>* owner_; // weak
[all …]
|
| /system/libvintf/include/vintf/ |
| D | MapValueIterator.h | 29 using K = typename Map::key_type; member
119 template<typename K, typename V>
120 using ConstMapValueIterable = typename MapIterTypes<std::map<K, V>>::ConstValueIterable;
121 template<typename K, typename V>
122 using ConstMultiMapValueIterable = typename MapIterTypes<std::multimap<K, V>>::ConstValueIterable;
123 template <typename K, typename V>
124 using MapValueIterable = typename MapIterTypes<std::map<K, V>>::ValueIterable;
125 template <typename K, typename V>
126 using MultiMapValueIterable = typename MapIterTypes<std::multimap<K, V>>::ValueIterable;
128 template<typename K, typename V>
[all …]
|
| /system/libhidl/transport/include/hidl/ |
| D | ConcurrentMap.h | 25 template<typename K, typename V>
28 using size_type = typename std::map<K, V>::size_type;
29 using iterator = typename std::map<K, V>::iterator;
30 using const_iterator = typename std::map<K, V>::const_iterator;
33 void set(K &&k, V &&v) { in set()
35 mMap[std::forward<K>(k)] = std::forward<V>(v); in set()
39 const V &get(const K &k, const V &def) const { in get()
48 size_type erase(const K &k) { in erase()
53 size_type eraseIfEqual(const K& k, const V& v) { in eraseIfEqual()
69 void setLocked(const K& k, V&& v) { mMap[k] = std::forward<V>(v); } in setLocked()
[all …]
|
| /system/bt/common/ |
| D | lru.h | 35 template <typename K, typename V>
38 using Node = std::pair<K, V>;
77 V* Find(const K& key) { in Find()
95 bool Get(const K& key, V* value) { in Get()
113 bool HasKey(const K& key) { in HasKey()
126 std::optional<Node> Put(const K& key, V value) { in Put()
154 bool Remove(const K& key) { in Remove()
183 std::unordered_map<K, typename std::list<Node>::iterator> lru_map_;
|
| /system/timezone/input_data/android/ |
| D | countryzones.txt | 318 # 681K
324 # 673K
330 # 368K
336 # 334K
342 # 247K (Santa Cruz Province)
348 # 127K (Tierra del Fuego)
354 # 432K
400 # 224K
406 # < 1K
432 # < 1K
[all …]
|
| /system/core/libutils/include/utils/ |
| D | TypeHelpers.h | 279 template <typename K, typename V>
280 struct trait_trivial_ctor< key_value_pair_t<K, V> >
281 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
282 template <typename K, typename V>
283 struct trait_trivial_dtor< key_value_pair_t<K, V> >
284 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
285 template <typename K, typename V>
286 struct trait_trivial_copy< key_value_pair_t<K, V> >
287 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
288 template <typename K, typename V>
[all …]
|
| D | LruCache.h | 179 template<typename K, typename V>
180 void LruCache<K, V>::setOnEntryRemovedListener(OnEntryRemoved<K, V>* listener) { in setOnEntryRemovedListener() argument
|
| /system/linkerconfig/contents/tests/configuration/include/ |
| D | modules.h | 53 template <class K, class V>
54 bool MapContainsKey(const std::map<K, V>& map, K key) { in MapContainsKey() argument
|
| /system/core/adb/fastdeploy/testdata/ |
| D | rotating_cube-metadata-release.data | 4 K���3Qcp^<�̽sF0��
|
| /system/bt/embdrv/sbc/decoder/srce/ |
| D | synthesis-dct8.c | 91 #define FLOAT_MULT_DCT(K, sample) (FIX(K, 20) * sample) in float_dct2_8() argument
254 #define FIX_MULT_DCT(K, x) (MUL_32S_32S_HI(K, x) << 2) in dct2_8() argument
|
| D | synthesis-sbc.c | 244 #define LONG_MULT_DCT(K, sample) (MUL_16S_32S_HI(K, sample) << 2) argument
|
| /system/core/logd/ |
| D | README.property | 39 logd.size 64K instead of 256K.
65 - number - support multipliers (K or M) for convenience. Range is limited
66 to between 64K and 256M for log buffer sizes. Individual log buffer ids
|
| /system/update_engine/ |
| D | unittest_key.pem | 3 hHNF96s5wEn8RDtrdLocm0a+SqXXf7KycFRTZxLdDbqWAMUlPXOaPI+PZLWkB7/K
|
| /system/ca-certificates/files/ |
| D | 27af790d.0 | 16 rD6ogRLQy7rQkgu2npaqBA+K
|
| D | 85cde254.0 | 20 8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
|
| D | 304d27c3.0 | 30 UB+K+wb1whnw0A==
|
| D | dbc54cab.0 | 9 +jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS
|
| /system/ca-certificates/google/files/ |
| D | 27af790d.0 | 16 rD6ogRLQy7rQkgu2npaqBA+K
|
| D | 85cde254.0 | 20 8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
|
| /system/core/fs_mgr/libfs_avb/tests/data/ |
| D | testkey_rsa8192.pem | 39 Z1n/uimsT79sSDqy3XSymtKWXo/22UlrvGCpoEuELPMb6dSFWR7vwrsvhFngY4/K
|
| /system/chre/build/sys_support/qcom/ |
| D | uimage.lcs.toolv80 | 128 . = ALIGN (DEFINED (DATAALIGN) ? (DATAALIGN * 1K) : CONSTANT (MAXPAGESIZE));*/
130 . = ALIGN (4K);
|
| D | uimage_v2.lcs | 111 . = ALIGN(4K);
|
| /system/chre/external/flatbuffers/include/flatbuffers/ |
| D | flatbuffers.h | 448 template<typename K> return_type LookupByKey(K key) const {
450 IndirectHelper<T>::element_stride, KeyCompare<K>);
469 template<typename K> static int KeyCompare(const void *ap, const void *bp) {
470 const K *key = reinterpret_cast<const K *>(ap);
|
| /system/core/libsync/tests/ |
| D | sync_test.cpp | 625 template <typename K, typename V> using dict = unordered_map<K,V>;
|
| /system/libvintf/ |
| D | parse_xml.cpp | 380 template <typename K, typename V>
381 inline bool parseChildren(NodeType* root, const XmlNodeConverter<std::pair<K, V>>& conv, in parseChildren()
382 std::map<K, V>* s, std::string* error) const { in parseChildren()
383 return parseChildren<std::map<K, V>, std::pair<K, V>>(root, conv, s, error); in parseChildren()
|