Searched defs:keys (Results 76 - 100 of 471) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/simplejson/
H A Dordered_dict.py85 def keys(self): member in class:OrderedDict
/external/chromium_org/third_party/skia/tests/
H A DDynamicHashTest.cpp158 // should see all 3 unique keys when iterating over hash
160 int keys[3] = {0, 0, 0}; local
163 keys[count] = key;
168 ASSERT(keys[0] != keys[1]);
169 ASSERT(keys[0] != keys[2]);
170 ASSERT(keys[1] != keys[2]);
172 // should see 2 unique keys whe
[all...]
/external/chromium_org/v8/test/cctest/
H A Dtest-weakmaps.cc216 // Test that weak map keys on an evacuation candidate which are reachable by
233 // Start second old-space page so that keys land on evacuation candidate.
237 // Fill up weak map with keys on an evacuation candidate.
238 Handle<JSObject> keys[32]; local
240 keys[i] = factory->NewJSObject(function, TENURED);
241 CHECK(!heap->InNewSpace(keys[i]->address()));
242 CHECK(!first_page->Contains(keys[i]->address()));
247 keys[i],
H A Dtest-weaksets.cc216 // Test that weak set keys on an evacuation candidate which are reachable by
233 // Start second old-space page so that keys land on evacuation candidate.
237 // Fill up weak set with keys on an evacuation candidate.
238 Handle<JSObject> keys[32]; local
240 keys[i] = factory->NewJSObject(function, TENURED);
241 CHECK(!heap->InNewSpace(keys[i]->address()));
242 CHECK(!first_page->Contains(keys[i]->address()));
247 keys[i],
/external/emma/core/java12/com/vladium/util/
H A DIntObjectMap.java125 public int [] keys () method in class:IntObjectMap
220 * The structure used for chaining colliding keys.
281 private int m_size; // number of keys in the table, not cleared as of last check
H A DObjectIntMap.java136 public Object [] keys () method in class:ObjectIntMap
258 * The structure used for chaining colliding keys.
319 private int m_size; // number of keys in the table, not cleared as of last check
/external/guava/guava/src/com/google/common/cache/
H A DCache.java33 * A semi-persistent mapping from keys to values. Cache entries are manually added using
81 * Returns a map of the values associated with {@code keys} in this cache. The returned map will
86 ImmutableMap<K, V> getAllPresent(Iterable<? extends K> keys); argument
105 * Discards any cached values for keys {@code keys}.
109 void invalidateAll(Iterable<?> keys); argument
H A DCacheLoader.java80 * Computes or retrieves the values corresponding to {@code keys}. This method is called by
83 * <p>If the returned map doesn't contain all requested {@code keys} then the entries it does
85 * contains extra keys not present in {@code keys} then all returned entries will be cached,
86 * but only the entries for {@code keys} will be returned from {@code getAll}.
92 * @param keys the unique, non-null keys whose values should be loaded
93 * @return a map from each key in {@code keys} to the value associated with that key;
97 public Map<K, V> loadAll(Iterable<? extends K> keys) throws Exception { argument
H A DForwardingCache.java68 public ImmutableMap<K, V> getAllPresent(Iterable<? extends K> keys) { argument
69 return delegate().getAllPresent(keys);
89 public void invalidateAll(Iterable<?> keys) { argument
90 delegate().invalidateAll(keys);
/external/guava/guava-gwt/src-super/java/util/super/java/util/concurrent/
H A DConcurrentHashMap.java141 public Enumeration<K> keys() { method in class:ConcurrentHashMap
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSampleElements.java66 SampleElements<K> keys, SampleElements<V> values) {
68 Helpers.mapEntry(keys.e0, values.e0),
69 Helpers.mapEntry(keys.e1, values.e1),
70 Helpers.mapEntry(keys.e2, values.e2),
71 Helpers.mapEntry(keys.e3, values.e3),
72 Helpers.mapEntry(keys.e4, values.e4));
65 mapEntries( SampleElements<K> keys, SampleElements<V> values) argument
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheEvictionTest.java288 private void getAll(LoadingCache<Integer, Integer> cache, List<Integer> keys) { argument
289 for (int i : keys) {
/external/guava/guava-tests/test/com/google/common/collect/
H A DConcurrentHashMultisetBasherTest.java70 ImmutableList<String> keys = ImmutableList.of("a", "b", "c");
74 futures.add(pool.submit(new MutateTask(multiset, keys)));
85 List<Integer> actualCounts = Lists.transform(keys,
104 private final ImmutableList<String> keys; field in class:ConcurrentHashMultisetBasherTest.MutateTask
107 private MutateTask(ConcurrentHashMultiset<String> multiset, ImmutableList<String> keys) { argument
109 this.keys = keys;
114 int nKeys = keys.size();
119 String key = keys.get(keyIndex);
/external/icu/icu4c/source/samples/legacy/
H A Dnewcol.cpp68 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]) { argument
77 keySize = getSortKey_current("ja", data[i], -1, keys[i], 32);
H A Doldcol.cpp84 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[4][32]) { argument
94 keySize = getSortKey_legacy("ja", data[i], -1, keys[i], 32);
/external/markdown/markdown/
H A Dodict.py3 A dictionary that keeps its keys in the order in which they're inserted.
18 self.keyOrder = data.keys()
64 def keys(self): member in class:OrderedDict
109 Replace the normal dict.__repr__ with a version that returns the keys
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/
H A DDummyMap.java14 HashSet<K> keys = new HashSet<K>(); field in class:DummyMap
25 public void addKeys(K[] keys) { argument
26 Collections.addAll(this.keys, keys);
31 return keys.size();
35 return keys.isEmpty();
39 return keys.contains(key);
47 return keys.contains(key) ? value : null;
52 keys.add(key);
58 keys
[all...]
/external/openfst/src/include/fst/extensions/far/
H A Dextract.h68 const string &keys,
82 if (!keys.empty()) {
83 char *keys_cstr = new char[keys.size()+1];
84 strcpy(keys_cstr, keys.c_str());
66 FarExtract(const vector<string> &ifilenames, const int32 &generate_filenames, const string &keys, const string &key_separator, const string &range_delimiter, const string &filename_prefix, const string &filename_suffix) argument
/external/qemu/android/utils/
H A Dintmap.c20 * One array for the integer keys, and the other one
31 int* keys; member in struct:AIntMap
47 map->keys = map->keys0;
57 if (map->keys != map->keys0)
58 AFREE(map->keys);
85 int* keys = map->keys; local
89 if (keys[index] == key)
101 void* keys = map->keys; local
128 int* keys; local
161 int* keys; local
[all...]
/external/qemu/scripts/
H A Dordereddict.py89 def keys(self): member in class:OrderedDict
/external/wpa_supplicant_8/hostapd/src/eap_common/
H A Deap_ikev2_common.c18 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys, argument
27 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL)
37 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen,
68 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys, argument
75 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar;
96 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len,
/external/wpa_supplicant_8/src/eap_common/
H A Deap_ikev2_common.c18 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys, argument
27 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL)
37 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen,
68 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys, argument
75 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar;
96 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len,
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/
H A Deap_ikev2_common.c18 int eap_ikev2_derive_keymat(int prf, struct ikev2_keys *keys, argument
27 if (keys->SK_d == NULL || i_nonce == NULL || r_nonce == NULL)
37 if (ikev2_prf_plus(prf, keys->SK_d, keys->SK_d_len, nonces, nlen,
68 int eap_ikev2_validate_icv(int integ_alg, struct ikev2_keys *keys, argument
75 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar;
96 if (ikev2_integ_hash(integ_alg, SK_a, keys->SK_integ_len,
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/
H A DSignature2Test.java33 static KeyPair keys; field in class:Signature2Test
39 keys = keyGen.generateKeyPair();
123 Signature.getInstance("DSA").initSign(keys.getPrivate());
130 Signature.getInstance("DSA").initVerify(keys.getPublic());
172 sig.initSign(keys.getPrivate());
190 sig.initSign(keys.getPrivate());
201 sig.initSign(keys.getPrivate());
212 sig.initSign(keys.getPrivate());
222 sig.initSign(keys.getPrivate());
227 sig.initVerify(keys
[all...]
/external/chromium_org/base/debug/
H A Dcrash_logging.cc54 DCHECK(crash_key) << "All crash keys must be registered before use "
72 // Set the chunked keys.
140 size_t InitCrashKeys(const CrashKey* const keys, size_t count, argument
143 if (!keys) {
154 g_crash_keys_->insert(std::make_pair(keys[i].key_name, keys[i]));
155 total_keys += NumChunksForLength(keys[i].max_length);
156 DCHECK_LT(keys[i].max_length, kLargestValueAllowed);
159 << "Duplicate crash keys were registered";

Completed in 311 milliseconds

1234567891011>>