56 lines
1.3 KiB
C++
56 lines
1.3 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <map>
|
|||
|
|
|
|||
|
|
// class map
|
|||
|
|
|
|||
|
|
// template <class P>
|
|||
|
|
// iterator insert(const_iterator position, P&& p);
|
|||
|
|
|
|||
|
|
#include <map>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
#include "../../../MoveOnly.h"
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
{
|
|||
|
|
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);
|
|||
|
|
}
|
|||
|
|
#endif
|
|||
|
|
}
|