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 first iterator from another container
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 
25 int main()
26 {
27     {
28     int a1[] = {1, 2, 3};
29     std::list<int> l1(a1, a1+3);
30     std::list<int> l2(a1, a1+3);
31     std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
32     assert(false);
33     }
34 #if __cplusplus >= 201103L
35     {
36     int a1[] = {1, 2, 3};
37     std::list<int, min_allocator<int>> l1(a1, a1+3);
38     std::list<int, min_allocator<int>> l2(a1, a1+3);
39     std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
40     assert(false);
41     }
42 #endif
43 }
44 
45 #else
46 
47 int main()
48 {
49 }
50 
51 #endif
52