HomeSort by relevance Sort by last modified time
    Searched defs:Hash (Results 1 - 25 of 109) sorted by null

1 2 3 4 5

  /external/v8/test/mjsunit/
call-stub.js 28 function Hash() {
36 Hash.prototype.m = function() {
40 var h = new Hash();
55 Hash.prototype.wwwww = Hash.prototype.m;
  /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/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();
  /external/skia/src/gpu/
GrLayerCache.h 31 // for SkTDynamicHash - just use the pictureID as the hash key
33 static uint32_t Hash(const uint32_t& key) { return SkChecksum::Mix(key); }
126 uint32_t hash() const {
127 uint32_t hash = SkChecksum::Murmur3(reinterpret_cast<const uint32_t*>(fKey),
130 sizeof(IDMatrix), hash);
147 static uint32_t Hash(const Key& key) { return key.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...]
erase_const_iter.pass.cpp 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
30 struct Hash { size_t operator() (const TemplateConstructor &) const { return 0; } };
57 typedef std::unordered_multiset<int, std::hash<int>,
83 typedef std::unordered_set<T, Hash> C;
  /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...]
erase_const_iter.pass.cpp 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
30 struct Hash { size_t operator() (const TemplateConstructor &) const { return 0; } };
56 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
80 typedef std::unordered_set<T, Hash> C;
  /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...]
  /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/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
erase_const_iter.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
32 struct Hash { size_t operator() (const TemplateConstructor &) const { return 0; } };
58 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
83 typedef std::unordered_map<T, int, Hash> C;

Completed in 586 milliseconds

1 2 3 4 5