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
|
// Copyright (C) 2005-2024 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 <algorithm>
#include <vector>
#include <testsuite_hooks.h>
void
test1()
{
std::vector<bool> v;
v.push_back(true);
v.push_back(false);
std::iter_swap(v.begin(), v.begin() + 1);
VERIFY( v[0] == false && v[1] == true );
}
void
test2()
{
std::vector<int> v;
v.push_back(1);
v.push_back(2);
std::iter_swap(v.begin(), v.begin() + 1);
VERIFY( v[0] == 2 && v[1] == 1 );
}
int int_swap_count;
struct X {};
void swap(X&, X&)
{ ++int_swap_count; }
void
test3()
{
int_swap_count = 0;
X i, j;
std::iter_swap(&i, &j);
VERIFY( int_swap_count == 1 );
}
// libstdc++/20577
int main()
{
test1();
test2();
test3();
return 0;
}
|
