blob: fc466b142fe2ec486b58cdf1567a14307fb93e35 [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// <map>
11
12// class map
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{
Howard Hinnant73d21a42010-09-04 23:28:19 +000024#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000025 {
26 typedef std::map<int, MoveOnly> M;
27 typedef std::pair<int, MoveOnly> P;
28 typedef M::iterator R;
29 M m;
30 R r = m.insert(m.end(), 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.end(), 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.end(), 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.end(), P(3, 3));
49 assert(r == prev(m.end()));
50 assert(m.size() == 3);
51 assert(r->first == 3);
52 assert(r->second == 3);
53 }
Howard Hinnant73d21a42010-09-04 23:28:19 +000054#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000055}