| //===----------------------------------------------------------------------===// |
| // |
| // 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, size_type n, const value_type& x); |
| |
| #if _LIBCPP_DEBUG2 >= 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, 4, 4, 4, 4, 2, 3}; |
| std::list<int> l1(a1, a1+3); |
| std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4); |
| assert(i == next(l1.begin())); |
| assert(l1 == std::list<int>(a2, a2+8)); |
| throw_next = 4; |
| int save_count = count; |
| try |
| { |
| i = l1.insert(i, 5, 5); |
| assert(false); |
| } |
| catch (...) |
| { |
| } |
| throw_next = 0xFFFF; |
| assert(save_count == count); |
| assert(l1 == std::list<int>(a2, a2+8)); |
| } |
| #if _LIBCPP_DEBUG2 >= 1 |
| { |
| std::list<int> c1(100); |
| std::list<int> c2; |
| std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); |
| assert(false); |
| } |
| #endif |
| #if __cplusplus >= 201103L |
| { |
| int a1[] = {1, 2, 3}; |
| int a2[] = {1, 4, 4, 4, 4, 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()), 5, 4); |
| assert(i == next(l1.begin())); |
| assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8))); |
| throw_next = 4; |
| int save_count = count; |
| try |
| { |
| i = l1.insert(i, 5, 5); |
| assert(false); |
| } |
| catch (...) |
| { |
| } |
| throw_next = 0xFFFF; |
| assert(save_count == count); |
| assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8))); |
| } |
| #if _LIBCPP_DEBUG2 >= 1 |
| { |
| std::list<int, min_allocator<int>> c1(100); |
| std::list<int, min_allocator<int>> c2; |
| std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); |
| assert(false); |
| } |
| #endif |
| #endif |
| } |