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

   1 // 2005-01-17  Paolo Carlini  <pcarlini@suse.de>
   2
   3 // Copyright (C) 2005 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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  19 // USA.
  20 //
  21 // As a special exception, you may use this file as part of a free software
  22 // library without restriction.  Specifically, if other files instantiate
  23 // templates or use macros or inline functions from this file, or you compile
  24 // this file and link it with other files to produce an executable, this
  25 // file does not by itself cause the resulting executable to be covered by
  26 // the GNU General Public License.  This exception does not however
  27 // invalidate any other reasons why the executable file might be covered by
  28 // the GNU General Public License.
  29
  30 #include <set>
  31 #include <testsuite_hooks.h>
  32
  33 // A few tests for insert with hint, in the occasion of libstdc++/19422
  34 // and libstdc++/19433.
  35 void test01()
  36 {
  37   bool test __attribute__((unused)) = true;
  38   using namespace std;
  39
  40   set<int> s0, s1;
  41   set<int>::iterator iter1;
  42
  43   s0.insert(1);
  44   s1.insert(s1.end(), 1);
  45   VERIFY( s0 == s1 );
  46
  47   s0.insert(3);
  48   s1.insert(s1.begin(), 3);
  49   VERIFY( s0 == s1 );
  50
  51   s0.insert(4);
  52   iter1 = s1.insert(s1.end(), 4);
  53   VERIFY( s0 == s1 );
  54
  55   s0.insert(6);
  56   s1.insert(iter1, 6);
  57   VERIFY( s0 == s1 );
  58
  59   s0.insert(2);
  60   s1.insert(s1.begin(), 2);
  61   VERIFY( s0 == s1 );
  62
  63   s0.insert(7);
  64   s1.insert(s1.end(), 7);
  65   VERIFY( s0 == s1 );
  66
  67   s0.insert(5);
  68   s1.insert(s1.find(4), 5);
  69   VERIFY( s0 == s1 );
  70
  71   s0.insert(0);
  72   s1.insert(s1.end(), 0);
  73   VERIFY( s0 == s1 );
  74
  75   s0.insert(8);
  76   s1.insert(s1.find(3), 8);
  77   VERIFY( s0 == s1 );
  78
  79   s0.insert(9);
  80   s1.insert(s1.end(), 9);
  81   VERIFY( s0 == s1 );
  82
  83   s0.insert(10);
  84   s1.insert(s1.begin(), 10);
  85   VERIFY( s0 == s1 );
  86 }
  87
  88 int main ()
  89 {
  90   test01();
  91   return 0;
  92 }