2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
2010-11-16 23:09:02 +01:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <map>
|
|
|
|
|
|
|
|
// class map
|
|
|
|
|
|
|
|
// template <class P>
|
|
|
|
// iterator insert(const_iterator position, P&& p);
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
#include "../../../MoveOnly.h"
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
2010-09-05 01:28:19 +02:00
|
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
2010-05-11 21:42:16 +02:00
|
|
|
{
|
|
|
|
typedef std::map<int, MoveOnly> M;
|
|
|
|
typedef std::pair<int, MoveOnly> P;
|
|
|
|
typedef M::iterator R;
|
|
|
|
M m;
|
|
|
|
R r = m.insert(m.end(), P(2, 2));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 1);
|
|
|
|
assert(r->first == 2);
|
|
|
|
assert(r->second == 2);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), P(1, 1));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 2);
|
|
|
|
assert(r->first == 1);
|
|
|
|
assert(r->second == 1);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), P(3, 3));
|
|
|
|
assert(r == prev(m.end()));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 3);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), P(3, 3));
|
|
|
|
assert(r == prev(m.end()));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 3);
|
|
|
|
}
|
2010-09-05 01:28:19 +02:00
|
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
2010-05-11 21:42:16 +02:00
|
|
|
}
|