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// explicit priority_queue(const Compare& comp, const container_type& c); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <queue> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16d3849253ce8da1dace4943cc064fe3036a4583daMarshall Clow#include <functional> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class C> 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnantC 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int n) 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c; 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < n; ++i) 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(i); 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::vector<int> v = make<std::vector<int> >(5); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::priority_queue<int, std::vector<int>, std::greater<int> > q(std::greater<int>(), v); 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.size() == 5); 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.top() == 0); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 35