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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
// class Alloc = allocator<pair<const Key, T>>>
// class unordered_multimap
// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
#include <unordered_map>
#include <string>
#include <set>
#include <cassert>
#include <iterator>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef std::unordered_multimap<int, std::string> C;
typedef C::const_iterator I;
typedef std::pair<int, std::string> P;
P a[] =
{
P(10, "ten"),
P(20, "twenty"),
P(30, "thirty"),
P(40, "forty"),
P(50, "fifty"),
P(50, "fiftyA"),
P(50, "fiftyB"),
P(60, "sixty"),
P(70, "seventy"),
P(80, "eighty"),
};
const C c(std::begin(a), std::end(a));
std::pair<I, I> r = c.equal_range(30);
assert(std::distance(r.first, r.second) == 1);
assert(r.first->first == 30);
assert(r.first->second == "thirty");
r = c.equal_range(5);
assert(std::distance(r.first, r.second) == 0);
r = c.equal_range(50);
std::set<std::string> s;
s.insert("fifty");
s.insert("fiftyA");
s.insert("fiftyB");
for ( int i = 0; i < 3; ++i )
{
assert(r.first->first == 50);
assert(s.find(r.first->second) != s.end());
s.erase(s.find(r.first->second));
++r.first;
}
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, std::string>>> C;
typedef C::const_iterator I;
typedef std::pair<int, std::string> P;
P a[] =
{
P(10, "ten"),
P(20, "twenty"),
P(30, "thirty"),
P(40, "forty"),
P(50, "fifty"),
P(50, "fiftyA"),
P(50, "fiftyB"),
P(60, "sixty"),
P(70, "seventy"),
P(80, "eighty"),
};
const C c(std::begin(a), std::end(a));
std::pair<I, I> r = c.equal_range(30);
assert(std::distance(r.first, r.second) == 1);
assert(r.first->first == 30);
assert(r.first->second == "thirty");
r = c.equal_range(5);
assert(std::distance(r.first, r.second) == 0);
r = c.equal_range(50);
std::set<std::string> s;
s.insert("fifty");
s.insert("fiftyA");
s.insert("fiftyB");
for ( int i = 0; i < 3; ++i )
{
assert(r.first->first == 50);
assert(s.find(r.first->second) != s.end());
s.erase(s.find(r.first->second));
++r.first;
}
}
#endif
return 0;
}
|
