libstdc++-v3/testsuite/tr1/6_containers/unordered/insert/multiset_single.cc

   1 // { dg-do run }
   2
   3 // 2005-2-17  Matt Austern  <austern@apple.com>
   4 //
   5 // Copyright (C) 2005 Free Software Foundation, Inc.
   6 //
   7 // This file is part of the GNU ISO C++ Library.  This library is free
   8 // software; you can redistribute it and/or modify it under the
   9 // terms of the GNU General Public License as published by the
  10 // Free Software Foundation; either version 2, or (at your option)
  11 // any later version.
  12 //
  13 // This library is distributed in the hope that it will be useful,
  14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 // GNU General Public License for more details.
  17 //
  18 // You should have received a copy of the GNU General Public License along
  19 // with this library; see the file COPYING.  If not, write to the Free
  20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  21 // USA.
  22
  23 // 6.3.4.5 unordered_multiset
  24 // Single-element insert
  25
  26 #include <string>
  27 #include <iterator>
  28 #include <tr1/unordered_set>
  29 #include "testsuite_hooks.h"
  30
  31 bool test __attribute__((unused)) = true;
  32
  33 void test01()
  34 {
  35   typedef std::tr1::unordered_multiset<std::string> Set;
  36   Set s;
  37   VERIFY(s.empty());
  38
  39   Set::iterator i = s.insert("abcde");
  40   VERIFY(s.size() == 1);
  41   VERIFY(std::distance(s.begin(), s.end()) == 1);
  42   VERIFY(i == s.begin());
  43   VERIFY(*i == "abcde");
  44 }
  45
  46 void test02()
  47 {
  48   typedef std::tr1::unordered_multiset<std::string> Set;
  49   Set s;
  50   VERIFY(s.empty());
  51
  52   s.insert("abcde");
  53   Set::iterator i = s.insert("abcde");
  54   VERIFY(s.size() == 2);
  55   VERIFY(std::distance(s.begin(), s.end()) == 2);
  56   VERIFY(*i == "abcde");
  57
  58   Set::iterator i2 = s.begin();
  59   ++i2;
  60   VERIFY(i == s.begin() || i == i2);
  61   VERIFY(*(s.begin()) == "abcde" && *i2 == "abcde");
  62 }
  63
  64 int main()
  65 {
  66   test01();
  67   test02();
  68   return 0;
  69 }