4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
110 lines
2.5 KiB
C++
110 lines
2.5 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>
|
|
|
|
// iterator insert(const_iterator position, const value_type& x);
|
|
|
|
#if _LIBCPP_DEBUG >= 1
|
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
|
#endif
|
|
|
|
#include <list>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
int throw_next = 0xFFFF;
|
|
int count = 0;
|
|
|
|
void* operator new(std::size_t s) throw(std::bad_alloc)
|
|
{
|
|
if (throw_next == 0)
|
|
throw std::bad_alloc();
|
|
--throw_next;
|
|
++count;
|
|
return std::malloc(s);
|
|
}
|
|
|
|
void operator delete(void* p) throw()
|
|
{
|
|
--count;
|
|
std::free(p);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a1[] = {1, 2, 3};
|
|
int a2[] = {1, 4, 2, 3};
|
|
std::list<int> l1(a1, a1+3);
|
|
std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 4);
|
|
assert(i == next(l1.begin()));
|
|
assert(l1.size() == 4);
|
|
assert(distance(l1.begin(), l1.end()) == 4);
|
|
assert(l1 == std::list<int>(a2, a2+4));
|
|
throw_next = 0;
|
|
int save_count = count;
|
|
try
|
|
{
|
|
i = l1.insert(i, 5);
|
|
assert(false);
|
|
}
|
|
catch (...)
|
|
{
|
|
}
|
|
throw_next = 0xFFFF;
|
|
assert(save_count == count);
|
|
assert(l1 == std::list<int>(a2, a2+4));
|
|
}
|
|
#if _LIBCPP_DEBUG >= 1
|
|
{
|
|
std::list<int> v1(3);
|
|
std::list<int> v2(3);
|
|
int i = 4;
|
|
v1.insert(v2.begin(), i);
|
|
assert(false);
|
|
}
|
|
#endif
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
int a1[] = {1, 2, 3};
|
|
int a2[] = {1, 4, 2, 3};
|
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
|
std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 4);
|
|
assert(i == next(l1.begin()));
|
|
assert(l1.size() == 4);
|
|
assert(distance(l1.begin(), l1.end()) == 4);
|
|
assert((l1 == std::list<int, min_allocator<int>>(a2, a2+4)));
|
|
throw_next = 0;
|
|
int save_count = count;
|
|
try
|
|
{
|
|
i = l1.insert(i, 5);
|
|
assert(false);
|
|
}
|
|
catch (...)
|
|
{
|
|
}
|
|
throw_next = 0xFFFF;
|
|
assert(save_count == count);
|
|
assert((l1 == std::list<int, min_allocator<int>>(a2, a2+4)));
|
|
}
|
|
#if _LIBCPP_DEBUG >= 1
|
|
{
|
|
std::list<int, min_allocator<int>> v1(3);
|
|
std::list<int, min_allocator<int>> v2(3);
|
|
int i = 4;
|
|
v1.insert(v2.begin(), i);
|
|
assert(false);
|
|
}
|
|
#endif
|
|
#endif
|
|
}
|