| /external/guava/guava-gwt/src-super/java/util/super/java/util/concurrent/ |
| ConcurrentHashMap.java | 141 public Enumeration<K> keys() { method in class:ConcurrentHashMap
|
| /external/iproute2/include/linux/tc_act/ |
| tc_pedit.h | 30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /external/kernel-headers/original/uapi/linux/tc_act/ |
| tc_pedit.h | 30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /external/ltrace/ |
| dict.h | 29 /* The invariant is that KEYS, VALUES and STATUS are of the
31 struct vect keys; member in struct:dict
41 /* Initialize a dictionary DICT. The dictionary will hold keys of the
45 * EQ is a callback for comparing two keys. */
53 * will hold keys of type KEY_TYPE and values of type VALUE_TYPE.
70 * cloning fails for any reason, already-cloned keys and values are
88 assert(_source_d->keys.elt_size == sizeof(KEY_TYPE)); \
122 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))), \
133 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))), \
140 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))),
[all...] |
| /external/marisa-trie/tools/ |
| marisa-predict.cc | 23 " -d, --depth-first predict keys in depth first order(default)\n"
24 " -b, --breadth-first predict keys in breadth first order\n"
63 std::vector<std::string> keys; local
70 keys.clear();
74 str, &key_ids, &keys, max_num_results);
77 str, &key_ids, &keys, max_num_results);
81 << ": failed to predict keys from: " << str << std::endl;
85 std::cout << key_ids[i] << '\t' << keys[i] << '\t' << str << '\n';
|
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-predict.cc | 23 " -d, --depth-first predict keys in depth first order(default)\n"
24 " -b, --breadth-first predict keys in breadth first order\n"
63 std::vector<std::string> keys; local
70 keys.clear();
74 str, &key_ids, &keys, max_num_results);
77 str, &key_ids, &keys, max_num_results);
81 << ": failed to predict keys from: " << str << std::endl;
85 std::cout << key_ids[i] << '\t' << keys[i] << '\t' << str << '\n';
|
| /external/skia/platform_tools/android/gyp_gen/ |
| vars_dict_lib.py | 103 Can also be treated as a dictionary with fixed keys.
115 def keys(self): member in class:VarsDict
151 for key in var_dict_a.keys():
|
| /external/skia/tests/ |
| DynamicHashTest.cpp | 158 // 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 when iterating over hash that aren't
[all...] |
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/ |
| BuilderMapEntryCollection.java | 41 @Nonnull private final Collection<Key> keys; field in class:BuilderMapEntryCollection
43 public BuilderMapEntryCollection(@Nonnull Collection<Key> keys) {
44 this.keys = keys;
64 final Iterator<Key> iter = keys.iterator();
84 return keys.size();
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| IdentityCache.java | 73 public synchronized ArrayList<K> keys() { method in class:IdentityCache
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/tc_act/ |
| tc_pedit.h | 33 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/tc_act/ |
| tc_pedit.h | 30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-arm/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-arm64/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-mips/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-mips64/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86_64/usr/include/linux/tc_act/ |
| tc_pedit.h | 49 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
| Signature2Test.java | 33 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.getPublic())
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| PopulatedCachesTest.java | 51 // we use integers as keys; make sure the range covers some values that ARE cached by
195 Set<Object> keys = cache.asMap().keySet(); local
199 ASSERT.that(keys).has().exactlyAs(expected);
200 ASSERT.that(keys.toArray()).has().exactlyAs(expected);
201 ASSERT.that(keys.toArray(new Object[0])).has().exactlyAs(expected);
204 .addEqualityGroup(cache.asMap().keySet(), keys)
207 assertEquals(WARMUP_SIZE, keys.size());
210 assertTrue(keys.contains(key));
211 assertTrue(keys.remove(key));
212 assertFalse(keys.remove(key))
[all...] |
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
| ZHash.java | 147 * @return Ordered list of keys.
149 public List<KeyType> keys() {
method in class:ZHash
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ACBTree.h | 44 __strong ACBKey **keys; /* pointer to keys */ variable
62 @property (assign) ACBKey **keys; variable
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/ |
| AlgorithmParameterGenerator_ImplTest.java | 83 int[] keys = { -10000, -512, -1, 0, 10000 }; local
92 for (int j = 0; j < keys.length; j++) {
94 apgs[i].init(keys[j]);
96 + keys[j]);
101 apgs[i].init(keys[j], random);
103 + keys[j]);
108 apgs[i].init(keys[j], null);
110 + keys[j]);
|
| /external/apache-http/src/org/apache/commons/logging/impl/ |
| WeakHashtable.java | 26 * 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/transformer/ |
| KeyIterator.java | 105 Vector keys = ki.getKeyDeclarations(); local
111 int nDeclarations = keys.size();
116 KeyDeclaration kd = (KeyDeclaration) keys.elementAt(i);
|
