| /external/chromium_org/chrome/common/extensions/manifest_handlers/ |
| externally_connectable.cc | 38 namespace keys = extension_manifest_keys;
62 CHECK(extension->manifest()->Get(keys::kExternallyConnectable,
76 extension->SetManifestData(keys::kExternallyConnectable, info.release());
80 const std::vector<std::string> ExternallyConnectableHandler::Keys() const {
81 return SingleKey(keys::kExternallyConnectable);
88 extension->GetManifestData(keys::kExternallyConnectable));
|
| /external/chromium_org/chrome/test/webdriver/commands/ |
| html5_storage_commands.cc | 34 base::ListValue* keys; local
35 Error* error = session_->GetStorageKeys(kLocalStorageType, &keys);
40 response->SetValue(keys);
145 base::ListValue* keys; local
146 Error* error = session_->GetStorageKeys(kSessionStorageType, &keys);
151 response->SetValue(keys);
|
| /external/chromium_org/content/public/android/java/src/org/chromium/content/browser/accessibility/ |
| JellyBeanAccessibilityInjector.java | 117 // Remove all keys from the object.
118 final Iterator<?> keys = mAccessibilityJSONObject.keys(); local
119 while (keys.hasNext()) {
120 keys.next();
121 keys.remove();
|
| /external/chromium_org/remoting/client/plugin/ |
| mac_key_event_processor_unittest.cc | 82 // Test pressing command key and other normal keys.
110 // More than one keys after CMD.
135 // More than one keys after CMD.
142 // Test pressing command and special keys.
184 // Test pressing multiple command keys.
204 // Test multiple CMD keys at the same time.
|
| /external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 31 int64_t keys[0x800]; // 2k member in struct:BMPBitHash
44 * Map at most 1k=0x400 different keys with this data structure.
56 keys[hash]=key;
59 } else if(keys[hash]==key) {
72 * Invert the hash map: Fill an array of length countKeys() with the keys
79 k[i]=keys[reverse[i]];
|
| /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/ |
| mediaconstraintsinterface.h | 64 // Constraint keys used by a local video source.
75 // Constraint keys used by a local audio source.
76 // These keys are google specific.
84 // Google-specific constraint keys for a local video source
90 // Constraint keys for CreateOffer / CreateAnswer
96 // These keys are google specific.
|
| /external/chromium_org/v8/test/cctest/ |
| test-dictionary.cc | 55 // Keys still have to be valid after objects were moved.
61 // Keys that are overwritten should not change number of elements.
66 // Keys mapped to the hole should be removed permanently.
72 // Keys should map back to their respective values and also should get
84 // Keys never added to the map which already have an identity hash
94 // Keys that don't have an identity hash should not be found and also
|
| /external/guava/guava/src/com/google/common/collect/ |
| HashBasedTable.java | 36 * all optional operations are supported. Null row keys, columns keys, and
43 * iteration across all row keys occurs.
79 * @param expectedRows the expected number of distinct row keys
99 * @throws NullPointerException if any of the row keys, column keys, or values
|
| TreeBasedTable.java | 40 * Implementation of {@code Table} whose row keys and column keys are ordered
42 * {@code TreeBasedTable}, you may provide comparators for the row keys and
43 * the column keys, or you may use natural ordering for both.
51 * all optional operations are supported. Null row keys, columns keys, and
58 * iteration across all row keys occurs.
93 * of both row and column keys.
110 * @param rowComparator the comparator that orders the row keys
111 * @param columnComparator the comparator that orders the column keys
[all...] |
| /external/icu4c/test/perf/unisetperf/draft/ |
| bitset.cpp | 31 int64_t keys[0x800]; // 2k member in struct:BMPBitHash
44 * Map at most 1k=0x400 different keys with this data structure.
56 keys[hash]=key;
59 } else if(keys[hash]==key) {
72 * Invert the hash map: Fill an array of length countKeys() with the keys
79 k[i]=keys[reverse[i]];
|
| /external/sepolicy/ |
| README | 99 mac_permissions.xml to public keys found in pem files. This script takes
101 Details of the configuration file (keys.conf) can be found in the subsection
102 keys.conf. This tool is also responsible for stripping the comments and
105 keys.conf
106 The keys.conf file is used for controlling the mapping of "tags" found in
107 the mac_permissions.xml signature stanzas with actual public keys found in
|
| /external/v8/test/cctest/ |
| test-dictionary.cc | 53 // Keys still have to be valid after objects were moved.
59 // Keys that are overwritten should not change number of elements.
64 // Keys mapped to undefined should be removed permanently.
70 // Keys should map back to their respective values and also should get
82 // Keys never added to the map which already have an identity hash
92 // Keys that don't have an identity hash should not be found and also
|
| /packages/apps/LegacyCamera/src/com/android/camera/ui/ |
| IndicatorControl.java | 89 protected void addControls(String[] keys, String[] otherSettingKeys) {
90 if (keys != null) {
91 for (int i = 0; i < keys.length; i++) {
93 (IconListPreference) mPreferenceGroup.findPreference(keys[i]);
133 int resId, String[] keys) {
135 context, resId, mPreferenceGroup, keys);
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| Keyboard.java | 43 * Loads an XML description of a keyboard and stores the attributes of the keys. A keyboard
44 * consists of rows of keys.
128 /** Total height of the keyboard, including the padding and keys */
132 * Total width of the keyboard, including left side gaps and keys, but not any gaps on the
137 /** List of keys in this keyboard */
140 /** List of modifier keys such as Shift & Alt, if any */
160 /** Number of key widths from current touch point to search for nearest keys. */
164 * Container for keys in the keyboard. All keys in a row are at the same Y-coordinate.
173 /** Default horizontal gap between keys in this row. *
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| WeakHashMapTest.java | 172 List<Object> keys = Arrays.asList(KEY_ARRAY); local
182 assertTrue("Assert 1: Invalid map entry key returned", keys
191 keys = values = null;
245 List keys = Arrays.asList(keyArray); local
253 assertTrue("Invalid map entry returned--bad key", keys
258 keys = null;
349 List keys = Arrays.asList(keyArray); local
353 assertEquals("Incorrect number of keys returned,", 100, keySet.size());
357 assertTrue("Invalid map entry returned--bad key", keys
360 keys = null
413 List keys = Arrays.asList(keyArray); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| PopulatedCachesTest.java | 51 // we use integers as keys; make sure the range covers some values that ARE cached by
195 Set<Object> keys = cache.asMap().keySet(); local
199 ASSERT.that(keys).hasContentsAnyOrder(expectedArray);
200 ASSERT.that(asList(keys.toArray())).hasContentsAnyOrder(expectedArray);
201 ASSERT.that(asList(keys.toArray(new Object[(int) cache.size()])))
205 .addEqualityGroup(cache.asMap().keySet(), keys)
208 assertEquals(WARMUP_SIZE, keys.size());
211 assertTrue(keys.contains(key));
212 assertTrue(keys.remove(key));
213 assertFalse(keys.remove(key))
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/nio/tests/java/nio/channels/ |
| SelectorTest.java | 102 * @tests java.nio.channels.Selector#keys()
107 Set<SelectionKey> keySet = selector.keys();
108 Set<SelectionKey> keySet2 = selector.keys();
115 // Any attempt to modify keys will cause UnsupportedOperationException
140 selector.keys();
148 * @tests java.nio.channels.Selector#keys()
283 // time if keys.size() == 0 (initial state of selector).
340 Set<SelectionKey> keys = selector.keys();
344 assertTrue(keys.contains(key1))
[all...] |
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactLocaleUtils.java | 44 * information: labels, name lookup keys.
322 final HashSet<String> keys = new HashSet<String>(); local
323 keys.add(romajiName);
324 return keys.iterator();
333 * nameLookupKeys: adds additional name lookup keys
356 HashSet<String> keys = new HashSet<String>(); local
363 // build the lookup keys for itself.
385 keys.add(keyOriginal.toString());
386 keys.add(keyPinyin.toString());
387 keys.add(keyInitial.toString())
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_bsddb.py | 46 self.assertIn('r', self.f.keys())
66 self.assertSetEquals(d.keys(), f.keys())
83 # of existing keys should not break iteration. (adding
84 # or removing keys should)
150 # of existing keys should not break iteration. (adding
151 # or removing keys should)
314 keys = self.d.keys()
315 keys.sort(
[all...] |
| test_mutants.py | 34 # The current set of keys in dict1 and dict2. These are materialized as
55 target, keys = dict1, dict1keys
57 target, keys = dict2, dict2keys
67 keys.append(newkey)
70 elif keys:
73 i = random.randrange(len(keys))
74 key = keys[i]
76 del keys[i]
110 # Return d.keys() after filling.
117 return d.keys()
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_bsddb.py | 46 self.assertIn('r', self.f.keys())
66 self.assertSetEquals(d.keys(), f.keys())
83 # of existing keys should not break iteration. (adding
84 # or removing keys should)
150 # of existing keys should not break iteration. (adding
151 # or removing keys should)
314 keys = self.d.keys()
315 keys.sort(
[all...] |
| test_mutants.py | 34 # The current set of keys in dict1 and dict2. These are materialized as
55 target, keys = dict1, dict1keys
57 target, keys = dict2, dict2keys
67 keys.append(newkey)
70 elif keys:
73 i = random.randrange(len(keys))
74 key = keys[i]
76 del keys[i]
110 # Return d.keys() after filling.
117 return d.keys()
[all...] |
| /external/chromium_org/sync/util/ |
| cryptographer.h | 67 // Returns whether we can decrypt |encrypted| using the keys we currently know
102 // Encrypts the set of currently known keys into |encrypted|. Returns true if
109 // Will decrypt the pending keys and install them if possible (pending key
117 // Will decrypt the pending keys and install them if possible (pending key
125 // Will decrypt the pending keys and install them if possible (pending key
142 // cryptographer has no pending keys. Like other calls that access the
146 // Attempts to decrypt the set of keys that was copied in the previous call to
147 // SetPendingKeys using |params|. Returns true if the pending keys were
165 // Returns whether there is a pending set of keys that needs to be decrypted.
170 // can't be created (i.e. if this Cryptograhper doesn't have valid keys)
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.cpp | 25 // Hash keys of the form {0}, {0,1}, {0,1,2}... up to N=255,using 256-N as
204 // Generate all keys of up to N bytes containing two non-zero bytes
209 // Compute # of keys
219 printf("Keyset 'TwoBytes' - up-to-%d-byte keys, %d total keys\n",maxlen, keycount);
224 // Add all keys with one non-zero byte
244 // Add all keys with two non-zero bytes
282 std::vector<ByteVec> & keys = (*it).second; local
284 for(int i = 0; i < (int)keys.size(); i++)
286 ByteVec & key = keys[i]
[all...] |
| /frameworks/base/core/java/android/util/ |
| SparseIntArray.java | 25 * auto-boxing keys and values and its data structure doesn't rely on an extra entry object
29 * using a binary search to find keys. The implementation is not intended to be appropriate for
37 * {@link #keyAt(int)} and {@link #valueAt(int)}. Iterating over the keys using
39 * keys in ascending order, or the values corresponding to the keys in ascending
180 * <p>The keys corresponding to indices in ascending order are guaranteed to
195 * to be associated with keys in ascending order, e.g.,
215 * specified key, or a negative number if no keys map to the
218 * and that multiple keys can map to the same value and this will
238 * the key is greater than all existing keys in the array
[all...] |
