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 // priority_queue(const Compare& comp, container_type&& c,
14 // const Alloc& a);
15
16 #include <queue>
17 #include <cassert>
18
19 #include "test_allocator.h"
20
21 template <class C>
22 C
make(int n)23 make(int n)
24 {
25 C c;
26 for (int i = 0; i < n; ++i)
27 c.push_back(i);
28 return c;
29 }
30
31 template <class T>
32 struct test
33 : public std::priority_queue<T, std::vector<T, test_allocator<T> > >
34 {
35 typedef std::priority_queue<T, std::vector<T, test_allocator<T> > > base;
36 typedef typename base::container_type container_type;
37 typedef typename base::value_compare value_compare;
38
testtest39 explicit test(const test_allocator<int>& a) : base(a) {}
testtest40 test(const value_compare& comp, const test_allocator<int>& a)
41 : base(comp, a) {}
testtest42 test(const value_compare& comp, const container_type& c,
43 const test_allocator<int>& a) : base(comp, c, a) {}
44 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
testtest45 test(const value_compare& comp, container_type&& c,
46 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
testtest47 test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
48 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
get_allocatortest49 test_allocator<int> get_allocator() {return c.get_allocator();}
50
51 using base::c;
52 };
53
main()54 int main()
55 {
56 typedef std::vector<int, test_allocator<int> > C;
57 test<int> q(std::less<int>(), make<C>(5), test_allocator<int>(3));
58 assert(q.c.get_allocator() == test_allocator<int>(3));
59 assert(q.size() == 5);
60 assert(q.top() == 4);
61 }
62