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
|
// 2001-08-23 pme & Sylvain.Pion@sophia.inria.fr
// Copyright (C) 2001, 2003, 2004, 2005, 2009 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/>.
// 23.3.1.2, table 69 -- map::insert(p,t)
#include <map>
#include <testsuite_hooks.h>
// { dg-do run }
// libstdc++/3349 and
// http://gcc.gnu.org/ml/gcc-patches/2001-08/msg01375.html
void test01()
{
bool test __attribute__((unused)) = true;
typedef std::map<int, int> Map;
Map M;
Map::iterator hint;
hint = M.insert(Map::value_type(7, 0)).first;
M.insert(hint, Map::value_type(8, 1));
M.insert(M.begin(), Map::value_type(9, 2));
#if 0
// The tree's __rb_verify() member must be exposed in map<> before this
// will even compile. It's good test to see that "missing" entries are
// in fact present in the {map,tree}, but in the wrong place.
if (0)
{
Map::iterator i = M.begin();
while (i != M.end()) {
std::cerr << '(' << i->first << ',' << i->second << ")\n";
++i;
}
std::cerr << "tree internal verify: "
<< std::boolalpha << M.__rb_verify() << "\n";
}
#endif
VERIFY ( M.find(7) != M.end() );
VERIFY ( M.find(8) != M.end() );
VERIFY ( M.find(9) != M.end() );
}
int main()
{
test01();
return 0;
}
|
