blob: 1393f54201116ac172d96acb71ae5f744cac2be6 [file] [log] [blame]
//===----------------------------------------------------------------------===//
//
// 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, const value_type& x);
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
#include <unordered_set>
#include <cassert>
#include "min_allocator.h"
int main()
{
{
typedef std::unordered_set<double> C;
typedef C::iterator R;
typedef C::value_type 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(e, 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);
}
#if __cplusplus >= 201103L
{
typedef std::unordered_set<double, std::hash<double>,
std::equal_to<double>, min_allocator<double>> C;
typedef C::iterator R;
typedef C::value_type 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(e, 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);
}
#endif
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_set<double> C;
typedef C::iterator R;
typedef C::value_type P;
C c;
C c2;
C::const_iterator e = c2.end();
P v(3.5);
R r = c.insert(e, v);
assert(false);
}
#endif
}