//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator>> // class unordered_map // template // pair emplace(Args&&... args); #include #include #include "../../../Emplaceable.h" #include "min_allocator.h" int main() { #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES { typedef std::unordered_map C; typedef std::pair R; C c; R r = c.emplace(std::piecewise_construct, std::forward_as_tuple(3), std::forward_as_tuple()); assert(r.second); assert(c.size() == 1); assert(r.first->first == 3); assert(r.first->second == Emplaceable()); r = c.emplace(std::pair(4, Emplaceable(5, 6))); assert(r.second); assert(c.size() == 2); assert(r.first->first == 4); assert(r.first->second == Emplaceable(5, 6)); r = c.emplace(std::piecewise_construct, std::forward_as_tuple(5), std::forward_as_tuple(6, 7)); assert(r.second); assert(c.size() == 3); assert(r.first->first == 5); assert(r.first->second == Emplaceable(6, 7)); } #if __cplusplus >= 201103L { typedef std::unordered_map, std::equal_to, min_allocator>> C; typedef std::pair R; C c; R r = c.emplace(std::piecewise_construct, std::forward_as_tuple(3), std::forward_as_tuple()); assert(r.second); assert(c.size() == 1); assert(r.first->first == 3); assert(r.first->second == Emplaceable()); r = c.emplace(std::pair(4, Emplaceable(5, 6))); assert(r.second); assert(c.size() == 2); assert(r.first->first == 4); assert(r.first->second == Emplaceable(5, 6)); r = c.emplace(std::piecewise_construct, std::forward_as_tuple(5), std::forward_as_tuple(6, 7)); assert(r.second); assert(c.size() == 3); assert(r.first->first == 5); assert(r.first->second == Emplaceable(6, 7)); } #endif #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES }