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
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <unordered_set>
|
|
|
|
|
|
|
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
|
|
|
// class Alloc = allocator<Value>>
|
|
|
|
// class unordered_set
|
|
|
|
|
|
|
|
// template <class... Args>
|
|
|
|
// iterator emplace_hint(const_iterator p, Args&&... args);
|
|
|
|
|
|
|
|
#include <unordered_set>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
#include "../../Emplaceable.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::unordered_set<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() == 2);
|
|
|
|
assert(*r == Emplaceable(5, 6));
|
|
|
|
}
|
2010-09-05 01:28:19 +02:00
|
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
2010-05-11 21:42:16 +02:00
|
|
|
}
|