assign_move.pass.cpp revision bc8d3f97eb5c958007f2713238472e0c1c8fe02c
15821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)//===----------------------------------------------------------------------===// 25821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 35821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// ��������������������The LLVM Compiler Infrastructure 45821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 55821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// This file is distributed under the University of Illinois Open Source 65821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// License. See LICENSE.TXT for details. 75821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 85821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)//===----------------------------------------------------------------------===// 95821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// <unordered_map> 115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// class Alloc = allocator<pair<const Key, T>>> 145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// class unordered_map 15 16// unordered_map& operator=(unordered_map&& u); 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 26int main() 27{ 28#ifdef _LIBCPP_MOVE 29 { 30 typedef test_allocator<std::pair<const int, std::string> > A; 31 typedef std::unordered_map<int, std::string, 32 test_hash<std::hash<int> >, 33 test_compare<std::equal_to<int> >, 34 A 35 > C; 36 typedef std::pair<int, std::string> P; 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(a, a + 2, 53 7, 54 test_hash<std::hash<int> >(2), 55 test_compare<std::equal_to<int> >(3), 56 A(4) 57 ); 58 c = std::move(c0); 59 assert(c.bucket_count() == 7); 60 assert(c.size() == 4); 61 assert(c.at(1) == "one"); 62 assert(c.at(2) == "two"); 63 assert(c.at(3) == "three"); 64 assert(c.at(4) == "four"); 65 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 66 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 67 assert(c.get_allocator() == A(4)); 68 assert(!c.empty()); 69 assert(std::distance(c.begin(), c.end()) == c.size()); 70 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 71 assert(c.load_factor() == (float)c.size()/c.bucket_count()); 72 assert(c.max_load_factor() == 1); 73 } 74 { 75 typedef test_allocator<std::pair<const int, std::string> > A; 76 typedef std::unordered_map<int, std::string, 77 test_hash<std::hash<int> >, 78 test_compare<std::equal_to<int> >, 79 A 80 > C; 81 typedef std::pair<int, std::string> P; 82 P a[] = 83 { 84 P(1, "one"), 85 P(2, "two"), 86 P(3, "three"), 87 P(4, "four"), 88 P(1, "four"), 89 P(2, "four"), 90 }; 91 C c0(a, a + sizeof(a)/sizeof(a[0]), 92 7, 93 test_hash<std::hash<int> >(8), 94 test_compare<std::equal_to<int> >(9), 95 A(10) 96 ); 97 C c(a, a + 2, 98 7, 99 test_hash<std::hash<int> >(2), 100 test_compare<std::equal_to<int> >(3), 101 A(10) 102 ); 103 c = std::move(c0); 104 assert(c.bucket_count() == 7); 105 assert(c.size() == 4); 106 assert(c.at(1) == "one"); 107 assert(c.at(2) == "two"); 108 assert(c.at(3) == "three"); 109 assert(c.at(4) == "four"); 110 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 111 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 112 assert(c.get_allocator() == A(10)); 113 assert(!c.empty()); 114 assert(std::distance(c.begin(), c.end()) == c.size()); 115 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 116 assert(c.load_factor() == (float)c.size()/c.bucket_count()); 117 assert(c.max_load_factor() == 1); 118 assert(c0.size() == 0); 119 } 120 { 121 typedef other_allocator<std::pair<const int, std::string> > A; 122 typedef std::unordered_map<int, std::string, 123 test_hash<std::hash<int> >, 124 test_compare<std::equal_to<int> >, 125 A 126 > C; 127 typedef std::pair<int, std::string> P; 128 P a[] = 129 { 130 P(1, "one"), 131 P(2, "two"), 132 P(3, "three"), 133 P(4, "four"), 134 P(1, "four"), 135 P(2, "four"), 136 }; 137 C c0(a, a + sizeof(a)/sizeof(a[0]), 138 7, 139 test_hash<std::hash<int> >(8), 140 test_compare<std::equal_to<int> >(9), 141 A(10) 142 ); 143 C c(a, a + 2, 144 7, 145 test_hash<std::hash<int> >(2), 146 test_compare<std::equal_to<int> >(3), 147 A(4) 148 ); 149 c = std::move(c0); 150 assert(c.bucket_count() == 7); 151 assert(c.size() == 4); 152 assert(c.at(1) == "one"); 153 assert(c.at(2) == "two"); 154 assert(c.at(3) == "three"); 155 assert(c.at(4) == "four"); 156 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 157 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 158 assert(c.get_allocator() == A(10)); 159 assert(!c.empty()); 160 assert(std::distance(c.begin(), c.end()) == c.size()); 161 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 162 assert(c.load_factor() == (float)c.size()/c.bucket_count()); 163 assert(c.max_load_factor() == 1); 164 assert(c0.size() == 0); 165 } 166#endif 167} 168