4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
93 lines
3.2 KiB
C++
93 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_map>
|
|
|
|
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
|
// class Alloc = allocator<pair<const Key, T>>>
|
|
// class unordered_map
|
|
|
|
// template <class... Args>
|
|
// iterator emplace_hint(const_iterator p, Args&&... args);
|
|
|
|
#if _LIBCPP_DEBUG >= 1
|
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
|
#endif
|
|
|
|
#include <unordered_map>
|
|
#include <cassert>
|
|
|
|
#include "../../../Emplaceable.h"
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_map<int, Emplaceable> C;
|
|
typedef C::iterator R;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.emplace_hint(e, std::piecewise_construct, std::forward_as_tuple(3),
|
|
std::forward_as_tuple());
|
|
assert(c.size() == 1);
|
|
assert(r->first == 3);
|
|
assert(r->second == Emplaceable());
|
|
|
|
r = c.emplace_hint(c.end(), std::pair<const int, Emplaceable>(4, Emplaceable(5, 6)));
|
|
assert(c.size() == 2);
|
|
assert(r->first == 4);
|
|
assert(r->second == Emplaceable(5, 6));
|
|
|
|
r = c.emplace_hint(c.end(), std::piecewise_construct, std::forward_as_tuple(5),
|
|
std::forward_as_tuple(6, 7));
|
|
assert(c.size() == 3);
|
|
assert(r->first == 5);
|
|
assert(r->second == Emplaceable(6, 7));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_map<int, Emplaceable, std::hash<int>, std::equal_to<int>,
|
|
min_allocator<std::pair<const int, Emplaceable>>> C;
|
|
typedef C::iterator R;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.emplace_hint(e, std::piecewise_construct, std::forward_as_tuple(3),
|
|
std::forward_as_tuple());
|
|
assert(c.size() == 1);
|
|
assert(r->first == 3);
|
|
assert(r->second == Emplaceable());
|
|
|
|
r = c.emplace_hint(c.end(), std::pair<const int, Emplaceable>(4, Emplaceable(5, 6)));
|
|
assert(c.size() == 2);
|
|
assert(r->first == 4);
|
|
assert(r->second == Emplaceable(5, 6));
|
|
|
|
r = c.emplace_hint(c.end(), std::piecewise_construct, std::forward_as_tuple(5),
|
|
std::forward_as_tuple(6, 7));
|
|
assert(c.size() == 3);
|
|
assert(r->first == 5);
|
|
assert(r->second == Emplaceable(6, 7));
|
|
}
|
|
#endif
|
|
#if _LIBCPP_DEBUG >= 1
|
|
{
|
|
typedef std::unordered_map<int, Emplaceable> C;
|
|
typedef C::iterator R;
|
|
typedef C::value_type P;
|
|
C c;
|
|
C c2;
|
|
R r = c.emplace_hint(c2.end(), std::piecewise_construct,
|
|
std::forward_as_tuple(3),
|
|
std::forward_as_tuple());
|
|
assert(false);
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|