Home
last modified time | relevance | path

Searched refs:V (Results 1 – 25 of 47) sorted by relevance

12

/system/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/
DTreeNode.java27 abstract class TreeNode<V extends TreeNode<V>> {
29 private V parent;
31 private final List<V> children = new ArrayList<>();
42 protected final V getThis() { in getThis()
43 return (V) this; in getThis()
46 public final V getParent() { in getParent()
51 protected final void setParent(V newParent) { in setParent()
58 public final void addChild(V e) { in addChild()
66 public final List<V> getChildren() { in getChildren()
77 public final void visitSelfThenChildrenRecursive(Visitor<V> visitor) { in visitSelfThenChildrenRecursive()
[all …]
/system/libvintf/include/vintf/
DMapValueIterator.h30 using V = typename Map::mapped_type; member
36 V,
38 typename std::conditional<is_const, const V *, V *>::type /* Pointer */,
39 typename std::conditional<is_const, const V &, V &>::type /* Reference */
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;
[all …]
/system/bt/service/ipc/binder/
Dremote_callback_map.h37 template <typename K, typename V>
63 bool Register(const K& key, const android::sp<V>& callback,
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);
87 android::sp<V> get_callback() const { return callback_; } in get_callback()
94 android::sp<V> callback_;
95 RemoteCallbackMap<K, V>* owner_; // weak
121 template <typename K, typename V>
[all …]
/system/libhidl/transport/include/hidl/
DConcurrentMap.h25 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()
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()
70 void setLocked(const K& k, const V& v) { mMap[k] = v; } in setLocked()
[all …]
/system/iorap/tests/src/tmp/
Dintrospection_test.cc118 template <typename M, typename T, typename V>
119 constexpr void call_set_value(M member_type, T&& self, V&& value) { in call_set_value()
120 member_type.set_value(std::forward<T>(self), std::forward<V>(value)); in call_set_value()
139 template <typename M, typename T, typename V>
140 constexpr void call_set_value_lambda(M member_type, T&& self, V&& value) { in call_set_value_lambda()
142 member_type.set_value(std::forward<T>(self), std::forward<V>(value)); in call_set_value_lambda()
143 })(std::forward<V>(value)); in call_set_value_lambda()
166 template <typename T, typename V>
167 constexpr void call_set_simple_value_with_lambda(T&& self, V&& value) { in call_set_simple_value_with_lambda()
175 })(std::forward<V>(value)); in call_set_simple_value_with_lambda()
/system/netd/libnetdutils/include/netdutils/
DMisc.h26 template <typename U, typename V>
27 inline const V& findWithDefault(const std::map<U, V>& map, const U& key, const V& dflt) { in findWithDefault()
DSlice.h90 template <typename U, size_t V>
91 inline const Slice makeSlice(const std::array<U, V>& a) { in makeSlice()
/system/core/libutils/include/utils/
DTypeHelpers.h279 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 …]
DLruCache.h179 template<typename K, typename V>
180 void LruCache<K, V>::setOnEntryRemovedListener(OnEntryRemoved<K, V>* listener) { in setOnEntryRemovedListener()
/system/core/property_service/libpropertyinfoserializer/include/property_info_serializer/
Dproperty_info_serializer.h27 template <typename T, typename U, typename V>
28 PropertyInfoEntry(T&& name, U&& context, V&& type, bool exact_match) in PropertyInfoEntry()
31 type(std::forward<V>(type)), in PropertyInfoEntry()
/system/bt/common/
Dlru.h35 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()
126 std::optional<Node> Put(const K& key, V value) { in Put()
/system/linkerconfig/contents/tests/configuration/include/
Dmodules.h53 template <class K, class V>
54 bool MapContainsKey(const std::map<K, V>& map, K key) { in MapContainsKey()
/system/bt/stack/smp/
Dp_256_multprecision.cc197 uint32_t V; in multiprecision_mult() local
199 U = V = W = 0; in multiprecision_mult()
209 V = a[i] * b[j]; in multiprecision_mult()
210 V = V + U; in multiprecision_mult()
211 U = (V < U); in multiprecision_mult()
213 V = V + c[i + j]; in multiprecision_mult()
214 U += (V < c[i + j]); in multiprecision_mult()
215 c[i + j] = V; in multiprecision_mult()
/system/bt/gd/security/ecc/
Dmultprecision.cc195 uint32_t V; in multiprecision_mult() local
197 U = V = W = 0; in multiprecision_mult()
207 V = a[i] * b[j]; in multiprecision_mult()
208 V = V + U; in multiprecision_mult()
209 U = (V < U); in multiprecision_mult()
211 V = V + c[i + j]; in multiprecision_mult()
212 U += (V < c[i + j]); in multiprecision_mult()
213 c[i + j] = V; in multiprecision_mult()
/system/core/cli-test/
Dcli-test.cpp87 static void V(const char* fmt, ...) { in V() function
182 V("running %s \"%s\"", what, command.c_str()); in RunCommands()
219 V("setenv(\"FILES\", \"%s\")", FILES.c_str()); in RunTests()
224 V("chdir(\"%s\")", td.path); in RunTests()
231 V("running command \"%s\"", test.command.c_str()); in RunTests()
238 V("exit status %d", exit_status); in RunTests()
/system/core/libpixelflinger/codeflinger/
Dtexturing.cpp466 int V = 0; in build_textures() local
507 V = scratches.obtain(); in build_textures()
518 AND(AL, 0, V, v, imm((1<<FRAC_BITS)-1)); in build_textures()
638 case 1: filter8(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
639 case 2: filter16(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
640 case 3: filter24(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
641 case 4: filter32(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
688 int U, int V, pointer_t& txPtr, in filter8() argument
720 SMULBB(AL, u, U, V); in filter8()
727 SMULBB(AL, u, U, V); in filter8()
[all …]
DGGLAssembler.h454 int U, int V, pointer_t& txPtr,
459 int U, int V, pointer_t& txPtr,
464 int U, int V, pointer_t& txPtr,
469 int U, int V, pointer_t& txPtr,
/system/apex/apexd/apexd_testdata/
Dcom.android.apex.test_package.preinstall.pem19 WMRyZKhBAYzYCbeRJIKP0z+BrHbF+V+oX/cWjtEU9BDZ6KcQ401FgDLyPyGVfBbb
36 7V/aupzVAYYpa35FQhlaKrGDwBaU+ta3U8xEADPlF3cYhaFTm+WZhs9LmobcyHrl
Dcom.android.apex.test_package.postinstall.pem25 bJtnmTyprqM8JmVAskpxV8YZJ++ZgOIHOzCXrMs7KHstbVCN750aqAdPwCOU11/V
/system/libhidl/transport/
DHidlTransportSupport.cpp49 template <typename V>
50 static void pruneMapLocked(ConcurrentMap<wp<IBase>, V>& map) { in pruneMapLocked()
/system/update_engine/
Ddynamic_partition_test_utils.h67 template <typename U, typename V>
68 inline std::ostream& operator<<(std::ostream& os, const std::map<U, V>& param) {
80 template <typename V>
81 inline void VectorToStream(std::ostream& os, const V& param) { in VectorToStream()
Dunittest_key.pem21 V/xzegbh2HAglNnNizZuAQKBgQCyOxEpBP5vgS7d/MgJklFEYrb/wjgBnMI5oSek
/system/incremental_delivery/incfs/include/
Dincfs.h118 template <typename V>
119 constexpr Span(const std::vector<V>& x) : Span(x.data(), x.size()) {} in Span()
120 template <typename V, size_t Size>
121 constexpr Span(V (&x)[Size]) : Span(x, Size) {} in Span()
/system/core/adb/apex/
Dcom.android.adbd.pem8 V/5G/EwGBsggk/BcZjQyj0PExG6LmygR7lq8q4m9ODJj3cmNLZsZu8ukMBxf4Fim
/system/keymaster/include/keymaster/
DList.h103 template<typename V> explicit
104 _ListIterator(const V& rhs) : mpNode(rhs.mpNode) {} in _ListIterator()

12