Refactor ix86_expand_vecop_qihi2.
[gcc.git] / libstdc++-v3 / testsuite / 23_containers / unordered_set / cons / moveable.cc
blob721b01c54f2cd5351ec3402e51e3199430eb986e
1 // { dg-do run { target c++11 } }
3 // Copyright (C) 2007-2025 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
21 // NOTE: This makes use of the fact that we know how moveable
22 // is implemented on set (via swap). If the implementation changed
23 // this test may begin to fail.
25 #include <unordered_set>
26 #include <utility>
27 #include <testsuite_hooks.h>
29 int main()
31 std::unordered_set<int> a,b;
32 a.insert(2);
33 b.insert(1);
34 b = std::move(a);
35 VERIFY( b.find(2) != b.end() && a.find(1) == a.end() );
37 std::unordered_set<int> c(std::move(b));
38 VERIFY( c.find(2) != c.end() );
39 VERIFY( b.find(2) == b.end() );
40 return 0;