4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
45 lines
1.1 KiB
C++
45 lines
1.1 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <forward_list>
|
|
|
|
// forward_list(size_type n, const value_type& v);
|
|
|
|
#include <forward_list>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef int T;
|
|
typedef std::forward_list<T> C;
|
|
T v(6);
|
|
unsigned N = 10;
|
|
C c(N, v);
|
|
unsigned n = 0;
|
|
for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
|
|
assert(*i == v);
|
|
assert(n == N);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef int T;
|
|
typedef std::forward_list<T, min_allocator<T>> C;
|
|
T v(6);
|
|
unsigned N = 10;
|
|
C c(N, v);
|
|
unsigned n = 0;
|
|
for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
|
|
assert(*i == v);
|
|
assert(n == N);
|
|
}
|
|
#endif
|
|
}
|