1// 2001-08-23 pme & Sylvain.Pion@sophia.inria.fr 2 3// Copyright (C) 2001, 2003, 2004, 2005, 2009 Free Software Foundation, Inc. 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 8// Free Software Foundation; either version 3, or (at your option) 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 17// with this library; see the file COPYING3. If not see 18// <http://www.gnu.org/licenses/>. 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 29void test01() 30{ 31 bool test __attribute__((unused)) = true; 32 typedef std::map<int, int> Map; 33 Map M; 34 Map::iterator hint; 35 36 hint = M.insert(Map::value_type(7, 0)).first; 37 38 M.insert(hint, Map::value_type(8, 1)); 39 M.insert(M.begin(), Map::value_type(9, 2)); 40 41#if 0 42 // The tree's __rb_verify() member must be exposed in map<> before this 43 // will even compile. It's good test to see that "missing" entries are 44 // in fact present in the {map,tree}, but in the wrong place. 45 if (0) 46 { 47 Map::iterator i = M.begin(); 48 while (i != M.end()) { 49 std::cerr << '(' << i->first << ',' << i->second << ")\n"; 50 ++i; 51 } 52 std::cerr << "tree internal verify: " 53 << std::boolalpha << M.__rb_verify() << "\n"; 54 } 55#endif 56 57 VERIFY ( M.find(7) != M.end() ); 58 VERIFY ( M.find(8) != M.end() ); 59 VERIFY ( M.find(9) != M.end() ); 60} 61 62int main() 63{ 64 test01(); 65 return 0; 66} 67 68