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