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 // <list>
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 <list>
19 #include <cassert>
20 #include <exception>
21 #include <cstdlib>
22
23 #include "min_allocator.h"
24
main()25 int main()
26 {
27 {
28 int a1[] = {1, 2, 3};
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
31 assert(false);
32 }
33 #if __cplusplus >= 201103L
34 {
35 int a1[] = {1, 2, 3};
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
38 assert(false);
39 }
40 #endif
41 }
42
43 #else
44
main()45 int main()
46 {
47 }
48
49 #endif
50