erase_range.pass.cpp (2455B)
1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_set> 11 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13 // class Alloc = allocator<Value>> 14 // class unordered_set 15 16 // iterator erase(const_iterator first, const_iterator last) 17 18 #include <unordered_set> 19 #include <algorithm> 20 #include <cassert> 21 22 #include "min_allocator.h" 23 24 int main() 25 { 26 { 27 typedef std::unordered_set<int> C; 28 typedef int P; 29 P a[] = 30 { 31 P(1), 32 P(2), 33 P(3), 34 P(4), 35 P(1), 36 P(2) 37 }; 38 C c(a, a + sizeof(a)/sizeof(a[0])); 39 C::const_iterator i = c.find(2); 40 C::const_iterator j = next(i); 41 C::iterator k = c.erase(i, i); 42 assert(k == i); 43 assert(c.size() == 4); 44 assert(c.count(1) == 1); 45 assert(c.count(2) == 1); 46 assert(c.count(3) == 1); 47 assert(c.count(4) == 1); 48 49 k = c.erase(i, j); 50 assert(c.size() == 3); 51 assert(c.count(1) == 1); 52 assert(c.count(3) == 1); 53 assert(c.count(4) == 1); 54 55 k = c.erase(c.cbegin(), c.cend()); 56 assert(c.size() == 0); 57 assert(k == c.end()); 58 } 59 #if TEST_STD_VER >= 11 60 { 61 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; 62 typedef int P; 63 P a[] = 64 { 65 P(1), 66 P(2), 67 P(3), 68 P(4), 69 P(1), 70 P(2) 71 }; 72 C c(a, a + sizeof(a)/sizeof(a[0])); 73 C::const_iterator i = c.find(2); 74 C::const_iterator j = next(i); 75 C::iterator k = c.erase(i, i); 76 assert(k == i); 77 assert(c.size() == 4); 78 assert(c.count(1) == 1); 79 assert(c.count(2) == 1); 80 assert(c.count(3) == 1); 81 assert(c.count(4) == 1); 82 83 k = c.erase(i, j); 84 assert(c.size() == 3); 85 assert(c.count(1) == 1); 86 assert(c.count(3) == 1); 87 assert(c.count(4) == 1); 88 89 k = c.erase(c.cbegin(), c.cend()); 90 assert(c.size() == 0); 91 assert(k == c.end()); 92 } 93 #endif 94 }