4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
67 lines
1.7 KiB
C++
67 lines
1.7 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 p, initializer_list<value_type> il);
|
|
|
|
#include <list>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
{
|
|
std::list<int> d(10, 1);
|
|
std::list<int>::iterator i = d.insert(next(d.cbegin(), 2), {3, 4, 5, 6});
|
|
assert(d.size() == 14);
|
|
assert(i == next(d.begin(), 2));
|
|
i = d.begin();
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 3);
|
|
assert(*i++ == 4);
|
|
assert(*i++ == 5);
|
|
assert(*i++ == 6);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::list<int, min_allocator<int>> d(10, 1);
|
|
std::list<int, min_allocator<int>>::iterator i = d.insert(next(d.cbegin(), 2), {3, 4, 5, 6});
|
|
assert(d.size() == 14);
|
|
assert(i == next(d.begin(), 2));
|
|
i = d.begin();
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 3);
|
|
assert(*i++ == 4);
|
|
assert(*i++ == 5);
|
|
assert(*i++ == 6);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
assert(*i++ == 1);
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
}
|