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
|
//===----------------------------------------------------------------------===//
//
// 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>
// priority_queue(const priority_queue& q, const Alloc& a);
#include <queue>
#include <cassert>
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(i);
return c;
}
#include "test_allocator.h"
template <class T>
struct test
: public std::priority_queue<T, std::vector<T, test_allocator<T> > >
{
typedef std::priority_queue<T, std::vector<T, test_allocator<T> > > base;
typedef typename base::container_type container_type;
typedef typename base::value_compare value_compare;
explicit test(const test_allocator<int>& a) : base(a) {}
test(const value_compare& comp, const test_allocator<int>& a)
: base(comp, c, a) {}
test(const value_compare& comp, const container_type& c,
const test_allocator<int>& a) : base(comp, c, a) {}
test(const test& q, const test_allocator<int>& a) : base(q, a) {}
test_allocator<int> get_allocator() {return c.get_allocator();}
using base::c;
};
int main()
{
test<int> qo(std::less<int>(),
make<std::vector<int, test_allocator<int> > >(5),
test_allocator<int>(2));
test<int> q(qo, test_allocator<int>(6));
assert(q.size() == 5);
assert(q.c.get_allocator() == test_allocator<int>(6));
assert(q.top() == int(4));
}
|
