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, const key_equal& eql, const allocator_type& a);
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 test_compare<std::equal_to<int> >(9),
49 test_allocator<int>(10)
50 );
51 assert(c.bucket_count() == 7);
52 assert(c.size() == 6);
53 assert(c.count(1) == 2);
54 assert(c.count(2) == 2);
55 assert(c.count(3) == 1);
56 assert(c.count(4) == 1);
57 assert(c.hash_function() == test_hash<std::hash<int> >(8));
58 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
59 assert(c.get_allocator() == test_allocator<int>(10));
60 assert(!c.empty());
61 assert(std::distance(c.begin(), c.end()) == c.size());
62 assert(std::distance(c.cbegin(), c.cend()) == c.size());
63 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
64 assert(c.max_load_factor() == 1);
65 }
66 #if __cplusplus >= 201103L
67 {
68 typedef std::unordered_multiset<int,
69 test_hash<std::hash<int> >,
70 test_compare<std::equal_to<int> >,
71 min_allocator<int>
72 > C;
73 typedef int P;
74 C c({
75 P(1),
76 P(2),
77 P(3),
78 P(4),
79 P(1),
80 P(2)
81 },
82 7,
83 test_hash<std::hash<int> >(8),
84 test_compare<std::equal_to<int> >(9),
85 min_allocator<int>()
86 );
87 assert(c.bucket_count() == 7);
88 assert(c.size() == 6);
89 assert(c.count(1) == 2);
90 assert(c.count(2) == 2);
91 assert(c.count(3) == 1);
92 assert(c.count(4) == 1);
93 assert(c.hash_function() == test_hash<std::hash<int> >(8));
94 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
95 assert(c.get_allocator() == min_allocator<int>());
96 assert(!c.empty());
97 assert(std::distance(c.begin(), c.end()) == c.size());
98 assert(std::distance(c.cbegin(), c.cend()) == c.size());
99 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
100 assert(c.max_load_factor() == 1);
101 }
102 #endif
103 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
104 }
105