]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/libstdc++-prettyprinters/cxx11.cc
001b121dcec7cc6ca35a76225b79ce6ff7c23105
1 // { dg-do run { target c++11 } }
2 // { dg-options "-g -O0" }
4 // Copyright (C) 2011-2020 Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING3. If not see
19 // <http://www.gnu.org/licenses/>.
21 #include <forward_list>
22 #include <unordered_map>
23 #include <unordered_set>
27 #include "../util/testsuite_allocator.h" // NullablePointer
29 typedef std::tuple
<int, int> ExTuple
;
33 placeholder(const T
&s
)
38 template<class T
, class S
>
40 placeholder(const std::pair
<T
,S
> &s
)
47 use(const T
&container
)
49 for (typename
T::const_iterator i
= container
.begin();
61 std::unique_ptr
<datum
> global
;
66 std::forward_list
<int> efl
;
67 // { dg-final { regexp-test efl "empty std::(__debug::)?forward_list" } }
69 std::forward_list
<int> &refl
= efl
;
70 // { dg-final { regexp-test refl "empty std::(__debug::)?forward_list" } }
72 std::forward_list
<int> fl
;
75 // { dg-final { regexp-test fl {std::(__debug::)?forward_list = {\[0\] = 1, \[1\] = 2}} } }
77 std::forward_list
<int> &rfl
= fl
;
78 // { dg-final { regexp-test rfl {std::(__debug::)?forward_list = {\[0\] = 1, \[1\] = 2}} } }
80 std::unordered_map
<int, std::string
> eum
;
81 // { dg-final { regexp-test eum "std::(__debug::)?unordered_map with 0 elements" } }
82 std::unordered_map
<int, std::string
> &reum
= eum
;
83 // { dg-final { regexp-test reum "std::(__debug::)?unordered_map with 0 elements" } }
85 std::unordered_multimap
<int, std::string
> eumm
;
86 // { dg-final { regexp-test eumm "std::(__debug::)?unordered_multimap with 0 elements" } }
87 std::unordered_multimap
<int, std::string
> &reumm
= eumm
;
88 // { dg-final { regexp-test reumm "std::(__debug::)?unordered_multimap with 0 elements" } }
90 std::unordered_set
<int> eus
;
91 // { dg-final { regexp-test eus "std::(__debug::)?unordered_set with 0 elements" } }
92 std::unordered_set
<int> &reus
= eus
;
93 // { dg-final { regexp-test reus "std::(__debug::)?unordered_set with 0 elements" } }
95 std::unordered_multiset
<int> eums
;
96 // { dg-final { regexp-test eums "std::(__debug::)?unordered_multiset with 0 elements" } }
97 std::unordered_multiset
<int> &reums
= eums
;
98 // { dg-final { regexp-test reums "std::(__debug::)?unordered_multiset with 0 elements" } }
100 std::unordered_map
<int, std::string
> uom
;
103 // { dg-final { regexp-test uom {std::(__debug::)?unordered_map with 2 elements = {\[3\] = "seven", \[5\] = "three"}} } }
105 std::unordered_map
<int, std::string
> &ruom
= uom
;
106 // { dg-final { regexp-test ruom {std::(__debug::)?unordered_map with 2 elements = {\[3\] = "seven", \[5\] = "three"}} } }
108 std::unordered_multimap
<int, std::string
> uomm
;
109 uomm
.insert(std::pair
<int, std::string
> (5, "three"));
110 uomm
.insert(std::pair
<int, std::string
> (5, "seven"));
111 // { dg-final { regexp-test uomm {std::(__debug::)?unordered_multimap with 2 elements = {\[5\] = "seven", \[5\] = "three"}} } }
112 std::unordered_multimap
<int, std::string
> &ruomm
= uomm
;
113 // { dg-final { regexp-test ruomm {std::(__debug::)?unordered_multimap with 2 elements = {\[5\] = "seven", \[5\] = "three"}} } }
115 std::unordered_set
<int> uos
;
117 // { dg-final { regexp-test uos {std::(__debug::)?unordered_set with 1 element = {\[0\] = 5}} } }
118 std::unordered_set
<int> &ruos
= uos
;
119 // { dg-final { regexp-test ruos {std::(__debug::)?unordered_set with 1 element = {\[0\] = 5}} } }
121 std::unordered_multiset
<int> uoms
;
123 // { dg-final { regexp-test uoms {std::(__debug::)?unordered_multiset with 1 element = {\[0\] = 5}} } }
124 std::unordered_multiset
<int> &ruoms
= uoms
;
125 // { dg-final { regexp-test ruoms {std::(__debug::)?unordered_multiset with 1 element = {\[0\] = 5}} } }
127 std::unique_ptr
<datum
> uptr (new datum
);
130 // { dg-final { regexp-test uptr {std::unique_ptr.datum. = {get\(\) = 0x.*}} } }
131 std::unique_ptr
<datum
> &ruptr
= uptr
;
132 // { dg-final { regexp-test ruptr {std::unique_ptr.datum. = {get\(\) = 0x.*}} } }
134 using data
= datum
[];
135 std::unique_ptr
<data
> arrptr (new datum
[2]);
136 // { dg-final { regexp-test arrptr {std::unique_ptr.datum \[\]. = {get\(\) = 0x.*}} } }
137 std::unique_ptr
<data
>& rarrptr
= arrptr
;
138 // { dg-final { regexp-test rarrptr {std::unique_ptr.datum \[\]. = {get\(\) = 0x.*}} } }
142 int deleter_member
= -1;
143 using pointer
= __gnu_test::NullablePointer
<void>;
144 void operator()(pointer
) const noexcept
{ }
146 static_assert( !std::is_empty
<Deleter
>(), "Deleter is not empty" );
147 static_assert( std::is_empty
<Deleter::pointer
>(), "but pointer is empty" );
149 std::unique_ptr
<int, Deleter
> empty_ptr
;
150 // { dg-final { note-test empty_ptr {std::unique_ptr<int> = {get() = {<No data fields>}}} } }
151 std::unique_ptr
<int, Deleter
>& rempty_ptr
= empty_ptr
;
152 // { dg-final { note-test rempty_ptr {std::unique_ptr<int> = {get() = {<No data fields>}}} } }
155 // { dg-final { note-test tpl {std::tuple containing = {[1] = 6, [2] = 7}} } }
157 // { dg-final { note-test rtpl {std::tuple containing = {[1] = 6, [2] = 7}} } }
158 placeholder(""); // Mark SPOT
173 // { dg-final { gdb-test SPOT } }