| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_set<int, 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++/libcxx/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>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_set<int, 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...] |
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| IntSizeHash.h | 30 static unsigned hash(const WebCore::IntSize& key) { return pairIntHash(key.width(), key.height()); } function in struct:WTF::IntHash
36 typedef IntHash<WebCore::IntSize> Hash;
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/skia/ |
| SkSizeHash.h | 37 static unsigned hash(const SkSize& key) { return pairIntHash(key.width(), key.height()); } function in struct:WTF::IntHash
43 typedef IntHash<SkSize> Hash;
61 static unsigned hash(const SkISize& key) { return pairIntHash(key.width(), key.height()); } function in struct:WTF::IntHash
67 typedef IntHash<SkISize> Hash;
|
| /external/llvm/lib/ProfileData/ |
| InstrProfIndexed.h | 30 MD5 Hash;
31 Hash.update(Str);
33 Hash.final(Result);
45 llvm_unreachable("Unhandled hash type");
|
| /frameworks/av/media/libstagefright/foundation/ |
| AAtomizer.cpp | 41 size_t index = AAtomizer::Hash(name) % n;
57 uint32_t AAtomizer::Hash(const char *s) {
|
| /art/runtime/ |
| gc_map.h | 68 size_t index = Hash(native_pc_offset) % num_entries;
78 static uint32_t Hash(uint32_t native_offset) {
79 uint32_t hash = native_offset; local
80 hash ^= (hash >> 20) ^ (hash >> 12);
81 hash ^= (hash >> 7) ^ (hash >> 4);
82 return hash;
[all...] |
| /external/chromium_org/components/visitedlink/common/ |
| visitedlink_common.h | 31 // for looking things up in the hash table, and for computing hash values and
51 // A hash value of a fingerprint
52 typedef int32 Hash;
54 // A fingerprint or hash value that does not exist
56 static const Hash null_hash_;
111 // Computes the hash value of the given fingerprint, this is used as a lookup
113 static Hash HashFingerprint(Fingerprint fingerprint, int32 table_length) {
116 return static_cast<Hash>(fingerprint % table_length);
119 Hash HashFingerprint(Fingerprint fingerprint) const
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/custom/ |
| CustomElementDescriptor.h | 96 typedef WebCore::CustomElementDescriptorHash Hash;
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| Cookie.h | 65 static unsigned hash(Cookie key) function in struct:WebCore::CookieHash
67 return StringHash::hash(key.name) + StringHash::hash(key.domain) + StringHash::hash(key.path) + key.secure;
80 typedef WebCore::CookieHash Hash;
|
| Crypto.h | 42 static unsigned hash(const WebCore::DigestValue& v) function in struct:WTF::DigestValueHash
54 typedef DigestValueHash Hash;
59 typedef IntHash<WebCore::HashAlgorithm> Hash;
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrTMultiMap.h | 26 static uint32_t Hash(const Key& key) { return HashTraits::Hash(key); }
|
| /external/chromium_org/third_party/skia/tests/ |
| DynamicHashTest.cpp | 18 static uint32_t Hash(const int& key) { return key; }
22 class Hash : public SkTDynamicHash<Entry, int> {
24 Hash() : INHERITED() {}
45 Hash hash; local
46 ASSERT(hash.capacity() == 0);
48 hash.add(&a);
49 ASSERT(hash.capacity() == 4);
51 hash.add(&b);
52 ASSERT(hash.capacity() == 4)
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.h | 12 ** This is the header file for the generic hash-table implemenation
19 typedef struct Hash Hash;
22 /* A complete hash table is an instance of the following structure.
30 ** All elements of the hash table are on a single doubly-linked list.
31 ** Hash.first points to the head of this list.
33 ** There are Hash.htsize buckets. Each bucket points to a spot in
37 ** Hash.htsize and Hash.ht may be zero. In that case lookup is done
39 ** Hash.ht table is never allocated because if there are few element
[all...] |
| /external/llvm/unittests/CodeGen/ |
| DIEHashTest.cpp | 22 DIEHash Hash;
26 uint64_t MD5Res = Hash.computeTypeSignature(Die);
41 // The exact same hash GCC produces for this DIE.
55 // The exact same hash GCC produces for this DIE.
82 // The exact same hash GCC produces for this DIE.
303 // Check that the hash for a pointer-to-member matches regardless of whether the
376 // Check that the hash for a pointer-to-member matches regardless of whether the
447 // causes a hash to differ when the containing type is a declaration in one TU
502 // The exact same hash GCC produces for this DIE.
520 // The exact same hash GCC produces for this DIE
[all...] |
| /external/skia/src/gpu/ |
| GrTMultiMap.h | 26 static uint32_t Hash(const Key& key) { return HashTraits::Hash(key); }
|
| /external/skia/tests/ |
| DynamicHashTest.cpp | 18 static uint32_t Hash(const int& key) { return key; }
22 class Hash : public SkTDynamicHash<Entry, int> {
24 Hash() : INHERITED() {}
45 Hash hash; local
46 ASSERT(hash.capacity() == 0);
48 hash.add(&a);
49 ASSERT(hash.capacity() == 4);
51 hash.add(&b);
52 ASSERT(hash.capacity() == 4)
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
[all...] |
| /external/chromium_org/google_apis/cup/ |
| client_update_protocol.cc | 33 std::vector<uint8> Hash(const std::vector<uint8>& data) {
41 std::vector<uint8> Hash(const base::StringPiece& sdata) {
114 std::vector<uint8> digest = Hash(result);
209 // Compute the challenge hash:
210 // hw = HASH(HASH(v|w)|HASH(request_url)|HASH(body)).
211 // Keep the challenge hash for later to validate the server's response.
215 h = Hash(GetVersionedSecret())
[all...] |
| /external/chromium_org/sdch/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/chromium_org/third_party/WebKit/Source/platform/weborigin/ |
| KURL.h | 272 // KURLHash is the default hash for String
275 typedef WebCore::KURLHash Hash;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| HashFunctions.h | 37 // integer hash function
91 // Compound integer hash method: http://opendatastructures.org/versions/edition-0.1d/ods-java/node33.html#SECTION00832000000000000000
104 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash
111 static unsigned hash(T key) function in struct:WTF::FloatHash
122 // pointer identity hash function
125 static unsigned hash(T key) function in struct:WTF::PtrHash
131 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key));
142 using PtrHash<P*>::hash;
143 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); function in struct:WTF::PtrHash
144 static unsigned hash(const PassRefPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
153 static unsigned hash(const RawPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
161 static unsigned hash(const OwnPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
162 static unsigned hash(const PassOwnPtr<P>& key) { return hash(key.get()); } function in struct:WTF::PtrHash
180 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash
193 static unsigned hash(const std::pair<T, U>& p) { return pairIntHash(p.first, p.second); } function in struct:WTF::IntPairHash
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.h | 12 ** This is the header file for the generic hash-table implemenation
14 ** hash table implementation for the full-text indexing module.
21 typedef struct Hash Hash;
24 /* A complete hash table is an instance of the following structure.
32 struct Hash {
39 int htsize; /* Number of buckets in the hash table */
40 struct _ht { /* the hash table */
41 int count; /* Number of entries with this hash */
42 HashElem *chain; /* Pointer to first entry with this hash */
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| packed-cache-inl.h | 72 // a hash function, H, and use an array indexed by H(key):
102 // This is a direct-mapped cache with 2^kHashbits entries; the hash
142 // We don't want the hash map to occupy 512K memory at Chromium, so
161 array_[Hash(key)] = KeyToUpper(key) | value;
166 return KeyMatch(array_[Hash(key)], key);
175 T entry = array_[Hash(key)];
210 static size_t Hash(K key) {
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| packed-cache-inl.h | 72 // a hash function, H, and use an array indexed by H(key):
102 // This is a direct-mapped cache with 2^kHashbits entries; the hash
159 array_[Hash(key)] = KeyToUpper(key) | value;
164 return KeyMatch(array_[Hash(key)], key);
173 T entry = array_[Hash(key)];
208 static size_t Hash(K key) {
|
| /external/chromium_org/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);
|
