1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_set> 11 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13 // class Alloc = allocator<Value>> 14 // class unordered_multiset 15 16 // unordered_multiset& operator=(initializer_list<value_type> il); 17 18 #include <unordered_set> 19 #include <cassert> 20 #include <cfloat> 21 22 #include "../../../test_compare.h" 23 #include "../../../test_hash.h" 24 #include "../../../test_allocator.h" 25 26 int main() 27 { 28 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 29 { 30 typedef test_allocator<int> A; 31 typedef std::unordered_multiset<int, 32 test_hash<std::hash<int> >, 33 test_compare<std::equal_to<int> >, 34 A 35 > C; 36 typedef int P; 37 C c = { 38 P(4), 39 P(1), 40 P(2) 41 }; 42 c = { 43 P(1), 44 P(2), 45 P(3), 46 P(4), 47 P(1), 48 P(2) 49 }; 50 assert(c.bucket_count() >= 7); 51 assert(c.size() == 6); 52 assert(c.count(1) == 2); 53 assert(c.count(2) == 2); 54 assert(c.count(3) == 1); 55 assert(c.count(4) == 1); 56 assert(std::distance(c.begin(), c.end()) == c.size()); 57 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 58 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 59 assert(c.max_load_factor() == 1); 60 } 61 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 62 } 63
