74 lines
2.3 KiB
C++
74 lines
2.3 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(forward_list&& x, const allocator_type& a);
|
||
|
|
||
|
#include <forward_list>
|
||
|
#include <cassert>
|
||
|
#include <iterator>
|
||
|
|
||
|
#include "../../../test_allocator.h"
|
||
|
#include "../../../MoveOnly.h"
|
||
|
#include "../../../min_allocator.h"
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||
|
{
|
||
|
typedef MoveOnly T;
|
||
|
typedef test_allocator<int> A;
|
||
|
typedef std::forward_list<T, A> C;
|
||
|
T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
||
|
typedef std::move_iterator<T*> I;
|
||
|
C c0(I(std::begin(t)), I(std::end(t)), A(10));
|
||
|
C c(std::move(c0), A(10));
|
||
|
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(c0.empty());
|
||
|
assert(c.get_allocator() == A(10));
|
||
|
}
|
||
|
{
|
||
|
typedef MoveOnly T;
|
||
|
typedef test_allocator<int> A;
|
||
|
typedef std::forward_list<T, A> C;
|
||
|
T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
||
|
typedef std::move_iterator<T*> I;
|
||
|
C c0(I(std::begin(t)), I(std::end(t)), A(10));
|
||
|
C c(std::move(c0), A(9));
|
||
|
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(!c0.empty());
|
||
|
assert(c.get_allocator() == A(9));
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
typedef MoveOnly T;
|
||
|
typedef min_allocator<int> A;
|
||
|
typedef std::forward_list<T, A> C;
|
||
|
T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
||
|
typedef std::move_iterator<T*> I;
|
||
|
C c0(I(std::begin(t)), I(std::end(t)), A());
|
||
|
C c(std::move(c0), A());
|
||
|
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(c0.empty());
|
||
|
assert(c.get_allocator() == A());
|
||
|
}
|
||
|
#endif
|
||
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||
|
}
|