1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
14 // iterator insert(const_iterator position, value_type&& v);
20 #include "min_allocator.h"
24 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
26 typedef std::set<MoveOnly> M;
27 typedef M::iterator R;
29 R r = m.insert(m.cend(), M::value_type(2));
30 assert(r == m.begin());
31 assert(m.size() == 1);
34 r = m.insert(m.cend(), M::value_type(1));
35 assert(r == m.begin());
36 assert(m.size() == 2);
39 r = m.insert(m.cend(), M::value_type(3));
40 assert(r == prev(m.end()));
41 assert(m.size() == 3);
44 r = m.insert(m.cend(), M::value_type(3));
45 assert(r == prev(m.end()));
46 assert(m.size() == 3);
49 #if TEST_STD_VER >= 11
51 typedef std::set<MoveOnly, std::less<MoveOnly>, min_allocator<MoveOnly>> M;
52 typedef M::iterator R;
54 R r = m.insert(m.cend(), M::value_type(2));
55 assert(r == m.begin());
56 assert(m.size() == 1);
59 r = m.insert(m.cend(), M::value_type(1));
60 assert(r == m.begin());
61 assert(m.size() == 2);
64 r = m.insert(m.cend(), M::value_type(3));
65 assert(r == prev(m.end()));
66 assert(m.size() == 3);
69 r = m.insert(m.cend(), M::value_type(3));
70 assert(r == prev(m.end()));
71 assert(m.size() == 3);
75 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES