//===----------------------------------------------------------------------===// // // 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_set // template // 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 #include #include "../../Emplaceable.h" #include "min_allocator.h" int main() { #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES { typedef std::unordered_set C; typedef C::iterator R; C c; C::const_iterator e = c.end(); R r = c.emplace_hint(e); assert(c.size() == 1); assert(*r == Emplaceable()); r = c.emplace_hint(e, Emplaceable(5, 6)); assert(c.size() == 2); assert(*r == Emplaceable(5, 6)); r = c.emplace_hint(r, 5, 6); assert(c.size() == 2); assert(*r == Emplaceable(5, 6)); } #if TEST_STD_VER >= 11 { typedef std::unordered_set, std::equal_to, min_allocator> C; typedef C::iterator R; C c; C::const_iterator e = c.end(); R r = c.emplace_hint(e); assert(c.size() == 1); assert(*r == Emplaceable()); r = c.emplace_hint(e, Emplaceable(5, 6)); assert(c.size() == 2); assert(*r == Emplaceable(5, 6)); r = c.emplace_hint(r, 5, 6); assert(c.size() == 2); assert(*r == Emplaceable(5, 6)); } #endif #if _LIBCPP_DEBUG >= 1 { typedef std::unordered_set C; typedef C::iterator R; C c1; C c2; R r = c1.emplace_hint(c2.begin(), 5, 6); assert(false); } #endif #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES }