libstdc++-v3/testsuite/tr1/6_containers/unordered_set/insert/24061-set.cc

   1 // 2005-10-08  Paolo Carlini  <pcarlini@suse.de>
   2 //
   3 // Copyright (C) 2005-2014 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 // 6.3.4.3  Class template unordered_set
  21
  22 #include <tr1/unordered_set>
  23 #include <string>
  24 #include <testsuite_hooks.h>
  25
  26 // libstdc++/24061
  27 void test01()
  28 {
  29   bool test __attribute__((unused)) = true;
  30
  31   typedef std::tr1::unordered_set<std::string> Set;
  32   typedef Set::iterator       iterator;
  33   typedef Set::const_iterator const_iterator;
  34
  35   Set s1;
  36
  37   iterator it1 = s1.insert(s1.begin(), "all the love in the world");
  38   VERIFY( s1.size() == 1 );
  39   VERIFY( *it1 == "all the love in the world" );
  40
  41   const_iterator cit1(it1);
  42   const_iterator cit2 = s1.insert(cit1, "you know what you are?");
  43   VERIFY( s1.size() == 2 );
  44   VERIFY( cit2 != cit1 );
  45   VERIFY( *cit2 == "you know what you are?" );
  46
  47   iterator it2 = s1.insert(it1, "all the love in the world");
  48   VERIFY( s1.size() == 2 );
  49   VERIFY( it2 == it1 );
  50   VERIFY( *it2 == "all the love in the world" );
  51 }
  52
  53 int main()
  54 {
  55   test01();
  56   return 0;
  57 }