| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| default_noexcept.pass.cpp | 51 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
56 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
65 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| dtor_noexcept.pass.cpp | 48 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
53 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
62 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
32 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
54 assert(c.hash_function() == test_hash<std::hash<int> >(8));
67 test_hash<std::hash<int> >,
83 test_hash<std::hash<int> >(8),
94 assert(c.hash_function() == test_hash<std::hash<int> >(8));
108 test_hash<std::hash<int> >,
123 test_hash<std::hash<int> >(8)
[all...] |
| move_assign_noexcept.pass.cpp | 50 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
55 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
64 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| move_noexcept.pass.cpp | 47 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
52 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
61 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_noexcept.pass.cpp | 50 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
56 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
67 typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/unord.hash/ |
| enum.pass.cpp | 12 // make sure that we can hash enumeration values
37 std::hash<T> >::value), "");
40 std::hash<T> h1;
41 std::hash<under_type> h2;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/ |
| Fat.java | 410 int hash = 7; local
411 hash = 23 * hash + Arrays.hashCode(this.entries);
412 hash = 23 * hash + this.fatType.hashCode();
413 hash = 23 * hash + this.sectorCount;
414 hash = 23 * hash + this.sectorSize;
415 hash = 23 * hash + this.lastClusterIndex
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 87 * The concurrent hash map implementation built by {@link CacheBuilder}.
101 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
163 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose
174 /** The segments, each of which is a specialized hash table. */
435 * Returns the default equivalence strategy used to compare and hash keys or values referenced
449 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
450 return new StrongEntry<K, V>(key, hash, next);
456 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
457 return new StrongAccessEntry<K, V>(key, hash, next);
471 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next)
1083 final int hash; field in class:LocalCache.StrongEntry
1372 final int hash; field in class:LocalCache.WeakEntry
1822 int hash = original.getHash(); local
1832 int hash = entry.getHash(); local
1836 int hash(@Nullable Object key) { method in class:LocalCache
1843 int hash = entry.getHash(); local
1844 segmentFor(hash).reclaimValue(entry.getKey(), hash, valueReference); local
1848 int hash = entry.getHash(); local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ComputingConcurrentHashMap.java | 61 ComputingSegment<K, V> segmentFor(int hash) {
62 return (ComputingSegment<K, V>) super.segmentFor(hash);
66 int hash = hash(checkNotNull(key)); local
67 return segmentFor(hash).getOrCompute(key, hash, computingFunction);
76 V getOrCompute(K key, int hash, Function<? super K, ? extends V> computingFunction)
81 ReferenceEntry<K, V> e = getEntry(key, hash);
101 int index = hash & (table.length() - 1);
106 if (e.getHash() == hash && entryKey != nul
[all...] |
| /external/srtp/crypto/test/ |
| sha1_driver.c | 57 unsigned hash_len; /* number of octets output by hash */
59 uint8_t hash[MAX_HASH_OUT_LEN]; /* expected hash output */ member in struct:hash_test_case_t
83 tmp_len = hex_string_to_octet_string((char *)test_case->hash, hex_hash, hash_len*2);
113 if (0 == memcmp(test_case->hash, hash_value, 20)) {
116 octet_string_hex_string((uint8_t *)test_case->hash, 20));
124 octet_string_hex_string((uint8_t *)test_case->hash, 20));
480 printf("error adding hash test case (code %d)\n", err);
507 printf("error validating hash test case (error code %d)\n", err);
|
| /frameworks/base/services/core/java/com/android/server/am/ |
| PendingIntentRecord.java | 87 int hash = 23; local
88 hash = (ODD_PRIME_NUMBER*hash) + _f;
89 hash = (ODD_PRIME_NUMBER*hash) + _r;
90 hash = (ODD_PRIME_NUMBER*hash) + _userId;
92 hash = (ODD_PRIME_NUMBER*hash) + _w.hashCode();
95 hash = (ODD_PRIME_NUMBER*hash) + _a.hashCode()
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| SerializationHandleMap.java | 126 int index, next, hash; local
148 hash = getModuloHash(object, length);
149 hashedOk = hash > index;
151 hashedOk = hashedOk || (hash <= next);
153 hashedOk = hashedOk && (hash <= next);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
| RSADigestSigner.java | 156 byte[] hash = new byte[digest.getDigestSize()];
157 digest.doFinal(hash, 0);
161 byte[] data = derEncode(hash);
182 byte[] hash = new byte[digest.getDigestSize()];
184 digest.doFinal(hash, 0);
192 expected = derEncode(hash);
205 int sigOffset = sig.length - hash.length - 2;
206 int expectedOffset = expected.length - hash.length - 2;
213 for (int i = 0; i < hash.length; i++)
239 byte[] hash)
[all...] |
| /frameworks/base/core/java/android/content/pm/ |
| ContainerEncryptionParams.java | 264 int hash = 3; local
266 hash += 5 * mEncryptionAlgorithm.hashCode();
267 hash += 7 * Arrays.hashCode(mEncryptionSpec.getIV());
268 hash += 11 * mEncryptionKey.hashCode();
269 hash += 13 * mMacAlgorithm.hashCode();
270 hash += 17 * mMacKey.hashCode();
271 hash += 19 * Arrays.hashCode(mMacTag);
272 hash += 23 * mAuthenticatedDataStart;
273 hash += 29 * mEncryptedDataStart;
274 hash += 31 * mDataEnd
[all...] |
| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 75 hash_t PatchCache::PatchDescription::hash() const { function in class:android::uirenderer::PatchCache::PatchDescription
76 uint32_t hash = JenkinsHashMix(0, android::hash_type(mPatch)); local
77 hash = JenkinsHashMix(hash, mBitmapWidth);
78 hash = JenkinsHashMix(hash, mBitmapHeight);
79 hash = JenkinsHashMix(hash, mPixelWidth);
80 hash = JenkinsHashMix(hash, mPixelHeight)
[all...] |
| /libcore/luni/src/main/java/libcore/reflect/ |
| AnnotationMember.java | 251 * Computes hash code of this element. The formula is as follows:
255 * @return the hash code
260 int hash = name.hashCode() * 127; local
264 return hash ^ Arrays.hashCode((int[])value);
266 return hash ^ Arrays.hashCode((byte[])value);
268 return hash ^ Arrays.hashCode((short[])value);
270 return hash ^ Arrays.hashCode((long[])value);
272 return hash ^ Arrays.hashCode((char[])value);
274 return hash ^ Arrays.hashCode((boolean[])value);
276 return hash ^ Arrays.hashCode((float[])value)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
