1 //===----------------------------------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. 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 // iterator insert(const value_type& x);
17
18 #include <unordered_map>
19 #include <cassert>
20
21 #include "min_allocator.h"
22
main()23 int main()
24 {
25 {
26 typedef std::unordered_multimap<double, int> C;
27 typedef C::iterator R;
28 typedef C::value_type P;
29 C c;
30 R r = c.insert(P(3.5, 3));
31 assert(c.size() == 1);
32 assert(r->first == 3.5);
33 assert(r->second == 3);
34
35 r = c.insert(P(3.5, 4));
36 assert(c.size() == 2);
37 assert(r->first == 3.5);
38 assert(r->second == 4);
39
40 r = c.insert(P(4.5, 4));
41 assert(c.size() == 3);
42 assert(r->first == 4.5);
43 assert(r->second == 4);
44
45 r = c.insert(P(5.5, 4));
46 assert(c.size() == 4);
47 assert(r->first == 5.5);
48 assert(r->second == 4);
49 }
50 #if __cplusplus >= 201103L
51 {
52 typedef std::unordered_multimap<double, int, std::hash<double>, std::equal_to<double>,
53 min_allocator<std::pair<const double, int>>> C;
54 typedef C::iterator R;
55 typedef C::value_type P;
56 C c;
57 R r = c.insert(P(3.5, 3));
58 assert(c.size() == 1);
59 assert(r->first == 3.5);
60 assert(r->second == 3);
61
62 r = c.insert(P(3.5, 4));
63 assert(c.size() == 2);
64 assert(r->first == 3.5);
65 assert(r->second == 4);
66
67 r = c.insert(P(4.5, 4));
68 assert(c.size() == 3);
69 assert(r->first == 4.5);
70 assert(r->second == 4);
71
72 r = c.insert(P(5.5, 4));
73 assert(c.size() == 4);
74 assert(r->first == 5.5);
75 assert(r->second == 4);
76 }
77 #endif
78 }
79