mirror of
https://github.com/autc04/Retro68.git
synced 2024-09-02 08:29:47 +00:00
44 lines
1.3 KiB
C++
44 lines
1.3 KiB
C++
// { dg-options "-std=gnu++0x" }
|
|
|
|
// Copyright (C) 2007-2014 Free Software Foundation, Inc.
|
|
//
|
|
// 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
|
|
// Free Software Foundation; either version 3, or (at your option)
|
|
// 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
|
|
// with this library; see the file COPYING3. If not see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
// NOTE: This makes use of the fact that we know how moveable
|
|
// is implemented on set (via swap). If the implementation changed
|
|
// this test may begin to fail.
|
|
|
|
#include <unordered_set>
|
|
#include <utility>
|
|
#include <testsuite_hooks.h>
|
|
|
|
int main()
|
|
{
|
|
bool test __attribute__((unused)) = true;
|
|
|
|
std::unordered_multiset<int> a,b;
|
|
a.insert(2);
|
|
b.insert(1);
|
|
b = std::move(a);
|
|
VERIFY( b.find(2) != b.end() && a.find(1) == a.end() );
|
|
|
|
std::unordered_multiset<int> c(std::move(b));
|
|
VERIFY( c.find(2) != c.end() );
|
|
VERIFY( b.find(2) == b.end() );
|
|
return 0;
|
|
}
|