Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <unordered_map> |
| 11 | |
| 12 | // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| 13 | // class Alloc = allocator<pair<const Key, T>>> |
| 14 | // class unordered_multimap |
| 15 | |
| 16 | // unordered_multimap(initializer_list<value_type> il, size_type n); |
| 17 | |
| 18 | #include <unordered_map> |
| 19 | #include <string> |
| 20 | #include <cassert> |
| 21 | |
| 22 | #include "../../../test_compare.h" |
| 23 | #include "../../../test_hash.h" |
| 24 | #include "../../../test_allocator.h" |
| 25 | |
| 26 | int main() |
| 27 | { |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 28 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 29 | { |
| 30 | typedef std::unordered_multimap<int, std::string, |
| 31 | test_hash<std::hash<int> >, |
| 32 | test_compare<std::equal_to<int> >, |
| 33 | test_allocator<std::pair<const int, std::string> > |
| 34 | > C; |
| 35 | typedef std::pair<int, std::string> P; |
| 36 | C c({ |
| 37 | P(1, "one"), |
| 38 | P(2, "two"), |
| 39 | P(3, "three"), |
| 40 | P(4, "four"), |
| 41 | P(1, "four"), |
| 42 | P(2, "four"), |
| 43 | }, |
| 44 | 7 |
| 45 | ); |
| 46 | assert(c.bucket_count() == 7); |
| 47 | assert(c.size() == 6); |
| 48 | typedef std::pair<C::const_iterator, C::const_iterator> Eq; |
| 49 | Eq eq = c.equal_range(1); |
| 50 | assert(std::distance(eq.first, eq.second) == 2); |
| 51 | C::const_iterator i = eq.first; |
| 52 | assert(i->first == 1); |
| 53 | assert(i->second == "one"); |
| 54 | ++i; |
| 55 | assert(i->first == 1); |
| 56 | assert(i->second == "four"); |
| 57 | eq = c.equal_range(2); |
| 58 | assert(std::distance(eq.first, eq.second) == 2); |
| 59 | i = eq.first; |
| 60 | assert(i->first == 2); |
| 61 | assert(i->second == "two"); |
| 62 | ++i; |
| 63 | assert(i->first == 2); |
| 64 | assert(i->second == "four"); |
| 65 | |
| 66 | eq = c.equal_range(3); |
| 67 | assert(std::distance(eq.first, eq.second) == 1); |
| 68 | i = eq.first; |
| 69 | assert(i->first == 3); |
| 70 | assert(i->second == "three"); |
| 71 | eq = c.equal_range(4); |
| 72 | assert(std::distance(eq.first, eq.second) == 1); |
| 73 | i = eq.first; |
| 74 | assert(i->first == 4); |
| 75 | assert(i->second == "four"); |
| 76 | assert(std::distance(c.begin(), c.end()) == c.size()); |
| 77 | assert(std::distance(c.cbegin(), c.cend()) == c.size()); |
| 78 | assert(c.load_factor() == (float)c.size()/c.bucket_count()); |
| 79 | assert(c.max_load_factor() == 1); |
| 80 | assert(c.hash_function() == test_hash<std::hash<int> >()); |
| 81 | assert(c.key_eq() == test_compare<std::equal_to<int> >()); |
| 82 | assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >())); |
| 83 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 84 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 85 | } |