1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
// class Alloc = allocator<Value>>
// class unordered_set
// size_type bucket_size(size_type n) const
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
#include <unordered_set>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef std::unordered_set<int> C;
typedef int P;
P a[] =
{
P(1),
P(2),
P(3),
P(4),
P(1),
P(2)
};
const C c(std::begin(a), std::end(a));
assert(c.bucket_count() >= 5);
LIBCPP_ASSERT(c.bucket_size(0) == 0);
LIBCPP_ASSERT(c.bucket_size(1) == 1);
LIBCPP_ASSERT(c.bucket_size(2) == 1);
LIBCPP_ASSERT(c.bucket_size(3) == 1);
LIBCPP_ASSERT(c.bucket_size(4) == 1);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
typedef int P;
P a[] =
{
P(1),
P(2),
P(3),
P(4),
P(1),
P(2)
};
const C c(std::begin(a), std::end(a));
assert(c.bucket_count() >= 5);
LIBCPP_ASSERT(c.bucket_size(0) == 0);
LIBCPP_ASSERT(c.bucket_size(1) == 1);
LIBCPP_ASSERT(c.bucket_size(2) == 1);
LIBCPP_ASSERT(c.bucket_size(3) == 1);
LIBCPP_ASSERT(c.bucket_size(4) == 1);
}
#endif
#if _LIBCPP_DEBUG_LEVEL >= 1
{
typedef std::unordered_set<int> C;
C c;
C::size_type i = c.bucket_size(3);
assert(false);
}
#endif
return 0;
}
|
