/third_party/skia/third_party/externals/angle2/scripts/ |
H A D | generate_android_bp.py | 325 value_in_all_abis = value_in_all_abis and (key in bps_for_abis[abi2].keys( 328 if key in common_bp.keys(): 333 if 'arch' not in common_bp.keys(): 338 if key in common_bp['arch'][abi].keys(): 353 if target not in build_info[abi].keys(): 465 if output in outputs_remap.keys():
|
/third_party/python/Lib/test/ |
H A D | test_telnetlib.py | 125 self.keys = {} 133 self.keys[fileobj] = key 137 return self.keys.pop(fileobj) 141 for fileobj in self.keys: 148 return [(key, key.events) for key in self.keys.values()] 151 return self.keys
|
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
H A D | SmallSortedMapTest.java | 392 Iterator<Integer> keys = keySet.iterator(); in testMakeImmutable() 393 while (keys.hasNext()) { in testMakeImmutable() 394 Integer key = keys.next(); in testMakeImmutable() 401 keys.remove(); in testMakeImmutable() 408 private Set<Integer> makeSortedKeySet(Integer... keys) { in makeSortedKeySet() argument 409 return new TreeSet<Integer>(Arrays.<Integer>asList(keys)); in makeSortedKeySet()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/ |
H A D | string_view_benchmark.cc | 276 // creating the map, a number of lookups are done in random order. Some keys 288 // Create some keys that consist of words in random order. in StringViewMapBenchmark() 292 std::vector<std::string> keys(table_size); in StringViewMapBenchmark() 300 keys[i].clear(); in StringViewMapBenchmark() 302 absl::StrAppend(&keys[i], j > 0 ? " " : "", words[uniform(rng)]); in StringViewMapBenchmark() 304 } while (!t.insert(keys[i]).second); in StringViewMapBenchmark() 308 // keys we just created, with repeats. "Hot" keys get repeated more. in StringViewMapBenchmark() 331 test_strings[i] = keys[indices[i]]; in StringViewMapBenchmark() 339 h[keys[ in StringViewMapBenchmark() [all...] |
/third_party/icu/tools/unicodetools/com/ibm/rbm/ |
H A D | RBManager.java | 91 * In this implementation, the lookup keys are represented to the user as they appear in the files. The 224 Enumeration keys = descriptors.keys(); in RBManager() 225 while (keys.hasMoreElements()) { in RBManager() 226 String tag = (String)keys.nextElement(); in RBManager() 260 // Now that we have parsed the entire main language file, populate the allNLSKey set with the dictionary keys in RBManager() 262 Enumeration keys = ((Bundle)bundles.elementAt(0)).allItems.keys(); in RBManager() 263 while (keys.hasMoreElements()) { in RBManager() 264 allBundleKeys.addElement(keys in RBManager() [all...] |
H A D | RBTMXExporter.java | 118 Enumeration keys = lookups.keys(); in appendTUV() 119 while (keys.hasMoreElements()) { in appendTUV() 120 String key = (String)keys.nextElement(); in appendTUV()
|
H A D | RBTMXImporter.java | 235 Enumeration keys = hash.keys(); in getEncodingsVector() 236 while (keys.hasMoreElements()) { in getEncodingsVector() 237 v.addElement(keys.nextElement()); in getEncodingsVector()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
H A D | raw_hash_set_test.cc | 884 std::vector<int> keys; in TEST() local 888 keys.push_back(k); in TEST() 897 EXPECT_EQ(1, t.erase(keys[i])) << i; in TEST() 899 keys.erase(keys.begin() + erase_begin, keys.begin() + erase_end); in TEST() 901 auto last_key = keys.back(); in TEST() 914 for (const auto& k : keys) { in TEST() 925 std::deque<int> keys; in TEST() local 929 keys in TEST() 1053 auto keys = topk_range(b, b + N, &t); CollectBadMergeKeys() local 1188 CollectProbeStatsOnKeysXoredWithSeed( const std::vector<int64_t>& keys, size_t num_iters) CollectProbeStatsOnKeysXoredWithSeed() argument 1279 CollectProbeStatsOnLinearlyTransformedKeys( const std::vector<int64_t>& keys, size_t num_iters) CollectProbeStatsOnLinearlyTransformedKeys() argument [all...] |
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/ap/ |
H A D | ieee802_1x.c | 195 * sets this bit for all keys. */ in ieee802_1x_tx_key_one() 1489 struct radius_ms_mppe_keys *keys; in ieee802_1x_get_keys() local 1497 keys = radius_msg_get_ms_keys(msg, req, shared_secret, in ieee802_1x_get_keys() 1500 if (keys && keys->send && keys->recv) { in ieee802_1x_get_keys() 1501 len = keys->send_len + keys->recv_len; in ieee802_1x_get_keys() 1503 keys->send, keys in ieee802_1x_get_keys() [all...] |
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/ap/ |
H A D | ieee802_1x.c | 195 * sets this bit for all keys. */ in ieee802_1x_tx_key_one() 1481 struct radius_ms_mppe_keys *keys; in ieee802_1x_get_keys() local 1488 keys = radius_msg_get_ms_keys(msg, req, shared_secret, in ieee802_1x_get_keys() 1491 if (keys && keys->send && keys->recv) { in ieee802_1x_get_keys() 1492 len = keys->send_len + keys->recv_len; in ieee802_1x_get_keys() 1494 keys->send, keys in ieee802_1x_get_keys() [all...] |
/third_party/python/Tools/c-analyzer/c_common/ |
H A D | scriptutil.py | 489 def process_args(args, argv, processors, *, keys=None): 493 if keys is None: 498 remainder = set(keys) 513 def process_args_by_key(args, argv, processors, keys): 514 extracted = process_args(args, argv, processors, keys=keys) 515 return [extracted[key] for key in keys]
|
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/ |
H A D | tlsv1_client.c | 742 * @keys: Structure of random data (filled on success) 745 int tlsv1_client_get_random(struct tlsv1_client *conn, struct tls_random *keys) in tlsv1_client_get_random() argument 747 os_memset(keys, 0, sizeof(*keys)); in tlsv1_client_get_random() 751 keys->client_random = conn->client_random; in tlsv1_client_get_random() 752 keys->client_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random() 755 keys->server_random = conn->server_random; in tlsv1_client_get_random() 756 keys->server_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/ |
H A D | tlsv1_client.c | 766 * @keys: Structure of random data (filled on success) 769 int tlsv1_client_get_random(struct tlsv1_client *conn, struct tls_random *keys) in tlsv1_client_get_random() argument 771 os_memset(keys, 0, sizeof(*keys)); in tlsv1_client_get_random() 775 keys->client_random = conn->client_random; in tlsv1_client_get_random() 776 keys->client_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random() 779 keys->server_random = conn->server_random; in tlsv1_client_get_random() 780 keys->server_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
|
/third_party/icu/icu4c/source/samples/legacy/ |
H A D | oldcol.cpp | 90 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[4][32]) { in test_legacy() argument 100 keySize = getSortKey_legacy("ja", data[i], -1, keys[i], 32); in test_legacy()
|
H A D | newcol.cpp | 74 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]) { in test_current() argument 83 keySize = getSortKey_current("ja", data[i], -1, keys[i], 32); in test_current()
|
/third_party/node/test/parallel/ |
H A D | test-crypto-key-objects-messageport.js | 36 // The main thread generates keys and passes them to worker threads. 42 // Get immutable representations of all keys. 43 const keys = [secretKey, publicKey, privateKey] 46 for (const [key, repr] of keys) {
|
H A D | test-http2-respond-file-errors.js | 34 Object.keys(optionsWithTypeError).forEach((option) => { 35 Object.keys(types).forEach((type) => {
|
H A D | test-https-max-headers-count.js | 34 assert.strictEqual(Object.keys(req.headers).length, expected); 59 assert.strictEqual(Object.keys(res.headers).length, expected);
|
/third_party/nghttp2/ |
H A D | gentokenlookup.py | 41 for size in sorted(b.keys()): 47 for c in sorted(ents.keys()):
|
/third_party/skia/third_party/externals/icu/source/samples/legacy/ |
H A D | newcol.cpp | 74 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]) { in test_current() argument 83 keySize = getSortKey_current("ja", data[i], -1, keys[i], 32); in test_current()
|
H A D | oldcol.cpp | 90 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[4][32]) { in test_legacy() argument 100 keySize = getSortKey_legacy("ja", data[i], -1, keys[i], 32); in test_legacy()
|
/third_party/skia/tools/debugger/ |
H A D | DebugLayerManager.h | 126 // return list of keys that identify layer update events 127 const std::vector<DebugLayerManager::LayerKey>& getKeys() const { return keys; } in getKeys() 152 // The list of all keys in the map above (it has no keys() method) 153 std::vector<LayerKey> keys; member in DebugLayerManager
|
/third_party/typescript/tests/baselines/reference/ |
H A D | recursiveTypeRelations.js | 28 return Object.keys(arg).reduce<ClassNameObject>((obj: ClassNameObject, key: keyof S) => { 62 return Object.keys(arg).reduce(function (obj, key) {
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Relation.java | 27 * A Relation is a set of mappings from keys to values. 158 public V putAll(Collection<K> keys, V value) { in putAll() argument 160 for (K key : keys) { in putAll() 325 public final Set<V> removeAll(K... keys) { in removeAll() argument 326 return removeAll(Arrays.asList(keys)); in removeAll()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
H A D | Relation.java | 28 * A Relation is a set of mappings from keys to values. 160 public V putAll(Collection<K> keys, V value) { in putAll() argument 162 for (K key : keys) { in putAll() 327 public final Set<V> removeAll(K... keys) { in removeAll() argument 328 return removeAll(Arrays.asList(keys)); in removeAll()
|