HomeSort by relevance Sort by last modified time
    Searched refs:Keys (Results 1 - 17 of 17) sorted by null

  /libcore/support/src/test/java/org/apache/harmony/security/tests/support/
MyKeyStore.java 47 private Hashtable<String, Object> Keys = new Hashtable<String, Object>();
65 if (Keys.containsKey(alias)) {
66 return (Key) Keys.get(alias);
97 Keys.put(alias, key);
117 Keys.put(alias, keyK);
132 if (Keys.containsKey(alias)) {
133 Keys.remove(alias);
147 if (Keys.containsKey(alias)) {
157 return (Keys.size() + Cert.size());
161 if (Keys.containsKey(alias))
    [all...]
  /external/webkit/JavaScriptCore/wtf/
HashIterators.h 40 typedef HashTableConstKeysIterator<HashTableType, KeyType, MappedType> Keys;
52 Keys keys() { return Keys(*this); } function in struct:WTF::HashTableConstIteratorAdapter
62 typedef HashTableKeysIterator<HashTableType, KeyType, MappedType> Keys;
79 Keys keys() { return Keys(*this); } function in struct:WTF::HashTableIteratorAdapter
HashMap.h 59 // iterators iterate over pairs of keys and values
380 typedef typename HashMap<T, U, V, W, X>::const_iterator::Keys iterator;
384 iterator it = collection.begin().keys();
385 iterator end = collection.end().keys();
  /external/webkit/WebCore/plugins/win/
PluginPackageWin.cpp 329 MIMEToExtensionsMap::const_iterator::Keys end = a.m_mimeToExtensions.end().keys();
330 for (MIMEToExtensionsMap::const_iterator::Keys it = a.m_mimeToExtensions.begin().keys(); it != end; ++it) {
  /external/ppp/pppd/plugins/radius/etc/
dictionary.microsoft 23 ATTRIBUTE MS-CHAP-MPPE-Keys 12 string Microsoft
  /external/webkit/WebCore/plugins/android/
PluginPackageAndroid.cpp 396 MIMEToExtensionsMap::const_iterator::Keys end =
397 a.m_mimeToExtensions.end().keys();
398 for (MIMEToExtensionsMap::const_iterator::Keys it =
399 a.m_mimeToExtensions.begin().keys();
  /external/expat/bcb5/
elements.mak 70 [Version Info Keys]
expat.mak 71 [Version Info Keys]
expat_static.mak 71 [Version Info Keys]
expatw.mak 71 [Version Info Keys]
expatw_static.mak 72 [Version Info Keys]
outline.mak 70 [Version Info Keys]
xmlwf.mak 71 [Version Info Keys]
  /external/webkit/WebKit/win/
WebHistory.cpp 159 static BSTR keys[6] = {0}; local
160 if (!keys[0]) {
161 keys[0] = SysAllocString(WebHistoryItemsAddedNotification);
162 keys[1] = SysAllocString(WebHistoryItemsRemovedNotification);
163 keys[2] = SysAllocString(WebHistoryAllItemsRemovedNotification);
164 keys[3] = SysAllocString(WebHistoryLoadedNotification);
165 keys[4] = SysAllocString(WebHistoryItemsDiscardedWhileLoadingNotification);
166 keys[5] = SysAllocString(WebHistorySavedNotification);
168 return keys[notifyType];
480 DateToEntriesMap::const_iterator::Keys end = m_entriesByDate.end().keys()
    [all...]
  /external/libvpx/examples/includes/geshi/geshi/
rails.php 239 'ActiveSupport::CoreExtensions::Hash::Keys',
  /external/webkit/SunSpider/tests/parse-only/
mootools-1.2.2-core-nc.js 497 associate: function(keys){
498 var obj = {}, length = Math.min(this.length, keys.length);
499 for (var i = 0; i < length; i++) obj[keys[i]] = this[i];
879 var keys = [];
881 keys.push(key);
883 return keys;
945 var key = Event.Keys.keyOf(code);
1003 Event.Keys = new Hash({
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 409 All ciphers store their scheduled keys in a single data type called \textit{symmetric\_key}. This allows all ciphers to
410 have the same prototype and store their keys as naturally as possible. This also removes the need for dynamic memory
411 allocation, and allows you to allocate a fixed sized buffer for storing scheduled keys. All ciphers must provide six visible
544 \index{Symmetric Keys}
545 As a general rule of thumb, do not use symmetric keys under 80 bits if you can help it. Only a few of the ciphers support smaller
546 keys (mainly for test vectors anyways). Ideally, your application should be making at least 256 bit keys. This is not
652 Note that for \textit{DES} and \textit{3DES} they use 8 and 24 byte keys but only 7 and 21 [respectively] bytes of the keys are in
653 fact used for the purposes of encryption. My suggestion is just to use random 8/24 byte keys instead of trying to make a 8/2
    [all...]

Completed in 1157 milliseconds