83 lines
2.5 KiB
C++
83 lines
2.5 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... Args>
|
|||
|
|
// iterator emplace_hint(const_iterator position, Args&&... args);
|
|||
|
|
|
|||
|
|
#include <map>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
#include "../../../Emplaceable.h"
|
|||
|
|
#include "../../../DefaultOnly.h"
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
{
|
|||
|
|
typedef std::map<int, DefaultOnly> M;
|
|||
|
|
typedef M::iterator R;
|
|||
|
|
M m;
|
|||
|
|
assert(DefaultOnly::count == 0);
|
|||
|
|
R r = m.emplace_hint(m.end());
|
|||
|
|
assert(r == m.begin());
|
|||
|
|
assert(m.size() == 1);
|
|||
|
|
assert(m.begin()->first == 0);
|
|||
|
|
assert(m.begin()->second == DefaultOnly());
|
|||
|
|
assert(DefaultOnly::count == 1);
|
|||
|
|
r = m.emplace_hint(m.end(), 1);
|
|||
|
|
assert(r == next(m.begin()));
|
|||
|
|
assert(m.size() == 2);
|
|||
|
|
assert(next(m.begin())->first == 1);
|
|||
|
|
assert(next(m.begin())->second == DefaultOnly());
|
|||
|
|
assert(DefaultOnly::count == 2);
|
|||
|
|
r = m.emplace_hint(m.end(), 1);
|
|||
|
|
assert(r == next(m.begin()));
|
|||
|
|
assert(m.size() == 2);
|
|||
|
|
assert(next(m.begin())->first == 1);
|
|||
|
|
assert(next(m.begin())->second == DefaultOnly());
|
|||
|
|
assert(DefaultOnly::count == 2);
|
|||
|
|
}
|
|||
|
|
assert(DefaultOnly::count == 0);
|
|||
|
|
{
|
|||
|
|
typedef std::map<int, Emplaceable> M;
|
|||
|
|
typedef M::iterator R;
|
|||
|
|
M m;
|
|||
|
|
R r = m.emplace_hint(m.end(), 2);
|
|||
|
|
assert(r == m.begin());
|
|||
|
|
assert(m.size() == 1);
|
|||
|
|
assert(m.begin()->first == 2);
|
|||
|
|
assert(m.begin()->second == Emplaceable());
|
|||
|
|
r = m.emplace_hint(m.end(), 1, 2, 3.5);
|
|||
|
|
assert(r == m.begin());
|
|||
|
|
assert(m.size() == 2);
|
|||
|
|
assert(m.begin()->first == 1);
|
|||
|
|
assert(m.begin()->second == Emplaceable(2, 3.5));
|
|||
|
|
r = m.emplace_hint(m.end(), 1, 2, 3.5);
|
|||
|
|
assert(r == m.begin());
|
|||
|
|
assert(m.size() == 2);
|
|||
|
|
assert(m.begin()->first == 1);
|
|||
|
|
assert(m.begin()->second == Emplaceable(2, 3.5));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
typedef std::map<int, double> M;
|
|||
|
|
typedef M::iterator R;
|
|||
|
|
M m;
|
|||
|
|
R r = m.emplace_hint(m.end(), M::value_type(2, 3.5));
|
|||
|
|
assert(r == m.begin());
|
|||
|
|
assert(m.size() == 1);
|
|||
|
|
assert(m.begin()->first == 2);
|
|||
|
|
assert(m.begin()->second == 3.5);
|
|||
|
|
}
|
|||
|
|
#endif
|
|||
|
|
}
|