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 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame^] | 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 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_map |
| 15 | |
| 16 | // unordered_map(unordered_map&& u, const allocator_type& a); |
| 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::pair<int, std::string> P; |
| 31 | typedef test_allocator<std::pair<const int, std::string>> A; |
| 32 | typedef std::unordered_map<int, std::string, |
| 33 | test_hash<std::hash<int> >, |
| 34 | test_compare<std::equal_to<int> >, |
| 35 | A |
| 36 | > C; |
| 37 | P a[] = |
| 38 | { |
| 39 | P(1, "one"), |
| 40 | P(2, "two"), |
| 41 | P(3, "three"), |
| 42 | P(4, "four"), |
| 43 | P(1, "four"), |
| 44 | P(2, "four"), |
| 45 | }; |
| 46 | C c0(a, a + sizeof(a)/sizeof(a[0]), |
| 47 | 7, |
| 48 | test_hash<std::hash<int> >(8), |
| 49 | test_compare<std::equal_to<int> >(9), |
| 50 | A(10) |
| 51 | ); |
| 52 | C c(std::move(c0), A(12)); |
| 53 | assert(c.bucket_count() >= 5); |
| 54 | assert(c.size() == 4); |
| 55 | assert(c.at(1) == "one"); |
| 56 | assert(c.at(2) == "two"); |
| 57 | assert(c.at(3) == "three"); |
| 58 | assert(c.at(4) == "four"); |
| 59 | assert(c.hash_function() == test_hash<std::hash<int> >(8)); |
| 60 | assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); |
| 61 | assert(c.get_allocator() == A(12)); |
| 62 | assert(!c.empty()); |
| 63 | assert(std::distance(c.begin(), c.end()) == c.size()); |
| 64 | assert(std::distance(c.cbegin(), c.cend()) == c.size()); |
| 65 | assert(c.load_factor() == (float)c.size()/c.bucket_count()); |
| 66 | assert(c.max_load_factor() == 1); |
| 67 | |
| 68 | assert(c0.empty()); |
| 69 | } |
| 70 | { |
| 71 | typedef std::pair<int, std::string> P; |
| 72 | typedef test_allocator<std::pair<const int, std::string>> A; |
| 73 | typedef std::unordered_map<int, std::string, |
| 74 | test_hash<std::hash<int> >, |
| 75 | test_compare<std::equal_to<int> >, |
| 76 | A |
| 77 | > C; |
| 78 | P a[] = |
| 79 | { |
| 80 | P(1, "one"), |
| 81 | P(2, "two"), |
| 82 | P(3, "three"), |
| 83 | P(4, "four"), |
| 84 | P(1, "four"), |
| 85 | P(2, "four"), |
| 86 | }; |
| 87 | C c0(a, a + sizeof(a)/sizeof(a[0]), |
| 88 | 7, |
| 89 | test_hash<std::hash<int> >(8), |
| 90 | test_compare<std::equal_to<int> >(9), |
| 91 | A(10) |
| 92 | ); |
| 93 | C c(std::move(c0), A(10)); |
| 94 | assert(c.bucket_count() == 7); |
| 95 | assert(c.size() == 4); |
| 96 | assert(c.at(1) == "one"); |
| 97 | assert(c.at(2) == "two"); |
| 98 | assert(c.at(3) == "three"); |
| 99 | assert(c.at(4) == "four"); |
| 100 | assert(c.hash_function() == test_hash<std::hash<int> >(8)); |
| 101 | assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); |
| 102 | assert(c.get_allocator() == A(10)); |
| 103 | assert(!c.empty()); |
| 104 | assert(std::distance(c.begin(), c.end()) == c.size()); |
| 105 | assert(std::distance(c.cbegin(), c.cend()) == c.size()); |
| 106 | assert(c.load_factor() == (float)c.size()/c.bucket_count()); |
| 107 | assert(c.max_load_factor() == 1); |
| 108 | |
| 109 | assert(c0.empty()); |
| 110 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 111 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 112 | } |