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 Alloc> 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// priority_queue(priority_queue&& q, const Alloc& a); 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <queue> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18e764f0b648d00aaa80e1a542a44481dfba74f905Howard Hinnant#include "../../../MoveOnly.h" 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 2073d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class C> 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnantC 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int n) 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c; 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < n; ++i) 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(MoveOnly(i)); 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 321b92188a82b01e76ac6e8ad5f997293c2a078adcMarshall Clow#include "test_allocator.h" 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class T> 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantstruct test 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant : public std::priority_queue<T, std::vector<T, test_allocator<T> > > 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::priority_queue<T, std::vector<T, test_allocator<T> > > base; 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename base::container_type container_type; 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef typename base::value_compare value_compare; 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant explicit test(const test_allocator<int>& a) : base(a) {} 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(const value_compare& comp, const test_allocator<int>& a) 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant : base(comp, c, a) {} 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(const value_compare& comp, const container_type& c, 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const test_allocator<int>& a) : base(comp, c, a) {} 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(const value_compare& comp, container_type&& c, 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const test_allocator<int>& a) : base(comp, std::move(c), a) {} 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {} 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test_allocator<int> get_allocator() {return c.get_allocator();} 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant using base::c; 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 5573d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 5973d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test<MoveOnly> qo(std::less<MoveOnly>(), 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant make<std::vector<MoveOnly, test_allocator<MoveOnly> > >(5), 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test_allocator<MoveOnly>(2)); 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test<MoveOnly> q(std::move(qo), test_allocator<MoveOnly>(6)); 64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.size() == 5); 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.c.get_allocator() == test_allocator<MoveOnly>(6)); 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.top() == MoveOnly(4)); 6773d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 68bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 69