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 // <deque> 11 12 // iterator insert(const_iterator p, initializer_list<value_type> il); 13 14 #include <deque> 15 #include <cassert> 16 17 #include "min_allocator.h" 18 19 int main() 20 { 21 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 22 { 23 std::deque<int> d(10, 1); 24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); 25 assert(d.size() == 14); 26 assert(i == d.begin() + 2); 27 assert(d[0] == 1); 28 assert(d[1] == 1); 29 assert(d[2] == 3); 30 assert(d[3] == 4); 31 assert(d[4] == 5); 32 assert(d[5] == 6); 33 assert(d[6] == 1); 34 assert(d[7] == 1); 35 assert(d[8] == 1); 36 assert(d[9] == 1); 37 assert(d[10] == 1); 38 assert(d[11] == 1); 39 assert(d[12] == 1); 40 assert(d[13] == 1); 41 } 42 { 43 std::deque<int, min_allocator<int>> d(10, 1); 44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); 45 assert(d.size() == 14); 46 assert(i == d.begin() + 2); 47 assert(d[0] == 1); 48 assert(d[1] == 1); 49 assert(d[2] == 3); 50 assert(d[3] == 4); 51 assert(d[4] == 5); 52 assert(d[5] == 6); 53 assert(d[6] == 1); 54 assert(d[7] == 1); 55 assert(d[8] == 1); 56 assert(d[9] == 1); 57 assert(d[10] == 1); 58 assert(d[11] == 1); 59 assert(d[12] == 1); 60 assert(d[13] == 1); 61 } 62 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 63 } 64
