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
116
117
118
119
120
121
122
|
// Copyright (C) 2019-2025 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 compile { target c++17 } }
#include <queue>
#include <deque>
#include <list>
#include <testsuite_allocator.h>
template<typename T, typename U> struct require_same;
template<typename T> struct require_same<T, T> { using type = void; };
template<typename T, typename U>
typename require_same<T, U>::type
check_type(U&) { }
void
test01()
{
std::queue<unsigned> s0;
std::queue s1 = s0;
check_type<std::queue<unsigned>>(s1);
std::queue s2 = std::move(s0);
check_type<std::queue<unsigned>>(s2);
const std::queue s3 = s0;
check_type<const std::queue<unsigned>>(s3);
const std::queue s4 = s3;
check_type<const std::queue<unsigned>>(s4);
std::allocator<unsigned> a;
std::queue s5(s0, a);
check_type<std::queue<unsigned>>(s5);
std::queue s6(std::move(s0), a);
check_type<std::queue<unsigned>>(s6);
const std::queue s7(s3, a);
check_type<const std::queue<unsigned>>(s7);
}
void
test02()
{
std::deque<unsigned> d;
std::list<long> l;
std::queue s1(d);
check_type<std::queue<unsigned>>(s1);
std::queue s2(d, d.get_allocator());
check_type<std::queue<unsigned>>(s2);
std::queue s3(std::move(d));
check_type<std::queue<unsigned>>(s3);
std::queue s4(std::move(d), d.get_allocator());
check_type<std::queue<unsigned>>(s4);
std::queue s5(l);
check_type<std::queue<long, std::list<long>>>(s5);
std::queue s6(l, l.get_allocator());
check_type<std::queue<long, std::list<long>>>(s6);
std::queue s7(std::move(l));
check_type<std::queue<long, std::list<long>>>(s7);
std::queue s8(std::move(l), l.get_allocator());
check_type<std::queue<long, std::list<long>>>(s8);
}
struct Pool;
template<typename T>
struct Alloc : __gnu_test::SimpleAllocator<T>
{
Alloc(Pool*) { }
template<typename U>
Alloc(const Alloc<U>&) { }
};
void
test_p1518r2()
{
// P1518R2 - Stop overconstraining allocators in container deduction guides.
// This is a C++23 feature but we support it for C++17 too.
using Deque = std::deque<unsigned, Alloc<unsigned>>;
using List = std::list<long, Alloc<long>>;
Pool* p = nullptr;
Deque d(p);
List l(p);
std::queue q1(d, p);
check_type<std::queue<unsigned, Deque>>(q1);
std::queue q2(l, p);
check_type<std::queue<long, List>>(q2);
std::queue q3(q2, p);
check_type<std::queue<long, List>>(q3);
}
|
