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
|
// { dg-options "-std=gnu++2a" }
// { dg-do run { target c++2a } }
// Copyright (C) 2018-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/>.
#include <unordered_set>
#include <testsuite_hooks.h>
#ifndef __cpp_lib_erase_if
# error "Feature-test macro for erase_if missing in <unordered_set>"
#elif __cpp_lib_erase_if < 202002
# error "Feature-test macro for erase_if has wrong value in <unordered_set>"
#endif
void
test01()
{
auto is_odd = [](const int i) { return i % 2 != 0; };
std::unordered_set<int> us{ 10, 11, 12, 14, 15, 17, 18, 19 };
auto num = std::erase_if(us, is_odd);
std::unordered_set<int> t{ 10, 12, 14, 18 };
VERIFY( us == t );
VERIFY( num == 4 );
}
void
test02()
{
auto is_odd = [](const int i) { return i % 2 != 0; };
std::unordered_multiset<int> ums{ 20, 21, 22, 22, 23, 23, 24, 25 };
auto num = std::erase_if(ums, is_odd);
std::unordered_multiset<int> t{ 20, 22, 22, 24 };
VERIFY( ums == t );
VERIFY( num == 4 );
}
int
main()
{
test01();
test02();
return 0;
}
|
