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
89
90
91
92
93
94
95
96
97
|
// 2005-01-17 Paolo Carlini <pcarlini@suse.de>
// Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
//
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
#include <set>
#include <testsuite_hooks.h>
// A few tests for insert with hint, in the occasion of libstdc++/19422
// and libstdc++/19433.
void test01()
{
bool test __attribute__((unused)) = true;
using namespace std;
set<int> s0, s1;
set<int>::iterator iter1;
s0.insert(1);
s1.insert(s1.end(), 1);
VERIFY( s0 == s1 );
s0.insert(3);
s1.insert(s1.begin(), 3);
VERIFY( s0 == s1 );
s0.insert(4);
iter1 = s1.insert(s1.end(), 4);
VERIFY( s0 == s1 );
s0.insert(6);
s1.insert(iter1, 6);
VERIFY( s0 == s1 );
s0.insert(2);
s1.insert(s1.begin(), 2);
VERIFY( s0 == s1 );
s0.insert(7);
s1.insert(s1.end(), 7);
VERIFY( s0 == s1 );
s0.insert(5);
s1.insert(s1.find(4), 5);
VERIFY( s0 == s1 );
s0.insert(0);
s1.insert(s1.end(), 0);
VERIFY( s0 == s1 );
s0.insert(8);
s1.insert(s1.find(3), 8);
VERIFY( s0 == s1 );
s0.insert(9);
s1.insert(s1.end(), 9);
VERIFY( s0 == s1 );
s0.insert(10);
s1.insert(s1.begin(), 10);
VERIFY( s0 == s1 );
}
#if !__GXX_WEAK__ && _MT_ALLOCATOR_H
// Explicitly instantiate for systems with no COMDAT or weak support.
template class __gnu_cxx::__mt_alloc<std::_Rb_tree_node<int> >;
#endif
int main ()
{
test01();
return 0;
}
|
