blob: 766addaa892e5cd324c9c6d9cf60d9ee5304d72a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
// Copyright (C) 2005-2015 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/>.
// 6.3 Unordered associative containers
#include <tr1/unordered_set>
#include <string>
#include <testsuite_hooks.h>
// libstdc++/24054
void test01()
{
bool test __attribute__((unused)) = true;
typedef std::tr1::unordered_multiset<std::string> Set;
Set s;
s.insert("etaoin");
s.insert("etaoin");
s.insert("etaoin");
s.insert("shrdlu");
VERIFY( s.erase("") == 0 );
VERIFY( s.size() == 4 );
VERIFY( s.erase("etaoin") == 3 );
VERIFY( s.size() == 1 );
VERIFY( s.erase("shrdlu") == 1 );
VERIFY( s.size() == 0 );
}
int main()
{
test01();
return 0;
}
|
