| /external/chromium_org/tools/json_schema_compiler/test/ |
| functions_on_types_unittest.cc | 17 EXPECT_FALSE(params->keys);
32 ASSERT_TRUE(params->keys);
33 EXPECT_EQ("test", *params->keys->as_string);
44 ASSERT_TRUE(params->keys);
46 ¶ms->keys->as_object->additional_properties));
|
| /external/chromium_org/ui/base/gtk/ |
| event_synthesis_gtk.cc | 28 GdkKeymapKey* keys; local
32 event->key.keyval, &keys, &n_keys)) {
33 event->key.hardware_keycode = keys[0].keycode;
34 event->key.group = keys[0].group;
35 g_free(keys);
|
| /external/iproute2/man/man8/ |
| lnstat.8 | 30 Dump list of available files/keys.
38 .B \-k, \-\-keys k,k,k,...
39 Display only keys specified.
52 Select the specified files and keys.
67 Display statistics for keys entries, in_hit and in_slow_tot of field rt_cache every second.
|
| /external/openssh/ |
| README.dns | 1 How to verify host keys using OpenSSH and DNS
4 OpenSSH contains support for verifying host keys using DNS as described in
18 file containing the public host key file. If you have multiple keys,
30 (2) Client: Enable ssh to verify host keys using DNS
32 To enable the ssh client to verify host keys using DNS, you have to
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/matchers/ |
| StartedServiceMatcher.java | 40 * Check if the class of the intent and the keys of the intent's extras match
70 // Test that both intent extras have the same keys
71 Set<String> keys = shadowIntent.getExtras().keySet(); local
73 intentsMatch = keys.equals(expectedKeys);
75 message += "did not get the same extras keys";
|
| /packages/inputmethods/LatinIME/java/res/color/ |
| key_text_color_holo.xml | 18 <!-- Functional keys. -->
24 <!-- Action keys. -->
30 <!-- Toggle keys. Use checkable/checked state. -->
40 <!-- Empty background keys. -->
44 <!-- Normal keys. -->
|
| /packages/inputmethods/LatinIME/java/res/drawable/ |
| btn_keyboard_key_gb.xml | 18 <!-- Functional keys. -->
24 <!-- Action keys. -->
30 <!-- Toggle keys. Use checkable/checked state. -->
40 <!-- Empty background keys. -->
44 <!-- Normal keys. -->
|
| btn_keyboard_key_ics.xml | 18 <!-- Functional keys. -->
24 <!-- Action keys. -->
30 <!-- Toggle keys. Use checkable/checked state. -->
40 <!-- Empty background keys. -->
44 <!-- Normal keys. -->
|
| btn_keyboard_key_klp.xml | 18 <!-- Functional keys. -->
24 <!-- Action keys. -->
30 <!-- Toggle keys. Use checkable/checked state. -->
40 <!-- Empty background keys. -->
44 <!-- Normal keys. -->
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimap.java | 31 * Implementation of {@code Multimap} whose keys and values are ordered by
43 * through the keys according to the key comparator ordering or the natural
44 * ordering of the keys. Similarly, {@code get}, {@code removeAll}, and {@code
47 * collections generated by {@code entries}, {@code keys}, and {@code values}
48 * iterate across the keys according to the above key ordering, and for each
54 * <p>Null keys and values are permitted (provided, of course, that the
73 * its keys and values.
97 * keys and values, with the same mappings as the specified multimap.
134 * Returns the comparator that orders the multimap keys.
148 * <p>Because a {@code TreeMultimap} has unique sorted keys, this metho
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| SortedMap.java | 22 * A map that has its keys ordered. The sorting is according to either the
23 * natural ordering of its keys or the ordering given by a specified comparator.
28 * Returns the comparator used to compare keys in this sorted map, or null if the natural
42 * Returns a sorted map over a range of this sorted map with all keys that
51 * @return a sorted map where the keys are less than {@code endKey}.
57 * support {@code null} keys.
73 * Returns a sorted map over a range of this sorted map with all keys
91 * does not support {@code null} keys.
100 * Returns a sorted map over a range of this sorted map with all keys that
109 * @return a sorted map where the keys are greater or equal t
[all...] |
| Dictionary.java | 25 * associate keys with values, such as {@code Hashtable}.
41 * @see #keys
68 * Returns an enumeration on the keys of this dictionary.
70 * @return an enumeration of the keys of this dictionary.
75 public abstract Enumeration<K> keys(); method in class:Dictionary
90 * @see #keys
112 * @see #keys
|
| /cts/tests/tests/drm/src/android/drm/cts/ |
| DrmInfoRequestTest.java | 73 Iterator<String> keys = attributes.keySet().iterator(); local
74 while (keys.hasNext()) {
75 final String key = (String) keys.next();
79 // Request object must have all the keys that attributes does.
81 while (keys.hasNext()) {
82 final String key = (String) keys.next();
86 // Attributes object must have all the keys that request does.
|
| DrmInfoTest.java | 83 Iterator<String> keys = attributes.keySet().iterator(); local
84 while (keys.hasNext()) {
85 final String key = (String) keys.next();
89 // info object must have all the keys that attributes does.
91 while (keys.hasNext()) {
92 final String key = (String) keys.next();
96 // Attributes object must have all the keys that info does.
|
| /external/chromium_org/chrome/browser/extensions/api/declarative_content/ |
| content_condition.cc | 16 namespace keys = extensions::declarative_content_constants;
34 namespace keys = declarative_content_constants;
82 if (!condition_dict->GetString(keys::kInstanceType, &instance_type)) {
86 if (instance_type != keys::kPageStateMatcherType) {
98 if (condition_attribute_name == keys::kInstanceType) {
100 } else if (condition_attribute_name == keys::kPageUrl) {
110 } else if (condition_attribute_name == keys::kCss) {
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| dbformat_test.cc | 50 const char* keys[] = { "", "k", "hello", "longggggggggggggggggggggg" }; local
57 for (int k = 0; k < sizeof(keys) / sizeof(keys[0]); k++) {
59 TestKey(keys[k], seq[s], kTypeValue);
66 // When user keys are same
80 // When user keys are misordered
85 // When user keys are different, but correctly ordered
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/tests/ |
| test_symrec.py | 9 self.assertEquals(len(self.symtab.keys()), 0)
11 keys = self.symtab.keys()
12 self.assertEquals(len(keys), 1)
13 self.assertEquals(keys[0], "foo")
35 self.assertEquals(list(tab.keys()), list(tab.iterkeys()))
38 self.assertEquals(list(tab.iteritems()), zip(tab.keys(), tab.values()))
|
| /external/chromium_org/ui/keyboard/resources/elements/ |
| kb-altkey-data.html | 33 * Retrieves a list of alternative keys to display on a long-press.
36 * even if empty. Used when constructing a set of alternates for keys
45 'keys': altKeys[id]
51 'keys': []
57 * Registers lists of alternative keys displayed on a long-press.
80 * @param {string=} opt_additionalKeys Optional list of additional keys
89 var list = altKeys.keys;
|
| /external/chromium_org/v8/test/mjsunit/ |
| keyed-call-generic.js | 28 // A test for keyed call ICs with a mix of smi and string keys.
36 function testMany(receiver, keys, results) {
38 for (var k = 0; k != keys.length; k++) {
39 assertEquals(results[k], receiver[keys[k]]());
99 function testException(receiver, keys, exceptions) {
101 for (var k = 0; k != keys.length; k++) {
104 var result = receiver[keys[k]]();
|
| /external/v8/test/mjsunit/ |
| keyed-call-generic.js | 28 // A test for keyed call ICs with a mix of smi and string keys.
36 function testMany(receiver, keys, results) {
38 for (var k = 0; k != keys.length; k++) {
39 assertEquals(results[k], receiver[keys[k]]());
99 function testException(receiver, keys, exceptions) {
101 for (var k = 0; k != keys.length; k++) {
104 var result = receiver[keys[k]]();
|
| /frameworks/base/core/java/android/app/backup/ |
| FileBackupHelperBase.java | 54 ParcelFileDescriptor newState, String[] files, String[] keys) {
64 // the length of files and keys must be the same
65 if (files.length != keys.length) {
67 + " keys.length=" + keys.length);
76 int err = performBackup_native(oldStateFd, data.mBackupWriter, newStateFd, files, keys);
122 int data, FileDescriptor newState, String[] files, String[] keys);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| perfect.c | 11 set of n keys, this determines a hash function that maps each of
12 those keys into a value in 0..n-1 with no collisions.
16 keys, then it computes a^scramble[tab[b]] to get the final perfect hash.
18 2-byte or 4-byte values. If there are n keys, the length of tab[] is a
39 This leaves m unmapped keys and m values that something could hash to.
40 If you treat unmapped keys as lefthand nodes and unused hash values
44 determined a perfect hash for the whole set of keys.
46 *scramble* is used because (a^tab[i]) clusters keys around *a*.
125 fprintf(stderr, "perfect.c: Duplicates keys! %.*s\n",
133 fprintf(stderr, "perfect.c: Duplicate keys! %.8lx\n", key1->hash_k)
[all...] |
| /external/chromium_org/extensions/common/ |
| manifest_handler_unittest.cc | 80 const std::vector<std::string>& keys,
83 : name_(name), keys_(keys), prereqs_(prereqs), watcher_(watcher) {
101 virtual const std::vector<std::string> Keys() const OVERRIDE {
109 const std::vector<std::string>& keys,
112 : TestManifestHandler(name, keys, prereqs, watcher) {
123 const std::vector<std::string>& keys,
126 : TestManifestHandler(name, keys, prereqs, watcher) {
138 std::vector<std::string> keys)
141 keys_(keys) {
160 virtual const std::vector<std::string> Keys() const OVERRIDE
181 std::vector<std::string> keys; local
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| __init__.py | 68 * keys([reverse]) -> list of T's keys, O(n)
82 slicing by keys
85 * keyslice(s, e) -> generator for keys of T for s <= key < e, O(n)
87 * T[s:e] -> TreeSlice object, with keys in range s <= key < e, O(n)
99 * TreeSlice[s1:e1] -> TreeSlice object, with keys in range s1 <= key < e1
107 * keys() -> generator for keys of T, O(n)
109 * __iter__ <==> keys()
126 * intersection(t1, t2, ...) -> Tree with keys *common* to all tree
[all...] |
| /external/ipsec-tools/src/racoon/doc/ |
| README.plainrsa | 14 the keys. So, what all this means for the security administrator is
15 that the setup needs a pair of reasonably long keys for each host that
27 RSA keys for the host. There are only two parameters that you should
28 be concerned about: -b, which sets the number of bits for the keys,
31 seconds to generate keys that are 2048 bits long, and only slightly
32 longer to generate 4096-bit keys. Either key length should be
37 plainrsa-gen -b 2048 -f /var/tmp/boston.keys
40 includes both public and private keys. GUARD THIS FILE CAREFULLY,
50 Alternatively, you can also grab the first line of the boston.keys
66 your keys and place it in one directory and use the global directiv
[all...] |
