| /libcore/luni/src/main/java/java/util/ |
| LinkedHashMap.java | 105 * the initial capacity of this hash map.
154 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next,
156 super(key, value, hash, next);
177 * to the hash table (which is properly the province of our superclass).
182 * the resulting hash table corrupt.
184 @Override void addNewEntry(K key, V value, int hash, int index) {
196 key, value, hash, table[index], header, oldTail);
220 K key, V value, int hash, HashMapEntry<K, V> next) {
224 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail);
250 int hash = Collections.secondaryHash(key) local
[all...] |
| /art/compiler/driver/ |
| compiler_driver.h | 707 uint32_t hash = 0; local
719 hash ^= k;
720 hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
739 hash ^= k1;
742 hash ^= len;
743 hash ^= (hash >> 16);
744 hash *= 0x85ebca6b
751 size_t hash = 0x811c9dc5; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 182 // hashCode() and equals() for use with registerNode() and the nodes hash.
279 int hash=0x111111; local
281 hash=hash*37+value;
283 return hash;
359 public int hashCode() /*const*/ { return hash; }
488 hash=(0x333333*37+length)*37+next.hashCode();
490 hash=hash*37+value;
493 hash=hash*37+strings.charAt(i)
501 private int hash; field in class:StringTrieBuilder.LinearMatchNode
597 protected int hash; field in class:StringTrieBuilder.BranchNode
[all...] |
| /external/wpa_supplicant_8/src/eap_common/ |
| ikev2_common.c | 57 size_t data_len, u8 *hash)
66 os_memcpy(hash, tmphash, 12);
72 os_memcpy(hash, tmphash, 12);
97 u8 *hash)
101 hmac_sha1_vector(key, key_len, num_elem, addr, len, hash);
104 hmac_md5_vector(key, key_len, num_elem, addr, len, hash);
118 u8 hash[IKEV2_MAX_HASH_LEN]; local
131 addr[0] = hash;
145 &len[1], hash);
148 hash);
379 u8 *sign_data, *pos, *buf, hash[IKEV2_MAX_HASH_LEN]; local
437 u8 hash[IKEV2_MAX_HASH_LEN], *decrypted; local
[all...] |
| /frameworks/base/services/core/java/com/android/server/ |
| LockSettingsStorage.java | 82 CredentialHash(byte[] hash, int version) {
83 this.hash = hash;
88 CredentialHash(byte[] hash, boolean isBaseZeroPattern) {
89 this.hash = hash;
94 byte[] hash; field in class:LockSettingsStorage.CredentialHash
292 private void writeFile(String name, byte[] hash) {
296 // Write the hash to file
299 if (hash == null || hash.length == 0)
331 writeFile(getLockPatternFilename(userId), hash); local
343 writeFile(getLockPasswordFilename(userId), hash); local
[all...] |
| /art/runtime/base/ |
| hash_set.h | 53 // Low memory version of a hash set, uses less memory than std::unordered_set since elements aren't
58 template <class T, class EmptyFn = DefaultEmptyFn<T>, class HashFn = std::hash<T>,
312 Iterator FindWithHash(const K& element, size_t hash) {
313 return Iterator(this, FindIndex(element, hash));
317 ConstIterator FindWithHash(const K& element, size_t hash) const {
318 return ConstIterator(this, FindIndex(element, hash));
326 void InsertWithHash(const T& element, size_t hash) {
327 DCHECK_EQ(hash, hashfn_(element));
332 const size_t index = FirstAvailableSlot(IndexForHash(hash));
345 // To distance that inserted elements were probed. Used for measuring how good hash function
417 DCHECK_EQ(hashfn_(element), hash); local
[all...] |
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/textures/ |
| NoiseGenerator.java | 88 protected static short[] hash;
field in class:NoiseGenerator
113 hash = (short[]) ois.readObject();
582 NoiseMath.hash(i, j, k, p);
637 // instead of adding another permutation array, just use hash table defined above
649 A = hash[intX] + intY;
650 AA = hash[A] + intZ;
651 AB = hash[A + 1] + intZ;
652 B = hash[intX + 1] + intY;
653 BA = hash[B] + intZ;
654 BB = hash[B + 1] + intZ;
[all...] |
| /external/ipsec-tools/src/racoon/ |
| isakmp_quick.c | 146 * HDR*, HASH(1), SA, Ni [, KE ] [, IDi2, IDr2 ]
154 vchar_t *hash = NULL;
277 /* generate HASH(1) */
278 hash = oakley_compute_hash1(iph2->ph1, iph2->msgid, body);
279 if (hash == NULL)
283 iph2->sendbuf = quick_ir1mx(iph2, body, hash);
300 if (hash != NULL)
301 vfree(hash);
308 * HDR*, HASH(2), SA, Nr [, KE ] [, IDi2, IDr2 ]
316 vchar_t *hbuf = NULL; /* for hash computing. *
153 vchar_t *hash = NULL; local
319 struct isakmp_pl_hash *hash = NULL; local
558 vchar_t *hash = NULL; local
698 struct isakmp_pl_hash *hash = NULL; local
843 struct isakmp_pl_hash *hash = NULL; local
1187 vchar_t *hash = NULL; local
1390 struct isakmp_pl_hash *hash = NULL; local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimapNaturalTest.java | 151 Multimap<Double, Double> hash = HashMultimap.create(); local
152 hash.put(1.0, 2.0);
153 hash.put(2.0, 3.0);
154 hash.put(3.0, 4.0);
155 hash.put(4.0, 5.0);
157 TreeMultimap<Double, Double> copyFromHash = TreeMultimap.create(hash);
158 assertEquals(hash, copyFromHash);
|
| /external/wpa_supplicant_8/src/crypto/ |
| random.c | 102 u8 hash[SHA1_MAC_LEN]; local
106 /* First, add hash back to pool to make backtracking more difficult. */
108 sizeof(pool), hash);
109 random_mix_pool(hash, sizeof(hash));
110 /* Hash half the pool to extra data */
114 sizeof(buf), hash);
116 * Fold the hash to further reduce any potential output pattern.
120 hash_ptr = (u32 *) hash;
122 os_memcpy(out, hash, EXTRACT_LEN)
[all...] |
| /system/core/include/utils/ |
| LruCache.h | 128 hash_t hash = hash_type(key); local
129 ssize_t index = mTable->find(-1, hash, key);
145 hash_t hash = hash_type(key); local
146 ssize_t index = mTable->find(-1, hash, key);
156 index = mTable->add(hash, initEntry);
164 hash_t hash = hash_type(key); local
165 ssize_t index = mTable->find(-1, hash, key);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| MultivariateSummaryStatistics.java | 388 * Returns hash code based on values of statistics
390 * @return hash code
394 int result = 31 + MathUtils.hash(getGeometricMean());
395 result = result * 31 + MathUtils.hash(getGeometricMean());
396 result = result * 31 + MathUtils.hash(getMax());
397 result = result * 31 + MathUtils.hash(getMean());
398 result = result * 31 + MathUtils.hash(getMin());
399 result = result * 31 + MathUtils.hash(getN());
400 result = result * 31 + MathUtils.hash(getSum());
401 result = result * 31 + MathUtils.hash(getSumSq())
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| move_alloc.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
37 test_hash<std::hash<int> >,
52 test_hash<std::hash<int> >(8),
91 assert(c.hash_function() == test_hash<std::hash<int> >(8));
101 test_hash<std::hash<int> >,
116 test_hash<std::hash<int> >(8),
155 assert(c.hash_function() == test_hash<std::hash<int> >(8));
166 test_hash<std::hash<int> >,
181 test_hash<std::hash<int> >(8)
[all...] |
| assign_move.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8),
56 test_hash<std::hash<int> >(2),
99 test_hash<std::hash<int> >,
115 test_hash<std::hash<int> >(8),
121 test_hash<std::hash<int> >(2),
164 test_hash<std::hash<int> >,
180 test_hash<std::hash<int> >(8)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| move_alloc.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
37 test_hash<std::hash<int> >,
52 test_hash<std::hash<int> >(8),
91 assert(c.hash_function() == test_hash<std::hash<int> >(8));
101 test_hash<std::hash<int> >,
116 test_hash<std::hash<int> >(8),
155 assert(c.hash_function() == test_hash<std::hash<int> >(8));
166 test_hash<std::hash<int> >,
181 test_hash<std::hash<int> >(8)
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| regex2.h | 149 * and a mask to pick out the relevant bit of each byte. A hash code
160 uch hash; /* hash code */ member in struct:__anon1094
165 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
166 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRDebugEventProxy.h | 105 - (void) createNilNode:(unsigned)hash;
106 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
107 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRDebugEventProxy.h | 105 - (void) createNilNode:(unsigned)hash;
106 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
107 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRDebugEventProxy.h | 105 - (void) createNilNode:(unsigned)hash;
106 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
107 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRDebugEventProxy.h | 105 - (void) createNilNode:(unsigned)hash;
106 - (void) createNode:(unsigned)hash text:(NSString *)text type:(NSInteger)type;
107 - (void) createNode:(unsigned)hash fromTokenAtIndex:(NSInteger)tokenIndex;
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| MapHashCodeTester.java | 41 expectedHashCode += hash(entry);
69 expectedHashCode += hash(entry);
75 + "a null element in an entry counts as having a hash of zero).",
79 private static int hash(Map.Entry<?, ?> e) { method in class:MapHashCodeTester
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| types.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
20 // typedef Hash hasher;
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
55 typedef std::unordered_map<char, short, std::hash<char>, std::equal_to<char>,
59 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| types.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
20 // typedef Hash hasher;
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
55 typedef std::unordered_multimap<char, short, std::hash<char>, std::equal_to<char>,
59 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| types.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
20 // typedef Hash hasher;
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
53 typedef std::unordered_multiset<short, std::hash<short>,
57 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| types.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
20 // typedef Hash hasher;
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
53 typedef std::unordered_set<short, std::hash<short>,
57 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
|
