| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/ |
| AlgorithmParameterGenerator_ImplTest.java | 83 int [] keys = {-10000, -512, -1, 0, 10000}; local
92 for (int j = 0; j < keys.length; j++) {
94 apgs[i].init(keys[j]);
96 + keys[j]);
101 apgs[i].init(keys[j], random);
103 + keys[j]);
108 apgs[i].init(keys[j], null);
110 + keys[j]);
|
| /external/apache-http/src/org/apache/commons/logging/impl/ |
| WeakHashtable.java | 26 * to hold its keys thus allowing them to be reclaimed by the garbage collector.
30 * possible. It therefore does not accept null values or keys.</p>
80 * are used for its keys, it is necessary to use strong references for its values.
124 /* ReferenceQueue we check for gc'd keys */
185 public Enumeration keys() { method in class:WeakHashtable
187 final Enumeration enumer = super.keys();
223 throw new NullPointerException("Null keys are not allowed");
317 * Purges all entries whose wrapped keys
446 // existing keys, normal hashtable operations should never
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| KeyIterator.java | 105 Vector keys = ki.getKeyDeclarations(); local
111 int nDeclarations = keys.size();
116 KeyDeclaration kd = (KeyDeclaration) keys.elementAt(i);
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
| StringToIntTable.java | 25 * number strings being keys, and the odd number strings being values.
188 * Return array of keys in the table.
192 public final String[] keys() method in class:StringToIntTable
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| StringToIntTable.java | 25 * number strings being keys, and the odd number strings being values.
181 * Return array of keys in the table.
185 public final String[] keys() method in class:StringToIntTable
|
| /external/chromium/chrome/browser/renderer_host/ |
| gtk_key_bindings_handler_unittest.cc | 52 GdkKeymapKey *keys = NULL; local
54 if (gdk_keymap_get_entries_for_keyval(keymap, keyval, &keys, &n_keys)) {
64 event.hardware_keycode = keys[0].keycode;
65 event.group = keys[0].group;
67 g_free(keys);
|
| /external/chromium/chrome/browser/ssl/ |
| ssl_blocking_page.cc | 160 const char* keys[5] = { local
165 strings->SetString(keys[i], extra_info[i]);
168 strings->SetString(keys[i], "");
|
| /external/chromium_org/chrome/browser/extensions/api/storage/ |
| policy_value_store_unittest.cc | 66 virtual WriteResult Remove(const std::vector<std::string>& keys) OVERRIDE {
67 return delegate()->Remove(keys);
149 std::vector<std::string> keys; local
150 keys.push_back("key");
151 EXPECT_TRUE(store_->Remove(keys)->HasError());
|
| storage_api.cc | 122 // Gets the keys of a DictionaryValue.
124 std::vector<std::string> keys; local
126 keys.push_back(it.key());
128 return keys;
|
| /external/chromium_org/chrome/browser/sync/test/integration/performance/ |
| autofill_sync_perf_test.cc | 53 // Adds |num_keys| new autofill keys to the sync profile |profile|.
118 std::set<AutofillKey> keys; local
120 keys.insert(NextAutofillKey());
122 autofill_helper::AddKeys(profile, keys);
|
| /external/chromium_org/content/browser/renderer_host/ |
| gtk_key_bindings_handler_unittest.cc | 56 GdkKeymapKey *keys = NULL; local
58 if (gdk_keymap_get_entries_for_keyval(keymap, keyval, &keys, &n_keys)) {
68 event.hardware_keycode = keys[0].keycode;
69 event.group = keys[0].group;
71 g_free(keys);
|
| /external/chromium_org/content/child/indexed_db/ |
| webidbcursor_impl_unittest.cc | 134 std::vector<IndexedDBKey> keys; local
138 keys.push_back(IndexedDBKey(expected_key + i, WebIDBKeyTypeNumber));
140 cursor.SetPrefetchData(keys, primary_keys, values);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/ |
| prototype-1.7.js | 126 properties = Object.keys(source);
259 var keys = Object.keys(value);
260 for (var i = 0, length = keys.length; i < length; i++) {
261 var key = keys[i], str = Str(key, value, stack);
285 function keys(object) { function
352 keys: Object.keys || keys,
1262 function keys() {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| CSSKeyframeRule.cpp | 48 // Keys are always set when these objects are created.
73 const Vector<double>& StyleKeyframe::keys() const function in class:WebCore::StyleKeyframe
76 // Keys can only be cleared by setting the key text from JavaScript
86 void StyleKeyframe::setKeys(PassOwnPtr<Vector<double> > keys)
88 ASSERT(keys && !keys->isEmpty());
89 m_keys = keys;
119 PassOwnPtr<Vector<double> > StyleKeyframe::createKeyList(CSSParserValueList* keys)
121 OwnPtr<Vector<double> > keyVector = adoptPtr(new Vector<double>(keys->size()));
122 for (unsigned i = 0; i < keys->size(); ++i)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| ThreadSpecificWin.cpp | 86 static DWORD keys[kMaxTlsKeySize]; local
87 return keys;
|
| /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/leveldatabase/src/helpers/memenv/ |
| memenv_test.cc | 191 const Slice keys[] = {Slice("aaa"), Slice("bbb"), Slice("ccc")}; local
196 ASSERT_OK(db->Put(WriteOptions(), keys[i], vals[i]));
201 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res));
209 ASSERT_TRUE(keys[i] == iterator->key());
221 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res));
|
| /external/chromium_org/third_party/simplejson/ |
| ordered_dict.py | 85 def keys(self): member in class:OrderedDict
|
| /external/chromium_org/v8/test/cctest/ |
| test-weakmaps.cc | 210 // Test that weak map keys on an evacuation candidate which are reachable by
226 // Start second old-space page so that keys land on evacuation candidate.
230 // Fill up weak map with keys on an evacuation candidate.
231 Handle<JSObject> keys[32]; local
233 keys[i] = factory->NewJSObject(function, TENURED);
234 CHECK(!heap->InNewSpace(keys[i]->address()));
235 CHECK(!first_page->Contains(keys[i]->address()));
240 keys[i],
|
| test-weaksets.cc | 210 // Test that weak set keys on an evacuation candidate which are reachable by
226 // Start second old-space page so that keys land on evacuation candidate.
230 // Fill up weak set with keys on an evacuation candidate.
231 Handle<JSObject> keys[32]; local
233 keys[i] = factory->NewJSObject(function, TENURED);
234 CHECK(!heap->InNewSpace(keys[i]->address()));
235 CHECK(!first_page->Contains(keys[i]->address()));
240 keys[i],
|
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
65 Set<String> keys = nodes.keySet(); local
66 if (keys.size() > 0) {
69 for (String n : keys) {
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingMultimap.java | 87 public Multiset<K> keys() { method in class:ForwardingMultimap
88 return delegate().keys();
|
| Multimap.java | 33 * <p>The methods {@link #get}, {@link #keySet}, {@link #keys}, {@link #values},
54 * @param <K> the type of keys maintained by this multimap
185 * Returns the set of all keys, each appearing once in the returned set.
189 * @return the collection of distinct keys
194 * Returns a collection, which may contain duplicates, of all keys. The number
199 * @return a multiset with keys corresponding to the distinct keys of the
203 Multiset<K> keys(); method in interface:Multimap
|
| /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/iproute2/tc/ |
| f_flow.c | 27 " [hashing mode]: hash keys KEY-LIST ... [ perturb SECS ]\n"
63 static int flow_parse_keys(__u32 *keys, __u32 *nkeys, char *argv)
68 *keys = 0;
78 *keys |= 1 << i;
98 static int get_addend(__u32 *addend, char *argv, __u32 keys)
112 if (keys & (FLOW_KEY_SRC | FLOW_KEY_DST |
140 __u32 keys = 0, nkeys = 0; local
161 } else if (matches(*argv, "keys") == 0) {
163 if (flow_parse_keys(&keys, &nkeys, *argv))
165 addattr32(n, 4096, TCA_FLOW_KEYS, keys);
[all...] |
