blob: e0382a10db4922f1736ceb921c8217dd58d4f033 [file] [log] [blame]
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// <forward_list>
// void assign(initializer_list<value_type> il);
#include <forward_list>
#include <cassert>
#include <iterator>
#include "min_allocator.h"
int main()
{
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
{
typedef int T;
typedef std::forward_list<T> C;
const T t1[] = {10, 11, 12, 13};
C c(std::begin(t1), std::end(t1));
c.assign({0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
int n = 0;
for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
assert(*i == n);
assert(n == 10);
}
{
typedef int T;
typedef std::forward_list<T> C;
const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
C c(std::begin(t1), std::end(t1));
c.assign({10, 11, 12, 13});
int n = 0;
for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
assert(*i == 10+n);
assert(n == 4);
}
#if __cplusplus >= 201103L
{
typedef int T;
typedef std::forward_list<T, min_allocator<T>> C;
const T t1[] = {10, 11, 12, 13};
C c(std::begin(t1), std::end(t1));
c.assign({0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
int n = 0;
for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
assert(*i == n);
assert(n == 10);
}
{
typedef int T;
typedef std::forward_list<T, min_allocator<T>> C;
const T t1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
C c(std::begin(t1), std::end(t1));
c.assign({10, 11, 12, 13});
int n = 0;
for (C::const_iterator i = c.cbegin(); i != c.cend(); ++i, ++n)
assert(*i == 10+n);
assert(n == 4);
}
#endif
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
}