1 // { dg-options "-std=gnu++11" }
2
3 // Copyright (C) 2010-2016 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 // range insert
21
22 #include <string>
23 #include <iterator>
24 #include <algorithm>
25 #include <unordered_set>
26 #include <testsuite_hooks.h>
27
28 namespace
29 {
30 template <typename _Tp>
31 std::size_t
get_nb_bucket_elems(const std::unordered_multiset<_Tp> & us)32 get_nb_bucket_elems(const std::unordered_multiset<_Tp>& us)
33 {
34 std::size_t nb = 0;
35 for (std::size_t b = 0; b != us.bucket_count(); ++b)
36 nb += us.bucket_size(b);
37 return nb;
38 }
39 }
40
test01()41 void test01()
42 {
43 bool test __attribute__((unused)) = true;
44
45 typedef std::unordered_multiset<std::string> Set;
46 Set s;
47 VERIFY(s.empty());
48
49 const int N = 10;
50 const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
51 "magenta", "yellow", "orange", "pink", "gray" };
52
53 s.insert(A + 0, A + N);
54 VERIFY( s.size() == static_cast<unsigned int>(N) );
55 VERIFY( std::distance(s.begin(), s.end()) - N == 0 );
56 VERIFY( get_nb_bucket_elems(s) - N == 0 );
57
58 for (int i = 0; i < N; ++i)
59 {
60 std::string str = A[i];
61 Set::iterator it = std::find(s.begin(), s.end(), str);
62 VERIFY(it != s.end());
63 }
64 }
65
test02()66 void test02()
67 {
68 bool test __attribute__((unused)) = true;
69
70 typedef std::unordered_multiset<int> Set;
71 Set s;
72 VERIFY(s.empty());
73
74 const int N = 8;
75 const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
76
77 s.insert(A+0, A+N);
78 VERIFY( s.size() == static_cast<unsigned int>(N) );
79 VERIFY( std::distance(s.begin(), s.end()) - N == 0 );
80 VERIFY( get_nb_bucket_elems(s) - N == 0 );
81
82 VERIFY( std::count(s.begin(), s.end(), 2) == 1 );
83 VERIFY( std::count(s.begin(), s.end(), 3) == 1 );
84 VERIFY( std::count(s.begin(), s.end(), 4) == 2 );
85 VERIFY( std::count(s.begin(), s.end(), 6) == 1 );
86 VERIFY( std::count(s.begin(), s.end(), 7) == 2 );
87 VERIFY( std::count(s.begin(), s.end(), 8) == 1 );
88 }
89
main()90 int main()
91 {
92 test01();
93 test02();
94 return 0;
95 }
96