init_size_hash_equal.pass.cpp revision 6046aced820aaab4f14f2026531dd11d10690691 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. 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);
18
19#include <unordered_set>
20#include <cassert>
21
22#include "../../../test_compare.h"
23#include "../../../test_hash.h"
24#include "../../../test_allocator.h"
25
26int main()
27{
28#ifdef _LIBCPP_MOVE
29    {
30        typedef std::unordered_multiset<int,
31                                   test_hash<std::hash<int> >,
32                                   test_compare<std::equal_to<int> >,
33                                   test_allocator<int>
34                                   > C;
35        typedef int P;
36        C c({
37                P(1),
38                P(2),
39                P(3),
40                P(4),
41                P(1),
42                P(2)
43            },
44            7,
45            test_hash<std::hash<int> >(8),
46            test_compare<std::equal_to<int> >(9)
47           );
48        assert(c.bucket_count() == 7);
49        assert(c.size() == 6);
50        assert(c.count(1) == 2);
51        assert(c.count(2) == 2);
52        assert(c.count(3) == 1);
53        assert(c.count(4) == 1);
54        assert(c.hash_function() == test_hash<std::hash<int> >(8));
55        assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
56        assert(c.get_allocator() == test_allocator<int>());
57        assert(!c.empty());
58        assert(std::distance(c.begin(), c.end()) == c.size());
59        assert(std::distance(c.cbegin(), c.cend()) == c.size());
60        assert(c.load_factor() == (float)c.size()/c.bucket_count());
61        assert(c.max_load_factor() == 1);
62    }
63#endif  // _LIBCPP_MOVE
64}
65