]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/unordered_multiset/insert/multiset_single_move.cc
1 // { dg-options "-std=gnu++11" }
3 // 2010-10-27 Paolo Carlini <paolo.carlini@oracle.com>
5 // Copyright (C) 2010-2016 Free Software Foundation, Inc.
7 // This file is part of the GNU ISO C++ Library. This library is free
8 // software; you can redistribute it and/or modify it under the
9 // terms of the GNU General Public License as published by the
10 // Free Software Foundation; either version 3, or (at your option)
13 // This library is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License along
19 // with this library; see the file COPYING3. If not see
20 // <http://www.gnu.org/licenses/>.
22 // Single-element insert
25 #include <unordered_set>
26 #include <testsuite_hooks.h>
27 #include <testsuite_rvalref.h>
31 template <typename _Tp
>
33 get_nb_bucket_elems(const std::unordered_multiset
<_Tp
>& us
)
36 for (std::size_t b
= 0; b
!= us
.bucket_count(); ++b
)
37 nb
+= us
.bucket_size(b
);
44 bool test
__attribute__((unused
)) = true;
45 using __gnu_test::rvalstruct
;
47 typedef std::unordered_multiset
<rvalstruct
> Set
;
51 Set::iterator i
= s
.insert(rvalstruct(1));
52 VERIFY( s
.size() == 1 );
53 VERIFY( get_nb_bucket_elems(s
) == 1 );
54 VERIFY( std::distance(s
.begin(), s
.end()) == 1 );
55 VERIFY( i
== s
.begin() );
56 VERIFY( (*i
).val
== 1 );
61 bool test
__attribute__((unused
)) = true;
62 using __gnu_test::rvalstruct
;
64 typedef std::unordered_multiset
<rvalstruct
> Set
;
68 s
.insert(rvalstruct(2));
69 Set::iterator i
= s
.insert(rvalstruct(2));
70 VERIFY( s
.size() == 2 );
71 VERIFY( get_nb_bucket_elems(s
) == 2 );
72 VERIFY( std::distance(s
.begin(), s
.end()) == 2 );
73 VERIFY( (*i
).val
== 2 );
75 Set::iterator i2
= s
.begin();
77 VERIFY( i
== s
.begin() || i
== i2
);
78 VERIFY( (*(s
.begin())).val
== 2 && (*i2
).val
== 2 );