1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <queue> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class InputIterator> 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// priority_queue(InputIterator first, InputIterator last); 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <queue> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a[] = {3, 5, 2, 0, 6, 8, 1}; 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int* an = a + sizeof(a)/sizeof(a[0]); 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::priority_queue<int> q(a, an); 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.size() == an - a); 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.top() == 8); 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 26