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
|
// Copyright (C) 2017-2022 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-do run { target c++11 } }
#include <unordered_map>
#include <testsuite_hooks.h>
#include <testsuite_allocator.h>
struct fails_on_copy {
fails_on_copy() = default;
fails_on_copy(const fails_on_copy&) { throw 0; };
};
using value_type = std::pair<const int, fails_on_copy>;
void
test01()
{
value_type p;
try
{
std::unordered_map<int, fails_on_copy> umap(&p, &p + 1);
}
catch(...)
{ }
}
void
test02()
{
using Alloc = __gnu_test::tracker_allocator<value_type>;
using std::hash;
using std::equal_to;
value_type p;
try
{
std::unordered_map<int, fails_on_copy, hash<int>, equal_to<int>, Alloc>
umap(&p, &p + 1);
}
catch(...)
{ }
using counter = __gnu_test::tracker_allocator_counter;
VERIFY(counter::get_allocation_count() == counter::get_deallocation_count());
}
int
main()
{
test01();
test02();
}
|
