libstdc++-v3/testsuite/23_containers/map/insert/1.cc

   1 // 2001-08-23 pme & Sylvain.Pion@sophia.inria.fr
   2
   3 // Copyright (C) 2001, 2003 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 2, 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 COPYING.  If not, write to the Free
  18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  19 // USA.
  20
  21 // 23.3.1.2, table 69 -- map::insert(p,t)
  22
  23 #include <map>
  24 #include <testsuite_hooks.h>
  25
  26 // { dg-do run }
  27
  28 // libstdc++/3349 and
  29 // http://gcc.gnu.org/ml/gcc-patches/2001-08/msg01375.html
  30 void test01()
  31 {
  32   bool test __attribute__((unused)) = true;
  33   typedef std::map<int, int>   Map;
  34   Map             M;
  35   Map::iterator   hint;
  36
  37   hint = M.insert(Map::value_type(7, 0)).first;
  38
  39   M.insert(hint, Map::value_type(8, 1));
  40   M.insert(M.begin(), Map::value_type(9, 2));
  41
  42 #if 0
  43   // The tree's __rb_verify() member must be exposed in map<> before this
  44   // will even compile.  It's good test to see that "missing" entries are
  45   // in fact present in the {map,tree}, but in the wrong place.
  46   if (0)
  47   {
  48       Map::iterator  i = M.begin();
  49       while (i != M.end()) {
  50           std::cerr << '(' << i->first << ',' << i->second << ")\n";
  51           ++i;
  52       }
  53       std::cerr << "tree internal verify: "
  54                 << std::boolalpha << M.__rb_verify() << "\n";
  55   }
  56 #endif
  57
  58   VERIFY ( M.find(7) != M.end() );
  59   VERIFY ( M.find(8) != M.end() );
  60   VERIFY ( M.find(9) != M.end() );
  61 }
  62
  63
  64 int main()
  65 {
  66   test01();
  67
  68   return 0;
  69 }
  70