Home
last modified time | relevance | path

Searched refs:keys (Results 76 - 100 of 2294) sorted by relevance

12345678910>>...92

/third_party/ltp/pan/
H A Dreporter.c68 * I could get a key (tag), get it's sub-keys (TCIDs), then get the key
181 static int scanner_test_end(SYM alltags, SYM ctag, SYM keys) in scanner_test_end() argument
189 if (alltags == NULL || keys == NULL || ctag == NULL) in scanner_test_end()
192 /* insert keys into tag */ in scanner_test_end()
193 sym_put(ctag, "_keys", (void *)keys, 0); in scanner_test_end()
196 if ((tag = (char *)sym_get(keys, "tag")) == NULL) { in scanner_test_end()
201 sym_put(keys, "tag", strdup(tagname), 0); in scanner_test_end()
211 (char *)sym_get(keys, "initiation_status")) != NULL) { in scanner_test_end()
239 static int iscanner_test_end(SYM alltags, SYM ctag, SYM keys) in iscanner_test_end() argument
241 if (alltags == NULL || keys in iscanner_test_end()
[all...]
/third_party/nghttp2/contrib/
H A Dtlsticketupdate.go51 var interval = flag.Int("interval", 3600, "interval to update TLS ticket keys")
67 keys := [][]byte{
78 for _, key := range keys {
95 // rotate keys. the last key is now encryption key.
99 // keep at most past 11 keys as decryption only key
100 n := len(keys) + 1
105 newKeys[0] = keys[len(keys)-1]
106 copy(newKeys[1:], keys[0:n-2])
109 keys
[all...]
/third_party/python/Objects/
H A Dlistobject.c1086 /* A sortslice contains a pointer to an array of keys and a pointer to
1087 * an array of corresponding values. In other words, keys[i]
1088 * corresponds with values[i]. If values == NULL, then the keys are
1091 * Several convenience routines are provided here, so that keys and
1096 PyObject **keys; member
1103 s1->keys[i] = s2->keys[j]; in sortslice_copy()
1111 *dst->keys++ = *src->keys++; in sortslice_copy_incr()
1119 *dst->keys in sortslice_copy_decr()
2280 PyObject **keys; list_sort_impl() local
[all...]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/Retired/
H A DcheckLinks.py42 if (curFile not in emittedPrefix.keys()):
76 if (value in dict.keys()):
231 if (tag in protos.keys()):
242 if (tag in structs.keys()):
263 if (value not in protos.keys()):
266 if (value not in structs.keys() and
267 value not in handles.keys()):
270 if (value not in consts.keys() and value not in defines.keys()):
273 if (value not in enums.keys() an
[all...]
/third_party/mbedtls/library/
H A Dssl_ticket.c69 mbedtls_ssl_ticket_key *key = ctx->keys + index; in ssl_ticket_gen_key()
115 * Rotate/generate keys if necessary
123 mbedtls_ssl_ticket_key * const key = ctx->keys + ctx->active; in ssl_ticket_update_keys()
140 if ((status = psa_destroy_key(ctx->keys[ctx->active].key)) != PSA_SUCCESS) { in ssl_ticket_update_keys()
160 mbedtls_ssl_ticket_key * const key = ctx->keys + idx; in mbedtls_ssl_ticket_rotate()
260 ctx->keys[0].alg = alg; in mbedtls_ssl_ticket_setup()
261 ctx->keys[0].key_type = key_type; in mbedtls_ssl_ticket_setup()
262 ctx->keys[0].key_bits = key_bits; in mbedtls_ssl_ticket_setup()
264 ctx->keys[1].alg = alg; in mbedtls_ssl_ticket_setup()
265 ctx->keys[ in mbedtls_ssl_ticket_setup()
[all...]
/third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/
H A DMapFieldTest.cs331 // Surprising, but IDictionary.Contains is only about keys. in IDictionary_Contains()
432 var keys = map.Keys; in KeysReturnsLiveView()
433 CollectionAssert.AreEqual(new string[0], keys); in KeysReturnsLiveView()
436 CollectionAssert.AreEqual(new[] { "foo", "x" }, keys); in KeysReturnsLiveView()
450 // Just test keys - we know the implementation is the same for values
455 var keys = map.Keys; in ViewsAreReadOnly()
456 Assert.IsTrue(keys.IsReadOnly); in ViewsAreReadOnly()
457 Assert.Throws<NotSupportedException>(() => keys.Clear()); in ViewsAreReadOnly()
458 Assert.Throws<NotSupportedException>(() => keys.Remove("a")); in ViewsAreReadOnly()
459 Assert.Throws<NotSupportedException>(() => keys in ViewsAreReadOnly()
[all...]
/foundation/resourceschedule/ffrt/tools/ffrt_trace_process/
H A Dffrt_trace_process.py146 if pid != 0 and pid not in active_process_map.keys():
151 if ti != 0 and ti not in active_process_map[pid].keys():
156 if switch_info["prev_tid"] not in switch_log_map.keys():
160 if switch_info["next_tid"] not in switch_log_map.keys():
206 if switch_log["cpu"] not in statistics["cpu"].keys():
211 if switch_log["prev_state"] not in statistics["switch_out"].keys():
296 if gid not in task_records.keys():
328 if gid in task_records.keys():
340 if gid in task_records.keys():
360 if gid in task_records.keys()
[all...]
/foundation/multimodalinput/input/service/subscriber/test/
H A Dkey_gesture_manager_ex_test.cpp244 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; in HWTEST_F() local
245 KeyGestureManager::LongPressCombinationKey longPressCombinationKey(keys); in HWTEST_F()
265 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; in HWTEST_F() local
266 KeyGestureManager::LongPressCombinationKey longPressCombinationKey(keys); in HWTEST_F()
286 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; in HWTEST_F() local
287 KeyGestureManager::LongPressCombinationKey longPressCombinationKey(keys); in HWTEST_F()
309 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; in HWTEST_F() local
310 KeyGestureManager::LongPressCombinationKey longPressCombinationKey(keys); in HWTEST_F()
329 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; in HWTEST_F() local
330 KeyGestureManager::LongPressCombinationKey longPressCombinationKey(keys); in HWTEST_F()
384 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; HWTEST_F() local
405 std::set<int32_t> keys = {}; HWTEST_F() local
420 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; HWTEST_F() local
440 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; HWTEST_F() local
463 std::set<int32_t> keys = { KeyEvent::KEYCODE_A, KeyEvent::KEYCODE_B, KeyEvent::KEYCODE_C }; HWTEST_F() local
[all...]
/foundation/distributeddatamgr/data_share/frameworks/native/proxy/src/
H A Dpublished_data_subscriber_manager.cpp34 std::vector<Key> keys; in AddObservers() local
35 std::for_each(uris.begin(), uris.end(), [&keys, &subscriberId](auto &uri) { in AddObservers()
36 keys.emplace_back(uri, subscriberId); in AddObservers()
39 keys, subscriber, std::make_shared<Observer>(callback), in AddObservers()
104 std::vector<Key> keys; in DelObservers() local
105 std::for_each(uris.begin(), uris.end(), [&keys, &subscriberId](auto &uri) { in DelObservers()
106 keys.emplace_back(uri, subscriberId); in DelObservers()
108 return BaseCallbacks::DelObservers(keys, subscriber, in DelObservers()
131 std::vector<Key> keys;
132 std::for_each(uris.begin(), uris.end(), [&keys,
[all...]
H A Drdb_subscriber_manager.cpp45 std::vector<Key> keys; in AddObservers() local
46 std::for_each(uris.begin(), uris.end(), [&keys, &templateId](auto &uri) { in AddObservers()
47 keys.emplace_back(uri, templateId); in AddObservers()
50 keys, subscriber, std::make_shared<Observer>(callback), in AddObservers()
92 std::vector<Key> keys; in DelObservers() local
93 std::for_each(uris.begin(), uris.end(), [&keys, &templateId](auto &uri) { in DelObservers()
94 keys.emplace_back(uri, templateId); in DelObservers()
96 return BaseCallbacks::DelObservers(keys, subscriber, in DelObservers()
138 std::vector<Key> keys;
139 std::for_each(uris.begin(), uris.end(), [&keys,
[all...]
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/kvdb/
H A Dkvdb_watcher.cpp40 std::vector<std::string> keys[OP_BUTT]{}; in OnChange()
41 keys[OP_INSERT] = ConvertToKeys(changeData->second[OP_INSERT]); in OnChange()
42 keys[OP_UPDATE] = ConvertToKeys(changeData->second[OP_UPDATE]); in OnChange()
43 keys[OP_DELETE] = ConvertToKeys(changeData->second[OP_DELETE]); in OnChange()
47 observer->OnChange(dataOrigin, std::move(keys)); in OnChange()
99 std::vector<std::string> keys{}; in ConvertToKeys()
105 keys.push_back(std::move(*key)); in ConvertToKeys()
107 return keys; in ConvertToKeys()
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_getspecific/
H A D1-1.c32 pthread_key_t keys[NUM_OF_KEYS]; in main() local
37 if (pthread_key_create(&keys[i], NULL) != 0) { in main()
42 (keys[i], (void *)(long)(i + KEY_VALUE)) != 0) { in main()
51 rc = pthread_getspecific(keys[i]); in main()
58 if (pthread_key_delete(keys[i]) != 0) { in main()
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_key_create/
H A D1-1.c17 * 1. Define an array of keys
18 * 2. Use pthread_key_create() and create those keys
19 * 3. Verify that you can set and get specific values for those keys without errors.
32 static pthread_key_t keys[NUM_OF_KEYS]; variable
40 if (pthread_key_create(&keys[i], NULL) != 0) { in main()
45 (keys[i], (void *)(long)(i + KEY_VALUE)) != 0) { in main()
54 rc = pthread_getspecific(keys[i]); in main()
61 if (pthread_key_delete(keys[i]) != 0) { in main()
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_setspecific/
H A D1-1.c33 pthread_key_t keys[NUM_OF_KEYS]; in main() local
38 if (pthread_key_create(&keys[i], NULL) != 0) { in main()
43 (keys[i], (void *)(long)(i + KEY_VALUE)) != 0) { in main()
54 rc = pthread_getspecific(keys[i]); in main()
61 if (pthread_key_delete(keys[i]) != 0) { in main()
/third_party/node/deps/v8/src/objects/
H A Delements-inl.h19 KeyAccumulator* keys) { in CollectElementIndices()
21 object, handle(object->elements(), keys->isolate()), keys); in CollectElementIndices()
25 Handle<JSObject> object, Handle<FixedArray> keys, GetKeysConversion convert, in PrependElementIndices()
29 keys, convert, filter); in PrependElementIndices()
18 CollectElementIndices(Handle<JSObject> object, KeyAccumulator* keys) CollectElementIndices() argument
24 PrependElementIndices( Handle<JSObject> object, Handle<FixedArray> keys, GetKeysConversion convert, PropertyFilter filter) PrependElementIndices() argument
/third_party/openGLES/extensions/
H A Dnextfree.py24 keys = { 'arbnumber', 'number', 'esnumber', 'scnumber' } variable
26 for k in keys:
31 for k in keys:
32 if k in v.keys():
38 for k in keys:
/third_party/skia/third_party/externals/opengl-registry/extensions/
H A Dnextfree.py35 keys = { 'arbnumber', 'number', 'esnumber' } variable
37 for k in keys:
42 for k in keys:
43 if k in v.keys():
49 for k in keys:
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeKey.java45 * multiple possible lengths for a single range prefix. Range keys are particularly useful as
46 * unique "row keys" when representing range trees as tabular data.
51 * Order by prefix first and then minimum length. For row keys representing disjoint ranges, this
73 * Decomposes the given range tree into a sorted sequence of keys, representing the same digit
74 * sequences. The resulting keys form a disjoint covering of the original range set, and no
75 * two keys will contain the same prefix (but prefixes of keys may overlap, even if the ranges
79 List<RangeKey> keys = new ArrayList<>(); in decompose()
80 // The ALLOW_EDGE_SPLITTING strategy works best for the case of generating row keys because it in decompose()
90 KeyVisitor.visit(f, keys); in decompose()
102 visit(RangeTree tree, List<RangeKey> keys) visit() argument
119 private final List<RangeKey> keys; global() field in RangeKey.KeyVisitor
126 KeyVisitor(List<RangeKey> keys) KeyVisitor() argument
[all...]
/third_party/typescript/tests/baselines/reference/
H A DliteralTypeWidening.js114 export function Set<K extends string>(...keys: K[]): Record<K, true | undefined> {
116 keys.forEach(key => result[key] = true)
120 export function keys<K extends string, V>(obj: Record<K, V>): K[] {
121 return Object.keys(obj) as K[]
128 export const langCodes = keys(langCodeSet)
173 exports.langCodes = exports.keys = exports.Set = void 0;
257 var keys = [];
259 keys[_i] = arguments[_i];
262 keys.forEach(function (key) { return result[key] = true; });
266 function keys(ob
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/innerkitsimpl/distributeddatafwk/src/
H A Dikvstore_observer.cpp87 void KvStoreObserverProxy::OnChange(const DataOrigin &origin, Keys &&keys) in OnChange() argument
95 if (!ITypesUtil::Marshal(data, origin.store, keys[OP_INSERT], keys[OP_UPDATE], keys[OP_DELETE])) { in OnChange()
145 Keys keys; in OnRemoteRequest() local
146 if (!ITypesUtil::Unmarshal(data, store, keys[OP_INSERT], keys[OP_UPDATE], keys[OP_DELETE])) { in OnRemoteRequest()
150 OnChange({ .store = store }, std::move(keys)); in OnRemoteRequest()
/kernel/linux/linux-5.10/lib/
H A Dtest_static_keys.c3 * Kernel module for testing static keys.
14 /* old keys */
55 static void invert_keys(struct test_key *keys, int size) in invert_keys() argument
61 if (previous != keys[i].key) { in invert_keys()
62 invert_key(keys[i].key); in invert_keys()
63 previous = keys[i].key; in invert_keys()
68 static int verify_keys(struct test_key *keys, int size, bool invert) in verify_keys() argument
74 ret = static_key_enabled(keys[i].key); in verify_keys()
75 init = keys[i].init_state; in verify_keys()
78 ret = keys[ in verify_keys()
[all...]
/kernel/linux/linux-6.6/lib/
H A Dtest_static_keys.c3 * Kernel module for testing static keys.
14 /* old keys */
55 static void invert_keys(struct test_key *keys, int size) in invert_keys() argument
61 if (previous != keys[i].key) { in invert_keys()
62 invert_key(keys[i].key); in invert_keys()
63 previous = keys[i].key; in invert_keys()
68 static int verify_keys(struct test_key *keys, int size, bool invert) in verify_keys() argument
74 ret = static_key_enabled(keys[i].key); in verify_keys()
75 init = keys[i].init_state; in verify_keys()
78 ret = keys[ in verify_keys()
[all...]
/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...]
/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
/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...]

Completed in 14 milliseconds

12345678910>>...92