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 // const Compare& comp, container_type&& c);
15
16 #include <queue>
17 #include <cassert>
18
19 #include "MoveOnly.h"
20
main()21 int main()
22 {
23 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
24 int a[] = {3, 5, 2, 0, 6, 8, 1};
25 const int n = sizeof(a)/sizeof(a[0]);
26 std::priority_queue<MoveOnly> q(a+n/2, a+n,
27 std::less<MoveOnly>(),
28 std::vector<MoveOnly>(a, a+n/2));
29 assert(q.size() == n);
30 assert(q.top() == MoveOnly(8));
31 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
32 }
33