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 InputIterator>
13 // priority_queue(InputIterator first, InputIterator last);
14
15 #include <queue>
16 #include <cassert>
17
main()18 int main()
19 {
20 int a[] = {3, 5, 2, 0, 6, 8, 1};
21 int* an = a + sizeof(a)/sizeof(a[0]);
22 std::priority_queue<int> q(a, an);
23 assert(q.size() == an - a);
24 assert(q.top() == 8);
25 }
26