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 p) 17 18 #include <unordered_set> 19 #include <cassert> 20 21 #include "min_allocator.h" 22 23 struct TemplateConstructor 24 { 25 template<typename T> 26 TemplateConstructor (const T&) {} 27 }; 28 29 bool operator==(const TemplateConstructor&, const TemplateConstructor&) { return false; } 30 struct Hash { size_t operator() (const TemplateConstructor &) const { return 0; } }; 31 32 int main() 33 { 34 { 35 typedef std::unordered_set<int> C; 36 typedef int P; 37 P a[] = 38 { 39 P(1), 40 P(2), 41 P(3), 42 P(4), 43 P(1), 44 P(2) 45 }; 46 C c(a, a + sizeof(a)/sizeof(a[0])); 47 C::const_iterator i = c.find(2); 48 C::iterator j = c.erase(i); 49 assert(c.size() == 3); 50 assert(c.count(1) == 1); 51 assert(c.count(3) == 1); 52 assert(c.count(4) == 1); 53 } 54 #if __cplusplus >= 201103L 55 { 56 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; 57 typedef int P; 58 P a[] = 59 { 60 P(1), 61 P(2), 62 P(3), 63 P(4), 64 P(1), 65 P(2) 66 }; 67 C c(a, a + sizeof(a)/sizeof(a[0])); 68 C::const_iterator i = c.find(2); 69 C::iterator j = c.erase(i); 70 assert(c.size() == 3); 71 assert(c.count(1) == 1); 72 assert(c.count(3) == 1); 73 assert(c.count(4) == 1); 74 } 75 #endif 76 #if __cplusplus >= 201402L 77 { 78 // This is LWG #2059 79 typedef TemplateConstructor T; 80 typedef std::unordered_set<T, Hash> C; 81 typedef C::iterator I; 82 83 C m; 84 T a{0}; 85 I it = m.find(a); 86 if (it != m.end()) 87 m.erase(it); 88 } 89 #endif 90 } 91
