blob: 637d01ea8e9980a66d0dc3cdf173c76ea03abf28 [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <unordered_map>
11
12// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13// class Alloc = allocator<pair<const Key, T>>>
14// class unordered_multimap
15
16// template <class P,
17// class = typename enable_if<is_convertible<P, value_type>::value>::type>
18// iterator insert(P&& x);
19
20#include <unordered_map>
21#include <cassert>
22
23#include "../../../MoveOnly.h"
24
25int main()
26{
27 {
28 typedef std::unordered_multimap<double, int> C;
29 typedef C::iterator R;
30 typedef std::pair<double, short> P;
31 C c;
32 R r = c.insert(P(3.5, 3));
33 assert(c.size() == 1);
34 assert(r->first == 3.5);
35 assert(r->second == 3);
36
37 r = c.insert(P(3.5, 4));
38 assert(c.size() == 2);
39 assert(r->first == 3.5);
40 assert(r->second == 4);
41
42 r = c.insert(P(4.5, 4));
43 assert(c.size() == 3);
44 assert(r->first == 4.5);
45 assert(r->second == 4);
46
47 r = c.insert(P(5.5, 4));
48 assert(c.size() == 4);
49 assert(r->first == 5.5);
50 assert(r->second == 4);
51 }
Howard Hinnant73d21a42010-09-04 23:28:19 +000052#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000053 {
54 typedef std::unordered_multimap<MoveOnly, MoveOnly> C;
55 typedef C::iterator R;
56 typedef std::pair<MoveOnly, MoveOnly> P;
57 C c;
58 R r = c.insert(P(3, 3));
59 assert(c.size() == 1);
60 assert(r->first == 3);
61 assert(r->second == 3);
62
63 r = c.insert(P(3, 4));
64 assert(c.size() == 2);
65 assert(r->first == 3);
66 assert(r->second == 4);
67
68 r = c.insert(P(4, 4));
69 assert(c.size() == 3);
70 assert(r->first == 4);
71 assert(r->second == 4);
72
73 r = c.insert(P(5, 4));
74 assert(c.size() == 4);
75 assert(r->first == 5);
76 assert(r->second == 4);
77 }
Howard Hinnant73d21a42010-09-04 23:28:19 +000078#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000079}