Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. 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 | |
| 21 | int main() |
| 22 | { |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 23 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 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)); |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 31 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 32 | } |