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 // template <class InputIterator> 17 // unordered_multiset(InputIterator first, InputIterator last, size_type n, 18 // const hasher& hf, const key_equal& eql); 19 20 #include <unordered_set> 21 #include <cassert> 22 #include <cfloat> 23 24 #include "test_iterators.h" 25 #include "../../../test_compare.h" 26 #include "../../../test_hash.h" 27 #include "test_allocator.h" 28 #include "min_allocator.h" 29 30 int main() 31 { 32 { 33 typedef std::unordered_multiset<int, 34 test_hash<std::hash<int> >, 35 test_compare<std::equal_to<int> >, 36 test_allocator<int> 37 > C; 38 typedef int P; 39 P a[] = 40 { 41 P(1), 42 P(2), 43 P(3), 44 P(4), 45 P(1), 46 P(2) 47 }; 48 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 49 7, 50 test_hash<std::hash<int> >(8), 51 test_compare<std::equal_to<int> >(9) 52 ); 53 assert(c.bucket_count() == 7); 54 assert(c.size() == 6); 55 assert(c.count(1) == 2); 56 assert(c.count(2) == 2); 57 assert(c.count(3) == 1); 58 assert(c.count(4) == 1); 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() == test_allocator<int>()); 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(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 66 assert(c.max_load_factor() == 1); 67 } 68 #if __cplusplus >= 201103L 69 { 70 typedef std::unordered_multiset<int, 71 test_hash<std::hash<int> >, 72 test_compare<std::equal_to<int> >, 73 min_allocator<int> 74 > C; 75 typedef int P; 76 P a[] = 77 { 78 P(1), 79 P(2), 80 P(3), 81 P(4), 82 P(1), 83 P(2) 84 }; 85 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 86 7, 87 test_hash<std::hash<int> >(8), 88 test_compare<std::equal_to<int> >(9) 89 ); 90 assert(c.bucket_count() == 7); 91 assert(c.size() == 6); 92 assert(c.count(1) == 2); 93 assert(c.count(2) == 2); 94 assert(c.count(3) == 1); 95 assert(c.count(4) == 1); 96 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 97 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 98 assert(c.get_allocator() == min_allocator<int>()); 99 assert(!c.empty()); 100 assert(std::distance(c.begin(), c.end()) == c.size()); 101 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 102 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 103 assert(c.max_load_factor() == 1); 104 } 105 #endif 106 } 107
