Home
last modified time | relevance | path

Searched refs:keys (Results 101 - 125 of 3640) sorted by relevance

12345678910>>...146

/third_party/jerryscript/tests/jerry/es2015/
H A Dproxy_own_keys.js44 Object.keys(proxy);
81 array_check(Object.keys(proxy), ["foo", "bar"]);
88 array_check(Object.keys(proxy), ["prop1", "prop2"]);
151 // test with duplicated keys
163 // test with lots of keys
184 var keys = ["foo"]; variable
188 return keys;
201 keys = ["nonconf"];
205 keys = ["foo", "nonconf"];
214 keys
[all...]
H A Darray-prototype-keys.js16 Array.prototype.keys.call (undefined);
24 var iterator = array.keys ();
48 iterator = array.keys ();
68 iterator = array.keys ();
77 iterator = array.keys ();
86 assert ([].keys ().toString () === "[object Array Iterator]");
H A Dsymbol.js42 var keys = Object.keys (obj);
43 assert (keys.length === 2);
44 assert (keys[0] === 'c' || keys[0] === 'd');
45 assert (keys[1] === 'd' || keys[1] === 'c');
/third_party/python/Lib/idlelib/
H A Ddebugobj.py44 keys = dir(self.object)
46 for key in keys:
79 def keys(self): member in SequenceTreeItem
83 for key in self.keys():
95 def keys(self): member in DictTreeItem
96 keys = list(self.object.keys())
98 keys.sort()
101 return keys
/test/testfwk/xdevice/plugins/ohos/src/ohos/environment/
H A Ddevice_lite.py153 if "ip" in item.keys() and "port" in item.keys():
157 elif "type" in item.keys() and "com" in item.keys():
187 if "label" not in item.keys():
189 if "com" not in item.keys() or ("com" in item.keys() and
205 if "label" not in item.keys():
206 if "com" not in item.keys() or ("com" in item.keys() an
[all...]
/third_party/node/deps/npm/lib/commands/
H A Dview.js48 pckmnt.versions = Object.keys(pckmnt.versions).sort(semver.compareLoose)
55 Object.keys(d).forEach((k) => {
109 data.map((v) => this.prettyView(pckmnt, v[Object.keys(v)[0]]['']))
161 data.map((v) => this.prettyView(pckmnt, v[Object.keys(v)[0]]['']))
176 if (Object.keys(results).length > 0) {
214 pckmnt.versions = Object.keys(versions).filter(v => {
227 Object.keys(versions).forEach((v) => {
261 const versions = Object.keys(data)
269 const fields = Object.keys(data[v])
306 if (msgJson.length && Object.keys(msgJso
[all...]
/kernel/linux/linux-6.6/include/trace/events/
H A Dbcache.h225 TP_PROTO(struct bio *bio, u32 keys),
226 TP_ARGS(bio, keys),
240 __entry->nr_keys = keys;
244 TP_printk("%d,%d %s %llu + %u keys %u",
269 __field(unsigned, keys )
275 __entry->keys = b->keys.set[b->keys.nsets].data->keys;
279 __entry->bucket, __entry->block, __entry->keys)
[all...]
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/metal/
H A Dgen_mtl_format_table.py387 for angle_format in sorted(angle_to_mtl.keys()):
389 for angle_format in sorted(angle_override.keys()):
394 for angle_format in sorted(mac_specific_map.keys()):
397 for angle_format in sorted(mac_override.keys()):
400 for angle_format in sorted(mac_override_bc1.keys()):
409 for angle_format in sorted(mac_override_es3.keys()):
417 for angle_format in sorted(ios_specific_map.keys()):
420 for angle_format in sorted(ios_override.keys()):
423 for angle_format in sorted(astc_tpl_map.keys()):
429 for angle_format in sorted(ios_specific_map.keys())
[all...]
/third_party/node/test/parallel/
H A Dtest-tls-addca.js10 assert, connect, keys, tls
15 contextWithCert.context.addCACert(keys.agent1.ca);
18 key: keys.agent1.key,
19 cert: keys.agent1.cert,
23 ca: [keys.agent1.ca],
H A Dtest-tls-socket-default-options.js9 connect, keys, tls
21 { secureContext: tls.createSecureContext({ ca: keys.agent1.ca }) },
25 { ca: keys.agent1.ca },
31 { secureContext: tls.createSecureContext(), ca: keys.agent1.ca },
41 key: keys.agent1.key,
42 cert: keys.agent1.cert,
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_iext_tree.c105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
117 uint64_t keys[KEYS_PER_NODE]; member
281 if (node->keys[n] > offset) in xfs_iext_key_cmp()
283 if (node->keys[n] < offset) in xfs_iext_key_cmp()
366 if (node->keys[i] == XFS_IEXT_KEY_INVALID) in xfs_iext_node_nr_entries()
407 node->keys[0] = xfs_iext_leaf_key(prev, 0); in xfs_iext_grow()
414 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
419 node->keys[i] = XFS_IEXT_KEY_INVALID; in xfs_iext_grow()
440 if (node->keys[ in xfs_iext_update_node()
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_iext_tree.c105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
117 uint64_t keys[KEYS_PER_NODE]; member
281 if (node->keys[n] > offset) in xfs_iext_key_cmp()
283 if (node->keys[n] < offset) in xfs_iext_key_cmp()
366 if (node->keys[i] == XFS_IEXT_KEY_INVALID) in xfs_iext_node_nr_entries()
407 node->keys[0] = xfs_iext_leaf_key(prev, 0); in xfs_iext_grow()
414 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
419 node->keys[i] = XFS_IEXT_KEY_INVALID; in xfs_iext_grow()
440 if (node->keys[ in xfs_iext_update_node()
[all...]
/third_party/python/Lib/test/
H A Dmapping_tests.py53 knownkey = list(self.other.keys())[0]
71 # keys(), items(), iterkeys() ...
77 check_iterandlist(iter(d.keys()), list(d.keys()),
78 self.reference.keys())
79 check_iterandlist(iter(d), list(d.keys()), self.reference.keys())
98 for key in self.reference.keys():
144 self.assertEqual(list(d.keys()), [])
146 self.assertIn(list(self.inmapping.keys())[
202 def keys(self): global() member in BasicTestMappingProtocol.test_update.SimpleUserDict
216 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
223 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
240 def keys(self): global() member in BasicTestMappingProtocol.test_update.FailingUserDict
415 def keys(self): global() member in TestMappingProtocol.test_update.SimpleUserDict
[all...]
/foundation/arkui/ace_engine/frameworks/bridge/declarative_frontend/jsview/
H A Djs_video.cpp187 std::vector<std::string> keys = { "start" }; in JsOnStart()
188 func->Execute(keys, param); in JsOnStart()
205 std::vector<std::string> keys = { "pause" }; in JsOnPause()
206 func->Execute(keys, param); in JsOnPause()
223 std::vector<std::string> keys = { "finish" }; in JsOnFinish()
224 func->Execute(keys, param); in JsOnFinish()
241 std::vector<std::string> keys = { "stop" }; in JsOnStop()
242 func->Execute(keys, param); in JsOnStop()
259 std::vector<std::string> keys = { "fullscreen" }; in JsOnFullscreenChange()
260 func->Execute(keys, para in JsOnFullscreenChange()
355 GetEventMarker(const JSCallbackInfo& info, const std::vector<std::string>& keys) GetEventMarker() argument
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/
H A DMapFieldTest.cs332 // Surprising, but IDictionary.Contains is only about keys. in IDictionary_Contains()
433 var keys = map.Keys; in KeysReturnsLiveView()
434 CollectionAssert.AreEqual(new string[0], keys); in KeysReturnsLiveView()
437 CollectionAssert.AreEqual(new[] { "foo", "x" }, keys); in KeysReturnsLiveView()
451 // Just test keys - we know the implementation is the same for values
456 var keys = map.Keys; in ViewsAreReadOnly()
457 Assert.IsTrue(keys.IsReadOnly); in ViewsAreReadOnly()
458 Assert.Throws<NotSupportedException>(() => keys.Clear()); in ViewsAreReadOnly()
459 Assert.Throws<NotSupportedException>(() => keys.Remove("a")); in ViewsAreReadOnly()
460 Assert.Throws<NotSupportedException>(() => keys in ViewsAreReadOnly()
[all...]
/foundation/multimedia/media_foundation/interface/inner_api/plugin/
H A Dplugin_caps.h68 keys[key] = val; in AppendFixedKey()
75 auto it = keys.find(key); in GetFixedValue()
76 if (it != keys.end()) { in GetFixedValue()
93 keys[key] = std::make_pair(rangeStart, rangeEnd); in AppendIntervalKey()
108 keys[key] = std::move(discreteValues); in AppendDiscreteKeys()
128 std::map<TagType, Any> keys; member
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/trust/
H A Dindex.js26 function toTrustMaterial(root, keys) {
27 const keyFinder = typeof keys === 'function' ? keys : keyLocator(keys);
58 function keyLocator(keys) {
60 const key = (keys || {})[hint];
/third_party/python/Tools/unicode/
H A Dmkstringprep.py129 table = set(table.keys())
152 table = sorted(table.keys())
254 # table = set(table.keys())
273 table_c21 = set(table_c21.keys())
288 table_c22 = set(table_c22.keys())
312 assert set(table.keys()) == Co
328 table = set(table.keys())
345 assert set(table.keys()) == Cs
357 table = sorted(table.keys())
370 table = sorted(table.keys())
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dunordered_set_modifiers_test.h38 ASSERT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values)); in TYPED_TEST_P()
40 EXPECT_THAT(keys(m), ::testing::UnorderedElementsAre()); in TYPED_TEST_P()
74 ASSERT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values)); in TYPED_TEST_P()
158 ASSERT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values)); in TYPED_TEST_P()
165 EXPECT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values2.begin(), in TYPED_TEST_P()
175 ASSERT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values)); in TYPED_TEST_P()
177 EXPECT_THAT(keys(m), ::testing::UnorderedElementsAre()); in TYPED_TEST_P()
187 ASSERT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values)); in TYPED_TEST_P()
190 EXPECT_THAT(keys(m), ::testing::UnorderedElementsAreArray(values.begin() + 1, in TYPED_TEST_P()
202 EXPECT_THAT(keys(m in TYPED_TEST_P()
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree.c43 /* makes the assumption that no two keys are the same. */
50 uint64_t mid_key = le64_to_cpu(n->keys[mid]); in bsearch()
104 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le); in __dm_written_to_disk()
367 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
375 uint64_t *keys, void *value_le) in dm_btree_lookup()
397 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup()
402 if (rkey != keys[level]) { in dm_btree_lookup()
462 *rkey = le64_to_cpu(n->keys[i]); in dm_btree_lookup_next_single()
471 uint64_t *keys, uint64_ in dm_btree_lookup_next()
374 dm_btree_lookup(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, void *value_le) dm_btree_lookup() argument
470 dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, uint64_t *rkey, void *value_le) dm_btree_lookup_next() argument
1227 need_insert(struct btree_node *node, uint64_t *keys, unsigned int level, unsigned int index) need_insert() argument
1421 walk_node(struct dm_btree_info *info, dm_block_t block, int (*fn)(void *context, uint64_t *keys, void *leaf), void *context) walk_node() argument
1429 uint64_t keys; walk_node() local
1456 dm_btree_walk(struct dm_btree_info *info, dm_block_t root, int (*fn)(void *context, uint64_t *keys, void *leaf), void *context) dm_btree_walk() argument
[all...]
H A Ddm-btree.h34 * Manipulates hierarchical B+ trees with 64-bit keys and arbitrary-sized
111 uint64_t *keys, void *value_le);
118 uint64_t *keys, uint64_t *rkey, void *value_le);
124 uint64_t *keys, void *value, dm_block_t *new_root)
133 uint64_t *keys, void *value, dm_block_t *new_root,
143 uint64_t *keys, dm_block_t *new_root);
146 * Removes a _contiguous_ run of values starting from 'keys' and not
147 * reaching keys2 (where keys2 is keys with the final key replaced with
148 * 'end_key'). 'end_key' is the one-past-the-end value. 'keys' may be
152 uint64_t *keys, uint64_
[all...]
/kernel/linux/linux-5.10/net/core/
H A Dflow_dissector.c889 * @flow_dissector: list of keys to dissect
898 * The function will try to retrieve individual keys into target specified
1491 static inline void __flow_hash_consistentify(struct flow_keys *keys) in __flow_hash_consistentify() argument
1495 switch (keys->control.addr_type) { in __flow_hash_consistentify()
1497 if ((__force u32)keys->addrs.v4addrs.dst < in __flow_hash_consistentify()
1498 (__force u32)keys->addrs.v4addrs.src) in __flow_hash_consistentify()
1499 swap(keys->addrs.v4addrs.src, keys->addrs.v4addrs.dst); in __flow_hash_consistentify()
1501 if ((__force u16)keys->ports.dst < in __flow_hash_consistentify()
1502 (__force u16)keys in __flow_hash_consistentify()
1523 __flow_hash_from_keys(struct flow_keys *keys, const siphash_key_t *keyval) __flow_hash_from_keys() argument
1538 flow_hash_from_keys(struct flow_keys *keys) flow_hash_from_keys() argument
1545 ___skb_get_hash(const struct sk_buff *skb, struct flow_keys *keys, const siphash_key_t *keyval) ___skb_get_hash() argument
1586 struct flow_keys keys; __skb_get_hash_symmetric() local
1609 struct flow_keys keys; __skb_get_hash() local
1623 struct flow_keys keys; skb_get_hash_perturb() local
1629 __skb_get_poff(const struct sk_buff *skb, void *data, const struct flow_keys_basic *keys, int hlen) __skb_get_poff() argument
1691 struct flow_keys_basic keys; skb_get_poff() local
1700 __get_hash_from_flowi6(const struct flowi6 *fl6, struct flow_keys *keys) __get_hash_from_flowi6() argument
[all...]
/kernel/linux/linux-6.6/net/core/
H A Dflow_dissector.c1009 * @flow_dissector: list of keys to dissect
1018 * The function will try to retrieve individual keys into target specified
1733 static inline void __flow_hash_consistentify(struct flow_keys *keys) in __flow_hash_consistentify() argument
1737 switch (keys->control.addr_type) { in __flow_hash_consistentify()
1739 if ((__force u32)keys->addrs.v4addrs.dst < in __flow_hash_consistentify()
1740 (__force u32)keys->addrs.v4addrs.src) in __flow_hash_consistentify()
1741 swap(keys->addrs.v4addrs.src, keys->addrs.v4addrs.dst); in __flow_hash_consistentify()
1743 if ((__force u16)keys->ports.dst < in __flow_hash_consistentify()
1744 (__force u16)keys in __flow_hash_consistentify()
1765 __flow_hash_from_keys(struct flow_keys *keys, const siphash_key_t *keyval) __flow_hash_from_keys() argument
1780 flow_hash_from_keys(struct flow_keys *keys) flow_hash_from_keys() argument
1787 ___skb_get_hash(const struct sk_buff *skb, struct flow_keys *keys, const siphash_key_t *keyval) ___skb_get_hash() argument
1828 struct flow_keys keys; __skb_get_hash_symmetric() local
1851 struct flow_keys keys; __skb_get_hash() local
1865 struct flow_keys keys; skb_get_hash_perturb() local
1871 __skb_get_poff(const struct sk_buff *skb, const void *data, const struct flow_keys_basic *keys, int hlen) __skb_get_poff() argument
1933 struct flow_keys_basic keys; skb_get_poff() local
1942 __get_hash_from_flowi6(const struct flowi6 *fl6, struct flow_keys *keys) __get_hash_from_flowi6() argument
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree.h33 * Manipulates hierarchical B+ trees with 64-bit keys and arbitrary-sized
110 uint64_t *keys, void *value_le);
117 uint64_t *keys, uint64_t *rkey, void *value_le);
123 uint64_t *keys, void *value, dm_block_t *new_root)
132 uint64_t *keys, void *value, dm_block_t *new_root,
142 uint64_t *keys, dm_block_t *new_root);
145 * Removes a _contiguous_ run of values starting from 'keys' and not
146 * reaching keys2 (where keys2 is keys with the final key replaced with
147 * 'end_key'). 'end_key' is the one-past-the-end value. 'keys' may be
151 uint64_t *keys, uint64_
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dunify_const_pass.cpp39 // as an array of keys, looks up the trie to find a result id which is stored
41 // is found, creates a trie node with those keys, stores the instruction's
45 auto keys = GetLookUpKeys(inst); in LookupEquivalentResultFor() local
47 for (uint32_t key : keys) { in LookupEquivalentResultFor()
84 // The mapping from the keys to the child nodes of this node.
91 std::vector<uint32_t> keys; in GetLookUpKeys() local
96 keys.push_back(static_cast<uint32_t>(inst.opcode())); in GetLookUpKeys()
99 keys.insert(keys.end(), operand.words.cbegin(), operand.words.cend()); in GetLookUpKeys()
101 return keys; in GetLookUpKeys()
[all...]

Completed in 17 milliseconds

12345678910>>...146