f5256e16df
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103516 91177308-0d34-0410-b5e6-96231b3b80d8
46 lines
1.2 KiB
C++
46 lines
1.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <unordered_set>
|
|
|
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
|
// class Alloc = allocator<Value>>
|
|
// class unordered_multiset
|
|
|
|
// template <class... Args>
|
|
// iterator emplace_hint(const_iterator p, Args&&... args);
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
#include "../../Emplaceable.h"
|
|
|
|
int main()
|
|
{
|
|
#ifdef _LIBCPP_MOVE
|
|
{
|
|
typedef std::unordered_multiset<Emplaceable> C;
|
|
typedef C::iterator R;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.emplace_hint(e);
|
|
assert(c.size() == 1);
|
|
assert(*r == Emplaceable());
|
|
|
|
r = c.emplace_hint(e, Emplaceable(5, 6));
|
|
assert(c.size() == 2);
|
|
assert(*r == Emplaceable(5, 6));
|
|
|
|
r = c.emplace_hint(r, 5, 6);
|
|
assert(c.size() == 3);
|
|
assert(*r == Emplaceable(5, 6));
|
|
}
|
|
#endif
|
|
}
|