]>
Commit | Line | Data |
---|---|---|
e3a2daf6 | 1 | // 2001-08-23 pme & Sylvain.Pion@sophia.inria.fr |
2 | ||
fbd26352 | 3 | // Copyright (C) 2001-2019 Free Software Foundation, Inc. |
e3a2daf6 | 4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free | |
6 | // software; you can redistribute it and/or modify it under the | |
7 | // terms of the GNU General Public License as published by the | |
6bc9506f | 8 | // Free Software Foundation; either version 3, or (at your option) |
e3a2daf6 | 9 | // any later version. |
10 | ||
11 | // This library is distributed in the hope that it will be useful, | |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | // GNU General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License along | |
6bc9506f | 17 | // with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
e3a2daf6 | 19 | |
20 | // 23.3.1.2, table 69 -- map::insert(p,t) | |
21 | ||
22 | #include <map> | |
23 | #include <testsuite_hooks.h> | |
24 | ||
25 | // { dg-do run } | |
26 | ||
27 | // libstdc++/3349 and | |
28 | // http://gcc.gnu.org/ml/gcc-patches/2001-08/msg01375.html | |
29 | void test01() | |
30 | { | |
31 | typedef std::map<int, int> Map; | |
32 | Map M; | |
33 | Map::iterator hint; | |
34 | ||
35 | hint = M.insert(Map::value_type(7, 0)).first; | |
36 | ||
37 | M.insert(hint, Map::value_type(8, 1)); | |
38 | M.insert(M.begin(), Map::value_type(9, 2)); | |
39 | ||
40 | #if 0 | |
41 | // The tree's __rb_verify() member must be exposed in map<> before this | |
42 | // will even compile. It's good test to see that "missing" entries are | |
43 | // in fact present in the {map,tree}, but in the wrong place. | |
44 | if (0) | |
45 | { | |
46 | Map::iterator i = M.begin(); | |
47 | while (i != M.end()) { | |
48 | std::cerr << '(' << i->first << ',' << i->second << ")\n"; | |
49 | ++i; | |
50 | } | |
51 | std::cerr << "tree internal verify: " | |
52 | << std::boolalpha << M.__rb_verify() << "\n"; | |
53 | } | |
54 | #endif | |
55 | ||
56 | VERIFY ( M.find(7) != M.end() ); | |
57 | VERIFY ( M.find(8) != M.end() ); | |
58 | VERIFY ( M.find(9) != M.end() ); | |
59 | } | |
60 | ||
e3a2daf6 | 61 | int main() |
62 | { | |
63 | test01(); | |
e3a2daf6 | 64 | return 0; |
65 | } | |
66 |