| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| init_size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8)
55 assert(c.hash_function() == test_hash<std::hash<int> >(8));
67 test_hash<std::hash<int> >,
81 test_hash<std::hash<int> >(8)
89 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| init_size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
56 assert(c.hash_function() == test_hash<std::hash<int> >(8));
68 test_hash<std::hash<int> >,
82 test_hash<std::hash<int> >(8),
91 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| init_size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
57 assert(c.hash_function() == test_hash<std::hash<int> >(8));
69 test_hash<std::hash<int> >,
83 test_hash<std::hash<int> >(8),
93 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8)
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8)
94 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8),
59 assert(c.hash_function() == test_hash<std::hash<int> >(8));
71 test_hash<std::hash<int> >,
87 test_hash<std::hash<int> >(8),
96 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
35 test_hash<std::hash<int> >,
51 test_hash<std::hash<int> >(8),
61 assert(c.hash_function() == test_hash<std::hash<int> >(8));
73 test_hash<std::hash<int> >,
89 test_hash<std::hash<int> >(8),
99 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExpandedNameTable.java | 31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucket
187 int hash = type + namespace.hashCode() + localName.hashCode(); local
379 int hash; field in class:ExpandedNameTable.HashEntry
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| LocalCacheTest.java | 457 int hash = map.hash(key); local
460 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
513 int hash = map.hash(key); local
515 int index = hash & (table.length() - 1);
517 DummyEntry<Object, Object> entry = DummyEntry.create(key, hash, null);
542 int hash = map.hash(key); local
544 int index = hash & (table.length() - 1)
613 int hash = map.hash(one); local
750 int hash = map.hash(key); local
852 int hash = map.hash(one); local
1012 int hash = map.hash(key); local
1087 int hash = map.hash(key); local
1131 int hash = map.hash(key); local
1170 int hash = map.hash(key); local
1202 int hash = map.hash(key); local
1237 int hash = map.hash(key); local
1273 int hash = map.hash(key); local
1348 int hash = map.hash(key); local
1387 int hash = map.hash(key); local
1440 int hash = map.hash(key); local
1615 int hash = map.hash(key); local
1673 int hash = map.hash(key); local
1708 int hash = map.hash(key); local
1743 int hash = map.hash(key); local
1777 int hash = map.hash(key); local
1823 int hash = map.hash(key); local
1946 int hash = map.hash(key); local
1987 int hash = map.hash(key); local
2029 int hash = map.hash(key); local
2230 int hash = map.hash(key); local
2567 private final int hash; field in class:LocalCacheTest.DummyEntry
[all...] |
| /cts/apps/CtsVerifier/jni/audio_loopback/ |
| Android.mk | 25 LOCAL_LDFLAGS := -Wl,--hash-style=sysv
|
| /external/guava/guava-tests/benchmark/com/google/common/hash/ |
| HashFunctionBenchmark.java | 17 package com.google.common.hash;
22 import com.google.common.hash.HashFunction;
31 * <li>size: The length of the byte array to hash.
|
| /external/ipsec-tools/src/racoon/ |
| isakmp_newg.c | 75 struct isakmp_pl_hash *hash = NULL;
101 if (hash) {
109 hash = (struct isakmp_pl_hash *)pa->ptr;
137 if (!hash || !sa) {
140 "no HASH, or no SA payload.\n");
145 /* validate HASH */
151 plog(LLV_DEBUG, LOCATION, NULL, "validate HASH\n");
163 plog(LLV_DEBUG, LOCATION, NULL, "hash source\n");
171 plog(LLV_DEBUG, LOCATION, NULL, "hash result\n");
174 r_hash = (char *)hash + sizeof(*hash)
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/texture/ |
| TextureCubeMap.java | 182 int hash = super.hashCode(); local
183 hash = 53 * hash + (this.wrapS != null ? this.wrapS.hashCode() : 0);
184 hash = 53 * hash + (this.wrapT != null ? this.wrapT.hashCode() : 0);
185 hash = 53 * hash + (this.wrapR != null ? this.wrapR.hashCode() : 0);
186 return hash;
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| vector_bool.pass.cpp | 13 // struct hash
31 typedef std::hash<T> H;
43 typedef std::hash<T> H;
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| max_load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
46 typedef std::unordered_multiset<int, std::hash<int>,
53 typedef std::unordered_multiset<int, std::hash<int>,
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| max_load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
46 typedef std::unordered_set<int, std::hash<int>,
53 typedef std::unordered_set<int, std::hash<int>,
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| size.fail.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
30 test_hash<std::hash<NotConstructible> >,
36 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pt_vsplit.c | 89 unsigned hash; local
93 hash = fetch % MAP_SIZE;
95 if (vsplit->cache.fetches[hash] != fetch) {
97 vsplit->cache.fetches[hash] = fetch;
98 vsplit->cache.draws[hash] = vsplit->cache.num_fetch_elts;
105 vsplit->draw_elts[vsplit->cache.num_draw_elts++] = vsplit->cache.draws[hash];
118 unsigned hash = fetch % MAP_SIZE; local
119 vsplit->cache.fetches[hash] = fetch - 1; /* force update */
|
| /external/openssh/ |
| kexc25519c.c | 80 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
130 hashlen = sizeof(hash);
141 hash, &hashlen)) < 0)
144 if ((r = sshkey_verify(server_host_key, signature, slen, hash, hashlen,
156 memcpy(kex->session_id, hash, kex->session_id_len);
159 if ((r = kex_derive_keys(ssh, hash, hashlen, shared_secret)) == 0)
162 explicit_bzero(hash, sizeof(hash));
|
| kexc25519s.c | 64 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
110 hashlen = sizeof(hash);
121 hash, &hashlen)) < 0)
132 memcpy(kex->session_id, hash, kex->session_id_len);
137 &signature, &slen, hash, hashlen, ssh->compat)) < 0)
148 if ((r = kex_derive_keys(ssh, hash, hashlen, shared_secret)) == 0)
151 explicit_bzero(hash, sizeof(hash));
|
| kexecdhs.c | 73 u_char hash[SSH_DIGEST_MAX_LENGTH]; local
145 hashlen = sizeof(hash);
157 hash, &hashlen)) != 0)
168 memcpy(kex->session_id, hash, kex->session_id_len);
173 &signature, &slen, hash, hashlen, ssh->compat)) < 0)
187 if ((r = kex_derive_keys_bn(ssh, hash, hashlen, shared_secret)) == 0)
190 explicit_bzero(hash, sizeof(hash));
|
| /external/srtp/ |
| Android.mk | 14 crypto/hash/null_auth.c \
15 crypto/hash/sha1.c \
16 crypto/hash/hmac.c \
17 crypto/hash/auth.c \
|
| /frameworks/base/core/java/android/content/pm/ |
| VerificationParams.java | 175 int hash = 3; local
177 hash += 5 * (mVerificationURI == null ? 1 : mVerificationURI.hashCode());
178 hash += 7 * (mOriginatingURI == null ? 1 : mOriginatingURI.hashCode());
179 hash += 11 * (mReferrer == null ? 1 : mReferrer.hashCode());
180 hash += 13 * mOriginatingUid;
181 hash += 17 * (mManifestDigest == null ? 1 : mManifestDigest.hashCode());
182 hash += 19 * mInstallerUid;
184 return hash;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| vector_bool.pass.cpp | 13 // struct hash
31 typedef std::hash<T> H;
42 typedef std::hash<T> H;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| max_load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
46 typedef std::unordered_multiset<int, std::hash<int>,
53 typedef std::unordered_multiset<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| max_load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
46 typedef std::unordered_set<int, std::hash<int>,
53 typedef std::unordered_set<int, std::hash<int>,
|
