HomeSort by relevance Sort by last modified time
    Searched defs:keys (Results 151 - 175 of 658) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jcajce/provider/symmetric/util/
BaseMac.java 285 Iterator keys = paramsMap.keySet().iterator(); local
286 while (keys.hasNext())
288 Object key = keys.next();
  /external/clang/utils/analyzer/
CmpRuns.py 109 def keys(self): member in class:multidict
110 return self.data.keys()
  /external/cldr/tools/java/org/unicode/cldr/tool/
GenerateBcp47Text.java 43 Set<String> keys = extensionAndKeys.getValue(); local
44 for (String key : keys) {
49 if (!keys.contains(key)) {
  /external/emma/core/java12/com/vladium/util/
IntIntMap.java 146 public int [] keys () method in class:IntIntMap
262 * The structure used for chaining colliding keys.
323 private int m_size; // number of keys in the table, not cleared as of last check
IntObjectMap.java 125 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
ObjectIntMap.java 136 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/fonttools/Lib/fontTools/misc/
macRes.py 123 def keys(self): member in class:ResourceReader
124 return self._resources.keys()
128 return list(self._resources.keys())
  /external/grpc-grpc/tools/codegen/core/
gen_static_metadata.py 59 # channel arg keys
545 def perfect_hash(keys, name):
546 p = perfection.hash_parameters(keys)
587 keys = [0] * int(elem_hash['PHASHRANGE']) variable
591 assert keys[h] == 0
592 keys[h] = k
595 '%d' % k for k in keys)
  /external/grpc-grpc-java/context/src/main/java/io/grpc/
PersistentHashArrayMappedTrie.java 121 // All keys must have same hash, but not have the same reference
122 private final K[] keys; field in class:PersistentHashArrayMappedTrie.CollisionLeaf
134 private CollisionLeaf(K[] keys, V[] values) {
135 this.keys = keys;
146 for (int i = 0; i < keys.length; i++) {
147 if (keys[i] == key) {
156 int thisHash = keys[0].hashCode();
164 K[] newKeys = Arrays.copyOf(keys, keys.length)
    [all...]
  /external/grpc-grpc-java/core/src/main/java/io/grpc/
Attributes.java 57 * Returns set of keys stored in container.
65 public Set<Key<?>> keys() { method in class:Attributes
  /external/guava/guava-tests/benchmark/com/google/common/collect/
BinaryTreeTraverserBenchmark.java 86 int[] keys = new int[size]; local
88 keys[i] = rng.nextInt();
90 return createTreap(Ints.asList(keys));
94 private Optional<BinaryNode> createTreap(List<Integer> keys) {
95 if (keys.isEmpty()) {
99 for (int i = 1; i < keys.size(); i++) {
100 if (keys.get(i) < keys.get(minIndex)) {
104 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex));
105 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size()))
    [all...]
  /external/guice/core/test/com/google/inject/
GenericInjectionTest.java 171 assertEquals(ImmutableSet.of("one", "two"), parameterizedDeps.keys);
177 SubParameterizedDeps(Set<A> keys) {
178 super(keys);
184 private Set<K> keys; field in class:GenericInjectionTest.ParameterizedDeps
188 ParameterizedDeps(Set<K> keys) {
189 this.keys = keys;
  /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/charsetdet/sbcs/
NGramList.java 130 public Collection keys() method in class:NGramList
  /external/iproute2/tc/
m_pedit.h 62 struct tc_pedit_key keys[MAX_OFFS]; member in struct:m_pedit_sel
  /external/jemalloc_new/test/unit/
rtree.c 124 uintptr_t keys[] = {PAGE, PAGE + 1, local
136 for (unsigned i = 0; i < sizeof(keys)/sizeof(uintptr_t); i++) {
137 assert_false(rtree_write(tsdn, rtree, &rtree_ctx, keys[i],
140 for (unsigned j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) {
142 keys[j], true), &extent,
146 j, keys[i], keys[j]); local
151 rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
163 uintptr_t keys[NSET]; local
175 keys[i] = (uintptr_t)gen_rand64(sfmt)
    [all...]
  /external/ksoap2/ksoap2-j2se/src/main/java/org/ksoap2/transport/
HttpsServiceConnectionSE.java 98 Set keys = properties.keySet(); local
101 for (Iterator i = keys.iterator(); i.hasNext(); ) {
ServiceConnectionSE.java 90 Set keys = properties.keySet(); local
91 for (Iterator i = keys.iterator(); i.hasNext(); ) {
  /external/libchrome/mojo/public/cpp/bindings/tests/
data_view_unittest.cc 256 ASSERT_FALSE(map_data_view.keys().is_null());
257 ASSERT_EQ(2u, map_data_view.keys().size());
262 std::vector<std::string> keys; local
263 ASSERT_TRUE(map_data_view.ReadKeys(&keys));
269 map[keys[i]] = values[i];
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
Amf0Track.java 70 LinkedList<Long> keys = new LinkedList<Long>(rawSamples.keySet()); local
71 Collections.sort(keys);
73 for (Long key : keys) {
  /external/openssh/
authfd.h 22 struct sshkey **keys; member in struct:ssh_identitylist
ssh-keysign.c 175 struct sshkey *keys[NUM_KEYTYPES], *key = NULL; local
239 keys[i] = NULL;
248 keys[i] = key;
281 if (keys[i] != NULL &&
282 sshkey_equal_public(key, keys[i])) {
295 if ((r = sshkey_sign(keys[i], &signature, &slen, data, dlen, NULL, 0))
  /external/protobuf/javanano/src/main/java/com/google/protobuf/nano/
FieldArray.java 99 int[] keys = mFieldNumbers; local
107 keys[o] = keys[i];
  /external/python/cpython2/Demo/pdist/
cvslib.py 226 list = self.entries.keys()
259 def keys(self): member in class:CVS
260 keys = self.entries.keys()
261 keys.sort()
262 return keys
267 return map(value, self.keys())
272 return map(item, self.keys())
  /external/python/cpython2/Lib/bsddb/
__init__.py 117 # since we're only returning keys, we call the cursor
301 def keys(self): member in class:_DBWithCursor
303 return _DeadlockWrap(self.db.keys)
  /external/python/cpython2/Lib/test/
test_userdict.py 94 # Test keys, items, values
95 self.assertEqual(u2.keys(), d2.keys())
100 for i in u2.keys():
121 for i in u2.keys():
132 keys = u2.keys()
133 self.assertEqual(set(ikeys), set(keys))
199 self.assertNotIn(2, d.keys())
269 def keys(self) member in class:SeqDict
    [all...]

Completed in 3405 milliseconds

1 2 3 4 5 67 8 91011>>