| /external/v8/test/mjsunit/ |
| call-stub.js | 28 function Hash() {
36 Hash.prototype.m = function() {
40 var h = new Hash();
55 Hash.prototype.wwwww = Hash.prototype.m;
|
| /external/chromium/net/disk_cache/ |
| hash.h | 15 // From http://www.azillionmonkeys.com/qed/hash.html
16 // This is the hash used on WebCore/platform/stringhash
19 inline uint32 Hash(const char* key, size_t length) {
23 inline uint32 Hash(const std::string& key) {
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| socketaddresspair.cc | 54 size_t SocketAddressPair::Hash() const {
55 return src_.Hash() ^ dest_.Hash();
|
| /external/skia/include/gpu/ |
| GrKey.h | 20 typedef intptr_t Hash;
22 explicit GrKey(Hash hash) : fHash(hash) {}
38 const Hash fHash;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
28 typedef test_hash<std::hash<int> > Hash;
31 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
40 assert(c1.hash_function() == Hash(2));
49 assert(c2.hash_function() == Hash(1));
57 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
28 typedef test_hash<std::hash<int> > Hash;
31 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
40 assert(c1.hash_function() == Hash(2));
49 assert(c2.hash_function() == Hash(1));
57 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
28 typedef test_hash<std::hash<int> > Hash;
31 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
40 assert(c1.hash_function() == Hash(2));
49 assert(c2.hash_function() == Hash(1));
57 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
28 typedef test_hash<std::hash<int> > Hash;
31 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
40 assert(c1.hash_function() == Hash(2));
49 assert(c2.hash_function() == Hash(1));
57 typedef test_hash<std::hash<int> > Hash
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.h | 14 // precompiled by the code in ssl_false_start_blacklist_process.cc into a hash
22 // Hash returns the modified djb2 hash of the given string.
23 static unsigned Hash(const char* str) {
24 // This is inline because the code which generates the hash table needs to
29 unsigned hash = 5381; local
33 hash = ((hash << 5) + hash) ^ c;
34 return hash;
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/ |
| IntPointHash.h | 31 static unsigned hash(const WebCore::IntPoint& p) { return WTF::intHash(static_cast<uint64_t>(p.x()) << 32 | p.y()); } function in struct:WTF::IntPointHash
43 typedef IntPointHash Hash;
|
| IntRectHash.h | 38 static unsigned hash(const WebCore::IntRect& key) function in struct:WTF::IntHash
40 return intHash(static_cast<uint64_t>(DefaultHash<WebCore::IntPoint>::Hash::hash(key.location())) << 32 | DefaultHash<WebCore::IntSize>::Hash::hash(key.size()));
44 return DefaultHash<WebCore::IntPoint>::Hash::equal(a.location(), b.location()) && DefaultHash<WebCore::IntSize>::Hash::equal(a.size(), b.size());
48 template<> struct DefaultHash<WebCore::IntRect> { typedef IntHash<WebCore::IntRect> Hash; };
|
| IntSizeHash.h | 30 static unsigned hash(const WebCore::IntSize& key) { return intHash((static_cast<uint64_t>(key.width()) << 32 | key.height())); } function in struct:WTF::IntHash
34 template<> struct DefaultHash<WebCore::IntSize> { typedef IntHash<WebCore::IntSize> Hash; };
|
| /external/webkit/Source/WebCore/platform/network/ |
| ProtectionSpaceHash.h | 35 static unsigned hash(const ProtectionSpace& protectionSpace) function in struct:WebCore::ProtectionSpaceHash
38 protectionSpace.host().impl() ? protectionSpace.host().impl()->hash() : 0,
42 protectionSpace.realm().impl() ? protectionSpace.realm().impl()->hash() : 0
64 typedef WebCore::ProtectionSpaceHash Hash;
|
| /frameworks/av/media/libstagefright/foundation/ |
| AAtomizer.cpp | 41 size_t index = AAtomizer::Hash(name) % n;
57 uint32_t AAtomizer::Hash(const char *s) {
|
| /external/chromium/chrome/common/ |
| visitedlink_common.h | 30 // for looking things up in the hash table, and for computing hash values and
50 // A hash value of a fingerprint
51 typedef int32 Hash;
53 // A fingerprint or hash value that does not exist
55 static const Hash null_hash_;
110 // Computes the hash value of the given fingerprint, this is used as a lookup
112 static Hash HashFingerprint(Fingerprint fingerprint, int32 table_length) {
115 return static_cast<Hash>(fingerprint % table_length);
118 Hash HashFingerprint(Fingerprint fingerprint) const
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashFunctions.h | 35 // integer hash function
90 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash
96 static unsigned hash(T key) function in struct:WTF::FloatHash
109 // pointer identity hash function
112 static unsigned hash(T key) function in struct:WTF::PtrHash
118 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key));
127 using PtrHash<P*>::hash;
128 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
135 // default hash function for each typ
140 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash
[all...] |
| /external/webkit/Source/WebCore/platform/ |
| Cookie.h | 63 static unsigned hash(Cookie key) function in struct:WebCore::CookieHash
65 return StringHash::hash(key.name) + StringHash::hash(key.domain) + StringHash::hash(key.path) + key.secure;
78 typedef WebCore::CookieHash Hash;
|
| /external/chromium/sdch/open-vcdiff/src/ |
| rolling_hash.h | 29 // Definitions common to all hash window sizes.
65 // Here's the heart of the hash algorithm. Start with a partial_hash value of
67 // hashed. The result will be the hash value for the entire data window. The
68 // Hash() function, below, does exactly this, albeit with some refinements.
74 // Use this function to start computing a new hash value based on the first
108 // instance of this type to use UpdateHash(), but Hash() does not depend on
117 // Compute a hash of the window "ptr[0, window_size - 1]".
118 static uint32_t Hash(const char* ptr) {
126 // Update a hash by removing the oldest byte and adding a new byte.
128 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.h | 34 unsigned Hash;
38 : Hash(h), Block(b) {}
40 unsigned getHash() const { return Hash; }
|
| /external/open-vcdiff/src/ |
| rolling_hash.h | 30 // Definitions common to all hash window sizes.
66 // Here's the heart of the hash algorithm. Start with a partial_hash value of
68 // hashed. The result will be the hash value for the entire data window. The
69 // Hash() function, below, does exactly this, albeit with some refinements.
75 // Use this function to start computing a new hash value based on the first
107 // instance of this type to use UpdateHash(), but Hash() does not depend on
116 // Compute a hash of the window "ptr[0, window_size - 1]".
117 static uint32_t Hash(const char* ptr) {
125 // Update a hash by removing the oldest byte and adding a new byte.
127 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1
[all...] |
| /external/v8/test/cctest/ |
| test-hashmap.cc | 46 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {}
89 static uint32_t Hash(uint32_t key) { return 23; }
93 void TestSet(IntKeyHash hash, int size) {
94 IntSet set(hash);
174 TestSet(Hash, 100);
|
