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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
// Copyright (C) 2018 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 <map>
#include <testsuite_hooks.h>
void
test01()
{
struct X {
mutable int conversions = 0;
operator std::pair<const int, int>() const {
if (++conversions > 1)
throw 1;
return {};
}
};
std::multimap<int, int> m;
m.insert(X());
VERIFY( m.size() == 1 );
m.insert(m.begin(), X());
VERIFY( m.size() == 2 );
}
void
test02()
{
struct Y {
int conversions = 0;
operator std::pair<const int, int>() && {
if (++conversions > 1)
throw 1;
return {};
}
};
std::multimap<int, int> m;
m.insert(Y());
VERIFY( m.size() == 1 );
m.insert(m.begin(), Y());
VERIFY( m.size() == 2 );
}
struct Key {
int key;
bool operator<(const Key& r) const { return key < r.key; }
};
struct Z {
operator std::pair<const Key, int>() const { return { { z }, 0 }; }
int z;
};
template<typename T>
struct Alloc
{
Alloc() = default;
template<typename U>
Alloc(const Alloc<U>&) { }
using value_type = T;
T* allocate(std::size_t n) { return std::allocator<T>().allocate(n); }
void deallocate(T* p, std::size_t n) { std::allocator<T>().deallocate(p, n); }
template<typename U>
void construct(U* p, const Z& z) { ::new (p) U{ { z.z+1 }, 0}; }
template<typename U>
bool operator==(const Alloc<U>&) { return true; }
template<typename U>
bool operator!=(const Alloc<U>&) { return false; }
};
void
test03()
{
std::multimap<Key, int, std::less<Key>, Alloc<std::pair<const Key, int>>> m;
m.insert(Z{});
m.insert(Z{});
VERIFY( m.size() == 2 );
m.insert(Z{});
m.insert(Z{1});
VERIFY( m.size() == 4 );
}
int
main()
{
test01();
test02();
test03();
}
|
