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