1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <queue>
11 
12 // template <class Alloc>
13 //   queue(const container_type& c, const Alloc& a);
14 
15 #include <queue>
16 #include <cassert>
17 
18 #include "../../../test_allocator.h"
19 
20 template <class C>
21 C
22 make(int n)
23 {
24     C c;
25     for (int i = 0; i < n; ++i)
26         c.push_back(i);
27     return c;
28 }
29 
30 typedef std::deque<int, test_allocator<int> > C;
31 
32 struct test
33     : public std::queue<int, C>
34 {
35     typedef std::queue<int, C> base;
36 
37     explicit test(const test_allocator<int>& a) : base(a) {}
38     test(const container_type& c, const test_allocator<int>& a) : base(c, a) {}
39 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
40     test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
41     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
42 #endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
43     test_allocator<int> get_allocator() {return c.get_allocator();}
44 };
45 
46 int main()
47 {
48     C d = make<C>(5);
49     test q(d, test_allocator<int>(4));
50     assert(q.get_allocator() == test_allocator<int>(4));
51     assert(q.size() == 5);
52     for (int i = 0; i < d.size(); ++i)
53     {
54         assert(q.front() == d[i]);
55         q.pop();
56     }
57 }
58