range_size.pass.cpp revision 061d0cc4db18d17bf01ed14c5db0be098205bd47 
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_set
15
16// template <class InputIterator>
17//     unordered_set(InputIterator first, InputIterator last, size_type n);
18
19#include <unordered_set>
20#include <cassert>
21#include <cfloat>
22
23#include "test_iterators.h"
24#include "../../../test_compare.h"
25#include "../../../test_hash.h"
26#include "../../../test_allocator.h"
27#include "min_allocator.h"
28
29int main()
30{
31    {
32        typedef std::unordered_set<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        P a[] =
39        {
40            P(1),
41            P(2),
42            P(3),
43            P(4),
44            P(1),
45            P(2)
46        };
47        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
48            7
49           );
50        assert(c.bucket_count() == 7);
51        assert(c.size() == 4);
52        assert(c.count(1) == 1);
53        assert(c.count(2) == 1);
54        assert(c.count(3) == 1);
55        assert(c.count(4) == 1);
56        assert(c.hash_function() == test_hash<std::hash<int> >());
57        assert(c.key_eq() == test_compare<std::equal_to<int> >());
58        assert(c.get_allocator() == test_allocator<int>());
59        assert(!c.empty());
60        assert(std::distance(c.begin(), c.end()) == c.size());
61        assert(std::distance(c.cbegin(), c.cend()) == c.size());
62        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
63        assert(c.max_load_factor() == 1);
64    }
65#if __cplusplus >= 201103L
66    {
67        typedef std::unordered_set<int,
68                                   test_hash<std::hash<int> >,
69                                   test_compare<std::equal_to<int> >,
70                                   min_allocator<int>
71                                   > C;
72        typedef int P;
73        P a[] =
74        {
75            P(1),
76            P(2),
77            P(3),
78            P(4),
79            P(1),
80            P(2)
81        };
82        C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
83            7
84           );
85        assert(c.bucket_count() == 7);
86        assert(c.size() == 4);
87        assert(c.count(1) == 1);
88        assert(c.count(2) == 1);
89        assert(c.count(3) == 1);
90        assert(c.count(4) == 1);
91        assert(c.hash_function() == test_hash<std::hash<int> >());
92        assert(c.key_eq() == test_compare<std::equal_to<int> >());
93        assert(c.get_allocator() == min_allocator<int>());
94        assert(!c.empty());
95        assert(std::distance(c.begin(), c.end()) == c.size());
96        assert(std::distance(c.cbegin(), c.cend()) == c.size());
97        assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
98        assert(c.max_load_factor() == 1);
99    }
100#endif
101}
102