]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/tr1/6_containers/unordered_multiset/find/multiset1.cc
3 // 2005-2-18 Matt Austern <austern@apple.com>
5 // Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free
20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
23 // 6.3.4.5 unordered_set
24 // find, equal_range, count
29 #include <tr1/unordered_set>
30 #include "testsuite_hooks.h"
32 bool test
__attribute__((unused
)) = true;
36 typedef std::tr1::unordered_multiset
<std::string
> Set
;
44 Set::iterator i2
= s
.find("banana");
45 VERIFY(i2
!= s
.end());
46 VERIFY(*i2
== "banana");
48 std::pair
<Set::iterator
, Set::iterator
> p
= s
.equal_range("grape");
49 VERIFY(std::distance(p
.first
, p
.second
) == 2);
50 Set::iterator i3
= p
.first
;
52 VERIFY(*p
.first
== "grape");
53 VERIFY(*i3
== "grape");
55 Set::iterator i4
= s
.find("lime");
56 VERIFY(i4
== s
.end());
58 VERIFY(s
.count("grape") == 2);
59 VERIFY(s
.count("banana") == 1);
60 VERIFY(s
.count("lime") == 0);