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_map>
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_map>
19 #include <cassert>
20 #include <exception>
21 #include <cstdlib>
22 
23 int main()
24 {
25     {
26     typedef std::pair<int, int> P;
27     P a1[] = {P(1, 1), P(2, 2), P(3, 3)};
28     std::unordered_map<int, int> l1(a1, a1+3);
29     std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
30     assert(false);
31     }
32 }
33 
34 #else
35 
36 int main()
37 {
38 }
39 
40 #endif
41