]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/testsuite/tr1/6_containers/unordered_multiset/insert/multiset_single.cc
re PR tree-optimization/70803 (gcc.dg/vect/pr56625.c FAILs)
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / tr1 / 6_containers / unordered_multiset / insert / multiset_single.cc
CommitLineData
180ecd6a
MA
1// { dg-do run }
2
3// 2005-2-17 Matt Austern <austern@apple.com>
4//
818ab71a 5// Copyright (C) 2005-2016 Free Software Foundation, Inc.
180ecd6a
MA
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
748086b7 10// Free Software Foundation; either version 3, or (at your option)
180ecd6a
MA
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
748086b7
JJ
19// with this library; see the file COPYING3. If not see
20// <http://www.gnu.org/licenses/>.
180ecd6a
MA
21
22// 6.3.4.5 unordered_multiset
23// Single-element insert
24
25#include <string>
26#include <iterator>
27#include <tr1/unordered_set>
28#include "testsuite_hooks.h"
29
30bool test __attribute__((unused)) = true;
31
32void test01()
33{
34 typedef std::tr1::unordered_multiset<std::string> Set;
35 Set s;
36 VERIFY(s.empty());
37
38 Set::iterator i = s.insert("abcde");
39 VERIFY(s.size() == 1);
40 VERIFY(std::distance(s.begin(), s.end()) == 1);
41 VERIFY(i == s.begin());
42 VERIFY(*i == "abcde");
43}
44
45void test02()
46{
47 typedef std::tr1::unordered_multiset<std::string> Set;
48 Set s;
49 VERIFY(s.empty());
50
51 s.insert("abcde");
52 Set::iterator i = s.insert("abcde");
53 VERIFY(s.size() == 2);
54 VERIFY(std::distance(s.begin(), s.end()) == 2);
55 VERIFY(*i == "abcde");
56
57 Set::iterator i2 = s.begin();
58 ++i2;
59 VERIFY(i == s.begin() || i == i2);
60 VERIFY(*(s.begin()) == "abcde" && *i2 == "abcde");
61}
62
63int main()
64{
65 test01();
66 test02();
67 return 0;
68}