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 // Call erase(const_iterator first, const_iterator last); with a bad range 13 14 #if _LIBCPP_DEBUG >= 1 15 16 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 17 18 #include <unordered_set> 19 #include <cassert> 20 #include <exception> 21 #include <cstdlib> 22 23 int main() 24 { 25 { 26 int a1[] = {1, 2, 3}; 27 std::unordered_set<int> l1(a1, a1+3); 28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin()); 29 assert(false); 30 } 31 } 32 33 #else 34 35 int main() 36 { 37 } 38 39 #endif 40
