assign_move.pass.cpp revision b64f8b07c104c6cc986570ac8ee0ed16a9f23976
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// priority_queue& operator=(priority_queue&& q); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <queue> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 17e764f0b648d00aaa80e1a542a44481dfba74f905Howard Hinnant#include "../../../MoveOnly.h" 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 1973d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class C> 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnantC 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int n) 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < n; ++i) 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(MoveOnly(i)); 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 3173d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 3573d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5)); 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::priority_queue<MoveOnly> q; 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant q = std::move(qo); 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.size() == 5); 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(q.top() == MoveOnly(4)); 4173d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 43