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