]>
Commit | Line | Data |
---|---|---|
6bbd10c7 MA |
1 | // { dg-do run } |
2 | ||
3 | // 2005-2-18 Matt Austern <austern@apple.com> | |
4 | // | |
5 | // Copyright (C) 2005 Free Software Foundation, Inc. | |
6 | // | |
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) | |
11 | // any later version. | |
12 | // | |
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. | |
17 | // | |
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 | |
83f51799 | 20 | // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, |
6bbd10c7 MA |
21 | // USA. |
22 | ||
23 | // 6.3.4.3 unordered_set | |
24 | // find, equal_range, count | |
25 | ||
26 | #include <string> | |
27 | #include <iterator> | |
28 | #include <algorithm> | |
29 | #include <tr1/unordered_set> | |
30 | #include "testsuite_hooks.h" | |
31 | ||
32 | bool test __attribute__((unused)) = true; | |
33 | ||
34 | void test01() | |
35 | { | |
36 | typedef std::tr1::unordered_set<std::string> Set; | |
37 | Set s; | |
38 | VERIFY(s.empty()); | |
39 | ||
40 | std::pair<Set::iterator, bool> tmp = s.insert("grape"); | |
41 | Set::iterator i = tmp.first; | |
42 | ||
43 | Set::iterator i2 = s.find("grape"); | |
44 | VERIFY(i2 != s.end()); | |
45 | VERIFY(i2 == i); | |
46 | VERIFY(*i2 == "grape"); | |
47 | ||
48 | std::pair<Set::iterator, Set::iterator> p = s.equal_range("grape"); | |
49 | VERIFY(p.first == i2); | |
50 | VERIFY(std::distance(p.first, p.second) == 1); | |
51 | ||
52 | Set::iterator i3 = s.find("lime"); | |
53 | VERIFY(i3 == s.end()); | |
54 | ||
55 | std::pair<Set::iterator, Set::iterator> p2 = s.equal_range("lime"); | |
56 | VERIFY(p2.first == p2.second); | |
57 | ||
58 | VERIFY(s.count("grape") == 1); | |
59 | VERIFY(s.count("lime") == 0); | |
60 | } | |
61 | ||
62 | int main() | |
63 | { | |
64 | test01(); | |
65 | return 0; | |
66 | } |