insert_iter_rv.pass.cpp revision 6046aced820aaab4f14f2026531dd11d10690691 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <map>
11
12// class multimap
13
14// template <class P>
15//     iterator insert(const_iterator position, P&& p);
16
17#include <map>
18#include <cassert>
19
20#include "../../../MoveOnly.h"
21
22int main()
23{
24#ifdef _LIBCPP_MOVE
25    {
26        typedef std::multimap<int, MoveOnly> M;
27        typedef std::pair<int, MoveOnly> P;
28        typedef M::iterator R;
29        M m;
30        R r = m.insert(m.cend(), P(2, 2));
31        assert(r == m.begin());
32        assert(m.size() == 1);
33        assert(r->first == 2);
34        assert(r->second == 2);
35
36        r = m.insert(m.cend(), P(1, 1));
37        assert(r == m.begin());
38        assert(m.size() == 2);
39        assert(r->first == 1);
40        assert(r->second == 1);
41
42        r = m.insert(m.cend(), P(3, 3));
43        assert(r == prev(m.end()));
44        assert(m.size() == 3);
45        assert(r->first == 3);
46        assert(r->second == 3);
47
48        r = m.insert(m.cend(), P(3, 2));
49        assert(r == prev(m.end()));
50        assert(m.size() == 4);
51        assert(r->first == 3);
52        assert(r->second == 2);
53    }
54#endif  // _LIBCPP_MOVE
55}
56