| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| functional_hash.h | 64 hash<error_code>::operator()(error_code) const;
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| functional_hash.h | 64 hash<error_code>::operator()(error_code) const;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| functional_hash.h | 64 hash<error_code>::operator()(error_code) const;
|
| /frameworks/base/libs/hwui/font/ |
| Font.cpp | 74 hash_t Font::FontDescription::hash() const { function in class:android::uirenderer::Font::FontDescription
75 uint32_t hash = JenkinsHashMix(0, mFontId); local
76 hash = JenkinsHashMix(hash, android::hash_type(mFontSize));
77 hash = JenkinsHashMix(hash, android::hash_type(mFlags));
78 hash = JenkinsHashMix(hash, android::hash_type(mItalicStyle));
79 hash = JenkinsHashMix(hash, android::hash_type(mScaleX))
[all...] |
| /ndk/docs/Programmers_Guide/html/ |
| navtree.js | 322 var aname = $(location).attr('hash');
326 window.location.hash.substring(1)+'"]');
340 function selectAndHighlight(hash,n)
343 if (hash) {
344 var link=stripPath($(location).attr('pathname'))+':'+hash.substring(1);
363 function showNode(o, node, index, hash)
370 showNode(o,node,index,hash);
385 showNode(o,n,index+1,hash);
392 showNode(o,node,index,hash); // retry with child node expanded
399 selectAndHighlight(hash,n)
[all...] |
| /frameworks/base/libs/hwui/ |
| TessellationCache.cpp | 58 hash_t TessellationCache::Description::hash() const { function in class:android::uirenderer::TessellationCache::Description
59 uint32_t hash = JenkinsHashMix(0, type); local
60 hash = JenkinsHashMix(hash, aa);
61 hash = JenkinsHashMix(hash, cap);
62 hash = JenkinsHashMix(hash, style);
63 hash = JenkinsHashMix(hash, android::hash_type(strokeWidth))
88 hash_t TessellationCache::ShadowDescription::hash() const { function in class:android::uirenderer::TessellationCache::ShadowDescription
89 uint32_t hash = JenkinsHashMixBytes(0, (uint8_t*) &nodeKey, sizeof(const void*)); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/hash/ |
| HashCodeTest.java | 17 package com.google.common.hash;
63 // expectedHashCodes must contain at least one hash code with 4 bytes
73 // expectedHashCodes must contain at least one hash code with 8 bytes
344 private static void assertExpectedHashCode(ExpectedHashCode expectedHashCode, HashCode hash) {
345 assertTrue(Arrays.equals(expectedHashCode.bytes, hash.asBytes()));
346 byte[] bb = new byte[hash.bits() / 8];
347 hash.writeBytesTo(bb, 0, bb.length);
349 assertEquals(expectedHashCode.asInt, hash.asInt());
352 hash.asLong();
356 assertEquals(expectedHashCode.asLong.longValue(), hash.asLong())
[all...] |
| /libcore/luni/src/main/java/java/util/jar/ |
| JarVerifier.java | 78 * Stores and a hash and a message digest and verifies that massage digest
79 * matches the hash.
87 private final byte[] hash; field in class:JarVerifier.VerifierEntry
93 VerifierEntry(String name, MessageDigest digest, byte[] hash,
97 this.hash = hash;
131 if (!MessageDigest.isEqual(d, Base64.decode(hash))) {
164 * which contains the certificates used to sign the entry and its hash value
210 final String hash = attributes.getValue(algorithm + "-Digest"); local
211 if (hash == null)
373 String hash = attributes.getValue(algorithm + entry); local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| AbstractStorelessUnivariateStatistic.java | 174 * Returns hash code based on getResult() and getN()
176 * @return hash code
180 return 31* (31 + MathUtils.hash(getResult())) + MathUtils.hash(getN());
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/symmetric/util/ |
| PBE.java | 61 int hash)
67 switch (hash)
90 switch (hash)
131 switch (hash)
280 int hash,
284 PBEParametersGenerator generator = makePBEGenerator(type, hash);
318 int hash,
321 PBEParametersGenerator generator = makePBEGenerator(type, hash);
|
| /external/guava/guava/src/com/google/common/hash/ |
| ChecksumHashFunction.java | 15 package com.google.common.hash;
80 public HashCode hash() { method in class:ChecksumHashFunction.ChecksumHasher
|
| Hasher.java | 15 package com.google.common.hash;
22 * A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher should
26 * <p><b>Warning:</b> The result of calling any methods after calling {@link #hash} is undefined.
37 * the following three expressions all generate colliding hash codes: <pre> {@code
39 * newHasher().putByte(b1).putByte(b2).putByte(b3).hash()
40 * newHasher().putByte(b1).putBytes(new byte[] { b2, b3 }).hash()
41 * newHasher().putBytes(new byte[] { b1, b2, b3 }).hash()}</pre>
106 * Computes a hash code based on the data that have been provided to this hasher. The result is
109 HashCode hash(); method in interface:Hasher
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| CalendarCache.java | 56 int index = hash(key);
92 * Produce a uniformly-distributed hash value from an integer key.
96 private final int hash(long key) method in class:CalendarCache
|
| /external/jemalloc/include/jemalloc/internal/ |
| ckh.h | 17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
26 /* Hash table cell. */
51 * Minimum and current number of hash table buckets. There are
57 /* Hash and comparison functions. */
58 ckh_hash_t *hash; member in struct:ckh_s
61 /* Hash table with 2^lg_curbuckets buckets. */
69 bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| bucket_count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
53 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
61 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| max_load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
47 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
54 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| init.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
33 test_hash<std::hash<int> >,
52 assert(c.hash_function() == test_hash<std::hash<int> >());
65 test_hash<std::hash<int> >,
84 assert(c.hash_function() == test_hash<std::hash<int> >());
98 typedef test_hash<std::hash<int>> HF;
117 assert(c.hash_function() == test_hash<std::hash<int> >());
129 typedef test_hash<std::hash<int>> HF;
150 assert(!(c.hash_function() == test_hash<std::hash<int> >()))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| max_load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
47 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
54 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
52 typedef std::unordered_multiset<int, std::hash<int>,
60 typedef std::unordered_multiset<int, std::hash<int>,
|
| load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
51 typedef std::unordered_multiset<int, std::hash<int>,
69 typedef std::unordered_multiset<int, std::hash<int>,
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
52 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
59 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
51 typedef std::unordered_set<int, std::hash<int>,
69 typedef std::unordered_set<int, std::hash<int>,
|
| /external/libcxx/test/std/utilities/function.objects/unord.hash/ |
| enum.pass.cpp | 12 // make sure that we can hash enumeration values
34 typedef std::hash<T> H;
40 std::hash<under_type> h2;
|
| /external/libcxx/test/support/ |
| Counter.h | 13 #include <functional> // for std::hash
45 struct hash<Counter<T> > struct in namespace:std
48 std::size_t operator()(const Counter<T>& x) const {return std::hash<T>(x.get());}
|
| /external/ltrace/testsuite/ltrace.main/ |
| hello-vfork.exp | 28 } elseif [ regexp {Couldn't get .hash data} $exec_output ] {
29 fail "Couldn't get .hash data!"
|
