Home | History | Annotate | Download | only in unord.map

Lines Matching defs:Hash

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;
63 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
76 C c1(0, Hash(1), Compare(1), Alloc(1, 1));
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2));
91 assert(c1.hash_function() == Hash(2));
100 assert(c2.hash_function() == Hash(1));
108 typedef test_hash<std::hash<int> > Hash;
111 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
122 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc(1, 1));
123 C c2(0, Hash(2), Compare(2), Alloc(1, 2));
129 assert(c1.hash_function() == Hash(2));
142 assert(c2.hash_function() == Hash(1));
150 typedef test_hash<std::hash<int> > Hash;
153 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
175 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc(1, 1));
176 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2));
190 assert(c1.hash_function() == Hash(2));
203 assert(c2.hash_function() == Hash(1));
212 typedef test_hash<std::hash<int> > Hash;
215 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
216 C c1(0, Hash(1), Compare(1), Alloc(1));
217 C c2(0, Hash(2), Compare(2), Alloc(2));
223 assert(c1.hash_function() == Hash(2));
232 assert(c2.hash_function() == Hash(1));
240 typedef test_hash<std::hash<int> > Hash;
243 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
256 C c1(0, Hash(1), Compare(1), Alloc(1));
257 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2));
271 assert(c1.hash_function() == Hash(2));
280 assert(c2.hash_function() == Hash(1));
288 typedef test_hash<std::hash<int> > Hash;
291 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
302 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc(1));
303 C c2(0, Hash(2), Compare(2), Alloc(2));
309 assert(c1.hash_function() == Hash(2));
322 assert(c2.hash_function() == Hash(1));
330 typedef test_hash<std::hash<int> > Hash;
333 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
355 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc(1));
356 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2));
370 assert(c1.hash_function() == Hash(2));
383 assert(c2.hash_function() == Hash(1));
392 typedef test_hash<std::hash<int> > Hash;
395 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
396 C c1(0, Hash(1), Compare(1), Alloc());
397 C c2(0, Hash(2), Compare(2), Alloc());
403 assert(c1.hash_function() == Hash(2));
412 assert(c2.hash_function() == Hash(1));
420 typedef test_hash<std::hash<int> > Hash;
423 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
436 C c1(0, Hash(1), Compare(1), Alloc());
437 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc());
451 assert(c1.hash_function() == Hash(2));
460 assert(c2.hash_function() == Hash(1));
468 typedef test_hash<std::hash<int> > Hash;
471 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
482 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc());
483 C c2(0, Hash(2), Compare(2), Alloc());
489 assert(c1.hash_function() == Hash(2));
502 assert(c2.hash_function() == Hash(1));
510 typedef test_hash<std::hash<int> > Hash;
513 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
535 C c1(std::begin(a1), std::end(a1), 0, Hash(1), Compare(1), Alloc());
536 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc());
550 assert(c1.hash_function() == Hash(2));
563 assert(c2.hash_function() == Hash(1));