blob: c127ddf263db32889cb679669181a453dca1c0b7 (
plain) (
blame)
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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// class unordered_set
// size_type size() const noexcept;
#include <unordered_set>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main()
{
{
typedef std::unordered_set<int> M;
M m;
ASSERT_NOEXCEPT(m.size());
assert(m.size() == 0);
m.insert(M::value_type(2));
assert(m.size() == 1);
m.insert(M::value_type(1));
assert(m.size() == 2);
m.insert(M::value_type(3));
assert(m.size() == 3);
m.erase(m.begin());
assert(m.size() == 2);
m.erase(m.begin());
assert(m.size() == 1);
m.erase(m.begin());
assert(m.size() == 0);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> M;
M m;
ASSERT_NOEXCEPT(m.size());
assert(m.size() == 0);
m.insert(M::value_type(2));
assert(m.size() == 1);
m.insert(M::value_type(1));
assert(m.size() == 2);
m.insert(M::value_type(3));
assert(m.size() == 3);
m.erase(m.begin());
assert(m.size() == 2);
m.erase(m.begin());
assert(m.size() == 1);
m.erase(m.begin());
assert(m.size() == 0);
}
#endif
}
|
