Searched defs:keys (Results 126 - 150 of 471) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.cpp25 // Hash keys of the form {0}, {0,1}, {0,1,2}... up to N=255,using 256-N as
204 // Generate all keys of up to N bytes containing two non-zero bytes
209 // Compute # of keys
219 printf("Keyset 'TwoBytes' - up-to-%d-byte keys, %d total keys\n",maxlen, keycount);
224 // Add all keys with one non-zero byte
244 // Add all keys with two non-zero bytes
282 std::vector<ByteVec> & keys = (*it).second; local
284 for(int i = 0; i < (int)keys.size(); i++)
286 ByteVec & key = keys[
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/
H A Dsymrec.pxi240 def keys(self): member in class:SymbolTable
/external/chromium_org/tools/gyp/pylib/gyp/
H A Dordered_dict.py45 # An inherited dict maps keys to values.
50 # The internal self.__map dictionary maps keys to links in a doubly linked list.
143 def keys(self): member in class:OrderedDict
144 'od.keys() -> list of keys in od'
156 'od.iterkeys() -> an iterator over the keys in od'
175 If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
193 elif hasattr(other, 'keys'):
194 for key in other.keys()
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dkeyed-call-ic.js58 var keys = variable
/external/clang/utils/analyzer/
H A DCmpRuns.py109 def keys(self): member in class:multidict
110 return self.data.keys()
/external/emma/core/java12/com/vladium/util/
H A DIntIntMap.java146 public int [] keys () method in class:IntIntMap
262 * The structure used for chaining colliding keys.
323 private int m_size; // number of keys in the table, not cleared as of last check
H A DProperty.java350 * Overrides Properties.keys () [this is used for debug logging only]
352 public Enumeration keys () method in class:Property.FilePropertyLookup
356 return m_contents.keys ();
437 * Overrides Properties.keys () [this is used for debug logging only]
439 public synchronized Enumeration keys () method in class:Property.SystemPropertyLookup
470 return _propertyNames.keys ();
522 * Overrides Properties.keys () [this is used for debug logging only]
524 public synchronized Enumeration keys () method in class:Property.SystemRedirectsLookup
538 return _propertyNames.keys ();
/external/guava/guava/src/com/google/common/cache/
H A DAbstractCache.java63 public ImmutableMap<K, V> getAllPresent(Iterable<? extends K> keys) { argument
65 for (K key : keys) {
98 public void invalidateAll(Iterable<?> keys) { argument
99 for (Object key : keys) {
/external/guava/guava/src/com/google/common/collect/
H A DForwardingMultimap.java87 public Multiset<K> keys() { method in class:ForwardingMultimap
88 return delegate().keys();
H A DMultimap.java33 * <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/guava/guava-tests/test/com/google/common/cache/
H A DCacheExpirationTest.java443 private void getAll(LoadingCache<Integer, Integer> cache, List<Integer> keys) { argument
444 for (int i : keys) {
/external/guava/guava-tests/test/com/google/common/collect/
H A DSynchronizedMultimapTest.java143 @Override public Multiset<K> keys() { method in class:SynchronizedMultimapTest.TestMultimap
146 return super.keys();
/external/icu/icu4c/source/test/perf/unisetperf/draft/
H A Dbitset.cpp31 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/
H A Df_flow.c27 " [hashing mode]: hash keys KEY-LIST ... [ perturb SECS ]\n"
63 static int flow_parse_keys(__u32 *keys, __u32 *nkeys, char *argv) argument
68 *keys = 0;
78 *keys |= 1 << i;
98 static int get_addend(__u32 *addend, char *argv, __u32 keys) argument
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...]
/external/smali/util/src/main/java/ds/tree/
H A DRadixTreeImpl.java255 ArrayList<T> keys = new ArrayList<T>();
261 keys.add(node.getValue());
263 getNodes(node, keys, recordLimit);
266 return keys;
269 private void getNodes(RadixTreeNode<T> parent, ArrayList<T> keys, int limit) { argument
277 keys.add(node.getValue());
280 if (keys.size() == limit) {
/external/stlport/test/unit/
H A Dfind_test.cpp90 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 );
/external/wpa_supplicant_8/hostapd/src/eap_common/
H A Deap_fast_common.c99 struct tls_keys keys; local
117 if (tls_connection_get_keys(ssl_ctx, conn, &keys))
120 rnd = os_malloc(keys.client_random_len + keys.server_random_len);
124 os_memcpy(rnd, keys.server_random, keys.server_random_len);
125 os_memcpy(rnd + keys.server_random_len, keys.client_random,
126 keys.client_random_len);
129 "expansion", keys
[all...]
/external/wpa_supplicant_8/hostapd/src/eap_server/
H A Dikev2.h35 struct ikev2_keys keys; member in struct:ikev2_initiator_data
/external/wpa_supplicant_8/hs20/server/www/
H A Dest.php17 $keys = implode('|', array_keys($needed)); variable
18 preg_match_all('@(' . $keys . ')=(?:([\'"])([^\2]+?)\2|([^\s,]+))@',
/external/wpa_supplicant_8/src/eap_common/
H A Deap_fast_common.c99 struct tls_keys keys; local
117 if (tls_connection_get_keys(ssl_ctx, conn, &keys))
120 rnd = os_malloc(keys.client_random_len + keys.server_random_len);
124 os_memcpy(rnd, keys.server_random, keys.server_random_len);
125 os_memcpy(rnd + keys.server_random_len, keys.client_random,
126 keys.client_random_len);
129 "expansion", keys
[all...]
/external/wpa_supplicant_8/src/eap_server/
H A Dikev2.h35 struct ikev2_keys keys; member in struct:ikev2_initiator_data
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/
H A Deap_fast_common.c99 struct tls_keys keys; local
117 if (tls_connection_get_keys(ssl_ctx, conn, &keys))
120 rnd = os_malloc(keys.client_random_len + keys.server_random_len);
124 os_memcpy(rnd, keys.server_random, keys.server_random_len);
125 os_memcpy(rnd + keys.server_random_len, keys.client_random,
126 keys.client_random_len);
129 "expansion", keys
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/eap_server/
H A Dikev2.h35 struct ikev2_keys keys; member in struct:ikev2_initiator_data
/external/apache-http/src/org/apache/commons/logging/impl/
H A DWeakHashtable.java26 * 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.
129 /* ReferenceQueue we check for gc'd keys */
190 public Enumeration keys() { method in class:WeakHashtable
192 final Enumeration enumer = super.keys();
228 throw new NullPointerException("Null keys are not allowed");
322 * Purges all entries whose wrapped keys
451 // existing keys, normal hashtable operations should never
/external/apache-xml/src/main/java/org/apache/xalan/templates/
H A DElemForEach.java286 * @param keys Vector of sort keyx
294 XPathContext xctxt, Vector keys, DTMIterator sourceNodes)
305 sorter.sort(sourceNodes, keys, xctxt);
336 final Vector keys = (m_sortElems == null)
341 if (null != keys)
342 sourceNodes = sortNodes(xctxt, keys, sourceNodes);
293 sortNodes( XPathContext xctxt, Vector keys, DTMIterator sourceNodes) argument

Completed in 7520 milliseconds

1234567891011>>