| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_multiset<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/ |
| 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/third_party/libjingle/source/talk/base/ |
| socketaddresspair.h | 49 size_t Hash() const;
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| socketaddresspair.h | 49 size_t Hash() const;
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.h | 40 template<class Key = std::string, class Hash = std::hash_map<std::string, double> >
168 void LoadWeights(const SparseWeightVector<Key, Hash> &model) {
172 void SaveWeights(SparseWeightVector<Key, Hash> *model) {
176 double ScoreSample(const SparseWeightVector<Key, Hash> &sample) {
200 int UpdateClassifier(const SparseWeightVector<Key, Hash> &positive,
201 const SparseWeightVector<Key, Hash> &negative);
204 SparseWeightVector<Key, Hash> weight_;
220 SparseWeightVector<Key, Hash> current_negative_;
234 void UpdateSubGradient(const SparseWeightVector<Key, Hash> &positive,
235 const SparseWeightVector<Key, Hash> &negative
[all...] |
| /external/chromium/chrome/browser/visitedlink/ |
| visitedlink_master.h | 44 // (hash) of the link.
160 Hash TryToAddURL(const GURL& url);
195 // hash functions to disk. The range is inclusive on both ends. The range can
197 void WriteHashRangeToFile(Hash first_hash, Hash last_hash);
210 Hash AddFingerprint(Fingerprint fingerprint, bool send_notifications);
212 // Deletes all fingerprints from the given vector from the current hash table
286 // Increases or decreases the given hash value by one, wrapping around as
288 inline Hash IncrementHash(Hash hash)
[all...] |
| /external/chromium_org/components/visitedlink/browser/ |
| visitedlink_master.h | 55 // (hash) of the link.
196 Hash TryToAddURL(const GURL& url);
236 // hash functions to disk. The range is inclusive on both ends. The range can
238 void WriteHashRangeToFile(Hash first_hash, Hash last_hash);
251 Hash AddFingerprint(Fingerprint fingerprint, bool send_notifications);
253 // Deletes all fingerprints from the given vector from the current hash table
327 // Increases or decreases the given hash value by one, wrapping around as
329 inline Hash IncrementHash(Hash hash)
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_type_hash.cc | 10 // Implementation of a hash table for fast checking of inheritance
76 // (vptr,type) pair, a hash is computed. This hash is assumed to be globally
81 // * the vptr, and thus the hash, can be affected by ASLR, so multiple runs
84 // The first caching layer is a small hash table with no chaining; buckets are
85 // reused as needed. The second caching layer is a large hash table with open
88 // FIXME: Make these hash table accesses thread-safe. The races here are benign
92 /// Find a bucket to store the given hash value in.
110 /// A cache of recently-checked hashes. Mini hash table with "random" evictions.
208 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) {
[all...] |
| ubsan_type_hash.h | 49 bool checkDynamicType(void *Object, void *Type, HashValue Hash);
54 /// return \c true (modulo hash collisions) if
56 /// __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] == 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.cc | 14 const VisitedLinkCommon::Hash VisitedLinkCommon::null_hash_ = -1;
44 Hash first_hash = HashFingerprint(fingerprint);
45 Hash cur_hash = first_hash;
|
| /external/chromium_org/components/visitedlink/common/ |
| visitedlink_common.cc | 16 const VisitedLinkCommon::Hash VisitedLinkCommon::null_hash_ = -1;
46 Hash first_hash = HashFingerprint(fingerprint);
47 Hash cur_hash = first_hash;
|
| /external/chromium_org/third_party/openssl/openssl/crypto/rsa/ |
| rsa_pss.c | 74 const EVP_MD *Hash, const unsigned char *EM, int sLen)
76 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
80 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
93 mgf1Hash = Hash;
95 hLen = EVP_MD_size(Hash);
159 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
189 const EVP_MD *Hash, int sLen)
191 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
196 const EVP_MD *Hash, const EVP_MD *mgf1Hash, int sLen)
205 mgf1Hash = Hash;
[all...] |
| /external/openssl/crypto/rsa/ |
| rsa_pss.c | 74 const EVP_MD *Hash, const unsigned char *EM, int sLen)
76 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
80 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
93 mgf1Hash = Hash;
95 hLen = EVP_MD_size(Hash);
159 if (!EVP_DigestInit_ex(&ctx, Hash, NULL)
189 const EVP_MD *Hash, int sLen)
191 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
196 const EVP_MD *Hash, const EVP_MD *mgf1Hash, int sLen)
205 mgf1Hash = Hash;
[all...] |
| /external/skia/tests/ |
| DynamicHashTest.cpp | 15 class Hash : public SkTDynamicHash<Entry, int, GetKey, GetHash, AreEqual> {
17 Hash() : INHERITED() {}
18 Hash(int capacity) : INHERITED(capacity) {}
39 Hash hash(4);
40 ASSERT(hash.capacity() == 4);
42 hash.add(&a);
43 ASSERT(hash.capacity() == 4);
45 hash.add(&b);
46 ASSERT(hash.capacity() == 4)
61 Hash hash; local
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.cc | 14 const unsigned bucket = Hash(last_two_labels) & (kBuckets - 1);
|
| 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/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| 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/wtf/ |
| TCPackedCache.h | 72 // a hash function, H, and use an array indexed by H(key):
103 // the hash function simply takes the low bits of the key.
149 array_[Hash(key)] = static_cast<T>(KeyToUpper(key) | value);
154 return KeyMatch(array_[Hash(key)], key);
163 T entry = array_[Hash(key)];
203 static size_t Hash(K key) {
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| hash.cc | 7 #include "util/hash.h"
18 uint32_t Hash(const char* data, size_t n, uint32_t seed) {
19 // Similar to murmur hash
|
| /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) {
|
| /frameworks/av/include/media/stagefright/foundation/ |
| AAtomizer.h | 44 static uint32_t 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...] |
