| //===----------------------------------------------------------------------===// |
| // |
| // 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); |
| |
| #include <unordered_map> |
| #include <cassert> |
| |
| #include "../../../Emplaceable.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, 3); |
| assert(c.size() == 1); |
| assert(r->first == 3); |
| assert(r->second == Emplaceable()); |
| |
| r = c.emplace_hint(e, 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(e, 5, 6, 7); |
| assert(c.size() == 3); |
| assert(r->first == 5); |
| assert(r->second == Emplaceable(6, 7)); |
| } |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| } |