52 lines
1.2 KiB
C++
52 lines
1.2 KiB
C++
|
//===----------------------------------------------------------------------===//
|
||
|
//
|
||
|
// The LLVM Compiler Infrastructure
|
||
|
//
|
||
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
||
|
// Source Licenses. See LICENSE.TXT for details.
|
||
|
//
|
||
|
//===----------------------------------------------------------------------===//
|
||
|
|
||
|
// <list>
|
||
|
|
||
|
// Call erase(const_iterator first, const_iterator last); with first iterator from another container
|
||
|
|
||
|
#if _LIBCPP_DEBUG >= 1
|
||
|
|
||
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
||
|
|
||
|
#include <list>
|
||
|
#include <cassert>
|
||
|
#include <exception>
|
||
|
#include <cstdlib>
|
||
|
|
||
|
#include "../../../min_allocator.h"
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
{
|
||
|
int a1[] = {1, 2, 3};
|
||
|
std::list<int> l1(a1, a1+3);
|
||
|
std::list<int> l2(a1, a1+3);
|
||
|
std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
||
|
assert(false);
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
int a1[] = {1, 2, 3};
|
||
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
||
|
std::list<int, min_allocator<int>> l2(a1, a1+3);
|
||
|
std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
||
|
assert(false);
|
||
|
}
|
||
|
#endif
|
||
|
}
|
||
|
|
||
|
#else
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
}
|
||
|
|
||
|
#endif
|