| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_defaultdict.py | 35 self.assertIn("foo", d2.keys())
37 self.assertIn("bar", d2.keys())
39 self.assertIn(42, d2.keys())
41 self.assertNotIn(12, d2.keys())
|
| /system/security/keystore/include/keystore/ |
| keystore_get.h | 29 * Keys and values are 8-bit safe. The first two arguments are the key and its
|
| /bionic/tests/ |
| pthread_test.cpp | 32 #if !defined(__GLIBC__) // glibc uses keys internally that its sysconf value doesn't account for.
34 // We can allocate _SC_THREAD_KEYS_MAX keys.
35 std::vector<pthread_key_t> keys; local
40 keys.push_back(key);
47 // (Don't leak all those keys!)
48 for (size_t i = 0; i < keys.size(); ++i) {
49 ASSERT_EQ(0, pthread_key_delete(keys[i]));
|
| /cts/tests/tests/hardware/src/android/hardware/camera2/cts/ |
| CameraCaptureResultTest.java | 60 // List that includes all public keys from CaptureResult
63 // List tracking the failed test keys.
92 * Hardcode a key waiver list for the keys we want to skip the sanity check.
121 // TODO: check for LIMITED keys
206 StringBuffer failedKeyNames = new StringBuffer("Below Keys have null values:\n");
211 assertTrue("Some keys have null values, " + failedKeyNames.toString(),
263 * @hide keys.
|
| /external/chromium_org/chrome/test/chromedriver/ |
| util.cc | 33 string16 keys; local
37 return Status(kUnknownError, "keys should be a string");
44 keys.append(keys_list_part);
46 *dest = keys;
57 string16 keys; local
58 Status status = FlattenStringArray(key_list, &keys);
64 keys, release_modifiers, &sticky_modifiers_tmp, &events);
|
| /external/chromium_org/media/tools/constrained_network_server/ |
| cns_test.py | 81 self.assertEquals(self._pa._ports.keys(), [cns._DEFAULT_CNS_PORT_RANGE[0]])
99 self.assertEquals(set(self._pa._ports.keys()), set([
115 self.assertEquals(set(self._pa._ports.keys()), set([
133 self.assertEquals(self._pa._ports.keys(),
139 self.assertEquals(self._pa._ports.keys(),
143 self.assertEquals(self._pa._ports.keys(),
147 self.assertEquals(self._pa._ports.keys(), [])
|
| /external/chromium_org/sync/engine/ |
| apply_control_data_updates.cc | 89 // keys, unioned the set of encrypted types, and eventually re-encrypt
91 // merged encryption keys. Until the second client provides the pending
92 // passphrase, the cryptographer will preserve the encryption keys based on the
94 // keys.
101 // not in order to preserve any new encrypted types or encryption keys.
145 // pending keys are provided. If we had set a new custom passphrase locally
172 // had set an explict passphrase, we should have pending keys, so
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkScalar.h | 311 /** Interpolate along the function described by (keys[length], values[length])
312 for the passed searchKey. SearchKeys outside the range keys[0]-keys[Length]
316 Repeated keys are allowed for discontinuous functions (so long as keys is
318 keys, the first one will be used. However, that may change if a binary
321 SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[],
|
| /external/chromium_org/tools/gyp/pylib/gyp/ |
| MSVSUtil.py | 27 def _DeepCopySomeKeys(in_dict, keys):
28 """Performs a partial deep-copy on |in_dict|, only copying the keys in |keys|.
32 keys: The keys to be copied. If a key is in this list and doesn't exist in
38 for key in keys:
238 # A few keys that we don't want to propagate.
|
| /external/openssh/ |
| sshconnect2.c | 193 /* Prefer algorithms that we already have keys for */
248 char *filename; /* comment for agent-only keys */
263 Idlist keys; member in struct:Authctxt
599 * search keys in the reverse order, because last candidate has been
601 * duplicate keys
603 TAILQ_FOREACH_REVERSE(id, &authctxt->keys, idlist, next) {
[all...] |
| ssh-pkcs11.c | 85 * however, there might still be keys referencing this provider,
129 /* unregister all providers, keys might still point to the providers */
384 * lookup public keys for token in slot identified by slotidx,
385 * add 'wrapped' public keys to the 'keysp' array and increment nkeys.
386 * keysp points to an (possibly empty) array with *nkeys keys.
416 /* setup a filter the looks for public keys */
467 debug("have %d keys", *nkeys);
567 /* open session, login with pin and retrieve public keys */
576 error("no keys");
577 /* don't add the provider, since it does not have any keys */
[all...] |
| /external/replicaisland/src/com/replica/replicaisland/ |
| InputGameInterface.java | 79 final InputButton[] keys = input.getKeyboard().getKeys(); local
116 // keys or trackball
118 final InputButton left = keys[mLeftKeyCode];
119 final InputButton right = keys[mRightKeyCode];
197 final InputButton jumpKey = keys[mJumpKeyCode];
225 final InputButton attackKey = keys[mAttackKeyCode];
226 final InputButton clickButton = keys[KeyEvent.KEYCODE_DPAD_CENTER]; // special case
|
| /external/skia/include/core/ |
| SkScalar.h | 311 /** Interpolate along the function described by (keys[length], values[length])
312 for the passed searchKey. SearchKeys outside the range keys[0]-keys[Length]
316 Repeated keys are allowed for discontinuous functions (so long as keys is
318 keys, the first one will be used. However, that may change if a binary
321 SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[],
|
| /external/v8/test/mjsunit/harmony/ |
| collections.js | 80 var keys = [ +0, -0, +Infinity, -Infinity, true, false, null, undefined ];
81 for (var i = 0; i < keys.length; i++) {
82 TestSet(set, keys[i]);
109 var keys = [ +0, -0, +Infinity, -Infinity, true, false, null, undefined ];
110 for (var i = 0; i < keys.length; i++) {
111 TestMapping(m, keys[i], new Object);
210 // Test whether NaN values as keys are treated correctly.
|
| /libcore/luni/src/main/java/java/util/ |
| Map.java | 22 * A {@code Map} is a data structure consisting of a set of keys and values
24 * used as keys is declared when the {@code Map} is declared, as is the
28 * keys contained in it, as well as various methods to access and update
165 * Returns a set of the keys contained in this {@code Map}. The {@code Set} is backed by
169 * @return a set of the keys.
191 * not support {@code null} keys or values.
209 * support {@code null} keys or values.
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| KeyboardView.java | 58 * A view that renders a virtual {@link Keyboard}. It handles rendering of keys and
70 * For keys that repeat, this is only called once.
78 * For keys that repeat, this is only called once.
86 * @param keyCodes the codes for all the possible alternative keys
89 * will include other characters that may be on the same key or adjacent keys.
472 List<Key> keys = mKeyboard.getKeys(); local
473 mKeys = keys.toArray(new Key[keys.size()]);
593 * codes for adjacent keys. When disabled, only the primary key code will be
638 * Compute the average distance between adjacent keys (horizontally and vertically
696 final Key[] keys = mKeys; local
800 final Key[] keys = mKeys; local
893 final Key[] keys = mKeys; local
927 final Key[] keys = mKeys; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedHashMultimap.java | 42 * <p>The collections returned by {@code keySet}, {@code keys}, and {@code
43 * asMap} iterate through the keys in the order they were first added to the
51 * {@code keys}, and {@code asMap} has a few subtleties. As long as the set of
52 * keys remains unchanged, adding or removing mappings does not affect the key
60 * <p>Keys and values may be null. All optional multimap methods are supported,
95 * the specified numbers of keys and values without rehashing.
97 * @param expectedKeys the expected number of distinct keys
265 * with other keys.
359 * @serialData the number of distinct keys, and then for each distinct key:
361 * followed by successive keys and values from the entries() orderin
[all...] |
| /external/iproute2/tc/ |
| m_pedit.c | 134 sel->keys[hwm].val = tkey->val;
135 sel->keys[hwm].mask = tkey->mask;
136 sel->keys[hwm].off = tkey->off;
137 sel->keys[hwm].at = tkey->at;
138 sel->keys[hwm].offmask = tkey->offmask;
139 sel->keys[hwm].shift = tkey->shift;
465 struct tc_pedit_key keys[MAX_OFFS]; member in struct:__anon21199
569 fprintf(f, " pedit action %s keys %d\n ", action_n2a(sel->action, b1, sizeof (b1)),sel->nkeys);
580 struct tc_pedit_key *key = sel->keys;
590 fprintf(f, "\npedit %x keys %d is not LEGIT", sel->index,sel->nkeys)
[all...] |
| /external/wpa_supplicant_8/src/tls/ |
| tlsv1_server.c | 533 * @keys: Structure of key/random data (filled on success)
536 int tlsv1_server_get_keys(struct tlsv1_server *conn, struct tls_keys *keys)
538 os_memset(keys, 0, sizeof(*keys));
542 keys->client_random = conn->client_random;
543 keys->client_random_len = TLS_RANDOM_LEN;
546 keys->server_random = conn->server_random;
547 keys->server_random_len = TLS_RANDOM_LEN;
548 keys->master_key = conn->master_secret;
549 keys->master_key_len = TLS_MASTER_SECRET_LEN
[all...] |
| /libcore/luni/src/test/java/tests/api/javax/xml/parsers/ |
| SAXParserTestSupport.java | 33 * Support for SAXParserTest. Shares the element keys used in the golden files.
71 static String [] KEYS = {KEY_IS_START_DOC, KEY_IS_END_DOC, KEY_TEXT,
105 if(i < KEYS.length) {
106 storage.put(KEYS[i], str.toString());
150 for(int i = 0; i < KEYS.length; i++) {
151 if(!original.get(KEYS[i]).equals(result.get(KEYS[i]))) {
152 System.out.println("for "+KEYS[i]+": original:" +
153 original.get(KEYS[i]));
155 System.out.println(" result:" + result.get(KEYS[i]))
[all...] |
| /external/chromium/net/disk_cache/ |
| stress_cache.cc | 125 std::string keys[kNumKeys]; local
129 keys[i] = GenerateKey(true);
145 rv = cache->OpenEntry(keys[key], &entries[slot], &cb);
147 rv = cache->CreateEntry(keys[key], &entries[slot], &cb);
159 rv = cache->DoomEntry(keys[key], &cb);
|
| /external/chromium_org/ash/wm/ |
| sticky_keys.h | 25 // key event with modifier keys without simultaneous key press event. Instead,
26 // they can compose modified key events separately pressing each of the keys
37 // By typing same modifier keys twice, users can generate bunch of modified key
75 // modifier keys. If monitored keyboard events are recieved, StickyKeysHandler
146 // Translates |event| to sticky keys event type.
|
| /external/chromium_org/chromeos/dbus/ |
| shill_service_client_unittest.cc | 199 std::vector<std::string> keys; local
200 keys.push_back(flimflam::kPassphraseProperty);
201 keys.push_back(flimflam::kSignalStrengthProperty);
203 base::Bind(&ExpectArrayOfStringsArgument, keys),
209 keys, local
|
| /external/chromium_org/content/browser/dom_storage/ |
| session_storage_database.h | 42 // assumed to be empty and any duplicate keys will be overwritten. If the
49 // Updates the data for |namespace_id| and |origin|. Will remove all keys
51 // in |changes| will be examined - keys mapped to a null NullableString16 will
148 // true, only keys are aread from the database and the values in |result| will
180 // Helper functions for creating the keys needed for the schema.
|
| /external/chromium_org/sandbox/win/src/ |
| registry_policy_test.cc | 114 // Tests subdirectory access on keys where we don't have subdirectory acess.
121 // Tests to see if we can create keys where we dont have subdirectory access.
167 // Tests subdirectory acess on keys where we have subdirectory acess.
174 // Tests to see if we can create keys where we have subdirectory access.
197 // Tests to see if we can create keys where we have subdirectory access.
|
