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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
// Copyright (C) 2012-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
//
// { dg-options "-std=gnu++11" }
#include <set>
#include <unordered_map>
#include <testsuite_hooks.h>
bool test __attribute__((unused)) = true;
struct A
{
int x;
static std::set<const A*> destroyed;
A()
{ destroyed.erase(this); }
A(const A& a)
: x(a.x)
{ destroyed.erase(this); }
~A()
{ destroyed.insert(this); }
bool
operator==(const A& other) const
{
VERIFY( destroyed.find(this) == destroyed.end() );
VERIFY( destroyed.find(&other) == destroyed.end() );
return x == other.x;
}
};
std::set<const A*> A::destroyed;
struct hasher
{
std::size_t operator()(const A& a) const
{
VERIFY( A::destroyed.find(&a) == A::destroyed.end() );
return a.x / 10;
}
};
void test01()
{
typedef std::unordered_multimap<A, A, hasher> UMMap;
UMMap map;
A::destroyed.clear();
A a;
a.x = 0;
map.insert({a, a});
map.insert({a, a});
VERIFY( map.size() == 2 );
std::size_t bkt = map.bucket(a);
VERIFY( map.bucket_size(bkt) == 2 );
VERIFY( map.erase( map.begin(bkt)->first ) == 2 );
}
void test02()
{
typedef std::unordered_multimap<A, A, hasher> UMMap;
UMMap map;
A::destroyed.clear();
A a;
a.x = 0;
map.insert({a, a});
map.insert({a, a});
VERIFY( map.size() == 2 );
std::size_t bkt = map.bucket(a);
VERIFY( map.bucket_size(bkt) == 2 );
VERIFY( map.erase( map.begin(bkt)->second ) == 2 );
}
int main()
{
test01();
test02();
return 0;
}
|
