| /external/iproute2/include/linux/tc_act/ |
| tc_pedit.h | 33 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /external/openssl/crypto/lhash/ |
| num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
| /external/webkit/LayoutTests/storage/domstorage/localstorage/ |
| enumerate-storage-expected.txt | 1 This test checks to see that you can enumerate a Storage object and get only the keys as a result. The built-in properties of the Storage object should be ignored. The test operates on the localStorage object.
|
| enumerate-with-length-and-key-expected.txt | 1 This test attempts to enumerate all the keys in localStorage with .length + .key(). The built-in properties of the Storage object should be ignored. The test operates on the localStorage object.
|
| /external/webkit/LayoutTests/storage/domstorage/sessionstorage/ |
| enumerate-storage-expected.txt | 1 This test checks to see that you can enumber a Storage object and get only the keys as a result. The built-in properties of the Storage object should be ignored. The test operates on the SessionStorage object.
|
| enumerate-with-length-and-key-expected.txt | 1 This test attempts to enumerate all the keys in sessionStorage with .length + .key(). The built-in properties of the Storage object should be ignored. The test operates on the sessionStorage object.
|
| /external/wpa_supplicant/examples/ |
| ieee8021x.conf | 1 # IEEE 802.1X with dynamic WEP keys using EAP-PEAP/MSCHAPv2
|
| /external/wpa_supplicant_6/wpa_supplicant/examples/ |
| ieee8021x.conf | 1 # IEEE 802.1X with dynamic WEP keys using EAP-PEAP/MSCHAPv2
|
| /dalvik/libcore/security/src/test/java/tests/security/interfaces/ |
| DSAPublicKeyTest.java | 50 KeyPair keys = null; local
59 keys = keyGen.generateKeyPair();
60 priv = (DSAPrivateKey) keys.getPrivate();
61 publ = (DSAPublicKey) keys.getPublic();
67 keys = keyGen.generateKeyPair();
68 priv = (DSAPrivateKey) keys.getPrivate();
69 publ = (DSAPublicKey) keys.getPublic();
|
| /external/webkit/WebKitTools/Scripts/ |
| report-include-statistics | 71 for my $include (keys %{ $includes{$file} }) {
74 for my $i (keys %{ $totalIncludes{$include} }) {
81 for my $file (keys %includes) {
86 for my $file (keys %sources) {
87 for my $include (keys %{ $totalIncludes{$file} }) {
92 for my $file (sort mostincludedcmp keys %includes) {
95 my $numIncludes = keys %{ $includes{$file} };
96 my $numTotalIncludes = keys %{ $totalIncludes{$file} };
109 my $ta = keys %{ $totalIncludes{$filea} };
110 my $tb = keys %{ $totalIncludes{$fileb} }
[all...] |
| /dalvik/libcore/text/src/main/java/java/text/ |
| CollationKey.java | 30 * comparing collation keys generated from different {@code Collator} instances
52 * The following example shows how collation keys can be used to sort a
59 * CollationKey[] keys = new CollationKey[3];
60 * keys[0] = myCollator.getCollationKey("Tom");
61 * keys[1] = myCollator.getCollationKey("Dick");
62 * keys[2] = myCollator.getCollationKey("Harry");
63 * sort(keys);
67 * // Inside body of sort routine, compare keys this way
68 * if( keys[i].compareTo( keys[j] ) > 0
[all...] |
| /frameworks/base/libs/ui/ |
| KeyCharacterMap.cpp | 105 Key const* keys = m_keys; local
107 if (keys->data[j] == c) {
108 *key = keys->keycode;
112 keys++;
120 Vector<int32_t>* keys, Vector<uint32_t>* modifiers)
125 keys->add(k);
137 Key* keys = m_keys; local
144 n = keys[mid].keycode;
150 return keys + mid;
200 Key* keys; local
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 27 * and removing) are supported. The values can be any objects. The keys can be
56 key = node.keys[offset];
89 if (node.keys[offset] == key) {
106 if (node.keys[offset] == key) {
128 K[] keys; field in class:TreeMap.Node
135 keys = (K[]) new Object[NODE_SIZE];
142 clone.keys = (K[]) new Object[NODE_SIZE];
144 System.arraycopy(keys, 0, clone.keys, 0, keys.length)
515 K[] keys = node.keys; local
634 K[] keys = node.keys; local
1116 K[] keys = node.keys; local
1280 K[] keys = node.keys; local
1462 K[] keys = node.keys; local
[all...] |
| 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.
44 * Returns a sorted map over a range of this sorted map with all keys that
53 * @return a sorted map where the keys are less than {@code endKey}.
59 * support {@code null} keys.
76 * Returns a sorted map over a range of this sorted map with all keys
94 * does not support {@code null} keys.
103 * Returns a sorted map over a range of this sorted map with all keys that
112 * @return a sorted map where the keys are greater or equal t
[all...] |
| Dictionary.java | 25 * associate keys with values, such as {@code Hashtable}.
42 * @see #keys
69 * Returns an enumeration on the keys of this dictionary.
71 * @return an enumeration of the keys of this dictionary.
76 public abstract Enumeration<K> keys(); method in class:Dictionary
91 * @see #keys
113 * @see #keys
|
| /external/dropbear/ |
| packet.c | 102 blocksize = ses.keys->recv_algo_crypt->blocksize;
159 blocksize = ses.keys->recv_algo_crypt->blocksize;
160 macsize = ses.keys->recv_algo_mac->hashsize;
195 if (ses.keys->recv_algo_crypt->cipherdesc == NULL) {
205 &ses.keys->recv_symmetric_struct) != CRYPT_OK) {
235 blocksize = ses.keys->recv_algo_crypt->blocksize;
236 macsize = ses.keys->recv_algo_mac->hashsize;
248 if (ses.keys->recv_algo_crypt->cipherdesc == NULL) {
259 &ses.keys->recv_symmetric_struct) != CRYPT_OK) {
291 if (ses.keys->recv_algo_comp == DROPBEAR_COMP_ZLIB)
[all...] |
| /dalvik/libcore/security/src/main/java/java/security/spec/ |
| package.html | 8 This package provides the classes and interfaces needed to specify keys and parameters for
13 Keys may be specified via algorithm or in a more abstract and general way with ASN.1.
|
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| eap_ikev2_common.c | 24 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys,
33 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL)
43 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen,
84 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys,
91 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar;
112 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len,
|
| eap_ikev2_common.h | 33 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys,
38 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys,
|
| eap_fast_common.c | 105 struct tls_keys keys; local
123 if (tls_connection_get_keys(ssl_ctx, conn, &keys))
126 rnd = os_malloc(keys.client_random_len + keys.server_random_len);
130 os_memcpy(rnd, keys.server_random, keys.server_random_len);
131 os_memcpy(rnd + keys.server_random_len, keys.client_random,
132 keys.client_random_len);
135 "expansion", keys.master_key, keys.master_key_len)
[all...] |
| /external/icu4c/i18n/unicode/ |
| sortkey.h | 28 * \brief C++ API: Keys for comparing strings multiple times.
44 * Collation keys are generated by the Collator class. Use the CollationKey objects
65 * CollationKey* keys = new CollationKey [3];
66 * myCollator->getCollationKey("Tom", keys[0], success );
67 * myCollator->getCollationKey("Dick", keys[1], success );
68 * myCollator->getCollationKey("Harry", keys[2], success );
70 * // Inside body of sort routine, compare keys this way:
72 * if(keys[0].compareTo( keys[1] ) > 0 ) {
73 * tmp = keys[0]; keys[0] = keys[1]; keys[1] = tmp
[all...] |
| /dalvik/libcore/nio/src/main/java/java/nio/channels/ |
| Selector.java | 26 * {@link SelectionKey} that represents the registration. The keys are also
27 * added to the selector's key set. Selection keys can be canceled so that the
30 * By invoking the {@code select} method, the key set is checked and all keys
32 * canceled keys. During the select operation, the channels registered with this
61 * {@link #wakeup()} method of this selector is called. After this, all keys
83 * Gets the set of registered keys. The set is immutable and is not thread-
86 * @return the set of registered keys.
88 public abstract Set<SelectionKey> keys(); method in class:Selector
132 * Gets the selection keys whose channels are ready for operation. The set
133 * is not thread-safe and no keys may be added to it. Removing keys i
[all...] |
| /external/kernel-headers/original/linux/ |
| keychord.h | 30 * all of the keys in the keycode list are in the pressed state.
31 * The order in which the keys are pressed does not matter.
32 * The keychord will not be signalled if keys not in the keycode
|
| /cts/tests/tests/util/src/android/util/cts/ |
| SparseBooleanArrayTest.java | 28 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
107 sparseBooleanArray.put(KEYS[i], VALUES[i]);
111 assertEquals(VALUES[i], sparseBooleanArray.get(KEYS[i]));
118 keyIndex = sparseBooleanArray.indexOfKey(KEYS[i]);
125 int existKey = KEYS[0];
147 assertEquals(VALUES[1], sparseBooleanArray.get(KEYS[1]));
149 sparseBooleanArray.delete(KEYS[1]);
151 sparseBooleanArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
225 sparseBooleanArray.put(KEYS[i], VALUES[i]);
229 assertEquals(VALUES[i], sparseBooleanArray.get(KEYS[i]))
[all...] |
| /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.
|
