| /external/protobuf/python/google/protobuf/internal/ |
| enum_type_wrapper.py | 65 def keys(self): member in class:EnumTypeWrapper
|
| /external/python/cpython2/Demo/classes/ |
| Dbm.py | 1 # A wrapper around the (optional) built-in class dbm, supporting keys
3 # (Actually, this works only for keys and values that can be read back
15 for key in self.keys():
33 def keys(self): member in class:Dbm
35 for key in self.db.keys():
|
| /external/snakeyaml/src/test/java/examples/ |
| CustomMapExampleTest.java | 33 Object[] keys = data.keySet().toArray(); local
35 assertEquals(new Integer(1), keys[0]);
36 assertEquals(new Integer(2), keys[1]);
37 assertEquals(new Integer(3), keys[2]);
|
| /libcore/ojluni/src/main/java/java/util/ |
| Dictionary.java | 30 * class, such as <code>Hashtable</code>, which maps keys to values.
37 * implementations of this class to decide if two keys are the same.
59 * Returns the number of entries (distinct keys) in this dictionary.
61 * @return the number of keys in this dictionary.
66 * Tests if this dictionary maps no keys to value. The general contract
70 * @return <code>true</code> if this dictionary maps no keys to values;
76 * Returns an enumeration of the keys in this dictionary. The general
77 * contract for the keys method is that an <tt>Enumeration</tt> object
78 * is returned that will generate all the keys for which this dictionary
81 * @return an enumeration of the keys in this dictionary
85 abstract public Enumeration<K> keys(); method in class:Dictionary
[all...] |
| /packages/apps/Settings/tests/robotests/src/com/android/settings/security/ |
| LockscreenDashboardFragmentTest.java | 39 List<String> keys = XmlTestUtils.getKeysFromPreferenceXml(RuntimeEnvironment.application, local
42 assertThat(keys).containsAllOf(LockscreenDashboardFragment.KEY_LOCK_SCREEN_NOTIFICATON,
|
| /external/annotation-tools/asmx/src/org/objectweb/asm/tree/ |
| LookupSwitchInsnNode.java | 53 * The values of the keys. This list is a list of {@link Integer} objects.
55 public List keys; field in class:LookupSwitchInsnNode
67 * @param keys the values of the keys.
69 * the beginning of the handler block for the <tt>keys[i]</tt> key.
73 final int[] keys,
78 this.keys = new ArrayList(keys == null ? 0 : keys.length);
80 if (keys != null)
91 int[] keys = new int[this.keys.size()]; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| EmptyCachesTest.java | 118 Set<Object> keys = cache.asMap().keySet(); local
120 keys.toArray(null);
151 Set<Object> keys = cache.asMap().keySet(); local
152 keys.clear();
153 checkEmpty(keys);
160 Set<Object> keys = cache.asMap().keySet(); local
161 assertFalse(keys.remove(null));
162 assertFalse(keys.remove(6));
163 assertFalse(keys.remove(-6));
164 assertFalse(keys.removeAll(asList(null, 0, 15, 1500)))
176 Set<Object> keys = cache.asMap().keySet(); local
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/ |
| DummyMap.java | 14 HashSet<K> keys = new HashSet<K>(); field in class:DummyMap
25 public void addKeys(K[] keys) {
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.remove(key)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/util/ |
| LongSparseLongArrayTest.java | 108 final Iterator<E> keys = map.keySet().iterator(); local
110 keys.next();
112 return keys.next();
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| ListResourceBundleTest.java | 35 Enumeration<String> keys = bundle.getKeys(); local
37 while (keys.hasMoreElements()) {
38 result.addElement(keys.nextElement());
54 Enumeration keys = bundle.getKeys(); local
57 while (keys.hasMoreElements()) {
58 result.addElement(bundle.handleGetObject((String)keys.nextElement()));
|
| /libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
| SystemScope.java | 49 private Hashtable keys = new Hashtable(); field in class:SystemScope
96 return (Identity) keys.get(key);
113 if (key != null && keys.containsKey(key)) {
119 keys.put(key, identity);
145 contains = contains || keys.containsKey(key);
146 keys.remove(key);
|
| /dalvik/dx/src/com/android/dx/io/instructions/ |
| SparseSwitchPayloadDecodedInstruction.java | 26 private final int[] keys; field in class:SparseSwitchPayloadDecodedInstruction
38 int opcode, int[] keys, int[] targets) {
41 if (keys.length != targets.length) {
42 throw new IllegalArgumentException("keys/targets length mismatch");
45 this.keys = keys;
56 return keys;
|
| /external/annotation-tools/asmx/src/org/objectweb/asm/tree/analysis/ |
| IntMap.java | 41 private Object[] keys; field in class:IntMap
47 this.keys = new Object[size];
55 while (keys[i] != key) {
67 while (keys[i] != null) {
70 keys[i] = key;
|
| /external/autotest/client/tools/ |
| html_report.py | 1528 keys = metadata.keys() variable
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestMapEntrySetGenerator.java | 26 * Creates map entries using sample keys and sample values.
33 private final SampleElements<K> keys; field in class:TestMapEntrySetGenerator
37 SampleElements<K> keys, SampleElements<V> values) {
38 this.keys = keys;
44 return SampleElements.mapEntries(keys, values);
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListMultimapAsMapTester.java | 60 List<K> keys = new ArrayList<K>(multimap().keySet()); local
61 for (K key : keys) {
|
| SetMultimapAsMapTester.java | 60 List<K> keys = new ArrayList<K>(multimap().keySet()); local
61 for (K key : keys) {
|
| SortedSetMultimapAsMapTester.java | 54 List<K> keys = new ArrayList<K>(multimap().keySet()); local
55 for (K key : keys) {
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| ConcurrentHashMultisetBenchmark.java | 55 private ImmutableList<Integer> keys; field in class:ConcurrentHashMultisetBenchmark
64 keys = builder.build();
103 int nKeys = keys.size();
106 Integer key = keys.get(random.nextInt(nKeys));
116 int nKeys = keys.size();
119 Integer key = keys.get(random.nextInt(nKeys));
|
| /external/jemalloc/test/unit/ |
| rtree.c | 62 uintptr_t keys[] = {0, 1, local
70 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) {
71 assert_false(rtree_set(&rtree, keys[j], &node),
73 for (k = 0; k < sizeof(keys)/sizeof(uintptr_t); k++) {
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true),
79 j, k, keys[j], keys[k]); local
85 assert_false(rtree_set(&rtree, keys[j], NULL),
103 uintptr_t keys[NSET]; local
112 keys[j] = (uintptr_t)gen_rand64(sfmt)
[all...] |
| /external/libbrillo/brillo/ |
| map_utils.h | 15 // Given an STL map, returns a set containing all keys from the map.
18 std::set<typename T::key_type> keys; local
20 keys.insert(keys.end(), pair.first); // Map keys are already sorted.
21 return keys;
24 // Given an STL map, returns a vector containing all keys from the map.
25 // The keys in the vector are sorted.
28 std::vector<typename T::key_type> keys; local
29 keys.reserve(map.size())
[all...] |
| /external/libmojo/mojo/public/cpp/bindings/ |
| map_data_view.h | 25 : keys_(data ? data->keys.Get() : nullptr, context),
38 ArrayDataView<K>& keys() { return keys_; } function in class:mojo::MapDataView
39 const ArrayDataView<K>& keys() const { return keys_; } function in class:mojo::MapDataView
|
| /external/libxkbcommon/xkbcommon/bench/ |
| key-proc.c | 34 int8_t keys[256] = { 0 }; local
41 if (keys[keycode]) {
43 keys[keycode] = 0;
48 keys[keycode] = 1;
|
| /external/pdfium/core/fpdfdoc/ |
| cpdf_filespec_unittest.cpp | 186 const char* const keys[] = {"Unix", "Mac", "DOS", "F", "UF"}; local
188 static_assert(FX_ArraySize(keys) == FX_ArraySize(streams), "size mismatch");
192 // Keys in reverse order of precedence to retrieve the file content stream.
193 for (size_t i = 0; i < FX_ArraySize(keys); ++i) {
195 dict_obj->SetNewFor<CPDF_String>(keys[i], file_name);
202 file_dict->SetNewFor<CPDF_Stream>(keys[i], std::move(buf), buf_len,
|
| /external/ply/ply/example/BASIC/ |
| basiclog.py | 58 keys = list(prog) variable
59 if keys[0] > 0:
62 stat = prog[keys[0]]
|
