| /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 | 20 * Retrieves a list of alternative keys to display on a long-press.
23 * even if empty. Used when constructing a set of alternates for keys
32 'keys': altKeys[id]
38 'keys': []
44 * Registers lists of alternative keys displayed on a long-press.
67 * @param {string=} opt_additionalKeys Optional list of additional keys
76 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);
|
| /libcore/luni/src/main/java/java/util/ |
| 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
|
| NavigableMap.java | 18 * associated with keys respectively less than, less than or equal,
22 * {@code higherKey} return only the associated keys. All of these
62 * @param <K> the type of keys maintained by this map
76 * with the keys currently in the map
78 * and this map does not permit null keys
90 * with the keys currently in the map
92 * and this map does not permit null keys
105 * with the keys currently in the map
107 * and this map does not permit null keys
119 * with the keys currently in the ma
[all...] |
| /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/chrome/common/extensions/ |
| 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...] |
| treemixin.py | 64 * keys([reverse]) -> generator for keys of T, O(n)
72 slicing by keys
75 * keyslice(s, e) -> generator for keys of T for s <= key < e, O(n)
77 * T[s:e] -> TreeSlice object, with keys in range s <= key < e, O(n)
89 * TreeSlice[s1:e1] -> TreeSlice object, with keys in range s1 <= key < e1
97 * keys() -> generator for keys of T, O(n)
99 * __iter__ <==> keys()
127 * intersection(t1, t2, ...) -> Tree with keys *common* to all tree
205 def keys(self, reverse=False): member in class:TreeMixin
[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...] |
| /external/chromium_org/chrome/browser/extensions/ |
| extension_tab_util.cc | 33 namespace keys = extensions::tabs_constants;
79 return is_loading ? keys::kStatusValueLoading : keys::kStatusValueComplete;
133 result->SetInteger(keys::kIdKey, GetTabId(contents));
134 result->SetInteger(keys::kIndexKey, tab_index);
135 result->SetInteger(keys::kWindowIdKey, GetWindowIdOfTab(contents));
136 result->SetString(keys::kStatusKey, GetTabStatusText(is_loading));
137 result->SetBoolean(keys::kActiveKey,
139 result->SetBoolean(keys::kSelectedKey,
141 result->SetBoolean(keys::kHighlightedKey
[all...] |
| /external/marisa-trie/lib/marisa/ |
| trie-search.cc | 12 PredictCallback(T key_ids, U keys, std::size_t max_num_results)
13 : key_ids_(key_ids), keys_(keys),
143 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
146 return (keys == NULL) ?
147 predict_breadth_first(str, key_ids, keys, max_num_results) :
148 predict_depth_first(str, key_ids, keys, max_num_results);
152 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
155 return (keys == NULL) ?
156 predict_breadth_first(ptr, length, key_ids, keys, max_num_results) :
157 predict_depth_first(ptr, length, key_ids, keys, max_num_results)
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-search.cc | 12 PredictCallback(T key_ids, U keys, std::size_t max_num_results)
13 : key_ids_(key_ids), keys_(keys),
148 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
151 return (keys == NULL) ?
152 predict_breadth_first(str, key_ids, keys, max_num_results) :
153 predict_depth_first(str, key_ids, keys, max_num_results);
157 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
161 return (keys == NULL) ?
162 predict_breadth_first(ptr, length, key_ids, keys, max_num_results) :
163 predict_depth_first(ptr, length, key_ids, keys, max_num_results)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ArrayTable.java | 42 * <p>The allowed row and column keys must be supplied when the table is
48 * keys and the number of supplied column keys. The {@code remove} and {@code
52 * <p>The ordering of the row and column keys provided when the table is
61 * <p>Null row keys or column keys are not permitted.
65 * lists of allowed keys and values. See the {@link #at}, {@link #set}, {@link
86 * @param rowKeys row keys that may be stored in the generated table
87 * @param columnKeys column keys that may be stored in the generated table
88 * @throws NullPointerException if any of the provided keys is nul
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| KeyFactory2Test.java | 117 KeyPair keys = keyGen.generateKeyPair(); local
122 KeySpec privateKeySpec = fact.getKeySpec(keys.getPrivate(),
126 Arrays.toString(keys.getPrivate().getEncoded()),
128 privateKey = fact.generatePrivate(new PKCS8EncodedKeySpec(keys.getPrivate().getEncoded()));
130 Arrays.toString(keys.getPrivate().getEncoded()),
147 KeyPair keys = keyGen.generateKeyPair(); local
151 KeySpec publicKeySpec = fact.getKeySpec(keys.getPublic(),
158 Arrays.toString(keys.getPublic().getEncoded()),
239 KeyPair keys = keyGen.generateKeyPair(); local
243 KeySpec privateKeySpec = fact.getKeySpec(keys.getPrivate()
296 KeyPair keys = keyGen.generateKeyPair(); local
[all...] |
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
| Signature2Test.java | 33 static KeyPair keys; field in class:Signature2Test
38 keys = keyGen.generateKeyPair();
122 Signature.getInstance("DSA").initSign(keys.getPrivate());
129 Signature.getInstance("DSA").initVerify(keys.getPublic());
171 sig.initSign(keys.getPrivate());
189 sig.initSign(keys.getPrivate());
200 sig.initSign(keys.getPrivate());
211 sig.initSign(keys.getPrivate());
221 sig.initSign(keys.getPrivate());
226 sig.initVerify(keys.getPublic())
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| convert_web_app.cc | 32 namespace keys = extension_manifest_keys;
102 root->SetString(keys::kPublicKey, GenerateKey(web_app.manifest_url));
103 root->SetString(keys::kName, UTF16ToUTF8(web_app.title));
104 root->SetString(keys::kVersion, ConvertTimeToExtensionVersion(create_time));
105 root->SetString(keys::kDescription, UTF16ToUTF8(web_app.description));
106 root->SetString(keys::kLaunchWebURL, web_app.app_url.spec());
109 root->SetString(keys::kLaunchContainer, web_app.launch_container);
113 root->Set(keys::kIcons, icons);
123 root->Set(keys::kPermissions, permissions);
130 root->Set(keys::kWebURLs, urls)
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/processes/ |
| processes_api.cc | 40 namespace keys = processes_api_constants;
51 cache->SetDouble(keys::kCacheSize, static_cast<double>(stat.size));
52 cache->SetDouble(keys::kCacheLiveSize, static_cast<double>(stat.liveSize));
60 std::string type = keys::kProcessTypeOther;
64 type = keys::kProcessTypeBrowser;
67 type = keys::kProcessTypeRenderer;
70 type = keys::kProcessTypeExtension;
73 type = keys::kProcessTypeNotification;
76 type = keys::kProcessTypePlugin;
79 type = keys::kProcessTypeWorker
[all...] |
| /external/chromium_org/chrome/browser/ui/webui/translate_internals/ |
| translate_internals_handler.cc | 146 std::vector<std::string> keys; local
147 keys.push_back(prefs::kEnableTranslate);
153 keys.push_back(TranslatePrefs::kPrefTranslateBlockedLanguages);
155 keys.push_back(TranslatePrefs::kPrefTranslateLanguageBlacklist);
156 keys.push_back(TranslatePrefs::kPrefTranslateSiteBlacklist);
157 keys.push_back(TranslatePrefs::kPrefTranslateWhitelists);
158 keys.push_back(TranslatePrefs::kPrefTranslateDeniedCount);
159 keys.push_back(TranslatePrefs::kPrefTranslateAcceptedCount);
161 for (std::vector<std::string>::const_iterator it = keys.begin();
162 it != keys.end(); ++it)
[all...] |
| /external/chromium_org/chrome/common/extensions/api/plugins/ |
| plugins_handler.cc | 24 namespace keys = extension_manifest_keys;
48 extension->GetManifestData(keys::kPlugins));
55 extension->GetManifestData(keys::kPlugins));
65 const std::vector<std::string> PluginsHandler::Keys() const {
66 return SingleKey(keys::kPlugins);
71 if (!extension->manifest()->GetList(keys::kPlugins, &list_value)) {
86 if (!plugin_value->GetString(keys::kPluginsPath, &path_str)) {
94 if (plugin_value->HasKey(keys::kPluginsPublic)) {
95 if (!plugin_value->GetBoolean(keys::kPluginsPublic, &is_public)) {
120 extension->SetManifestData(keys::kPlugins, plugins_data.release())
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/ |
| mysql-modelingschema.dump | 46 /*!40000 ALTER TABLE `bugs` DISABLE KEYS */;
49 /*!40000 ALTER TABLE `bugs` ENABLE KEYS */;
75 /*!40000 ALTER TABLE `commits` DISABLE KEYS */;
78 /*!40000 ALTER TABLE `commits` ENABLE KEYS */;
101 /*!40000 ALTER TABLE `cvsfiles` DISABLE KEYS */;
104 /*!40000 ALTER TABLE `cvsfiles` ENABLE KEYS */;
124 /*!40000 ALTER TABLE `filetags` DISABLE KEYS */;
127 /*!40000 ALTER TABLE `filetags` ENABLE KEYS */;
148 /*!40000 ALTER TABLE `tags` DISABLE KEYS */;
151 /*!40000 ALTER TABLE `tags` ENABLE KEYS */;
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentNavigableMap.java | 19 * @param <K> the type of keys maintained by this map
84 * Returns a {@link NavigableSet} view of the keys contained in this map.
85 * The set's iterator returns the keys in ascending order.
100 * @return a navigable set view of the keys in this map
105 * Returns a {@link NavigableSet} view of the keys contained in this map.
106 * The set's iterator returns the keys in ascending order.
123 * @return a navigable set view of the keys in this map
128 * Returns a reverse order {@link NavigableSet} view of the keys contained in this map.
129 * The set's iterator returns the keys in descending order.
144 * @return a reverse order navigable set view of the keys in this ma
[all...] |
