| /external/openssh/ |
| authfd.h | 22 struct sshkey **keys; member in struct:ssh_identitylist
|
| ssh-keysign.c | 172 struct sshkey *keys[NUM_KEYTYPES], *key = NULL; local
231 keys[i] = NULL;
240 keys[i] = key;
270 if (keys[i] != NULL &&
271 sshkey_equal_public(key, keys[i])) {
284 if ((r = sshkey_sign(keys[i], &signature, &slen, data, dlen, 0)) != 0)
|
| /external/protobuf/java/src/main/java/com/google/protobuf/nano/ |
| FieldArray.java | 99 int[] keys = mFieldNumbers; local
107 keys[o] = keys[i];
|
| /external/slf4j/jcl-over-slf4j/src/main/java/org/apache/commons/logging/impl/ |
| SLF4JLogFactory.java | 109 Enumeration<String> keys = attributes.keys(); local
110 while (keys.hasMoreElements()) {
111 names.add((String) keys.nextElement());
|
| /external/smali/util/src/main/java/org/jf/util/ |
| SparseArray.java | 113 int[] keys = mKeys; local
121 keys[o] = keys[i];
253 * specified key, or a negative number if no keys map to the
256 * and that multiple keys can map to the same value and this will
288 * the key is greater than all existing keys in the array.
|
| /external/toybox/toys/other/ |
| hexedit.c | 173 char *keys[] = {"\033[A", "\033[B", "\033[C", "\033[D", "\033[5~", "\033[6~", local
213 key = scan_key(toybuf, keys, 1);
|
| /external/v8/test/mjsunit/ |
| keyed-call-ic.js | 58 var keys = variable
|
| /external/wpa_supplicant_8/hs20/server/www/ |
| est.php | 17 $keys = implode('|', array_keys($needed)); variable
18 preg_match_all('@(' . $keys . ')=(?:([\'"])([^\2]+?)\2|([^\s,]+))@',
|
| /external/wpa_supplicant_8/src/eap_server/ |
| eap_server_tls_common.c | 136 struct tls_keys keys; local
139 if (tls_connection_get_keys(sm->ssl_ctx, data->conn, &keys))
142 if (keys.client_random == NULL || keys.server_random == NULL)
145 *len = 1 + keys.client_random_len + keys.server_random_len;
152 os_memcpy(out + 1, keys.client_random, keys.client_random_len);
153 os_memcpy(out + 1 + keys.client_random_len, keys.server_random
[all...] |
| ikev2.h | 35 struct ikev2_keys keys; member in struct:ikev2_initiator_data
|
| /frameworks/base/core/java/android/util/ |
| LongSparseArray.java | 28 * auto-boxing keys and its data structure doesn't rely on an extra entry object
32 * using a binary search to find keys. The implementation is not intended to be appropriate for
40 * keys: instead of compacting its array immediately, it leaves the removed entry marked
47 * {@link #keyAt(int)} and {@link #valueAt(int)}. Iterating over the keys using
49 * keys in ascending order, or the values corresponding to the keys in ascending
158 long[] keys = mKeys; local
166 keys[o] = keys[i];
230 * <p>The keys corresponding to indices in ascending order are guaranteed t
[all...] |
| SparseArray.java | 28 * auto-boxing keys and its data structure doesn't rely on an extra entry object
32 * using a binary search to find keys. The implementation is not intended to be appropriate for
40 * keys: instead of compacting its array immediately, it leaves the removed entry marked
47 * {@link #keyAt(int)} and {@link #valueAt(int)}. Iterating over the keys using
49 * keys in ascending order, or the values corresponding to the keys in ascending
189 int[] keys = mKeys; local
197 keys[o] = keys[i];
261 * <p>The keys corresponding to indices in ascending order are guaranteed t
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
| SparseWeakArray.java | 124 long[] keys = mKeys; local
134 keys[o] = keys[i];
244 * specified key, or a negative number if no keys map to the
247 * and that multiple keys can map to the same value and this will
279 * the key is greater than all existing keys in the array.
|
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| Learning_StochasticLinearRanker.java | 77 String[] keys = new String[temp.size()]; local
80 keys[i] = temp.get(i).key;
85 return mLearningSlRanker.scoreSample(keys,values);
|
| /libcore/json/src/test/java/org/json/ |
| JSONObjectTest.java | 889 assertFalse(object.keys().hasNext());
891 object.keys().next();
904 Iterator<String> keys = (Iterator<String>) object.keys(); local
906 assertTrue(keys.hasNext());
907 result.add(keys.next());
908 assertTrue(keys.hasNext());
909 result.add(keys.next());
910 assertFalse(keys.hasNext());
914 keys.next()
923 Iterator keys = object.keys(); local
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| SerializationHandleMap.java | 28 private Object[] keys; field in class:SerializationHandleMap
45 Object[] oldKeys = keys;
48 this.keys = new Object[newSize];
55 int index = findIndex(key, keys);
56 keys[index] = key;
63 int index = findIndex(key, keys);
64 if (keys[index] == key) {
99 int index = findIndex(_key, keys);
102 if (keys[index] != _key) {
105 index = findIndex(_key, keys);
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| find_test.cpp | 90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} }; local
91 Key const* k = find(keys + 0, keys + 10, 5);
92 CPPUNIT_ASSERT( k == keys + 10 );
|
| /ndk/tests/device/test-stlport/unit/ |
| find_test.cpp | 90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} }; local
91 Key const* k = find(keys + 0, keys + 10, 5);
92 CPPUNIT_ASSERT( k == keys + 10 );
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| UserDict.py | 39 def keys(self): return self.data.keys() member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| shelve.py | 4 with dbm databases is that the values (not the keys!) in a shelf can
7 types, and objects containing lots of shared sub-objects. The keys
24 list = d.keys() # a list of all existing keys (slow!)
80 __getitem__ = __setitem__ = __delitem__ = keys = closed
100 def keys(self): member in class:Shelf
101 return self.dict.keys()
|
| weakref.py | 233 """ Mapping class that references keys weakly.
315 """Return an iterator that yields the weak references to the keys.
321 keep the keys around longer than needed.
339 """Return a list of weak references to the keys.
345 keep the keys around longer than needed.
348 return self.data.keys()
350 def keys(self): member in class:WeakKeyDictionary
352 for wr in self.data.keys():
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_userdict.py | 91 # Test keys, items, values
92 self.assertEqual(u2.keys(), d2.keys())
97 for i in u2.keys():
118 for i in u2.keys():
129 keys = u2.keys()
130 self.assertEqual(set(ikeys), set(keys))
166 self.assertNotIn(2, d.keys())
236 def keys(self) member in class:SeqDict
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| UserDict.py | 39 def keys(self): return self.data.keys() member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| shelve.py | 4 with dbm databases is that the values (not the keys!) in a shelf can
7 types, and objects containing lots of shared sub-objects. The keys
24 list = d.keys() # a list of all existing keys (slow!)
80 __getitem__ = __setitem__ = __delitem__ = keys = closed
100 def keys(self): member in class:Shelf
101 return self.dict.keys()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_userdict.py | 91 # Test keys, items, values
92 self.assertEqual(u2.keys(), d2.keys())
97 for i in u2.keys():
118 for i in u2.keys():
129 keys = u2.keys()
130 self.assertEqual(set(ikeys), set(keys))
166 self.assertNotIn(2, d.keys())
236 def keys(self) member in class:SeqDict
[all...] |
