1 // { dg-options "-std=gnu++0x" }
3 // Copyright (C) 2010 Free Software Foundation, Inc.
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)
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.
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/>.
25 #include <unordered_set>
26 #include <testsuite_hooks.h>
30 bool test __attribute__((unused)) = true;
32 typedef std::unordered_multiset<std::string> Set;
37 const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
38 "magenta", "yellow", "orange", "pink", "gray" };
41 VERIFY(s.size() == static_cast<unsigned int>(N));
42 VERIFY(std::distance(s.begin(), s.end()) == N);
44 for (int i = 0; i < N; ++i) {
45 std::string str = A[i];
46 Set::iterator it = std::find(s.begin(), s.end(), str);
47 VERIFY(it != s.end());
53 bool test __attribute__((unused)) = true;
55 typedef std::unordered_multiset<int> Set;
60 const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
63 VERIFY(s.size() == static_cast<unsigned int>(N));
64 VERIFY(std::distance(s.begin(), s.end()) == N);
66 VERIFY(std::count(s.begin(), s.end(), 2) == 1);
67 VERIFY(std::count(s.begin(), s.end(), 3) == 1);
68 VERIFY(std::count(s.begin(), s.end(), 4) == 2);
69 VERIFY(std::count(s.begin(), s.end(), 6) == 1);
70 VERIFY(std::count(s.begin(), s.end(), 7) == 2);
71 VERIFY(std::count(s.begin(), s.end(), 8) == 1);