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 // <map>
11 
12 // class multimap
13 
14 // template <class P>
15 //   iterator insert(P&& p);
16 
17 #include <map>
18 #include <cassert>
19 
20 #include "MoveOnly.h"
21 #include "min_allocator.h"
22 #include "test_macros.h"
23 
24 int main()
25 {
26 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
27     {
28         typedef std::multimap<int, MoveOnly> M;
29         typedef M::iterator R;
30         M m;
31         R r = m.insert(M::value_type(2, 2));
32         assert(r == m.begin());
33         assert(m.size() == 1);
34         assert(r->first == 2);
35         assert(r->second == 2);
36 
37         r = m.insert(M::value_type(1, 1));
38         assert(r == m.begin());
39         assert(m.size() == 2);
40         assert(r->first == 1);
41         assert(r->second == 1);
42 
43         r = m.insert(M::value_type(3, 3));
44         assert(r == prev(m.end()));
45         assert(m.size() == 3);
46         assert(r->first == 3);
47         assert(r->second == 3);
48 
49         r = m.insert(M::value_type(3, 3));
50         assert(r == prev(m.end()));
51         assert(m.size() == 4);
52         assert(r->first == 3);
53         assert(r->second == 3);
54     }
55 #if TEST_STD_VER >= 11
56     {
57         typedef std::multimap<int, MoveOnly, std::less<int>, min_allocator<std::pair<const int, MoveOnly>>> M;
58         typedef M::iterator R;
59         M m;
60         R r = m.insert(M::value_type(2, 2));
61         assert(r == m.begin());
62         assert(m.size() == 1);
63         assert(r->first == 2);
64         assert(r->second == 2);
65 
66         r = m.insert(M::value_type(1, 1));
67         assert(r == m.begin());
68         assert(m.size() == 2);
69         assert(r->first == 1);
70         assert(r->second == 1);
71 
72         r = m.insert(M::value_type(3, 3));
73         assert(r == prev(m.end()));
74         assert(m.size() == 3);
75         assert(r->first == 3);
76         assert(r->second == 3);
77 
78         r = m.insert(M::value_type(3, 3));
79         assert(r == prev(m.end()));
80         assert(m.size() == 4);
81         assert(r->first == 3);
82         assert(r->second == 3);
83     }
84 #endif
85 #if TEST_STD_VER > 14
86     {
87         typedef std::multimap<int, MoveOnly> M;
88         typedef M::iterator R;
89         M m;
90         R r = m.insert({2, MoveOnly(2)});
91         assert(r == m.begin());
92         assert(m.size() == 1);
93         assert(r->first == 2);
94         assert(r->second == 2);
95 
96         r = m.insert({1, MoveOnly(1)});
97         assert(r == m.begin());
98         assert(m.size() == 2);
99         assert(r->first == 1);
100         assert(r->second == 1);
101 
102         r = m.insert({3, MoveOnly(3)});
103         assert(r == prev(m.end()));
104         assert(m.size() == 3);
105         assert(r->first == 3);
106         assert(r->second == 3);
107 
108         r = m.insert({3, MoveOnly(3)});
109         assert(r == prev(m.end()));
110         assert(m.size() == 4);
111         assert(r->first == 3);
112         assert(r->second == 3);
113     }
114 #endif
115 #endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
116 }
117