b64f8b07c1
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@119395 91177308-0d34-0410-b5e6-96231b3b80d8
72 lines
1.8 KiB
C++
72 lines
1.8 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. 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_set
|
|
|
|
// iterator insert(const_iterator p, value_type&& x);
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
#include "../../MoveOnly.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::unordered_set<double> C;
|
|
typedef C::iterator R;
|
|
typedef double P;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.insert(e, P(3.5));
|
|
assert(c.size() == 1);
|
|
assert(*r == 3.5);
|
|
|
|
r = c.insert(r, P(3.5));
|
|
assert(c.size() == 1);
|
|
assert(*r == 3.5);
|
|
|
|
r = c.insert(e, P(4.5));
|
|
assert(c.size() == 2);
|
|
assert(*r == 4.5);
|
|
|
|
r = c.insert(e, P(5.5));
|
|
assert(c.size() == 3);
|
|
assert(*r == 5.5);
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_set<MoveOnly> C;
|
|
typedef C::iterator R;
|
|
typedef MoveOnly P;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.insert(e, P(3));
|
|
assert(c.size() == 1);
|
|
assert(*r == 3);
|
|
|
|
r = c.insert(r, P(3));
|
|
assert(c.size() == 1);
|
|
assert(*r == 3);
|
|
|
|
r = c.insert(e, P(4));
|
|
assert(c.size() == 2);
|
|
assert(*r == 4);
|
|
|
|
r = c.insert(e, P(5));
|
|
assert(c.size() == 3);
|
|
assert(*r == 5);
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|