| /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/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/WebKit/Source/wtf/ |
| HashFunctions.h | 35 // integer hash function
89 // Compound integer hash method: http://opendatastructures.org/versions/edition-0.1d/ods-java/node33.html#SECTION00832000000000000000
102 static unsigned hash(T key) { return intHash(static_cast<typename IntTypes<sizeof(T)>::UnsignedType>(key)); } function in struct:WTF::IntHash
109 static unsigned hash(T key) function in struct:WTF::FloatHash
120 // pointer identity hash function
123 static unsigned hash(T key) function in struct:WTF::PtrHash
129 return IntHash<uintptr_t>::hash(reinterpret_cast<uintptr_t>(key));
138 using PtrHash<P*>::hash;
139 static unsigned hash(const RefPtr<P>& key) { return hash(key.get()); function in struct:WTF::PtrHash
151 static unsigned hash(const std::pair<T, U>& p) function in struct:WTF::PairHash
164 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/leveldatabase/src/util/ |
| hash.h | 5 // Simple hash function used for internal data structures
15 extern uint32_t Hash(const char* data, size_t n, uint32_t seed);
|
| /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_org/base/ |
| 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);
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| socketaddresspair.cc | 54 size_t SocketAddressPair::Hash() const {
55 return src_.Hash() ^ dest_.Hash();
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| socketaddresspair.cc | 54 size_t SocketAddressPair::Hash() const {
55 return src_.Hash() ^ dest_.Hash();
|
| /external/chromium_org/third_party/skia/include/gpu/ |
| GrKey.h | 20 typedef intptr_t Hash;
22 explicit GrKey(Hash hash) : fHash(hash) {}
38 const Hash fHash;
|
| /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...] |
| /external/llvm/unittests/Support/ |
| MD5Test.cpp | 24 MD5 Hash;
25 Hash.update(Input);
27 Hash.final(MD5Res);
34 MD5 Hash;
35 Hash.update(Input);
37 Hash.final(MD5Res);
|
| /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/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...] |
| /bootable/recovery/minzip/ |
| Android.mk | 5 Hash.c \
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/filters/ |
| SkiaImageFilterBuilder.h | 59 typedef PtrHash<WebCore::FilterEffect*> Hash;
62 typedef IntHash<unsigned> Hash;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef test_hash<std::hash<int> > Hash;
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.hash_function() == Hash(2));
51 assert(c2.hash_function() == Hash(1));
59 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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>,
30 typedef test_hash<std::hash<int> > Hash;
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.hash_function() == Hash(2));
51 assert(c2.hash_function() == Hash(1));
59 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1));
37 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.hash_function() == Hash(2));
52 assert(c2.hash_function() == Hash(1));
60 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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>,
30 typedef test_hash<std::hash<int> > Hash;
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.hash_function() == Hash(2));
51 assert(c2.hash_function() == Hash(1));
59 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| 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_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...] |
