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
123 lines
3.2 KiB
C++
123 lines
3.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_multiset
|
|
|
|
// iterator insert(const_iterator p, value_type&& x);
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
#include "../../MoveOnly.h"
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::unordered_multiset<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() == 2);
|
|
assert(*r == 3.5);
|
|
|
|
r = c.insert(c.end(), P(4.5));
|
|
assert(c.size() == 3);
|
|
assert(*r == 4.5);
|
|
|
|
r = c.insert(c.end(), P(5.5));
|
|
assert(c.size() == 4);
|
|
assert(*r == 5.5);
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_multiset<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() == 2);
|
|
assert(*r == 3);
|
|
|
|
r = c.insert(c.end(), P(4));
|
|
assert(c.size() == 3);
|
|
assert(*r == 4);
|
|
|
|
r = c.insert(c.end(), P(5));
|
|
assert(c.size() == 4);
|
|
assert(*r == 5);
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_multiset<double, std::hash<double>,
|
|
std::equal_to<double>, min_allocator<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() == 2);
|
|
assert(*r == 3.5);
|
|
|
|
r = c.insert(c.end(), P(4.5));
|
|
assert(c.size() == 3);
|
|
assert(*r == 4.5);
|
|
|
|
r = c.insert(c.end(), P(5.5));
|
|
assert(c.size() == 4);
|
|
assert(*r == 5.5);
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_multiset<MoveOnly, std::hash<MoveOnly>,
|
|
std::equal_to<MoveOnly>, min_allocator<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() == 2);
|
|
assert(*r == 3);
|
|
|
|
r = c.insert(c.end(), P(4));
|
|
assert(c.size() == 3);
|
|
assert(*r == 4);
|
|
|
|
r = c.insert(c.end(), P(5));
|
|
assert(c.size() == 4);
|
|
assert(*r == 5);
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
#endif
|
|
}
|