| /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/compiler-rt/lib/ubsan/ |
| ubsan_handlers_cxx.h | 33 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
36 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
| ubsan_handlers_cxx.cc | 30 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash,
32 if (checkDynamicType((void*)Pointer, Data->TypeInfo, Hash))
68 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
69 HandleDynamicTypeCacheMiss(Data, Pointer, Hash, false);
72 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
73 HandleDynamicTypeCacheMiss(Data, Pointer, Hash, true);
|
| 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...] |
| /external/chromium/third_party/libjingle/source/talk/base/ |
| socketaddresspair.cc | 54 size_t SocketAddressPair::Hash() const {
55 return src_.Hash() ^ dest_.Hash();
|
| socketaddresspair.h | 49 size_t Hash() const;
|
| /external/skia/include/gpu/ |
| GrKey.h | 20 typedef intptr_t Hash;
22 explicit GrKey(Hash hash) : fHash(hash) {}
38 const Hash fHash;
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 35 template<class Key = std::string, class Hash = std::hash_map<Key, double> >
38 typedef Hash Wmap;
45 explicit SparseWeightVector(const SparseWeightVector<Key, Hash> &other) {
48 void operator=(const SparseWeightVector<Key, Hash> &other) {
51 void CopyFrom(const SparseWeightVector<Key, Hash> &other) {
115 void LoadWeightVector(const SparseWeightVector<Key, Hash> &vec) {
132 const SparseWeightVector<Key, Hash> &w1,
135 const SparseWeightVector<Key, Hash> &w1,
138 const SparseWeightVector<Key, Hash> &w1,
140 void MultWeightUpdate(const SparseWeightVector<Key, Hash> &w1)
[all...] |
| sparse_weight_vector.cpp | 34 template<class Key, class Hash>
35 bool SparseWeightVector<Key, Hash>::IsValid() const {
47 template<class Key, class Hash>
48 void SparseWeightVector<Key, Hash>::AdditiveWeightUpdate(
50 const SparseWeightVector<Key, Hash> &w1,
61 template<class Key, class Hash>
62 void SparseWeightVector<Key, Hash>::AdditiveSquaredWeightUpdate(
64 const SparseWeightVector<Key, Hash> &w1,
76 template<class Key, class Hash>
77 void SparseWeightVector<Key, Hash>::AdditiveInvSqrtWeightUpdate
[all...] |
| stochastic_linear_ranker.cpp | 24 template<class Key, class Hash>
25 void StochasticLinearRanker<Key, Hash>::UpdateSubGradient(
26 const SparseWeightVector<Key, Hash> &positive,
27 const SparseWeightVector<Key, Hash> &negative,
32 SparseWeightVector<Key, Hash> gradient;
61 template<class Key, class Hash>
62 int StochasticLinearRanker<Key, Hash>::UpdateClassifier(
63 const SparseWeightVector<Key, Hash> &positive,
64 const SparseWeightVector<Key, Hash> &negative) {
67 SparseWeightVector<Key, Hash> weight_backup
[all...] |
| 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/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/graphics/ |
| 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; };
|
| /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.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...] |
| /bootable/recovery/minzip/ |
| Android.mk | 5 Hash.c \
|
| /external/webkit/Tools/iExploder/iexploder-1.7.2/tools/ |
| lasthit.rb | 29 hostHash = Hash.new
47 hostHash[host] = Hash.new
50 hostHash[host][agent] = Hash.new
|
| /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/webkit/Tools/iExploder/iexploder-1.3.2/tools/ |
| lasthit.rb | 12 hostHash = Hash.new
26 hostHash[host] = Hash.new
29 hostHash[host][agent] = Hash.new
|
| /frameworks/av/media/libstagefright/foundation/ |
| AAtomizer.cpp | 41 size_t index = AAtomizer::Hash(name) % n;
57 uint32_t AAtomizer::Hash(const char *s) {
|
