Mercurial > hg > CbC > CbC_gcc

comparison libstdc++-v3/testsuite/23_containers/unordered_set/modifiers/92878_92947.cc @ 152:2b5abeee2509

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update gcc11
author anatofuz
date Mon, 25 May 2020 07:50:57 +0900
parents
children
comparison
equal deleted inserted replaced
145:1830386684a0 152:2b5abeee2509
1 // { dg-options "-std=gnu++2a" }
2 // { dg-do run { target c++2a } }
3
4 // Copyright (C) 2020 Free Software Foundation, Inc.
5 //
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)
10 // any later version.
11 //
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.
16 //
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/>.
20
21 #include <unordered_set>
22 #include <testsuite_hooks.h>
23
24 struct aggressive_aggregate
25 {
26 int a;
27 int b;
28 };
29
30 bool operator==(const aggressive_aggregate& a,
31 const aggressive_aggregate& b)
32 {
33 return a.a == b.a;
34 };
35
36 namespace std {
37 template<> struct hash<aggressive_aggregate> {
38 size_t operator()(const aggressive_aggregate& x) const {
39 return std::hash<int>()(x.a);
40 }
41 };
42 }
43
44 void test_emplace()
45 {
46 std::unordered_set<aggressive_aggregate> x;
47 auto emplaced = x.emplace(1, 2);
48 VERIFY(emplaced.first->a == 1);
49 VERIFY(emplaced.first->b == 2);
50 emplaced = x.emplace(2);
51 VERIFY(emplaced.first->a == 2);
52 VERIFY(emplaced.first->b == 0);
53 emplaced = x.emplace();
54 VERIFY(emplaced.first->a == 0);
55 VERIFY(emplaced.first->b == 0);
56 }
57
58 void test_emplace_hint()
59 {
60 std::unordered_set<aggressive_aggregate> x;
61 auto it = x.emplace_hint(x.begin(),
62 3, 2);
63 VERIFY(it->a == 3);
64 VERIFY(it->b == 2);
65 it = x.emplace_hint(x.begin(),
66 4);
67 VERIFY(it->a == 4);
68 VERIFY(it->b == 0);
69 it = x.emplace_hint(x.begin());
70 VERIFY(it->a == 0);
71 VERIFY(it->b == 0);
72 }
73
74 int main()
75 {
76 test_emplace();
77 test_emplace_hint();
78 }