Home
last modified time | relevance | path

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

12345678910>>...13

/ohos5.0/commonlibrary/rust/ylong_json/src/
H A Ddeserializer.rs31 fn visit<'de, V>(self, visitor: V) -> Result<V::Value, Error> in visit()
259 fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_any()
289 fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_i8()
296 fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_i16()
303 fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_i32()
310 fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_i64()
317 fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_u8()
324 fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_u16()
331 fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_u32()
338 fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Self::Error> in deserialize_u64()
[all …]
/ohos5.0/commonlibrary/ets_utils/js_util_module/container/struct/
H A Djs_struct.ts95 class Pair<K, V> {
97 value: V;
98 constructor(key: K, value: V = key as unknown as V) {
102 entry(): [K, V] {
268 class TreeNode<K, V> extends Pair<K, V> {
274 value?: V,
304 addNode(key: K, value: V = key as unknown as V): TreeClass<K, V> {
315 addProcess(key: K, value: V): TreeClass<K, V> {
317 let parentNode: TreeNode<K, V> = this.root as TreeNode<K, V>;
412 findNode(value: V): TreeNode<K, V> | undefined {
[all …]
/ohos5.0/commonlibrary/ets_utils/js_util_module/container/hashmap/
H A Djs_hashmap.ts37 class HandlerHashMap<K, V> {
55 class HashMap<K, V> extends hashMapAbility.DictionaryClass<K, V> {
72 hasValue(value: V): boolean {
76 get(key: K): V {
80 setAll(map: HashMap<K, V>): void {
89 set(key: K, value: V): Object {
93 remove(key: K): V {
119 values(): IterableIterator<V> {
125 let value: V = undefined;
140 forEach(callbackfn: (value?: V, key?: K, map?: HashMap<K, V>) => void,
[all …]
/ohos5.0/foundation/arkui/ace_engine/frameworks/bridge/declarative_frontend/state_mgmt/src/lib/sdk/
H A Dpersistent_storage.ts34 type MapItem<K, V> = { key: K, value: V };
35 class MapInfo<K, V> {
39 public values: V[];
59 static toObject<K, V>(map: Map<K, V>): MapInfo<K, V> {
68 static toMap<K, V>(obj: MapInfo<K, V>): Map<K, V> {
72 static toMapCompatible<K, V>(obj: MapInfo<K, V>): Map<K, V> {
83 class SetInfo<V> {
89 public values: V[]
93 static isObject<V>(obj: unknown): obj is SetInfo<V> {
103 static toObject<V>(set: Set<V>): SetInfo<V> {
[all …]
/ohos5.0/commonlibrary/ets_utils/js_util_module/container/lightweightmap/
H A Djs_lightweightmap.ts37 class HandlerLightWeightMap<K, V> {
55 class LightWeightMap<K, V> extends lightWeightAbility.LightWeightClass<K, V> {
82 hasValue(value: V): boolean {
108 get(key: K): V {
118 getIndexOfValue(value: V): number {
163 set(key: K, value: V): Object {
168 remove(key: K): V {
204 forEach(callbackfn: (value?: V, key?: K, map?: LightWeightMap<K, V>) => void,
224 getValueAt(index: number): V {
230 values(): IterableIterator<V> {
[all …]
/ohos5.0/base/print/print_fwk/services/print_service/bsuni/
H A DBUILD.gn276 "${bsuni_gsres_path}/CMap/78-V",
289 "${bsuni_gsres_path}/CMap/Add-V",
316 "${bsuni_gsres_path}/CMap/B5-V",
318 "${bsuni_gsres_path}/CMap/B5pc-V",
332 "${bsuni_gsres_path}/CMap/EUC-V",
336 "${bsuni_gsres_path}/CMap/Ext-V",
340 "${bsuni_gsres_path}/CMap/GB-V",
350 "${bsuni_gsres_path}/CMap/GBT-V",
382 "${bsuni_gsres_path}/CMap/KSC-V",
391 "${bsuni_gsres_path}/CMap/NWP-V",
[all …]
/ohos5.0/commonlibrary/ets_utils/js_util_module/container/treemap/
H A Djs_treemap.ts37 class HandlerTreeMap<K, V> {
55 class TreeMap<K, V> {
76 hasValue(value: V): boolean {
80 get(key: K): V {
101 setAll(map: TreeMap<K, V>): void {
106 set(key: K, value: V): Object {
110 remove(key: K): V {
171 values(): IterableIterator<V> {
177 let value: V = undefined;
196 forEach(callbackfn: (value?: V, key?: K, map?: TreeMap<K, V>) => void,
[all …]
/ohos5.0/commonlibrary/rust/ylong_runtime/ylong_runtime/src/iter/parallel/collections/
H A Dbtree_map.rs19 par_vec_impl!(BTreeMap<T, V>, Vec<(T,V)>, into_iter, impl <T, V>);
21 par_vec_impl!(&'a BTreeMap<T, V>, Vec<(&'a T, &'a V)>, iter, impl <'a, T, V>);
23 par_vec_impl!(&'a mut BTreeMap<T, V>, Vec<(&'a T, &'a mut V)>, iter_mut, impl <'a, T, V>);
H A Dhash_map.rs19 par_vec_impl!(HashMap<T, V>, Vec<(T, V)>, into_iter, impl <T, V>);
21 par_vec_impl!(&'a HashMap<T, V>, Vec<(&'a T, &'a V)>, iter, impl <'a, T, V>);
23 par_vec_impl!(&'a mut HashMap<T, V>, Vec<(&'a T, &'a mut V)>, iter_mut, impl <'a, T, V>);
/ohos5.0/foundation/arkui/ace_engine/frameworks/base/thread/
H A Dcancelable_callback.h40 template<class... V>
41 class CancelableCallback<void(V...)> final {
71 void operator()(V&&... values) const;
107 template<class... V>
108 void CancelableCallback<void(V...)>::Reset( in Reset()
117 template<class... V>
118 void CancelableCallback<void(V...)>::Reset( in Reset()
127 template<class... V>
155 template<class... V>
180 template<class... V>
[all …]
/ohos5.0/commonlibrary/c_utils/base/include/
H A Dsafe_map.h27 template <typename K, typename V>
51 V ReadVal(const K& key) in ReadVal()
101 bool Insert(const K& key, const V& value) in Insert()
104 auto ret = map_.insert(std::pair<K, V>(key, value)); in Insert()
116 void EnsureInsert(const K& key, const V& value) in EnsureInsert()
119 auto ret = map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
123 map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
137 bool Find(const K& key, V& value) in Find()
160 bool FindOldAndSetNew(const K& key, V& oldValue, const V& newValue) in FindOldAndSetNew()
218 std::map<K, V> map_;
[all …]
/ohos5.0/foundation/bundlemanager/app_domain_verify/frameworks/common/include/httpsession/
H A Dffrt_safe_map.h26 template <typename K, typename V>
47 V ReadVal(const K& key) in ReadVal()
97 bool Insert(const K& key, const V& value) in Insert()
100 auto ret = map_.insert(std::pair<K, V>(key, value)); in Insert()
112 void EnsureInsert(const K& key, const V& value) in EnsureInsert()
115 auto ret = map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
119 map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
133 bool Find(const K& key, V& value) in Find()
156 bool FindOldAndSetNew(const K& key, V& oldValue, const V& newValue) in FindOldAndSetNew()
165 map_.insert(std::pair<K, V>(key, newValue)); in FindOldAndSetNew()
[all …]
/ohos5.0/commonlibrary/rust/ylong_http/ylong_http/src/body/mime/common/
H A Dmulti.rs151 pub(crate) fn insert_header<N, V>( in insert_header()
154 value: V, in insert_header() argument
159 HeaderValue: TryFrom<V>, in insert_header() argument
160 <HeaderValue as TryFrom<V>>::Error: Into<HttpError>, in insert_header()
166 pub(crate) fn append_header<N, V>( in append_header()
169 value: V, in append_header() argument
174 HeaderValue: TryFrom<V>, in append_header() argument
388 pub fn insert_header<N, V>(mut self, name: N, value: V) -> Self in insert_header()
392 HeaderValue: TryFrom<V>, in insert_header() argument
413 pub fn append_header<N, V>(mut self, name: N, value: V) -> Self in append_header()
[all …]
H A Dpart.rs79 pub(crate) fn header<N, V>(&mut self, name: N, value: V) -> Result<&mut Headers, HttpError> in header()
83 HeaderValue: TryFrom<V>, in header() argument
84 <HeaderValue as TryFrom<V>>::Error: Into<HttpError>, in header()
90 pub(crate) fn append_header<N, V>( in append_header()
93 value: V, in append_header() argument
98 HeaderValue: TryFrom<V>, in append_header() argument
99 <HeaderValue as TryFrom<V>>::Error: Into<HttpError>, in append_header()
280 pub fn header<N, V>(mut self, name: N, value: V) -> Self in header()
284 HeaderValue: TryFrom<V>, in header() argument
305 pub fn append_header<N, V>(mut self, name: N, value: V) -> Self in append_header()
[all …]
/ohos5.0/foundation/filemanagement/storage_service/services/common/include/
H A Dstorage_rl_map.h25 template <typename K, typename V>
30 V ReadVal(const K& key) in ReadVal()
40 bool Insert(const K& key, const V& value) in Insert()
43 auto result = map_.insert(std::pair<K, V>(key, value)); in Insert()
65 typename std::map<K, V>::iterator Find(const K& key) in Find()
70 typename std::map<K, V>::const_iterator Find(const K& key) const in Find()
80 typename std::map<K, V>::iterator Begin() in Begin()
85 typename std::map<K, V>::const_iterator Begin() const in Begin()
90 typename std::map<K, V>::iterator End() in End()
95 typename std::map<K, V>::const_iterator End() const in End()
[all …]
/ohos5.0/foundation/multimedia/camera_framework/services/camera_service/include/
H A Dlru_map.h26 template<typename K, typename V>
37 bool Get(const K &key, V &value) in Get()
47 bool Put(const K &key, const V &inValue) in Put()
62 bool MoveNodeToLast(const K &key, const V &val) in MoveNodeToLast()
64 auto it = std::find_if(queue_.begin(), queue_.end(), [&key](const std::pair<K, V>& pair) { in MoveNodeToLast()
70 std::pair<K, V> entry = {key, val}; in MoveNodeToLast()
73 std::pair<K, V> &pair = queue_.front(); in MoveNodeToLast()
81 std::map<K, V> cache_;
82 std::deque<std::pair<K, V>> queue_;
/ohos5.0/base/inputmethod/imf/common/include/
H A Ditypes_util.h115 template<class K, class V>
117 template<class K, class V>
118 static bool Unmarshalling(std::map<K, V> &val, MessageParcel &parcel);
120 template<class K, class V>
122 template<class K, class V>
196 template<class K, class V>
213 template<class K, class V>
235 V value; in Unmarshalling()
244 template<class K, class V>
261 template<class K, class V>
[all …]
/ohos5.0/base/hiviewdfx/hilog/frameworks/libhilog/utils/include/
H A Dlog_utils.h24 template<typename K, typename V>
26 using ValueCmp = std::function<bool(const V& v1, const V& v2)>;
28 KVMap(std::unordered_map<K, V> map, K def_k, V def_v,
29 ValueCmp cmp = [](const V& v1, const V& v2) { return v1 == v2; })
34 const V& GetValue(K key) const in GetValue()
40 const K GetKey(const V& value) const in GetKey()
65 const std::unordered_map<K, V> str_map;
67 const V def_value;
/ohos5.0/commonlibrary/rust/ylong_http/ylong_http_client/src/util/
H A Dpool.rs23 pub(crate) struct Pool<K, V> {
24 pool: Arc<Mutex<HashMap<K, V>>>,
27 impl<K, V> Pool<K, V> {
35 impl<K: Eq + Hash, V: Clone> Pool<K, V> {
36 pub(crate) fn get<F>(&self, key: K, create_fn: F) -> V in get()
38 F: FnOnce() -> V, in get() argument
/ohos5.0/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/include/
H A Dlru_map.h27 template<typename K, typename V>
35 int Get(const K &key, V &outValue) in Get()
45 int Put(const K &key, const V &inValue) in Put()
69 int Elimination(const K &key, const V &val) in Elimination()
79 std::pair<K, V> entry = {key, val}; in Elimination()
82 std::pair<K, V> &pair = eliminationChain_.front(); in Elimination()
90 std::map<K, V> cache_;
91 std::deque<std::pair<K, V>> eliminationChain_;
/ohos5.0/docs/zh-cn/application-dev/reference/apis-arkts/
H A Djs-apis-hashmap.md13 - V：Value，值
137 hasValue(value: V): boolean
149 | value | V | 是 | 指定value。 |
176 get(key: K): V
194 | V | 返回key映射的value值。 |
216 setAll(map: HashMap<K, V>): void
253 set(key: K, value: V): Object
266 | value | V | 是 | 添加或更新成员数据的值。 |
293 remove(key: K): V
311 | V | 返回删除元素的值。 |
[all …]
H A Djs-apis-lightweightmap.md15 - V：Value，值
183 hasValue(value: V): boolean
195 | value | V | 是 | 指定元素。 |
253 get(key: K): V
271 | V | 返回key映射的value值。 |
345 | value | V | 是 | 被查找的元素。 |
450 set(key: K, value: V): Object
489 remove(key: K): V
507 | V | 返回删除元素的值。 |
613 getValueAt(index: number): V
[all …]
H A Djs-apis-treemap.md15 - V：Value，值
178 hasValue(value: V): boolean
190 | value | V | 是 | 指定value。 |
217 get(key: K): V
325 setAll(map: TreeMap<K, V>): void
365 set(key: K, value: V): Object
378 | value | V | 是 | 添加成员数据的值。 |
405 remove(key: K): V
423 | V | 返回删除元素的值。 |
539 | newValue | V | 是 | 替换的元素。 |
[all …]
/ohos5.0/foundation/systemabilitymgr/samgr/services/samgr/native/include/
H A Dconcurrent_map.h24 template <typename K, typename V> class ConcurrentMap {
58 bool Insert(const K &key, const V &value) in Insert()
61 auto ret = map_.insert(std::pair<K, V>(key, value)); in Insert()
65 void EnsureInsert(const K &key, const V &value) in EnsureInsert()
68 auto ret = map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
72 map_.insert(std::pair<K, V>(key, value)); in EnsureInsert()
78 bool Find(const K &key, V &value) in Find()
117 std::map<K, V> map_;
/ohos5.0/docs/zh-cn/application-dev/arkts-utils/
H A Dnonlinear-container.md34 | 增加元素 | set(key: K, value: V) | 增加一个键值对。 |
39 | 访问元素 | forEach(callbackFn: (value?: V, key?: K, map?: HashMap<K, V>) => void, thisArg?: Object) |…
41 | 修改元素 | replace(key: K, newValue: V) | 修改指定key对应的value值。 |
42 | 修改元素 | forEach(callbackFn: (value?: V, key?: K, map?: HashMap<K, V>) => void, thisArg?: Object) |…
83 | 增加元素 | set(key: K, value: V) | 增加一个键值对。 |
90 | 访问元素 | forEach(callbackFn: (value?: V, key?: K, map?: TreeMap<K, V>) => void, thisArg?: Object) |…
92 | 修改元素 | replace(key: K, newValue: V) | 修改指定key对应的value值。 |
93 | 修改元素 | forEach(callbackFn: (value?: V, key?: K, map?: TreeMap<K, V>) => void, thisArg?: Object) |…
138 | 增加元素 | set(key: K, value: V) | 增加一个键值对。 |
147 | 访问元素 | forEach(callbackFn: (value?: V, key?: K, map?: LightWeightMap<K, V>) => void, thisArg?: Ob…
[all …]

12345678910>>...13