| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| UserDict.py | 39 def keys(self): return self.data.keys()
member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| UserDict.py | 39 def keys(self): return self.data.keys()
member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| dumbdbm.py | 58 # file, and holds the values associated with keys. Each value
65 self._index = None # maps keys to (pos, siz) pairs
164 raise TypeError, "keys and values must be strings"
198 def keys(self):
member in class:_Database
199 return self._index.keys()
|
| shelve.py | 4 with dbm databases is that the values (not the keys!) in a shelf can
7 types, and objects containing lots of shared sub-objects. The keys
24 list = d.keys() # a list of all existing keys (slow!)
80 __getitem__ = __setitem__ = __delitem__ = keys = closed
100 def keys(self):
member in class:Shelf
101 return self.dict.keys()
|
| /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-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);
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
| StringToIntTable.java | 25 * number strings being keys, and the odd number strings being values.
188 * Return array of keys in the table.
192 public final String[] keys() method in class:StringToIntTable
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| StringToIntTable.java | 25 * number strings being keys, and the odd number strings being values.
181 * Return array of keys in the table.
185 public final String[] keys() method in class:StringToIntTable
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/style/ |
| AbstractX500NameStyle.java | 35 Enumeration keys = paramsMap.keys(); local
36 while (keys.hasMoreElements())
38 Object key = keys.nextElement();
|
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
65 Set<String> keys = nodes.keySet(); local
66 if (keys.size() > 0) {
69 for (String n : keys) {
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| HTTP.java | 128 Iterator keys = o.keys(); local
149 while (keys.hasNext()) {
150 s = keys.next().toString();
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingMultimap.java | 87 public Multiset<K> keys() { method in class:ForwardingMultimap
88 return delegate().keys();
|
| Multimap.java | 29 * A collection that maps keys to values, similar to {@link Map}, but in which
31 * contents of a multimap either as a map from keys to <i>nonempty</i>
86 * <li>{@link #keys}, {@link #keySet}, {@link #values}, {@link #entries}, which
129 * keys.
149 * as keys in a {@code Multimap}.
171 * keys</i> in the multimap, which is given by {@code keySet().size()} or
298 * Returns a view collection of all <i>distinct</i> keys contained in this
310 * the same size as this multimap, and {@code keys().count(k) ==
317 Multiset<K> keys(); method in interface:Multimap
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultimapKeysTester.java | 49 Multiset<K> keys = multimap().keys(); local
50 assertEquals(2, keys.count(sampleKeys().e0));
51 assertEquals(1, keys.count(sampleKeys().e1));
52 assertEquals(3, keys.size());
53 assertThat(keys).has().allOf(sampleKeys().e0, sampleKeys().e1);
54 assertThat(keys.entrySet()).has().allOf(
61 assertEquals(0, multimap().keys().count(null));
71 Multiset<K> keys = multimap().keys(); local
94 Multiset<K> keys = multimap().keys(); local
[all...] |
| MultimapReplaceValuesTester.java | 109 List<K> keys = Helpers.copyToList(multimap().keySet()); local
113 for (K k : keys) {
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| CalendarCache.java | 26 keys = new long[newSize];
54 keys[index] = key;
63 while (values[index] != EMPTY && keys[index] != key)
76 long[] oldKeys = keys;
123 private long[] keys = new long[arraySize]; field in class:CalendarCache
|
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 36 int64_t keys[0x800]; // 2k member in struct:BMPBitHash
49 * Map at most 1k=0x400 different keys with this data structure.
61 keys[hash]=key;
64 } else if(keys[hash]==key) {
77 * Invert the hash map: Fill an array of length countKeys() with the keys
84 k[i]=keys[reverse[i]];
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| CalendarCache.java | 24 keys = new long[newSize];
52 keys[index] = key;
61 while (values[index] != EMPTY && keys[index] != key)
74 long[] oldKeys = keys;
121 private long[] keys = new long[arraySize]; field in class:CalendarCache
|
| /external/iproute2/tc/ |
| f_flow.c | 27 " [hashing mode]: hash keys KEY-LIST ... [ perturb SECS ]\n"
63 static int flow_parse_keys(__u32 *keys, __u32 *nkeys, char *argv)
68 *keys = 0;
78 *keys |= 1 << i;
98 static int get_addend(__u32 *addend, char *argv, __u32 keys)
112 if (keys & (FLOW_KEY_SRC | FLOW_KEY_DST |
139 __u32 keys = 0, nkeys = 0; local
158 } else if (matches(*argv, "keys") == 0) {
160 if (flow_parse_keys(&keys, &nkeys, *argv))
162 addattr32(n, 4096, TCA_FLOW_KEYS, keys);
[all...] |
| /external/libdrm/tests/ |
| drmsl.c | 63 unsigned long keys[1000000]; local
75 keys[i] = drmRandom(ranstate);
76 drmSLInsert(list, keys[i], NULL);
92 if (drmSLLookup(list, keys[i], &value))
93 printf("Error %lu %d\n", keys[i], i);
|
| /external/libvncserver/examples/ |
| vncev.c | 20 static char* keys[0x400]; variable
39 memset(keys,0,0x400*sizeof(char*));
56 if(keys[j&0x3ff]) {
57 char* x=(char*)malloc(1+strlen(keys[j&0x3ff])+1+strlen(buffer+strlen("#define ")));
58 strcpy(x,keys[j&0x3ff]);
61 free(keys[j&0x3ff]);
62 keys[j&0x3ff]=x;
64 keys[j&0x3ff] = strdup(buffer+strlen("#define "));
84 down?"down":"up",keys[k&0x3ff]?keys[k&0x3ff]:"",(unsigned int)k)
[all...] |
| /external/ltp/pan/ |
| symbol.c | 190 * add new keys for sub-trees until key list is exhausted;
196 const char **keys; /* key split into a 2d string array */ local
206 keys = splitstr(key, ",", NULL);
208 if (keys == NULL) {
213 for (kk = (char **)keys, csym = sym;
222 splitstr_free(keys);
227 splitstr_free(keys);
234 splitstr_free(keys);
255 splitstr_free(keys);
268 const char **keys; /* key split into a 2d string array * local
[all...] |
| /external/markdown/markdown/ |
| odict.py | 3 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
|
