HomeSort by relevance Sort by last modified time
    Searched defs:keys (Results 76 - 100 of 1239) sorted by null

1 2 34 5 6 7 8 91011>>

  /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 34 Enumeration keys = paramsMap.keys(); local
35 while (keys.hasMoreElements())
37 Object key = keys.nextElement();
  /external/chromium-trace/trace-viewer/third_party/Paste/paste/
urlmap.py 82 The dictionary keys are URLs to match (like
195 def keys(self): member in class:URLMap
  /external/chromium-trace/trace-viewer/third_party/WebOb/webob/
headers.py 13 Keys are normalized for case and whitespace.
129 request object, representing the CGI-style HTTP_* keys as a
147 def keys(self): member in class:EnvironHeaders
154 return len(list(self.keys()))
157 for k in self.keys():
  /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
128 * keys.
148 * as keys in a {@code Multimap}.
170 * keys</i> in the multimap, which is given by {@code keySet().size()} or
297 * Returns a view collection of all <i>distinct</i> keys contained in this
309 * the same size as this multimap, and {@code keys().count(k) ==
316 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 ASSERT.that(keys).has().allOf(sampleKeys().e0, sampleKeys().e1);
54 ASSERT.that(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/icu4c/source/test/perf/unisetperf/draft/
bitset.cpp 32 int64_t keys[0x800]; // 2k member in struct:BMPBitHash
45 * Map at most 1k=0x400 different keys with this data structure.
57 keys[hash]=key;
60 } else if(keys[hash]==key) {
73 * Invert the hash map: Fill an array of length countKeys() with the keys
80 k[i]=keys[reverse[i]];
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
CalendarCache.java 22 keys = new long[newSize];
50 keys[index] = key;
59 while (values[index] != EMPTY && keys[index] != key)
72 long[] oldKeys = keys;
119 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 |
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/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/marisa-trie/tests/
trie-test.cc 34 std::vector<std::string> *keys)
35 : key_ids_(key_ids), keys_(keys) {}
63 std::vector<std::string> keys; local
64 trie.build(keys);
69 keys.push_back("apple");
70 keys.push_back("and");
71 keys.push_back("Bad");
72 keys.push_back("apple");
73 keys.push_back("app");
76 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_LABEL_ORDER)
184 std::vector<std::string> keys; local
409 std::vector<std::string> keys; local
511 std::vector<std::string> keys; local
575 std::vector<std::string> keys; local
    [all...]
  /external/marisa-trie/tools/
marisa-build.cc 40 void read_keys(std::istream *input, std::vector<Key> *keys) {
57 keys->push_back(key);
62 std::vector<Key> keys; local
64 read_keys(&std::cin, &keys);
74 read_keys(&input_file, &keys);
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
  /external/marisa-trie/v0_1_5/tests/
trie-test.cc 34 std::vector<std::string> *keys)
35 : key_ids_(key_ids), keys_(keys) {}
63 std::vector<std::string> keys; local
64 trie.build(keys);
69 keys.push_back("apple");
70 keys.push_back("and");
71 keys.push_back("Bad");
72 keys.push_back("apple");
73 keys.push_back("app");
76 trie.build(keys, &key_ids
186 std::vector<std::string> keys; local
427 std::vector<std::string> keys; local
529 std::vector<std::string> keys; local
593 std::vector<std::string> keys; local
    [all...]
  /external/marisa-trie/v0_1_5/tools/
marisa_alpha-build.cc 40 void read_keys(std::istream *input, std::vector<Key> *keys) {
57 keys->push_back(key);
62 std::vector<Key> keys; local
64 read_keys(&std::cin, &keys);
74 read_keys(&input_file, &keys);
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
  /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
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/matchers/
StartedServiceMatcher.java 40 * Check if the class of the intent and the keys of the intent's extras match
70 // Test that both intent extras have the same keys
71 Set<String> keys = shadowIntent.getExtras().keySet(); local
73 intentsMatch = keys.equals(expectedKeys);
75 message += "did not get the same extras keys";
  /external/v8/test/cctest/
test-weakmaps.cc 216 // 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],
test-weaksets.cc 216 // 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],
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/channels/spi/
MockAbstractSelector.java 65 public Set<SelectionKey> keys() { method in class:MockAbstractSelector
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
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()

Completed in 496 milliseconds

1 2 34 5 6 7 8 91011>>