39213641f4
unordered_set, however it is not complete yet for unordered_multiset, unordered_map or unordered_multimap. There has been a lot of work done for these other three containers, however that work was done just to keep all of the tests passing. You can try this out with -D_LIBCPP_DEBUG2. You will have to link to a libc++.dylib that has been compiled with src/debug.cpp. So far, vector (but not vector<bool>), list, and unordered_set are treated. I hope to get the other three unordered containers up fairly quickly now that unordered_set is done. The flag _LIBCPP_DEBUG2 will eventually be changed to _LIBCPP_DEBUG, but not today. This is my second effort at getting debug mode going for libc++, and I'm not quite yet ready to throw all of the work under the first attempt away. The basic design is that all of the debug information is kept in a central database, instead of in the containers. This has been done as an attempt to have debug mode and non-debug mode be ABI compatible with each other. There are some circumstances where if you construct a container in an environment without debug mode and pass it into debug mode, the checking will get confused and let you know with a readable error message. Passing containers the other way: from debug mode out to a non-debugging mode container should be 100% safe (at least that is the goal). git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@186991 91177308-0d34-0410-b5e6-96231b3b80d8
81 lines
2.2 KiB
C++
81 lines
2.2 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
|
|
|
|
// template <class... Args>
|
|
// iterator emplace_hint(const_iterator p, Args&&... args);
|
|
|
|
#if _LIBCPP_DEBUG2 >= 1
|
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
|
#endif
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
#include "../../Emplaceable.h"
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
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));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_set<Emplaceable, std::hash<Emplaceable>,
|
|
std::equal_to<Emplaceable>, min_allocator<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));
|
|
}
|
|
#endif
|
|
#if _LIBCPP_DEBUG2 >= 1
|
|
{
|
|
typedef std::unordered_set<Emplaceable> C;
|
|
typedef C::iterator R;
|
|
C c1;
|
|
C c2;
|
|
R r = c1.emplace_hint(c2.begin(), 5, 6);
|
|
assert(false);
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|