assign_init.pass.cpp revision bc8d3f97eb5c958007f2713238472e0c1c8fe02 
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_set
15
16// unordered_set& operator=(initializer_list<value_type> il);
17
18#include <unordered_set>
19#include <cassert>
20
21#include "../../../test_compare.h"
22#include "../../../test_hash.h"
23#include "../../../test_allocator.h"
24
25int main()
26{
27#ifdef _LIBCPP_MOVE
28    {
29        typedef test_allocator<int> A;
30        typedef std::unordered_set<int,
31                                   test_hash<std::hash<int> >,
32                                   test_compare<std::equal_to<int> >,
33                                   A
34                                   > C;
35        typedef int P;
36        C c =   {
37                    P(4),
38                    P(1),
39                    P(2)
40                };
41        c =     {
42                    P(1),
43                    P(2),
44                    P(3),
45                    P(4),
46                    P(1),
47                    P(2)
48                };
49        assert(c.bucket_count() >= 5);
50        assert(c.size() == 4);
51        assert(c.count(1) == 1);
52        assert(c.count(2) == 1);
53        assert(c.count(3) == 1);
54        assert(c.count(4) == 1);
55        assert(std::distance(c.begin(), c.end()) == c.size());
56        assert(std::distance(c.cbegin(), c.cend()) == c.size());
57        assert(c.load_factor() == (float)c.size()/c.bucket_count());
58        assert(c.max_load_factor() == 1);
59    }
60#endif
61}
62