//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // <unordered_set> // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, // class Alloc = allocator<Value>> // class unordered_multiset // iterator erase(const_iterator p) #include <unordered_set> #include <cassert> int main() { { typedef std::unordered_multiset<int> C; typedef int P; P a[] = { P(1), P(2), P(3), P(4), P(1), P(2) }; C c(a, a + sizeof(a)/sizeof(a[0])); C::const_iterator i = c.find(2); C::iterator j = c.erase(i); assert(c.size() == 5); assert(c.count(1) == 2); assert(c.count(2) == 1); assert(c.count(3) == 1); assert(c.count(4) == 1); } }