stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 21:54:41 +00:00
|
|
|
// { dg-options "-std=gnu++0x" }
|
|
|
|
|
2013-02-03 17:54:05 +00:00
|
|
|
// Copyright (C) 2007-2013 Free Software Foundation, Inc.
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 21:54:41 +00:00
|
|
|
//
|
|
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
|
|
// software; you can redistribute it and/or modify it under the
|
|
|
|
// terms of the GNU General Public License as published by the
|
2009-04-09 17:00:19 +02:00
|
|
|
// Free Software Foundation; either version 3, or (at your option)
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 21:54:41 +00:00
|
|
|
// any later version.
|
|
|
|
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU General Public License for more details.
|
|
|
|
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
2009-04-09 17:00:19 +02:00
|
|
|
// with this library; see the file COPYING3. If not see
|
|
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 21:54:41 +00:00
|
|
|
|
|
|
|
// NOTE: This makes use of the fact that we know how moveable
|
|
|
|
// is implemented on vector (via swap). If the implementation changed
|
|
|
|
// this test may begin to fail.
|
|
|
|
|
|
|
|
#include <queue>
|
|
|
|
#include <utility>
|
|
|
|
#include <testsuite_hooks.h>
|
|
|
|
|
|
|
|
void test01()
|
|
|
|
{
|
|
|
|
bool test __attribute__((unused)) = true;
|
|
|
|
|
|
|
|
std::queue<int> a,b;
|
|
|
|
a.push(1);
|
|
|
|
b = std::move(a);
|
|
|
|
VERIFY( b.size() == 1 && b.front() == 1 && a.size() == 0 );
|
|
|
|
|
|
|
|
std::queue<int> c(std::move(b));
|
|
|
|
VERIFY( c.size() == 1 && c.front() == 1 );
|
|
|
|
VERIFY( b.size() == 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(void)
|
|
|
|
{
|
|
|
|
test01();
|
|
|
|
return 0;
|
|
|
|
}
|