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_map 15 16 // template <class... Args> 17 // pair<iterator, bool> emplace(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_map<int, Emplaceable> C; 29 typedef std::pair<C::iterator, bool> R; 30 C c; 31 R r = c.emplace(3); 32 assert(r.second); 33 assert(c.size() == 1); 34 assert(r.first->first == 3); 35 assert(r.first->second == Emplaceable()); 36 37 r = c.emplace(std::pair<const int, Emplaceable>(4, Emplaceable(5, 6))); 38 assert(r.second); 39 assert(c.size() == 2); 40 assert(r.first->first == 4); 41 assert(r.first->second == Emplaceable(5, 6)); 42 43 r = c.emplace(std::piecewise_construct, std::forward_as_tuple(5), 44 std::forward_as_tuple(6, 7)); 45 assert(r.second); 46 assert(c.size() == 3); 47 assert(r.first->first == 5); 48 assert(r.first->second == Emplaceable(6, 7)); 49 } 50 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 51 } 52
