1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// <queue>
// template <class Alloc>
// queue(queue&& q, const Alloc& a);
#include <queue>
#include <cassert>
#include "test_allocator.h"
#include "../../../MoveOnly.h"
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(MoveOnly(i));
return c;
}
typedef std::deque<MoveOnly, test_allocator<MoveOnly> > C;
template <class T>
struct test
: public std::queue<T, C>
{
typedef std::queue<T, C> base;
typedef test_allocator<MoveOnly> allocator_type;
typedef typename base::container_type container_type;
explicit test(const allocator_type& a) : base(a) {}
test(const container_type& c, const allocator_type& a) : base(c, a) {}
test(container_type&& c, const allocator_type& a) : base(std::move(c), a) {}
test(test&& q, const allocator_type& a) : base(std::move(q), a) {}
allocator_type get_allocator() {return this->c.get_allocator();}
};
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
int main()
{
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test<MoveOnly> q(make<C>(5), test_allocator<MoveOnly>(4));
test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5));
assert(q2.get_allocator() == test_allocator<MoveOnly>(5));
assert(q2.size() == 5);
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}
|