1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
// { dg-do run }
// 2005-2-17 Matt Austern <austern@apple.com>
//
// Copyright (C) 2005-2019 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 6.3.4.5 unordered_multiset
// range insert
#include <string>
#include <iterator>
#include <algorithm>
#include <tr1/unordered_set>
#include <testsuite_hooks.h>
void test01()
{
typedef std::tr1::unordered_multiset<std::string> Set;
Set s;
VERIFY(s.empty());
const int N = 10;
const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
"magenta", "yellow", "orange", "pink", "gray" };
s.insert(A+0, A+N);
VERIFY(s.size() == static_cast<unsigned int>(N));
VERIFY(std::distance(s.begin(), s.end()) == N);
for (int i = 0; i < N; ++i) {
std::string str = A[i];
Set::iterator it = std::find(s.begin(), s.end(), str);
VERIFY(it != s.end());
}
}
void test02()
{
typedef std::tr1::unordered_multiset<int> Set;
Set s;
VERIFY(s.empty());
const int N = 8;
const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
s.insert(A+0, A+N);
VERIFY(s.size() == static_cast<unsigned int>(N));
VERIFY(std::distance(s.begin(), s.end()) == N);
VERIFY(std::count(s.begin(), s.end(), 2) == 1);
VERIFY(std::count(s.begin(), s.end(), 3) == 1);
VERIFY(std::count(s.begin(), s.end(), 4) == 2);
VERIFY(std::count(s.begin(), s.end(), 6) == 1);
VERIFY(std::count(s.begin(), s.end(), 7) == 2);
VERIFY(std::count(s.begin(), s.end(), 8) == 1);
}
int main()
{
test01();
test02();
return 0;
}
|
