//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // <unordered_set> // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, // class Alloc = allocator<Value>> // class unordered_multiset // iterator insert(const_iterator p, value_type&& x); #include <unordered_set> #include <cassert> #include "../../MoveOnly.h" int main() { { typedef std::unordered_multiset<double> C; typedef C::iterator R; typedef double P; C c; C::const_iterator e = c.end(); R r = c.insert(e, P(3.5)); assert(c.size() == 1); assert(*r == 3.5); r = c.insert(r, P(3.5)); assert(c.size() == 2); assert(*r == 3.5); r = c.insert(e, P(4.5)); assert(c.size() == 3); assert(*r == 4.5); r = c.insert(e, P(5.5)); assert(c.size() == 4); assert(*r == 5.5); } #ifdef _LIBCPP_MOVE { typedef std::unordered_multiset<MoveOnly> C; typedef C::iterator R; typedef MoveOnly P; C c; C::const_iterator e = c.end(); R r = c.insert(e, P(3)); assert(c.size() == 1); assert(*r == 3); r = c.insert(r, P(3)); assert(c.size() == 2); assert(*r == 3); r = c.insert(e, P(4)); assert(c.size() == 3); assert(*r == 4); r = c.insert(e, P(5)); assert(c.size() == 4); assert(*r == 5); } #endif }