1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_map> 11 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 13 // class Alloc = allocator<pair<const Key, T>>> 14 // class unordered_multimap 15 16 // template <class... Args> 17 // iterator emplace_hint(const_iterator p, Args&&... args); 18 19 #include <unordered_map> 20 #include <cassert> 21 22 #include "../../../Emplaceable.h" 23 24 int main() 25 { 26 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 27 { 28 typedef std::unordered_multimap<int, Emplaceable> C; 29 typedef C::iterator R; 30 C c; 31 C::const_iterator e = c.end(); 32 R r = c.emplace_hint(e, 3); 33 assert(c.size() == 1); 34 assert(r->first == 3); 35 assert(r->second == Emplaceable()); 36 37 r = c.emplace_hint(e, std::pair<const int, Emplaceable>(3, Emplaceable(5, 6))); 38 assert(c.size() == 2); 39 assert(r->first == 3); 40 assert(r->second == Emplaceable(5, 6)); 41 assert(r == next(c.begin())); 42 43 r = c.emplace_hint(r, std::piecewise_construct, std::forward_as_tuple(3), 44 std::forward_as_tuple(6, 7)); 45 assert(c.size() == 3); 46 assert(r->first == 3); 47 assert(r->second == Emplaceable(6, 7)); 48 assert(r == next(c.begin())); 49 r = c.begin(); 50 assert(r->first == 3); 51 assert(r->second == Emplaceable()); 52 r = next(r, 2); 53 assert(r->first == 3); 54 assert(r->second == Emplaceable(5, 6)); 55 } 56 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 57 } 58
