| /external/llvm/lib/Fuzzer/test/ |
| SimpleHashTest.cpp | 13 uint32_t Hash = 0x12039854;
15 Hash += Data[i];
16 Hash += (Hash << 10);
17 Hash ^= (Hash >> 6);
19 Hash += (Hash << 3);
20 Hash ^= (Hash >> 11)
[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/webrtc/webrtc/base/ |
| socketaddresspair.cc | 37 size_t SocketAddressPair::Hash() const {
38 return src_.Hash() ^ dest_.Hash();
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 36 template<class Key = std::string, class Hash = std::unordered_map<Key, double> >
39 typedef Hash Wmap;
46 explicit SparseWeightVector(const SparseWeightVector<Key, Hash> &other) {
49 void operator=(const SparseWeightVector<Key, Hash> &other) {
52 void CopyFrom(const SparseWeightVector<Key, Hash> &other) {
116 void LoadWeightVector(const SparseWeightVector<Key, Hash> &vec) {
133 const SparseWeightVector<Key, Hash> &w1,
136 const SparseWeightVector<Key, Hash> &w1,
139 const SparseWeightVector<Key, Hash> &w1,
141 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/v8/test/cctest/ |
| test-simd.cc | 22 CHECK_EQ(a->Hash(), b->Hash()); \
26 CHECK_NE(a->Hash(), b->Hash()); \
31 CHECK_EQ(a->Hash(), b->Hash()); \
38 CHECK_NE(a->Hash(), b->Hash()); \
41 CHECK_EQ(a->Hash(), b->Hash()); \
[all...] |
| /external/libchrome/base/ |
| hash.h | 14 // Deprecated: just use std::hash directly
16 // Computes a hash of a string |str|.
17 // WARNING: This hash function should not be used for any cryptographic purpose.
18 inline uint32_t Hash(const std::string& str) {
19 std::hash<std::string> hash_fn;
|
| /external/v8/src/ |
| flags.h | 61 // Hash of flags (to quickly determine mismatching flag expectations).
62 // This hash is calculated during V8::Initialize and cached.
63 static uint32_t Hash();
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 23 // Hash provides an abstraction for building "hash trees" from BPF
27 // convenient API for its use. However, any collision-resistant hash
29 class Hash {
31 static const Hash kZero;
33 Hash() : digest_() {}
35 Hash(uint16_t code,
37 const Hash& jt = kZero,
38 const Hash& jf = kZero)
49 Hash(const Hash& hash) = default member in class:sandbox::__anon15357::Hash
139 Hash& hash = prog_hashes.at(i - 1); local
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_handlers_cxx.h | 39 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
42 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| 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_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...] |
| /external/libcxx/test/std/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>,
31 typedef test_hash<std::hash<int> > Hash;
34 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...] |
| /external/libcxx/test/std/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...] |
| /external/libcxx/test/std/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...] |
| /external/libcxx/test/std/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...] |
| /external/libcxx/test/std/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...] |
| /external/libcxx/test/std/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...] |
| /external/libcxx/test/std/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...] |
| /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...] |
| /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...] |
