| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| hash_copy_constructible.fail.cpp | 15 // Check that std::unordered_map fails to instantiate if the hash function is
21 struct Hash {
24 Hash () {}
26 Hash (const Hash &); // declared but not defined
31 std::unordered_map<int, int, Hash<int> > m;
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| hash_copy_constructible.fail.cpp | 15 // Check that std::unordered_multimap fails to instantiate if the hash function is
21 struct Hash {
24 Hash () {}
26 Hash (const Hash &); // declared but not defined
31 std::unordered_multimap<int, int, Hash<int> > m;
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| hash_copy_constructible.fail.cpp | 12 // Check that std::unordered_multiset fails to instantiate if the hash function is
18 struct Hash {
21 Hash () {}
23 Hash (const Hash &); // declared but not defined
28 std::unordered_multiset<int, Hash<int> > m;
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| hash_copy_constructible.fail.cpp | 12 // Check that std::unordered_set fails to instantiate if the hash function is
18 struct Hash {
21 Hash () {}
23 Hash (const Hash &); // declared but not defined
28 std::unordered_set<int, Hash<int> > m;
|
| /external/llvm/lib/Fuzzer/test/ |
| SimpleHashTest.cpp | 16 uint32_t Hash = 0x12039854;
18 Hash += Data[i];
19 Hash += (Hash << 10);
20 Hash ^= (Hash >> 6);
22 Hash += (Hash << 3);
23 Hash ^= (Hash >> 11)
[all...] |
| /prebuilts/go/darwin-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash package
10 // Hash is the common interface implemented by all hash functions.
12 // Hash implementations in the standard library (e.g. hash/crc32 and
14 // encoding.BinaryUnmarshaler interfaces. Marshaling a hash implementation
16 // later, without having to re-write the data previously written to the hash.
17 // The hash state may contain portions of the input in its original form
[all...] |
| /prebuilts/go/linux-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash package
10 // Hash is the common interface implemented by all hash functions.
12 // Hash implementations in the standard library (e.g. hash/crc32 and
14 // encoding.BinaryUnmarshaler interfaces. Marshaling a hash implementation
16 // later, without having to re-write the data previously written to the hash.
17 // The hash state may contain portions of the input in its original form
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| hash_copy_constructible.fail.cpp | 15 // Check that std::unordered_map fails to instantiate if the hash function is
21 struct Hash {
24 Hash () {}
26 Hash (const Hash &); // declared but not defined
31 std::unordered_map<int, int, Hash<int> > m;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| hash_copy_constructible.fail.cpp | 15 // Check that std::unordered_multimap fails to instantiate if the hash function is
21 struct Hash {
24 Hash () {}
26 Hash (const Hash &); // declared but not defined
31 std::unordered_multimap<int, int, Hash<int> > m;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| hash_copy_constructible.fail.cpp | 12 // Check that std::unordered_multiset fails to instantiate if the hash function is
18 struct Hash {
21 Hash () {}
23 Hash (const Hash &); // declared but not defined
28 std::unordered_multiset<int, Hash<int> > m;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| hash_copy_constructible.fail.cpp | 12 // Check that std::unordered_set fails to instantiate if the hash function is
18 struct Hash {
21 Hash () {}
23 Hash (const Hash &); // declared but not defined
28 std::unordered_set<int, Hash<int> > m;
|
| /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();
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| hash.h | 2 * hash.h -- define hash table entries, sizes, hash function...
53 typedef struct _entry { /* Minimum hash table entry -- superclass */
58 /* Hash 's' using 'size', place into h (s is modified) */
59 #define Hash(s,h,size) \
|
| /system/tools/hidl/include_hash/hidl-hash/ |
| Hash.h | 25 struct Hash {
29 static const Hash &getHash(const std::string &path);
39 static std::string hexString(const std::vector<uint8_t> &hash);
46 Hash(const std::string &path);
48 static Hash& getMutableHash(const std::string& path);
|
| /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>,
32 typedef test_hash<std::hash<int> > Hash;
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
32 typedef test_hash<std::hash<int> > Hash;
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
33 typedef test_hash<std::hash<int> > Hash;
36 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
37 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
38 C c2(0, Hash(2), Compare(2), Alloc(1, 2));
44 assert(c1.hash_function() == Hash(2));
53 assert(c2.hash_function() == Hash(1));
61 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>,
32 typedef test_hash<std::hash<int> > Hash;
35 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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.multiset/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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.set/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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/libmojo/mojo/public/cpp/bindings/lib/ |
| hash_util.h | 23 return seed ^ (std::hash<T>()(value) + (seed << 6) + (seed >> 2));
29 static char Test(decltype(&U::Hash));
42 size_t Hash(size_t seed, const T& value);
46 static size_t Hash(size_t seed, const T& value) { return value.Hash(seed); }
51 static size_t Hash(size_t seed, const T& value) {
58 static size_t Hash(size_t seed, const std::vector<T>& value) {
68 static size_t Hash(size_t seed, const base::Optional<std::vector<T>>& value) {
72 return Hash(seed, *value);
77 size_t Hash(size_t seed, const T& value)
[all...] |
| native_struct.cc | 30 size_t NativeStruct::Hash(size_t seed) const {
31 return internal::Hash(seed, data);
|
