//===----------------------------------------------------------------------===// // // ΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚThe LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator> // class unordered_set // iterator erase(const_iterator p) #include #include int main() { { typedef std::unordered_set 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() == 3); assert(c.count(1) == 1); assert(c.count(3) == 1); assert(c.count(4) == 1); } }