4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
69 lines
2.1 KiB
C++
69 lines
2.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(const forward_list& x);
|
|
|
|
#include <forward_list>
|
|
#include <cassert>
|
|
#include <iterator>
|
|
|
|
#include "../../../test_allocator.h"
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef int T;
|
|
typedef test_allocator<int> A;
|
|
typedef std::forward_list<T, A> C;
|
|
const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
|
C c0(std::begin(t), std::end(t), A(10));
|
|
C c = c0;
|
|
unsigned n = 0;
|
|
for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
|
|
assert(*i == n);
|
|
assert(n == std::end(t) - std::begin(t));
|
|
assert(c == c0);
|
|
assert(c.get_allocator() == A(10));
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_ADVANCED_SFINAE
|
|
{
|
|
typedef int T;
|
|
typedef other_allocator<int> A;
|
|
typedef std::forward_list<T, A> C;
|
|
const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
|
C c0(std::begin(t), std::end(t), A(10));
|
|
C c = c0;
|
|
unsigned n = 0;
|
|
for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
|
|
assert(*i == n);
|
|
assert(n == std::end(t) - std::begin(t));
|
|
assert(c == c0);
|
|
assert(c.get_allocator() == A(-2));
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_ADVANCED_SFINAE
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef int T;
|
|
typedef min_allocator<int> A;
|
|
typedef std::forward_list<T, A> C;
|
|
const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
|
C c0(std::begin(t), std::end(t), A());
|
|
C c = c0;
|
|
unsigned n = 0;
|
|
for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
|
|
assert(*i == n);
|
|
assert(n == std::end(t) - std::begin(t));
|
|
assert(c == c0);
|
|
assert(c.get_allocator() == A());
|
|
}
|
|
#endif
|
|
}
|