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
|
// { dg-do run { target c++11 } }
// { dg-options "-g -O0" }
//
// Copyright (C) 2020-2023 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 <forward_list>
#include <memory>
#include <testsuite_hooks.h>
struct PredLWG526
{
PredLWG526(int i) : i_(i) {};
~PredLWG526() { i_ = -32767; }
bool
operator() (const PredLWG526& p) const { return p.i_ == i_; }
bool
operator==(int i) const { return i == i_; }
bool
operator() (const PredLWG526& lhs, const PredLWG526& rhs) const
{
VERIFY( i_ != -32767 );
return lhs.i_ == rhs.i_;
}
int i_;
};
void test01()
{
int a1[] = {1, 2, 1, 3, 5, 8, 11};
int a2[] = {2, 3, 5, 8, 11};
std::forward_list<PredLWG526> fl(a1, a1 + 7);
VERIFY( std::distance(fl.begin(), fl.end()) == 7 );
fl.remove_if(std::cref(fl.front()));
VERIFY( std::distance(fl.begin(), fl.end()) == 5 );
for (size_t i = 0; !fl.empty(); ++i)
{
VERIFY( fl.front() == a2[i] );
fl.pop_front();
}
}
void test02()
{
int a1[] = {1, 1, 1, 2, 3, 5, 8, 11};
int a2[] = {1, 2, 3, 5, 8, 11};
std::forward_list<PredLWG526> fl(a1, a1 + 8);
VERIFY( std::distance(fl.begin(), fl.end()) == 8 );
auto it = fl.begin();
++it;
fl.unique(std::cref(*it));
VERIFY( std::distance(fl.begin(), fl.end()) == 6 );
for (size_t i = 0; !fl.empty(); ++i)
{
VERIFY( fl.front() == a2[i] );
fl.pop_front();
}
}
int main()
{
test01();
test02();
return 0;
}
|
