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
|
//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <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
// template <class P,
// class = typename enable_if<is_convertible<P, value_type>::value>::type>
// iterator insert(P&& x);
#include <unordered_map>
#include <cassert>
#include "../../../MoveOnly.h"
int main()
{
{
typedef std::unordered_multimap<double, int> C;
typedef C::iterator R;
typedef std::pair<double, short> P;
C c;
R r = c.insert(P(3.5, 3));
assert(c.size() == 1);
assert(r->first == 3.5);
assert(r->second == 3);
r = c.insert(P(3.5, 4));
assert(c.size() == 2);
assert(r->first == 3.5);
assert(r->second == 4);
r = c.insert(P(4.5, 4));
assert(c.size() == 3);
assert(r->first == 4.5);
assert(r->second == 4);
r = c.insert(P(5.5, 4));
assert(c.size() == 4);
assert(r->first == 5.5);
assert(r->second == 4);
}
#ifdef _LIBCPP_MOVE
{
typedef std::unordered_multimap<MoveOnly, MoveOnly> C;
typedef C::iterator R;
typedef std::pair<MoveOnly, MoveOnly> P;
C c;
R r = c.insert(P(3, 3));
assert(c.size() == 1);
assert(r->first == 3);
assert(r->second == 3);
r = c.insert(P(3, 4));
assert(c.size() == 2);
assert(r->first == 3);
assert(r->second == 4);
r = c.insert(P(4, 4));
assert(c.size() == 3);
assert(r->first == 4);
assert(r->second == 4);
r = c.insert(P(5, 4));
assert(c.size() == 4);
assert(r->first == 5);
assert(r->second == 4);
}
#endif
}
|
