blob: 073d2407512b1aef87d916c5806ac124bd161bfc (
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
53
|
// Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// 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;
}
|